Home
last modified time | relevance | path

Searched refs:partition (Results 1 – 25 of 110) sorted by relevance

12345

/llvm-project-15.0.7/lld/docs/
H A DPartitions.rst11 partitioned program consists of a main partition together with a number of
12 loadable partitions. The loadable partitions depend on the main partition
15 address space at link time, and each loadable partition is assigned a fixed
24 going to be used as the "entry points" for each partition. An entry point
27 by the partition. The intent is that in order to use a loadable partition,
46 assigned to the main partition, including sections only reachable from
50 section is colored according to its assigned partition.
56 referred to as a combined output file. To extract a partition from the
58 with the flag ``--extract-main-partition`` to extract the main partition, or
67 # Compile a feature to be placed in a loadable partition.
[all …]
H A Dpartitions.dot2 part_main [label="Main partition",shape=plaintext];
3 part1 [label="Loadable partition 1",shape=plaintext];
4 part2 [label="Loadable partition 2",shape=plaintext];
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dpartition.ll20 define ptr @f1() partition "part1" {
24 define hidden void @f2() partition "part2" {
28 declare void @f3() partition "part3"
30 @g1 = global i32 0, partition "part4"
32 @a1 = alias i32, ptr @g1, partition "part5"
33 @i1 = ifunc void(), ptr @f1, partition "part6"
/llvm-project-15.0.7/lld/ELF/
H A DMarkLive.cpp47 MarkLive(unsigned partition) : partition(partition) {} in MarkLive() argument
64 unsigned partition; member in __anon799c975c0111::MarkLive
206 if (sec->partition == 1 || sec->partition == partition) in enqueue()
208 sec->partition = sec->partition ? 1 : partition; in enqueue()
230 if (sym->includeInDynsym() && sym->partition == partition) in run()
234 if (partition != 1) { in run()
H A DInputSection.h67 uint8_t partition = 1; variable
89 bool isLive() const { return partition != 0; } in isLive()
90 void markLive() { partition = 1; } in markLive()
91 void markDead() { partition = 0; } in markDead()
H A DWriter.cpp135 copy->partition = part; in copySectionsIntoPartitions()
149 if (!s->isLive() || s->partition == 255) in combineEhSections()
276 if (osd->osec.name == name && osd->osec.partition == partition) in findSection()
295 sec->partition = i; in createSyntheticSections()
342 sec.partition = part.getNumber(); in createSyntheticSections()
441 in.partEnd->partition = 255; in createSyntheticSections()
870 unsigned rank = osec.partition * RF_PARTITION; in getSectionRank()
2332 if (sec->partition != partNo || !needsPtLoad(sec)) in createPhdrs()
2357 if (sec->partition != partNo) { in createPhdrs()
2358 if (isMain && sec->partition == 255) in createPhdrs()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition.pass.cpp36 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
43 r = std::partition(Iter(ia), Iter(ia), is_odd()); in test()
48 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
53 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
59 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
69 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
79 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
89 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
H A Dranges_partition.pass.cpp42 …std::ranges::partition(std::forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Pred>(pred…
65 std::ranges::partition(std::forward<Range>(range), std::forward<Pred>(pred));
95 …std::same_as<std::ranges::subrange<Iter>> decltype(auto) result = std::ranges::partition(b, e, pre… in test_one()
110 …std::same_as<std::ranges::subrange<Iter>> decltype(auto) result = std::ranges::partition(range, pr… in test_one()
183 std::ranges::partition(in.begin(), in.end(), is_negative); in test()
188 std::ranges::partition(in.begin(), in.end(), is_negative, negate); in test()
196 std::ranges::partition(in, is_negative); in test()
201 std::ranges::partition(in, is_negative, negate); in test()
H A Dranges_stable_partition.pass.cpp219 std::ranges::partition(in.begin(), in.end(), is_negative); in test()
224 std::ranges::partition(in.begin(), in.end(), is_negative, negate); in test()
232 std::ranges::partition(in, is_negative); in test()
237 std::ranges::partition(in, is_negative, negate); in test()
/llvm-project-15.0.7/llvm/utils/
H A Dabtest.py139 def test_partition(partition, upcoming_partition): argument
141 max_remaining_steps = len(partition) * 2 - 1
148 for x in partition:
151 (format_namelist(partition), max_remaining_steps))
154 known_good.update(partition)
155 elif len(partition) > 1:
156 partitions_to_split.insert(0, partition)
165 partition = partitions_to_split.pop()
167 middle = len(partition) // 2
168 left = partition[0:middle]
[all …]
H A Dllvm-gisel-cov.py17 backend, sep, value = s.partition('=')
41 backend, _, data = data.partition('\0')
/llvm-project-15.0.7/third-party/benchmark/tools/gbench/
H A Dreport.py179 def extract_field(partition, field_name): argument
181 lhs = [x[field_name] for x in partition[0]]
182 rhs = [x[field_name] for x in partition[1]]
250 for partition in partitions:
251 benchmark_name = partition[0][0]['name']
252 time_unit = partition[0][0]['time_unit']
256 for i in range(min(len(partition[0]), len(partition[1]))):
257 bn = partition[0][i]
258 other_bench = partition[1][i]
288 run_type = partition[0][0]['run_type'] if 'run_type' in partition[0][0] else ''
[all …]
/llvm-project-15.0.7/openmp/runtime/test/affinity/
H A Dlibomp_test_topology.h324 place_list_t *partition; in proc_bind_check() local
346 partition = partitions[i]; in proc_bind_check()
347 place_nums = partition->place_nums; in proc_bind_check()
348 num_places = partition->num_places; in proc_bind_check()
349 current_place = partition->current_place; in proc_bind_check()
464 partition = partitions[i]; in proc_bind_check()
465 place_nums = partition->place_nums; in proc_bind_check()
466 num_places = partition->num_places; in proc_bind_check()
467 current_place = partition->current_place; in proc_bind_check()
492 partition = partitions[i]; in proc_bind_check()
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-objcopy/ELF/
H A Dpartitions.test1 partitions.elf is a file containing a main partition and two loadable
6 RUN: llvm-objcopy --extract-main-partition %p/Inputs/partitions.elf %t1
7 RUN: llvm-objcopy --extract-partition=part1 %p/Inputs/partitions.elf %t2
8 RUN: llvm-objcopy --extract-partition=part2 %p/Inputs/partitions.elf %t3
183 RUN: not llvm-objcopy --extract-partition=part3 %p/Inputs/partitions.elf %t4 2>&1 | FileCheck --che…
184 ERROR1: error: could not find partition named 'part3'
186 RUN: not llvm-objcopy --extract-main-partition --extract-partition=part2 %p/Inputs/partitions.elf %…
187 ERROR2: error: cannot specify --extract-partition together with --extract-main-partition
/llvm-project-15.0.7/lld/test/ELF/
H A Daarch64-movw-tprel.s22 ## Access variable in first partition
30 ## Access variable in second partition
41 ## Access variable in third partition
/llvm-project-15.0.7/clang/test/AST/
H A Dgen_ast_dump_json_test.py214 partition = source_file.rpartition('.')
215 dest_path = '%s-json%s%s' % (partition[0], partition[1], partition[2])
/llvm-project-15.0.7/clang/test/Analysis/
H A Dptr-sort.cpp19 std::partition(V1.begin(), V1.end(), f); // no-warning in PointerSorting()
32 …std::partition(V2.begin(), V2.end(), f); // expected-warning {{Sorting pointer-like elements can r… in PointerSorting()
/llvm-project-15.0.7/libc/src/stdlib/
H A Dqsort.cpp60 static size_t partition(const Array &array) { in partition() function
104 size_t split_index = partition(array); in quicksort()
/llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/
H A Dpartition.pass.cpp21 auto iter = std::partition(working.begin(), working.end(), is_even); in LLVMFuzzerTestOneInput()
/llvm-project-15.0.7/llvm/test/Transforms/SROA/
H A Dpr37267.ll18 … error happened when rewriteIntegerStore try to widen a split tail of slice 1 for [4, 8) partition.
59 …e reported error happened when visitLoadInst rewrites a split tail of slice 1 for [4, 8) partition.
/llvm-project-15.0.7/bolt/lib/Passes/
H A DSplitFunctions.cpp108 template <typename It> void partition(const It Start, const It End) const { in partition() function
126 template <typename It> void partition(It Start, It End) const { in partition() function
282 Strategy.partition(NewLayout.rbegin(), NewLayout.rend()); in splitFunction()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Drobust_against_adl_on_new.pass.cpp29 std::partition(a, a+4, A::isEven); in main()
/llvm-project-15.0.7/llvm/tools/llvm-objcopy/
H A DObjcopyOpts.td125 : Eq<"extract-partition", "Extract named partition from input file">,
128 : Flag<["--"], "extract-main-partition">,
129 HelpText<"Extract main partition from the input file">;
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition.pass.cpp106 BiDirIt actual_ret = std::partition(exec, first, last, unary_op); in operator ()()
157 partition(exec, iter, iter, non_const(is_even)); in operator ()()
/llvm-project-15.0.7/llvm/test/Transforms/LoopDistribute/
H A Dno-if-convert.ll5 ; partition won't be vectorized due to conditional stores so it's better to
6 ; keep it with the second partition which has a dependence cycle.

12345