/third_party/astc-encoder/Source/ |
H A D | astcenc_averages_and_directions.cpp | 28 * @brief Compute the average RGB color of each partition. 30 * The algorithm here uses a vectorized sequential scan and per-partition 34 * the last partition can be computed given that we know the block-wide average 44 * @param[out] averages The output averages. Unused partition indices will 56 // For 1 partition just use the precomputed mean in compute_partition_averages_rgb() 61 // For 2 partitions scan results for partition 0, compute partition 1 in compute_partition_averages_rgb() 97 // For 3 partitions scan results for partition 0/1, compute partition 2 in compute_partition_averages_rgb() 144 // For 4 partitions scan results for partition in compute_partition_averages_rgb() [all...] |
H A D | astcenc_find_best_partitioning.cpp | 21 * @brief Functions for finding best partition for a block. 23 * The partition search operates in two stages. The first pass uses kmeans clustering to group 24 * texels into an ideal partitioning for the requested partition count, and then compares that 25 * against the 1024 partitionings generated by the ASTC partition hash function. The generated 26 * partitions are then ranked by the number of texels in the wrong partition, compared to the ideal 28 * partitionings that actually generate fewer than the requested partition count, but only the top 38 * partition. This defines two lines, both of which go through the mean color value. 58 * @param[out] cluster_centers The initial partition cluster center colors. 143 * @param cluster_centers The partition cluster center colors. 144 * @param[out] partition_of_texel The partition assigne 232 uint8_t partition = partition_of_texel[i]; kmeans_update() local [all...] |
H A D | astcenc_partition_tables.cpp | 19 * @brief Functions for generating partition tables on demand. 24 /** @brief The number of 64-bit words needed to represent a canonical partition bit pattern. */ 28 * @brief Generate a canonical representation of a partition pattern. 31 * the remapped texel index. Remapping ensures that we only match on the partition pattern, 32 * independent of the partition order generated by the hash. 35 * @param partition_of_texel The partition assignments, in hash order. 50 // that the lowest texel index in partition N is smaller than the lowest texel index in in generate_canonical_partitioning() 51 // partition N + 1. in generate_canonical_partitioning() 108 * @brief Hash function used for procedural partition assignment. 133 * @param seed The seed - the partition inde 244 uint8_t partition; select_partition() local [all...] |
/third_party/NuttX/fs/mount/ |
H A D | fs_mount.c | 157 mtd_partition *partition = NULL; in mount() local 271 partition = (mtd_partition *)((struct drv_data *)device->data)->priv; in mount() 272 partition->mountpoint_name = (char *)zalloc(strlen(target) + 1); in mount() 273 if (partition->mountpoint_name == NULL) in mount() 278 (void)strncpy_s(partition->mountpoint_name, strlen(target) + 1, target, strlen(target)); in mount() 279 partition->mountpoint_name[strlen(target)] = '\0'; in mount() 312 if (fsmap->is_mtd_support && (device != NULL) && (partition != NULL)) in mount() 314 free(partition->mountpoint_name); in mount() 315 partition->mountpoint_name = NULL; in mount()
|
/third_party/skia/third_party/externals/swiftshader/third_party/astc-encoder/Source/ |
H A D | astc_partition_tables.cpp | 19 * @brief Functions for generating partition tables on demand. 25 Produce a canonicalized representation of a partition pattern 75 For a partition table, detect partitionss that are equivalent, then mark them as invalid. This reduces the number of partitions that the codec has to consider and thus improves encode 213 int partition; in select_partition() local 215 partition = 0; in select_partition() 217 partition = 1; in select_partition() 219 partition = 2; in select_partition() 221 partition = 3; in select_partition() 222 return partition; in select_partition() 251 int partition in generate_one_partition_table() local [all...] |
H A D | astc_decompress_symbolic.cpp | 201 // get the appropriate partition-table entry in decompress_symbolic_block() 268 int partition = pt->partition_of_texel[i]; in decompress_symbolic_block() local 271 color_endpoint0[partition], in decompress_symbolic_block() 272 color_endpoint1[partition], in decompress_symbolic_block() 277 blk->rgb_lns[i] = rgb_hdr_endpoint[partition]; in decompress_symbolic_block() 278 blk->alpha_lns[i] = alpha_hdr_endpoint[partition]; in decompress_symbolic_block() 279 blk->nan_texel[i] = nan_endpoint[partition]; in decompress_symbolic_block()
|
/third_party/lame/libmp3lame/ |
H A D | takehiro.c | 1220 int table_number, row_in_table, partition, nr_sfb, window, over; in mpeg2_scale_bitcount() local 1226 Set partition table. Note that should try to use table one, in mpeg2_scale_bitcount() 1240 for (sfb = 0, partition = 0; partition < 4; partition++) { in mpeg2_scale_bitcount() 1241 nr_sfb = partition_table[partition] / 3; in mpeg2_scale_bitcount() 1244 if (scalefac[sfb * 3 + window] > max_sfac[partition]) in mpeg2_scale_bitcount() 1245 max_sfac[partition] = scalefac[sfb * 3 + window]; in mpeg2_scale_bitcount() 1251 for (sfb = 0, partition = 0; partition < in mpeg2_scale_bitcount() [all...] |
/third_party/benchmark/tools/gbench/ |
H A D | report.py | 135 (i.e. partition/filter into groups with common name) 185 def extract_field(partition, field_name): 187 lhs = [x[field_name] for x in partition[0]] 188 rhs = [x[field_name] for x in partition[1]] 256 for partition in partitions: 257 benchmark_name = partition[0][0]['name'] 258 label = partition[0][0]['label'] if 'label' in partition[0][0] else '' 259 time_unit = partition[0][0]['time_unit'] 263 for i in range(min(len(partition[ [all...] |
/third_party/ltp/testcases/kernel/fs/ftest/ |
H A D | ftest06.c | 36 * ftest06 [-f tmpdirname] nchild iterations [partition] 96 static char *partition; variable 460 sprintf(mount_buffer, "/bin/umount %s", partition); in cleanup() 463 partition, mntpoint); in cleanup() 464 if (umount(partition)) { in cleanup() 467 partition, mntpoint); in cleanup() 471 partition); in cleanup() 475 if (umount(partition)) { in cleanup() 477 partition, mntpoint); in cleanup()
|
H A D | ftest02.c | 33 * ftest02 [-f tmpdirname] nchild iterations [partition] 91 static char *partition; variable 445 sprintf(mount_buffer, "/bin/umount %s", partition); in cleanup() 450 partition, mntpoint); in cleanup() 452 if (umount(partition)) in cleanup() 455 partition, mntpoint); in cleanup() 459 partition); in cleanup() 462 } else if (umount(partition)) in cleanup() 464 partition, mntpoint); in cleanup()
|
/third_party/toybox/toys/pending/ |
H A D | fdisk.c | 16 Change partition table 19 -l Show partition table for each DISK, then exit 44 #define PARTITION_MAX 60 //partition max is modifiable 51 struct partition { struct 57 struct partition *part; 91 static struct partition* part_offset(char *secbuf, int i) in part_offset() 93 return (struct partition*)(secbuf + 0x1be + i*(sizeof(struct partition))); in part_offset() 102 static void set_hsc(struct partition *p, sector_t start, sector_t end) in set_hsc() 186 static int is_partition_clear(struct partition* 407 consistency_check(const struct partition *p, int partition) consistency_check() argument [all...] |
/third_party/python/Lib/urllib/ |
H A D | parse.py | 172 hostname, percent, zone = hostname.partition(separator) 198 username, have_password, password = userinfo.partition(':') 209 _, have_open_br, bracketed = hostinfo.partition('[') 211 hostname, _, port = bracketed.partition(']') 212 _, _, port = port.partition(':') 214 hostname, _, port = hostinfo.partition(':') 228 username, have_password, password = userinfo.partition(b':') 239 _, have_open_br, bracketed = hostinfo.partition(b'[') 241 hostname, _, port = bracketed.partition(b']') 242 _, _, port = port.partition( [all...] |
/third_party/python/Tools/clinic/ |
H A D | cpp.py | 109 _, _, line = line.partition('*/') 117 before, _, remainder = line.partition('/*') 118 comment, comment_ends, after = remainder.partition('*/') 130 before, line_comment, comment = line.partition('//')
|
/third_party/python/Mac/IDLE/IDLE.app/Contents/Resources/ |
H A D | idlemain.py | 54 p = pyex.partition('.app') 57 value.partition('.app') != (p[0], p[1], '/Contents/Resources')]
|
/third_party/python/Tools/i18n/ |
H A D | makelocalealias.py | 35 alias_lang, _, alias_mod = alias.partition('@') 37 alias_mod, _, alias_enc = alias_mod.partition('.') 82 alias, _, modifier = alias.partition('@')
|
/third_party/gn/misc/ |
H A D | help_as_html.py | 31 command, sep, rest = line.partition(':') 54 name, sep, rest = line.partition(':')
|
/third_party/node/tools/gyp/tools/ |
H A D | graphviz.py | 18 target, _, suffix = target.partition("#") 19 filename, _, target = target.partition(":")
|
/third_party/python/Tools/scripts/ |
H A D | generate_stdlib_module_names.py | 101 line = line.partition("#")[0] 132 if name.partition('.')[0] in names:
|
/third_party/googletest/googletest/test/ |
H A D | googletest-filter-unittest.py | 259 """Asserts that list_of_sets is a valid partition of set_var.""" 334 partition = [] 339 partition.append(tests_run) 341 self.AssertPartitionIsValid(tests_to_run, partition)
|
/third_party/gptfdisk/ |
H A D | gdisk_test.sh | 24 # - Create a single Linux partition 25 # - Change name of partition 26 # - Change type of partition 28 # - Delete the single partition 34 # Create MBR partition table with fdisk and migrate it with gdisk 52 # the test partition to create 56 # newname for the partition 79 # Verify that the partition exist and has the given type/name 84 partition=$($GDISK_BIN -l $TEMP_DISK | tail -n 1) 85 echo $partition | gre [all...] |
/third_party/icu/tools/cldr/cldr-to-icu/src/main/java/org/unicode/icu/tool/cldrtoicu/ant/ |
H A D | LocaleIdResolver.java | 61 Iterables.partition(redundant, 16) in resolve() 73 Iterables.partition(idsByFirstChar.get(c), 16) in resolve()
|
/third_party/skia/third_party/externals/oboe/apps/OboeTester/scripts/ |
H A D | dsp_timing.py | 82 name, var = line.partition("=")[::2] 90 name, var = line.partition("=")[::2]
|
/third_party/python/Lib/importlib/metadata/ |
H A D | __init__.py | 525 self.mode, _, self.value = spec.partition('=') 712 extra, sep, markers = section.partition(':') 837 name = low.rpartition(".")[0].partition("-")[0] 841 name = base.rpartition(".")[0].partition("-")[0] 971 name, sep, rest = filename.partition('-')
|
/third_party/python/Tools/c-analyzer/c_common/ |
H A D | strutil.py | 39 line = line.partition('#')[0]
|
/third_party/ffmpeg/libavformat/ |
H A D | mxfdec.c | 486 // we look for partition where the offset is placed in find_body_sid_by_absolute_offset() 715 MXFPartition *partition, *tmp_part; in mxf_read_partition_pack() local 732 /* insert the new partition pack in the middle in mxf_read_partition_pack() 737 partition = mxf->current_partition = &mxf->partitions[mxf->last_forward_partition]; in mxf_read_partition_pack() 740 partition = mxf->current_partition = &mxf->partitions[mxf->partitions_count]; in mxf_read_partition_pack() 743 memset(partition, 0, sizeof(*partition)); in mxf_read_partition_pack() 745 partition->pack_length = avio_tell(pb) - klv_offset + size; in mxf_read_partition_pack() 746 partition->pack_ofs = klv_offset; in mxf_read_partition_pack() 750 partition in mxf_read_partition_pack() 3193 mxf_metadataset_init(MXFMetadataSet *ctx, enum MXFMetadataSetType type, MXFPartition *partition) mxf_metadataset_init() argument 4132 MXFPartition *partition; mxf_read_seek() local [all...] |