/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...] |
/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 | 48 Ebml_StartSubElement(&ebml, &clusterStart, Cluster); //cluster 54 } //end cluster
|
EbmlIDs.h | 61 /* Cluster */ 62 Cluster = 0x1F43B675,
|
/external/clang/lib/StaticAnalyzer/Core/ |
RegionStore.cpp | 216 const ClusterBindings &Cluster = I.getData(); 217 for (ClusterBindings::iterator CI = Cluster.begin(), CE = Cluster.end(); 250 ClusterBindings Cluster = (ExistingCluster ? *ExistingCluster 253 ClusterBindings NewCluster = CBFactory.add(Cluster, K, V); 265 const ClusterBindings *Cluster = lookup(K.getBaseRegion()); 266 if (!Cluster) 268 return Cluster->lookup(K); 278 const ClusterBindings *Cluster = lookup(Base); 279 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/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. 228 /// as "cluster", meaning it is artificial and wants to be adjacent. 230 return getKind() == Order && Contents.OrdKind == 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...] |
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | 55 static cl::opt<bool> EnableLoadCluster("misched-cluster", cl::Hidden, 748 // LoadClusterMutation - DAG post-processing to cluster loads. 752 /// \brief Post-process the DAG to create cluster edges between neighboring 809 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) { 811 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU(" 831 /// \brief Callback from DAG postProcessing to create cluster edges for loads. 868 /// \brief Post-process the DAG to create cluster edges between instructions 879 /// \brief Callback from DAG postProcessing to create cluster edges to encourage 898 bool Success = DAG->addEdge(&DAG->ExitSU, SDep(SU, SDep::Cluster)); [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/libvpx/libvpx/ |
vpxenc.c | 801 /* Open the new cluster */ 806 Ebml_StartSubElement(glob, &glob->startCluster, Cluster); /* cluster */ [all...] |