| /external/compiler-rt/lib/lsan/ |
| H A D | lsan_common_linux.cc | 60 Frontier *frontier = reinterpret_cast<Frontier *>(data); local
76 ScanRangeForPointers(begin, allocator_begin, frontier, "GLOBAL",
79 ScanRangeForPointers(allocator_end, end, frontier, "GLOBAL",
82 ScanRangeForPointers(begin, end, frontier, "GLOBAL", kReachable);
89 void ProcessGlobalRegions(Frontier *frontier) { argument
91 dl_iterate_phdr(ProcessGlobalRegionsCallback, frontier);
104 Frontier *frontier; member in struct:__lsan::ProcessPlatformAllocParam
110 // reachable. Marks them as reachable and adds them to the frontier.
127 param->frontier->push_back(chunk);
149 void ProcessPlatformSpecificAllocations(Frontier *frontier) { argument
[all...] |
| H A D | lsan_common.cc | 141 // chunks. Marks those chunks with |tag| and adds them to |frontier|.
145 // so |frontier| = 0.
147 Frontier *frontier,
177 if (frontier)
178 frontier->push_back(chunk);
183 Frontier *frontier = reinterpret_cast<Frontier *>(arg); local
184 ScanRangeForPointers(begin, end, frontier, "FAKE STACK", kReachable);
189 Frontier *frontier) {
217 ScanRangeForPointers(registers_begin, registers_end, frontier,
240 ScanRangeForPointers(stack_begin, stack_end, frontier, "STAC
146 ScanRangeForPointers(uptr begin, uptr end, Frontier *frontier, const char *region_type, ChunkTag tag) argument
188 ProcessThreads(SuspendedThreadsList const &suspended_threads, Frontier *frontier) argument
275 ProcessRootRegion(Frontier *frontier, uptr root_begin, uptr root_end) argument
296 ProcessRootRegions(Frontier *frontier) argument
306 FloodFillTag(Frontier *frontier, ChunkTag tag) argument
[all...] |
| H A D | lsan_common.h | 102 void ProcessGlobalRegions(Frontier *frontier);
103 void ProcessPlatformSpecificAllocations(Frontier *frontier);
108 Frontier *frontier,
|
| /external/llvm/include/llvm/CodeGen/ |
| H A D | MachineDominanceFrontier.h | 76 iterator addBasicBlock(MachineBasicBlock *BB, const DomSetType &frontier) { argument
77 return Base.addBasicBlock(BB, frontier);
|
| /external/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontier.h | 11 // dominance frontier for a function.
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) { argument
83 return Frontiers.insert(std::make_pair(BB, frontier)).first;
86 /// removeBlock - Remove basic block BB's frontier.
97 /// compare - Return true if the other dominance frontier base matches
98 /// this dominance frontier base. Otherwise return false.
105 /// dump - Dump the dominance frontier to dbgs().
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| H A D | DominanceFrontier.h | 11 // dominance frontier for a function.
66 iterator addBasicBlock(BasicBlock *BB, const DomSetType &frontier) { argument
68 return Frontiers.insert(std::make_pair(BB, frontier)).first;
71 /// removeBlock - Remove basic block BB's frontier.
115 /// compare - Return true if the other dominance frontier base matches
116 /// this dominance frontier base. Otherwise return false.
147 /// dump - Dump the dominance frontier to dbgs().
|
| /external/v8/tools/turbolizer/ |
| H A D | graph-view.js | 186 let frontier = new Set();
192 frontier.add(edge);
197 return frontier;
202 var frontier = new Set();
218 frontier.add(node);
224 return frontier.has(n);
572 var frontier = graph.getNodeFrontier(state.selection.selection, inEdges, filter);
573 if (frontier != undefined) {
578 state.selection.select(frontier[0], true);
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| H A D | functionalize_control_flow.cc | 630 // frontier (the nodes where the cond ends).
679 // Validates that the frontier of nodes for the conditional
683 const std::unordered_set<Node*>& frontier);
714 const std::unordered_set<Node*>& frontier) {
716 for (Node* n : frontier) {
735 // An empty frontier indicates a dead switch. Above we attempt to remove dead
740 // return errors::Internal("Unexpected empty frontier for switch nodes");
1023 std::unordered_set<Node*> frontier; local
1053 frontier.insert(out);
1074 return std::make_pair(std::move(branch_map), std::move(frontier));
711 ValidateFrontier( const std::unordered_map<Node*, FunctionalizeCond::ForwardFlowNode>& branch_map, const std::unordered_set<Node*>& frontier) argument
1090 std::unordered_set<Node*> frontier; local
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| H A D | conv_ops_gpu_3.cu.cc | 522 // For each data type, the tile size possibility frontier denotes the tile size
531 // A tile size combination lies on the frontier if and only if one or more
533 // frontier are either not possible, or are slower than the alternatives.
536 // corresponding frontier:
537 // - long side frontier: the union of the biggest tile size combination for
539 // - non long side frontier: the frontier set minus the long side frontier.
541 // TileSizePossibilityFrontierCheck defines the frontier using only the long
542 // side frontier til
753 static auto* frontier = [] { local
[all...] |
| /external/annotation-tools/annotation-file-utilities/ |
| H A D | design.tex | 286 arrows. The text of the subgraph can be read from the lower frontier of
|