Searched refs:Regions (Results 1 - 25 of 29) sorted by relevance

12

/external/llvm/lib/CodeGen/
H A DSafeStackLayout.cpp26 for (unsigned i = 0; i < Regions.size(); ++i) {
27 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
28 << "), range " << Regions[i].Range << "\n";
51 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
54 Regions.emplace_back(Start, End, Obj.Range);
65 for (const StackRegion &R : Regions) {
87 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions
[all...]
H A DSafeStackLayout.h31 SmallVector<StackRegion, 16> Regions; member in class:llvm::safestack::StackLayout
58 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
/external/clang/lib/StaticAnalyzer/Core/
H A DLoopWidening.cpp54 const MemRegion *Regions[] = {MRMgr.getStackLocalsRegion(STC), local
58 for (auto *Region : Regions) {
62 return PrevState->invalidateRegions(Regions, getLoopCondition(LoopStmt),
H A DMemRegion.cpp44 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
50 Regions.InsertNode(R, InsertPos);
62 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
68 Regions.InsertNode(R, InsertPos);
82 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
88 Regions.InsertNode(R, InsertPos);
100 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
106 Regions.InsertNode(R, InsertPos);
118 RegionTy* R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID,
124 Regions
[all...]
H A DProgramState.cpp139 ProgramState::invalidateRegions(RegionList Regions, argument
147 for (RegionList::const_iterator I = Regions.begin(),
148 End = Regions.end(); I != End; ++I)
612 // Regions captured by a block are also implicitly reachable.
H A DCheckerManager.cpp535 ArrayRef<const MemRegion *> Regions,
543 ExplicitRegions, Regions, Call);
532 runCheckersForRegionChanges(ProgramStateRef state, const InvalidatedSymbols *invalidated, ArrayRef<const MemRegion *> ExplicitRegions, ArrayRef<const MemRegion *> Regions, const CallEvent *Call) argument
H A DRegionStore.cpp934 StoreManager::InvalidatedRegions *Regions; member in class:__anon2084::invalidateRegionsWorker
947 Ex(ex), Count(count), LCtx(lctx), IS(is), ITraits(ITraitsIn), Regions(r),
1051 if (Regions)
1052 Regions->push_back(baseR);
/external/llvm/unittests/ProfileData/
H A DCoverageMappingTest.cpp56 std::vector<CounterMappingRegion> Regions; member in struct:__anon15028::OutputFunctionCoverageData
63 Record.MappingRegions = Regions;
94 std::vector<CounterMappingRegion> Regions; member in struct:__anon15028::InputFunctionCoverageData
146 InputFunctions.back().Regions.push_back(CounterMappingRegion::makeRegion(
152 InputFunctions.back().Regions.push_back(CounterMappingRegion::makeExpansion(
163 CoverageMappingWriter(FileIDs, None, Data.Regions).write(OS);
174 Expressions, Data.Regions);
181 std::string Regions = writeCoverageRegions(InputFunctions[I]); local
182 readCoverageRegions(Regions, OutputFunctions[I]);
231 size_t N = makeArrayRef(Input.Regions)
[all...]
/external/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp325 void buildSegmentsImpl(ArrayRef<CountedRegion> Regions) { argument
326 for (const auto &Region : Regions) {
341 static void sortNestedRegions(MutableArrayRef<CountedRegion> Regions) { argument
342 std::sort(Regions.begin(), Regions.end(), [](const CountedRegion &LHS,
365 combineRegions(MutableArrayRef<CountedRegion> Regions) { argument
366 if (Regions.empty())
367 return Regions;
368 auto Active = Regions.begin();
369 auto End = Regions
400 buildSegments(MutableArrayRef<CountedRegion> Regions) argument
461 std::vector<coverage::CountedRegion> Regions; local
507 std::vector<coverage::CountedRegion> Regions; local
525 std::vector<coverage::CountedRegion> Regions; local
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSubEngine.h136 ArrayRef<const MemRegion *> Regions,
153 ArrayRef<const MemRegion *> Regions,
H A DExprEngine.h298 ArrayRef<const MemRegion *> Regions,
520 ArrayRef<const MemRegion *> Regions,
H A DProgramState.h247 /// \param Regions the set of regions to be invalidated.
261 invalidateRegions(ArrayRef<const MemRegion *> Regions, const Expr *E,
268 invalidateRegions(ArrayRef<SVal> Regions, const Expr *E,
/external/llvm/lib/MC/
H A DMCMachOStreamer.cpp222 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions(); local
223 Regions.push_back(Data);
227 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions(); local
228 assert(!Regions.empty() && "Mismatched .end_data_region!");
229 DataRegionData &Data = Regions.back();
/external/clang/lib/StaticAnalyzer/Checkers/
H A DCheckerDocumentation.cpp252 /// \param Regions The transitive closure of regions accessible from,
268 ArrayRef<const MemRegion *> Regions,
265 checkRegionChanges(ProgramStateRef State, const InvalidatedSymbols *Invalidated, ArrayRef<const MemRegion *> ExplicitRegions, ArrayRef<const MemRegion *> Regions, const CallEvent *Call) const argument
H A DMallocChecker.cpp2274 SmallVector<const MemRegion*, 10> Regions;
2283 Regions.push_back(VR);
2287 state->scanReachableSymbols<StopTrackingCallback>(Regions.data(),
2288 Regions.data() + Regions.size()).getState();
H A DCStringChecker.cpp72 ArrayRef<const MemRegion *> Regions,
2124 ArrayRef<const MemRegion *> Regions,
2135 I = Regions.begin(), E = Regions.end(); I != E; ++I) {
2121 checkRegionChanges(ProgramStateRef state, const InvalidatedSymbols *, ArrayRef<const MemRegion *> ExplicitRegions, ArrayRef<const MemRegion *> Regions, const CallEvent *Call) const argument
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
H A DBugReporter.h87 typedef llvm::DenseSet<const MemRegion *> Regions; typedef in class:clang::ento::BugReport
101 SmallVector<Regions *, 2> interestingRegions;
139 Regions &getInterestingRegions();
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DRegionInfo.cpp66 // Only clean the cache for this Region. Caches of child Regions will be
67 // cleaned when the child Regions are deleted.
785 assert (A && B && "One of the Regions is NULL");
796 RegionInfo::getCommonRegion(SmallVectorImpl<Region*> &Regions) const {
797 Region* ret = Regions.back();
798 Regions.pop_back();
800 for (SmallVectorImpl<Region*>::const_iterator I = Regions.begin(),
801 E = Regions.end(); I != E; ++I)
/external/llvm/include/llvm/Analysis/
H A DRegionInfoImpl.h47 // Only clean the cache for this Region. Caches of child Regions will be
48 // cleaned when the child Regions are deleted.
873 assert(A && B && "One of the Regions is NULL");
886 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<RegionT *> &Regions) const {
887 RegionT *ret = Regions.back();
888 Regions.pop_back();
890 for (RegionT *R : Regions)
H A DRegionInfo.h101 /// iterate in Flat mode. During a Flat mode iteration all Regions are entered
155 /// example a BasicBlock is element of two Regions, there exist two
209 /// Regions.
213 /// Two canonical Regions either do not intersect at all or one is
217 /// Regions in the control flow graph and E is the \e parent relation of these
218 /// Regions.
648 /// @brief Analysis that detects all canonical Regions.
650 /// The RegionInfo pass detects all canonical regions in a function. The Regions
820 /// @param Regions A vector of regions.
821 /// @return The smallest region that contains all regions in Regions
[all...]
/external/clang/lib/CodeGen/
H A DCoverageMappingGen.cpp935 ArrayRef<CounterMappingRegion> Regions) {
938 for (const auto &R : Regions) {
993 std::vector<CounterMappingRegion> Regions;
999 Expressions, Regions);
1002 dump(llvm::outs(), NameValue, Expressions, Regions);
/external/clang/include/clang/StaticAnalyzer/Core/
H A DChecker.h323 ArrayRef<const MemRegion *> Regions,
326 Explicits, Regions, Call);
319 _checkRegionChanges(void *checker, ProgramStateRef state, const InvalidatedSymbols *invalidated, ArrayRef<const MemRegion *> Explicits, ArrayRef<const MemRegion *> Regions, const CallEvent *Call) argument
H A DCheckerManager.h335 /// \param Regions The transitive closure of accessible regions,
343 ArrayRef<const MemRegion *> Regions,
451 ArrayRef<const MemRegion *> Regions,
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DRegionInfo.h47 /// iterate in Flat mode. During a Flat mode iteration all Regions are entered
94 /// example a BasicBlock is element of two Regions, there exist two
166 /// Regions.
170 /// Two canonical Regions either do not intersect at all or one is
174 /// Regions in the control flow graph and E is the \e parent relation of these
175 /// Regions.
519 /// @brief Analysis that detects all canonical Regions.
521 /// The RegionInfo pass detects all canonical regions in a function. The Regions
651 /// @param Regions A vector of regions.
652 /// @return The smallest region that contains all regions in Regions
[all...]
/external/clang/tools/libclang/
H A DIndexing.cpp143 void update(ArrayRef<PPRegion> Regions) { argument
145 ParsedRegions.insert(Regions.begin(), Regions.end());

Completed in 1917 milliseconds

12