Lines Matching full:cfg_node
64 #define CFG_GROW_SIZE (10*sizeof(cfg_node))
65 #define GET_CHILD_MAX_COUNT(node) (short)((int)(node)->bytes / sizeof(cfg_node))
67 #define GET_NODE_COUNT(bytes) (bytes / sizeof(cfg_node))
88 } cfg_node;
92 static cfg_node root;
95 static inline short alloc_node(cfg_node* p, short grow);
96 static inline void free_node(cfg_node* p);
97 static inline void free_inode(cfg_node* p, int child);
98 static inline short find_inode(const cfg_node* p, const char* name);
99 static cfg_node* find_node(const char* section, const char* key, const char* name);
101 static inline cfg_node* find_free_node(cfg_node* p);
106 static short find_next_node(const cfg_node* p, short start, char* name, int* bytes);
113 static inline void dump_node(const char* title, const cfg_node* p)
192 const cfg_node* node = find_node(section, key, name);
263 const cfg_node* section_node = &root.child[si];
276 const cfg_node* section_node = &root.child[si];
280 const cfg_node* key_node = §ion_node->child[ki];
294 cfg_node *section_node, *key_node, *value_node;
340 static inline short alloc_node(cfg_node* p, short grow)
362 static inline void free_node(cfg_node* p)
379 static inline short find_inode(const cfg_node* p, const char* name)
400 static inline cfg_node* find_free_node(cfg_node* p)
415 static cfg_node* find_add_node(cfg_node* p, const char* name)
418 cfg_node* node = NULL;
442 cfg_node* section_node = NULL;
448 cfg_node* key_node;
452 cfg_node* value_node;
481 static cfg_node* find_node(const char* section, const char* key, const char* name)
486 cfg_node* section_node = &root.child[si];
492 cfg_node* key_node = §ion_node->child[ki];
514 static short find_next_node(const cfg_node* p, short start, char* name, int* bytes)
526 cfg_node* child = &p->child[i];
553 cfg_node* section_node = &root.child[si];
556 cfg_node* key_node = §ion_node->child[ki];
