Annotation of parser3/src/main/compile_tools.C, revision 1.63
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.63 ! misha 8: static const char * const IDENT_COMPILE_TOOLS_C="$Date: 2009-05-19 13:33:14 $";
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
82: P(opcodes, diving_code,
83: #ifdef OPTIMIZE_BYTECODE_USE_TWO_OPERANDS_INSTRUCTIONS
1.63 ! misha 84: 5, 3
1.62 misha 85: #else
1.63 ! misha 86: 4, 4
1.62 misha 87: #endif
88: ); // copy specified tail
89: return true;
1.63 ! misha 90: }
! 91: return false;
! 92: }
! 93:
! 94: // 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
! 95: bool maybe_make_get_object_var_element(ArrayOperation& opcodes, ArrayOperation& diving_code, size_t divine_count){
! 96: if(divine_count!=10)
1.62 misha 97: return false;
1.63 ! misha 98:
! 99: assert(diving_code[0].code==OP::OP_VALUE);
! 100: if(
! 101: diving_code[4].code==OP::OP_WITH_READ
! 102: && diving_code[5].code==OP::OP_VALUE
! 103: && diving_code[divine_count-1].code==OP::OP_GET_ELEMENT
! 104: ){
! 105: O(opcodes, OP::OP_GET_OBJECT_VAR_ELEMENT);
! 106: P(opcodes, diving_code, 1/*offset*/, 2/*limit*/); // copy origin+value
! 107: P(opcodes, diving_code,
! 108: #ifdef OPTIMIZE_BYTECODE_USE_TWO_OPERANDS_INSTRUCTIONS
! 109: 6, 3
! 110: #else
! 111: 5, 4
! 112: #endif
! 113: ); // copy specified tail
! 114: return true;
1.62 misha 115: }
1.63 ! misha 116: return false;
1.62 misha 117: }
118:
1.55 paf 119: void push_LS(Parse_control& pc, lexical_state new_state) {
1.42 paf 120: if(pc.ls_sp<MAX_LEXICAL_STATES) {
121: pc.ls_stack[pc.ls_sp++]=pc.ls;
122: pc.ls=new_state;
1.1 paf 123: } else
1.55 paf 124: throw Exception(0, 0,
125: "push_LS: ls_stack overflow");
1.1 paf 126: }
1.55 paf 127: void pop_LS(Parse_control& pc) {
1.42 paf 128: if(--pc.ls_sp>=0)
129: pc.ls=pc.ls_stack[pc.ls_sp];
1.1 paf 130: else
1.55 paf 131: throw Exception(0, 0,
132: "pop_LS: ls_stack underflow");
133: }
134:
135: const String& Parse_control::alias_method(const String& name) {
136: return (main_alias && name==main_method_name)?*main_alias:name;
1.1 paf 137: }
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