Lines Matching refs:d

125   for (int d = 0; d < MaxDimension; d++) {  in ~Timer()  local
126 delete[] buckets[d]; in ~Timer()
131 for (int d = 0; d < MaxDimension; d++) { in freeBuckets() local
132 delete[] buckets[d]; in freeBuckets()
133 buckets[d] = 0; in freeBuckets()
142 for (int d = 0; d < MaxDimension; d++) { in reset() local
143 if (buckets[d] != 0) memset(buckets[d], 0, sizeof(int) * MaxBuckets); in reset()
156 for (int d = 0; d < MaxDimension; d++) { in copy() local
157 if (src.buckets[d] != nullptr) { in copy()
158 dst.buckets[d] = new int[MaxBuckets]; in copy()
159 memcpy(dst.buckets[d], src.buckets[d], sizeof(int) * MaxBuckets); in copy()
175 for (int d = 0; d < MaxDimension; d++) { in record() local
176 if (ticks < range[d]) { in record()
177 if (buckets[d] == 0) { in record()
178 buckets[d] = new int[MaxBuckets]; in record()
179 memset(buckets[d], 0, sizeof(int) * MaxBuckets); in record()
181 if (ticks < width[d]) { in record()
185 buckets[d][1]++; in record()
187 buckets[d][ticks / width[d]]++; in record()
229 for (int d = 0; d < MaxDimension; d++) { in compute() local
230 if (buckets[d] == 0) continue; in compute()
233 if (buckets[d][j] == 0) continue; in compute()
234 sum += buckets[d][j]; in compute()
239 pvalues.p50.compute(sum, buckets[d][j], count, width[d], j * width[d]); in compute()
242 pvalues.p90.compute(sum, buckets[d][j], count, width[d], j * width[d]); in compute()
245 pvalues.p95.compute(sum, buckets[d][j], count, width[d], j * width[d]); in compute()
248 pvalues.p99.compute(sum, buckets[d][j], count, width[d], j * width[d]); in compute()