Home
last modified time | relevance | path

Searched full:regions (Results 1 – 25 of 836) sorted by relevance

12345678910>>...34

/freebsd-src/contrib/llvm-project/llvm/tools/llvm-mca/
H A DCodeRegion.cpp29 for (UniqueCodeRegion &Region : Regions) in addInstruction()
36 Regions.emplace_back(std::make_unique<CodeRegion>("", SMLoc())); in AnalysisRegions()
43 if (Regions.size() == 1 && !Regions[0]->startLoc().isValid() && in beginRegion()
44 !Regions[0]->endLoc().isValid()) { in beginRegion()
46 Regions[0] = std::make_unique<CodeRegion>(Description, Loc); in beginRegion()
52 const CodeRegion &R = *Regions[It->second]; in beginRegion()
55 "found multiple overlapping anonymous regions"); in beginRegion()
63 "overlapping regions cannot have the same name"); in beginRegion()
71 ActiveRegions[Description] = Regions.size(); in beginRegion()
72 Regions.emplace_back(std::make_unique<CodeRegion>(Description, Loc)); in beginRegion()
[all …]
H A DCodeRegionGenerator.h46 AnalysisRegions &Regions; variable
49 AnalysisRegionCommentConsumer(AnalysisRegions &R) : Regions(R) {} in AnalysisRegionCommentConsumer()
53 /// Regions can be optionally named if they are of the form
66 InstrumentRegions &Regions; variable
73 : SM(SM), Regions(R), IM(IM) {} in InstrumentRegionCommentConsumer()
88 CodeRegions &Regions;
92 : MCStreamer(Context), Regions(R) {} in MCStreamerWrapper()
97 Regions.addInstruction(Inst); in emitInstruction()
116 return Regions.getInstructionSequence(Index); in GetInstructionSequence()
132 // We know that Regions i in emitInstruction()
[all...]
H A DCodeRegionGenerator.cpp35 CodeRegions &Regions = getRegions(); in parseCodeRegions() local
49 createMCAsmParser(Regions.getSourceMgr(), Ctx, *Str, MAI)); in parseCodeRegions()
81 return Regions; in HandleComment()
103 Regions.endRegion(Comment, Loc); in HandleComment()
116 Regions.beginRegion(Comment, Loc); in HandleComment()
175 if (Regions.isRegionActive(InstrumentKind))
176 Regions.endRegion(InstrumentKind, Loc);
178 Regions.beginRegion(InstrumentKind, Loc, std::move(I));
H A DCodeRegion.h25 /// Code regions are not allowed to overlap. Each region can have a optional
26 /// description; internally, regions are described by a range of source
154 std::vector<UniqueCodeRegion> Regions; in begin()
165 iterator begin() { return Regions.begin(); } in empty()
166 iterator end() { return Regions.end(); } in empty()
167 const_iterator begin() const { return Regions.cbegin(); } in empty()
168 const_iterator end() const { return Regions.cend(); } in empty()
174 return Regions[Idx]->getInstructions(); in isRegionActive()
178 return llvm::all_of(Regions, [](const UniqueCodeRegion &Region) {
141 std::vector<UniqueCodeRegion> Regions; global() variable
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DSafeStackLayout.cpp28 OS << "Stack regions:\n"; in print()
29 for (unsigned i = 0; i < Regions.size(); ++i) { in print()
30 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End in print()
31 << "), range " << Regions[i].Range << "\n"; in print()
55 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End; in layoutObject()
58 Regions.emplace_back(Start, End, Obj.Range); in layoutObject()
70 for (const StackRegion &R : Regions) { in layoutObject()
92 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End; in layoutObject()
98 Regions.emplace_back(LastRegionEnd, Start, StackLifetime::LiveRange(0)); in layoutObject()
103 Regions.emplace_back(LastRegionEnd, End, Obj.Range); in layoutObject()
[all …]
H A DSafeStackLayout.h38 /// The list of current stack regions, sorted by StackRegion::Start. variable
39 SmallVector<StackRegion, 16> Regions;
73 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
/freebsd-src/contrib/llvm-project/lldb/source/Plugins/Process/minidump/
H A DMinidumpParser.cpp259 std::vector<MemoryRegionInfo> &regions) { in CreateRegionsCacheFromLinuxMaps() argument
267 [&regions, &log](llvm::Expected<MemoryRegionInfo> region) -> bool { in CreateRegionsCacheFromLinuxMaps()
269 regions.push_back(*region); in CreateRegionsCacheFromLinuxMaps()
275 return !regions.empty(); in CreateRegionsCacheFromLinuxMaps()
278 /// Check for the memory regions starting at \a load_addr for a contiguous
284 /// regions for a section that has execute permissions. A sample maps files
311 /// The path to the module to check for in the memory regions. Only sequential
312 /// memory regions whose paths match this path will be considered when looking
315 /// \param[in] regions
316 /// A sorted list of memory regions obtained from a call to
[all …]
/freebsd-src/sys/dev/nvdimm/
H A Dnvdimm_ns.c40 ACPI_NFIT_MEMORY_MAP **regions; in nvdimm_create_namespaces() local
49 &regions, &num_regions); in nvdimm_create_namespaces()
50 if (num_regions == 0 || num_regions != regions[0]->InterleaveWays) { in nvdimm_create_namespaces()
51 free(regions, M_NVDIMM); in nvdimm_create_namespaces()
54 dimm_handle = regions[0]->DeviceHandle; in nvdimm_create_namespaces()
57 free(regions, M_NVDIMM); in nvdimm_create_namespaces()
67 regions[0]->RegionOffset + in nvdimm_create_namespaces()
69 (e->label.dimm_phys_addr - regions[0]->Address); in nvdimm_create_namespaces()
81 free(regions, M_NVDIMM); in nvdimm_create_namespaces()
/freebsd-src/sys/kern/
H A Dsubr_physmem.c62 * These structures are used internally to keep track of regions of physical
63 * ram, and regions within the physical ram that need to be excluded. An
69 #define MAX_HWCNT 32 /* ACPI needs more regions */
136 prfunc("Excluded memory regions:\n");
171 * Walk the list of hardware regions, processing it against the list of
178 * Updates the value at *pavail with the sum of all pages in all hw regions.
181 * of returned regions.
309 merge_upper_regions(struct region *regions, size_t rcnt, size_t idx) in merge_upper_regions() argument
315 lower = &regions[idx]; in merge_upper_regions()
324 upper = &regions[i]; in merge_upper_regions()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DRegionPrinter.cpp1 //===- RegionPrinter.cpp - Print regions tree pass ------------------------===//
25 /// onlySimpleRegion - Show only the simple regions in the RegionViewer.
27 onlySimpleRegions("only-simple-regions",
28 cl::desc("Show only simple regions in the graphviz viewer"),
189 INITIALIZE_PASS(RegionPrinter, "dot-regions",
190 "Print regions of function to 'dot' file", true, true)
193 RegionOnlyPrinter, "dot-regions-only",
194 "Print regions of function to 'dot' file (with no function bodies)", true,
197 INITIALIZE_PASS(RegionViewer, "view-regions", "View regions of function",
200 INITIALIZE_PASS(RegionOnlyViewer, "view-regions-only",
[all …]
H A DRegionInfo.cpp8 // Detects single entry single exit regions in the control flow graph.
36 STATISTIC(numRegions, "The # of regions");
37 STATISTIC(numSimpleRegions, "The # of simple regions");
50 cl::desc("style of printing regions"),
54 "print regions in detail with block_iterator"),
56 "print regions in detail with element_iterator")));
162 INITIALIZE_PASS_BEGIN(RegionInfoPass, "regions",
163 "Detect single entry single exit regions", true, true)
167 INITIALIZE_PASS_END(RegionInfoPass, "regions",
168 "Detect single entry single exit regions", true, true)
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNSchedStrategy.cpp14 /// Regions are first recorded in GCNScheduleDAGMILive::schedule. The actual
15 /// entry point for the scheduling of those regions is
20 /// few scheduling regions will have register pressure high enough to limit
22 /// other regions.
604 // Collect all scheduling regions. The actual scheduling is performed in in getBBLiveInMap()
606 Regions.push_back(std::pair(RegionBegin, RegionEnd)); in getBBLiveInMap()
638 // Scheduler sends regions from the end of the block upwards.
640 for (size_t E = Regions.size(); CurRegion != E; ++CurRegion) in runSchedStages()
641 if (Regions[CurRegion].first->getParent() != MBB) in runSchedStages()
647 auto &Rgn = Regions[CurRegio in runSchedStages()
[all...]
H A DGCNIterativeScheduler.cpp93 for (const auto R : Regions) { in printRegions()
284 Regions.push_back( in enterRegion()
294 if (!Regions.empty() && Regions.back()->Begin == RegionBegin) { in schedule()
296 << print(Regions.back()->MaxPressure, in schedule()
303 if (Regions.empty()) in finalizeSchedule()
410 // Sort recorded regions by pressure - highest at the front
412 llvm::sort(Regions, [this, TargetOcc](const Region *R1, const Region *R2) { in sortRegionsByPressure()
421 // most demanding regions. Obtained schedules are saved as BestSchedule for a
427 // TODO: assert Regions ar
[all...]
H A DGCNSchedStrategy.h184 // Vector of regions recorder for later rescheduling
186 MachineBasicBlock::iterator>, 32> Regions; variable
192 // Record regions with high register pressure.
195 // Record regions with excess register pressure over the physical register
196 // limit. Register pressure in these regions usually will result in spilling.
199 // Regions that has the same occupancy as the latest MinOccupancy
202 // Regions that have IGLP instructions (SCHED_GROUP_BARRIER or IGLP_OPT).
221 // Compute and cache live-ins and pressure for all regions in block.
375 // Map a trivially rematerializable def to a list of regions at MinOccupancy
/freebsd-src/contrib/llvm-project/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp360 /// Array of branch regions corresponding each conditions in the boolean
846 assert(!Record.MappingRegions.empty() && "Function has no regions"); in loadFunctionRecord()
1142 /// Emit segments for active regions which end before \p Loc. in completeRegionsUntil()
1145 /// regions are completed. in completeRegionsUntil()
1149 // Sort the completed regions by end location. This makes it simple to in completeRegionsUntil()
1157 // Emit segments for all completed regions. in buildSegmentsImpl()
1191 // Emit a skipped segment if there are no more active regions. This in buildSegmentsImpl()
1196 // Pop the completed regions. in buildSegmentsImpl()
1200 void buildSegmentsImpl(ArrayRef<CountedRegion> Regions) {
1201 for (const auto &CR : enumerate(Regions)) { in sortNestedRegions() argument
1151 buildSegmentsImpl(ArrayRef<CountedRegion> Regions) buildSegmentsImpl() argument
1224 combineRegions(MutableArrayRef<CountedRegion> Regions) combineRegions() argument
1259 buildSegments(MutableArrayRef<CountedRegion> Regions) buildSegments() argument
1345 std::vector<CountedRegion> Regions; getCoverageForFile() local
1409 std::vector<CountedRegion> Regions; getCoverageForFunction() local
1437 std::vector<CountedRegion> Regions; getCoverageForExpansion() local
[all...]
/freebsd-src/sys/contrib/device-tree/Bindings/fpga/
H A Dfpga-region.txt18 FPGA Regions represent FPGA's and partial reconfiguration regions of FPGA's in
19 the Device Tree. FPGA Regions provide a way to program FPGAs under device tree
55 * A persona may create more regions.
65 will be used to gate the busses. Traffic to other regions is not affected.
69 * An FPGA image may create a set of reprogrammable regions, each having its
79 * A base image may set up a set of partial reconfiguration regions that may
99 Figure 1: An FPGA set up with a base image that created three regions. Each
124 FPGA Regions represent FPGA's and FPGA PR regions in the device tree. An FPGA
151 These FPGA regions are children of FPGA bridges which are then children of the
160 FPGA Regions do not inherit their ancestor FPGA regions' bridges. This prevents
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DRegionInfo.h10 // regions.
107 /// iterate in Flat mode. During a Flat mode iteration all Regions are entered
161 /// example a BasicBlock is element of two Regions, there exist two
215 /// Regions.
219 /// Two canonical Regions either do not intersect at all or one is
223 /// Regions in the control flow graph and E is the \e parent relation of these
224 /// Regions.
229 /// A simple control flow graph, that contains two regions.
245 /// <tt> "opt -passes='print<regions>' anyprogram.ll" </tt>
247 /// <tt> "opt -view-regions-only anyprogram.ll" </tt>
[all …]
/freebsd-src/stand/uboot/
H A Duboot_fdt.c117 static struct fdt_mem_region regions[UB_MAX_MR]; in fdt_platform_fixups() local
198 /* Extract the DRAM regions into fdt_mem_region format. */ in fdt_platform_fixups()
199 for (i = 0, n = 0; i < si->mr_no && n < nitems(regions); i++) { in fdt_platform_fixups()
201 regions[n].start = si->mr[i].start; in fdt_platform_fixups()
202 regions[n].size = si->mr[i].size; in fdt_platform_fixups()
207 /* Fixup memory regions */ in fdt_platform_fixups()
208 fdt_fixup_memory(regions, n); in fdt_platform_fixups()
/freebsd-src/share/man/man9/
H A Dcrypto_request.9218 .Ss Request Regions
219 Each request describes one or more regions in the data buffers.
222 The length of some regions is the same for all requests belonging to
227 Other regions are only required for specific session modes.
230 the AAD, IV, and payload regions are always defined as regions in the
240 AAD and IV regions are not copied from the input buffer into the output
243 The following regions are defined:
311 Calculate a digest over the AAD and payload regions and store the
314 Calculate a digest over the AAD and payload regions of the data buffer.
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DIROutliner.h1 //===- IROutliner.h - Extract similar IR regions into functions --*- C++ -*-==//
12 // The outliner uses the IRSimilarityIdentifier to identify the similar regions
150 /// regions to this region.
194 /// instances of the similarity, and then consolidating the similar regions
196 /// to identify the similar regions of code, and then extracts the similar
234 /// remaining regions in \p CurrentGroup.
236 /// \param [in] CandidateVec - List of similarity candidates for regions with
245 /// regions being outlined.
248 /// \param [in,out] CG - The OutlinableGroup for the regions to be outlined.
270 /// \returns the number of outlined instructions across all regions.
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DStore.h77 /// binding is the value of sub-regions that were not initialized separately
110 /// Return a store with the specified value bound to all sub-regions of the
205 /// invalidateRegions - Clears out the specified regions from the store,
207 /// invalidate additional regions that may have changed based on accessing
208 /// the given regions. Optionally, invalidates non-static globals as well.
212 /// symbols to mark the values of invalidated regions.
214 /// symbols to mark the values of invalidated regions.
221 /// \param[in,out] InvalidatedTopLevel A vector to fill with regions
224 /// \param[in,out] Invalidated A vector to fill with any regions being
225 /// invalidated. This should include any regions explicitl
[all...]
/freebsd-src/sys/contrib/device-tree/Bindings/pmem/
H A Dpmem-region.txt1 Device-tree bindings for persistent memory regions
11 persistent regions separately to the normal memory pool. To aid with that this
13 memory regions exist inside the physical address space.
56 * This node specifies two 4KB regions that are backed by
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DIROutliner.cpp1 //===- IROutliner.cpp -- Outline Similar Regions ----------------*- C++ -*-===//
68 /// a set of regions that are structurally similar to one another, such as the
70 /// and a list of the different regions. This information is used in the
71 /// deduplication of extracted regions with the same structure.
74 std::vector<OutlinableRegion *> Regions; member
127 /// Regions.
130 /// Regions.
137 /// For the \ref Regions, we look at every Value. If it is a constant,
144 /// For the regions, look at each set of GVN stores needed and account for
213 /// when PHINodes are included in outlined regions
[all...]
/freebsd-src/sys/contrib/device-tree/Bindings/pci/
H A Drockchip,rk3399-pcie-ep.yaml27 rockchip,max-outbound-regions:
28 description: Maximum number of outbound regions
34 - rockchip,max-outbound-regions
65 rockchip,max-outbound-regions = <16>;
/freebsd-src/sys/contrib/device-tree/Bindings/mfd/
H A Dqcom,spmi-pmic.txt7 locations/definitions within these regions, with some of these regions
13 16-bit SPMI slave address space into 256 smaller fixed-size regions, 256 bytes
14 each. A function can consume one or more of these fixed-size register regions.

12345678910>>...34