/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20020615-1.c | 23 int hints; local 37 hints = dy > 0 ? 2 : 1; 39 hints ^= 3; 41 hints = dx < 0 ? 8 : 4; 43 hints ^= 12; 45 hints = 0; 46 return hints;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert/ |
H A D | unordered_multiset_hint.cc | 56 std::vector<typename ums_t::iterator> hints; local 57 hints.reserve(strs.size()); 59 hints.push_back(ms.insert(str)); 63 ms.insert(hints[i], strs[i]); 70 std::vector<typename ums_t::iterator> hints; local 71 hints.reserve(strs.size()); 73 hints.push_back(ms.insert(str)); 77 ms.insert(hints[i], strs[i]); 87 std::vector<typename ums_t::iterator> hints; local 88 hints 106 std::vector<typename ums_t::iterator> hints; local 120 std::vector<typename ums_t::iterator> hints; local 138 std::vector<typename ums_t::iterator> hints; local 152 std::vector<typename ums_t::iterator> hints; local 170 std::vector<typename ums_t::iterator> hints; local [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | ipa-inline-analysis.c | 645 /* Dump inline hints. */ 647 dump_inline_hints (FILE *f, inline_hints hints) argument 649 if (!hints) 651 fprintf (f, "inline hints:"); 652 if (hints & INLINE_HINT_indirect_call) 654 hints &= ~INLINE_HINT_indirect_call; 657 if (hints & INLINE_HINT_loop_iterations) 659 hints &= ~INLINE_HINT_loop_iterations; 662 if (hints & INLINE_HINT_loop_stride) 664 hints 3108 estimate_edge_size_and_time(struct cgraph_edge *e, int *size, int *min_size, int *time, int prob, vec<tree> known_vals, vec<ipa_polymorphic_call_context> known_contexts, vec<ipa_agg_jump_function_p> known_aggs, inline_hints *hints) argument 3142 estimate_calls_size_and_time(struct cgraph_node *node, int *size, int *min_size, int *time, inline_hints *hints, clause_t possible_truths, vec<tree> known_vals, vec<ipa_polymorphic_call_context> known_contexts, vec<ipa_agg_jump_function_p> known_aggs) argument 3227 inline_hints hints = 0; local 3319 estimate_ipcp_clone_size_and_time(struct cgraph_node *node, vec<tree> known_vals, vec<ipa_polymorphic_call_context> known_contexts, vec<ipa_agg_jump_function_p> known_aggs, int *ret_size, int *ret_time, inline_hints *hints) argument 3733 int hints = 0; local 3763 inline_hints hints; local 3858 inline_hints hints; local [all...] |
H A D | ipa-inline.h | 50 /* Inline hints are reasons why inline heuristics should preffer inlining given 232 inline_hints hints; member in struct:edge_growth_cache_entry 334 || !(ret = edge_growth_cache[edge->uid].hints))
|
H A D | ipa-inline.c | 762 inline candidate. At the moment we allow inline hints to 787 inline_hints hints = estimate_edge_hints (e); local 793 hints suggests that inlining given function is very profitable. */ 797 && !(hints & (INLINE_HINT_indirect_call 819 Upgrade it to MAX_INLINE_INSNS_SINGLE when hints suggests that 823 && !(hints & INLINE_HINT_known_hot) 824 && growth >= ((hints & (INLINE_HINT_indirect_call 1050 inline_hints hints; local 1057 hints = estimate_edge_hints (edge); 1072 dump_inline_hints (dump_file, hints); [all...] |
H A D | ipa-cp.c | 2151 hint_time_bonus (inline_hints hints) argument 2154 if (hints & (INLINE_HINT_loop_iterations | INLINE_HINT_loop_stride)) 2156 if (hints & INLINE_HINT_array_index) 2366 inline_hints hints; local 2370 &hints); 2374 + hint_time_bonus (hints) 2419 inline_hints hints; local 2426 known_aggs_ptrs, &size, &time, &hints); 2429 time -= hint_time_bonus (hints);
|
/haiku-buildtools/binutils/gas/testsuite/gas/arm/ |
H A D | sp-pc-validations-bad-t.s | 131 ldrh.w pc, [r0] @ => Unallocated memory hints 152 ldrh.w pc,[r0,r1,LSL #1] @ => Unallocated memory hints 195 ldrsh pc,[r0,#4] @ => Unallocated memory hints 197 ldrsh pc, [r0, #-4] @ => Unallocated memory hints 205 ldrsh pc, label @ => Unallocated memory hints 214 ldrsh.w pc,[r0,r1,LSL #3] @ => Unallocated memory hints
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
H A D | named.go | 36 // (in the absence of any implicit conversion hints)
|
/haiku-buildtools/binutils/binutils/ |
H A D | od-macho.c | 85 twolevel_hints Display the two-level namespace lookup hints table\n\ 1413 non_fatal (_("cannot read twolevel hints")); 1626 bfd_mach_o_twolevel_hints_command *hints = 1629 printf (" table offset: 0x%08x nbr hints: %u\n", 1630 hints->offset, hints->nhints); 1632 dump_twolevel_hints (abfd, hints); 1624 bfd_mach_o_twolevel_hints_command *hints = local
|
/haiku-buildtools/gcc/gmp/mpn/ia64/ |
H A D | gcd_1.asm | 96 C Lack of branch hints might introduce a couple of bubbles too.
|
/haiku-buildtools/gcc/libsanitizer/tsan/ |
H A D | tsan_interceptors.cc | 2081 void *hints, void *rv) { 2082 SCOPED_TSAN_INTERCEPTOR(getaddrinfo, node, service, hints, rv); 2087 int res = REAL(getaddrinfo)(node, service, hints, rv); 2080 TSAN_INTERCEPTOR(int, getaddrinfo, void *node, void *service, void *hints, void *rv) argument
|
/haiku-buildtools/gcc/libsanitizer/sanitizer_common/ |
H A D | sanitizer_common_interceptors.inc | 1710 struct __sanitizer_addrinfo *hints, 1713 COMMON_INTERCEPTOR_ENTER(ctx, getaddrinfo, node, service, hints, out); 1717 if (hints) 1718 COMMON_INTERCEPTOR_READ_RANGE(ctx, hints, sizeof(__sanitizer_addrinfo)); 1722 int res = REAL(getaddrinfo)(node, service, hints, out);
|
/haiku-buildtools/legacy/binutils/ld/ |
H A D | Makefile.am | 423 ldwrite.h mri.h deffile.h pe-dll.h elf-hints-local.h
|
H A D | configure | 8615 for ac_header in string.h strings.h stdlib.h unistd.h elf-hints.h
|
/haiku-buildtools/binutils/ld/ |
H A D | Makefile.am | 547 elf-hints-local.h $(PLUGIN_H) ldbuildid.h
|
H A D | Makefile.in | 915 elf-hints-local.h $(PLUGIN_H) ldbuildid.h
|
H A D | configure | 16418 for ac_header in string.h strings.h stdlib.h unistd.h elf-hints.h limits.h locale.h sys/param.h
|