Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
S
spdlog
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
spdlog
Commits
38501649
Commit
38501649
authored
9 years ago
by
Ivan Shynkarenka
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add async queue size as a separate parameter from sample size
parent
31a011e6
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
2 deletions
+5
-2
bench.cpp
example/bench.cpp
+5
-2
No files found.
example/bench.cpp
View file @
38501649
...
...
@@ -50,7 +50,8 @@ void bench_mt(int howmany, std::shared_ptr<spdlog::logger> log, int thread_count
int
main
(
int
argc
,
char
*
argv
[])
{
int
howmany
=
1048576
;
int
queue_size
=
1048576
;
int
howmany
=
1000000
;
int
threads
=
10
;
bool
auto_flush
=
false
;
int
file_size
=
30
*
1024
*
1024
;
...
...
@@ -63,6 +64,8 @@ int main(int argc, char* argv[])
howmany
=
atoi
(
argv
[
1
]);
if
(
argc
>
2
)
threads
=
atoi
(
argv
[
2
]);
if
(
argc
>
3
)
queue_size
=
atoi
(
argv
[
3
]);
cout
<<
"*******************************************************************************
\n
"
;
...
...
@@ -92,7 +95,7 @@ int main(int argc, char* argv[])
cout
<<
"*******************************************************************************
\n
"
;
spdlog
::
set_async_mode
(
howmany
);
spdlog
::
set_async_mode
(
queue_size
);
for
(
int
i
=
0
;
i
<
3
;
++
i
)
{
...
...
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment