Home
last modified time | relevance | path

Searched refs:cxt (Results 1 – 8 of 8) sorted by relevance

/external/valgrind/main/callgrind/
Dcontext.c154 static Bool is_cxt(UWord hash, fn_node** fn, Context* cxt) in is_cxt() argument
159 if (hash != cxt->hash) return False; in is_cxt()
161 count = cxt->size; in is_cxt()
162 cxt_fn = &(cxt->fn[0]); in is_cxt()
177 Context* cxt; in new_cxt() local
196 cxt = (Context*) CLG_MALLOC("cl.context.nc.1", in new_cxt()
205 cxt->fn[offset] = *fn; in new_cxt()
212 cxt->size = size; in new_cxt()
213 cxt->base_number = CLG_(stat).context_counter; in new_cxt()
214 cxt->hash = hash; in new_cxt()
[all …]
Dbbcc.c88 CLG_ASSERT(bbcc->cxt != 0); in CLG_()
92 bbcc->cxt->base_number + bbcc->rec_index, in CLG_()
93 bbcc->cxt->fn[0]->name, in CLG_()
123 for(j=0;j<bbcc->cxt->fn[0]->separate_recursions;j++) { in CLG_()
145 UInt bbcc_hash_idx(BB* bb, Context* cxt, UInt size) in bbcc_hash_idx() argument
148 CLG_ASSERT(cxt != 0); in bbcc_hash_idx()
150 return ((Addr)bb + (Addr)cxt) % size; in bbcc_hash_idx()
157 BBCC* lookup_bbcc(BB* bb, Context* cxt) in lookup_bbcc() argument
163 if (bbcc->cxt == cxt) { in lookup_bbcc()
173 idx = bbcc_hash_idx(bb, cxt, current_bbccs.size); in lookup_bbcc()
[all …]
Ddump.c141 p->cxt = 0; in init_fpos()
255 Context* cxt, int rec_index) in print_mangled_fn() argument
265 if (cxt_dumped[cxt->base_number+rec_index]) { in print_mangled_fn()
267 tag, cxt->base_number + rec_index); in print_mangled_fn()
274 for(i=cxt->size;i>0;i--) { in print_mangled_fn()
275 CLG_ASSERT(cxt->fn[i-1]->pure_cxt != 0); in print_mangled_fn()
276 n = cxt->fn[i-1]->pure_cxt->base_number; in print_mangled_fn()
279 tag, n, cxt->fn[i-1]->name); in print_mangled_fn()
283 last = cxt->fn[i-1]->pure_cxt; in print_mangled_fn()
286 if ((last == cxt) && (rec_index == 0)) return; in print_mangled_fn()
[all …]
Ddebug.c58 void print_mangled_cxt(Context* cxt, int rec_index) in print_mangled_cxt() argument
62 if (!cxt) in print_mangled_cxt()
65 VG_(printf)("%s", cxt->fn[0]->name); in print_mangled_cxt()
68 for(i=1;i<cxt->size;i++) in print_mangled_cxt()
69 VG_(printf)("'%s", cxt->fn[i]->name); in print_mangled_cxt()
75 void CLG_(print_cxt)(int s, Context* cxt, int rec_index) in CLG_()
82 if (cxt) { in CLG_()
83 UInt *pactive = CLG_(get_fn_entry)(cxt->fn[0]->number); in CLG_()
84 CLG_ASSERT(rec_index < cxt->fn[0]->separate_recursions); in CLG_()
86 VG_(printf)("Cxt %d" ,cxt->base_number + rec_index); in CLG_()
[all …]
Dcallstack.c58 s->entry[0].cxt = 0; /* for assertion in push_cxt() */ in CLG_()
204 fn_node* to_fn = to->cxt->fn[0]; in CLG_()
213 CLG_ASSERT(current_entry->cxt != 0); in CLG_()
223 if (jcc->from->cxt->fn[0] != to_fn) (*pdepth)++; in CLG_()
258 current_entry->cxt = 0; in CLG_()
336 fn_node* to_fn = jcc->to->cxt->fn[0]; in CLG_()
340 if (jcc->from->cxt->fn[0] != to_fn) (*pdepth)--; in CLG_()
358 CLG_(current_state).cxt = lower_entry->cxt; in CLG_()
361 CLG_ASSERT(CLG_(current_state).cxt != 0); in CLG_()
367 lower_entry->cxt = 0; in CLG_()
Dthreads.c256 if (CLG_(current_state).cxt) { in CLG_()
258 fn_number = CLG_(current_state).cxt->fn[0]->number; in CLG_()
262 CLG_(current_state).cxt->fn[0]->name, *pactive); in CLG_()
315 es->cxt = 0; in CLG_()
413 es->cxt = CLG_(current_state).cxt; in exec_state_save()
438 CLG_(current_state).cxt = es->cxt; in exec_state_restore()
450 CLG_(print_cxt)(-9, es->cxt, 0); in exec_state_restore()
Dglobal.h397 Context* cxt; /* execution context of this BBCC */ member
497 Context* cxt; /* context before call */ member
525 Context* cxt; member
648 Context* cxt; member
765 BBCC* CLG_(clone_bbcc)(BBCC* orig, Context* cxt, Int rec_index);
879 void CLG_(print_cxt)(int s, Context* cxt, int rec_index);
Dmain.c1428 VG_(gdb_printf)("function-%d-%d: %s\n",t, i, from->cxt->fn[0]->name); in dump_state_of_thread_togdb()
1444 VG_(gdb_printf)("function-%d-%d: %s\n",t, i, to->cxt->fn[0]->name ); in dump_state_of_thread_togdb()