HomeSort by: relevance | last modified time | path
    Searched refs:Regions (Results 1 - 25 of 47) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/
CodeRegion.cpp 21 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];
48 "found multiple overlapping anonymous regions");
56 "overlapping regions cannot have the same name");
64 ActiveRegions[Description] = Regions.size();
65 Regions.emplace_back(std::make_unique<CodeRegion>(Description, Loc))
    [all...]
CodeRegionGenerator.cpp 35 CodeRegions &Regions;
37 MCACommentConsumer(CodeRegions &R) : Regions(R) {}
43 CodeRegions &Regions;
47 : MCStreamer(Context), Regions(R) {}
52 Regions.addInstruction(Inst);
71 return Regions.getInstructionSequence(Index);
93 Regions.endRegion(Comment, Loc);
106 Regions.beginRegion(Comment, Loc);
113 MCStreamerWrapper Str(Ctx, Regions);
127 createMCAsmParser(Regions.getSourceMgr(), Ctx, Str, MAI))
    [all...]
CodeRegion.h 24 /// Code regions are not allowed to overlap. Each region can have a optional
25 /// description; internally, regions are described by a range of source
91 std::vector<UniqueCodeRegion> Regions;
104 iterator begin() { return Regions.begin(); }
105 iterator end() { return Regions.end(); }
106 const_iterator begin() const { return Regions.cbegin(); }
107 const_iterator end() const { return Regions.cend(); }
115 return Regions[Idx]->getInstructions();
119 return llvm::all_of(Regions, [](const UniqueCodeRegion &Region) {
CodeRegionGenerator.h 35 CodeRegions Regions;
40 CodeRegionGenerator(SourceMgr &SM) : Regions(SM) {}
llvm-mca.cpp 424 const mca::CodeRegions &Regions = *RegionsOrErr;
427 if (!Regions.isValid())
430 if (Regions.empty()) {
483 for (const std::unique_ptr<mca::CodeRegion> &Region : Regions) {
484 // Skip empty code regions.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
SafeStackLayout.cpp 29 OS << "Stack regions:\n";
30 for (unsigned i = 0; i < Regions.size(); ++i) {
31 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
32 << "), range " << Regions[i].Range << "\n";
56 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
59 Regions.emplace_back(Start, End, Obj.Range);
70 for (const StackRegion &R : Regions) {
92 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End
    [all...]
SafeStackLayout.h 37 /// The list of current stack regions, sorted by StackRegion::Start.
38 SmallVector<StackRegion, 16> Regions;
71 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
LoopWidening.cpp 60 const MemRegion *Regions[] = {MRMgr.getStackLocalsRegion(STC),
64 for (auto *Region : Regions) {
95 return PrevState->invalidateRegions(Regions, getLoopCondition(LoopStmt),
ProgramState.cpp 154 ProgramState::invalidateRegions(RegionList Regions,
162 for (RegionList::const_iterator I = Regions.begin(),
163 End = Regions.end(); I != End; ++I)
251 // We only want to do fetches from regions that we can actually bind
543 // regions right now.
607 // If this is a subregion, also visit the parent regions.
621 // Regions captured by a block are also implicitly reachable.
MemRegion.cpp 1 //===- MemRegion.cpp - Abstract memory regions for static analysis --------===//
72 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
77 Regions.InsertNode(R, InsertPos);
89 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
94 Regions.InsertNode(R, InsertPos);
108 auto *R = cast_or_null<RegionTy>(Regions.FindNodeOrInsertPos(ID, InsertPos));
113 Regions.InsertNode(R, InsertPos);
125 // All regions and their data are BumpPtrAllocated. No need to call their
715 // Check for more specific regions first.
784 // represent the regions more appropriately
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNSchedStrategy.cpp 313 // Just record regions at the first pass.
314 Regions.push_back(std::make_pair(RegionBegin, RegionEnd));
342 Regions[RegionIdx] = std::make_pair(RegionBegin, RegionEnd);
449 Regions[RegionIdx] = std::make_pair(RegionBegin, RegionEnd);
473 // Scheduler sends regions from the end of the block upwards.
475 for (size_t E = Regions.size(); CurRegion != E; ++CurRegion)
476 if (Regions[CurRegion].first->getParent() != MBB)
487 auto &Rgn = Regions[CurRegion];
500 if (Regions[CurRegion].first == I) {
505 if (Regions[CurRegion].second == I)
    [all...]
GCNIterativeScheduler.cpp 95 for (const auto R : Regions) {
289 Regions.push_back(
299 if (!Regions.empty() && Regions.back()->Begin == RegionBegin) {
301 Regions.back()->MaxPressure.print(
308 if (Regions.empty())
417 // Sort recorded regions by pressure - highest at the front
420 llvm::sort(Regions, [&ST, TargetOcc](const Region *R1, const Region *R2) {
429 // most demanding regions. Obtained schedules are saved as BestSchedule for a
435 // TODO: assert Regions are sorted descending by pressur
    [all...]
GCNSchedStrategy.h 99 // Vector of regions recorder for later rescheduling
101 MachineBasicBlock::iterator>, 32> Regions;
107 // Record regions which use clustered loads/stores.
110 // Record regions with high register pressure.
128 // Compute and cache live-ins and pressure for all regions in block.
GCNIterativeScheduler.h 74 std::vector<Region*> Regions;
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 259 assert(!Record.MappingRegions.empty() && "Function has no regions");
453 /// Emit segments for active regions which end before \p Loc.
456 /// regions are completed.
460 // Sort the completed regions by end location. This makes it simple to
468 // Emit segments for all completed regions.
502 // Emit a skipped segment if there are no more active regions. This
507 // Pop the completed regions.
511 void buildSegmentsImpl(ArrayRef<CountedRegion> Regions) {
512 for (const auto &CR : enumerate(Regions)) {
515 // Active regions which end before the current region need to be popped
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-cov/
SourceCoverageView.h 70 /// A view that represents one or more branch regions on a given source line.
72 std::vector<CountedRegion> Regions;
76 BranchView(unsigned Line, ArrayRef<CountedRegion> Regions,
78 : Regions(Regions), View(std::move(View)), Line(Line) {}
283 void addBranch(unsigned Line, ArrayRef<CountedRegion> Regions,
CoverageExporterJson.cpp 28 // -- TargetRegions: array => List of Regions in the expansion
101 json::Array renderRegions(ArrayRef<coverage::CountedRegion> Regions) {
103 for (const auto &Region : Regions)
108 json::Array renderBranchRegions(ArrayRef<coverage::CountedRegion> Regions) {
110 for (const auto &Region : Regions)
169 {"regions",
266 {"regions", renderRegions(F.CountedRegions)},
SourceCoverageView.cpp 172 ArrayRef<CountedRegion> Regions,
174 BranchSubViews.emplace_back(Line, Regions, std::move(View));
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
IROutliner.cpp 1 //===- IROutliner.cpp -- Outline Similar Regions ----------------*- C++ -*-===//
51 /// a set of regions that are structurally similar to one another, such as the
53 /// and a list of the different regions. This information is used in the
54 /// deduplication of extracted regions with the same structure.
57 std::vector<OutlinableRegion *> Regions;
88 /// Regions.
91 /// Regions.
98 /// For the \ref Regions, we look at every Value. If it is a constant,
105 /// For the regions, look at each set of GVN stores needed and account for
341 for (OutlinableRegion *Region : Regions)
    [all...]
HotColdSplitting.cpp 1 //===- HotColdSplitting.cpp -- Outline Cold Regions -------------*- C++ -*-===//
76 STATISTIC(NumColdRegionsFound, "Number of cold regions found.");
77 STATISTIC(NumColdRegionsOutlined, "Number of cold regions outlined.");
415 /// the static constructor returns a list of suitable extraction regions.
436 /// because regions starting at predecessor blocks are typically larger.
451 std::vector<OutliningRegion> Regions;
454 Regions.emplace_back();
455 OutliningRegion *ColdRegion = &Regions.back();
478 return Regions;
511 return Regions;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/MC/
MCMachOStreamer.cpp 220 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions();
221 Regions.push_back(Data);
225 std::vector<DataRegionData> &Regions = getAssembler().getDataRegions();
226 assert(!Regions.empty() && "Mismatched .end_data_region!");
227 DataRegionData &Data = Regions.back();
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
CheckerDocumentation.cpp 250 /// Called when the contents of one or more regions change.
258 /// \param ExplicitRegions The regions explicitly requested for invalidation.
261 /// \param Regions The transitive closure of regions accessible from,
262 /// \p ExplicitRegions, i.e. all regions that may have been touched
276 ArrayRef<const MemRegion *> Regions,
SmartPtrModeling.cpp 54 ArrayRef<const MemRegion *> Regions,
278 // Clean up dead regions from the region map.
295 Out << Sep << "Smart ptr regions :" << NL;
310 ArrayRef<const MemRegion *> Regions, const LocationContext *LCtx,
315 for (const auto *Region : Regions)
AnalysisOrderChecker.cpp 201 ArrayRef<const MemRegion *> Regions,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
StructurizeCFG.cpp 65 "structurizecfg-skip-uniform-regions",
67 cl::desc("Force whether the StructurizeCFG pass skips uniform regions"),
71 RelaxedUniformRegions("structurizecfg-relaxed-uniform-regions", cl::Hidden,
952 // Bool for if all sub-regions are uniform.
972 // Explicitly refuse to treat regions as uniform if they have non-uniform
977 // Warning: It would be nice to treat regions as uniform based only on
987 // Early exit if we cannot have relaxed uniform regions.
1002 // a. All sub-regions are uniform.
1024 // TODO: We could probably be smarter here with how we handle sub-regions.
1026 // of the pass on sub-regions, and that this metadata doesn't get lost -
    [all...]

Completed in 64 milliseconds

1 2