HomeSort by: relevance | last modified time | path
    Searched defs:pred (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/profile/
GCDAProfiling.c 332 uint32_t pred; local
334 pred = *predecessor;
335 if (pred == 0xffffffff)
337 counter = counters[pred];
339 /* Don't crash if the pred# is out of sync. This can happen due to threads,
346 "llvmgcda: increment_indirect_counter counters=%08llx, pred=%u\n",
GCDAProfiling.c 332 uint32_t pred; local
334 pred = *predecessor;
335 if (pred == 0xffffffff)
337 counter = counters[pred];
339 /* Don't crash if the pred# is out of sync. This can happen due to threads,
346 "llvmgcda: increment_indirect_counter counters=%08llx, pred=%u\n",
  /src/sys/arch/riscv/riscv/
db_disasm.c 1325 unsigned pred, succ; local
1328 pred = (imm >> 4) & 0xf;
1331 db_print_riscv_fencebits(pred);
db_disasm.c 1325 unsigned pred, succ; local
1328 pred = (imm >> 4) & 0xf;
1331 db_print_riscv_fencebits(pred);
  /src/usr.bin/diff/
diffreg.c 127 * new k-candidate is chained (via pred) to the current k-1 candidate so
150 int pred; member in struct:cand
628 newcand(int x, int y, int pred)
639 q->pred = pred;
676 for (q = clist + p; q->y != 0; q = clist + q->pred)
diffreg.c 127 * new k-candidate is chained (via pred) to the current k-1 candidate so
150 int pred; member in struct:cand
628 newcand(int x, int y, int pred)
639 q->pred = pred;
676 for (q = clist + p; q->y != 0; q = clist + q->pred)

Completed in 44 milliseconds