|
|
| version 1.16, 2001/03/06 14:32:18 | version 1.84, 2026/04/23 18:50:11 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: compiler support helper functions. |
| Copyright (c) 2001-2024 Art. Lebedev Studio (http://www.artlebedev.com) | |
| Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru> | |
| */ | */ |
| #include "compile_tools.h" | #include "compile_tools.h" |
| Line 8 | Line 11 |
| #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" | |
| void PVS(Array/*<op>*/ *result, VString *vstring) { | volatile const char * IDENT_COMPILE_TOOLS_C="$Id$" IDENT_COMPILE_TOOLS_H; |
| // append OP_VALUE | |
| Operation op; op.code=OP_VALUE; | |
| *result+=op.cast; | |
| // append 'vstring' | |
| *result+=vstring; | |
| } | |
| void PCA(Array/*<op>*/ *result, Array/*<op>*/ *code_array) { | |
| // append OP_CODE | |
| Operation op; op.code=OP_CODE; | |
| *result+=op.cast; | |
| // append 'vstring' | |
| *result+=code_array; | |
| } | |
| Array *SL(VString *vstring) { | |
| // empty ops array | |
| Array *result=N(vstring->pool()); | |
| // append 'vstring' to 'result' | |
| PVS(result, vstring); | |
| return result; | |
| } | |
| Array *CL(VClass *vclass) { | |
| // empty ops array | |
| Array *result=N(vclass->pool()); | |
| // append OP_CLASS | |
| Operation op; op.code=OP_CLASS; | |
| *result+=op.cast; | |
| // append 'vclass' | Value* LA2V(ArrayOperation& literal_string_array, int offset, OP::OPCODE code) { |
| *result+=vclass; | return literal_string_array[offset+0].code==code?literal_string_array[offset+2/*skip opcode&origin*/].value |
| :0; | |
| return result; | } |
| } | |
| void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) { | |
| String *SLA2S(Array *literal_string_array, int offset) { | assert(literal_array[0].code==OP::OP_VALUE); |
| Operation op; | VString& vstring=*static_cast<VString*>(literal_array[2/*opcode+origin*/].value); |
| op.cast=literal_string_array->get(offset+0); | if(isdigit(vstring.string().first_char())) |
| if(op.code!=OP_VALUE) | literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result()); |
| return 0; | } |
| return static_cast<VString *>(literal_string_array->get(offset+1))->get_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<VString*>(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value); | |
| void change_string_literal_to_double_literal(Array *literal_string_array) { | } |
| VString *vstring=static_cast<VString *>(literal_string_array->get(1)); | |
| Pool& pool=vstring->pool(); | bool change_first(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE replace) { |
| VDouble *vdouble=new(pool) VDouble(pool, vstring->get_double()); | Operation& op=opcodes.get_ref(0); |
| literal_string_array->put(1, vdouble); | if(op.code!=find) |
| } | return false; |
| op.code=replace; | |
| void push_LS(struct parse_control *pc, lexical_state new_state) { | return true; |
| if(pc->sp<MAX_LEXICAL_STATES) { | } |
| pc->stack[pc->sp++]=pc->ls; pc->ls=new_state; | |
| // 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 diving_count){ | |
| const String* first_name=LA2S(diving_code); | |
| if(first_name && SYMBOLS_EQ(*first_name,SELF_SYMBOL)){ | |
| #ifdef OPTIMIZE_BYTECODE_GET_SELF_ELEMENT | |
| if( | |
| diving_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(diving_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, diving_count >=4 ? 4 /*OP::OP_VALUE+origin+string+OP::OP_GET_ELEMENTx*/ : 3 /*OP::OP_+origin+string*/); | |
| } | |
| return true; | |
| } | |
| return false; | |
| } | |
| 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; | |
| } | |
| } | |
| #ifdef OPTIMIZE_BYTECODE_GET_ELEMENT__SPECIAL | |
| bool is_special_element(ArrayOperation& opcodes){ | |
| const String* name=LA2S(opcodes); | |
| return name && ( SYMBOLS_EQ(*name,CLASS_SYMBOL) || SYMBOLS_EQ(*name,CLASS_NAME_SYMBOL) ); | |
| } | |
| #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!=Symbols::STATIC_SYMBOL) | |
| throw Exception("parser.compile", &call_type, "incorrect method call type. the only valid call type method prefix is '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) { | |
| if(pc.ls_sp<MAX_LEXICAL_STATES) { | |
| 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; | |
| } | } |