Lines Matching full:cfg_node
60 #define CFG_GROW_SIZE (10*sizeof(cfg_node))
61 #define GET_CHILD_MAX_COUNT(node) (short)((int)(node)->bytes / sizeof(cfg_node))
63 #define GET_NODE_COUNT(bytes) (bytes / sizeof(cfg_node))
84 } cfg_node;
88 static cfg_node root;
91 static inline short alloc_node(cfg_node* p, short grow);
92 static inline void free_node(cfg_node* p);
93 static inline void free_inode(cfg_node* p, int child);
94 static inline short find_inode(const cfg_node* p, const char* name);
95 static cfg_node* find_node(const char* section, const char* key, const char* name);
97 static inline cfg_node* find_free_node(cfg_node* p);
102 static short find_next_node(const cfg_node* p, short start, char* name, int* bytes);
109 static inline void dump_node(const char* title, const cfg_node* p)
188 const cfg_node* node = find_node(section, key, name);
261 const cfg_node* section_node = &root.child[si];
274 const cfg_node* section_node = &root.child[si];
278 const cfg_node* key_node = §ion_node->child[ki];
292 cfg_node *section_node, *key_node, *value_node;
338 static inline short alloc_node(cfg_node* p, short grow)
360 static inline void free_node(cfg_node* p)
377 static inline short find_inode(const cfg_node* p, const char* name)
398 static inline cfg_node* find_free_node(cfg_node* p)
413 static cfg_node* find_add_node(cfg_node* p, const char* name)
416 cfg_node* node = NULL;
440 cfg_node* section_node = NULL;
446 cfg_node* key_node;
450 cfg_node* value_node;
479 static cfg_node* find_node(const char* section, const char* key, const char* name)
484 cfg_node* section_node = &root.child[si];
490 cfg_node* key_node = §ion_node->child[ki];
512 static short find_next_node(const cfg_node* p, short start, char* name, int* bytes)
524 cfg_node* child = &p->child[i];
551 cfg_node* section_node = &root.child[si];
554 cfg_node* key_node = §ion_node->child[ki];
