Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:kThreadCount
(Results
1 - 6
of
6
) sorted by relevance
/third_party/googletest/googletest/test/
H
A
D
gtest_stress_test.cc
52
const int
kThreadCount
= 50;
member
83
for (int i = 0; i <
kThreadCount
; i++) {
in ManyAsserts()
99
// This assertion should fail
kThreadCount
times per thread. It
in ManyAsserts()
118
std::unique_ptr<ThreadWithParam<int> > threads[
kThreadCount
];
in TEST()
120
for (int i = 0; i !=
kThreadCount
; i++)
in TEST()
127
for (int i = 0; i !=
kThreadCount
; i++) threads[i]->Join();
in TEST()
130
// Ensures that
kThreadCount
*
kThreadCount
failures have been reported.
in TEST()
140
EXPECT_EQ(
kThreadCount
* 2 + 1, result->test_property_count())
in TEST()
143
for (int i = 0; i <
kThreadCount
;
in TEST()
[all...]
H
A
D
googletest-port-test.cc
1099
const int
kThreadCount
= 7;
in TEST()
local
1100
std::unique_ptr<ThreadType> counting_threads[
kThreadCount
];
in TEST()
1102
// Creates and runs
kThreadCount
threads that increment locked_counter
in TEST()
1104
for (int i = 0; i <
kThreadCount
; ++i) {
in TEST()
1110
for (int i = 0; i <
kThreadCount
; ++i) counting_threads[i]->Join();
in TEST()
1116
EXPECT_EQ(kCycleCount *
kThreadCount
, locked_counter.value());
in TEST()
/third_party/skia/tests/
H
A
D
SkScalerCacheTest.cpp
33
static constexpr int
kThreadCount
= 4;
in DEF_TEST()
local
35
Barrier barrier{
kThreadCount
};
in DEF_TEST()
57
auto executor = SkExecutor::MakeFIFOThreadPool(
kThreadCount
);
in DEF_TEST()
64
auto local = data.subspan(threadIndex * 2, data.size() -
kThreadCount
* 2);
in DEF_TEST()
80
SkTaskGroup(*executor).batch(
kThreadCount
, perThread);
in DEF_TEST()
/third_party/skia/third_party/externals/angle2/src/tests/egl_tests/
H
A
D
EGLMultiContextTest.cpp
143
constexpr size_t
kThreadCount
= 2;
in TEST_P()
local
144
EGLSurface surface[
kThreadCount
] = {EGL_NO_SURFACE, EGL_NO_SURFACE};
in TEST_P()
145
EGLContext ctx[
kThreadCount
] = {EGL_NO_CONTEXT, EGL_NO_CONTEXT};
in TEST_P()
149
for (size_t t = 0; t <
kThreadCount
; ++t)
in TEST_P()
285
for (size_t t = 0; t <
kThreadCount
; ++t)
in TEST_P()
H
A
D
EGLContextSharingTest.cpp
476
constexpr size_t
kThreadCount
= 2;
in TEST_P()
local
477
EGLSurface surface[
kThreadCount
] = {EGL_NO_SURFACE, EGL_NO_SURFACE};
in TEST_P()
478
EGLContext ctx[
kThreadCount
] = {EGL_NO_CONTEXT, EGL_NO_CONTEXT};
in TEST_P()
482
for (size_t t = 0; t <
kThreadCount
; ++t)
in TEST_P()
507
GLRenderbuffer renderbuffer[
kThreadCount
];
in TEST_P()
508
GLFramebuffer fbo[
kThreadCount
];
in TEST_P()
509
GLProgram program[
kThreadCount
];
in TEST_P()
511
for (size_t t = 0; t <
kThreadCount
; ++t)
in TEST_P()
639
for (size_t t = 0; t <
kThreadCount
; ++t)
in TEST_P()
/third_party/skia/third_party/externals/angle2/src/tests/gl_tests/
H
A
D
MultithreadingTest.cpp
181
constexpr size_t
kThreadCount
= 16;
in TEST_P()
local
182
std::array<std::thread,
kThreadCount
> threads;
in TEST_P()
478
constexpr size_t
kThreadCount
= 16;
in TEST_P()
local
480
std::vector<std::thread> threads(
kThreadCount
);
in TEST_P()
481
std::vector<EGLContext> contexts(
kThreadCount
);
in TEST_P()
482
for (size_t threadIdx = 0; threadIdx <
kThreadCount
; threadIdx++)
in TEST_P()
493
while (barrier <
kThreadCount
)
in TEST_P()
Completed in 7 milliseconds