Searched refs:trie (Results 1 - 2 of 2) sorted by relevance
/bionic/libc/system_properties/ |
H A D | prop_area.cpp | 275 const prop_info* prop_area::find_property(prop_bt* const trie, const char* name, uint32_t namelen, argument 278 if (!trie) return nullptr; 281 prop_bt* current = trie; 333 bool prop_area::foreach_property(prop_bt* const trie, argument 335 if (!trie) return false; 337 uint_least32_t left_offset = atomic_load_explicit(&trie->left, memory_order_relaxed); 339 const int err = foreach_property(to_prop_bt(&trie->left), propfn, cookie); 342 uint_least32_t prop_offset = atomic_load_explicit(&trie->prop, memory_order_relaxed); 344 prop_info* info = to_prop_info(&trie->prop); 348 uint_least32_t children_offset = atomic_load_explicit(&trie [all...] |
/bionic/libc/system_properties/include/system_properties/ |
H A D | prop_area.h | 40 // Properties are stored in a hybrid trie/binary tree structure. 42 // into a trie structure. Siblings at each level of the trie are stored in a 55 // Represents a node in the trie. 59 // The property trie is updated only by the init process (single threaded) which provides 61 // As the property trie is not protected by locks, we use atomic_uint_least32_t types for the 62 // left, right, children "pointers" in the trie node. To make sure readers who see the 66 // prop "points" to prop_info structure if there is a propery associated with the trie node. 141 const prop_info* find_property(prop_bt* const trie, const char* name, uint32_t namelen, 144 bool foreach_property(prop_bt* const trie, voi [all...] |
Completed in 84 milliseconds