Searched refs:cluster (Results 1 - 13 of 13) sorted by relevance

/frameworks/base/core/java/com/android/internal/os/
H A DCpuPowerCalculator.java37 // Aggregate total time spent on each cluster.
40 for (int cluster = 0; cluster < numClusters; cluster++) {
41 final int speedsForCluster = mProfile.getNumSpeedStepsInCpuCluster(cluster);
43 totalTime += u.getTimeAtCpuSpeed(cluster, speed, statsType);
49 for (int cluster = 0; cluster < numClusters; cluster++) {
50 final int speedsForCluster = mProfile.getNumSpeedStepsInCpuCluster(cluster);
[all...]
H A DPowerProfile.java307 private static final String POWER_CPU_CLUSTER_SPEED_PREFIX = "cpu.speeds.cluster";
308 private static final String POWER_CPU_CLUSTER_ACTIVE_PREFIX = "cpu.active.cluster";
322 for (int cluster = 0; cluster < array.length; cluster++) {
323 int numCpusInCluster = (int) Math.round(array[cluster]);
324 mCpuClusters[cluster] = new CpuClusterKey(
325 POWER_CPU_CLUSTER_SPEED_PREFIX + cluster,
326 POWER_CPU_CLUSTER_ACTIVE_PREFIX + cluster,
360 public double getAveragePowerForCpu(int cluster, in argument
[all...]
H A DBatteryStatsImpl.java5615 public long getTimeAtCpuSpeed(int cluster, int step, int which) { argument
5617 if (cluster >= 0 && cluster < mCpuClusterSpeed.length) {
5618 final LongSamplingCounter[] cpuSpeeds = mCpuClusterSpeed[cluster];
6319 for (int cluster = 0; cluster < numCpuClusters; cluster++) {
6323 mBsi.mPowerProfile.getNumSpeedStepsInCpuCluster(cluster) != numSpeeds) {
6328 mCpuClusterSpeed[cluster] = cpuSpeeds;
6335 mCpuClusterSpeed[cluster]
[all...]
/frameworks/ml/bordeaux/service/src/android/bordeaux/services/
H A DClusterManager.java33 * locations initially are kept by the clusters. Periodially, a cluster consolidating
34 * procedure is carried out to refine the cluster centers. After consolidation, the
49 // A location cluster can be labeled as a semantic cluster if it has been
125 // add the last location to cluster.
126 // first find the cluster it belongs to.
136 // add the location to the selected cluster
140 // if it is far away from all existing clusters, create a new cluster.
141 LocationCluster cluster = new LocationCluster(mLastLocation, duration);
142 mLocationClusters.add(cluster);
[all...]
H A DBaseCluster.java114 * This computes the distance from loation to the cluster center in meter.
120 public float distanceToCluster(BaseCluster cluster) { argument
121 return (float) computeDistance(mCenter, cluster.mCenter);
124 public void absorbCluster(BaseCluster cluster) { argument
125 averageCenter(cluster.mCenter, cluster.mDuration);
126 absorbHistogram(cluster);
129 public void setCluster(BaseCluster cluster) { argument
131 mCenter[i] = cluster.mCenter[i];
134 mHistogram.putAll(cluster
138 absorbHistogram(BaseCluster cluster) argument
[all...]
H A DIAggregatorManager.aidl30 boolean setFakeLocation(in String cluster);
H A DLocationCluster.java70 // update cluster center
94 // centers. Note that if the cluster is consolidated for the first time,
95 // the weight for the existing cluster would be zero.
112 * if the new created cluster whose covered area overlaps with any existing
113 * cluster move the center away from that cluster till there is no overlap.
115 public void moveAwayCluster(LocationCluster cluster, float distance) { argument
120 dot += mCenter[i] * cluster.mCenter[i];
124 vector[i] = mCenter[i] - dot * cluster.mCenter[i];
131 mCenter[i] = cluster
[all...]
/frameworks/minikin/libs/minikin/
H A DLayout.cpp813 mAdvances[info[0].cluster - start] += letterSpaceHalfLeft;
825 if (i > 0 && info[i - 1].cluster != info[i].cluster) {
826 mAdvances[info[i - 1].cluster - start] += letterSpaceHalfRight;
827 mAdvances[info[i].cluster - start] += letterSpaceHalfLeft;
845 if (info[i].cluster - start < count) {
846 mAdvances[info[i].cluster - start] += xAdvance;
848 ALOGE("cluster %zu (start %zu) out of bounds of count %zu",
849 info[i].cluster - start, start, count);
855 mAdvances[info[numGlyphs - 1].cluster
[all...]
/frameworks/av/media/libstagefright/webm/
H A DWebmFrameThread.cpp92 // Initializes a webm cluster with its starting timecode.
98 // the starting timecode of the cluster; this is the timecode of the first
102 // list to hold child elements in a webm cluster (start timecode and
124 sp<WebmElement> cluster = new WebmMaster(kMkvCluster, children); local
125 cluster->write(mFd, size);
129 // Write out (possibly multiple) webm cluster(s) from frames split on video key frames.
148 // frame (the last frame), which belongs to the next cluster; also hold back on
231 ALOGV("flushing last cluster (size %zu)", outstandingFrames.size());
/frameworks/base/tools/apilint/
H A Dapilint.py839 def cluster(args): function in function:verify_overload_args
848 common_args = cluster(methods[0].args)
850 common_args = common_args & cluster(m.args)
858 if not common_args.issubset(cluster(sig)):
/frameworks/opt/net/wifi/service/jni/
H A Dcom_android_server_wifi_nan_WifiNanNative.cpp188 helper.setByteArrayRegion(macBytes, 0, 6, (jbyte *) event->data.cluster.addr);
/frameworks/opt/net/wifi/tests/wifitests/jni/
H A Dwifi_nan_hal_mock.cpp510 jsonR.get_byte_array("data", &error, msg.data.cluster.addr,
/frameworks/base/core/java/android/os/
H A DBatteryStats.java540 * given CPU cluster.
541 * @param cluster the index of the CPU cluster.
547 public abstract long getTimeAtCpuSpeed(int cluster, int step, int which); argument

Completed in 3767 milliseconds