/external/chromium_org/media/formats/webm/ |
H A D | webm_cluster_parser_unittest.cc | 48 // directs CreateCluster() to exclude BlockDuration entry from the cluster for 285 // back too to keep the timestamps emitted for a cluster monotonically 337 // Iteratively create a cluster containing the first N+1 blocks and parse all 338 // but the last byte of the cluster (except when N==|block_count|, just parse 339 // the whole cluster). Verify that the corresponding entry in 346 // cluster, build a cluster with exactly one additional block so that 350 scoped_ptr<Cluster> cluster(CreateCluster(0, kBlockInfo, 352 // Parse all but the last byte unless we need to parse the full cluster. 354 int result = parser_->Parse(cluster [all...] |
H A D | webm_parser_unittest.cc | 160 // known-sized cluster causes parse error. 217 scoped_ptr<Cluster> cluster(CreateCluster(kBlockCount)); 221 EXPECT_EQ(cluster->size(), parser.Parse(cluster->data(), cluster->size())); 226 scoped_ptr<Cluster> cluster(CreateCluster(kBlockCount)); 229 const uint8* data = cluster->data(); 230 int size = cluster->size(); 260 scoped_ptr<Cluster> cluster(CreateCluster(kBlockCount)); 270 // Send slightly less than the full cluster s [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | TextAutosizer.cpp | 84 void TextAutosizer::writeClusterDebugInfo(Cluster* cluster) argument 87 if (cluster->m_flags & SUPPRESSING) { 89 } else if (!(cluster->m_flags & (INDEPENDENT | WIDER_OR_NARROWER))) { 91 } else if (cluster->m_supercluster) { 93 } else if (!clusterHasEnoughTextToAutosize(cluster)) { 96 const RenderBlock* widthProvider = clusterWidthProvider(cluster->m_root); 97 if (cluster->m_hasTableAncestor && cluster->m_multiplier < multiplierFromBlock(widthProvider)) { 105 if (cluster->m_root->isRenderView()) { 109 float multiplier = cluster 397 Cluster* cluster = currentCluster(); local 440 Cluster* cluster = currentCluster(); local 599 clusterHasEnoughTextToAutosize(Cluster* cluster, const RenderBlock* widthProvider) argument 736 clusterMultiplier(Cluster* cluster) argument 780 superclusterMultiplier(Cluster* cluster) argument 867 deepestBlockContainingAllText(Cluster* cluster) argument 977 isWiderOrNarrowerDescendant(Cluster* cluster) argument [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/ |
H A D | webmdec.cc | 38 webm_ctx->cluster = NULL; 49 const mkvparser::Cluster *const cluster = segment->GetFirst(); member in class:__anon13231::mkvparser 50 webm_ctx->cluster = cluster; 125 const mkvparser::Cluster* cluster = local 126 reinterpret_cast<const mkvparser::Cluster*>(webm_ctx->cluster); 136 status = cluster->GetFirst(block_entry); 139 cluster = segment->GetNext(cluster); 140 if (cluster [all...] |
H A D | webmdec.h | 25 const void *cluster; member in struct:WebmInputContext
|
/external/harfbuzz_ng/util/ |
H A D | helper-cairo.cc | 441 if (hb_glyph[i].cluster != hb_glyph[i-1].cluster) 474 unsigned int cluster = 0; local 476 l->clusters[cluster].num_glyphs++; 479 if (hb_glyph[i].cluster != hb_glyph[i+1].cluster) { 480 g_assert (hb_glyph[i].cluster > hb_glyph[i+1].cluster); 482 end = start + hb_glyph[i].cluster - hb_glyph[i+1].cluster; [all...] |
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-buffer.cc | 216 unsigned int cluster) 227 glyph->cluster = cluster; 436 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end) 489 last_cluster = info[0].cluster; 491 if (last_cluster != info[i].cluster) { 494 last_cluster = info[i].cluster; 511 unsigned int cluster = info[start].cluster; local 215 add(hb_codepoint_t codepoint, unsigned int cluster) argument 543 unsigned int cluster = out_info[start].cluster; local [all...] |
H A D | hb-graphite2.cc | 212 unsigned int cluster; member in struct:hb_graphite2_cluster_t 303 clusters[0].cluster = buffer->info[0].cluster; 321 c->cluster = buffer->info[c->base_char].cluster; 341 info->cluster = clusters[i].cluster;
|
H A D | hb-coretext.cc | 438 * B1 M1 B2 M2, and B1-B2 form a ligature, M2's cluster will 440 * cluster... */ 633 unsigned int cluster = buffer->info[i].cluster; local 634 log_clusters[chars_len++] = cluster; 636 log_clusters[chars_len++] = cluster; /* Surrogates. */ 880 info->cluster = log_clusters[j]; 938 info->cluster = log_clusters[string_indices[j]]; 1016 * beginning of the reordered cluster. CoreText is nice enough 1022 * or the native OT backend, only that the cluster indice 1029 unsigned int cluster = info[count - 1].cluster; local 1038 unsigned int cluster = info[0].cluster; local [all...] |
H A D | hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t 233 unsigned int cluster); 287 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
H A D | hb-buffer-deserialize-text.hh | 389 { if (!parse_uint (tok, p, &info.cluster )) return false; } 433 { if (!parse_uint (tok, p, &info.cluster )) return false; } 510 { if (!parse_uint (tok, p, &info.cluster )) return false; }
|
/external/harfbuzz_ng/src/ |
H A D | hb-buffer.cc | 216 unsigned int cluster) 227 glyph->cluster = cluster; 436 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end) 489 last_cluster = info[0].cluster; 491 if (last_cluster != info[i].cluster) { 494 last_cluster = info[i].cluster; 511 unsigned int cluster = info[start].cluster; local 215 add(hb_codepoint_t codepoint, unsigned int cluster) argument 543 unsigned int cluster = out_info[start].cluster; local [all...] |
H A D | hb-buffer-deserialize-json.rl | 63 action parse_cluster { if (!parse_uint (tok, p, &info.cluster )) return false; } 82 cluster = "\"cl\"" colon (unum >tok %parse_cluster); 88 element = glyph | cluster | xoffset | yoffset | xadvance | yadvance;
|
H A D | hb-buffer-deserialize-text.rl | 62 action parse_cluster { if (!parse_uint (tok, p, &info.cluster )) return false; } 75 cluster = '=' (unum >tok %parse_cluster); 81 cluster?
|
H A D | hb-graphite2.cc | 212 unsigned int cluster; member in struct:hb_graphite2_cluster_t 303 clusters[0].cluster = buffer->info[0].cluster; 321 c->cluster = buffer->info[c->base_char].cluster; 341 info->cluster = clusters[i].cluster;
|
H A D | hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t 233 unsigned int cluster); 287 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
/external/chromium_org/ui/gfx/ |
H A D | color_analysis.cc | 32 // Support class to hold information about each cluster of pixel data in 34 // that exist in the cluster, it keeps track of the aggregate sum so it can 65 // Recomputes the centroid of the cluster based on the aggregate data. The 97 // if the centroid of the cluster has moved. This determines whether or 110 // of the cluster for sorting. 123 // Holds the sum of all the points that make up this cluster. Used to 128 // The weight of the cluster, determined by how many points were used 231 // Pick a starting point for each cluster 232 std::vector<KMeanCluster>::iterator cluster = clusters.begin(); local 233 while (cluster ! [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | tipc.h | 63 unsigned int cluster, 66 return (zone << 24) | (cluster << 12) | node; 62 tipc_addr(unsigned int zone, unsigned int cluster, unsigned int node) argument
|
/external/fio/engines/ |
H A D | rbd.c | 18 rados_t cluster; member in struct:rbd_data 99 r = rados_create(&(rbd_data->cluster), o->client_name); 105 r = rados_conf_read_file(rbd_data->cluster, NULL); 111 r = rados_connect(rbd_data->cluster); 117 r = rados_ioctx_create(rbd_data->cluster, o->pool_name, 135 rados_shutdown(rbd_data->cluster); 156 if (rbd_data->cluster) { 157 rados_shutdown(rbd_data->cluster); 158 rbd_data->cluster = NULL; 340 /* log version of librbd. No cluster connectio [all...] |
/external/chromium_org/chrome/tools/ |
H A D | history-viz.py | 120 cluster = pred(obj) 121 clusters[cluster] = clusters.get(cluster, []) 122 clusters[cluster].append(obj) 197 print ' subgraph cluster%d%d {' % (i, j)
|
/external/e2fsprogs/e2fsck/ |
H A D | pass1b.c | 57 blk64_t cluster; member in struct:cluster_el 93 static int check_if_fs_cluster(e2fsck_t ctx, blk64_t cluster); 119 static void add_dupe(e2fsck_t ctx, ext2_ino_t ino, blk64_t cluster, argument 128 n = dict_lookup(&clstr_dict, INT_TO_VOIDPTR(cluster)); 133 sizeof(struct dup_cluster), "duplicate cluster header"); 136 dict_alloc_insert(&clstr_dict, INT_TO_VOIDPTR(cluster), db); 163 sizeof(struct cluster_el), "cluster element"); 164 cluster_el->cluster = cluster; 189 * Free a duplicate cluster recor 917 check_if_fs_cluster(e2fsck_t ctx, blk64_t cluster) argument [all...] |
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
H A D | MatrixFunction.h | 167 DynamicIntVectorType m_eivalToCluster; /**< \brief m_eivalToCluster[i] = j means i-th ei'val is in j-th cluster */ 169 DynamicIntVectorType m_blockStart; /**< \brief Row index at which block corresponding to i-th cluster starts */ 170 IntVectorType m_permutation; /**< \brief Permutation which groups ei'vals in the same cluster together */ 228 * # Any eigenvalue in a certain cluster is at most separation() away 229 * from another eigenvalue in the same cluster. 268 /** \brief Find cluster in #m_clusters containing some value 270 * \returns Iterator to cluster containing \c key, or 271 * \c m_clusters.end() if no cluster in m_clusters contains \c key. 296 for (typename ListOfClusters::const_iterator cluster = m_clusters.begin(); cluster ! 325 Index cluster = m_eivalToCluster[i]; local [all...] |
/external/harfbuzz_ng/test/api/ |
H A D | test-buffer.c | 196 unsigned int cluster; local 197 cluster = 1+i; 200 cluster++; 202 cluster += 3; 205 g_assert_cmphex (glyphs[i].cluster, ==, cluster); 219 * in its own cluster */ 229 /* now form a cluster and test again */ 230 glyphs[2].cluster = glyphs[1].cluster; [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/third_party/libwebm/ |
H A D | mkvmuxer.cpp | 1635 // Write "unknown" (EBML coded -1) as cluster size value. We need to write 8 1636 // bytes because we do not know how big our cluster will be. 1982 Cluster* const cluster = cluster_list_[i]; local 1983 delete cluster; 2021 cue_point->set_cluster_pos(cluster_pos); // update the new cluster position 2116 // Update last cluster's size 2233 const Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2234 if (!cluster) 2242 cue->set_block_number(cluster->blocks_added()); 2243 cue->set_cluster_pos(cluster 2302 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2361 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2422 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2464 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2797 Cluster*& cluster = cluster_list_[cluster_list_size_]; local 2914 Cluster* const cluster = cluster_list_[i]; local 2960 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 3012 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local [all...] |
/external/libvpx/libvpx/third_party/libwebm/ |
H A D | mkvmuxer.cpp | 1737 // Write "unknown" (EBML coded -1) as cluster size value. We need to write 8 1738 // bytes because we do not know how big our cluster will be. 2093 Cluster* const cluster = cluster_list_[i]; local 2094 delete cluster; 2133 cue_point->set_cluster_pos(cluster_pos); // update the new cluster position 2229 // Update last cluster's size 2348 const Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local 2349 if (!cluster) 2357 cue->set_block_number(cluster->blocks_added()); 2358 cue->set_cluster_pos(cluster 2422 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2488 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2556 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local 2603 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local 2957 Cluster*& cluster = cluster_list_[cluster_list_size_]; local 3075 Cluster* const cluster = cluster_list_[i]; local 3121 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local 3178 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local [all...] |