Home | History | Annotate | Download | only in test

Lines Matching refs:state

6 void BM_empty(benchmark::State& state) {
7 while (state.KeepRunning()) {
8 benchmark::DoNotOptimize(state.iterations());
14 void BM_spin_empty(benchmark::State& state) {
15 while (state.KeepRunning()) {
16 for (int x = 0; x < state.range(0); ++x) {
24 void BM_spin_pause_before(benchmark::State& state) {
25 for (int i = 0; i < state.range(0); ++i) {
28 while (state.KeepRunning()) {
29 for (int i = 0; i < state.range(0); ++i) {
37 void BM_spin_pause_during(benchmark::State& state) {
38 while (state.KeepRunning()) {
39 state.PauseTiming();
40 for (int i = 0; i < state.range(0); ++i) {
43 state.ResumeTiming();
44 for (int i = 0; i < state.range(0); ++i) {
52 void BM_pause_during(benchmark::State& state) {
53 while (state.KeepRunning()) {
54 state.PauseTiming();
55 state.ResumeTiming();
63 void BM_spin_pause_after(benchmark::State& state) {
64 while (state.KeepRunning()) {
65 for (int i = 0; i < state.range(0); ++i) {
69 for (int i = 0; i < state.range(0); ++i) {
76 void BM_spin_pause_before_and_after(benchmark::State& state) {
77 for (int i = 0; i < state.range(0); ++i) {
80 while (state.KeepRunning()) {
81 for (int i = 0; i < state.range(0); ++i) {
85 for (int i = 0; i < state.range(0); ++i) {
92 void BM_empty_stop_start(benchmark::State& state) {
93 while (state.KeepRunning()) {