Home
last modified time | relevance | path

Searched refs:pool_idx (Results 1 – 3 of 3) sorted by relevance

/external/perfetto/src/trace_processor/containers/
Dnullable_vector_benchmark.cc38 uint32_t pool_idx = 0; in BM_NullableVectorAppendNonNull() local
40 sv.Append(data_pool[pool_idx]); in BM_NullableVectorAppendNonNull()
41 pool_idx = (pool_idx + 1) % kPoolSize; in BM_NullableVectorAppendNonNull()
60 uint32_t pool_idx = 0; in BM_NullableVectorGetNonNull() local
62 benchmark::DoNotOptimize(sv.Get(idx_pool[pool_idx])); in BM_NullableVectorGetNonNull()
63 pool_idx = (pool_idx + 1) % kPoolSize; in BM_NullableVectorGetNonNull()
Dbit_vector_benchmark.cc102 uint32_t pool_idx = 0; in BM_BitVectorSet() local
104 bv.Set(row_pool[pool_idx]); in BM_BitVectorSet()
105 pool_idx = (pool_idx + 1) % kPoolSize; in BM_BitVectorSet()
126 uint32_t pool_idx = 0; in BM_BitVectorClear() local
128 bv.Clear(row_pool[pool_idx]); in BM_BitVectorClear()
129 pool_idx = (pool_idx + 1) % kPoolSize; in BM_BitVectorClear()
153 uint32_t pool_idx = 0; in BM_BitVectorIndexOfNthSet() local
155 benchmark::DoNotOptimize(bv.IndexOfNthSet(row_pool[pool_idx])); in BM_BitVectorIndexOfNthSet()
156 pool_idx = (pool_idx + 1) % kPoolSize; in BM_BitVectorIndexOfNthSet()
204 uint32_t pool_idx = 0; in BM_BitVectorResize() local
[all …]
Drow_map_benchmark.cc65 uint32_t pool_idx = 0; in BenchRowMapGet() local
67 benchmark::DoNotOptimize(rm.Get(pool_vec[pool_idx])); in BenchRowMapGet()
68 pool_idx = (pool_idx + 1) % kPoolSize; in BenchRowMapGet()
76 uint32_t pool_idx = 0; in BenchRowMapInsertIntoEmpty() local
80 rm.Insert(pool_vec[pool_idx]); in BenchRowMapInsertIntoEmpty()
81 pool_idx = (pool_idx + 1) % kPoolSize; in BenchRowMapInsertIntoEmpty()
101 uint32_t pool_idx = 0; in BenchRowMapFilterInto() local
107 auto fn = [&pool_vec, pool_idx](uint32_t row) { in BenchRowMapFilterInto()
108 return pool_vec[pool_idx] != 0 && (row % pool_vec[pool_idx]) != 0; in BenchRowMapFilterInto()
111 pool_idx = (pool_idx + 1) % kPoolSize; in BenchRowMapFilterInto()