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

12

/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/
H A DCodeRegion.cpp21 Regions.emplace_back(std::make_unique<CodeRegion>("", SMLoc()));
36 if (Regions.size() == 1 && !Regions[0]->startLoc().isValid() &&
37 !Regions[0]->endLoc().isValid()) {
39 Regions[0] = std::make_unique<CodeRegion>(Description, Loc);
45 const CodeRegion &R = *Regions[It->second];
64 ActiveRegions[Description] = Regions.size();
65 Regions.emplace_back(std::make_unique<CodeRegion>(Description, Loc));
77 Regions[It->second]->setEndLocation(Loc);
83 if (ActiveRegions.empty() && Regions
[all...]
H A DCodeRegionGenerator.cpp35 CodeRegions &Regions; member in class:llvm::mca::MCACommentConsumer
37 MCACommentConsumer(CodeRegions &R) : Regions(R) {}
43 CodeRegions &Regions; member in class:llvm::mca::final
47 : MCStreamer(Context), Regions(R) {}
52 Regions.addInstruction(Inst);
71 return Regions.getInstructionSequence(Index);
93 Regions.endRegion(Comment, Loc);
106 Regions.beginRegion(Comment, Loc);
112 MCStreamerWrapper Str(Ctx, Regions);
117 createMCAsmParser(Regions
[all...]
H A DCodeRegion.h89 std::vector<UniqueCodeRegion> Regions;
102 iterator begin() { return Regions.begin(); }
103 iterator end() { return Regions.end(); }
104 const_iterator begin() const { return Regions.cbegin(); }
105 const_iterator end() const { return Regions.cend(); }
113 return Regions[Idx]->getInstructions();
117 return llvm::all_of(Regions, [](const UniqueCodeRegion &Region) {
H A DCodeRegionGenerator.h35 CodeRegions Regions; member in class:llvm::mca::CodeRegionGenerator
40 CodeRegionGenerator(SourceMgr &SM) : Regions(SM) {}
H A Dllvm-mca.cpp391 const mca::CodeRegions &Regions = *RegionsOrErr;
394 if (!Regions.isValid())
397 if (Regions.empty()) {
448 for (const std::unique_ptr<mca::CodeRegion> &Region : Regions) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSafeStackLayout.cpp31 for (unsigned i = 0; i < Regions.size(); ++i) {
32 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
33 << "), range " << Regions[i].Range << "\n";
57 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
60 Regions.emplace_back(Start, End, Obj.Range);
71 for (const StackRegion &R : Regions) {
93 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions
[all...]
H A DSafeStackLayout.h38 SmallVector<StackRegion, 16> Regions; member in class:llvm::safestack::StackLayout
71 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DLoopWidening.cpp60 const MemRegion *Regions[] = {MRMgr.getStackLocalsRegion(STC), local
64 for (auto *Region : Regions) {
93 return PrevState->invalidateRegions(Regions, getLoopCondition(LoopStmt),
H A DProgramState.cpp154 ProgramState::invalidateRegions(RegionList Regions, argument
162 for (RegionList::const_iterator I = Regions.begin(),
163 End = Regions.end(); I != End; ++I)
617 // Regions captured by a block are also implicitly reachable.
H A DMemRegion.cpp71 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
76 Regions.InsertNode(R, InsertPos);
88 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
93 Regions.InsertNode(R, InsertPos);
107 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
112 Regions.InsertNode(R, InsertPos);
998 MemRegion* data = Regions.FindNodeOrInsertPos(ID, InsertPos);
1004 Regions.InsertNode(R, InsertPos);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp465 void buildSegmentsImpl(ArrayRef<CountedRegion> Regions) {
466 for (const auto &CR : enumerate(Regions)) {
487 const bool Skipped = (CR.index() + 1) == Regions.size();
492 if (CR.index() + 1 == Regions.size() ||
493 CurStartLoc != Regions[CR.index() + 1].startLoc()) {
509 static void sortNestedRegions(MutableArrayRef<CountedRegion> Regions) {
510 llvm::sort(Regions, [](const CountedRegion &LHS, const CountedRegion &RHS) {
532 combineRegions(MutableArrayRef<CountedRegion> Regions) {
533 if (Regions.empty())
534 return Regions;
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNSchedStrategy.cpp327 Regions.push_back(std::make_pair(RegionBegin, RegionEnd));
350 Regions[RegionIdx] = std::make_pair(RegionBegin, RegionEnd);
438 Regions[RegionIdx] = std::make_pair(RegionBegin, RegionEnd);
464 for (size_t E = Regions.size(); CurRegion != E; ++CurRegion)
465 if (Regions[CurRegion].first->getParent() != MBB)
476 auto &Rgn = Regions[CurRegion];
487 if (Regions[CurRegion].first == I) {
492 if (Regions[CurRegion].second == I) {
514 assert(!Regions.empty());
516 BBStarters.reserve(Regions
[all...]
H A DGCNIterativeScheduler.cpp111 for (const auto R : Regions) {
305 Regions.push_back(
315 if (!Regions.empty() && Regions.back()->Begin == RegionBegin) {
317 Regions.back()->MaxPressure.print(
324 if (Regions.empty())
436 llvm::sort(Regions, [&ST, TargetOcc](const Region *R1, const Region *R2) {
451 // TODO: assert Regions are sorted descending by pressure
453 const auto Occ = Regions.front()->MaxPressure.getOccupancy(ST);
458 for (auto R : Regions) {
[all...]
H A DGCNSchedStrategy.h85 MachineBasicBlock::iterator>, 32> Regions; member in class:llvm::final
H A DGCNIterativeScheduler.h72 std::vector<Region*> Regions; member in class:llvm::GCNIterativeScheduler
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerTracePC.h146 Region *Regions; member in struct:fuzzer::TracePC::Module
148 uint8_t *Start() { return Regions[0].Start; }
149 uint8_t *Stop() { return Regions[NumRegions - 1].Stop; }
165 CB(Modules[m].Regions[r]);
251 if (!Modules[i].Regions[r].Enabled) continue;
252 FirstFeature += 8 * ForEachNonZeroByte(Modules[i].Regions[r].Start,
253 Modules[i].Regions[r].Stop,
H A DFuzzerTracePC.cpp54 M.Regions = new Module::Region[M.NumRegions];
55 assert(M.Regions);
58 M.Regions[R++] = {Start, std::min(Stop, AlignedStart), true, false};
60 M.Regions[R++] = {P, P + PageSize(), true, true};
62 M.Regions[R++] = {AlignedStop, Stop, true, false};
173 auto &R = M.Regions[r];
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DHotColdSplitting.cpp1 //===- HotColdSplitting.cpp -- Outline Cold Regions -------------*- C++ -*-===//
403 std::vector<OutliningRegion> Regions; local
406 Regions.emplace_back();
407 OutliningRegion *ColdRegion = &Regions.back();
430 return Regions;
462 Regions.emplace_back();
463 ColdRegion = &Regions.back();
494 return Regions;
590 auto Regions = OutliningRegion::create(*BB, *DT, *PDT); local
591 for (OutliningRegion &Region : Regions) {
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/
H A DMCMachOStreamer.cpp218 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions(); local
219 Regions.push_back(Data);
223 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions(); local
224 assert(!Regions.empty() && "Mismatched .end_data_region!");
225 DataRegionData &Data = Regions.back();
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DCheckerDocumentation.cpp261 /// \param Regions The transitive closure of regions accessible from,
276 ArrayRef<const MemRegion *> Regions,
273 checkRegionChanges(ProgramStateRef State, const InvalidatedSymbols *Invalidated, ArrayRef<const MemRegion *> ExplicitRegions, ArrayRef<const MemRegion *> Regions, const LocationContext *LCtx, const CallEvent *Call) const argument
H A DAnalysisOrderChecker.cpp163 ArrayRef<const MemRegion *> Regions,
160 checkRegionChanges(ProgramStateRef State, const InvalidatedSymbols *Invalidated, ArrayRef<const MemRegion *> ExplicitRegions, ArrayRef<const MemRegion *> Regions, const LocationContext *LCtx, const CallEvent *Call) const argument
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-cov/
H A DCoverageExporterJson.cpp26 // -- TargetRegions: array => List of Regions in the expansion
86 json::Array renderRegions(ArrayRef<coverage::CountedRegion> Regions) { argument
88 for (const auto &Region : Regions)
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSubEngine.h140 ArrayRef<const MemRegion *> Regions,
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionInfoImpl.h51 // Only clean the cache for this Region. Caches of child Regions will be
52 // cleaned when the child Regions are deleted.
878 assert(A && B && "One of the Regions is NULL");
891 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<RegionT *> &Regions) const {
892 RegionT *ret = Regions.back();
893 Regions.pop_back();
895 for (RegionT *R : Regions)
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/
H A DCheckerManager.h362 /// \param Regions The transitive closure of accessible regions,
370 ArrayRef<const MemRegion *> Regions,
486 ArrayRef<const MemRegion *> Regions,

Completed in 301 milliseconds

12