| /NextBSD/contrib/gcc/ |
| HD | reorg.c | 609 rtx trial, seq_insn, seq, prev; in delete_from_delay_slot() local 618 for (trial = insn; in delete_from_delay_slot() 619 PREV_INSN (NEXT_INSN (trial)) == trial; in delete_from_delay_slot() 620 trial = NEXT_INSN (trial)) in delete_from_delay_slot() 623 seq_insn = PREV_INSN (NEXT_INSN (trial)); in delete_from_delay_slot() 639 trial = XVECEXP (seq, 0, 0); in delete_from_delay_slot() 641 add_insn_after (trial, prev); in delete_from_delay_slot() 645 emit_barrier_after (trial); in delete_from_delay_slot() 650 trial = emit_delay_sequence (trial, delay_list, XVECLEN (seq, 0) - 2); in delete_from_delay_slot() 651 else if (INSN_P (trial)) in delete_from_delay_slot() [all …]
|
| HD | emit-rtl.c | 3105 try_split (rtx pat, rtx trial, int last) in try_split() argument 3107 rtx before = PREV_INSN (trial); in try_split() 3108 rtx after = NEXT_INSN (trial); in try_split() 3116 if (any_condjump_p (trial) in try_split() 3117 && (note = find_reg_note (trial, REG_BR_PROB, 0))) in try_split() 3121 seq = split_insns (pat, trial); in try_split() 3134 return trial; in try_split() 3143 return trial; in try_split() 3175 if (CALL_P (trial)) in try_split() 3183 *p = CALL_INSN_FUNCTION_USAGE (trial); in try_split() [all …]
|
| HD | cse.c | 5553 rtx trial; in cse_insn() local 5598 trial = src_folded, src_folded_cost = MAX_COST; in cse_insn() 5601 rtx forced = force_const_mem (mode, trial); in cse_insn() 5603 trial = forced; in cse_insn() 5613 trial = src, src_cost = MAX_COST; in cse_insn() 5619 trial = copy_rtx (src_eqv_here), src_eqv_cost = MAX_COST; in cse_insn() 5623 trial = copy_rtx (src_related), src_related_cost = MAX_COST; in cse_insn() 5626 trial = copy_rtx (elt->exp); in cse_insn() 5641 && (trial == pc_rtx in cse_insn() 5642 || (GET_CODE (trial) == LABEL_REF in cse_insn() [all …]
|
| HD | resource.c | 1299 mark_end_of_function_resources (rtx trial, int include_delayed_effects) in mark_end_of_function_resources() argument 1301 mark_referenced_resources (trial, &end_of_function_needs, in mark_end_of_function_resources()
|
| /NextBSD/contrib/byacc/test/btyacc/ |
| HD | btyacc_calc1.output | 148 '+' [trial] shift 20 149 '-' [trial] shift 21 150 '*' [trial] shift 22 151 '/' [trial] shift 23 152 '+' [trial] reduce 16 153 '-' [trial] reduce 16 154 '*' [trial] reduce 16 155 '/' [trial] reduce 16 156 '\n' [trial] reduce 4 157 '\n' [trial] reduce 16 [all …]
|
| HD | btyacc_demo.output | 258 ID [trial] reduce 1 259 ID [trial] reduce 10 276 CLCL [trial] shift 21 286 CLCL [trial] reduce 4 306 '(' [trial] shift 23 308 '(' [trial] reduce 29 465 '(' [trial] shift 23 467 '(' [trial] reduce 29 539 '(' [trial] shift 23 541 '(' [trial] reduce 29 [all …]
|
| /NextBSD/tools/tools/netrate/tcpp/ |
| HD | parallelism.csh | 21 foreach trial (`jot $trials`) 24 echo -n $2,${core},${trial}, >> $1
|
| /NextBSD/contrib/byacc/ |
| HD | btyaccpar.skel | 427 /* in trial mode; save scanner results for future parse attempts */ 494 fprintf(stderr, "%s[%d]: CONFLICT in state %d: following successful trial parse\n", 509 /* Unresolved conflict - start/continue trial parse */ 516 fputs("ALREADY in conflict, continuing trial parse.\n", stderr); 518 fputs("Starting trial parse.\n", stderr); 717 fprintf(stderr, "%sdebug[%d,trial]: trial parse FAILED, entering ERROR mode\n", 938 /* in trial mode; save scanner results for future parse attempts */ 1030 …fprintf(stderr, "%s[%d]: state %d, CONFLICT trial successful, backtracking to state %d, %d tokens\…
|
| HD | README.BTYACC | 317 (conflict that happens while trial-processing another 340 while processing in trial mode for another conflict), we 342 being in trial. 371 stream state), and goes into trial parse mode. It then 378 point where it first entered trial parse mode, and 380 following the path of the successful trial. 383 are only executed when not in trial mode, and []-actions
|
| /NextBSD/crypto/openssl/doc/crypto/ |
| HD | DSA_generate_parameters.pod | 53 When a candidate for q has passed a test by trial division, 72 When a candidate for p has passed the test by trial division,
|
| HD | BN_generate_prime.pod | 85 first attempts trial division by a number of small primes;
|
| /NextBSD/contrib/gcc/config/sparc/ |
| HD | sparc.c | 2453 tls_call_delay (rtx trial) in tls_call_delay() argument 2464 pat = PATTERN (trial); in tls_call_delay() 2494 eligible_for_restore_insn (rtx trial, bool return_p) in eligible_for_restore_insn() argument 2496 rtx pat = PATTERN (trial); in eligible_for_restore_insn() 2525 && (get_attr_in_uncond_branch_delay (trial) in eligible_for_restore_insn() 2565 eligible_for_return_delay (rtx trial) in eligible_for_return_delay() argument 2569 if (GET_CODE (trial) != INSN || GET_CODE (PATTERN (trial)) != SET) in eligible_for_return_delay() 2572 if (get_attr_length (trial) != 1) in eligible_for_return_delay() 2587 return get_attr_in_uncond_branch_delay (trial) in eligible_for_return_delay() 2590 pat = PATTERN (trial); in eligible_for_return_delay() [all …]
|
| /NextBSD/sys/net/ |
| HD | radix.c | 87 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, 259 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip) in rn_satisfies_leaf() argument 261 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; in rn_satisfies_leaf()
|
| /NextBSD/contrib/gcc/cp/ |
| HD | typeck.c | 1206 tree trial = common_base_type (basetype, tt2); in common_base_type() local 1208 if (trial) in common_base_type() 1210 if (trial == error_mark_node) in common_base_type() 1211 return trial; in common_base_type() 1213 best = trial; in common_base_type() 1214 else if (best != trial) in common_base_type() 1223 tree trial = common_base_type (tt1, basetype); in common_base_type() local 1225 if (trial) in common_base_type() 1227 if (trial == error_mark_node) in common_base_type() 1228 return trial; in common_base_type() [all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | virtual | 37 # Made by reading sources, reading documentation, and doing trial and error
|
| /NextBSD/sbin/routed/ |
| HD | radix.c | 185 rn_satisfies_leaf(char *trial, in rn_satisfies_leaf() argument 189 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; in rn_satisfies_leaf()
|
| /NextBSD/sys/dev/ixl/ |
| HD | README | 342 require some trial and error.
|
| /NextBSD/crypto/heimdal/lib/kafs/ |
| HD | ChangeLog | 287 * common.c: remove the trial of afs@REALM for cell != realm, it
|
| /NextBSD/contrib/tzdata/ |
| HD | africa | 507 # Mauritius plans to observe DST from 2008-11-01 to 2009-03-31 on a trial 583 # "The trial ended on March 29, 2009, when the clocks moved back by one hour
|
| HD | southamerica | 1431 # IMPORTANT NOTE: During 2011, on a trial basis, the Falkland Islands 1434 # change to local time following the trial period will be notified. 1443 # summer time on a trial basis only. FIG need to contact IANA and/or
|
| HD | australasia | 1413 # the 1989/90 year was a trial of an extended "daylight saving" period. 1414 # This trial was deemed successful and the extended period adopted for
|
| HD | asia | 1995 # it's not on a trial basis. Also, the "between the first Saturday
|
| HD | europe | 1103 # During these two first trial years the DST adjustment was made one hour
|
| /NextBSD/share/dict/ |
| HD | web2a | 21040 field trial 45337 quasi trial 52550 self-trial 59005 state trial 66796 trial-and-error 66797 trial balance 66798 trial balloon 66799 trial brief 66800 trial case 66801 trial court [all …]
|
| /NextBSD/crypto/openssl/ |
| HD | CHANGES | 8409 As BN_is_prime_fasttest includes trial division, DSA parameter 8420 candidate has passed the trial division test (when q is generated 8421 from an application-provided seed, trial division is skipped). 8424 *) New function BN_is_prime_fasttest that optionally does trial 8429 trial division stage. 9153 trial decode on each line until they find one that works. When they
|