|
1
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
1
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
1
|
20 |
|
|
21 */ |
|
|
22 |
|
1297
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
240
|
27 #ifdef HAVE_CONFIG_H |
|
1192
|
28 #include <config.h> |
|
1
|
29 #endif |
|
|
30 |
|
3013
|
31 #include <cassert> |
|
1962
|
32 #include <cctype> |
|
3013
|
33 #include <climits> |
|
|
34 |
|
|
35 #include <iomanip.h> |
|
1962
|
36 |
|
2926
|
37 #include "glob-match.h" |
|
1755
|
38 #include "str-vec.h" |
|
|
39 |
|
1352
|
40 #include "error.h" |
|
2979
|
41 #include "oct-lvalue.h" |
|
2975
|
42 #include "ov.h" |
|
3013
|
43 #include "pager.h" |
|
1755
|
44 #include "symtab.h" |
|
1
|
45 #include "utils.h" |
|
1352
|
46 #include "variables.h" |
|
1
|
47 |
|
3013
|
48 octave_allocator |
|
|
49 symbol_record::symbol_def::allocator (sizeof (symbol_record::symbol_def)); |
|
195
|
50 |
|
767
|
51 // Individual records in a symbol table. |
|
|
52 |
|
3013
|
53 // XXX FIXME XXX -- there are lots of places below where we should |
|
|
54 // probably be temporarily ignoring interrupts. |
|
1
|
55 |
|
572
|
56 void |
|
1755
|
57 symbol_record::rename (const string& new_name) |
|
572
|
58 { |
|
2791
|
59 if (! read_only_error ("rename")) |
|
|
60 nm = new_name; |
|
572
|
61 } |
|
|
62 |
|
3013
|
63 void |
|
|
64 symbol_record::define (const octave_value& v, unsigned int sym_type) |
|
195
|
65 { |
|
3013
|
66 if (! (is_variable () && read_only_error ("redefine"))) |
|
|
67 { |
|
|
68 if (is_function ()) |
|
|
69 push_def (new symbol_def ()); |
|
195
|
70 |
|
3013
|
71 if (definition->type () == symbol_record::BUILTIN_VARIABLE) |
|
|
72 sym_type = symbol_record::BUILTIN_VARIABLE; |
|
1
|
73 |
|
3013
|
74 definition->define (v, sym_type); |
|
195
|
75 } |
|
|
76 } |
|
|
77 |
|
|
78 void |
|
3013
|
79 symbol_record::define_builtin_var (const octave_value& v) |
|
195
|
80 { |
|
3013
|
81 define (v, symbol_record::BUILTIN_VARIABLE); |
|
195
|
82 |
|
3013
|
83 if (chg_fcn) |
|
|
84 chg_fcn (); |
|
1
|
85 } |
|
|
86 |
|
3013
|
87 bool |
|
|
88 symbol_record::define_as_fcn (const octave_value& v) |
|
1
|
89 { |
|
3013
|
90 bool retval = false; |
|
1
|
91 |
|
3013
|
92 if (! (is_variable () || read_only_error ("redefine"))) |
|
195
|
93 { |
|
3013
|
94 replace_all_defs (new symbol_def (v, symbol_record::BUILTIN_FUNCTION)); |
|
2893
|
95 |
|
3013
|
96 retval = true; |
|
1
|
97 } |
|
|
98 |
|
2893
|
99 return retval; |
|
2390
|
100 } |
|
|
101 |
|
3013
|
102 bool |
|
|
103 symbol_record::define (octave_function *f, unsigned int sym_type) |
|
1
|
104 { |
|
3013
|
105 bool retval = false; |
|
2949
|
106 |
|
3013
|
107 if (! read_only_error ("redefine")) |
|
|
108 { |
|
|
109 octave_value tmp (f); |
|
|
110 |
|
|
111 replace_all_defs (new symbol_def (tmp, sym_type)); |
|
|
112 |
|
|
113 retval = true; |
|
|
114 } |
|
2949
|
115 |
|
|
116 return retval; |
|
1
|
117 } |
|
|
118 |
|
|
119 void |
|
195
|
120 symbol_record::clear (void) |
|
1
|
121 { |
|
195
|
122 if (linked_to_global) |
|
1
|
123 { |
|
3013
|
124 if (--definition->count <= 0) |
|
|
125 delete definition; |
|
|
126 |
|
|
127 definition = new symbol_def (); |
|
|
128 |
|
195
|
129 linked_to_global = 0; |
|
1
|
130 } |
|
2846
|
131 else if (! tagged_static) |
|
195
|
132 { |
|
3013
|
133 remove_top_def (); |
|
|
134 |
|
|
135 if (! definition) |
|
|
136 definition = new symbol_def (); |
|
195
|
137 } |
|
1
|
138 } |
|
|
139 |
|
|
140 void |
|
3013
|
141 symbol_record::alias (symbol_record *s, bool /* force */) |
|
1
|
142 { |
|
3013
|
143 chg_fcn = s->chg_fcn; |
|
195
|
144 |
|
3013
|
145 replace_all_defs (s->definition); |
|
|
146 |
|
|
147 definition->count++; |
|
1
|
148 } |
|
|
149 |
|
|
150 void |
|
|
151 symbol_record::mark_as_formal_parameter (void) |
|
|
152 { |
|
3013
|
153 if (is_linked_to_global ()) |
|
|
154 error ("can't mark global variable `%s' as function parameter", |
|
|
155 nm.c_str ()); |
|
|
156 else if (is_static ()) |
|
|
157 error ("can't mark static variable `%s' as function paraemter", |
|
|
158 nm.c_str ()); |
|
|
159 else |
|
|
160 formal_param = 1; |
|
1
|
161 } |
|
|
162 |
|
|
163 void |
|
195
|
164 symbol_record::mark_as_linked_to_global (void) |
|
122
|
165 { |
|
2975
|
166 if (is_formal_parameter ()) |
|
|
167 error ("can't make function parameter `%s' global", nm.c_str ()); |
|
|
168 else if (is_static ()) |
|
|
169 error ("can't make static variable `%s' global", nm.c_str ()); |
|
|
170 else |
|
|
171 linked_to_global = 1; |
|
122
|
172 } |
|
|
173 |
|
2846
|
174 void |
|
|
175 symbol_record::mark_as_static (void) |
|
|
176 { |
|
|
177 if (is_linked_to_global ()) |
|
2975
|
178 error ("can't make global variable `%s' static", nm.c_str ()); |
|
2846
|
179 else if (is_formal_parameter ()) |
|
2975
|
180 error ("can't make formal parameter `%s' static", nm.c_str ()); |
|
2846
|
181 else |
|
|
182 tagged_static = 1; |
|
|
183 } |
|
|
184 |
|
2856
|
185 bool |
|
3013
|
186 symbol_record::hides_fcn (void) const |
|
2846
|
187 { |
|
3013
|
188 bool retval = false; |
|
|
189 |
|
|
190 if (is_variable () && is_defined ()) |
|
|
191 { |
|
|
192 symbol_def *hidden_def = definition->next_elem; |
|
|
193 |
|
|
194 if (hidden_def && hidden_def->is_builtin_function ()) |
|
|
195 retval = true; |
|
|
196 } |
|
|
197 |
|
|
198 return retval; |
|
|
199 } |
|
|
200 |
|
|
201 bool |
|
|
202 symbol_record::hides_builtin (void) const |
|
|
203 { |
|
|
204 bool retval = false; |
|
|
205 |
|
|
206 if (is_variable () && is_defined ()) |
|
|
207 { |
|
|
208 symbol_def *hidden_def = definition->next_elem; |
|
|
209 |
|
|
210 if (hidden_def && hidden_def->is_user_function ()) |
|
|
211 retval = true; |
|
|
212 } |
|
|
213 |
|
|
214 return retval; |
|
2846
|
215 } |
|
|
216 |
|
2975
|
217 octave_value& |
|
|
218 symbol_record::variable_value (void) |
|
2390
|
219 { |
|
2975
|
220 static octave_value foo; |
|
2390
|
221 |
|
2975
|
222 return is_variable () ? def () : foo; |
|
2390
|
223 } |
|
|
224 |
|
2979
|
225 octave_lvalue |
|
2390
|
226 symbol_record::variable_reference (void) |
|
|
227 { |
|
|
228 if (is_function ()) |
|
|
229 clear (); |
|
|
230 |
|
|
231 if (! is_defined ()) |
|
|
232 { |
|
|
233 if (! (is_formal_parameter () || is_linked_to_global ())) |
|
|
234 link_to_builtin_variable (this); |
|
|
235 |
|
|
236 if (! is_defined ()) |
|
2975
|
237 { |
|
|
238 octave_value tmp; |
|
|
239 define (tmp); |
|
|
240 } |
|
2390
|
241 } |
|
|
242 |
|
3013
|
243 return octave_lvalue (&(def ()), chg_fcn); |
|
195
|
244 } |
|
|
245 |
|
220
|
246 void |
|
|
247 symbol_record::push_context (void) |
|
|
248 { |
|
2846
|
249 if (! is_static ()) |
|
|
250 { |
|
|
251 context.push (definition); |
|
3013
|
252 |
|
|
253 definition = new symbol_def (); |
|
395
|
254 |
|
2893
|
255 global_link_context.push (static_cast<unsigned int> (linked_to_global)); |
|
3013
|
256 |
|
2846
|
257 linked_to_global = 0; |
|
|
258 } |
|
220
|
259 } |
|
|
260 |
|
|
261 void |
|
|
262 symbol_record::pop_context (void) |
|
|
263 { |
|
1653
|
264 // It is possible for context to be empty if new symbols have been |
|
|
265 // inserted in the symbol table during recursive calls. This can |
|
|
266 // happen as a result of calls to eval() and feval(). |
|
220
|
267 |
|
1653
|
268 if (! context.empty ()) |
|
220
|
269 { |
|
3013
|
270 replace_all_defs (context.pop ()); |
|
1653
|
271 |
|
|
272 linked_to_global = global_link_context.pop (); |
|
220
|
273 } |
|
|
274 } |
|
|
275 |
|
3013
|
276 void |
|
|
277 symbol_record::print_symbol_info_line (ostream& os) |
|
|
278 { |
|
|
279 os << (is_read_only () ? " r-" : " rw") |
|
|
280 << (is_eternal () ? "-" : "d") |
|
|
281 #if 0 |
|
|
282 << (hides_fcn () ? "f" : (hides_builtin () ? "F" : "-")) |
|
|
283 #endif |
|
|
284 << " " |
|
|
285 << setiosflags (ios::left) << setw (24) << type_name () . c_str (); |
|
|
286 |
|
|
287 os << resetiosflags (ios::left); |
|
|
288 |
|
|
289 int nr = rows (); |
|
|
290 int nc = columns (); |
|
|
291 |
|
|
292 if (nr < 0) |
|
|
293 os << " -"; |
|
|
294 else |
|
|
295 os << setiosflags (ios::right) << setw (7) << nr; |
|
|
296 |
|
|
297 if (nc < 0) |
|
|
298 os << " -"; |
|
|
299 else |
|
|
300 os << setiosflags (ios::right) << setw (7) << nc; |
|
|
301 |
|
|
302 os << resetiosflags (ios::right); |
|
|
303 |
|
|
304 os << " " << name () << "\n"; |
|
|
305 } |
|
|
306 |
|
|
307 bool |
|
2791
|
308 symbol_record::read_only_error (const char *action) |
|
195
|
309 { |
|
|
310 if (is_read_only ()) |
|
|
311 { |
|
|
312 if (is_variable ()) |
|
3013
|
313 ::error ("can't %s read-only constant `%s'", action, nm.c_str ()); |
|
195
|
314 else if (is_function ()) |
|
3013
|
315 ::error ("can't %s read-only function `%s'", action, nm.c_str ()); |
|
1045
|
316 else |
|
3013
|
317 ::error ("can't %s read-only symbol `%s'", action, nm.c_str ()); |
|
195
|
318 |
|
3013
|
319 return true; |
|
195
|
320 } |
|
|
321 else |
|
3013
|
322 return false; |
|
195
|
323 } |
|
|
324 |
|
|
325 void |
|
|
326 symbol_record::push_def (symbol_def *sd) |
|
|
327 { |
|
530
|
328 if (! sd) |
|
195
|
329 return; |
|
|
330 |
|
3013
|
331 assert (definition == 0 || definition->next_elem == 0); |
|
|
332 |
|
195
|
333 sd->next_elem = definition; |
|
3013
|
334 |
|
195
|
335 definition = sd; |
|
|
336 } |
|
|
337 |
|
3013
|
338 void |
|
|
339 symbol_record::remove_top_def (void) |
|
195
|
340 { |
|
|
341 symbol_def *top = definition; |
|
|
342 |
|
3013
|
343 definition = definition->next_elem; |
|
2404
|
344 |
|
3013
|
345 if (--top->count <= 0) |
|
|
346 delete top; |
|
195
|
347 } |
|
|
348 |
|
3013
|
349 void |
|
|
350 symbol_record::replace_all_defs (symbol_def *sd) |
|
195
|
351 { |
|
3013
|
352 while (definition) |
|
|
353 remove_top_def (); |
|
2404
|
354 |
|
3013
|
355 push_def (sd); |
|
195
|
356 } |
|
|
357 |
|
767
|
358 // A symbol table. |
|
1
|
359 |
|
|
360 symbol_record * |
|
2856
|
361 symbol_table::lookup (const string& nm, bool insert, bool warn) |
|
1
|
362 { |
|
3013
|
363 unsigned int index = hash (nm); |
|
1
|
364 |
|
|
365 symbol_record *ptr = table[index].next (); |
|
|
366 |
|
530
|
367 while (ptr) |
|
1
|
368 { |
|
1755
|
369 if (ptr->name () == nm) |
|
1
|
370 return ptr; |
|
3013
|
371 |
|
1
|
372 ptr = ptr->next (); |
|
|
373 } |
|
|
374 |
|
|
375 if (insert) |
|
|
376 { |
|
3013
|
377 symbol_record *sr = new symbol_record (nm, table[index].next ()); |
|
|
378 |
|
|
379 table[index].chain (sr); |
|
|
380 |
|
|
381 return sr; |
|
1
|
382 } |
|
|
383 else if (warn) |
|
1755
|
384 warning ("lookup: symbol`%s' not found", nm.c_str ()); |
|
1
|
385 |
|
530
|
386 return 0; |
|
1
|
387 } |
|
|
388 |
|
|
389 void |
|
1755
|
390 symbol_table::rename (const string& old_name, const string& new_name) |
|
572
|
391 { |
|
3013
|
392 unsigned int index = hash (old_name); |
|
572
|
393 |
|
|
394 symbol_record *prev = &table[index]; |
|
|
395 symbol_record *ptr = prev->next (); |
|
|
396 |
|
|
397 while (ptr) |
|
|
398 { |
|
1755
|
399 if (ptr->name () == old_name) |
|
572
|
400 { |
|
|
401 ptr->rename (new_name); |
|
|
402 |
|
2791
|
403 if (! error_state) |
|
|
404 { |
|
|
405 prev->chain (ptr->next ()); |
|
|
406 |
|
3013
|
407 index = hash (new_name); |
|
2791
|
408 table[index].chain (ptr); |
|
|
409 |
|
|
410 return; |
|
|
411 } |
|
|
412 |
|
|
413 break; |
|
572
|
414 } |
|
|
415 |
|
|
416 prev = ptr; |
|
|
417 ptr = ptr->next (); |
|
|
418 } |
|
|
419 |
|
1755
|
420 error ("unable to rename `%s' to `%s'", old_name.c_str (), |
|
|
421 new_name.c_str ()); |
|
572
|
422 } |
|
|
423 |
|
|
424 void |
|
2856
|
425 symbol_table::clear (bool clear_user_functions) |
|
1
|
426 { |
|
3013
|
427 for (unsigned int i = 0; i < table_size; i++) |
|
1
|
428 { |
|
169
|
429 symbol_record *ptr = table[i].next (); |
|
1
|
430 |
|
530
|
431 while (ptr) |
|
169
|
432 { |
|
195
|
433 if (ptr->is_user_variable () |
|
|
434 || (clear_user_functions && ptr->is_user_function ())) |
|
|
435 { |
|
|
436 ptr->clear (); |
|
|
437 } |
|
|
438 |
|
169
|
439 ptr = ptr->next (); |
|
1
|
440 } |
|
|
441 } |
|
|
442 } |
|
|
443 |
|
3013
|
444 bool |
|
2856
|
445 symbol_table::clear (const string& nm, bool clear_user_functions) |
|
1
|
446 { |
|
3013
|
447 unsigned int index = hash (nm); |
|
1
|
448 |
|
195
|
449 symbol_record *ptr = table[index].next (); |
|
1
|
450 |
|
530
|
451 while (ptr) |
|
1
|
452 { |
|
1755
|
453 if (ptr->name () == nm |
|
195
|
454 && (ptr->is_user_variable () |
|
|
455 || (clear_user_functions && ptr->is_user_function ()))) |
|
1
|
456 { |
|
195
|
457 ptr->clear (); |
|
3013
|
458 return true; |
|
1
|
459 } |
|
195
|
460 ptr = ptr->next (); |
|
1
|
461 } |
|
|
462 |
|
3013
|
463 return false; |
|
1
|
464 } |
|
|
465 |
|
|
466 int |
|
164
|
467 symbol_table::size (void) const |
|
1
|
468 { |
|
|
469 int count = 0; |
|
3013
|
470 |
|
|
471 for (unsigned int i = 0; i < table_size; i++) |
|
1
|
472 { |
|
|
473 symbol_record *ptr = table[i].next (); |
|
3013
|
474 |
|
530
|
475 while (ptr) |
|
1
|
476 { |
|
|
477 count++; |
|
|
478 ptr = ptr->next (); |
|
|
479 } |
|
|
480 } |
|
3013
|
481 |
|
1
|
482 return count; |
|
|
483 } |
|
|
484 |
|
3013
|
485 static bool |
|
|
486 matches_patterns (const string& name, const string_vector& pats) |
|
1
|
487 { |
|
3013
|
488 int npats = pats.length (); |
|
1
|
489 |
|
3013
|
490 if (npats == 0) |
|
|
491 return true; |
|
|
492 |
|
|
493 glob_match pattern (pats); |
|
|
494 |
|
|
495 return pattern.match (name); |
|
1
|
496 } |
|
|
497 |
|
3013
|
498 Array<symbol_record *> |
|
|
499 symbol_table::symbol_list (int& count, const string_vector& pats, |
|
|
500 unsigned int type, unsigned int scope) const |
|
1
|
501 { |
|
115
|
502 count = 0; |
|
3013
|
503 |
|
1
|
504 int n = size (); |
|
3013
|
505 |
|
1
|
506 if (n == 0) |
|
530
|
507 return 0; |
|
1
|
508 |
|
3013
|
509 Array<symbol_record *> symbols (n); |
|
|
510 |
|
|
511 for (unsigned int i = 0; i < table_size; i++) |
|
1
|
512 { |
|
|
513 symbol_record *ptr = table[i].next (); |
|
3013
|
514 |
|
530
|
515 while (ptr) |
|
1
|
516 { |
|
|
517 assert (count < n); |
|
867
|
518 |
|
2893
|
519 unsigned int my_scope = ptr->is_linked_to_global () + 1; // Tricky... |
|
867
|
520 |
|
2893
|
521 unsigned int my_type = ptr->type (); |
|
867
|
522 |
|
1755
|
523 string my_name = ptr->name (); |
|
867
|
524 |
|
|
525 if ((type & my_type) && (scope & my_scope) |
|
3013
|
526 && matches_patterns (my_name, pats)) |
|
|
527 symbols(count++) = ptr; |
|
605
|
528 |
|
1
|
529 ptr = ptr->next (); |
|
|
530 } |
|
|
531 } |
|
1755
|
532 |
|
|
533 symbols.resize (count); |
|
1
|
534 |
|
3013
|
535 return symbols; |
|
|
536 } |
|
|
537 |
|
|
538 string_vector |
|
|
539 symbol_table::name_list (int& count, const string_vector& pats, bool sort, |
|
|
540 unsigned int type, unsigned int scope) const |
|
|
541 { |
|
|
542 Array<symbol_record *> symbols |
|
|
543 = symbol_list (count, pats, type, scope); |
|
|
544 |
|
|
545 string_vector names; |
|
|
546 |
|
|
547 int n = symbols.length (); |
|
|
548 |
|
|
549 if (n > 0) |
|
|
550 { |
|
|
551 names.resize (n); |
|
|
552 |
|
|
553 for (int i = 0; i < n; i++) |
|
|
554 names[i] = symbols(i)->name (); |
|
|
555 } |
|
|
556 |
|
|
557 if (sort) |
|
|
558 names.qsort (); |
|
|
559 |
|
|
560 return names; |
|
|
561 } |
|
|
562 |
|
|
563 static int |
|
|
564 maybe_list_cmp_fcn (symbol_record **a_arg, symbol_record **b_arg) |
|
|
565 { |
|
|
566 string a = (*a_arg)->name (); |
|
|
567 string b = (*b_arg)->name (); |
|
|
568 |
|
|
569 return a.compare (b); |
|
|
570 } |
|
1
|
571 |
|
3013
|
572 int |
|
|
573 symbol_table::maybe_list (const char *header, const string_vector& argv, |
|
|
574 ostream& os, bool show_verbose, |
|
|
575 unsigned type, unsigned scope) |
|
|
576 { |
|
|
577 int count; |
|
|
578 |
|
|
579 int status = 0; |
|
|
580 |
|
|
581 if (show_verbose) |
|
|
582 { |
|
|
583 Array<symbol_record *> symbols = symbol_list (count, argv, type, scope); |
|
|
584 |
|
|
585 int len = symbols.length (); |
|
|
586 |
|
|
587 if (len > 0 && count > 0) |
|
|
588 { |
|
|
589 os << "\n" << header << "\n\n" |
|
|
590 << "prot type rows cols name\n" |
|
|
591 << "==== ==== ==== ==== ====\n"; |
|
|
592 |
|
|
593 symbols.qsort (maybe_list_cmp_fcn); |
|
|
594 |
|
|
595 for (int i = 0; i < len; i++) |
|
|
596 symbols(i)->print_symbol_info_line (os); |
|
|
597 |
|
|
598 status = 1; |
|
|
599 } |
|
|
600 } |
|
|
601 else |
|
|
602 { |
|
|
603 string_vector symbols = name_list (count, argv, 1, type, scope); |
|
|
604 |
|
|
605 if (symbols.length () > 0 && count > 0) |
|
|
606 { |
|
|
607 os << "\n" << header << "\n\n"; |
|
|
608 |
|
|
609 symbols.list_in_columns (os); |
|
|
610 |
|
|
611 status = 1; |
|
|
612 } |
|
|
613 } |
|
|
614 |
|
|
615 return status; |
|
1
|
616 } |
|
|
617 |
|
605
|
618 symbol_record ** |
|
2893
|
619 symbol_table::glob (int& count, const string& pat, unsigned int type, |
|
|
620 unsigned int scope) const |
|
605
|
621 { |
|
|
622 count = 0; |
|
|
623 int n = size (); |
|
|
624 if (n == 0) |
|
|
625 return 0; |
|
|
626 |
|
|
627 symbol_record **symbols = new symbol_record * [n+1]; |
|
3013
|
628 |
|
|
629 for (unsigned int i = 0; i < table_size; i++) |
|
605
|
630 { |
|
|
631 symbol_record *ptr = table[i].next (); |
|
3013
|
632 |
|
605
|
633 while (ptr) |
|
|
634 { |
|
|
635 assert (count < n); |
|
|
636 |
|
2893
|
637 unsigned int my_scope = ptr->is_linked_to_global () + 1; // Tricky... |
|
605
|
638 |
|
2893
|
639 unsigned int my_type = ptr->type (); |
|
605
|
640 |
|
1792
|
641 glob_match pattern (pat); |
|
1755
|
642 |
|
605
|
643 if ((type & my_type) && (scope & my_scope) |
|
1792
|
644 && pattern.match (ptr->name ())) |
|
605
|
645 { |
|
|
646 symbols[count++] = ptr; |
|
|
647 } |
|
|
648 |
|
|
649 ptr = ptr->next (); |
|
|
650 } |
|
|
651 } |
|
|
652 symbols[count] = 0; |
|
|
653 |
|
|
654 return symbols; |
|
|
655 } |
|
|
656 |
|
220
|
657 void |
|
|
658 symbol_table::push_context (void) |
|
|
659 { |
|
3013
|
660 for (unsigned int i = 0; i < table_size; i++) |
|
220
|
661 { |
|
|
662 symbol_record *ptr = table[i].next (); |
|
|
663 |
|
530
|
664 while (ptr) |
|
220
|
665 { |
|
|
666 ptr->push_context (); |
|
|
667 ptr = ptr->next (); |
|
|
668 } |
|
|
669 } |
|
|
670 } |
|
|
671 |
|
|
672 void |
|
|
673 symbol_table::pop_context (void) |
|
|
674 { |
|
3013
|
675 for (unsigned int i = 0; i < table_size; i++) |
|
220
|
676 { |
|
|
677 symbol_record *ptr = table[i].next (); |
|
|
678 |
|
530
|
679 while (ptr) |
|
220
|
680 { |
|
|
681 ptr->pop_context (); |
|
|
682 ptr = ptr->next (); |
|
|
683 } |
|
|
684 } |
|
|
685 } |
|
|
686 |
|
3013
|
687 void |
|
|
688 symbol_table::print_stats (void) |
|
|
689 { |
|
|
690 int count = 0; |
|
|
691 int empty_chains = 0; |
|
|
692 int max_chain_length = 0; |
|
|
693 int min_chain_length = INT_MAX; |
|
|
694 |
|
|
695 for (unsigned int i = 0; i < table_size; i++) |
|
|
696 { |
|
|
697 int num_this_chain = 0; |
|
|
698 |
|
|
699 symbol_record *ptr = table[i].next (); |
|
|
700 |
|
|
701 if (ptr) |
|
|
702 octave_stdout << "chain number " << i << ":\n"; |
|
|
703 else |
|
|
704 { |
|
|
705 empty_chains++; |
|
|
706 min_chain_length = 0; |
|
|
707 } |
|
|
708 |
|
|
709 while (ptr) |
|
|
710 { |
|
|
711 num_this_chain++; |
|
|
712 |
|
|
713 octave_stdout << " " << ptr->name () << "\n"; |
|
|
714 |
|
|
715 ptr = ptr->next (); |
|
|
716 } |
|
|
717 |
|
|
718 count += num_this_chain; |
|
|
719 |
|
|
720 if (num_this_chain > max_chain_length) |
|
|
721 max_chain_length = num_this_chain; |
|
|
722 |
|
|
723 if (num_this_chain < min_chain_length) |
|
|
724 min_chain_length = num_this_chain; |
|
|
725 |
|
|
726 if (num_this_chain > 0) |
|
|
727 octave_stdout << "\n"; |
|
|
728 } |
|
|
729 |
|
|
730 octave_stdout << "max chain length: " << max_chain_length << "\n"; |
|
|
731 octave_stdout << "min chain length: " << min_chain_length << "\n"; |
|
|
732 octave_stdout << "empty chains: " << empty_chains << "\n"; |
|
|
733 octave_stdout << "total chains: " << table_size << "\n"; |
|
|
734 octave_stdout << "total symbols: " << count << "\n"; |
|
|
735 } |
|
|
736 |
|
1
|
737 // Chris Torek's fave hash function. |
|
|
738 |
|
|
739 unsigned int |
|
1755
|
740 symbol_table::hash (const string& str) |
|
1
|
741 { |
|
2893
|
742 unsigned int h = 0; |
|
3013
|
743 |
|
2893
|
744 for (unsigned int i = 0; i < str.length (); i++) |
|
1755
|
745 h = h * 33 + str[i]; |
|
1
|
746 |
|
3013
|
747 return h & (table_size - 1); |
|
2790
|
748 } |
|
|
749 |
|
1
|
750 /* |
|
|
751 ;;; Local Variables: *** |
|
|
752 ;;; mode: C++ *** |
|
|
753 ;;; End: *** |
|
|
754 */ |
