Home
last modified time | relevance | path

Searched refs:np (Results 1 – 25 of 410) sorted by relevance

12345678910>>...17

/illumos-gate/usr/src/cmd/ipf/lib/
H A Dprintnat.c103 if (np->in_pmax != np->in_pmin)
126 printproto(pr, np->in_p, np);
168 np->in_dport = htons(np->in_dport);
189 } else if (np->in_pmin || np->in_pmax) {
195 printproto(pr, np->in_p, np);
202 np->in_ippip, np->in_ppip);
209 printproto(pr, np->in_p, np);
236 np->in_space, np->in_use, np->in_hits,
237 np->in_flags, np->in_p, np->in_hv);
239 np->in_ifps[0], np->in_ifps[1], np->in_apr);
[all …]
/illumos-gate/usr/src/uts/common/os/
H A Dddi_nodeid.c101 np->prev->next = np->next; in np_unlink()
106 np->next->prev = np->prev; in np_unlink()
138 for (np = nhead; np->next != NULL; np = np->next) in np_add()
159 if ((np->nodeid + np->count) == xp->nodeid) { in np_coalesce()
240 for (np = nhead; np != NULL; np = np->next) { in impl_ddi_free_nodeid()
255 if (nodeid == (np->nodeid + np->count)) { in impl_ddi_free_nodeid()
272 if (nodeid < (np->nodeid + np->count)) in impl_ddi_free_nodeid()
323 for (np = nhead; np != NULL; np = np->next) { in impl_ddi_take_nodeid()
354 if (nodeid == (np->nodeid + np->count - 1)) { in impl_ddi_take_nodeid()
368 if (nodeid < (np->nodeid + np->count - 1)) { in impl_ddi_take_nodeid()
[all …]
H A Dinstance.c807 ASSERT(np); in e_ddi_free_instance()
942 for (np = ap->in_child; np; np = np->in_sibling) { in in_removenode()
978 *ap = np; in in_devwalk()
979 np = np->in_child; in in_devwalk()
989 np = np->in_sibling; in in_devwalk()
1085 rp = np; in in_make_path()
1094 np = np->in_child; in in_make_path()
1096 np = np->in_sibling; in in_make_path()
1256 ASSERT(np->in_node_name && np->in_unit_addr); in in_dealloc_node()
1548 np = np->in_sibling; in in_walk_instances()
[all …]
/illumos-gate/usr/src/cmd/awk_xpg4/
H A Dawk3.c453 np = np->n_next; in vlookup()
582 np = np->n_left; in execute()
627 for (np = &nodes[0]; np < fnodep; np++) { in freetemps()
635 for (np = freelist; np != NNULL; np = nnp) { in freetemps()
720 np = np->n_next; in action()
816 np = np->n_next; in exprint()
847 np = np->n_next; in exprreal()
876 np = np->n_next; in exprstring()
1040 np = np->n_right; in exprreduce()
1959 np = np->n_next; in s_forin()
[all …]
H A Dawk4.c54 f_exp(NODE *np) in f_exp() argument
69 f_int(NODE *np) in f_int() argument
84 f_log(NODE *np) in f_log() argument
99 f_sqrt(NODE *np) in f_sqrt() argument
113 f_sin(NODE *np) in f_sin() argument
125 f_cos(NODE *np) in f_cos() argument
176 f_rand(NODE *np) in f_rand() argument
195 f_sub(NODE *np) in f_sub() argument
509 return (np); in f_substr()
662 while (np!=NNULL && np->n_type==COMMA) { in nargs()
[all …]
/illumos-gate/usr/src/uts/common/fs/smbclnt/smbfs/
H A Dsmbfs_subr2.c425 bzero(np, sizeof (*np)); in make_smbnode()
511 ASSERT(np->r_freef == NULL && np->r_freeb == NULL); in smbfs_addfree()
610 np->r_freef = np; in smbfs_addfree()
611 np->r_freeb = np; in smbfs_addfree()
645 np->r_freeb->r_freef = np->r_freef; in sn_rmfree()
646 np->r_freef->r_freeb = np->r_freeb; in sn_rmfree()
648 np->r_freef = np->r_freeb = NULL; in sn_rmfree()
838 np = avl_walk(&mi->smi_hash_avl, np, AVL_AFTER); in smbfs_attrcache_prune()
896 (void *)np, np->n_rpath); in smbfs_check_table()
904 (void *)np, np->n_rpath); in smbfs_check_table()
[all …]
H A Dsmbfs_vnops.c616 np->r_mapcnt == 0 && np->r_inmap == 0 && in smbfs_read()
809 np->r_mapcnt == 0 && np->r_inmap == 0 && in smbfs_write()
904 if (!cv_wait_sig(&np->r_cv, &np->r_statelock)) { in smbfs_write()
914 cv_wait(&np->r_cv, &np->r_statelock); in smbfs_write()
2093 cv_wait(&np->r_cv, &np->r_statelock); in smbfs_inactive()
2100 if ((np->r_flags & RDIRTY) && !np->r_error) { in smbfs_inactive()
2138 np->n_dirrefs, np->n_rpath); in smbfs_inactive()
2148 np->n_fidrefs, np->n_rpath); in smbfs_inactive()
2867 ((np->r_flags & RDIRTY) || np->r_count > 0)) { in smbfsremove()
3781 cv_wait(&np->r_cv, &np->r_statelock); in smbfs_getpage()
[all …]
/illumos-gate/usr/src/cmd/fm/eversholt/common/
H A Dcheck.c154 outfl(O_DIE, np->file, np->line, in check_path_iterators()
177 outfl(O_ERR, np->file, np->line, in check_arrow()
249 outfl(O_ERR, np->file, np->line, in check_num()
261 outfl(O_ERR, np->file, np->line, in check_quote()
273 outfl(O_ERR, np->file, np->line, in check_action()
360 if (np->t != T_NAME || np->u.name.next || np->u.name.child) in check_id()
371 if (np->t != T_NAME || np->u.name.next || np->u.name.child || in check_serd_method()
403 np->file, np->line, in check_stmt_required_properties()
815 for (np = Props; np; np = np->u.stmt.next) in check_cycle()
947 np = np->u.event.epname; in check_type_iterator()
[all …]
H A Dptree.c350 if (np->u.expr.left && np->u.expr.right && in ptree()
362 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
375 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
394 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
406 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
418 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
430 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
437 out(flags, "# %d \"%s\"", np->line, np->file); in ptree()
610 np = np->u.name.next; in name_pattern_match()
719 for (np = Props; np; np = np->u.stmt.next) in ptree_type_pattern()
[all …]
/illumos-gate/usr/src/cmd/svc/configd/
H A Drc_node.c825 for (np = bp->cb_head; np != NULL; np = np->rn_hash_next) { in cache_lookup_unlocked()
1706 rc_node_t *np = uu_zalloc(sizeof (*np)); in rc_node_alloc() local
1912 rc_node_setup_parent_ref(np, np); in rc_node_relink_child()
1967 np->rn_cchain[0] = np; in rc_node_setup()
2407 np->rn_hash = rc_node_hash(&np->rn_id); in rc_node_init()
2977 np = np->rn_cchain[0]; in rc_node_name()
3072 np = np->rn_cchain[0]; in rc_node_parent()
3273 np = np->rn_cchain[0]; in rc_node_update()
3930 np = np->rn_cchain[0]; in rc_node_create_child()
4739 np = np->rn_cchain[0]; in rc_node_delete()
[all …]
/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/sh/
H A Dname.c547 …else if(((np->nvalue.cp && np->nvalue.cp!=Empty)||nv_isvtree(np)|| nv_arrayptr(np)) && !nv_type(np… in nv_setlist()
584 nr.np = np; in nv_setlist()
679 if(nr.np == np) in nv_setlist()
1274 if(xp->np==np) in nv_delete()
1437 np = xp->np; in nv_open()
1475 xp->np = np; in nv_open()
2352 for(np=(Namval_t*)dtfirst(root);np; np=(Namval_t*)dtnext(root,np)) in nv_scan()
2448 for(np=(Namval_t*)dtfirst(root);np;np=npnext) in table_unset()
2536 if(rq->np != np) in _nv_unset()
2650 for(np=(Namval_t*)dtfirst(root);np;np=(Namval_t*)dtnext(root,np)) in tableval()
[all …]
H A Dnvdisc.c207 pp->np = np; in block_info()
522 if(nv_isarray(np) && !nv_arrayptr(np)) in nv_setdisc()
835 np->nvname = (char*)np+sizeof(Namval_t); in newnode()
1000 return(np->nvalue.np?nv_getval(np->nvalue.np):0); in clone_getv()
1005 return(np->nvalue.np?nv_getnum(np->nvalue.np):0); in clone_getn()
1011 Namval_t *mp = np->nvalue.np; in clone_putv()
1036 np->nvalue.np = mp; in nv_mkclone()
1214 else for(np=(Namval_t*)dtfirst(sh.bltin_tree);np;np=(Namval_t*)dtnext(sh.bltin_tree,np)) in sh_addbuiltin()
1302 for(np=(Namval_t*)dtfirst(oroot);np;np=(Namval_t*)dtnext(oroot,np)) in clone_table()
1370 for(np=(Namval_t*)dtfirst(root);np;np=(Namval_t*)dtnext(root,np)) in get_table()
[all …]
H A Darray.c251 return((np = nv_opensub(np)) && !nv_isnull(np)); in nv_arrayisset()
393 char *xp = nv_setdisc(np,"get",np,(Namfun_t*)np); in array_find()
395 return(xp && xp!=(char*)np?np:0); in array_find()
505 (*ap->fun)(np,(char*)np,0); in array_clone()
582 np->nvalue.s = *np->nvalue.sp; in array_getval()
848 if((nv_isnull(np)||np->nvalue.cp==Empty) && nv_isattr(np,NV_NOFREE)) in array_grow()
855 if(nv_hasdisc(np,&array_disc) || (nv_type(np) && nv_isvtree(np))) in array_grow()
1205 np = sh_assignok(np,1); in nv_putsub()
1255 np = sh_assignok(np,1); in nv_putsub()
1347 (*ap->header.fun)(np,(char*)np,0); in nv_putsub()
[all …]
H A Dnvtree.c78 if(np=(*fp->disc->createf)(np,name,flag,fp)) in create_tree()
174 if(!np || !nv_istable(np)) in nv_diropen()
213 if(!np) in nv_diropen()
232 if(np && ((nfp=nextdisc(np)) || nv_istable(np))) in nv_diropen()
291 if(nv_isnull(np) && !nv_isarray(np) && !nv_isattr(np,NV_INTEGER)) in nv_dirnext()
438 …else if((!np->nvalue.cp||np->nvalue.cp==Empty) && nv_isattr(np,~NV_NOFREE)==NV_MINIMAL && strcmp(n… in nv_attribute()
744 if(nv_isnull(np) && !nv_isarray(np) && !nv_isattr(np,NV_INTEGER)) in outval()
788 …if((np->nvalue.cp && np->nvalue.cp!=Empty) || nv_isattr(np,~(NV_MINIMAL|NV_NOFREE)) || nv_isvtree(… in outval()
857 if(!np || (nv_isarray(np) && (!(tp=nv_opensub(np)) || !nv_isvtree(tp)))) in genvalue()
1085 if(np) in nv_isvtree()
[all …]
H A Darith.c93 if(!np) in scope()
100 cp = (char*)np; in scope()
105 np = mp; in scope()
114 np = nv_refnode(np); in scope()
166 return(np); in scope()
178 np = nq; in scope()
187 np = nv_arraychild(np,nq,0); in scope()
194 return(np); in scope()
231 np = scope(np,lvalue,1); in arith()
444 np = scope(np,lvalue,0); in arith()
[all …]
/illumos-gate/usr/src/cmd/mailx/
H A Dnames.c94 np = np->n_flink; in tailof()
186 for (np = to; np; np = np->n_flink) in outpre()
219 for (np = names; np != NIL; np = np->n_flink) { in outof()
564 for (c = 0, np = name; np != NIL; c++, np = np->n_flink) in lengthof()
668 for (np = names; np != NIL; np = np->n_flink) in mechk()
692 np = np->n_flink; in elide()
713 np = np->n_flink; in elide()
726 np = np->n_flink; in elide()
740 np = np->n_flink; in elide()
768 np = np->n_flink; in elide()
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libcmd/
H A Dexpr.c141 #define numeric(np) ((np)->type&T_NUM) argument
278 np->num = strtol(np->str,&ep,10); in getnode()
323 np->num = strtol(np->str,&cp,10); in expr_cond()
439 np->num = (np->num==rp.num); in expr_cmp()
442 np->num = (np->num>rp.num); in expr_cmp()
445 np->num = (np->num<rp.num); in expr_cmp()
448 np->num = (np->num>=rp.num); in expr_cmp()
451 np->num = (np->num<=rp.num); in expr_cmp()
454 np->num = (np->num!=rp.num); in expr_cmp()
485 if ((numeric(np) && np->num==0) || *np->str==0) in expr_or()
[all …]
/illumos-gate/usr/src/tools/ndrgen/
H A Dndr_print.c51 if (!np) { in print_node()
56 switch (np->label) { in print_node()
120 if ((np->n_a_arg == NULL) || (np->n_a_arg->n_int == 0)) in print_node()
167 if (np->n_d_dim) in print_node()
213 arg = np->n_a_arg; in print_field_attr()
285 if (!np) in print_advice_list()
289 for (; np; np = np->n_next) { in print_advice_list()
290 print_node(np); in print_advice_list()
291 if (np->n_next) in print_advice_list()
300 for (; np; np = np->n_next) { in print_node_list()
[all …]
/illumos-gate/usr/src/lib/scsi/libses/common/
H A Dses_node.c36 ses_node_t *np; in ses_find_enclosure() local
38 for (np = sp->ss_root->sn_first_child; np != NULL; in ses_find_enclosure()
39 np = np->sn_next_sibling) { in ses_find_enclosure()
63 if (np == NULL) in ses_node_teardown()
66 for (; np != NULL; np = rp) { in ses_node_teardown()
70 ses_free(np); in ses_node_teardown()
77 ses_node_t *np; in ses_node_alloc() local
80 if (np == NULL) in ses_node_alloc()
103 return (np); in ses_node_alloc()
106 ses_free(np); in ses_node_alloc()
[all …]
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_index_entry.cc130 for (np = this; np != NULL; np = next_np) { in relocate()
134 *hp = np; in relocate()
145 for (np = this; np != NULL; np = np->next) { in getnext()
168 for (np = this; np != NULL; np = np->next) { in lookup()
174 if (np) np->next_result = NULL; /* should only be 1 */ in lookup()
175 return (np); in lookup()
236 for (dp = np = this; np != NULL; np = np->next) { in remove()
241 dp = np; in remove()
252 delete np; in remove()
334 for (np = this; np != NULL; np = np->next) { in print_all()
[all …]
/illumos-gate/usr/src/cmd/fm/modules/common/eversholt/
H A Deval.c574 outfl(O_DIE, np->file, np->line, in eval_func()
933 outfl(O_DIE, np->file, np->line, in eval_func()
959 return (tree_globid(np->u.globid.s, np->file, np->line)); in eval_dup()
1185 np->file, np->line)); in eval_dup()
1203 outfl(O_DIE, np->file, np->line, in eval_dup()
1352 outfl(O_DIE, np->file, np->line, in check_expr_args()
1360 outfl(O_DIE, np->file, np->line, in check_expr_args()
1828 outfl(O_DIE, np->file, np->line, in eval_expr()
1862 outfl(O_DIE, np->file, np->line, in eval_expr()
1882 outfl(O_DIE, np->file, np->line, in eval_expr()
[all …]
/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/bltins/
H A Dtypeset.c184 nv_putval(np,nv_getval(np),NV_RDONLY); in b_alias()
511 if(nv_isarray(np) && nv_arrayptr(np)) in print_value()
603 if(np && ((flag&NV_LTOU) || !nv_isnull(np) || nv_isattr(np,NV_LTOU))) in setall()
629 if(np && np->nvalue.cp) in setall()
644 if(nv_isnull(np) && !nv_isarray(np) && nv_isattr(np,NV_NOFREE)) in setall()
1227 if(np) in unall()
1251 np=sh_assignok(np,0); in unall()
1253 if(!nv_isnull(np) || nv_size(np) || nv_isattr(np,~(NV_MINIMAL|NV_NOFREE))) in unall()
1382 if(nv_isref(np) && nv_refsub(np)) in print_namval()
1457 …if((np=nv_search(*argv++,root,0)) && np!=onp && (!nv_isnull(np) || np->nvfun || nv_isattr(np,~NV_N… in print_scan()
[all …]
/illumos-gate/usr/src/uts/common/inet/ipf/
H A Dip_nat6.c153 np = &(*np)->in_rnext;
186 np = &(*np)->in_mnext;
449 if (np->in_pnext > ntohs(np->in_pmax)) {
450 np->in_pnext = ntohs(np->in_pmin);
459 np->in_next6 = np->in_out[0];
611 np->in_next6 = np->in_in[1];
614 np->in_next6 = np->in_in[0];
658 (np->in_pmin != np->in_pmax)) {
1979 if (np->in_p && fin->fin_p != np->in_p)
2115 for (np = ifs->ifs_nat_rules[hv]; np; np = np->in_mnext)
[all …]
/illumos-gate/usr/src/lib/libuutil/common/
H A Duu_list.c277 (void *)lp, NODE_TO_ELEM(lp, np), (void *)np); in list_insert()
312 list_insert(lp, ELEM_TO_NODE(lp, elem), np->uln_prev, np); in uu_list_insert()
331 np = np->uln_next) { in uu_list_find()
393 if ((np = np->uln_prev) == &lp->ul_null_node) in uu_list_nearest_prev()
438 next = (wp->ulw_dir > 0)? np->uln_next : np->uln_prev; in list_walk_advance()
441 return (np); in list_walk_advance()
525 np = np->uln_next) { in uu_list_walk()
531 np = np->uln_prev) { in uu_list_walk()
573 np->uln_next->uln_prev = np->uln_prev; in uu_list_remove()
574 np->uln_prev->uln_next = np->uln_next; in uu_list_remove()
[all …]
/illumos-gate/usr/src/cmd/backup/restore/
H A Dsymtab.c89 *epp = np; in addino()
91 for (np = np->e_next; np != NIL; np = np->e_next) in addino()
148 np = buf; in lookupname()
151 *np = '\0'; in lookupname()
266 (void) bzero((char *)np, (size_t)sizeof (*np)); in addentry()
268 np = (struct entry *)calloc(1, sizeof (*np)); in addentry()
289 np->e_parent = np; in addentry()
309 np->e_namlen = strlen(np->e_name); in addentry()
342 return (np); in addentry()
372 for (; np != NIL; np = np->e_links) { in freeentry()
[all …]

12345678910>>...17