Lines Matching defs:section
9 * Each node may represent either a relation or a section header.
11 * A section header must have its value field set to 0, and may a one
147 * Add a node to a particular section
149 errcode_t profile_add_node(struct profile_node *section, const char *name,
155 CHECK_MAGIC(section);
157 if (section->value)
165 for (p=section->first_child, last = 0; p; last = p, p = p->next) {
174 new->group_level = section->group_level+1;
176 new->parent = section;
184 section->first_child = new;
230 * Iterate through the section, returning the nodes which match
232 * nodes in the section. If section_flag is non-zero, only return the
233 * section which matches the name; don't return relations. If value
243 errcode_t profile_find_node(struct profile_node *section, const char *name,
249 CHECK_MAGIC(section);
254 p = section->first_child;
305 * Iterate through the section, returning the relations which match
307 * relations in the section. The first time this routine is called,
317 errcode_t profile_find_node_relation(struct profile_node *section,
324 retval = profile_find_node(section, name, 0, 0, state, &p);
338 * Iterate through the section, returning the subsections which match
340 * subsections in the section. The first time this routine is called,
349 errcode_t profile_find_node_subsection(struct profile_node *section,
357 retval = profile_find_node(section, name, 0, 1, state, &p);
373 errcode_t profile_get_node_parent(struct profile_node *section,
376 *parent = section->parent;
455 struct profile_node *section, *p;
526 * Find the section to list if we are a LIST_SECTION,
527 * or find the containing section if not.
529 section = iter->file->data->root;
530 assert(section != NULL);
532 for (p=section->first_child; p; p = p->next) {
537 section = 0;
540 section = p;
544 if (!section) {
558 iter->node = section->first_child;