Lines Matching defs:node
147 #define CHECK_MAGIC(node) \
148 if ((node)->magic != PROF_MAGIC_NODE) \
184 (struct profile_node *node);
196 struct profile_node **node);
690 struct profile_node *node;
833 profile_add_node(state->current_section, tag, value, &node);
835 node->final = 1;
1036 * Each node may represent either a relation or a section header.
1047 * Free a node, and any children
1049 void profile_free_node(struct profile_node *node)
1053 if (node->magic != PROF_MAGIC_NODE)
1056 free(node->name);
1057 free(node->value);
1059 for (child=node->first_child; child; child = next) {
1063 node->magic = 0;
1065 free(node);
1082 * Create a node
1117 errcode_t profile_verify_node(struct profile_node *node)
1122 CHECK_MAGIC(node);
1124 if (node->value && node->first_child)
1128 for (p = node->first_child; p; last = p, p = p->next) {
1133 if (node->group_level+1 != p->group_level)
1135 if (p->parent != node)
1146 * Add a node to a particular section
1160 * Find the place to insert the new node. We look for the
1161 * place *after* the last match of the node name, since
1205 struct profile_node **node)
1231 if (node)
1232 *node = p;
1276 struct profile_node *node;
1308 iter->node = 0;
1348 * If the file has changed, then the node pointer is invalid,
1351 if (iter->node && (iter->file &&
1355 iter->node = 0;
1357 if (iter->node && iter->node->magic != PROF_MAGIC_NODE) {
1361 if (iter->node == 0) {
1410 iter->node = section->first_child;
1413 * OK, now we know iter->node is set up correctly. Let's do
1416 for (p = iter->node; p; p = p->next) {
1436 iter->node = 0;
1440 if ((iter->node = p->next) == NULL)
