Searched defs:nq (Results 1 - 17 of 17) sorted by relevance

/osnet-11/usr/src/lib/libshell/common/bltins/
H A Dwhence.c142 Namval_t *nq; local
188 if(np= nv_bfsearch(name, root, &nq, &notused))
H A Dmkservice.c284 register Namval_t* nq = sp->disc[ACCEPT]; local
291 if (nq)
299 if (sh_fun(nq, sp->node, av))
312 register Namval_t* nq; local
316 nq = sp->disc[CLOSE];
318 nq = sp->disc[ACTION];
319 if (nq)
327 r=sh_fun(nq, sp->node, av);
352 register Namval_t* nq; local
362 if (nq
[all...]
H A Dshiocmd_solaris.c228 register Namval_t *nq; local
232 nq = nv_search(stkptr(stkstd,offset),sh.var_tree,NV_ADD);
235 nv_putval(nq,val,fp->flags|NV_NOFREE);
237 (*fp->make)(nq);
238 return(nq);
246 Namval_t *nq,**nodes = (Namval_t**)(dcp+1); local
250 if(!(nq=nodes[n]))
252 nodes[n] = nq = sh_newnode(fp,np);
256 return(nq);
257 return(nq);
[all...]
/osnet-11/usr/src/lib/libshell/common/sh/
H A Darith.c133 Namval_t *nq; local
170 if(nq = nv_opensub(np))
171 np = nq;
177 if(ap && ap->table && (nq=nv_search(nv_getsub(np),ap->table,NV_ADD)))
178 nq->nvenv = (char*)np;
179 if(nq && nv_isnull(nq))
180 np = nv_arraychild(np,nq,0);
H A Dnvtree.c153 Namval_t *nq=0,fake; local
220 np = (*nfp->disc->createf)(nq,last,0,nfp);
224 if(nq = nv_opensub(np))
225 np = nq;
261 nq = np;
283 Namval_t *nq; local
310 if(dp->nextnode && !dp->hp && (nq = (Namval_t*)dp->table))
312 Namarr_t *ap = nv_arrayptr(nq);
313 if(ap && (ap->nelem&ARRAY_SCAN) && nv_nextsub(nq))
688 register Namval_t *np, *nq; local
996 Namval_t *nq, *mq; local
[all...]
H A Dsubshell.c408 register Namval_t *np,*nq; local
410 for(np=(Namval_t*)dtfirst(root);np;np=nq)
412 nq = (Namval_t*)dtnext(root,np);
H A Darray.c394 Namval_t *nq; local
403 if(nq = nv_search(sub, ap->table, NV_ADD))
405 if(!nq->nvfun && nq->nvalue.cp && *nq->nvalue.cp==0)
406 _nv_unset(nq,NV_RDONLY);
407 nv_arraychild(np,nq,0);
410 sfprintf(sh.strbuf,"%s=%s",nv_name(nq),nv_getval(np));
413 if(!nv_clone(tp,nq,flags|NV_NOFREE))
417 nv_offattr(nq,NV_RDONL
439 Namval_t *nq, *mq; local
985 nv_arraychild(Namval_t *np, Namval_t *nq, int c) argument
1045 Namval_t *nq; local
[all...]
H A Dnvdisc.c255 register Namval_t *nq = vp->disc[type]; local
277 if(!nq || isblocked(bp,type))
293 nq = vp->disc[type=UNASSIGN];
294 if(nq && !isblocked(bp,type))
300 sh_fun(nq,np,(char**)0);
335 else if(!nq || !isblocked(bp,type))
349 if((nq=vp->disc[n]) && !nv_isattr(nq,NV_NOFREE))
351 _nv_unset(nq,0);
352 dtdelete(root,nq);
372 register Namval_t *nq = vp->disc[type]; local
1086 Namval_t *np, *nq; local
1160 register Namval_t *np, *nq=0; local
1275 register Namval_t *nq, *mp; local
[all...]
H A Dnvtype.c213 Namval_t *nq = pp->ptype->np; local
217 cp = nv_name(nq);
218 if((ap = nv_arrayptr(nq)) && !(ap->nelem&ARRAY_UNDEF) && (sub= nv_getsub(nq)))
297 Namval_t *nq = nv_namptr(dp->nodes,i); local
299 if(fp=nv_hasdisc(nq,&chtype_disc))
300 nv_disc(nq, fp, NV_POP);
301 if(nv_isattr(nq,NV_REF))
303 nq->nvalue.nrp = nrp++;
304 nv_setsize(nq,
366 register Namval_t *nq, *nr; local
500 Namval_t *nq=0; local
547 Namval_t *nq; local
565 Namval_t *nq; local
618 Namval_t *np,*nq,*tp; local
747 Namval_t *np=0,*nq; local
849 Namval_t *mp=nodes[0], *bp=0, *np, *nq, **mnodes=nodes; local
1290 Namval_t *nq; local
1430 Namval_t *mp, *nq, *nr, *tp; local
[all...]
H A Dinit.c1642 Namval_t *nq=0; local
1650 nq = nv_namptr(sp->nodes,i);
1651 if((n==0||memcmp(name,nq->nvname,n)==0) && nq->nvname[n]==0)
1654 nq = 0;
1656 if(nq)
1663 return(nq);
H A Dmacro.c1029 Namval_t *np, *nq; local
1030 np = nv_bfsearch(name,shp->fun_tree,&nq,(char**)0);
1342 Namval_t *nq; local
1344 if(ap && !ap->fixed && (nq=nv_opensub(np)))
1346 if(ap && (nq=nv_opensub(np)))
1348 ap = nv_arrayptr(np=nq);
1411 Namval_t *nq = nv_type(np); local
1413 if(nq)
1414 nv_typename(nq,mp->shp->strbuf);
H A Dname.c719 register Namval_t *np=0, *nq=0; local
796 if(!(nq = nv_search((char*)np,shp->var_base,HASH_BUCKET)))
798 nq = np;
841 if(nq==np)
846 else if(nq)
848 if(nv_isnull(np) && c!='.' && (np->nvfun=nv_cover(nq)))
849 np->nvname = nq->nvname;
913 if(np==nq)
963 if(!nq && *sp=='[' && *cp==0 && cp[-1]==']')
1092 if(!(nq
2298 register Namval_t *np,*nq, *npnext; local
2387 Namval_t *mp, *nq; local
3203 register Namval_t *nq=0, *nr=0; local
3382 Namval_t *nq; local
3480 Namval_t *nq= shp->last_table, *mp= (Namval_t*)np->nvenv; local
[all...]
H A Dxec.c638 static int set_instance(Shell_t *shp,Namval_t *nq, Namval_t *node, struct Namref *nr) argument
643 if(!nv_isattr(nq,NV_MINIMAL|NV_EXPORT|NV_ARRAY) && (np=(Namval_t*)nq->nvenv) && nv_isarray(np))
644 nq = np;
645 cp = nv_name(nq);
647 nr->np = nq;
655 if((ap=nv_arrayptr(nq)) && (sp = nv_getsub(nq)))
658 if(shp->var_tree!=shp->var_base && !nv_search((char*)nq,nr->root,HASH_BUCKET|HASH_NOSCOPE))
680 static void unset_instance(Namval_t *nq, Namval_ argument
919 Namval_t *np, *nq, *last_table; local
2567 Namval_t *mp, *nq; local
3218 Namval_t *np, *nq, **nref; local
3343 sh_fun(Namval_t *np, Namval_t *nq, char *argv[]) argument
[all...]
/osnet-11/usr/src/lib/libnisdb/
H A Ddb_mindex3.cc336 int i, na, nau, nq = 0, xid = 0; local
398 res = mapFromLDAP(t, q, &nq, dbId, &stat, &oa);
401 "%s: mapFromLDAP() => 0x%x, status=%d %s; nq = %d",
403 ldap_err2string(stat), nq);
412 table->mapping.enumEntries = nq;
557 freeQueries(res, nq);
638 myself, nq);
667 for (i = 0, na = 0; i < nq; i++) {
856 freeObjAttr(oa, nq);
H A Dldap_nisdbquery.c324 int i, nq, nn; local
331 nq = *numQueries;
332 new = am(myself, nq * sizeof (new[0]));
334 attr = am(myself, nq * sizeof (attr[0]));
339 freeQueries(q, nq);
342 freeObjAttr(*objAttr, nq);
349 for (i = 0, nn = 0; i < nq; i++) {
394 int nq, iqc; local
406 for (r = 0, nq = 0; r < t->numRulesFromLDAP; r++) {
494 * Of course, we already have 'nq' db_quer
756 int i, nqp, nq, *nnp = 0, nv; local
[all...]
H A Ddb_mindex2.cc729 int i, na, nq = 0, stat, stat2, numAttrs, ret; local
1434 int i, size, nq = 0; local
1492 nq++;
1526 (nq+count) * sizeof (rv[0]));
1528 (nq+count) * sizeof (qa[0]));
1531 (nq+count) * sizeof (qold[0]));
1534 freeQueries(qa, nq);
1536 freeQueries(qat, nq);
1538 freeRuleValue(rv, nq);
1540 freeRuleValue(rvt, nq);
[all...]
H A Dldap_map.c778 * 'nq' is the number of elements in the 'old', 'new', and 'rvIn'
802 * (zo_owner, etc.) to be written to LDAP. 'rvIn' is an array with 'nq'
810 * an array of 'nq' elements, though if 'firstOnly' is set, it should be
817 mapToLDAP(__nis_table_mapping_t *tm, int nq, db_query **old, db_query **new, argument
829 if (tm == 0 || (old == 0 && new == 0) || nq <= 0)
833 if (nq == 1) {
853 * we need nq * maxMatches elements in each array. However, if
857 dn = am(myself, (firstOnly ? 1 : nq) * maxMatches * sizeof (dn[0]));
858 odn = am(myself, (firstOnly ? 1 : nq) * maxMatches * sizeof (odn[0]));
859 rv = am(myself, (firstOnly ? 1 : nq) * maxMatche
[all...]

Completed in 88 milliseconds