Searched defs:partitions (Results 1 - 17 of 17) sorted by relevance

/external/eigen/bench/
H A Dcheck_cache_queries.cpp66 int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] local
69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
74 cout << "cache[" << cache_id << "].partitions = " << partitions << "\n"; local
/external/gptfdisk/
H A Dbsd.h25 // FreeBSD documents a maximum # of partitions of 8, but I saw 16 on a NetBSD
29 // theoretical maximum of 118.75 partitions that the program can handle before
67 uint16_t numParts; // number of partitions in table
68 struct BSDRecord* partitions; // partition array member in class:BSDData
85 // Functions to extract data on specific partitions....
H A Dbasicmbr.h16 // Maximum number of MBR partitions
28 // go. Also used when loading logical partitions.
34 struct MBRRecord partitions[4]; member in struct:TempMBR
48 // the logical partitions, to simplify data retrieval for GPT conversions.
49 MBRPart partitions[MAX_MBR_PARTS]; member in class:BasicMBRData
109 // Functions to create, delete, or change partitions
141 // Functions to extract data on specific partitions....
H A Dgpt.h65 GPTPart *partitions; member in class:GPTData
66 uint32_t numParts; // # of partitions the table can hold
81 uint32_t sectorAlignment; // Start partitions at multiples of sectorAlignment
189 uint32_t ComputeAlignment(void); // Set alignment based on current partitions
/external/e2fsprogs/lib/ext2fs/
H A Ddosio.c45 * Array of all opened partitions
47 static PARTITION **partitions = NULL; variable
48 static unsigned short npart = 0; /* Number of mapped partitions */
108 * For partition numbers >5 Linux uses DOS extended partitions -
110 * extended partitions when scanning for a first Linux/ext2fs.
119 return NULL; /* We don't support extended partitions for now */
220 if(!strcmp(partitions[i]->dev, dev))
223 active = partitions[i];
338 newparts = (PARTITION**)realloc(partitions, sizeof(PARTITION) * npart);
343 partitions
[all...]
/external/libvorbis/lib/
H A Dbackends.h62 int partitions; /* 0 to 31 */ member in struct:__anon10878
111 int partitions; /* possible codebooks for a partition */ member in struct:vorbis_info_residue0
112 int partvals; /* partitions ^ groupbook dim */
H A Dvorbisenc.c202 int partitions=f->partitions; local
205 for(i=0;i<partitions;i++)
477 for(i=0;i<r->partitions;i++)
485 for(i=0;i<r->partitions;i++){
497 for(i=0;i<r->partitions;i++)
505 for(i=0;i<r->partitions;i++){
/external/tremolo/Tremolo/
H A Dcodec_internal.h123 int partitions; /* 0 to 31 */ member in struct:__anon17999
142 char partitions; /* possible codebooks for a partition */ member in struct:vorbis_info_residue
/external/eigen/Eigen/src/Core/util/
H A DMemory.h799 int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] local
803 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
/external/opencv3/3rdparty/libwebp/webp/
H A Dencode.h121 int partitions; // log2(number of token partitions) in [0..3]. Default member in struct:WebPConfig
/external/webp/include/webp/
H A Dencode.h125 int partitions; // log2(number of token partitions) in [0..3]. Default member in struct:WebPConfig
/external/webp/src/webp/
H A Dencode.h125 int partitions; // log2(number of token partitions) in [0..3]. Default member in struct:WebPConfig
/external/flac/libFLAC/
H A Dstream_decoder.c2762 const unsigned partitions = 1u << partition_order; local
2776 for(partition = 0; partition < partitions; partition++) {
H A Dstream_encoder.c2497 /*@@@ new_blocksize*2 is too pessimistic, but to fix, we need smarter logic because a smaller new_blocksize can actually increase the # of partitions; would require moving this out into a separate function, then checking its capacity against the need of the current blocksize&min/max_partition_order (and maybe predictor order) */
3395 /* only use RICE2 partitions if stream bps > 16 */
3975 unsigned partitions = 1u << max_partition_order; local
3987 for(partition = residual_sample = 0; partition < partitions; partition++) {
3998 for(partition = residual_sample = 0; partition < partitions; partition++) {
4008 /* now merge partitions for lower orders */
4010 unsigned from_partition = 0, to_partition = partitions;
4014 partitions >>= 1;
4015 for(i = 0; i < partitions; i++) {
4043 const unsigned partitions local
4072 const unsigned partitions = 1u << partition_order; local
4210 const unsigned partitions = 1u << partition_order; local
[all...]
/external/toybox/toys/pending/
H A Dfdisk.c1 /* fdisk.c - fdisk program to modify partitions on disk.
89 struct part_entry partitions[PARTITION_MAX]; variable in typeref:struct:part_entry
212 pe = &partitions[i];
241 q = p = partitions[idx].part;
247 xprintf("Warning: deleting partitions after 60\n");
249 partitions[num_parts-1].modified = 1;
254 partitions[num_parts].part = part_offset(sec_buf, 0);
255 partitions[num_parts].sec_buffer = sec_buf;
259 partitions[num_parts].start_offset = offset;
303 struct part_entry *pe = &partitions[
[all...]
/external/libxml2/
H A Drelaxng.c287 int nbgroups; /* number of groups in the partitions */
932 * @partitions: a partition set structure
937 xmlRelaxNGFreePartition(xmlRelaxNGPartitionPtr partitions) argument
942 if (partitions != NULL) {
943 if (partitions->groups != NULL) {
944 for (j = 0; j < partitions->nbgroups; j++) {
945 group = partitions->groups[j];
954 xmlFree(partitions->groups);
956 if (partitions->triage != NULL) {
957 xmlHashFree(partitions
4317 xmlRelaxNGPartitionPtr partitions = NULL; local
9289 xmlRelaxNGPartitionPtr partitions; local
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.jface.text_3.6.1.r361_v20100825-0800.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 648 milliseconds