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

/illumos-gate/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...]
/illumos-gate/usr/src/lib/libmvec/common/
H A D__vrem_pio2m.c173 int nq, ip, n, i, j, k, eq0, eqnqm1; local
181 /* compute q[0,...,5] = x * ipio2 and initialize nq and eqnqm1 */
204 nq = 5;
212 z = q[nq] * twon24;
213 for (j = nq-1; j >= 1; j--) {
253 for (j = 0; j <= nq; j++) {
259 if (nq - j < 4) {
260 k = 4 - (nq - j);
262 * compute q[nq+1] to q[nq
[all...]
/illumos-gate/usr/src/cmd/krb5/kadmin/kdcmgr/
H A Dklookup.c54 int len = 0, anslen, hostlen, nq, na, type, class; local
118 nq = ntohs(h->qdcount);
122 if (nq != 1 || na < 1) {
/illumos-gate/usr/src/lib/libnisdb/
H A Ddb_mindex3.cc338 int i, na, nau, nq = 0, xid = 0; local
400 res = mapFromLDAP(t, q, &nq, dbId, &stat, &oa);
403 "%s: mapFromLDAP() => 0x%x, status=%d %s; nq = %d",
405 ldap_err2string(stat), nq);
414 table->mapping.enumEntries = nq;
559 freeQueries(res, nq);
640 myself, nq);
669 for (i = 0, na = 0; i < nq; i++) {
858 freeObjAttr(oa, nq);
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_nisdbquery.c625 int i, nq, nn; local
632 nq = *numQueries;
633 new = am(myself, nq * sizeof (new[0]));
635 attr = am(myself, nq * sizeof (attr[0]));
640 freeQueries(q, nq);
643 freeObjAttr(*objAttr, nq);
650 for (i = 0, nn = 0; i < nq; i++) {
695 int nq; local
707 for (r = 0, nq = 0; r < t->numRulesFromLDAP; r++) {
795 * Of course, we already have 'nq' db_quer
1057 int i, nqp, nq, *nnp = 0, nv; local
[all...]
H A Dldap_map.c779 * 'nq' is the number of elements in the 'old', 'new', and 'rvIn'
803 * (zo_owner, etc.) to be written to LDAP. 'rvIn' is an array with 'nq'
811 * an array of 'nq' elements, though if 'firstOnly' is set, it should be
818 mapToLDAP(__nis_table_mapping_t *tm, int nq, db_query **old, db_query **new, argument
830 if (tm == 0 || (old == 0 && new == 0) || nq <= 0)
834 if (nq == 1) {
854 * we need nq * maxMatches elements in each array. However, if
858 dn = am(myself, (firstOnly ? 1 : nq) * maxMatches * sizeof (dn[0]));
859 odn = am(myself, (firstOnly ? 1 : nq) * maxMatches * sizeof (odn[0]));
860 rv = am(myself, (firstOnly ? 1 : nq) * maxMatche
[all...]
/illumos-gate/usr/src/lib/libshell/common/sh/
H A Darray.c301 Namval_t *nq; local
310 if(nq = nv_search(sub, ap->table, NV_ADD))
312 if(!nq->nvfun && nq->nvalue.cp && *nq->nvalue.cp==0)
313 _nv_unset(nq,NV_RDONLY);
314 nv_arraychild(np,nq,0);
317 sfprintf(sh.strbuf,"%s=%s",nv_name(nq),nv_getval(np));
320 if(!nv_clone(tp,nq,flags|NV_NOFREE))
324 nv_offattr(nq,NV_RDONL
346 Namval_t *nq, *mq; local
845 nv_arraychild(Namval_t *np, Namval_t *nq, int c) argument
900 Namval_t *nq; local
[all...]
H A Dnvtree.c149 Namval_t *nq=0,fake; local
215 np = (*nfp->disc->createf)(nq,last,0,nfp);
219 if(nq = nv_opensub(np))
220 np = nq;
256 nq = np;
278 Namval_t *nq; local
305 if(dp->nextnode && !dp->hp && (nq = (Namval_t*)dp->table))
307 Namarr_t *ap = nv_arrayptr(nq);
308 if(ap && (ap->nelem&ARRAY_SCAN) && nv_nextsub(nq))
648 register Namval_t *np, *nq; local
949 Namval_t *nq, *mq; local
[all...]
H A Dsubshell.c417 register Namval_t *np,*nq; local
419 for(np=(Namval_t*)dtfirst(root);np;np=nq)
421 nq = (Namval_t*)dtnext(root,np);
H A Dnvdisc.c242 register Namval_t *nq = vp->disc[type]; local
264 if(!nq || isblocked(bp,type))
280 nq = vp->disc[type=UNASSIGN];
281 if(nq && !isblocked(bp,type))
287 sh_fun(nq,np,(char**)0);
322 else if(!nq || !isblocked(bp,type))
335 if((nq=vp->disc[n]) && !nv_isattr(nq,NV_NOFREE))
337 nv_unset(nq);
338 dtdelete(root,nq);
359 register Namval_t *nq = vp->disc[type]; local
1059 Namval_t *np, *nq; local
1136 register Namval_t *np, *nq=0; local
1251 register Namval_t *nq, *mp; local
[all...]
H A Dnvtype.c212 Namval_t *nq = pp->ptype->np; local
216 cp = nv_name(nq);
217 if((ap = nv_arrayptr(nq)) && !(ap->nelem&ARRAY_UNDEF) && (sub= nv_getsub(nq)))
291 Namval_t *nq = nv_namptr(dp->nodes,i); local
293 if(fp=nv_hasdisc(nq,&chtype_disc))
294 nv_disc(nq, fp, NV_POP);
295 if(nv_isattr(nq,NV_REF))
297 nq->nvalue.nrp = nrp++;
298 nv_setsize(nq,
358 register Namval_t *nq, *nr; local
490 Namval_t *nq=0; local
537 Namval_t *nq; local
553 Namval_t *nq; local
606 Namval_t *np,*nq,*tp; local
732 Namval_t *np=0,*nq; local
824 Namval_t *mp=nodes[0], *bp=0, *np, *nq, **mnodes=nodes; local
1267 Namval_t *nq; local
1400 Namval_t *mp, *nq, *nr, *tp; local
[all...]
H A Dinit.c1455 Namval_t *nq=0; local
1463 nq = nv_namptr(sp->nodes,i);
1464 if((n==0||memcmp(name,nq->nvname,n)==0) && nq->nvname[n]==0)
1467 nq = 0;
1469 if(nq)
1476 return(nq);
H A Dmacro.c974 Namval_t *np, *nq; local
975 np = nv_bfsearch(name,shp->fun_tree,&nq,(char**)0);
1322 Namval_t *nq = nv_type(np); local
1324 if(nq)
1325 nv_typename(nq,mp->shp->strbuf);
H A Dname.c690 register Namval_t *np=0, *nq=0; local
759 nq = np;
796 if(nq==np)
801 else if(nq)
803 if(nv_isnull(np) && c!='.' && (np->nvfun=nv_cover(nq)))
804 np->nvname = nq->nvname;
844 if(np==nq)
877 if(!nq && *sp=='[' && *cp==0 && cp[-1]==']')
980 if(!(nq = nv_opensub(np)))
993 if(ap && ap->table && (nq
2124 register Namval_t *np,*nq, *npnext; local
2219 Namval_t *mp, *nq; local
2986 register Namval_t *nq, *nr=0; local
3122 Namval_t *nq; local
3196 Namval_t *nq= sh.last_table, *mp= (Namval_t*)np->nvenv; local
[all...]
H A Dxec.c611 static int set_instance(Shell_t *shp,Namval_t *nq, Namval_t *node, struct Namref *nr) argument
613 char *sp=0,*cp = nv_name(nq);
616 nr->np = nq;
620 if((ap=nv_arrayptr(nq)) && (sp = nv_getsub(nq)))
639 static void unset_instance(Namval_t *nq, Namval_t *node, struct Namref *nr,long mode) argument
646 nv_putsub(nq, nr->sub, mode);
706 Namval_t *np, *nq, *last_table; local
722 nq = (Namval_t*)(t->com.comnamq);
734 np = nv_bfsearch(com0, shp->bltin_tree, &nq,
2751 sh_fun(Namval_t *np, Namval_t *nq, char *argv[]) argument
[all...]
/illumos-gate/usr/src/cmd/mdb/sparc/mdb/
H A Dproc_isadep.c267 int ns, nd, nq; local
346 * ns, nd, and nq to indicate the number of registers of each type.
352 nq = 16;
360 nq = 16;
365 nq = 0;
398 for (i = 0; i < nq; i++) {
/illumos-gate/usr/src/uts/common/avs/ns/rdc/
H A Drdc_diskq.c963 net_queue *nq = &group->ra_queue; local
966 ASSERT(MUTEX_HELD(&nq->net_qlock));
971 if (nq->qfill_sleeping != RDC_QFILL_ASLEEP)
974 if (nq->qfflags & RDC_QFILLSTOP)
977 if (nq->qfflags & RDC_QFILLSLEEP)
990 if (nq->qfill_sleeping == RDC_QFILL_ASLEEP) {
991 if (nq->hwmhit) {
992 if (nq->blocks <= RDC_LOW_QBLOCKS) {
993 nq->hwmhit = 0;
1684 net_queue *nq local
2318 net_queue *nq = &group->ra_queue; local
2614 net_queue *nq = &krdc->group->ra_queue; local
[all...]
H A Drdc_clnt.c1834 net_queue *nq; local
1863 nq = &group->ra_queue;
1890 (nq->qfflags & RDC_QFILLSLEEP))
1897 (nq->qfflags & RDC_QFILLSLEEP)) {
1925 if ((nq->net_qhead == NULL) ||
1926 (nq->net_qhead->seq != RDC_NEWSEQ + 1)) {
/illumos-gate/usr/src/uts/common/io/nvme/
H A Dnvme.c1699 nvme_nqueue_t nq = { 0 }; local
1701 nq.b.nq_nsq = nq.b.nq_ncq = nqueues - 1;
1703 if (!nvme_set_features(nvme, 0, NVME_FEAT_NQUEUES, nq.r, &nq.r)) {
1711 return (MIN(nqueues, MIN(nq.b.nq_nsq, nq.b.nq_ncq) + 1));
/illumos-gate/usr/src/uts/common/io/cxgbe/common/
H A Dt4_hw.c2390 int nq = min(n, 32); local
2395 * "nq" Ingress Queue IDs to the firmware.
2397 cmd.niqid = htons(nq);
2401 * "nq" more done for the start of the next loop.
2403 start += nq;
2404 n -= nq;
2411 while (nq > 0) {
2430 nq -= 3;
/illumos-gate/usr/src/uts/common/os/
H A Dstrsubr.c4211 queue_t *nq; local
4223 for (nq = backq(q); nq && !nq->q_qinfo->qi_srvp; nq = backq(nq)) {
4224 ASSERT(STRMATED(q->q_stream) || STREAM(q) == STREAM(nq));
4227 if (nq) {
4238 if (freezer != curthread || STREAM(q) != STREAM(nq)) {
4239 mutex_enter(QLOCK(nq));
[all...]

Completed in 190 milliseconds