Searched refs:partition (Results 1 - 25 of 39) sorted by relevance

12

/haiku-buildtools/legacy/binutils/include/
H A Dpartition.h1 /* List implementation of a partition of consecutive integers.
22 /* This package implements a partition of consecutive integers. The
26 on a partition are FIND, which takes an element, determines its
33 it is able to perform unions over all the classes in the partition
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
65 } *partition; typedef in typeref:struct:partition_def
67 extern partition partition_new (int);
68 extern void partition_delete (partition);
69 extern int partition_union (partition, in
[all...]
/haiku-buildtools/gcc/include/
H A Dpartition.h1 /* List implementation of a partition of consecutive integers.
22 /* This package implements a partition of consecutive integers. The
26 on a partition are FIND, which takes an element, determines its
33 it is able to perform unions over all the classes in the partition
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
65 } *partition; typedef in typeref:struct:partition_def
67 extern partition partition_new (int);
68 extern void partition_delete (partition);
69 extern int partition_union (partition, in
[all...]
/haiku-buildtools/binutils/include/
H A Dpartition.h1 /* List implementation of a partition of consecutive integers.
22 /* This package implements a partition of consecutive integers. The
26 on a partition are FIND, which takes an element, determines its
33 it is able to perform unions over all the classes in the partition
61 /* The number of elements in this partition. */
63 /* The elements in the partition. */
65 } *partition; typedef in typeref:struct:partition_def
67 extern partition partition_new (int);
68 extern void partition_delete (partition);
69 extern int partition_union (partition, in
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partition/requirements/explicit_instantiation/
H A D2.cc35 template iterator_type partition(iterator_type, iterator_type,
H A Dpod.cc34 template iterator_type partition(iterator_type, iterator_type,
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partition/
H A D1.cc37 // 25.2.12 partition()
41 using std::partition;
47 int* m = partition(s1, s1 + N, pred);
H A Dmoveable.cc51 // 25.2.12 partition()
55 using std::partition;
68 VERIFY(partition(fcon.begin(), fcon.end(), pred).ptr - farray == N/2);
75 VERIFY(partition(bcon.begin(), bcon.end(), pred).ptr - barray == N/2);
/haiku-buildtools/gcc/gcc/
H A Dtree-loop-distribution.c503 /* data-references a kind != PKIND_NORMAL partition is about. */
511 /* Allocate and initialize a partition from BITMAP. */
516 partition_t partition = XCNEW (struct partition_s); local
517 partition->stmts = stmts ? stmts : BITMAP_ALLOC (NULL);
518 partition->loops = loops ? loops : BITMAP_ALLOC (NULL);
519 partition->reduction_p = false;
520 partition->kind = PKIND_NORMAL;
521 return partition;
527 partition_free (partition_t partition) argument
529 BITMAP_FREE (partition
537 partition_builtin_p(partition_t partition) argument
545 partition_reduction_p(partition_t partition) argument
553 partition_merge_into(partition_t dest, partition_t partition) argument
638 generate_loops_for_partition(struct loop *loop, partition_t partition, bool copy_p) argument
799 generate_memset_builtin(struct loop *loop, partition_t partition) argument
855 generate_memcpy_builtin(struct loop *loop, partition_t partition) argument
949 generate_code_for_partition(struct loop *loop, partition_t partition, bool copy_p) argument
986 partition_t partition = partition_alloc (NULL, NULL); local
1007 classify_partition(loop_p loop, struct graph *rdg, partition_t partition) argument
1252 partition_t partition = build_rdg_partition_for_vertex (rdg, v); local
1276 partition_t partition; local
1314 number_of_rw_in_partition(struct graph *rdg, partition_t partition) argument
1340 partition_t partition; local
1437 partition_t partition; local
1562 partition_t partition; member in struct:pgdata
[all...]
H A Dtree-ssa-live.h25 #include "partition.h"
29 Mapping from an ssa_name to a partition number is maintained, as well as
30 partition number back to ssa_name.
35 is changed, the partition numbers change, but none of the partition groupings
39 a list of all the different base variables which occur in a partition view,
41 the base variable of a partition.
43 Note that members of a partition MUST all have the same base variable. */
47 /* The partition manager of all variables. */
48 partition var_partitio
162 basevar_index(var_map map, int partition) argument
[all...]
H A Dtree-ssa-ter.c119 because b_8 is in fact killing the value of b_5 since they share a partition
143 partition which is used in the expression. This is primarily used to remove
144 an expression from the partition kill lists when a decision is made whether
146 indicates a partition number. virtual operands are not tracked individually,
147 but they are summarized by an artificial partition called VIRTUAL_PARTITION.
153 KILL_LIST is yet another bitmap array, this time it is indexed by partition
155 longer be valid if a definition into this partition takes place.
174 location. It is dependent on the partition 'b_5' is in. This is cached into
176 replaceability, it is a candidate, and it is dependent on the partition
177 b_5 is in *NOT* a_2, as well as c_4's partition
522 kill_expr(temp_expr_table_p tab, int partition) argument
606 int partition; local
[all...]
H A Dtree-ssa-coalesce.c647 var_map map; /* Var_map being used for partition mapping. */
660 /* Make sure there is a partition view in place. */
689 live_track_remove_partition (live_track_p ptr, int partition) argument
693 root = basevar_index (ptr->map, partition);
694 bitmap_clear_bit (ptr->live_base_partitions[root], partition);
704 live_track_add_partition (live_track_p ptr, int partition) argument
708 root = basevar_index (ptr->map, partition);
713 bitmap_set_bit (ptr->live_base_partitions[root], partition);
823 partition view of the var_map liveinfo is based on get entries in the
1123 /* Attempt to coalesce ssa versions X and Y together using the partition
[all...]
/haiku-buildtools/binutils/libiberty/
H A Dpartition.c1 /* List implementation of a partition of consecutive integers.
35 #include "partition.h"
39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
42 partition
47 partition part = (partition)
61 /* Freeds a partition. */
64 partition_delete (partition part)
70 of partition PART. If ELEM1 and ELEM2 are already in the same
75 partition_union (partition par
[all...]
/haiku-buildtools/gcc/libiberty/
H A Dpartition.c1 /* List implementation of a partition of consecutive integers.
35 #include "partition.h"
39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
42 partition
47 partition part = (partition)
61 /* Freeds a partition. */
64 partition_delete (partition part)
70 of partition PART. If ELEM1 and ELEM2 are already in the same
75 partition_union (partition par
[all...]
/haiku-buildtools/legacy/binutils/libiberty/
H A Dpartition.c1 /* List implementation of a partition of consecutive integers.
35 #include "partition.h"
39 /* Creates a partition of NUM_ELEMENTS elements. Initially each
42 partition
47 partition part = (partition)
61 /* Freeds a partition. */
64 partition_delete (partition part)
70 of partition PART. If ELEM1 and ELEM2 are already in the same
75 partition_union (partition par
[all...]
H A DMakefile.in146 partition.c pexecute.c \
175 ./partition.o ./pexecute.o ./physmem.o \
219 $(INCDIR)/partition.h \
821 ./partition.o: $(srcdir)/partition.c config.h $(INCDIR)/ansidecl.h \
822 $(INCDIR)/libiberty.h $(INCDIR)/partition.h
824 $(COMPILE.c) $(PICFLAG) $(srcdir)/partition.c -o pic/$@; \
826 $(COMPILE.c) $(srcdir)/partition.c $(OUTPUT_OPTION)
/haiku-buildtools/legacy/binutils/bfd/
H A Dppcboot.c48 /* PPCbug partition table layout */
50 ppcboot_location_t partition_begin; /* partition begin */
51 ppcboot_location_t partition_end; /* partition end */
59 ppcboot_partition_t partition[4]; /* partition information */ member in struct:ppcboot_hdr
65 char partition_name[32]; /* partition name */
202 if (hdr.partition[0].partition_end.ind != PPC_IND)
444 long sector_begin = bfd_getl_signed_32 ((PTR) tdata->header.partition[i].sector_begin);
445 long sector_length = bfd_getl_signed_32 ((PTR) tdata->header.partition[i].sector_length);
448 if (!tdata->header.partition[
[all...]
/haiku-buildtools/binutils/bfd/
H A Dppcboot.c50 /* PPCbug partition table layout */
53 ppcboot_location_t partition_begin; /* partition begin */
54 ppcboot_location_t partition_end; /* partition end */
63 ppcboot_partition_t partition[4]; /* partition information */ member in struct:ppcboot_hdr
69 char partition_name[32]; /* partition name */
190 if (hdr.partition[0].partition_end.ind != PPC_IND)
420 long sector_begin = bfd_getl_signed_32 (tdata->header.partition[i].sector_begin);
421 long sector_length = bfd_getl_signed_32 (tdata->header.partition[i].sector_length);
424 if (!tdata->header.partition[
[all...]
/haiku-buildtools/gcc/gcc/lto/
H A Dlto-partition.c59 #include "lto-partition.h"
67 /* Create new partition with name NAME. */
97 /* Return true if symbol is already in some partition. */
105 /* Add references into the partition. */
112 /* Add all duplicated references to the partition. */
191 Therefore put it into the same partition. */
238 /* Add symbol NODE to partition. When definition of NODE is part
271 undo_partition (ltrans_partition partition, unsigned int n_nodes) argument
273 while (lto_symtab_encoder_size (partition->encoder) > (int)n_nodes)
275 symtab_node *node = lto_symtab_encoder_deref (partition
300 ltrans_partition partition; local
348 ltrans_partition partition; local
467 ltrans_partition partition; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
H A Derase_fn_imps.hpp108 const size_type left = partition(pred_t(pred));
185 partition(Pred pred) function in class:PB_DS_CLASS_C_DEC
H A Dsplit_join_fn_imps.hpp53 const size_type left = partition(pred_t(pred));
H A Dbinary_heap_.hpp261 partition(Pred);
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/
H A Dsort-1.c138 partition (int *array, int lo, int hi) function
218 mid = partition (array, lo, hi);
267 mid = partition (array, lo, hi);
318 mid = partition (array, lo, hi);
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dalgo.h67 using __STD::partition;
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dbalanced_quicksort.h50 #include <parallel/partition.h>
296 __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,
322 __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,
H A Dquicksort.h36 #include <parallel/partition.h>

Completed in 155 milliseconds

12