HomeSort by relevance Sort by last modified time
    Searched full:frontier (Results 1 - 25 of 69) sorted by null

1 2 3

  /ndk/sources/host-tools/sed-4.2.1/testsuite/
dollar.good 4 space the final frontier
dollar.inp 4 the final frontier
  /external/compiler-rt/lib/lsan/
lsan_common_linux.cc 56 Frontier *frontier = reinterpret_cast<Frontier *>(data); local
72 ScanRangeForPointers(begin, allocator_begin, frontier, "GLOBAL",
75 ScanRangeForPointers(allocator_end, end, frontier, "GLOBAL",
78 ScanRangeForPointers(begin, end, frontier, "GLOBAL", kReachable);
85 void ProcessGlobalRegions(Frontier *frontier) {
90 dl_iterate_phdr(ProcessGlobalRegionsCallback, frontier);
104 // reachable. Marks them as reachable and adds them to the frontier
    [all...]
lsan_common.cc 113 // chunks. Marks those chunks with |tag| and adds them to |frontier|.
117 // so |frontier| = 0.
119 Frontier *frontier,
140 if (frontier)
141 frontier->push_back(chunk);
147 Frontier *frontier) {
175 ScanRangeForPointers(registers_begin, registers_end, frontier,
191 ScanRangeForPointers(stack_begin, stack_end, frontier, "STACK"
    [all...]
lsan_common.h 102 typedef InternalMmapVector<uptr> Frontier;
106 void ProcessGlobalRegions(Frontier *frontier);
107 void ProcessPlatformSpecificAllocations(Frontier *frontier);
110 Frontier *frontier,
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
CoreEngine.h 208 /// frontier nodes (or destination set). This is the set of nodes which should
221 /// \brief The frontier set - a set of nodes which need to be propagated after
223 ExplodedNodeSet &Frontier;
233 for (iterator I = Frontier.begin(), E = Frontier.end(); I != E; ++I) {
251 : C(Ctx), Finalized(F), HasGeneratedNodes(false), Frontier(DstSet) {
252 Frontier.Add(SrcNode);
257 : C(Ctx), Finalized(F), HasGeneratedNodes(false), Frontier(DstSet) {
258 Frontier.insert(SrcSet);
285 return Frontier;
    [all...]
  /external/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().
RegionInfo.h 18 // in (Post)dominace tree and dominance frontier passes. This leads to a simpler
21 // O(V+E), whereas this algorithm is not, as the dominance frontier information
595 // isCommonDomFrontier - Returns true if BB is in the dominance frontier of
602 // dominance tree and dominance frontier.
  /dalvik/dx/src/com/android/dx/ssa/
DomFront.java 40 * Dominance-frontier information for a single basic block.
44 * {@code null-ok;} the dominance frontier set indexed by
71 * Calculates the dominance frontier information for the method.
161 * Calculates the dominance-frontier set.
192 // Add b to runner's dominance frontier set.
SetFactory.java 30 * BitIntSet/ListIntSet threshold for dominance frontier sets. These
60 * Make IntSet for the dominance-frontier sets.
package-info.java 95 * dominance-frontier set}.
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
DomFront.java 44 * Dominance-frontier information for a single basic block.
48 * {@code null-ok;} the dominance frontier set indexed by
75 * Calculates the dominance frontier information for the method.
165 * Calculates the dominance-frontier set.
196 // Add b to runner's dominance frontier set.
SetFactory.java 30 * BitIntSet/ListIntSet threshold for dominance frontier sets. These
60 * Make IntSet for the dominance-frontier sets.
  /external/chromium_org/chrome/test/functional/ispy/common/
image_tools.py 188 This function evaluates a 'frontier' of valid pixels indices. Initially,
189 this frontier contains all indices in the image. However, with each pass
191 are added to the next pass's frontier. This gives the algorithm a
206 frontier = set(range(len(old_dataset)))
230 for index in frontier:
234 frontier, new_frontier = new_frontier, set()
  /external/llvm/lib/Analysis/
DominanceFrontier.cpp 1 //===- DominanceFrontier.cpp - Dominance Frontier Calculation -------------===//
19 "Dominance Frontier Construction", true, true)
22 "Dominance Frontier Construction", true, true)
  /art/compiler/sea_ir/ir/
sea.h 191 // Adds @df_reg to the dominance frontier of the current region.
195 // Returns the dominance frontier of the current region.
250 // Records the dominance frontier.
328 // Computes the dominance frontier for all regions in the graph,
  /dalvik/vm/compiler/
SSATransformation.cpp 160 /* Worker function to compute the dominance frontier */
351 /* Now compute the dominance frontier for each block */
459 /* Merge the dominance frontier to tmpBlocks */
468 * the dominance frontier.
CompilerIR.h 173 BitVector *domFrontier; // Dominance frontier
  /external/chromium/googleurl/base/
basictypes.h 32 // template overloads: the final frontier.
  /external/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp 460 // Enqueue the new frontier onto the worklist.
472 // Enqueue the new frontier onto the worklist.
611 Frontier.erase(FromN);
617 Frontier.Add(N);
626 for (ExplodedNodeSet::iterator I = Frontier.begin(),
627 E = Frontier.end(); I != E; ++I )
  /art/compiler/dex/
ssa_transformation.cc 220 /* Worker function to compute the dominance frontier */
427 // Compute the dominance frontier for each block.
532 /* Merge the dominance frontier to tmp_blocks */
544 * the dominance frontier.
  /external/chromium_org/gpu/command_buffer/common/
types.h 97 // template overloads: the final frontier.
  /external/ceres-solver/include/ceres/internal/
macros.h 85 // template overloads: the final frontier.
  /external/chromium_org/third_party/libaddressinput/chromium/cpp/include/libaddressinput/util/
basictypes.h 124 // template overloads: the final frontier.
  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/base/
basictypes.h 124 // template overloads: the final frontier.

Completed in 1032 milliseconds

1 2 3