Lines Matching defs:bbcc
216 typedef struct _BBCC BBCC;
248 * this call is a pointer to the list head (stored in BBCC), and
267 jCC* next_from; /* next JCC from a BBCC */
268 BBCC *from, *to; /* call arc from/to this BBCC */
313 * multiple cost centers for one BB (struct BBCC) exist and the according
314 * BBCC is set by setup_bbcc.
329 BBCC* bbcc_list; /* BBCCs for same BB (see next_bbcc in BBCC) */
330 BBCC* last_bbcc; /* Temporary: Cached for faster access (LRU) */
358 * For each Context, recursion index and BB, there can be a BBCC.
397 Context* cxt; /* execution context of this BBCC */
399 UInt rec_index; /* Recursion index in rec->bbcc for this bbcc */
400 BBCC** rec_array; /* Variable sized array of pointers to
402 ULong ret_counter; /* how often returned from jccs of this bbcc;
403 * used to check if a dump for this BBCC is needed */
405 BBCC* next_bbcc; /* Chain of BBCCs for same BB */
406 BBCC* lru_next_bbcc; /* BBCC executed next the last time */
413 BBCC* next; /* entry chain in hash */
414 ULong* cost; /* start of 64bit costs for this BBCC */
486 * Otherwise, it is the last non-skipped BBCC. This one gets all
496 BBCC* nonskipped; /* see above */
528 BBCC* bbcc; /* last BB executed */
529 BBCC* nonskipped;
554 BBCC** table;
622 /* Address position inside of a BBCC:
665 void (*add_icost)(SimCost, BBCC*, InstrInfo*, ULong);
757 /* from bbcc.c */
762 void CLG_(forall_bbccs)(void (*func)(BBCC*));
763 void CLG_(zero_bbcc)(BBCC* bbcc);
764 BBCC* CLG_(get_bbcc)(BB* bb);
765 BBCC* CLG_(clone_bbcc)(BBCC* orig, Context* cxt, Int rec_index);
774 jCC* CLG_(get_jcc)(BBCC* from, UInt, BBCC* to);
782 void CLG_(push_call_stack)(BBCC* from, UInt jmp, BBCC* to, Addr sp, Bool skip);
872 void CLG_(print_bbcc)(int s, BBCC* bbcc);
873 void CLG_(print_bbcc_fn)(BBCC* bbcc);
878 void CLG_(print_bbcc_cost)(int s, BBCC*);
