Lines Matching +defs:new +defs:state
89 struct profile_node *new;
91 new = malloc(sizeof(struct profile_node));
92 if (!new)
94 memset(new, 0, sizeof(struct profile_node));
96 new->magic = PROF_MAGIC_NODE;
97 new->name = strdup(name);
98 if (new->name == 0) {
99 profile_free_node(new);
103 new->value = strdup(value);
104 if (new->value == 0) {
105 profile_free_node(new);
110 *ret_node = new;
153 struct profile_node *p, *last, *new;
161 * Find the place to insert the new node. We look for the
171 retval = profile_create_node(name, value, &new);
174 new->group_level = section->group_level+1;
175 new->deleted = 0;
176 new->parent = section;
177 new->prev = last;
178 new->next = p;
180 p->prev = new;
182 last->next = new;
184 section->first_child = new;
186 *ret_node = new;
237 * The first time this routine is called, the state pointer must be
238 * null. When this profile_find_node_relation() returns, if the state
244 const char *value, int section_flag, void **state,
250 p = *state;
276 *state = 0;
281 * one. This way, if we return a non-zero state pointer,
299 *state = p;
308 * the state pointer must be null. When this profile_find_node_relation()
309 * returns, if the state pointer is non-NULL, then this routine should
318 const char *name, void **state,
324 retval = profile_find_node(section, name, 0, 0, state, &p);
341 * the state pointer must be null. When this profile_find_node_subsection()
342 * returns, if the state pointer is non-NULL, then this routine should
350 const char *name, void **state,
357 retval = profile_find_node(section, name, 0, 1, state, &p);
666 * Make sure we can allocate memory for the new name, first!
673 * Find the place to where the new node should go. We look