/openbsd-current/gnu/lib/libiberty/include/ |
H A D | partition.h | 1 /* 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...] |
/openbsd-current/gnu/gcc/include/ |
H A D | partition.h | 1 /* 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...] |
/openbsd-current/gnu/usr.bin/binutils-2.17/include/ |
H A D | partition.h | 1 /* 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...] |
/openbsd-current/gnu/usr.bin/binutils/include/ |
H A D | partition.h | 1 /* 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 PARAMS((int)); 68 extern void partition_delete PARAMS((partition)); 69 extern int partition_union PARAMS((partition, [all...] |
/openbsd-current/usr.sbin/makefs/ |
H A D | ffs.h | 58 struct partition *pp; /* matching FFS partition in disklabel */
|
/openbsd-current/gnu/lib/libiberty/src/ |
H A D | partition.c | 1 /* 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...] |
/openbsd-current/gnu/lib/libstdc++/libstdc++/testsuite/25_algorithms/ |
H A D | partition.cc | 38 // 25.2.12 partition() 42 using std::partition; 48 int* m = partition(s1, s1 + N, pred);
|
/openbsd-current/gnu/usr.bin/binutils/bfd/ |
H A D | ppcboot.c | 48 /* 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) 441 long sector_begin = bfd_getl_signed_32 ((PTR) tdata->header.partition[i].sector_begin); 442 long sector_length = bfd_getl_signed_32 ((PTR) tdata->header.partition[i].sector_length); 445 if (!tdata->header.partition[ [all...] |
/openbsd-current/gnu/usr.bin/binutils-2.17/bfd/ |
H A D | ppcboot.c | 48 /* 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...] |
/openbsd-current/gnu/llvm/lld/ELF/ |
H A D | MarkLive.cpp | 47 MarkLive(unsigned partition) : partition(partition) {} argument 63 // The index of the partition that we are currently processing. 64 unsigned partition; member in class:__anon1240::MarkLive 193 if (sec->partition == 1 || sec->partition == partition) 195 sec->partition = sec->partition [all...] |
H A D | InputSection.h | 63 uint8_t partition = 1; member in class:lld::elf::SectionBase 67 // The 1-indexed partition that this section is assigned to by the garbage 69 // partition, so this will either be 0 or 1. 90 bool isLive() const { return partition != 0; } 91 void markLive() { partition = 1; } 92 void markDead() { partition = 0; }
|
/openbsd-current/sys/arch/sparc64/stand/ofwboot/ |
H A D | ofdev.c | 140 DNPRINTF(BOOT_D_OFDEV, "strategy: block %lx, partition offset %lx, " 237 /* What partition types to assume for Sun disklabels: */ 251 * Given a struct sun_disklabel, assume it has an extended partition 278 struct partition *npp; 334 /* Clear "extended" partition info, tentatively */ 342 /* Check to see if there's an "extended" partition table 503 char partition; local 529 partition = fname[3]; 535 partition = 'a'; 540 partition [all...] |
/openbsd-current/gnu/llvm/llvm/utils/ |
H A D | llvm-gisel-cov.py | 17 backend, sep, value = s.partition('=') 41 backend, _, data = data.partition('\0')
|
H A D | abtest.py | 139 def test_partition(partition, upcoming_partition): 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) 160 # partition into two and one side checks out okay then we can deduce that 161 # the other partition must be a failure. 165 partition [all...] |
/openbsd-current/sys/sys/ |
H A D | reboot.h | 65 * adaptor (uba, mba, etc), unit number and partition number. 94 #define MAKEBOOTDEV(type, adaptor, controller, unit, partition) \ 97 ((partition) << B_PARTITIONSHIFT) | B_DEVMAGIC)
|
/openbsd-current/gnu/llvm/libcxx/include/__algorithm/ |
H A D | ranges_partition.h | 14 #include <__algorithm/partition.h> 75 inline constexpr auto partition = __partition::__fn{}; member in namespace:ranges::__cpo
|
H A D | partition.h | 89 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) function
|
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | ssa.c | 38 #include "partition.h" 77 partitioned. The partition is checked to ensure that all uses of 124 partition reg_partition; 139 typedef int (*srf_trav) PARAMS ((int regno, rtx r, sbitmap canonical_elements, partition reg_partition)); 141 PARAMS ((htab_trav callback_function, sbitmap canonical_elements, partition reg_partition)); 199 PARAMS ((edge e, partition reg_partition)); 201 PARAMS ((int bb, partition reg_partition)); 206 PARAMS ((int bb, partition reg_partition)); 207 static partition compute_conservative_reg_partition 212 PARAMS ((partition reg_partitio [all...] |
/openbsd-current/sbin/disklabel/ |
H A D | editor.c | 86 * NOTE! Changing partition sizes in the space_allocation tables 156 const struct partition **sort_partitions(const struct disklabel *, int); 189 * Simple partition editor. 195 struct partition *pp; 211 /* Make sure there is no partition overlap. */ 213 errx(1, "can't run when there is partition overlap."); 215 /* If we don't have a 'c' partition, create one. */ 218 puts("No 'c' partition found, adding one that spans the disk."); 229 puts("This platform requires that partition offsets/sizes " 523 struct partition *p [all...] |
/openbsd-current/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
H A D | erase_fn_imps.hpp | 129 const size_type left = partition(pred_t(pred)); 226 partition(Pred pred) function in class:PB_DS_CLASS_C_DEC
|
/openbsd-current/sbin/newfs_ext2fs/ |
H A D | newfs_ext2fs.c | 110 struct partition *getpartition(int, const char *, char *[], struct disklabel **); 122 struct partition *pp = NULL; 282 "%s partition type is not `%s' (or use -I)"; 464 struct partition * 470 struct partition *pp; 479 errx(EXIT_FAILURE, "empty partition name supplied"); 483 errx(EXIT_FAILURE, "%s: can't figure out file system partition", argv[0]); 490 errx(EXIT_FAILURE, "%s: `%c' partition is unavailable", argv[0], *cp);
|
/openbsd-current/gnu/gcc/libstdc++-v3/include/backward/ |
H A D | algo.h | 96 using std::partition;
|
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/backward/ |
H A D | algo.h | 96 using std::partition;
|
/openbsd-current/usr.sbin/installboot/ |
H A D | bootstrap.c | 39 struct partition *pp; 82 * or if they do, the partition type must be either FS_BOOT or 83 * FS_UNUSED. The 'c' partition will always overlap and is ignored. 101 warnx("bootstrap overlaps with unused partition %c", 105 errx(1, "bootstrap overlaps with partition %c", part);
|
/openbsd-current/gnu/lib/libiberty/ |
H A D | Makefile.bsd-wrapper | 16 hashtab.c hex.c fibheap.c partition.c \
|