/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr67794.c | 4 static void fn1(int *best, int *dmin) { argument 7 __asm__ volatile("" : "+&r"(dmin) : ""(best)); 10 __attribute__((always_inline)) static inline void fn2(int *best) { fn1(best, b); } argument
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/ |
H A D | pr42914.c | 7 int current, best; local 18 if(current < best) 20 best = current;
|
/haiku-buildtools/isl/ |
H A D | isl_blk.c | 81 int best = 0; local 82 for (i = 1; ctx->cache[best].size != n && i < ctx->n_cached; ++i) { 83 if (ctx->cache[best].size < n) { 84 if (ctx->cache[i].size > ctx->cache[best].size) 85 best = i; 87 ctx->cache[i].size < ctx->cache[best].size) 88 best = i; 90 if (ctx->cache[best].size < 2 * n + 100) { 91 block = ctx->cache[best]; 92 if (--ctx->n_cached != best) [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | tracer.c | 169 edge best = NULL; local 173 if (!best || better_p (e, best)) 174 best = e; 175 if (!best || ignore_bb_p (best->dest)) 177 if (best->probability <= probability_cutoff) 179 return best; 188 edge best = NULL; local 192 if (!best || better_ [all...] |
H A D | cfgloopanal.c | 511 edge best = NULL; local 516 if ((!best || e->probability > best->probability) 519 best = e; 520 if (!best || best->dest == loop->header) 522 bb = best->dest;
|
H A D | bb-reorder.c | 376 /* Information about the best end (end after rotation) of the loop. */ 381 /* The best edge is preferred when its destination is not visited yet 400 /* The best edge is preferred. */ 549 /* The probability and frequency of the best edge. */ 614 /* If the best destination has multiple predecessors, and can be 621 /* If the best destination has multiple successors or predecessors, 623 sure predecessors with smaller index are handled before the best 632 If we do not remove the best edge B->D/C->D, the final order might 637 After removing the best edge, the final result will be ABCD/ ACBD. 773 When optimizing for size, A B C is always the best orde 1122 edge e, best; local [all...] |
H A D | ira-costs.c | 1640 and their best costs. Set up preferred, alternative and allocno 1689 /* Normally we scan the insns once and determine the best class to 1691 on, we do so twice, the second time using the tentative best 1745 enum reg_class best, alt_class; 1837 best = ALL_REGS; 1839 /* Find best common class for all allocnos with the same 1847 best = (enum reg_class) rclass; 1850 best = ira_reg_class_subunion[best][rclass]; 1867 else if (!optimize && !targetm.class_likely_spilled_p (best)) 1738 enum reg_class best, alt_class; local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/modifiers/ |
H A D | 64422.cc | 33 char best[] = "best"; local 34 x.replace (x.begin (), x.end (), best, best + 4);
|
/haiku-buildtools/gcc/maintainer-scripts/ |
H A D | generate_libstdcxx_web_docs | 46 gzip --best libstdc++-$which.xml 47 gzip --best libstdc++-$which.pdf
|
H A D | update_web_docs_svn | 202 cat $file | gzip --best > $file.gz
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | pr38385.c | 45 int best; local 98 if (! bad && best > losers)
|
/haiku-buildtools/legacy/binutils/bfd/ |
H A D | cpu-sh.c | 436 unsigned int best = ~arch_set; local 460 if (((try & ~arch_set) < (best & ~arch_set) 461 || ((try & ~arch_set) == (best & ~arch_set) 462 && (~try & arch_set) < (~best & arch_set))) 466 best = try;
|
/haiku-buildtools/binutils/bfd/ |
H A D | cpu-sh.c | 457 unsigned int best = ~arch_set; local 481 if (((try & ~arch_set) < (best & ~arch_set) 482 || ((try & ~arch_set) == (best & ~arch_set) 483 && (~try & arch_set) < (~best & arch_set))) 487 best = try;
|
/haiku-buildtools/binutils/gas/testsuite/gas/cris/ |
H A D | bwtest-err-1.s | 65 ; best I could get without major changes in BW-handling. Not
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/cris/ |
H A D | bwtest-err-1.s | 65 ; best I could get without major changes in BW-handling. Not
|
/haiku-buildtools/legacy/binutils/opcodes/ |
H A D | m68k-dis.c | 1203 /* Try to match the current instruction to best and if so, return the 1209 const struct m68k_opcode * best) 1229 for (d = best->args; *d; d += 2) 1269 if (p - buffer < 4 && (best->match & 0xFFFF) != 0) 1275 && (best->match & 0xffff) == 0xffff 1276 && best->args[0] == '#' 1277 && best->args[1] == 'w') 1291 d = best->args; 1316 best->name, best 1205 match_insn_m68k(bfd_vma memaddr, disassemble_info * info, const struct m68k_opcode * best) argument [all...] |
/haiku-buildtools/gcc/mpfr/tune/ |
H A D | bidimensional_sample.c | 34 /* We wish to have a quick overview of which implementation is the best */ 38 /* method is the best. */ 69 /* implementations, return i, such that t[i] is the best timing. */ 74 double best; local 83 best = t[0]; 86 if (t[i]<best) 88 best = t[i];
|
/haiku-buildtools/legacy/gcc/texinfo/util/ |
H A D | texindex.c | 1560 struct linebuffer *best = 0; 1570 (!best || 1571 0 < compare_general (best->buffer, thisline[i]->buffer, 1574 best = thisline[i]; 1584 best->buffer, 0L, 1L, num_keyfields - 1))) 1585 indexify (best->buffer, ostream); 1586 prev_out = best; 1548 struct linebuffer *best = 0; local
|
/haiku-buildtools/binutils/opcodes/ |
H A D | m68k-dis.c | 1321 /* Try to match the current instruction to best and if so, return the 1327 const struct m68k_opcode * best) 1332 const char *args = best->args; 1391 if (p - buffer < 4 && (best->match & 0xFFFF) != 0) 1397 && (best->match & 0xffff) == 0xffff 1440 best->name, best->args); 1451 info->fprintf_func (info->stream, "%s", best->name); 1323 match_insn_m68k(bfd_vma memaddr, disassemble_info * info, const struct m68k_opcode * best) argument
|
/haiku-buildtools/isl/interface/ |
H A D | python.cc | 101 string best; local 107 best = ci->first; 110 return classes[best];
|
/haiku-buildtools/legacy/gcc/gcc/java/ |
H A D | decl.c | 123 tree best = NULL_TREE; local 136 if (best == NULL_TREE 137 || (TREE_TYPE (decl) == type && TREE_TYPE (best) != type) 138 || DECL_LOCAL_START_PC (decl) > DECL_LOCAL_START_PC (best) 140 best = decl; 144 if (best != NULL_TREE) 145 return best;
|
/haiku-buildtools/gcc/gcc/config/tilepro/ |
H A D | gen-mul-tables.cc | 48 Once this program has determined the best instruction sequence for 528 /* See if we found the best solution for n. */ 538 ExpressionTreeMap::iterator best (best_solution.find (n)); 539 if (best == best_solution.end () 540 || (*best).second->cost () > s.cost ())
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | regclass.c | 707 /* Return the reg_class in which pseudo reg number REGNO is best allocated. 1020 /* Normally we scan the insns once and determine the best class to use for 1022 twice, the second time using the tentative best classes to guide the 1059 enum reg_class best = ALL_REGS, alt = NO_REGS; 1079 best = (enum reg_class) class; 1082 best = reg_class_subunion[(int)best][class]; 1104 if (alt == best) 1108 prefclass[i] = (int) best; 1056 enum reg_class best = ALL_REGS, alt = NO_REGS; local
|
/haiku-buildtools/gcc/gmp/mpn/x86/pentium4/sse2/ |
H A D | addlsh1_n.asm | 32 C that's used seems to work best. Not sure why, but %ecx,4 with src1 and/or
|
H A D | rsh1add_n.asm | 32 C that's used seems to work best. Not sure why, but for instance leal
|