• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.10.1/MITKerberosShim-66/profile/

Lines Matching +defs:child +defs:name

12  * or more child nodes, pointed to by first_child.
32 char *name;
51 struct profile_node *child, *next;
56 if (node->name)
57 free(node->name);
61 for (child=node->first_child; child; child = next) {
62 next = child->next;
63 profile_free_node(child);
86 errcode_t profile_create_node(const char *name, const char *value,
97 new->name = strdup(name);
98 if (new->name == 0) {
149 errcode_t profile_add_node(struct profile_node *section, const char *name,
162 * place *after* the last match of the node name, since
167 cmp = strcmp(p->name, name);
171 retval = profile_create_node(name, value, &new);
210 * Return the name of a node. (Note: this is for internal functions
211 * only; if the name needs to be returned from an exported function,
216 return node->name;
221 * only; if the name needs to be returned from an exported function,
231 * the given name. If name is NULL, then interate through all 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,
257 if (name && (strcmp(p->name, name)))
285 if (name && (strcmp(p->name, name)))
306 * the given name. If name is NULL, then interate through all the
318 const char *name, void **state,
324 retval = profile_find_node(section, name, 0, 0, state, &p);
332 *ret_name = p->name;
339 * the given name. If name is NULL, then interate through all the
345 * This is (plus accessor functions for the name and value given a
350 const char *name, void **state,
357 retval = profile_find_node(section, name, 0, 1, state, &p);
365 *ret_name = p->name;
382 * match the specified name array.
389 const char *name;
533 if (!strcmp(p->name, *cpp) && !p->value)
557 iter->name = *cpp;
565 if (iter->name && strcmp(p->name, iter->name))
602 *ret_name = p->name;
662 if (strcmp(new_name, node->name) == 0)
663 return 0; /* It's the same name, return */
666 * Make sure we can allocate memory for the new name, first!
674 * for the place *after* the last match of the node name,
678 if (strcmp(p->name, new_name) > 0)
709 free(node->name);
710 node->name = new_string;