HomeSort by relevance Sort by last modified time
    Searched refs:frontier (Results 1 - 12 of 12) sorted by null

  /external/compiler-rt/lib/lsan/
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) {
91 dl_iterate_phdr(ProcessGlobalRegionsCallback, frontier);
104 Frontier *frontier member in struct:__lsan::ProcessPlatformAllocParam
    [all...]
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)
    [all...]
lsan_common.h 98 typedef InternalMmapVector<uptr> Frontier;
102 void ProcessGlobalRegions(Frontier *frontier);
103 void ProcessPlatformSpecificAllocations(Frontier *frontier);
108 Frontier *frontier,
  /external/llvm/include/llvm/CodeGen/
MachineDominanceFrontier.h 76 iterator addBasicBlock(MachineBasicBlock *BB, const DomSetType &frontier) {
77 return Base.addBasicBlock(BB, frontier);
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
MachineDominanceFrontier.h 78 iterator addBasicBlock(MachineBasicBlock *BB, const DomSetType &frontier) {
79 return Base.addBasicBlock(BB, frontier);
  /external/llvm/include/llvm/Analysis/
DominanceFrontier.h 11 // dominance frontier for a function.
81 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) {
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/
DominanceFrontier.h 11 // dominance frontier for a function.
66 iterator addBasicBlock(BasicBlock *BB, const DomSetType &frontier) {
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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DominanceFrontier.h 11 // dominance frontier for a function.
88 iterator addBasicBlock(BlockT *BB, const DomSetType &frontier) {
90 return Frontiers.insert(std::make_pair(BB, frontier)).first;
93 /// removeBlock - Remove basic block BB's frontier.
104 /// compare - Return true if the other dominance frontier base matches
105 /// this dominance frontier base. Otherwise return false.
112 /// dump - Dump the dominance frontier to dbgs().
  /external/syzkaller/vendor/github.com/google/go-cmp/cmp/internal/diff/
diff.go 173 fwdFrontier := fwdPath.point // Forward search frontier
174 revFrontier := revPath.point // Reverse search frontier
194 // through the "frontier" point. If no matches are found, we advance the
195 // frontier towards the opposite corner.
197 // Y coordinates of the forward and reverse frontier points ever intersect.
240 // Advance the frontier towards reverse point.
278 // Advance the frontier towards forward point.
  /external/grpc-grpc-java/services/src/main/java/io/grpc/protobuf/services/
ProtoReflectionService.java 303 Queue<FileDescriptor> frontier = new ArrayDeque<FileDescriptor>(); local
305 frontier.add(fd);
306 while (!frontier.isEmpty()) {
307 FileDescriptor nextFd = frontier.remove();
312 frontier.add(dependencyFd);
  /external/tensorflow/tensorflow/core/kernels/
conv_2d_gpu.h 518 // For each data type, the tile size possibility frontier denotes the tile size
527 // A tile size combination lies on the frontier if and only if one or more
529 // frontier are either not possible, or are slower than the alternatives.
532 // corresponding frontier:
533 // - long side frontier: the union of the biggest tile size combination for
535 // - non long side frontier: the frontier set minus the long side frontier.
537 // TileSizePossibilityFrontierCheck defines the frontier using only the long
538 // side frontier tile size combinations (since one can easily extrapolat
751 static auto* frontier = [] { local
    [all...]
  /external/tensorflow/tensorflow/python/tpu/
tensor_tracer.py 567 frontier = [op for (op, degree) in op_in_degree.items() if degree == 0]
568 while frontier:
569 op = frontier.pop()
584 frontier.append(consumer)
    [all...]

Completed in 2922 milliseconds