Lines Matching defs:to
23 along with this program; if not, write to the Free Software
64 * (define to 0 if you get compile errors) */
97 Int separate_recursions; /* Max level of recursions to separate */
193 /* Costs of event sets. Aliases to arrays of 64-bit values */
212 * for subroutine call (from->bb->jmp_addr => to->bb->addr)
215 * this call is a pointer to the list head (stored in BBCC), and
219 * the (from_bbcc,to) pair. <next_hash> is used for the JCC chain
225 * adding the diff of <last> and current event counters to <sum>.
227 * After updating, <last> is set to current event counters. Thus,
235 BBCC *from, *to; /* call arc from/to this BBCC */
270 * BBs are put into a resizable hash to allow for fast detection if a
271 * BB is to be retranslated but cost info is already available.
276 * a call to setup_bbcc(), specifying a pointer to the
279 * As cost of a BB has to be distinguished depending on the context,
317 * the call chain to the current context: I.e. fn[0] is the
321 * To get a unique number for a full execution context, use
367 BBCC** rec_array; /* Variable sized array of pointers to
370 * used to check if a dump for this BBCC is needed */
453 * the calls to non-skipped functions and all costs in skipped
460 Addr ret_addr; /* address to which to return to
736 jCC* CLG_(get_jcc)(BBCC* from, UInt, BBCC* to);
744 void CLG_(push_call_stack)(BBCC* from, UInt jmp, BBCC* to, Addr sp, Bool skip);
