Annotation of parser3/src/main/compile_tools.C, revision 1.64
1.29 paf 1: /** @file
1.30 paf 2: Parser: compiler support helper functions.
3:
1.62 misha 4: Copyright (c) 2001-2009 ArtLebedev Group (http://www.artlebedev.com)
1.45 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.51 paf 6: */
1.30 paf 7:
1.64 ! misha 8: static const char * const IDENT_COMPILE_TOOLS_C="$Date: 2009-05-20 09:08:53 $";
1.1 paf 9:
10: #include "compile_tools.h"
11: #include "pa_string.h"
12: #include "pa_array.h"
13: #include "pa_exception.h"
1.9 paf 14: #include "pa_vstring.h"
1.15 paf 15: #include "pa_vdouble.h"
1.1 paf 16:
1.61 misha 17: Value* LA2V(ArrayOperation& literal_string_array, int offset, OP::OPCODE code) {
18: return literal_string_array[offset+0].code==code?literal_string_array[offset+2/*skip opcode&origin*/].value
1.43 paf 19: :0;
1.15 paf 20: }
21:
1.58 paf 22: void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_array) {
1.60 misha 23: assert(literal_array[0].code==OP::OP_VALUE);
1.58 paf 24: VString& vstring=*static_cast<VString*>(literal_array[2/*opcode+origin*/].value);
25: if(isdigit(vstring.string().first_char()))
26: literal_array.put(2/*opcode+origin*/, &vstring.as_expr_result());
1.1 paf 27: }
1.53 paf 28:
1.55 paf 29: void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) {
1.60 misha 30: assert(literal_string_array[0].code==OP::OP_VALUE);
1.58 paf 31: static_cast<VString*>(literal_string_array[2/*opcode+origin*/].value)->set_string(new_value);
1.53 paf 32: }
33:
1.55 paf 34: void changetail_or_append(ArrayOperation& opcodes,
1.60 misha 35: OP::OPCODE find, bool with_argument, OP::OPCODE replace, OP::OPCODE notfound) {
1.55 paf 36: int tail=opcodes.count()-(with_argument?2:1);
1.49 paf 37: if(tail>=0) {
1.55 paf 38: Operation& op=opcodes.get_ref(tail);
1.48 paf 39: if(op.code==find) {
40: op.code=replace;
41: return;
42: }
43: }
44:
1.55 paf 45: opcodes+=Operation(notfound);
1.48 paf 46: }
47:
1.1 paf 48:
1.62 misha 49: bool maybe_change_first_opcode(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE replace, bool strict) {
50: if(opcodes[0].code==find){
51: opcodes.put(0, replace);
52: return true;
53: }
54: if(strict)
55: assert(opcodes[0].code==find);
56:
57: return false;
58: }
59:
60:
61: bool maybe_change_first_opcode(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE last, OP::OPCODE replace) {
62: if(opcodes[0].code==find && opcodes[opcodes.count()-1].code==last){
63: opcodes.put(0, replace);
64: return true;
65: }
66: return false;
67: }
68:
69:
1.63 misha 70: // OP_VALUE+origin+value+OP_GET_ELEMENT+OP_VALUE+origin+value+OP_GET_ELEMENT => OP_GET_OBJECT_ELEMENT+origin+value+[OP_VALUE]+origin+value+OP_GET_ELEMENT
71: bool maybe_make_get_object_element(ArrayOperation& opcodes, ArrayOperation& diving_code, size_t divine_count){
72: if(divine_count!=8)
73: return false;
74:
1.62 misha 75: assert(diving_code[0].code==OP::OP_VALUE);
1.63 misha 76: if(
77: diving_code[4].code==OP::OP_VALUE
78: && diving_code[divine_count-1].code==OP::OP_GET_ELEMENT
79: ){
80: O(opcodes, OP::OP_GET_OBJECT_ELEMENT);
1.62 misha 81: P(opcodes, diving_code, 1/*offset*/, 2/*limit*/); // copy origin+value
1.64 ! misha 82: P(opcodes, diving_code, 5, 3); // copy specified tail
1.62 misha 83: return true;
1.63 misha 84: }
85: return false;
86: }
87:
88: // OP_VALUE+origin+value+OP_GET_ELEMENT+OP_WITH_READ+OP_VALUE+origin+value+OP_GET_ELEMENT+OP_GET_ELEMENT => OP_GET_OBJECT_VAR_ELEMENT+origin+value+[OP_VALUE]+origin+value+OP_GET_ELEMENT
89: bool maybe_make_get_object_var_element(ArrayOperation& opcodes, ArrayOperation& diving_code, size_t divine_count){
90: if(divine_count!=10)
1.62 misha 91: return false;
1.63 misha 92:
93: assert(diving_code[0].code==OP::OP_VALUE);
94: if(
95: diving_code[4].code==OP::OP_WITH_READ
96: && diving_code[5].code==OP::OP_VALUE
97: && diving_code[divine_count-1].code==OP::OP_GET_ELEMENT
98: ){
99: O(opcodes, OP::OP_GET_OBJECT_VAR_ELEMENT);
100: P(opcodes, diving_code, 1/*offset*/, 2/*limit*/); // copy origin+value
1.64 ! misha 101: P(opcodes, diving_code, 6, 3); // copy specified tail
1.63 misha 102: return true;
1.62 misha 103: }
1.63 misha 104: return false;
1.62 misha 105: }
106:
1.64 ! misha 107: // $a(1) or $.b(2)
! 108: // (OP_WITH_ROOT|OP_WITH_WRITE)+OP_VALUE+origin+value
! 109: // OP_PREPARE_TO_EXPRESSION+OP_VALUE+origin+value+CONSTRUCT_EXPR
! 110:
! 111: // $c[d] or $.e[f]
! 112: // OP_WITH_ROOT+OP_VALUE+origin+value
! 113: // OP_VALUE+origin+value+OP_CONSTRUCT_VALUE
! 114: bool maybe_make_root_or_write_construct(ArrayOperation& opcodes, ArrayOperation& var_ops, ArrayOperation& expr_ops){
! 115: if(var_ops.count()==4 && (var_ops[0].code==OP::OP_WITH_ROOT || var_ops[0].code==OP::OP_WITH_WRITE)){
! 116: if(
! 117: expr_ops.count()==5
! 118: && expr_ops[0].code==OP::OP_PREPARE_TO_EXPRESSION
! 119: && expr_ops[1].code==OP::OP_VALUE
! 120: && expr_ops[4].code==OP::OP_CONSTRUCT_EXPR
! 121: ){
! 122: // $a(1) or $.b(2)
! 123: O(opcodes, (var_ops[0].code==OP::OP_WITH_ROOT) ? OP::OP_ROOT_CONSTRUCT_EXPR : OP::OP_WRITE_CONSTRUCT_EXPR);
! 124: P(opcodes, var_ops, 2/*offset*/); // skip OP_WITH+OP_VALUE and copy 1st origin+value
! 125: P(opcodes, expr_ops, 2/*offset*/, 2/*limit*/); // copy 2nd origin+value
! 126: return true;
! 127: } else if(
! 128: expr_ops.count()==4
! 129: && expr_ops[0].code==OP::OP_VALUE
! 130: && expr_ops[3].code==OP::OP_CONSTRUCT_VALUE
! 131: ){
! 132: // $c[d] or $.e[f]
! 133: O(opcodes, (var_ops[0].code==OP::OP_WITH_ROOT) ? OP::OP_ROOT_CONSTRUCT_VALUE : OP::OP_WRITE_CONSTRUCT_VALUE);
! 134: P(opcodes, var_ops, 2/*offset*/); // skip OP_WITH+OP_VALUE and copy 1st origin+value
! 135: P(opcodes, expr_ops, 1/*offset*/, 2/*limit*/); // copy 2nd origin+value
! 136: return true;
! 137: }
! 138: }
! 139: return false;
! 140: }
! 141:
1.55 paf 142: void push_LS(Parse_control& pc, lexical_state new_state) {
1.42 paf 143: if(pc.ls_sp<MAX_LEXICAL_STATES) {
144: pc.ls_stack[pc.ls_sp++]=pc.ls;
145: pc.ls=new_state;
1.1 paf 146: } else
1.55 paf 147: throw Exception(0, 0,
148: "push_LS: ls_stack overflow");
1.1 paf 149: }
1.55 paf 150: void pop_LS(Parse_control& pc) {
1.42 paf 151: if(--pc.ls_sp>=0)
152: pc.ls=pc.ls_stack[pc.ls_sp];
1.1 paf 153: else
1.55 paf 154: throw Exception(0, 0,
155: "pop_LS: ls_stack underflow");
156: }
157:
158: const String& Parse_control::alias_method(const String& name) {
159: return (main_alias && name==main_method_name)?*main_alias:name;
1.1 paf 160: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to compile_tools.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main