File: e_debug.e

package info (click to toggle)
smarteiffel 1.1-11
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 12,288 kB
  • ctags: 40,785
  • sloc: ansic: 35,791; lisp: 4,036; sh: 1,783; java: 895; ruby: 613; python: 209; makefile: 115; csh: 78; cpp: 50
file content (207 lines) | stat: -rw-r--r-- 4,794 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
-- This file is part of SmartEiffel The GNU Eiffel Compiler Tools and Libraries
--
-- SmartEiffel is  free software;  you can redistribute it and/or  modify it
-- under  the terms of the  GNU General Public License, as published by  the
-- Free Software Foundation; either version 2, or (at your option) any later
-- version.
-- SmartEiffel is distributed in the hope that it will be useful but WITHOUT 
-- ANY WARRANTY;  without  even the implied warranty  of MERCHANTABILITY  or
-- FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
-- more details.  You should have received a copy of  the GNU General Public
-- License along with SmartEiffel;  see the file COPYING.  If not,  write to
-- the Free Software Foundation,  Inc., 59 Temple Place - Suite 330,  Boston, 
-- MA 02111-1307, USA.
--
-- Copyright(C) 1994-2002: INRIA - LORIA (INRIA Lorraine) - ESIAL U.H.P.
--			   - University of Nancy 1 - FRANCE
-- Copyright(C) 2003:      INRIA - LORIA (INRIA Lorraine) - I.U.T. Charlemagne
--			   - University of Nancy 2 - FRANCE
--
--		 Dominique COLNET, Suzanne COLLIN, Olivier ZENDRA,
--			   Philippe RIBET, Cyril ADRIAN
--
-- http://SmartEiffel.loria.fr - SmartEiffel@loria.fr
--
class E_DEBUG
   --
   -- The instruction "debug ... end".
   --

inherit INSTRUCTION

creation make

feature

   start_position: POSITION

   end_mark_comment: BOOLEAN is True

   once_pre_computable: BOOLEAN is
      do
	 Result := ace.boost
      end

   side_effect_free: BOOLEAN is
      do
	 Result := ace.boost
      end
      
   to_runnable(ct: E_TYPE): like Current is
      do
         if current_type = Void then
            current_type := ct
	    if compound /= Void then
	       compound := compound.to_runnable(ct)
	    end
            Result := Current
         else
            !!Result.make(start_position,list,compound)
            Result := Result.to_runnable(ct)
         end
      end

   stupid_switch(run_time_set: RUN_TIME_SET): BOOLEAN is
      do
         Result := True
      end

   afd_check is
      do
         if compound /= Void then
	    compound.afd_check
         end
      end

   safety_check is
      do
         check False end
      end

   simplify_2(container: COMPOUND; index: INTEGER) is
      do
	 if ace.boost then
	    container.remove(index)
	 end
      end

   collect_c_tmp is
      do
      end

   compile_to_c is
      do
         if compound /= Void then
	    compound.compile_to_c
         end
      end

   compile_to_jvm is
      do
         if compound /= Void then
	    compound.compile_to_jvm
         end
      end

   use_current: BOOLEAN is
      do
         if compound /= Void then
	    Result := compound.use_current
         end
      end

   pretty_print is
      local
         i: INTEGER
      do
         pretty_printer.keyword(fz_debug)
         pretty_printer.indent_level_increment
         if list /= Void then
            pretty_printer.put_character('(')
            from
               i := list.lower
            until
               i > list.upper
            loop
               list.item(i).pretty_print
               i := i + 1
               if i <= list.upper then
                  pretty_printer.put_character(',')
               end
            end
            pretty_printer.put_character(')')
         end
         pretty_printer.indent_level_decrement
         if compound /= Void then
            compound.pretty_print
         end
         pretty_printer.indent
         pretty_printer.keyword(fz_end)
         if pretty_printer.print_end_of_statement then
            pretty_printer.put_end_of(fz_debug)
         end
      end

feature {COMPOUND,INSTRUCTION_WITH_COMMENT}

   verify_scoop(allowed: FORMAL_ARG_LIST) is
      do
         if compound /= Void then
            compound.verify_scoop(allowed)
         end
      end

feature {ACE, CLUSTER}

   match_debug_key(key: STRING): BOOLEAN is
      require
	 (not key.is_equal("yes")) and (not key.is_equal("no"))
      local
	 i: INTEGER
      do
	 if list /= Void then
	    from
	       i := list.upper
	    until
	       Result or else i < list.lower
	    loop
	       Result := list.item(i).to_string.is_equal(key)
	       i := i - 1
	    end
	 end
      end

feature {E_DEBUG_VISITOR}

   accept(visitor: E_DEBUG_VISITOR) is
      do
         visitor.visit_e_debug(Current)
      end

feature {NONE}

   current_type: E_TYPE

   list: FIXED_ARRAY[MANIFEST_STRING]

   compound: COMPOUND

   make(sp: like start_position; l: like list; c: like compound) is
      require
         not sp.is_unknown
      do
         start_position := sp
         list := l
         compound := c
      ensure
         start_position = sp
         list = l
         compound = c
      end

invariant

   not start_position.is_unknown

end -- E_DEBUG