alpha_007的博客

singleton-TrashClean

alpha_007 — Sun, 02 Oct 2022 17:03:54 +0800

单例模式，c++11 call_once线程安全；静态变量析构释放单例。

Circular Buffer 2

alpha_007 — Sun, 02 Oct 2022 16:56:53 +0800

循环队列，队列满时覆盖旧数据，非线程安全，位操作代替取模

开发工具红黑榜

alpha_007 — Thu, 18 Aug 2022 11:48:26 +0800

开发工具

无锁循环队列--只适合一读一写两个线程

alpha_007 — Tue, 30 Nov 2021 14:20:29 +0800

template class TLocklessQueue { protected: T BufData[buflen]; int PutIdx; int GetIdx; public: int MaxSize() { return buflen; } int Len() {

星星之火可以燎原

alpha_007 — Sun, 08 Aug 2021 18:10:56 +0800

vi ingnore case search \c find * == find ./ -name ‘*’ ; find * | xargs grep “xxx” CXX_FLAGS=-DNDEBUG in makefile make assert invalid

linux command name

alpha_007 — Sun, 08 Aug 2021 08:47:34 +0800

linux command name vi ingnore case search \c dd – data description/disk dump-- convert data file bc – basic/better calculator nm – names nl – number of lines od – octal dump tr – translate udev – userspace dev ulimit – user’s limit umask – user’s mask xar

Go & Nginx & skynet 定时器

alpha_007 — Sun, 23 May 2021 14:30:33 +0800

Nginx定时器 skynet定时器

2.6内核kfifo

alpha_007 — Sat, 22 May 2021 20:51:46 +0800

2.6内核kfifo kfifo.h ```c #include #include #include #include struct __kfifo { unsigned int in; unsigned int out; unsigned int mask; unsigned int esize;

circular buffer

alpha_007 — Wed, 14 Apr 2021 22:14:55 +0800

#ifndef _CIRCULAR_BUFFER_H_2021_03_12 #define _CIRCULAR_BUFFER_H_2021_03_12 #include #include inline bool is_power_of_2(unsigned int v) { return v && (!(v & (v - 1))); } inline unsigned int roundup_pow_of_2(unsigned int v) { if (v == 0) retur

无锁文章搜集

alpha_007 — Tue, 23 Mar 2021 09:43:35 +0800

无锁同步-C++11之Atomic和CAS;如何理解C ++ 11中的std :: atomic :: compare_exchange_weak 无锁队列的实现

Scott Meyers：C++史上最重要的五本书籍和五篇技术文章

alpha_007 — Mon, 22 Mar 2021 10:31:28 +0800

Scott Meyers：C++史上最重要的五本书籍和五篇技术文章，csdn，lxwde 转载链接：https://blog.youkuaiyun.com/njnu_mjn/article/details/38175257

经典永流传2-Lock-Free Code: A False Sense of Security

alpha_007 — Mon, 22 Mar 2021 10:12:37 +0800

链接： Lock-Free Code: A False Sense of Security To avoid a race, a lock-free variable must have two key properties that we need to watch for and guarantee: atomicity and ordering compilers, processors, and caches love to optimize reads and writes, and wi

经典永流传-Exception Handling: A False Sense of Security

alpha_007 — Mon, 22 Mar 2021 09:57:47 +0800

Exception Handling: A False Sense of Security Argument expressions are fully evaluated before their function is called. v[top–]，top在调用拷贝构造返回语句之前已经递减。代码： template T Stack::pop() { if( top < 0 ) throw ""pop on empty stack""; return v[top--]; /

Performance example source code from Inside the c++ object model(2)

alpha_007 — Sat, 20 Mar 2021 13:11:15 +0800

编译环境：gcc version 7.5.0 (Ubuntu 7.5.0-3ubuntu1~18.04) 例子按4.4节所写："指向 Member Function之指针"的效率（Pointer-to-Member Efficiency），未包括多继承和虚拟继承 float g_cx = 0.f, g_cy = 0.f, g_cz = 0.f; class pt3d { public: float x; float y; float z; public: pt3d(float xx = 0.0,

Performance example source code from Inside the c++ object model

alpha_007 — Thu, 18 Mar 2021 16:25:42 +0800

编译环境：gcc version 7.5.0 (Ubuntu 7.5.0-3ubuntu1~18.04) 例子摘抄自3.5节：对象成员的效率（object member efficiency） constexpr int ITERATION_COUNT = 10000001; void test_plain_double() { START_TIMING(0); float pA_x = 1.725, pA_y = 0.875, pA_z = 0.478; float pB_x = 0.315, pB

A predicate for stl algorithm should always be stateless

alpha_007 — Sat, 06 Mar 2021 13:31:23 +0800

A predicate for stl algorithm should always be stateless void test_remove_if_bug() { list coll = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; PRINT_ELEMENTS(coll, "coll: "); // remove third element list::iterator pos; int n = 3; int

Dimensional Analysis in C++ by Template

alpha_007 — Thu, 04 Mar 2021 15:21:56 +0800

template // exponent for time class Units { public: explicit Units(double initVal = 0) : val(initVal) {} double value() const { return val; } double &value() { return

Instruction_level_parallelism

alpha_007 — Thu, 04 Mar 2021 14:18:56 +0800

Instruction_level_parallelism void Instruction_level_parallelism() { unsigned int steps = 1 * 1024 * 1024 * 1024u - 1; cout << steps << endl; int *a = new int[2]; time_t begin = time(nullptr); // Loop 1 for (unsigned int i = 0; i < ste