| /freebsd-12-stable/sbin/restore/ |
| D | tape.c | 1415 static long predict; in accthdr() local 1447 if (predict != blksread - 1) in accthdr() 1449 predict, blksread - 1); in accthdr() 1457 predict = blks; in accthdr()
|
| /freebsd-12-stable/contrib/gcc/config/arm/ |
| D | arm926ejs.md | 170 ;; core can predict most branches. If the branch is predicted
|
| D | arm1026ejs.md | 223 ;; core can predict most branches. If the branch is predicted
|
| D | arm1020e.md | 228 ;; core can predict most branches. If the branch is predicted
|
| /freebsd-12-stable/gnu/usr.bin/cc/cc_int/ |
| D | Makefile | 52 params.o postreload.o postreload-gcse.o predict.o \
|
| /freebsd-12-stable/contrib/gcc/config/s390/ |
| D | s390-modes.def | 97 If you know whether the used constant is positive or negative you can predict
|
| /freebsd-12-stable/contrib/gcc/doc/ |
| D | cfg.texi | 390 @findex predict.def 392 attempt to predict the behavior of each branch in the program using a 393 set of heuristics (see @file{predict.def} for details) and compute
|
| D | passes.texi | 347 execution frequencies. The pass is located in @file{predict.c} and 849 prediction routines are in @file{predict.c}.
|
| /freebsd-12-stable/contrib/gcc/ |
| D | ChangeLog-2001 | 218 * predict.c: Likewise. 503 * predict.c: Reformatting and minor cleanups. 1631 * predict.def (PRED_NORETURN): Make probabilities match reality. 1779 * predict.c (estimate_probability): Fix LOOP_EXIT heuristic. 1966 * predict.c (estimate_probability): Reorganize opcode heuristics. 1967 * predict.def (PRED_OPCODE_POSITIVE, PRED_OPCODE_NONEQUAL, 1998 * predict.c (estimate_probability): Distribute the loop exit 4175 explow.c, function.c, gcse.c, genrecog.c, predict.c, regmove.c, 4178 * predict.c, reg-stack.c: Fix spelling errors. 4617 * predict.c (propagate_freq): Make cyclic_probability and frequency [all …]
|
| D | Makefile.in | 796 PREDICT_H = predict.h predict.def 1009 params.o postreload.o postreload-gcse.o predict.o \
|
| D | params.def | 343 "The maximum number of loop iterations we predict statically",
|
| D | ChangeLog-2002 | 189 * predict.c: Likewise. 1618 optabs.c, params.c, predict.c, prefix.c, print-rtl.c, 4738 * predict.c (can_predict_insn_p): New function. 5724 * predict.c (choose_function_section): Avoid choice for linkonce functions. 6086 * predict.def: Likewise. 8260 * predict.c (estimate_loops_at_level): Use gcov_type. 12773 * predict.c (PROB_NEVER, PROB_LIKELY, PROB_UNLIKELY): Remove. 15084 * predict.c (process_note_predictions, process_note_prediction, 18801 * predict.c (propagate_freq, estimate_probability, 19617 * predict.c (estimate_bb_frequencies): Remove unneccessary code. [all …]
|
| D | ChangeLog-2004 | 4112 * predict.c (predict_loops, propagate_freq): Likewise. 4620 * predict.h (predict_insn): Remove extern declaration. 4621 * predict.c (predict_insn): Make static. 5211 lambda-code.c, postreload.c, predict.c, tree-sra.c, 6365 * predict.c (propagate_freq): Make bitno unsigned. Move 6562 * predict.c (struct block_info_def): Kill "tovisit" field. 7781 * predict.c (predict_loops): Call scev_finalize instead of 8547 * predict.c (tree_estimate_probability): Mark irreducible 8590 predict.def, predict.h, protoize.c, reload.h, resource.h, 10858 * predict.c (can_predict_insn_p): Likewise. [all …]
|
| D | ChangeLog-2005 | 935 * predict.c (predict_loops, tree_bb_level_predictions, 1617 * predict.c (tree_predicted_by_p): Likewise for struct edge_prediction. 4894 * predict.c (predict_loops): Use new param. 4895 * predict.def (MAX_PRED_LOOP_ITERATIONS): Remove. 5235 * predict.c (predict_loops): Do not estimate more than 5237 * predict.def (MAX_PRED_LOOP_ITERATIONS): Define. 9742 loop-invariant.c, predict.c, predict.def, reload1.c, reorg.c, 10919 * predict.c (predict_loops): Adjust call to number_of_iterations_exit. 11448 * predict.c (return_prediction): Initialize return_stmt. 14062 * function.c: Include predict.h. [all …]
|
| D | ChangeLog-2003 | 267 * predict.c (process_note_predictions, process_note_prediction, 640 * predict.h: Likewise. 918 * predict.c (struct block_info_def, struct edge_info_def): Change 1285 loop.c, postreload.c, predict.c, profile.c, ra-build.c, ra-debug.c, 8581 * predict.c (estimate_probability, expected_value_to_br_prob): Ditto. 20062 * predict.h: Convert to ISO C90 prototypes. 20063 * predict.c: Likewise. 25526 * predict.c (maybe_hot_bb_p, probably_cold_bb_p, 25711 (profile.o, loop-init.o, sched-ebb.o, predict.o, tracer.o): Adjust 25730 * tracer.c, predict.c, sched-ebb.c: Adjust #includes. [all …]
|
| D | ChangeLog-2000 | 2284 * predict.c (estimate_probability): Likewise. 18226 * predict.c (hard-reg-set.h): Likewise. 19295 * predict.c (PROB_NEVER, PROB_VERY_UNLIKELY): New. 19652 * predict.c: Remove May 4 change. 19732 * predict.c (estimate_probability): If no prediction was found, then 19733 predict the successor that is the next physical block (if such a 19778 * predict.c (find_expected_value): Delete prototype. 21207 * predict.c (estimate_probability): Examine both sides of 21208 a branch for no exits. Use 90% not 50% for predict taken. 21227 * predict.c (expected_value_to_br_prob): Don't bomb if op1 of [all …]
|
| D | ChangeLog-2006 | 2518 * predict.c: Fix comment typos. 2555 * predict.c (probability_reliable_p): New predicate. 2557 (predict_loops): Do not predict loop exit with less than 2% 5075 lambda-code.c, libgcc2.h, omp-low.c, optabs.c, predict.c, 9779 * predict.c (estimate_probability): Remove. 10526 * predict.c (tree_estimate_probability): Ditto. 10976 * predict.c (tree_estimate_probability): Always strip builtin_expect. 12662 * predict.c (combine_predictions_for_bb, tree_estimate_probability): 13177 * predict.c: Ditto.
|
| /freebsd-12-stable/contrib/atf/atf-sh/ |
| D | libatf-sh.subr | 315 # Relative paths are not allowed because the test case cannot predict
|
| /freebsd-12-stable/sys/netpfil/ipfilter/netinet/ |
| D | fil.c | 7668 int predict; local 7736 predict = 1; 7738 predict = 1; 7740 predict = 0; 7760 it.iri_rule = predict ? next : NULL; 7761 if (predict == 0)
|
| /freebsd-12-stable/contrib/libevent/ |
| D | whatsnew-2.0.txt | 567 Network code very frequently needs a secure, hard-to-predict random number
|
| /freebsd-12-stable/contrib/ntp/sntp/libevent/ |
| D | whatsnew-2.0.txt | 567 Network code very frequently needs a secure, hard-to-predict random number
|
| /freebsd-12-stable/share/examples/ppp/ |
| D | ppp.conf.sample | 50 # can't predict what their IP will be either, take a wild guess at
|
| /freebsd-12-stable/usr.sbin/bsdconfig/share/ |
| D | dialog.subr | 1373 # When using dialog(1), we can't predict whether the user has 1475 # When using dialog(1), we can't predict whether the user has
|
| /freebsd-12-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/ |
| D | Checkers.td | 607 "known, which allows us to predict precisely when "
|
| /freebsd-12-stable/crypto/heimdal/lib/wind/ |
| D | rfc3492.txt | 373 predict the minimum number of digits needed to represent the next
|