Searched refs:callee (Results 1 - 25 of 32) sorted by relevance

12

/freebsd-9.3-release/contrib/gcc/
H A Dipa-inline.c122 if (!e->callee->callers->next_caller
123 && !e->callee->needed
126 gcc_assert (!e->callee->global.inlined_to);
127 if (DECL_SAVED_TREE (e->callee->decl))
128 overall_insns -= e->callee->global.insns, nfunctions_inlined++;
134 n = cgraph_clone_node (e->callee, e->count, e->loop_nest,
141 e->callee->global.inlined_to = e->caller->global.inlined_to;
143 e->callee->global.inlined_to = e->caller;
146 for (e = e->callee->callees; e; e = e->next_callee)
161 if (e->callee
844 struct cgraph_node *callee; local
[all...]
H A Dipa.c135 if (!e->callee->aux
137 && (!e->inline_failed || !e->callee->analyzed
138 || (!DECL_EXTERNAL (e->callee->decl))
141 e->callee->aux = first;
142 first = e->callee;
H A Dtree-optimize.c387 if (e->callee->global.inlined_to)
389 e->callee->global.inlined_to = inlined_to;
390 update_inlined_to_pointers (e->callee, inlined_to);
449 if (e->callee->analyzed)
450 cgraph_mark_needed_node (e->callee);
H A Dtree-ssa-ccp.c2198 tree callee, arglist, a; local
2207 callee = get_callee_fndecl (fn);
2209 result = fold_builtin (callee, arglist, ignore);
2218 if (DECL_BUILT_IN_CLASS (callee) == BUILT_IN_MD)
2227 switch (DECL_FUNCTION_CODE (callee))
2279 switch (DECL_FUNCTION_CODE (callee))
2297 result = fold_builtin_strcpy (callee, arglist, val[1]);
2302 result = fold_builtin_strncpy (callee, arglist, val[1]);
2322 result = fold_builtin_memory_chk (callee, arglist, val[2], ignore,
2323 DECL_FUNCTION_CODE (callee));
2390 tree callee; local
2530 tree callee, result; local
[all...]
H A Dtree-stdarg.c636 tree call = get_call_expr_in (stmt), callee; local
642 callee = get_callee_fndecl (call);
643 if (!callee
644 || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL)
647 switch (DECL_FUNCTION_CODE (callee))
801 tree callee = get_callee_fndecl (call); local
803 if (callee
804 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL
805 && (DECL_FUNCTION_CODE (callee) == BUILT_IN_VA_START
806 || DECL_FUNCTION_CODE (callee)
[all...]
H A Dcgraph.c63 For each inlined call, the callee's node is cloned to represent the
65 Each inlined call gets a unique corresponding clone node of the callee
67 the clones are eliminated and their callee edges redirected to the
377 cgraph_create_edge (struct cgraph_node *caller, struct cgraph_node *callee, argument
390 if (!DECL_SAVED_TREE (callee->decl))
392 else if (callee->local.redefined_extern_inline)
395 else if (callee->local.inlinable)
403 edge->callee = callee;
406 edge->next_caller = callee
[all...]
H A Dipa-cp.c118 to call the cloned callee.
119 In the second case, both the caller and the callee have clones
121 the cloned callee.
534 != ipa_method_formal_count (cs->callee))
539 ipa_method_formal_count_set (cs->callee, 0);
571 the caller's parameters to the callee's arguments. */
578 struct cgraph_node *mt, *callee; local
593 callee = ipa_callsite_callee (cs);
601 cval2 = ipcp_method_cval (callee, i);
605 ipcp_method_cval_set (callee,
891 struct cgraph_node *caller, *callee, *orig_callee; local
[all...]
H A Dtree-object-size.c230 tree callee, arglist, a, bytes = NULL_TREE; local
235 callee = get_callee_fndecl (call);
237 if (callee
238 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL)
239 switch (DECL_FUNCTION_CODE (callee))
286 tree callee = get_callee_fndecl (call); local
289 if (callee
290 && DECL_BUILT_IN_CLASS (callee) == BUILT_IN_NORMAL)
291 switch (DECL_FUNCTION_CODE (callee))
996 tree callee, resul local
[all...]
H A Dipa-pure-const.c322 struct cgraph_node* callee; local
335 for the callee, (such as for some of the builtins) we will use
345 callee = cgraph_node(callee_t);
346 avail = cgraph_function_body_availability (callee);
365 /* The callee is either unknown (indirect call) or there is just no
367 are any bits available for the callee (such as by declaration or
683 struct cgraph_node *y = e->callee;
H A Dcgraph.h161 /* Set once the function has been instantiated and its callee
178 struct cgraph_node *callee; local
218 /* Set once the variable has been instantiated and its callee
H A Dipa-utils.c105 struct cgraph_node *w = edge->callee;
H A Dstub-objc.c68 int ARG_UNUSED (argno), tree ARG_UNUSED (callee))
H A Dcgraphunit.c630 gcc_assert (!e->callee->global.inlined_to);
708 cgraph_node_name (e->caller), cgraph_node_name (e->callee));
794 if (e->callee->decl != cgraph_node (decl)->decl
798 debug_tree (e->callee->decl);
825 cgraph_node_name (e->callee));
1126 if (!edge->callee->reachable)
1127 cgraph_mark_reachable_node (edge->callee);
1808 if (e->callee == old_version)
H A Dtree-ssa-operands.c1543 add_call_clobber_ops (tree stmt, tree callee) argument
1566 not_read_b = callee ? ipa_reference_get_not_read_global (callee) : NULL;
1567 not_written_b = callee ? ipa_reference_get_not_written_global (callee) : NULL;
1628 add_call_read_ops (tree stmt, tree callee) argument
1644 not_read_b = callee ? ipa_reference_get_not_read_global (callee) : NULL;
H A Dipa-reference.c455 struct cgraph_node* callee = cgraph_node(callee_t);
456 avail = cgraph_function_body_availability (callee);
609 /* Or in all of the bits from every callee into X, the caller's, bit
622 struct cgraph_node *y = e->callee;
703 struct cgraph_node *y = e->callee;
454 struct cgraph_node* callee = cgraph_node(callee_t); local
H A Dtree-inline.c834 those from the callee and the caller.
871 /* Original cfun for the callee, doesn't change. */
1174 function as seen by the callee. *USE_P is a (possibly null) value that
1181 tree callee = id->src_fn; local
1183 tree result = DECL_RESULT (callee);
1185 tree caller_type = TREE_TYPE (TREE_TYPE (callee));
1233 /* If the callee cannot possibly modify MODIFY_DEST, then we can
2021 fn = cg_edge->callee->decl;
2024 if (cg_edge->callee->decl != id->dst_node->decl)
2025 verify_cgraph_node (cg_edge->callee);
[all...]
H A Dipa-type-escape.c1023 struct cgraph_node* callee; local
1038 callee = cgraph_node(callee_t);
1039 avail = cgraph_function_body_availability (callee);
1112 /* The callee is either unknown (indirect call) or there is just no
1114 are any bits available for the callee (such as by declaration or
H A Dipa-prop.c353 /* return the callee (cgraph_node) of callsite CS. */
357 return cs->callee;
/freebsd-9.3-release/lib/libc/mips/gen/
H A D_setjmp.S77 REG_S gp, (_JB_REG_GP * SZREG)(a0) # newabi gp is callee-saved
/freebsd-9.3-release/contrib/binutils/bfd/
H A Delf32-spu.c1875 insert_callee (struct function_info *caller, struct call_info *callee) argument
1879 if (p->fun == callee->fun)
1883 if (p->is_tail > callee->is_tail)
1884 p->is_tail = callee->is_tail;
1887 callee->next = caller->call_list;
1888 caller->call_list = callee;
1930 struct call_info *callee; local
2002 callee = bfd_malloc (sizeof *callee);
2003 if (callee
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/CodeGen/
H A DCGCall.cpp1337 // type in the function type. Since we are codegening the callee
2026 // In the Microsoft C++ ABI, aggregate arguments are destructed by the callee.
2080 CodeGenFunction::EmitNounwindRuntimeCall(llvm::Value *callee, argument
2082 return EmitNounwindRuntimeCall(callee, ArrayRef<llvm::Value*>(), name);
2087 CodeGenFunction::EmitNounwindRuntimeCall(llvm::Value *callee, argument
2090 llvm::CallInst *call = EmitRuntimeCall(callee, args, name);
2098 CodeGenFunction::EmitRuntimeCall(llvm::Value *callee, argument
2100 return EmitRuntimeCall(callee, ArrayRef<llvm::Value*>(), name);
2106 CodeGenFunction::EmitRuntimeCall(llvm::Value *callee, argument
2109 llvm::CallInst *call = Builder.CreateCall(callee, arg
2115 EmitNoreturnRuntimeCallOrInvoke(llvm::Value *callee, ArrayRef<llvm::Value*> args) argument
2136 EmitRuntimeCallOrInvoke(llvm::Value *callee, const Twine &name) argument
2143 EmitRuntimeCallOrInvoke(llvm::Value *callee, ArrayRef<llvm::Value*> args, const Twine &name) argument
[all...]
H A DCodeGenFunction.h2089 llvm::CallInst *EmitRuntimeCall(llvm::Value *callee,
2091 llvm::CallInst *EmitRuntimeCall(llvm::Value *callee,
2094 llvm::CallInst *EmitNounwindRuntimeCall(llvm::Value *callee,
2096 llvm::CallInst *EmitNounwindRuntimeCall(llvm::Value *callee,
2105 llvm::CallSite EmitRuntimeCallOrInvoke(llvm::Value *callee,
2108 llvm::CallSite EmitRuntimeCallOrInvoke(llvm::Value *callee,
2110 void EmitNoreturnRuntimeCallOrInvoke(llvm::Value *callee,
/freebsd-9.3-release/contrib/llvm/include/llvm/Target/
H A DTargetLowering.h1977 FunctionType *FTy, bool isTailCall, SDValue callee,
1986 CallConv(cs.getCallingConv()), Callee(callee), Args(args), DAG(dag),
1994 bool doesNotReturn, bool isReturnValueUsed, SDValue callee,
1999 NumFixedArgs(numFixedArgs), CallConv(callConv), Callee(callee),
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/ASTMatchers/Dynamic/
H A DRegistry.cpp87 REGISTER_OVERLOADED_2(callee);
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchers.h1686 /// - for CallExpr, the declaration of the callee
1725 /// \brief Matches if the call expression's callee expression matches.
1732 /// callExpr(callee(expr()))
1734 /// with callee(...)
1741 AST_MATCHER_P(CallExpr, callee, internal::Matcher<Stmt>,
1748 /// \brief Matches if the call expression's callee's declaration matches the
1751 /// Example matches y.x() (matcher = callExpr(callee(methodDecl(hasName("x")))))
1756 AST_MATCHER_P_OVERLOAD(CallExpr, callee, internal::Matcher<Decl>, InnerMatcher,

Completed in 325 milliseconds

12