/external/chromium_org/media/webm/ |
cluster_builder.h | 14 class Cluster { 16 Cluster(scoped_ptr<uint8[]> data, int size); 17 ~Cluster(); 26 DISALLOW_IMPLICIT_CONSTRUCTORS(Cluster); 40 scoped_ptr<Cluster> Finish();
|
cluster_builder.cc | 13 0x1F, 0x43, 0xB6, 0x75, // CLUSTER ID 14 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // cluster(size = 0) 48 Cluster::Cluster(scoped_ptr<uint8[]> data, int size) 50 Cluster::~Cluster() {} 133 scoped_ptr<Cluster> ClusterBuilder::Finish() { 138 scoped_ptr<Cluster> ret(new Cluster(buffer_.Pass(), bytes_used_));
|
webm_cluster_parser_unittest.cc | 51 static scoped_ptr<Cluster> CreateCluster(int timecode, 76 // Creates a Cluster with one encrypted Block. |bytes_to_write| is number of 78 static scoped_ptr<Cluster> CreateEncryptedCluster(int bytes_to_write) { 223 scoped_ptr<Cluster> cluster(CreateCluster(0, kDefaultBlockInfo, block_count)); 225 // Send slightly less than the full cluster so all but the last block is 227 int result = parser_->Parse(cluster->data(), cluster->size() - 1); 229 EXPECT_LT(result, cluster->size()); 234 // Now parse a whole cluster to verify that all the blocks will get parsed [all...] |
webm_parser_unittest.cc | 39 static scoped_ptr<Cluster> CreateCluster(int block_count) { 71 0x1F, 0x43, 0xB6, 0x75, 0x80 // CLUSTER (size = 0) 88 0x1F, 0x43, 0xB6, 0x75, 0x80, // CLUSTER (size = 0) 108 0x1F, 0x43, 0xB6, 0x75, 0x81, // CLUSTER (size = 1) 127 0x1F, 0x43, 0xB6, 0x75, 0x81, 0x11 // CLUSTER (size = 1) 140 // Expecting to parse a Cluster, but get a Segment. 174 0x1F, 0x43, 0xB6, 0x75, 0x8A, // CLUSTER (size = 10) 194 scoped_ptr<Cluster> cluster(CreateCluster(kBlockCount)); 198 int result = parser.Parse(cluster->data(), cluster->size()) [all...] |
/external/libvpx/libwebm/ |
mkvparser.hpp | 75 class Cluster;
92 long long GetTimeCode(const Cluster*) const; //absolute, but not scaled
93 long long GetTime(const Cluster*) const; //absolute, and scaled (ns)
115 short m_timecode; //relative to cluster
130 BlockEntry(Cluster*, long index);
136 const Cluster* GetCluster() const;
144 Cluster* const m_pCluster;
156 SimpleBlock(Cluster*, long index, long long start, long long size);
175 Cluster*,
611 long long m_pos; //of cluster
[all...] |
mkvparser.cpp | 707 Cluster** i = m_clusters;
708 Cluster** j = m_clusters + count;
712 Cluster* const p = *i++;
910 if (id == 0x0F43B675) //Cluster ID
1075 long long cluster_size = -1; //size of cluster payload
1168 #if 0 //commented-out, to support incremental cluster parsing
1196 if (id != 0x0F43B675) //Cluster ID
1205 //We have a cluster.
1215 assert(cluster_off >= 0); //have cluster
1220 status = Cluster::HasBlockEntries(this, cluster_off, pos_, len_); [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
addressmap-inl.h | 44 // * Cluster -- aligned 1-MB region of the address space 45 // * Block-ID -- block-number within a cluster 46 // * Cluster-ID -- Starting address of cluster divided by cluster size 49 // 1. A hash-table maps from a cluster-ID to the data for that cluster. 50 // 2. For each non-empty cluster we keep an array indexed by 58 // | id->cluster |---> ... 60 // | id->cluster |---> Cluste [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
addressmap-inl.h | 44 // * Cluster -- aligned 1-MB region of the address space 45 // * Block-ID -- block-number within a cluster 46 // * Cluster-ID -- Starting address of cluster divided by cluster size 49 // 1. A hash-table maps from a cluster-ID to the data for that cluster. 50 // 2. For each non-empty cluster we keep an array indexed by 58 // | id->cluster |---> ... 60 // | id->cluster |---> Cluste [all...] |
/packages/apps/Gallery2/src/com/android/gallery3d/data/ |
TimeClustering.java | 41 // Disregard a cluster split time of anything over 2 hours. 47 // Try and merge 2 clusters if they are both smaller than min cluster size. 48 // The min cluster size can range from 8 to 15. 52 // Try and split a cluster if it is bigger than max cluster size. 53 // The max cluster size can range from 20 to 50. 57 // Initially put 2 items in the same cluster as long as they are within 58 // 3 cluster frequencies of each other. 66 // Make the cluster split time of a large cluster half that of a regula [all...] |
/external/libvpx/libvpx/libmkv/ |
testlibmkv.c | 47 Ebml_StartSubElement(&ebml, &clusterStart, Cluster); // cluster 53 } // end cluster
|
EbmlIDs.h | 60 /* Cluster */ 61 Cluster = 0x1F43B675,
|
/external/clang/lib/StaticAnalyzer/Core/ |
RegionStore.cpp | 218 const ClusterBindings &Cluster = I.getData(); 219 for (ClusterBindings::iterator CI = Cluster.begin(), CE = Cluster.end(); 252 ClusterBindings Cluster = (ExistingCluster ? *ExistingCluster 255 ClusterBindings NewCluster = CBFactory.add(Cluster, K, V); 267 const ClusterBindings *Cluster = lookup(K.getBaseRegion()); 268 if (!Cluster) 270 return Cluster->lookup(K); 280 const ClusterBindings *Cluster = lookup(Base); 281 if (!Cluster) [all...] |
/external/llvm/include/llvm/Support/ |
IntegersSubsetMapping.h | 35 // - Rename RangeIterator to the cluster iterator. 53 typedef std::pair<RangeEx, SuccessorClass*> Cluster; 62 typedef std::list<Cluster> CaseItems; 71 bool operator()(const Cluster &C1, const Cluster &C2) { 97 std::vector<Cluster> clustersVector; 436 const Cluster &LCluster = *L; 438 const Cluster &RCluster = *R;
|
/external/chromium_org/media/filters/ |
chunk_demuxer_unittest.cc | 139 // Default cluster to append first for simple tests. 140 scoped_ptr<Cluster> kDefaultFirstCluster() { 144 // Default cluster to append after kDefaultFirstCluster() 145 // has been appended. This cluster starts with blocks that 149 scoped_ptr<Cluster> kDefaultSecondCluster() { 289 scoped_ptr<Cluster> cluster) { 290 AppendData(source_id, cluster->data(), cluster->size()); 293 void AppendCluster(scoped_ptr<Cluster> cluster) 2326 scoped_ptr<Cluster> cluster = GenerateCluster(0, 2); local [all...] |
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
MatrixFunction.h | 137 typedef std::list<Scalar> Cluster; 138 typedef std::list<Cluster> ListOfClusters; 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. 245 Cluster l; 267 /** \brief Find cluster in #m_clusters containing some value 269 * \returns Iterator to cluster containing \c key, o 324 Index cluster = m_eivalToCluster[i]; local [all...] |
/external/llvm/include/llvm/CodeGen/ |
ScheduleDAG.h | 70 Cluster ///< Weak DAG edge linking a chain of clustered instrs. 209 /// as "cluster", meaning it is artificial and wants to be adjacent. 211 return getKind() == Order && Contents.OrdKind == Cluster;
|
/external/chromium_org/media/webm/chromeos/ |
webm_encoder.cc | 212 StartSubElement(Cluster); { 214 } // Cluster left open. 251 EndSubElement(); // Cluster
|
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 43 // This is a cluster of orthogonal Transforms 208 // Remove all but one incoming entries from the cluster 241 IntegersSubsetToBB::Cluster &C = *i;
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.cpp | 220 bool Cluster = false; 239 Cluster = true; 242 if (!Cluster) 266 // Cluster loads by adding MVT::Glue outputs and inputs. This also 289 /// ClusterNodes - Cluster certain nodes which should be scheduled together. 301 // Cluster loads from "near" addresses into combined SUnits. 517 // Cluster certain nodes which should be scheduled together. [all...] |
SelectionDAGBuilder.cpp | [all...] |
/frameworks/av/media/libstagefright/matroska/ |
MatroskaExtractor.cpp | 108 const mkvparser::Cluster *mCluster; 241 // Need to parse this cluster some more 251 ALOGE("Cluster::Parse returned result %ld", res); 259 // We're done with this cluster 261 const mkvparser::Cluster *nextCluster; 503 // stream to find the target Cluster then iterating to finalize for
|
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | 56 static cl::opt<bool> EnableLoadCluster("misched-cluster", cl::Hidden, 772 // LoadClusterMutation - DAG post-processing to cluster loads. 776 /// \brief Post-process the DAG to create cluster edges between neighboring 833 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) { 835 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU(" 855 /// \brief Callback from DAG postProcessing to create cluster edges for loads. 892 /// \brief Post-process the DAG to create cluster edges between instructions 903 /// \brief Callback from DAG postProcessing to create cluster edges to encourage [all...] |
/external/libvpx/libvpx/ |
vpxenc.c | 776 /* Open the new cluster */ 781 Ebml_StartSubElement(glob, &glob->startCluster, Cluster); /* cluster */ [all...] |