Searched refs:nxt (Results 1 - 25 of 69) sorted by relevance

123

/macosx-10.10/ksh-23/ksh/src/lib/libast/string/
H A Dfmtbuf.c34 static char* nxt = buf; variable
47 if (n > (&buf[elementsof(buf)] - nxt))
63 nxt = buf;
65 cur = nxt;
66 nxt += n;
H A Dtok.c41 struct Tok_s* nxt; /* next in free list */ member in union:Tok_s::__anon9373
60 freelist = freelist->ptr.nxt;
80 p->ptr.nxt = freelist;
/macosx-10.10/man-16/man/src/
H A Ddefs.h16 struct dir *nxt; member in struct:dir
21 struct dirs *nxt; member in struct:dirs
H A Dman-config.c85 while (dlp->nxt)
86 dlp = dlp->nxt;
87 dlp->nxt = (struct dirs *) my_malloc (sizeof(struct dirs));
88 dlp = dlp->nxt;
90 dlp->nxt = 0;
159 struct xp *nxt; member in struct:xp
168 while (xpp->nxt)
169 xpp = xpp->nxt;
170 xpp->nxt = (struct xp *) my_malloc (sizeof(struct xp));
171 xpp = xpp->nxt;
[all...]
H A Dto_cat.c86 for (dlp = cfdirlist.nxt; dlp; dlp = dlp->nxt) {
H A Dmanpath.c334 for (dlp = cfdirlist.nxt; dlp; dlp = dlp->nxt) {
376 for (dlp = cfdirlist.nxt; dlp; dlp = dlp->nxt)
/macosx-10.10/ksh-23/ksh/src/lib/libast/astsa/
H A Dsfstr.c39 o = p->nxt - p->beg;
42 p->nxt = p->beg + o;
55 p->nxt = 0;
104 if (p->nxt >= p->end && extend(p, 1))
106 *p->nxt++ = c;
125 if (r > (p->end - p->nxt) && extend(p, r))
127 memcpy(p->nxt, buf, n);
128 p->nxt += n;
130 *p->nxt++ = sep;
157 if (!p->nxt)
[all...]
H A Dsfstr.h30 char* nxt; member in struct:Sfstr_s
/macosx-10.10/bind9-45.101/bind9/lib/dns/rdata/generic/
H A Dnxt_30.c201 dns_rdata_nxt_t *nxt = source; local
206 REQUIRE(nxt->common.rdtype == type);
207 REQUIRE(nxt->common.rdclass == rdclass);
208 REQUIRE(nxt->typebits != NULL || nxt->len == 0);
209 if (nxt->typebits != NULL && (nxt->typebits[0] & 0x80) == 0) {
210 REQUIRE(nxt->len <= 16);
211 REQUIRE(nxt->typebits[nxt
226 dns_rdata_nxt_t *nxt = target; local
260 dns_rdata_nxt_t *nxt = source; local
[all...]
/macosx-10.10/Libc-1044.1.2/db/btree/FreeBSD/
H A Dbt_split.c596 indx_t full, half, nxt, off, skip, top, used; local
611 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) {
618 src = bi = GETBINTERNAL(h, nxt);
623 src = bl = GETBLEAF(h, nxt);
628 src = GETRINTERNAL(h, nxt);
633 src = rl = GETRLEAF(h, nxt);
648 || nxt == top - 1) {
655 ++nxt;
687 if (c->pg.index < nxt) /* Lef
791 indx_t nxt, top; local
[all...]
/macosx-10.10/xnu-2782.1.97/bsd/netinet6/
H A Din6_cksum.c182 * m MUST contain at least an IPv6 header, if nxt is specified;
183 * nxt is the upper layer protocol number;
188 inet6_cksum(struct mbuf *m, uint32_t nxt, uint32_t off, uint32_t len) argument
194 if (nxt != 0) {
227 htonl(nxt + len));
H A Dipcomp_input.c94 u_int16_t nxt; local
121 nxt = ipcomp->comp_nxt;
203 ip->ip_p = nxt;
216 if (nxt != IPPROTO_DONE) {
217 if ((ip_protox[nxt]->pr_flags & PR_LASTHDR) != 0 &&
227 ip_proto_dispatch_in(m, off, nxt, 0);
255 u_int16_t nxt; local
278 nxt = ipcomp->comp_nxt;
327 *prvnxtp = nxt;
346 return nxt;
[all...]
H A Dip6_input.c450 int nxt = 0, ours = 0; local
522 nxt = ip6->ip6_nxt;
968 nxt = hbh->ip6h_nxt;
991 nxt = ip6->ip6_nxt;
1103 while (nxt != IPPROTO_DONE) {
1130 (ip6_protox[nxt]->pr_flags & PR_LASTHDR) != 0) {
1153 (mbuf_t *)&m, off, nxt);
1171 if ((pr_input = ip6_protox[nxt]->pr_input) == NULL) {
1174 nxt = IPPROTO_DONE;
1175 } else if (!(ip6_protox[nxt]
1646 int nxt = ip6->ip6_nxt, off = sizeof (struct ip6_hdr); local
1796 int len, nxt; local
1905 int nxt; local
[all...]
H A Desp_input.c173 u_int16_t nxt; local
406 nxt = esptail.esp_nxt;
456 if (sav->utun_is_keepalive_fn(sav->utun_pcb, &m, nxt, sav->flags, (off + esplen + ivlen))) {
467 if (ipsec4_tunnel_validate(m, off + esplen + ivlen, nxt, sav, &ifamily)) {
602 nxt = IPPROTO_DONE;
626 ip->ip_p = nxt;
640 if (nxt == IPPROTO_TCP || nxt == IPPROTO_UDP) {
645 if (nxt != IPPROTO_DONE) {
646 if ((ip_protox[nxt]
757 u_int16_t nxt; local
[all...]
/macosx-10.10/BerkeleyDB-21/db/log/
H A Dlog_archive.c366 u_int array_size, last, n, nxt; local
457 for (last = nxt = 0; nxt < n;) {
460 * to return to the user, nxt is the next slot that we're
463 if (last != nxt) {
464 array[last] = array[nxt];
465 array[nxt] = NULL;
467 for (++nxt; nxt < n &&
468 strcmp(array[last], array[nxt])
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/demos-en/
H A Dknightstour.rb52 nxt = -1
58 nxt = pos
60 nxt = edgemost(nxt, pos)
64 nxt
68 def edgemost(nxt, pos)
69 col_A = 3 - ((3.5 - nxt % 8).abs.to_i)
71 row_A = 3 - ((3.5 - nxt.div(8)).abs.to_i)
73 (col_A * row_A < col_B * row_B)? nxt : pos
89 if (nxt
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/demos-jp/
H A Dknightstour.rb54 nxt = -1
60 nxt = pos
62 nxt = edgemost(nxt, pos)
66 nxt
70 def edgemost(nxt, pos)
71 col_A = 3 - ((3.5 - nxt % 8).abs.to_i)
73 row_A = 3 - ((3.5 - nxt.div(8)).abs.to_i)
75 (col_A * row_A < col_B * row_B)? nxt : pos
91 if (nxt
[all...]
/macosx-10.10/tcpdump-61/tcpdump/
H A Daddrtoname.c86 struct hnamemem *nxt; member in struct:hnamemem
140 struct h6namemem *nxt; member in struct:h6namemem
233 for (; p->nxt; p = p->nxt) {
238 p->nxt = newhnamemem();
283 for (; p->nxt; p = p->nxt) {
288 p->nxt = newh6namemem();
583 for (tp = &eprototable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
[all...]
H A Dprint-atalk.c533 struct hnamemem *nxt; member in struct:hnamemem
569 tp->nxt; tp = tp->nxt)
572 tp->nxt = newhnamemem();
578 for (tp = &hnametable[i & (HASHNAMESIZE-1)]; tp->nxt; tp = tp->nxt)
584 for (tp2 = &hnametable[i & (HASHNAMESIZE-1)]; tp2->nxt; tp2 = tp2->nxt)
587 tp->nxt = newhnamemem();
595 tp->nxt
[all...]
H A Dprint-tcp.c84 struct tcp_seq_hash *nxt; member in struct:tcp_seq_hash
369 th->nxt; th = th->nxt)
374 if (!th->nxt || (flags & TH_SYN)) {
376 if (th->nxt == NULL) {
377 th->nxt = (struct tcp_seq_hash *)
379 if (th->nxt == NULL)
1065 u_int8_t nxt; local
1099 nxt = 0;
1100 CC_MD5_Update(&ctx, (char *)&nxt, sizeo
[all...]
/macosx-10.10/ksh-23/ksh/src/cmd/INIT/
H A Dproto.c1485 char* nxt; member in struct:Buffer_s
1600 ((( b)->nxt<( b)->end)?(*( b)->nxt++=( *s++)):(( *s++),(-1)));
1617 ((( b)->nxt<( b)->end)?(*( b)->nxt++=( notice->cc[n > 0 ? 0 : 1])):(( notice->cc[n > 0 ? 0 : 1]),(-1)));
1619 ((( b)->nxt<( b)->end)?(*( b)->nxt++=( cc)):(( cc),(-1)));
1620 ((( b)->nxt<( b)->end)?(*( b)->nxt++=( notice->cc[n > 0 ? 1 : 2])):(( notice->cc[n > 0 ? 1 : 2]),(-1)));
1629 ((( b)->nxt<(
[all...]
/macosx-10.10/ruby-106/ruby/lib/rubygems/package/
H A Dtar_writer.rb277 nxt = ""
280 nxt = parts.pop
281 break if newname.bytesize + 1 + nxt.bytesize > 100
282 newname = nxt + "/" + newname
285 prefix = (parts + [nxt]).join "/"
/macosx-10.10/Libinfo-459/nis.subproj/
H A Dgetnetgrent.c54 struct list *nxt; member in struct:list
144 for (ls = list; ls != NULL; ls = ls->nxt)
153 ls->nxt = list;
/macosx-10.10/mDNSResponder-561.1.1/mDNSCore/
H A Dnsec.c318 // subdomain of the nsec's nxt field, then the qname is a empty non-terminal. For
331 const domainname *nxt = (const domainname *)&rdb->data; local
340 ret = DNSSECCanonicalOrder(nxt, qname, &subdomain);
358 const domainname *nxt = (const domainname *)&rdb->data; local
362 match2 = CountLabelsMatch(nxt, qname);
367 return SkipLeadingLabels(nxt, CountLabels(nxt) - match2);
381 const domainname *nxt = (const domainname *)&rdb->data; local
445 ret2 = DNSSECCanonicalOrder(name, nxt, &subdomain2);
450 LogDNSSEC("NSECNameExists: name %##s is same as nxt nam
[all...]
/macosx-10.10/ncurses-44/ncurses/ncurses/tinfo/
H A Dcomp_hash.c303 int nxt; local
307 nxt = (int) strlen(name_table[n].nte_name) + 5;
308 if (nxt + len > 72) {
313 len += nxt;

Completed in 259 milliseconds

123