39 fn_stack CLG_(current_fn_stack);
41 void CLG_(init_fn_stack)(fn_stack* s)  in CLG_()  function
52 void CLG_(copy_current_fn_stack)(fn_stack* dst)  in CLG_()  function
56   dst->size   = CLG_(current_fn_stack).size;  in CLG_()
57   dst->bottom = CLG_(current_fn_stack).bottom;  in CLG_()
58   dst->top    = CLG_(current_fn_stack).top;  in CLG_()
61 void CLG_(set_current_fn_stack)(fn_stack* s)  in CLG_()  function
65   CLG_(current_fn_stack).size   = s->size;  in CLG_()
66   CLG_(current_fn_stack).bottom = s->bottom;  in CLG_()
67   CLG_(current_fn_stack).top    = s->top;  in CLG_()
72 void CLG_(init_cxt_table)()  in CLG_()  function
129     CLG_(stat).cxt_hash_resizes++;  in resize_cxt_table()
206     cxt->base_number = CLG_(stat).context_counter;  in new_cxt()
209     CLG_(stat).context_counter += recs;  in new_cxt()
210     CLG_(stat).distinct_contexts++;  in new_cxt()
220       CLG_(print_cxt)(12, cxt, 0);  in new_cxt()
228 Context* CLG_(get_cxt)(fn_node** fn)  in CLG_()  function
249     CLG_(stat).cxt_lru_misses++;  in CLG_()
274 void CLG_(push_cxt)(fn_node* fn)  in CLG_()  function
276   call_stack* cs = &CLG_(current_call_stack);  in CLG_()
281 	    CLG_(current_state).cxt ?  in CLG_()
282 	    (Int)CLG_(current_state).cxt->base_number : -1);  in CLG_()
287   cs->entry[cs->sp].cxt = CLG_(current_state).cxt;  in CLG_()
288   cs->entry[cs->sp].fn_sp = CLG_(current_fn_stack).top - CLG_(current_fn_stack).bottom;  in CLG_()
290   if (fn && (*(CLG_(current_fn_stack).top) == fn)) return;  in CLG_()
292       ((*(CLG_(current_fn_stack).top))->group == fn->group)) return;  in CLG_()
295   fn_entries = CLG_(current_fn_stack).top - CLG_(current_fn_stack).bottom;  in CLG_()
296   if (fn_entries == CLG_(current_fn_stack).size-1) {  in CLG_()
297     UInt new_size = CLG_(current_fn_stack).size *2;  in CLG_()
301     for(i=0;i<CLG_(current_fn_stack).size;i++)  in CLG_()
302       new_array[i] = CLG_(current_fn_stack).bottom[i];  in CLG_()
303     VG_(free)(CLG_(current_fn_stack).bottom);  in CLG_()
304     CLG_(current_fn_stack).top = new_array + fn_entries;  in CLG_()
305     CLG_(current_fn_stack).bottom = new_array;  in CLG_()
308 	     CLG_(current_fn_stack).size, new_size,  in CLG_()
311     CLG_(current_fn_stack).size = new_size;  in CLG_()
314   if (fn && (*(CLG_(current_fn_stack).top) == 0)) {  in CLG_()
318     pactive = CLG_(get_fn_entry)(fn->number);  in CLG_()
322   CLG_(current_fn_stack).top++;  in CLG_()
323   *(CLG_(current_fn_stack).top) = fn;  in CLG_()
324   CLG_(current_state).cxt = CLG_(get_cxt)(CLG_(current_fn_stack).top);  in CLG_()
328 	    CLG_(current_state).cxt ?  in CLG_()
329 	    (Int)CLG_(current_state).cxt->base_number : -1,  in CLG_()
330 	    CLG_(current_fn_stack).top - CLG_(current_fn_stack).bottom + 0L);  in CLG_()