--- parser3/src/main/compile_tools.C 2001/02/21 06:21:19 1.3 +++ parser3/src/main/compile_tools.C 2009/05/23 05:23:03 1.65 @@ -1,42 +1,88 @@ -/* - $Id: compile_tools.C,v 1.3 2001/02/21 06:21:19 paf Exp $ +/** @file + Parser: compiler support helper functions. + + Copyright (c) 2001-2009 ArtLebedev Group (http://www.artlebedev.com) + Author: Alexandr Petrosian (http://paf.design.ru) */ +static const char * const IDENT_COMPILE_TOOLS_C="$Date: 2009/05/23 05:23:03 $"; + #include "compile_tools.h" #include "pa_string.h" #include "pa_array.h" #include "pa_exception.h" +#include "pa_vstring.h" +#include "pa_vdouble.h" -Array *L(String *string) { - // empty ops array - Array *result=N(&string->pool()); +Value* LA2V(ArrayOperation& literal_string_array, int offset, OP::OPCODE code) { + return literal_string_array[offset+0].code==code?literal_string_array[offset+2/*skip opcode&origin*/].value + :0; +} - // append OP_STRING - Operation op; op.code=OP_STRING; - *result+=reinterpret_cast(op.cast); +void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) { + assert(literal_array[0].code==OP::OP_VALUE); + VString& vstring=*static_cast(literal_array[2/*opcode+origin*/].value); + if(isdigit(vstring.string().first_char())) + literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result()); +} - // append 'string' - *result+=string; +void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) { + assert(literal_string_array[0].code==OP::OP_VALUE); + static_cast(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value); +} + +void changetail_or_append(ArrayOperation& opcodes, + OP::OPCODE find, bool with_argument, OP::OPCODE replace, OP::OPCODE notfound) { + int tail=opcodes.count()-(with_argument?2:1); + if(tail>=0) { + Operation& op=opcodes.get_ref(tail); + if(op.code==find) { + op.code=replace; + return; + } + } - return result; + opcodes+=Operation(notfound); } -const String *LA2S(Array *literal_string_array) { - return static_cast(literal_string_array->get(1)); + +bool maybe_change_first_opcode(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE replace, bool strict) { + if(opcodes[0].code==find){ + opcodes.put(0, replace); + return true; + } + if(strict) + assert(opcodes[0].code==find); + + return false; +} + + +bool maybe_change_first_opcode(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE last, OP::OPCODE replace) { + if(opcodes[0].code==find && opcodes[opcodes.count()-1].code==last){ + opcodes.put(0, replace); + return true; + } + return false; } -void push_LS(struct parse_control *pc) { - if(pc->spstack[pc->sp++]=pc->ls; pc->ls=LS_VAR_NAME_SIMPLE; +void push_LS(Parse_control& pc, lexical_state new_state) { + if(pc.ls_sp(pc->pool))->exception().raise(0, 0, 0, - "push_LS: stack overflow"); + throw Exception(0, 0, + "push_LS: ls_stack overflow"); } -void pop_LS(struct parse_control *pc) { - if(--pc->sp>=0) - pc->ls=pc->stack[pc->sp]; +void pop_LS(Parse_control& pc) { + if(--pc.ls_sp>=0) + pc.ls=pc.ls_stack[pc.ls_sp]; else - (static_cast(pc->pool))->exception().raise(0, 0, 0, - "push_LS: stack underflow"); + throw Exception(0, 0, + "pop_LS: ls_stack underflow"); +} + +const String& Parse_control::alias_method(const String& name) { + return (main_alias && name==main_method_name)?*main_alias:name; }