tag_bloom_hi and tag_bloom_lo form a 64-bit Bloom filter of the entries in the TAG= key (which are normally separated by : characters). If no keys are present, the value is 0. A Bloom filter is a special data structure based on hashes which can either return "this element is certainly not in the set" or "this element might be in the set, but this could also just be a false positive". In this case, it allows BPF to preemptively filter out events that definitely do not contain the proper TAGs.
Губин назвал причину отказа от возвращения на сцену14:49
，这一点在爱思助手中也有详细论述
* @param n 数组长度
Product designer