X-Git-Url: http://plrg.eecs.uci.edu/git/?p=folly.git;a=blobdiff_plain;f=folly%2Ftest%2FLifoSemTests.cpp;h=c16fe4a0feb28c5cb804a7546aeb45e961885906;hp=e49a1df8f508069358956bc2565d96c7bfd579a1;hb=43d3a315bbd54cb187021897b566ffb53290a44b;hpb=89e6ee60da8c157f32fcc6b8ce727c292de77e15 diff --git a/folly/test/LifoSemTests.cpp b/folly/test/LifoSemTests.cpp index e49a1df8..c16fe4a0 100644 --- a/folly/test/LifoSemTests.cpp +++ b/folly/test/LifoSemTests.cpp @@ -1,5 +1,5 @@ /* - * Copyright 2015 Facebook, Inc. + * Copyright 2016 Facebook, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. @@ -15,15 +15,16 @@ */ #include -#include -#include #include -#include -#include +#include #include #include +#include +#include +#include +#include using namespace folly; using namespace folly::test; @@ -318,7 +319,7 @@ BENCHMARK(single_thread_lifo_post, iters) { LifoSem sem; for (size_t n = 0; n < iters; ++n) { sem.post(); - asm volatile ("":::"memory"); + asm_volatile_memory(); } } @@ -326,7 +327,7 @@ BENCHMARK(single_thread_lifo_wait, iters) { LifoSem sem(iters); for (size_t n = 0; n < iters; ++n) { sem.wait(); - asm volatile ("":::"memory"); + asm_volatile_memory(); } } @@ -334,9 +335,9 @@ BENCHMARK(single_thread_lifo_postwait, iters) { LifoSem sem; for (size_t n = 0; n < iters; ++n) { sem.post(); - asm volatile ("":::"memory"); + asm_volatile_memory(); sem.wait(); - asm volatile ("":::"memory"); + asm_volatile_memory(); } } @@ -344,7 +345,7 @@ BENCHMARK(single_thread_lifo_trywait, iters) { LifoSem sem; for (size_t n = 0; n < iters; ++n) { EXPECT_FALSE(sem.tryWait()); - asm volatile ("":::"memory"); + asm_volatile_memory(); } } @@ -367,7 +368,7 @@ BENCHMARK(single_thread_posix_trywait, iters) { EXPECT_EQ(sem_destroy(&sem), 0); } -static void contendedUse(uint n, int posters, int waiters) { +static void contendedUse(uint32_t n, int posters, int waiters) { LifoSemImpl sem; std::vector threads; @@ -376,7 +377,7 @@ static void contendedUse(uint n, int posters, int waiters) { BENCHMARK_SUSPEND { for (int t = 0; t < waiters; ++t) { threads.emplace_back([=,&sem] { - for (uint i = t; i < n; i += waiters) { + for (uint32_t i = t; i < n; i += waiters) { sem.wait(); } }); @@ -386,7 +387,7 @@ static void contendedUse(uint n, int posters, int waiters) { while (!go.load()) { std::this_thread::yield(); } - for (uint i = t; i < n; i += posters) { + for (uint32_t i = t; i < n; i += posters) { sem.post(); } });