Annotation of parser3/src/main/compile_tools.C, revision 1.66
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.66 ! misha 8: static const char * const IDENT_COMPILE_TOOLS_C="$Date: 2009-05-23 05:23:03 $";
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.66 ! misha 48: bool maybe_change_first_opcode(ArrayOperation& opcodes, OP::OPCODE find, OP::OPCODE replace) {
! 49: if(opcodes[0].code!=find)
! 50: return false;
1.1 paf 51:
1.66 ! misha 52: opcodes.put(0, replace);
! 53: return true;
1.62 misha 54: }
55:
1.55 paf 56: void push_LS(Parse_control& pc, lexical_state new_state) {
1.42 paf 57: if(pc.ls_sp<MAX_LEXICAL_STATES) {
58: pc.ls_stack[pc.ls_sp++]=pc.ls;
59: pc.ls=new_state;
1.1 paf 60: } else
1.55 paf 61: throw Exception(0, 0,
62: "push_LS: ls_stack overflow");
1.1 paf 63: }
1.55 paf 64: void pop_LS(Parse_control& pc) {
1.42 paf 65: if(--pc.ls_sp>=0)
66: pc.ls=pc.ls_stack[pc.ls_sp];
1.1 paf 67: else
1.55 paf 68: throw Exception(0, 0,
69: "pop_LS: ls_stack underflow");
70: }
71:
72: const String& Parse_control::alias_method(const String& name) {
73: return (main_alias && name==main_method_name)?*main_alias:name;
1.1 paf 74: }
E-mail: