Harbor Deep Dive - Open source trusted cloud native registry
Based on content trust • Based on vulnerability • Based on RBAC Main Features ( Cont. ) 7 Vulnerability Scanning • Kinds of scanning policies • Elaborate scanning report Content Trust • Digital signature0 码力 | 15 页 | 8.40 MB | 1 年前3Lock-Free Atomic Shared Pointers Without a Split Reference Count? It Can Be Done!
a.store(make_shared( …)); ++ -- If this happens first…23 The fundamental problem: The race to zero Thread 1 load(): Thread 2 store(shared_ptr desired): auto cb = ctrl.load(); Need control_block pointer and increment the reference count at the same time, we would avoid the race to zero27 Daniel Anderson -- danielanderson.net Solution #2: The split reference count atomic Anderson -- danielanderson.net Solution #3 Recall the fundamental problem: load(): The race to zero store(shared_ptr desired): auto cb = ctrl.load(); We need to guarantee that cb is not 0 码力 | 45 页 | 5.12 MB | 5 月前3C++20: An (Almost) Complete Overview
Counting countl_zero(): number of consecutive 0 bits starting from most significant bit countl_one(): number of consecutive 1 bits starting from most significant bit countr_zero(): number of consecutive0 码力 | 85 页 | 512.18 KB | 5 月前3Working with Asynchrony Generically: A Tour of C++ Executors
= std::this_thread::sync_wait( std::move(work) ).value(); }9 EXAMPLE: LAUNCHING CONCURRENT WORK Zero allocations here namespace ex = std::execution; int compute_intensive(int); int main() { u0 码力 | 121 页 | 7.73 MB | 5 月前3
共 4 条
- 1