Searched refs:recurse (Results 1 - 11 of 11) sorted by relevance
/illumos-gate/usr/src/cmd/mdb/common/kmdb/ |
H A D | kmdb_stubs.c | 163 static int recurse = 0; 165 if (!recurse) { 167 recurse = 1;
|
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
H A D | nvpair.c | 224 int recurse = FALSE; local 230 'r', MDB_OPT_SETBITS, TRUE, &recurse, 305 if (recurse) { 325 if (recurse) {
|
/illumos-gate/usr/src/cmd/sendmail/src/ |
H A D | macro.c | 196 bool recurse; /* set if recursion required */ local 210 recurse = false; 306 recurse = true; 323 /* recurse as appropriate */ 324 if (recurse)
|
H A D | map.c | 4516 bool recurse = false; local 4611 recurse = true; 4616 recurse = true; 4621 recurse = true; 4649 if (recurse && !normalseen) 4655 if (recurse && lmap->ldap_attrsonly == LDAPMAP_TRUE)
|
/illumos-gate/usr/src/lib/libc/port/locale/ |
H A D | strptime.c | 60 int i, len, recurse = 0; local 65 recurse = 1; 511 if (!recurse) {
|
/illumos-gate/usr/src/cmd/sendmail/libsm/ |
H A D | ldap.c | 505 ** recurse -- recursion list 636 resultln, resultsz, recurse) 645 SM_LDAP_RECURSE_LIST *recurse; 657 toplevel = (recurse == NULL); 716 rl = sm_ldap_add_recurse(&recurse, dn, 963 if (sm_ldap_add_recurse(&recurse, 1155 ** Spin through the built-up recurse list at the top 1163 for (rlidx = 0; recurse != NULL && rlidx < recurse->lrl_cnt; 1170 rl = recurse [all...] |
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/ |
H A D | if.c | 878 if_sick(struct interface *ifp, boolean_t recurse) argument 888 if (recurse && ifp->int_phys != NULL) { 902 if_bad(struct interface *ifp, boolean_t recurse) argument 919 if (recurse && ifp->int_phys != NULL) { 962 if_ok(struct interface *ifp, const char *type, boolean_t recurse) argument 978 if (recurse && ifp->int_phys != NULL && IS_IFF_UP(ifp->int_if_flags)) {
|
/illumos-gate/usr/src/lib/libdevinfo/ |
H A D | devinfo_devlink.h | 174 typedef struct recurse { struct
|
/illumos-gate/usr/src/cmd/svc/startd/ |
H A D | graph.c | 1224 * functions may recurse in order to determine satisfiability. 4560 /* If v isn't an instance, recurse on its dependencies. */ 4573 /* If v isn't a leaf because it's already down, recurse. */ 4616 /* If v isn't an instance, recurse on its dependencies. */ 4618 goto recurse; 4625 goto recurse; 4634 /* If v isn't a leaf because it's already down, recurse. */ 4636 goto recurse; 4648 recurse:
|
/illumos-gate/usr/src/cmd/zfs/ |
H A D | zfs_main.c | 1462 * -r recurse over any child datasets 1831 * use the default value. The '-r' flag will recurse over all children, and is 3202 boolean_t recurse = B_FALSE; local 3213 recurse = B_TRUE; 3245 if (recurse && parents) { 3251 if (recurse && strchr(argv[0], '@') == 0) { 3268 ret = (zfs_rename(zhp, argv[1], recurse, force_unmount) != 0);
|
/illumos-gate/usr/src/cmd/devfsadm/ |
H A D | devfsadm.c | 3110 * link, we recurse and try to remove the minor node (or link if path is 3114 devfsadm_rm_work(char *file, int recurse, int file_type) argument 3142 if ((recurse == TRUE) && 3147 * recurse if link points to another link 3450 * another link, so recurse and read its link contents. 4354 * component of path_re, recurse. If there are no more *dir* path 4597 * link, and if so recurse and read its link contents. 5228 * entry, we recurse down dname/fname until we find the first symbolic 5251 * If it is a dir, recurse down until we find a link and 5503 * components of path_left, then recurse, otherwis [all...] |
Completed in 130 milliseconds