Searched defs:trie (Results 1 - 1 of 1) sorted by path

/bionic/libc/bionic/
H A Dsystem_properties.cpp65 * Properties are stored in a hybrid trie/binary tree structure.
67 * into a trie structure. Siblings at each level of the trie are stored in a
81 // Represents a node in the trie.
86 // The property trie is updated only by the init process (single threaded) which provides
88 // As the property trie is not protected by locks, we use atomic_uint_least32_t types for the
89 // left, right, children "pointers" in the trie node. To make sure readers who see the
93 // prop "points" to prop_info structure if there is a propery associated with the trie node.
155 const prop_info *find_property(prop_bt *const trie, const char *name,
159 bool foreach_property(prop_bt *const trie,
472 find_property(prop_bt *const trie, const char *name, uint8_t namelen, const char *value, uint8_t valuelen, bool alloc_if_needed) argument
598 foreach_property(prop_bt *const trie, void (*propfn)(const prop_info *pi, void *cookie), void *cookie) argument
[all...]

Completed in 55 milliseconds