|
|
| version 1.58, 2005/08/08 13:30:45 | version 1.71, 2015/04/02 22:18:26 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: compiler support helper functions. | Parser: compiler support helper functions. |
| Copyright (c) 2001-2004 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2012 Art. Lebedev Studio (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | 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" | #include "pa_vdouble.h" |
| #include "pa_vmethod_frame.h" | |
| volatile const char * IDENT_COMPILE_TOOLS_C="$Id$" IDENT_COMPILE_TOOLS_H; | |
| Value* LA2V(ArrayOperation& literal_string_array, int offset) { | Value* LA2V(ArrayOperation& literal_string_array, int offset, OP::OPCODE code) { |
| return literal_string_array[offset+0].code==OP_VALUE?literal_string_array[offset+2/*skip opcode&origin*/].value | return literal_string_array[offset+0].code==code?literal_string_array[offset+2/*skip opcode&origin*/].value |
| :0; | :0; |
| } | } |
| void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) { | void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) { |
| assert(literal_array[0].code==OP_VALUE); | assert(literal_array[0].code==OP::OP_VALUE); |
| VString& vstring=*static_cast<VString*>(literal_array[2/*opcode+origin*/].value); | VString& vstring=*static_cast<VString*>(literal_array[2/*opcode+origin*/].value); |
| if(isdigit(vstring.string().first_char())) | if(isdigit(vstring.string().first_char())) |
| literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result()); | literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result()); |
| } | } |
| void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) { | void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) { |
| assert(literal_string_array[0].code==OP_VALUE); | assert(literal_string_array[0].code==OP::OP_VALUE); |
| static_cast<VString*>(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value); | static_cast<VString*>(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value); |
| } | } |
| void changetail_or_append(ArrayOperation& opcodes, | bool change_first(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE replace) { |
| OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound) { | Operation& op=opcodes.get_ref(0); |
| int tail=opcodes.count()-(with_argument?2:1); | if(op.code!=find) |
| if(tail>=0) { | return false; |
| Operation& op=opcodes.get_ref(tail); | |
| if(op.code==find) { | op.code=replace; |
| op.code=replace; | return true; |
| return; | } |
| // OP_VALUE+origin+self+OP_GET_ELEMENT+OP_VALUE+origin+value+OP_GET_ELEMENT => OP_WITH_SELF__VALUE__GET_ELEMENT+origin+value | |
| bool maybe_make_self(ArrayOperation& opcodes, ArrayOperation& diving_code, size_t divine_count){ | |
| const String* first_name=LA2S(diving_code); | |
| if(first_name && *first_name==SELF_ELEMENT_NAME){ | |
| #ifdef OPTIMIZE_BYTECODE_GET_SELF_ELEMENT | |
| if( | |
| divine_count>=8 | |
| && diving_code[3].code==OP::OP_GET_ELEMENT | |
| && diving_code[4].code==OP::OP_VALUE | |
| && diving_code[7].code==OP::OP_GET_ELEMENT | |
| ){ | |
| // optimization for $self.field and ^self.method | |
| O(opcodes, OP::OP_WITH_SELF__VALUE__GET_ELEMENT); | |
| P(opcodes, diving_code, 5/*offset*/, 2/*limit*/); // copy second origin+value. we know that the first one is "self" | |
| if(divine_count>8) | |
| P(opcodes, diving_code, 8/*offset*/); // copy tail | |
| } else | |
| #endif | |
| { | |
| // self.xxx... => xxx... | |
| // OP_VALUE+origin+string+OP_GET_ELEMENT+... -> OP_WITH_SELF+... | |
| O(opcodes, OP::OP_WITH_SELF); /* stack: starting context */ | |
| P(opcodes, diving_code, divine_count>=4?4/*OP::OP_VALUE+origin+string+OP::OP_GET_ELEMENTx*/:3/*OP::OP_+origin+string*/); | |
| } | } |
| return true; | |
| } | } |
| return false; | |
| } | |
| #ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL | |
| bool maybe_append_simple_diving_code(ArrayOperation& code, ArrayOperation& diving_code){ | |
| if( | |
| diving_code.count()==3 | |
| && diving_code[0].code==OP::OP_STRING__WRITE | |
| ){ | |
| O(code, OP::OP_VALUE); | |
| P(code, diving_code, 1/*offset*/, 2/*limit*/); /*copy origin+value*/ | |
| return true; | |
| } else { | |
| return false; | |
| } | |
| } | |
| opcodes+=Operation(notfound); | bool is_special_element(ArrayOperation& opcodes){ |
| const String* name=LA2S(opcodes); | |
| return ( | |
| name | |
| && ( | |
| *name==class_element_name | |
| || *name==class_name_element_name | |
| ) | |
| ); | |
| } | } |
| #endif | |
| Method::Call_type GetMethodCallType(Parse_control& pc, ArrayOperation& literal_array) { | |
| const String* full_name=LA2S(literal_array); | |
| int pos=full_name->pos(':'); | |
| if(pos > 0) { | |
| const String call_type=full_name->mid(0, pos); | |
| if(call_type!=method_call_type_static) | |
| throw Exception("parser.compile", | |
| &call_type, | |
| "incorrect method call type. the only valid call type method prefix is '" METHOD_CALL_TYPE_STATIC "'" | |
| ); | |
| const String *sole_name=&full_name->mid(pos+1, full_name->length()); | |
| // replace full method name (static:method) by sole method name (method). it will be used later. | |
| change_string_literal_value(literal_array, *sole_name); | |
| return Method::CT_STATIC; | |
| } | |
| return pc.get_methods_call_type(); | |
| } | |
| void push_LS(Parse_control& pc, lexical_state new_state) { | void push_LS(Parse_control& pc, lexical_state new_state) { |
| if(pc.ls_sp<MAX_LEXICAL_STATES) { | if(pc.ls_sp<MAX_LEXICAL_STATES) { |