|
|
| version 1.7, 2001/02/22 10:43:45 | version 1.65, 2009/05/23 05:23:03 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: compiler support helper functions. |
| Copyright (c) 2001-2009 ArtLebedev Group (http://www.artlebedev.com) | |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | |
| */ | */ |
| static const char * const IDENT_COMPILE_TOOLS_C="$Date$"; | |
| #include "compile_tools.h" | #include "compile_tools.h" |
| #include "pa_string.h" | #include "pa_string.h" |
| #include "pa_array.h" | #include "pa_array.h" |
| #include "pa_exception.h" | #include "pa_exception.h" |
| #include "pa_vstring.h" | #include "pa_vstring.h" |
| #include "pa_vdouble.h" | |
| Array *L(String *string) { | Value* LA2V(ArrayOperation& literal_string_array, int offset, OP::OPCODE code) { |
| // empty ops array | return literal_string_array[offset+0].code==code?literal_string_array[offset+2/*skip opcode&origin*/].value |
| Array *result=N(string->pool()); | :0; |
| } | |
| void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) { | |
| assert(literal_array[0].code==OP::OP_VALUE); | |
| VString& vstring=*static_cast<VString*>(literal_array[2/*opcode+origin*/].value); | |
| if(isdigit(vstring.string().first_char())) | |
| literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result()); | |
| } | |
| // append OP_STRING | void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) { |
| Operation op; op.code=OP_STRING; | assert(literal_string_array[0].code==OP::OP_VALUE); |
| *result+=op.cast; | static_cast<VString*>(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value); |
| } | |
| // append 'string' | void changetail_or_append(ArrayOperation& opcodes, |
| *result+=string; | 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); |
| } | } |
| String *LA2S(Array *literal_string_array, int offset) { | |
| return static_cast<String *>(literal_string_array->get(offset+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; | |
| } | } |
| Array *LAS2LAVS(Array *literal_array) { | |
| Operation op; op.code=OP_VSTRING; | |
| literal_array->put(0, op.cast); | |
| Value *value=new(literal_array->pool()) | |
| VString(static_cast<String *>(literal_array->get(1))); | |
| literal_array->put(1, value); | |
| return literal_array; | 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, lexical_state new_state) { | void push_LS(Parse_control& pc, lexical_state new_state) { |
| if(pc->sp<MAX_LEXICAL_STATES) { | if(pc.ls_sp<MAX_LEXICAL_STATES) { |
| pc->stack[pc->sp++]=pc->ls; pc->ls=new_state; | pc.ls_stack[pc.ls_sp++]=pc.ls; |
| pc.ls=new_state; | |
| } else | } else |
| pc->pool->THROW(0, 0, 0, "push_LS: stack overflow"); | throw Exception(0, 0, |
| "push_LS: ls_stack overflow"); | |
| } | } |
| void pop_LS(struct parse_control *pc) { | void pop_LS(Parse_control& pc) { |
| if(--pc->sp>=0) | if(--pc.ls_sp>=0) |
| pc->ls=pc->stack[pc->sp]; | pc.ls=pc.ls_stack[pc.ls_sp]; |
| else | else |
| pc->pool->THROW(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; | |
| } | } |