Home
last modified time | relevance | path

Searched refs:callees (Results 1 – 17 of 17) sorted by relevance

/external/swiftshader/src/OpenGL/compiler/
DAnalyzeCallDepth.cpp47 for(size_t i = 0; i < callees.size(); i++) in addCallee()
49 if(callees[i] == callee) in addCallee()
55 callees.push_back(callee); in addCallee()
66 for(size_t i = 0; i < callees.size(); i++) in analyzeCallDepth()
69 switch(callees[i]->visit) in analyzeCallDepth()
75 calleeDepth = callees[i]->getLastDepth(); in analyzeCallDepth()
78 calleeDepth = callees[i]->analyzeCallDepth(analyzeCallDepth); in analyzeCallDepth()
81 UNREACHABLE(callees[i]->visit); in analyzeCallDepth()
DAnalyzeCallDepth.h50 TVector<FunctionNode*> callees; variable
/external/r8/src/main/java/com/android/tools/r8/ir/conversion/
DCallGraph.java55 private final Set<Node> callees = new LinkedHashSet<>(); field in CallGraph.Node
69 callees.add(method); in addCallee()
81 return callees.isEmpty(); in isLeaf()
100 builder.append(callees.size()); in toString()
112 if (callees.size() > 0) { in toString()
114 for (Node call : callees) { in toString()
224 assert nodes.containsKey(leaf.method) && nodes.get(leaf.method).callees.isEmpty(); in removeLeaves()
261 Node[] callees = node.callees.toArray(new Node[node.callees.size()]); in traverse() local
262 Arrays.sort(callees, (Node a, Node b) -> a.method.method.slowCompareTo(b.method.method)); in traverse()
263 for (Node callee : callees) { in traverse()
[all …]
/external/mesa3d/src/compiler/glsl/
Dir_function_detect_recursion.cpp149 exec_list callees; member in __anone5245a600111::function
214 this->current->callees.push_tail(node); in visit_enter()
255 if (f->callers.is_empty() || f->callees.is_empty()) { in remove_unlinked_functions()
258 destroy_links(& n->func->callees, f); in remove_unlinked_functions()
261 while (!f->callees.is_empty()) { in remove_unlinked_functions()
262 struct call_node *n = (struct call_node *) f->callees.pop_head(); in remove_unlinked_functions()
/external/v8/tools/gcmole/
Dgcmole.cc166 CalleesSet* callees = callgraph_[name]; in EnterScope() local
168 if (callees == NULL) { in EnterScope()
169 callgraph_[name] = callees = new CalleesSet(); in EnterScope()
172 scopes_.push(callees); in EnterScope()
189 CalleesSet* callees = i->second; in PrintCallGraph() local
190 for (CalleesSet::const_iterator j = callees->begin(), e = callees->end(); in PrintCallGraph()
/external/llvm/test/tools/llvm-profdata/
Dinline-samples.test8 inlined callees.
Dgcc-gcov-sample-profile.test9 inlined callees.
/external/clang/docs/
DSanitizerCoverage.rst226 pairs of lines (odd lines are callers, even lines are callees)
237 * Only the first 14 callees for every caller are recorded, the rest are silently
/external/llvm/docs/
DTypeMetadata.rst11 callees for a given virtual call.
DPasses.rst596 Bottom-up inlining of functions into callees.
1080 #. If it can prove that callees do not access theier caller stack frame, they
DWritingAnLLVMPass.rst370 passes that need to traverse the program bottom-up on the call graph (callees
384 in the current SCC and the direct callers and direct callees of the SCC.
DCodeGenerator.rst2368 to spill registers r3-r10. This allows callees blind to the call signature,
DLangRef.rst304 support varargs and requires the prototype of all callees to exactly
312 prototype of all callees to exactly match the prototype of the
5496 "normal" label. If the callee (or any indirect callees) returns via the
/external/python/cpython2/Doc/library/
Dframework.rst155 is not allowed within *our_dispatch* or its callees, since this may result in an
/external/llvm/lib/Target/ARM/
DARM.td212 // "normal" call instructions to callees which do not return.
/external/curl/
DCHANGES.03484 - Make Curl_write and it's callees accept a const pointer, in preparation
/external/strace/
DChangeLog32431 recent kernels. IOW: syscall_fixup_for_fork_exec() and its callees