Searched refs:traces (Results 1 - 5 of 5) sorted by relevance
/freebsd-10.1-release/contrib/ncurses/ |
H A D | mk-2nd.awk | 45 # traces ("all" or "DEBUG", to control whether tracing is compiled in) 74 printf "# traces: %s\n", traces 85 if (traces != "all" && traces != MODEL && $1 != "lib_trace")
|
H A D | mk-1st.awk | 35 # traces ("all" or "DEBUG", to control whether tracing is compiled in) 235 printf "# traces: %s\n", traces 269 if (traces != "all" && traces != MODEL && $1 != "lib_trace")
|
H A D | configure | 18137 traces=$LIB_TRACING \ 18165 traces=$LIB_TRACING \
|
/freebsd-10.1-release/contrib/gcc/ |
H A D | bb-reorder.c | 21 /* This (greedy) algorithm constructs traces in several rounds. 26 probable successor to the end of a trace. Finally it connects the traces. 39 other seeds for this round and the secondary traces will start in them. 50 When connecting traces it first checks whether there is an edge from the 52 When there are still some unconnected traces it checks whether there exists 55 BB is duplicated and the traces are connected through this duplicate. 56 The rest of traces are simply connected so there will be a jump to the 113 block the edge destination is not duplicated while connecting traces. */ 196 collected into traces until the very last round); or 2). There will 220 /* Find the traces fo 224 find_traces(int *n_traces, struct trace *traces) argument 428 find_traces_1_round(int branch_th, int exec_th, gcov_type count_th, struct trace *traces, int *n_traces, int round, fibheap_t *heap, int number_of_rounds) argument 897 connect_traces(int n_traces, struct trace *traces) argument 1895 struct trace *traces; local [all...] |
/freebsd-10.1-release/contrib/sendmail/contrib/ |
H A D | expn.pl | 1277 will recurse as it traces addresses, use the
|
Completed in 188 milliseconds