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

  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.mi/
mi-stack.c 41 void callee2 (int intarg, char *strarg) function
48 callee2 (intarg, strarg);
basics.c 39 void callee2 (int intarg, char *strarg) function
46 callee2 (intarg, strarg);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.mi/
mi-stack.c 41 void callee2 (int intarg, char *strarg) function
48 callee2 (intarg, strarg);
basics.c 39 void callee2 (int intarg, char *strarg) function
46 callee2 (intarg, strarg);
  /src/sys/external/bsd/compiler_rt/dist/test/profile/
instrprof-value-prof-2.c 21 void callee2() {} function
40 func == callee1 || func == callee2 || func == main)
54 __llvm_profile_instrument_target((uint64_t)&callee2, (void *)Data, S);
73 // CHECK-NEXT: [ 0, callee2, 1 ]
75 // CHECK-NEXT: [ 1, callee2, 1 ]
77 // CHECK-NEXT: [ 2, callee2, 2 ]
79 // CHECK-NEXT: [ 3, callee2, 2 ]
81 // CHECK-NEXT: [ 4, callee2, 3 ]
83 // CHECK-NEXT: [ 5, callee2, 3 ]
85 // CHECK-NEXT: [ 6, callee2, 4
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
restore.c 136 callee2 (int n) function
138 register int l1 = increment (n); /* callee2 prologue */
183 n = callee2 (n + l1);
198 n = callee2 (n + l2);
214 n = callee2 (n + l3);
231 n = callee2 (n + l4);
249 n = callee2 (n + l5);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
restore.c 136 callee2 (int n) function
138 register int l1 = increment (n); /* callee2 prologue */
183 n = callee2 (n + l1);
198 n = callee2 (n + l2);
214 n = callee2 (n + l3);
231 n = callee2 (n + l4);
249 n = callee2 (n + l5);
  /src/external/gpl3/gcc/dist/gcc/
ipa-inline.cc 731 struct cgraph_node *callee2 = e2->callee->ultimate_alias_target (); local
734 if (DECL_DISREGARD_INLINE_LIMITS (callee2->decl)
735 || lookup_attribute ("always_inline", DECL_ATTRIBUTES (callee2->decl)))
746 if (flag_lto && callee2->externally_visible)

Completed in 31 milliseconds