| LOW | lightweightsemaphore.h | 1 | // Provides an efficient implementation of a semaphore (LightweightSemaphore). | COMMENT |
| LOW | lightweightsemaphore.h | 21 | // namespace with thousands of generic names or adding a .cpp for nothing. | COMMENT |
| LOW | lightweightsemaphore.h | 41 | #endif | COMMENT |
| LOW | lightweightsemaphore.h | 61 | // | COMMENT |
| LOW | blockingconcurrentqueue.h | 1 | // Provides an efficient blocking version of moodycamel::ConcurrentQueue. | COMMENT |
| LOW | concurrentqueue.h | 1 | // Provides a C++11 implementation of a multi-producer, multi-consumer lock-free queue. | COMMENT |
| LOW | concurrentqueue.h | 21 | // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | COMMENT |
| LOW | concurrentqueue.h | 41 | #ifdef MCDBGQ_USE_RELACY | COMMENT |
| LOW | concurrentqueue.h | 61 | // We'll override the default trait malloc ourselves without a macro. | COMMENT |
| LOW | concurrentqueue.h | 141 | } } | COMMENT |
| LOW | concurrentqueue.h | 161 | | COMMENT |
| LOW | concurrentqueue.h | 181 | #endif | COMMENT |
| LOW | concurrentqueue.h | 201 | #define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) true | COMMENT |
| LOW | concurrentqueue.h | 221 | #ifdef MCDBGQ_USE_RELACY | COMMENT |
| LOW | concurrentqueue.h | 261 | #else | COMMENT |
| LOW | concurrentqueue.h | 321 | | COMMENT |
| LOW | concurrentqueue.h | 341 | // whether the queue is lock-free with a 64-int type depends on the whether | COMMENT |
| LOW | concurrentqueue.h | 361 | static const size_t EXPLICIT_INITIAL_INDEX_SIZE = 32; | COMMENT |
| LOW | concurrentqueue.h | 381 | // internal queue. | COMMENT |
| LOW | concurrentqueue.h | 401 | static const bool RECYCLE_ALLOCATED_BLOCKS = false; | COMMENT |
| LOW | concurrentqueue.h | 1061 | } | COMMENT |
| LOW | concurrentqueue.h | 1121 | // Fails if not enough room to enqueue (or implicit production is | COMMENT |
| LOW | concurrentqueue.h | 1321 | | COMMENT |
| LOW | concurrentqueue.h | 2001 | // Note that I believe a compiler (signal) fence here would be sufficient due to the nature of fetch_add (all | COMMENT |
| LOW | concurrentqueue.h | 2021 | if ((details::likely)(details::circular_less_than<index_t>(myDequeueCount - overcommit, tail))) { | COMMENT |
| LOW | tests/corealgos.h | 1 | // ©2014 Cameron Desrochers | COMMENT |
| LOW | tests/corealgos.h | 101 | // Use a nice trick from this answer: http://stackoverflow.com/a/8438730/21475 | COMMENT |
| LOW | tests/relacy/relacy/test/foo.cpp | 1 | #include "stdafx.h" | COMMENT |
| LOW | tests/relacy/relacy/test/stdafx.h | 1 | #ifndef STDAFX_H | COMMENT |
| LOW | tests/relacy/relacy/test/main.cpp | 1 | #include "stdafx.h" | COMMENT |
| LOW | tests/relacy/relacy/test/main.cpp | 321 | //assert(VAR(data) != 2); | COMMENT |
| LOW | tests/relacy/relacy/test/main.cpp | 341 | //p.collect_history = true; | COMMENT |
| LOW | tests/relacy/relacy/test/main.cpp | 361 | | COMMENT |
| LOW | tests/relacy/relacy/test/ntest/stdafx.h | 1 | #ifndef STDAFX_H | COMMENT |
| LOW | tests/relacy/relacy/example/smr/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/ws_deque/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/mpmc/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/mpmc/mpmc.cpp | 1 | #include "stdafx.h" | COMMENT |
| LOW | tests/relacy/relacy/example/mpmc/stdafx.cpp | 1 | // stdafx.cpp : source file that includes just the standard includes | COMMENT |
| LOW | tests/relacy/relacy/example/peterson/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/ws_deque2/stdafx.cpp | 1 | // stdafx.cpp : source file that includes just the standard includes | COMMENT |
| LOW | tests/relacy/relacy/example/condvar/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/ref_counting/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/examples/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | …ts/relacy/relacy/example/mutex_business_logic/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/stack/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/eventcount/stdafx.h | 1 | #pragma once | COMMENT |
| LOW | tests/relacy/relacy/example/eventcount/eventcount.cpp | 1 | #include "stdafx.h" | COMMENT |
| LOW | tests/relacy/relacy/example/eventcount/stdafx.cpp | 1 | // stdafx.cpp : source file that includes just the standard includes | COMMENT |
| LOW | …ts/relacy/relacy/example/tbb_eventcount/eventcount.cpp | 1 | #include "stdafx.h" | COMMENT |
| LOW | tests/relacy/relacy/example/tbb_eventcount/stdafx.cpp | 1 | // stdafx.cpp : source file that includes just the standard includes | COMMENT |
| LOW | tests/relacy/relacy/relacy/relacy.hpp | 21 | #include "atomic_fence.hpp" | COMMENT |
| LOW | tests/relacy/relacy/relacy/relacy.hpp | 41 | #define memory_order_relaxed mo_relaxed, $ | COMMENT |
| LOW | tests/relacy/relacy/relacy/relacy.hpp | 61 | #define free(p) rl::rl_free((p), $) | COMMENT |
| LOW | tests/relacy/relacy/relacy/relacy_std.hpp | 21 | #define atomic std_atomic | COMMENT |
| LOW | tests/relacy/relacy/relacy/relacy_std.hpp | 61 | using rl::atomic_ushort; | COMMENT |
| LOW | tests/relacy/relacy/relacy/pch.hpp | 21 | # undef _FORTIFY_SOURCE | COMMENT |
| LOW | tests/relacy/relacy/relacy/pch.hpp | 41 | #include <iterator> | COMMENT |
| LOW | tests/relacy/relacy/relacy/pch.hpp | 61 | # include <process.h> | COMMENT |
| LOW | tests/relacy/relacy/relacy/context_base.hpp | 21 | #include "test_params.hpp" | COMMENT |
| 3247 more matches not shown… |
Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).