gambas-source-code/main/share/gb_code.h
Benoît Minisini bd322efa9c [DEVELOPMENT ENVIRONMENT]
* BUG: Use TextEdit.RichText insted of TextEdit.Text.
* BUG: END SUB can be the end of a method. The class analyze now takes 
  that into account.

[HELP]
* BUG: Fixed the generated treeview.

[COMPILER]
* OPT: The NOT operator used just at the beginning of a conditional 
  expression is optimized. Consequently, an expression like 'IF NOT 2' is 
  now equivalent to 'IF 2 = 0' and not to 'IF (NOT 2) <> 0' as before. In
  other words, the boolean conversion is now done before the NOT, and not 
  after. The following instructions are concerned: IF, WHILE, UNTIL.
* NEW: BYREF is new keyword that is a more readable synonymous of '@'.

[GB.DB.FORM]
* BUG: Correctly manage data controls inside TabStrip-like containers.
* BUG: Setting the focus on a non-initialized DataControl does not raise 
  an error anymore.

[GB.GTK]
* BUG: HSplitter.Layout and VSplitter.Layout now work correctly. It is a 
  list of children widths, hidden children having a zero width.
* BUG: Window arrangement is done before the Open event is raised, as in 
  gb.qt.
* BUG: Keyboard, focus and mouse events now work correctly on Window and 
  DrawingArea controls.

[GB.QT]
* BUG: HSplitter.Layout and VSplitter.Layout now work correctly. It is a 
  list of children widths, hidden children having a zero width.
* BUG: Many warning fixes.
* BUG: Now the Control.Visible property works like in gb.gtk, i.e. it 
  returns if the control was not explicitely hidden.


git-svn-id: svn://localhost/gambas/trunk@1060 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2008-02-06 00:25:48 +00:00

136 lines
3.4 KiB
C

/***************************************************************************
code.h
P-code assembler
(c) 2000-2007 Benoit Minisini <gambas@users.sourceforge.net>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 1, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
***************************************************************************/
#ifndef __GB_CODE_H
#define __GB_CODE_H
#include "gb_pcode.h"
#ifndef __CODE_C
EXTERN short CODE_stack_usage;
#endif
/* Number of instruction added to a function code buffer at once. Must be a power of 2 */
#define CODE_INSTR_INC 256
#ifdef PROJECT_EXEC
void CODE_begin_function(void);
void CODE_end_function(void);
#else
#include "gb_common_swap.h"
void CODE_begin_function(FUNCTION *func);
void CODE_end_function(FUNCTION *func);
bool CODE_popify_last(void);
bool CODE_check_statement_last(void);
bool CODE_check_pop_local_last(short *local);
bool CODE_check_jump_not(void);
bool CODE_check_varptr(void);
void CODE_allow_break(void);
void CODE_break(void);
void CODE_pop_local(short num);
//void CODE_pop_param(short num);
void CODE_pop_global(short global, bool is_static);
void CODE_pop_symbol(short symbol);
void CODE_pop_unknown(short symbol);
void CODE_pop_optional(short num);
//void CODE_push_special(short spec);
void CODE_push_event(short event);
void CODE_push_extern(short index);
void CODE_jump(void);
void CODE_jump_first(short local);
void CODE_jump_next(void);
void CODE_jump_if_true(void);
void CODE_jump_if_false(void);
void CODE_jump_length(short src, short dst);
void CODE_first(short local);
void CODE_next(bool drop);
void CODE_new(ushort nparam, bool array, bool event);
void CODE_quit(void);
void CODE_stop(void);
void CODE_event(bool on);
void CODE_stop_event(void);
void CODE_try(void);
void CODE_end_try(void);
void CODE_catch(void);
void CODE_pop_ctrl(short num);
#endif /* PROJECT_COMP */
int CODE_get_current_pos(void);
void CODE_ignore_next_stack_usage(void);
void CODE_dump(PCODE *code, int count);
void CODE_push_number(int value);
void CODE_push_const(short value);
void CODE_push_local(short num);
//void CODE_push_param(short num);
void CODE_push_array(short nparam);
void CODE_push_global(short global, bool is_static, bool is_function);
void CODE_push_symbol(short symbol);
void CODE_push_unknown(short symbol);
void CODE_push_class(short class);
void CODE_op(short op, short nparam, bool fixed);
void CODE_push_me(bool);
void CODE_push_super(bool);
void CODE_push_last(void);
void CODE_push_null(void);
void CODE_push_boolean(bool value);
void CODE_dup(void);
void CODE_return(int return_value);
void CODE_push_char(char car);
void CODE_push_void(void);
void CODE_subr(short subr, short nparam, short optype, bool output, bool fixed);
void CODE_subr_output(short subr, short nparam, int output);
void CODE_call(short nparam);
void CODE_call_byref(short nparam, uint64_t byref);
void CODE_drop(void);
void CODE_push_return(void);
#endif