Home
last modified time | relevance | path

Searched refs:kNumLockLoops (Results 1 – 6 of 6) sorted by relevance

/external/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc105 static const int kNumLockLoops = 5; in TEST() local
112 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()
/external/webrtc/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc105 static const int kNumLockLoops = 5; in TEST() local
112 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc106 static const int kNumLockLoops = 5; in TEST() local
113 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()
/external/openscreen/third_party/abseil/src/absl/base/internal/
Dthread_identity_test.cc106 static const int kNumLockLoops = 5; in TEST() local
113 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()
/external/angle/third_party/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc106 static const int kNumLockLoops = 5; in TEST() local
113 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()
/external/libtextclassifier/abseil-cpp/absl/base/internal/
Dthread_identity_test.cc106 static const int kNumLockLoops = 5; in TEST() local
113 for (int l = 0; l < kNumLockLoops; ++l) { in TEST()