83 …_tree_node_t * _lv_tree_class_create_node(const lv_tree_class_t * class_p, lv_tree_node_t * parent)  in _lv_tree_class_create_node()  argument
90     node->parent = parent;  in _lv_tree_class_create_node()
93     if(parent != NULL) {  in _lv_tree_class_create_node()
94         parent->child_cnt++;  in _lv_tree_class_create_node()
95         if(parent->child_cnt == parent->child_cap) {  in _lv_tree_class_create_node()
96             parent->child_cap <<= 1;  in _lv_tree_class_create_node()
97 …     parent->children = lv_realloc(parent->children, sizeof(lv_tree_node_t *) * parent->child_cap);  in _lv_tree_class_create_node()
99         parent->children[parent->child_cnt - 1] = node;  in _lv_tree_class_create_node()
104 lv_tree_node_t * lv_tree_node_create(const lv_tree_class_t * class_p, lv_tree_node_t * parent)  in lv_tree_node_create()  argument
107     lv_tree_node_t * node = _lv_tree_class_create_node(class_p, parent);  in lv_tree_node_create()
128         if(node->parent) {  in lv_tree_node_delete()
130             lv_tree_node_t * parent = node->parent;  in lv_tree_node_delete()  local
131             for(uint32_t i = 0; i < parent->child_cnt; i++) {  in lv_tree_node_delete()
132                 if(parent->children[i] == node) {  in lv_tree_node_delete()
133                     parent->children[i] = NULL;  in lv_tree_node_delete()