static prop_bt *find_prop_bt(prop_bt *const bt, const char *name, uint8_t namelen, bool alloc_if_needed) { prop_bt* current = bt; while (true) { if (!current) { return NULL; } const int ret = cmp_prop_name(name, namelen, current->name, current->namelen); if (ret == 0) { return current; } if (ret < 0) { if (current->left) { current = reinterpret_cast<prop_bt*>(to_prop_obj(current->left)); } else { if (!alloc_if_needed) { return NULL; } // Note that there isn't a race condition here. "clients" never // reach this code-path since It's only the (single threaded) server // that allocates new nodes. Though "bt->left" is volatile, it can't // have changed since the last value was last read. uint32_t new_offset = 0; prop_bt* new_bt = new_prop_bt(name, namelen, &new_offset); if (new_bt) { current->left = new_offset; } return new_bt; } } else { if (current->right) { current = reinterpret_cast<prop_bt*>(to_prop_obj(current->right)); } else { if (!alloc_if_needed) { return NULL; } uint32_t new_offset; prop_bt* new_bt = new_prop_bt(name, namelen, &new_offset); if (new_bt) { current->right = new_offset; } return new_bt; } } } }
prop_bt *prop_area::find_prop_bt(prop_bt *const bt, const char *name, uint8_t namelen, bool alloc_if_needed) { prop_bt* current = bt; while (true) { if (!current) { return NULL; } const int ret = cmp_prop_name(name, namelen, current->name, current->namelen); if (ret == 0) { return current; } if (ret < 0) { uint_least32_t left_offset = atomic_load_explicit(¤t->left, memory_order_relaxed); if (left_offset != 0) { current = to_prop_bt(¤t->left); } else { if (!alloc_if_needed) { return NULL; } uint_least32_t new_offset; prop_bt* new_bt = new_prop_bt(name, namelen, &new_offset); if (new_bt) { atomic_store_explicit(¤t->left, new_offset, memory_order_release); } return new_bt; } } else { uint_least32_t right_offset = atomic_load_explicit(¤t->right, memory_order_relaxed); if (right_offset != 0) { current = to_prop_bt(¤t->right); } else { if (!alloc_if_needed) { return NULL; } uint_least32_t new_offset; prop_bt* new_bt = new_prop_bt(name, namelen, &new_offset); if (new_bt) { atomic_store_explicit(¤t->right, new_offset, memory_order_release); } return new_bt; } } } }
const prop_info *prop_area::find_property(prop_bt *const trie, const char *name, uint8_t namelen, const char *value, uint8_t valuelen, bool alloc_if_needed) { if (!trie) return NULL; const char *remaining_name = name; prop_bt* current = trie; while (true) { const char *sep = strchr(remaining_name, '.'); const bool want_subtree = (sep != NULL); const uint8_t substr_size = (want_subtree) ? sep - remaining_name : strlen(remaining_name); if (!substr_size) { return NULL; } prop_bt* root = NULL; uint_least32_t children_offset = atomic_load_explicit(¤t->children, memory_order_relaxed); if (children_offset != 0) { root = to_prop_bt(¤t->children); } else if (alloc_if_needed) { uint_least32_t new_offset; root = new_prop_bt(remaining_name, substr_size, &new_offset); if (root) { atomic_store_explicit(¤t->children, new_offset, memory_order_release); } } if (!root) { return NULL; } current = find_prop_bt(root, remaining_name, substr_size, alloc_if_needed); if (!current) { return NULL; } if (!want_subtree) break; remaining_name = sep + 1; } uint_least32_t prop_offset = atomic_load_explicit(¤t->prop, memory_order_relaxed); if (prop_offset != 0) { return to_prop_info(¤t->prop); } else if (alloc_if_needed) { uint_least32_t new_offset; prop_info* new_info = new_prop_info(name, namelen, value, valuelen, &new_offset); if (new_info) { atomic_store_explicit(¤t->prop, new_offset, memory_order_release); } return new_info; } else { return NULL; } }
static const prop_info *find_property(prop_bt *const trie, const char *name, uint8_t namelen, const char *value, uint8_t valuelen, bool alloc_if_needed) { if (!trie) return NULL; const char *remaining_name = name; prop_bt* current = trie; while (true) { const char *sep = strchr(remaining_name, '.'); const bool want_subtree = (sep != NULL); const uint8_t substr_size = (want_subtree) ? sep - remaining_name : strlen(remaining_name); if (!substr_size) { return NULL; } prop_bt* root = NULL; if (current->children) { root = reinterpret_cast<prop_bt*>(to_prop_obj(current->children)); } else if (alloc_if_needed) { uint32_t new_bt_offset; root = new_prop_bt(remaining_name, substr_size, &new_bt_offset); if (root) { current->children = new_bt_offset; } } if (!root) { return NULL; } current = find_prop_bt(root, remaining_name, substr_size, alloc_if_needed); if (!current) { return NULL; } if (!want_subtree) break; remaining_name = sep + 1; } if (current->prop) { return reinterpret_cast<prop_info*>(to_prop_obj(current->prop)); } else if (alloc_if_needed) { uint32_t new_info_offset; prop_info* new_info = new_prop_info(name, namelen, value, valuelen, &new_info_offset); if (new_info) { current->prop = new_info_offset; } return new_info; } else { return NULL; } }