Home
last modified time | relevance | path

Searched full:slices (Results 1 – 25 of 153) sorted by relevance

1234567

/llvm-project/mlir/include/mlir/Dialect/Transform/Utils/
H A DRaggedArray.h21 size_t size() const { return slices.size(); } in size()
25 bool empty() const { return slices.empty(); } in empty()
30 if (slices[pos].first == static_cast<size_t>(-1)) in at()
32 return ArrayRef<T>(storage).slice(slices[pos].first, slices[pos].second); in at()
36 if (slices[pos].first == static_cast<size_t>(-1)) in at()
38 return MutableArrayRef<T>(storage).slice(slices[pos].first, in at()
39 slices[pos].second); in at()
59 if (pos < ragged.slices.size())
94 if (pos < ragged.slices.size())
112 const_iterator end() const { return const_iterator(*this, slices.size()); } in end()
[all …]
/llvm-project/llvm/tools/llvm-lipo/
H A Dllvm-lipo.cpp518 static void checkArchDuplicates(ArrayRef<Slice> Slices) { in checkArchDuplicates()
520 for (const auto &S : Slices) { in checkArchDuplicates()
531 static void updateAlignments(Range &Slices, in updateAlignments()
533 for (auto &Slice : Slices) { in updateAlignments()
540 static void checkUnusedAlignments(ArrayRef<Slice> Slices, in checkUnusedAlignments()
543 return llvm::any_of(Slices, in checkUnusedAlignments()
559 SmallVector<Slice, 2> Slices; in buildSlices()
569 Slices.emplace_back(*(BinaryOrError.get()), O.getAlign()); in buildSlices()
579 Slices.emplace_back(std::move(S)); in buildSlices()
585 Slices in buildSlices()
515 checkArchDuplicates(ArrayRef<Slice> Slices) checkArchDuplicates() argument
528 updateAlignments(Range & Slices,const StringMap<const uint32_t> & Alignments) updateAlignments() argument
537 checkUnusedAlignments(ArrayRef<Slice> Slices,const StringMap<const uint32_t> & Alignments) checkUnusedAlignments() argument
556 SmallVector<Slice, 2> Slices; buildSlices() local
610 SmallVector<Slice, 1> Slices = createUniversalBinary() local
638 SmallVector<Slice, 2> Slices = extractSlice() local
658 StringMap<Slice> Slices; buildReplacementSlices() local
700 SmallVector<Slice, 2> Slices = replaceSlices() local
[all...]
/llvm-project/llvm/lib/Object/
H A DMachOUniversalWriter.cpp261 buildFatArchList(ArrayRef<Slice> Slices) { in buildFatArchList() argument
264 sizeof(MachO::fat_header) + Slices.size() * sizeof(FatArchTy); in buildFatArchList()
266 for (const auto &S : Slices) { in buildFatArchList()
294 ArrayRef<Slice> Slices, in writeUniversalArchsToStream() argument
297 buildFatArchList<FatArchTy>(Slices); in writeUniversalArchsToStream()
319 for (size_t Index = 0, Size = Slices.size(); Index < Size; ++Index) { in writeUniversalArchsToStream()
320 MemoryBufferRef BufferRef = Slices[Index].getBinary()->getMemoryBufferRef(); in writeUniversalArchsToStream()
331 Error object::writeUniversalBinaryToStream(ArrayRef<Slice> Slices, in writeUniversalBinaryToStream() argument
335 FatHeader.nfat_arch = Slices.size(); in writeUniversalBinaryToStream()
340 return writeUniversalArchsToStream<MachO::fat_arch_64>(FatHeader, Slices, in writeUniversalBinaryToStream()
[all …]
/llvm-project/llvm/test/ObjectYAML/MachO/
H A Dfat_macho_i386_x86_64.yaml23 Slices:
59 #CHECK: Slices:
82 ## the number of 'Slices'.
86 # ERROR: yaml2obj: error: cannot write 'Slices' if not described in 'FatArches'
99 Slices:
/llvm-project/clang-tools-extra/clang-tidy/readability/
H A DIsolateDeclarationCheck.cpp121 std::vector<SourceRange> Slices; in declRanges() local
122 Slices.reserve(DeclCount + 1); in declRanges()
137 // Created slices (inclusive) [ ][ ] [ ] in declRanges()
148 // Slices: [ ][ ] [ ] in declRanges()
174 Slices.emplace_back(DeclRange); in declRanges()
176 // Create all following slices that each declare a variable. in declRanges()
196 Slices.emplace_back(VarNameRange); in declRanges()
199 return Slices; in declRanges()
/llvm-project/llvm/lib/Transforms/Scalar/
H A DSROA.cpp587 /// Representation of the alloca slices.
589 /// This class represents the slices of an alloca which are formed by its
591 /// for the slices used and we reflect that in this structure. The uses are
592 /// stored, sorted by increasing beginning offset and with unsplittable slices
593 /// starting at a particular offset before splittable slices.
596 /// Construct the slices of a particular alloca.
601 /// If this is true, the slices are never fully built and should be
606 /// Support for iterating over the slices.
611 iterator begin() { return Slices.begin(); }
612 iterator end() { return Slices
690 SmallVector<Slice, 8> Slices; global() member in __anonc91f7afb0411::AllocaSlices
[all...]
/llvm-project/llvm/lib/TextAPI/
H A DRecordsSlice.cpp306 createInterfaceFile(const Records &Slices, StringRef InstallName) { in createInterfaceFile()
309 for (auto &S : Slices) { in createInterfaceFile()
324 for (auto &S : Slices) { in createInterfaceFile()
339 llvm::MachO::convertToInterfaceFile(const Records &Slices) { in convertToInterfaceFile()
341 if (Slices.empty()) in convertToInterfaceFile()
345 for (auto &S : Slices) { in convertToInterfaceFile()
352 File = createInterfaceFile(Slices, *InstallNames.begin()); in convertToInterfaceFile()
354 File->addDocument(createInterfaceFile(Slices, IN)); in convertToInterfaceFile()
304 createInterfaceFile(const Records & Slices,StringRef InstallName) createInterfaceFile() argument
337 convertToInterfaceFile(const Records & Slices) convertToInterfaceFile() argument
/llvm-project/llvm/test/CodeGen/X86/
H A Dload-slice.ll9 ; Check that independent slices leads to independent loads then the slices leads to
33 ; Same for REGULAR, we eliminate register bank copy with each slices.
80 ; The 64-bits should have been split in one 32-bits and one 16-bits slices.
109 ; Check that we do not optimize overlapping slices.
111 ; The 64-bits should NOT have been split in as slices are overlapping.
/llvm-project/llvm/include/llvm/Object/
H A DMachOUniversalWriter.h41 // binaries. This is also needed to order the slices so the total
89 // force arm64-family to follow after all other slices for
102 Error writeUniversalBinary(ArrayRef<Slice> Slices, StringRef OutputFileName,
106 ArrayRef<Slice> Slices, raw_ostream &Out,
/llvm-project/mlir/test/Dialect/Linalg/
H A Ddrop-unit-extent-dims.mlir2 // RUN: mlir-opt %s -linalg-fold-unit-extent-dims="use-rank-reducing-slices" -cse -split-input-file | FileCheck %s --check-prefix=CHECK-SLICES
45 // CHECK-SLICES-DAG: #[[$MAP1:.*]] = affine_map<(d0, d1, d2) -> (d0, d2)>
46 // CHECK-SLICES-DAG: #[[$MAP2:.*]] = affine_map<(d0, d1, d2) -> ()>
47 // CHECK-SLICES-DAG: #[[$MAP3:.*]] = affine_map<(d0, d1, d2) -> (d0, d1, d2)>
48 // CHECK-SLICES-LABEL: func @drop_one_trip_loops
49 // CHECK-SLICES: tensor.extract_slice %{{.*}}[0, 0, 0] [%{{.*}}, 1, %{{.*}}] [1, 1, 1] : tensor<?x1x?xf32> to tensor<?x?xf32>
50 // CHECK-SLICES: tensor.extract_slice %{{.*}}[0, 0, 0, 0, 0] [%{{.*}}, 1, %{{.*}}, 1, %{{.*}}] [1, 1, 1, 1, 1] : tensor<?x1x?x1x?xf32> to tensor<?x?x?xf32>
51 // CHECK-SLICES: linalg.generic
52 // CHECK-SLICES
[all...]
/llvm-project/polly/lib/External/isl/test_inputs/codegen/
H A Dunroll6.in3 # in a number of slices that exceeds the maximal value of an integer
4 # and then only generated code for a truncated number (zero) of slices.
/llvm-project/llvm/test/Transforms/AddDiscriminators/
H A Dmemcpy-discriminator.ll30 ; SROA would split alloca %g_b.coerce into two (smaller disjoint) slices:
32 ; as users of the new alloca slices.
35 ; Later on, mem2reg successfully promotes the new alloca slices to registers,
/llvm-project/llvm/tools/llvm-libtool-darwin/
H A Dllvm-libtool-darwin.cpp536 SmallVector<Slice, 2> Slices; in buildSlices()
543 Slices.push_back(*ArchiveSlice); in buildSlices()
545 return Slices;
623 Expected<SmallVector<Slice, 2>> Slices = buildSlices(LLVMCtx, OutputBinaries); in createStaticLibrary()
624 if (!Slices) in createStaticLibrary()
625 return Slices.takeError(); in createStaticLibrary()
627 llvm::stable_sort(*Slices); in createStaticLibrary()
628 return writeUniversalBinary(*Slices, OutputFile);
534 SmallVector<Slice, 2> Slices; buildSlices() local
621 Expected<SmallVector<Slice, 2>> Slices = buildSlices(LLVMCtx, OutputBinaries); createStaticLibrary() local
/llvm-project/mlir/include/mlir/Interfaces/
H A DValueBoundsOpInterface.h262 /// Return "true" if the given slices are guaranteed to be overlapping.
263 /// Return "false" if the given slices are guaranteed to be non-overlapping.
266 /// Slices are overlapping if for all dimensions:
276 /// Return "true" if the given slices are guaranteed to be equivalent.
277 /// Return "false" if the given slices are guaranteed to be non-equivalent.
280 /// Slices are equivalent if their offsets, sizes and strices are equal.
/llvm-project/mlir/lib/Interfaces/
H A DValueBoundsOpInterface.cpp781 "expected slices of same rank"); in areOverlappingSlices()
783 "expected slices of same rank"); in areOverlappingSlices()
785 "expected slices of same rank"); in areOverlappingSlices()
796 // Case 1: Slices are guaranteed to be non-overlapping if in areOverlappingSlices()
813 // Case 2: Slices are guaranteed to be non-overlapping if in areOverlappingSlices()
832 // slices are really overlapping. in areOverlappingSlices()
837 // Therefore, the slices are guaranteed to overlap. in areOverlappingSlices()
846 "expected slices of same rank"); in areEquivalentSlices()
848 "expected slices of same rank"); in areEquivalentSlices()
850 "expected slices o in areEquivalentSlices()
[all...]
/llvm-project/mlir/include/mlir/Analysis/
H A DSliceAnalysis.h104 /// slices for the uses of the value `root`.
146 /// slices for the op defining or owning the value `root`.
150 /// Iteratively computes backward slices and forward slices until
/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCScheduleP9.td35 // resolved and they can be issued. Each of four execution slices has an
55 // corresponds to one of the four execution slices.
58 // The xa and xb ports can be used to send an iop to either of the two slices
135 // dispatch slot but are dispatched to both the even and odd slices of a
/llvm-project/mlir/lib/Bindings/Python/
H A DPybindUtils.h
/llvm-project/llvm/test/Object/Inputs/
H A Dmacho-invalid-fat-arch-size.yaml11 Slices:
/llvm-project/lld/test/MachO/invalid/
H A Dinvalid-fat-narch.s12 Slices: label
H A Dinvalid-fat-offset.s22 Slices: label
/llvm-project/mlir/test/Integration/Dialect/SparseTensor/CPU/
H A Dsparse_matmul_slice.mlir87 // Computes C = A x B with one matrix CSR sparse slices and the other DSCR sparse slice.
123 // Computes C = A x B with two COO slices.
262 // sparse slices should generate the same result as dense slices
/llvm-project/llvm/test/tools/llvm-lipo/
H A Darchs-universal-binary-arm.test20 Slices:
H A Darchs-universal-binary-x86.test20 Slices:
H A Darchs-universal-binary-unknown.test21 Slices:

1234567