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

123

/external/grub/stage2/
H A Dfreebsd.h44 * adaptor (uba, mba, etc), unit number and partition number.
62 #define MAKEBOOTDEV(type, adaptor, controller, unit, partition) \
65 ((partition) << B_PARTITIONSHIFT) | B_DEVMAGIC)
H A Ddisk_io.c96 /* The register ESI should contain the address of the partition to be
115 /* these are the translated numbers for the open partition */
297 * Check partition boundaries
308 * Get the read to the beginning of a partition.
373 embed a Stage 1.5 into a partition instead of a MBR, use system
439 /* Turn on the active flag for the partition SAVED_PARTITION in the
452 /* If the partition is not a primary partition, the active flag is
464 /* If the partition is an extended partition, settin
576 next_partition(unsigned long drive, unsigned long dest, unsigned long *partition, int *type, unsigned long *start, unsigned long *len, unsigned long *offset, int *entry, unsigned long *ext_offset, char *buf) argument
949 int partition = dev & 0xFFFFFF; local
[all...]
/external/grub/lib/
H A Ddevice.h44 extern int write_to_partition (char **map, int drive, int partition,
H A Ddevice.c776 /dev/rd/c<controller>d<logical drive>p<partition>.
828 a whole disk is not consistent with the one for a partition of the
842 write_to_partition (char **map, int drive, int partition, argument
848 if ((partition & 0x00FF00) != 0x00FF00)
850 /* If the partition is a BSD partition, it is difficult to
864 sprintf (dev + strlen(dev), "%d", ((partition >> 16) & 0xFF) + 1);
866 /* Open the partition. */
/external/webkit/Source/WebCore/WebCore.gyp/scripts/
H A Daction_derivedsourcesallinone.py139 def generateContent(filesMetaData, partition, totalPartitions):
153 if (hash(name) % totalPartitions) != partition:
195 partition = outputFileNames.index(fileName)
196 fileContents = generateContent(filesMetaData, partition, len(outputFileNames))
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java47 int i = partition(a, left, right, comparator);
52 // partition a[left] to a[right], assumes left < right
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { method in class:QuickSorter
71 Type swap = a[i]; // swap with partition element
/external/openfst/src/include/fst/
H A Dminimize.h40 #include <fst/partition.h>
49 // comparator for creating partition based on sorting on
66 const Partition<typename A::StateId>& partition,
68 : fst_(fst), partition_(partition), flags_(flags) {}
146 const Partition<StateId>& partition() const { function in class:fst::CyclicMinimizer
155 ArcIterCompare(const Partition<StateId>& partition) argument
156 : partition_(partition) {}
162 // (partition class Ids)
213 // in the partition corresponding to final, non-final
223 // prep partition
65 StateComparator(const Fst<A>& fst, const Partition<typename A::StateId>& partition, uint32 flags = kCompareAll) argument
323 const Partition<StateId>& partition() { function in class:fst::AcyclicMinimizer
454 MergeStates( const Partition<typename A::StateId>& partition, MutableFst<A>* fst) argument
[all...]
H A Dpartition.h0 // partition.h
18 // \file Functions and classes to create a partition of states
66 // Create an empty partition for num_states. At initialization time
105 // partition. Once elements have been added to a class, you need to
199 // partition, create new once and update the queue of active classes
255 // iterate over members of a class in a partition
260 PartitionIterator(const Partition<T>& partition, T class_id) argument
261 : p_(partition),
H A Dfstlib.h139 #include <fst/partition.h>
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dminimize.h33 #include "fst/lib/partition.h"
40 // comparator for creating partition based on sorting on
59 const Partition<typename A::StateId>& partition,
61 : fst_(fst), partition_(partition), flags_(flags) {}
133 const Partition<StateId>& partition() const { function in class:fst::CyclicMinimizer
142 ArcIterCompare(const Partition<StateId>& partition) argument
143 : partition_(partition) {}
149 // (partition class Ids)
200 // in the partition corresponding to final, non-final
210 // prep partition
58 StateComparator(const Fst<A>& fst, const Partition<typename A::StateId>& partition, int32 flags = kCompareAll) argument
310 const Partition<StateId>& partition() { function in class:fst::AcyclicMinimizer
441 MergeStates( const Partition<typename A::StateId>& partition, MutableFst<A>* fst) argument
[all...]
H A Dpartition.h0 // partition.h
16 // \file Functions and classes to create a partition of states
61 // Create an empty partition for num_states. At initialization time
100 // partition. Once elements have been added to a class, you need to
194 // partition, create new once and update the queue of active classes
250 // iterate over members of a class in a partition
255 PartitionIterator(const Partition<T>& partition, T class_id) argument
256 : p_(partition),
/external/stlport/test/unit/
H A Dpartition_test.cpp98 partition((int*)numbers, (int*)numbers + 6, less_n(10, nb_pred_calls));
117 partition(v1.begin(), v1.end(), less_n(11, nb_pred_calls));
/external/libvorbis/doc/
H A D08-residue.tex34 coding structure, ignoring for the moment exactly how a partition is
40 \emph{n}, a partition size \emph{residue_partition_size}, and a total
46 \item Each partition in each vector has a classification number that
48 decode that partition. The classification numbers of each partition
64 a partition is the same in each pass, thus the classification codeword
80 partition are interleaved during partition encoding (visually treated
84 dimension of the codebook used to encode a partition in a specific
86 passes, however the partition siz
[all...]
H A D07-floor1.tex98 list is split into partitions, and each partition is assigned to a
99 partition class. X positions 0 and [n] are implicit and do not belong
100 to an explicit partition or partition class.
102 A partition class consists of a representation vector width (the
103 number of Y values which the partition class encodes at once), a
105 the partition class may use in representing Y values, the list of
/external/replicaisland/
H A DAndroid.mk21 # and when built explicitly put it in the data partition
/external/guava/guava-tests/test/com/google/common/collect/
H A DListsTest.java755 Lists.partition(source, 0);
763 List<List<Integer>> partitions = Lists.partition(source, 1);
770 List<List<Integer>> partitions = Lists.partition(source, 1);
777 List<List<Integer>> partitions = Lists.partition(source, 2);
784 List<List<Integer>> partitions = Lists.partition(source, 1);
792 List<List<Integer>> partitions = Lists.partition(source, 2);
801 List<List<Integer>> partitions = Lists.partition(source, 2);
803 assertTrue("partition should be RandomAccess, but not: "
807 assertTrue("partition[0] should be RandomAccess, but not: "
811 assertTrue("partition[
[all...]
/external/chromium/testing/gtest/test/
H A Dgtest_filter_unittest.py240 """Asserts that list_of_sets is a valid partition of set_var."""
314 partition = []
319 partition.append(tests_run)
321 self.AssertPartitionIsValid(tests_to_run, partition)
/external/gtest/test/
H A Dgtest_filter_unittest.py240 """Asserts that list_of_sets is a valid partition of set_var."""
314 partition = []
319 partition.append(tests_run)
321 self.AssertPartitionIsValid(tests_to_run, partition)
/external/protobuf/gtest/test/
H A Dgtest_filter_unittest.py196 """Asserts that list_of_sets is a valid partition of set_var."""
270 partition = []
275 partition.append(tests_run)
277 self.AssertPartitionIsValid(tests_to_run, partition)
/external/libvpx/vp8/decoder/
H A Ddecodframe.c436 const unsigned char *partition; local
442 /* Set up pointers to the first partition */
443 partition = cx_data;
450 partition += 3 * (num_part - 1);
458 /* Calculate the length of this partition. The last partition
467 partition_size = user_data_end - partition;
470 if (partition + partition_size > user_data_end
471 || partition + partition_size < partition)
[all...]
/external/hyphenation/
H A Dsubstrings.c43 // used by partition (which is used by qsort_arr)
60 static int partition( function
92 p = partition(a,b, left, right, p);
/external/libvorbis/lib/
H A Dpsy.c959 /* sort magnitudes for noise norm portion of partition */
1019 int partition=(p->vi->normal_p ? p->vi->normal_partition : 16); local
1050 raw[0] = alloca(ch*partition*sizeof(**raw));
1051 quant[0] = alloca(ch*partition*sizeof(**quant));
1052 floor[0] = alloca(ch*partition*sizeof(**floor));
1053 flag[0] = alloca(ch*partition*sizeof(**flag));
1056 raw[i] = &raw[0][partition*i];
1057 quant[i] = &quant[0][partition*i];
1058 floor[i] = &floor[0][partition*i];
1059 flag[i] = &flag[0][partition*
[all...]
/external/e2fsprogs/lib/blkid/
H A Dgetsize.c2 * getsize.c --- get the size of a partition.
73 * Returns the number of bytes in a partition
90 struct partition *pp;
169 * find the size of the partition.
/external/flac/libFLAC/
H A Dstream_encoder.c358 FLAC__uint64 *abs_residual_partition_sums; /* workspace where the sum of abs(candidate residual) for each partition is stored */
359 unsigned *raw_bits_per_partition; /* workspace where the sum of silog2(candidate residual) for each partition is stored */
382 FLAC__bool use_wide_by_partition; /* use slow 64-bit versions of some functions because of the min partition order and blocksize */
2936 * Calculate the min,max Rice partition orders
3749 unsigned partition; local
3761 for(partition = 0; partition < (1u<<best_partition_order); partition++) {
3762 if(prc->parameters[partition] >= FLAC__ENTROPY_CODING_METHOD_PARTITIONED_RICE_ESCAPE_PARAMETER) {
3809 unsigned partition, residual_sampl local
3870 unsigned partition, partition_sample, partition_samples, residual_sample; local
4035 unsigned partition, residual_sample; local
[all...]
/external/kernel-headers/original/linux/
H A Dgenhd.h22 LINUX_RAID_PARTITION = 0xfd, /* autodetect RAID partition */
42 struct partition { struct
47 unsigned char sys_ind; /* What partition type */
52 unsigned int nr_sects; /* nr of sectors in partition */
64 struct partition { struct
69 unsigned char sys_ind; /* What partition type */
74 __le32 nr_sects; /* nr of sectors in partition */
258 __le16 s_tag; /* ID tag of partition */
260 __le32 s_start; /* start sector no of partition */
261 __le32 s_size; /* # of blocks in partition */
[all...]

Completed in 539 milliseconds

123