HomeSort by: relevance | last modified time | path
    Searched refs:n_children (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/sys/
rpst.h 45 struct rpst_node *n_children[2]; member in struct:rpst_node
  /src/common/lib/libc/gen/
rpst.c 146 if (n->n_children[i] != NULL) {
147 n->n_children[i]->n_parent = n;
165 memset(&n->n_children, 0, sizeof(n->n_children));
166 n->n_children[0] = t->t_root;
192 memset(&n->n_children, 0, sizeof(n->n_children));
205 memcpy(n->n_children, cur->n_children, sizeof(n->n_children));
    [all...]
  /src/usr.sbin/autofs/
common.c 166 TAILQ_INIT(&n->n_children);
181 TAILQ_INIT(&n->n_children);
197 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
212 TAILQ_INIT(&n->n_children);
228 TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
245 TAILQ_FOREACH(child, &o->n_children, n_next)
258 TAILQ_FOREACH_SAFE(child, &n->n_children, n_next, tmp)
262 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
275 TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
277 TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next)
    [all...]
common.h 54 TAILQ_HEAD(nodehead, node) n_children;
automount.c 177 TAILQ_FOREACH(n, &root->n_children, n_next) {
184 TAILQ_FOREACH(n2, &n->n_children, n_next) {
automountd.c 137 TAILQ_FOREACH(child, &node->n_children, n_next) {
155 TAILQ_FOREACH(child, &node->n_children, n_next)

Completed in 47 milliseconds