nh
nh(&ctx->hash, (const UINT8 *)input, L1_KEY_LEN,
nh(&ahc->hash, (UINT8 *)msg, nh_len, len, nh_result);
nh(&ahc->hash, (UINT8 *)msg, L1_KEY_LEN, L1_KEY_LEN, nh_result);
nh(&ahc->hash, (UINT8 *)msg, nh_len, len, nh_result);
struct body *nh;
nh = tail->next;
tail = nh;
nh = newlink();
nh->next = NULL;
nh->prev = head;
head->next = nh;
nh->y = y;
nh->x = x;
display(nh, HEAD);
head = nh;
u_char *cp = (u_char *)ip6, nh;
nh = ip6->ip6_nxt;
switch (nh) {
nh = ((struct ip6_hbh *)cp)->ip6h_nxt;
nh = ((struct ip6_dest *)cp)->ip6d_nxt;
nh = ((struct ip6_frag *)cp)->ip6f_nxt;
nh = ((struct ip6_rthdr *)cp)->ip6r_nxt;
printf("Unknown Header(%d)\n", nh);
struct nfsheur *nh;
nh = nfsrv_sequential_heuristic(uiop, vp, 1);
ioflags |= nh->nh_seqcount << IO_SEQSHIFT;
nh->nh_nextoff = uiop->uio_offset;
struct nfsheur *nh;
nh = &nfsheur[hi];
nh = &nfsheur[hi];
if (nfsheur[hi].nh_use < nh->nh_use)
nh = &nfsheur[hi];
if (nh->nh_vp != vp) {
nh->nh_vp = vp;
nh->nh_nextoff = uio->uio_offset;
nh->nh_use = NHUSE_INIT;
nh->nh_seqcount = 4;
nh->nh_seqcount = 1;
if ((uio->uio_offset == 0 && nh->nh_seqcount > 0) ||
uio->uio_offset == nh->nh_nextoff) {
nh->nh_seqcount += howmany(uio->uio_resid, 16384);
if (nh->nh_seqcount > IO_SEQMAX)
nh->nh_seqcount = IO_SEQMAX;
} else if (qabs(uio->uio_offset - nh->nh_nextoff) <= MAX_REORDERED_RPC *
} else if (nh->nh_seqcount > 1) {
nh->nh_seqcount /= 2;
nh->nh_seqcount = 0;
nh->nh_use += NHUSE_INC;
if (nh->nh_use > NHUSE_MAX)
nh->nh_use = NHUSE_MAX;
return (nh);
struct nfsheur *nh;
nh = nfsrv_sequential_heuristic(uiop, vp, 0);
ioflag |= nh->nh_seqcount << IO_SEQSHIFT;
nh->nh_nextoff = off;
kv1->hint->v.nh.n1 = wcstoull(smain1, NULL, 10);
kv1->hint->v.nh.empty=true;
kv1->hint->v.nh.si = SI1;
kv1->hint->status = (kv1->hint->v.nh.n1 != ULLONG_MAX) ?
kv1->hint->v.nh.neg = (sign1 < 0) ? true : false;
kv2->hint->v.nh.n1 = wcstoull(smain2, NULL, 10);
kv2->hint->v.nh.empty=true;
kv2->hint->v.nh.si = SI2;
kv2->hint->status = (kv2->hint->v.nh.n1 != ULLONG_MAX) ?
kv2->hint->v.nh.neg = (sign2 < 0) ? true : false;
e1 = kv1->hint->v.nh.empty;
e2 = kv2->hint->v.nh.empty;
neg1 = kv1->hint->v.nh.neg;
neg2 = kv2->hint->v.nh.neg;
cmp_res = cmpsuffix(kv1->hint->v.nh.si, kv2->hint->v.nh.si);
n1 = kv1->hint->v.nh.n1;
n2 = kv2->hint->v.nh.n1;
struct n_hint nh;
struct node_host *h, *nh;
for (h = ti->host; h != NULL; h = nh) {
nh = h->next;
remove_invalid_hosts(struct node_host **nh, sa_family_t *af)
struct node_host *n = *nh, *prev = NULL;
if (n == (*nh)->tail)
(*nh)->tail = prev;
*nh = next;
invalid_redirect(struct node_host *nh, sa_family_t af)
for (n = nh; n != NULL; n = n->next) {
if (nh == NULL) {
nh = fsock.sin6_addr;
ifcp->ifc_name, inet6_n2p(&nh), ntohs(fsock.sin6_port), nn);
nh = np->rip6_dest;
SET_IN6_LINKLOCAL_IFINDEX(nh, idx);
trace(1, "\tNexthop: %s\n", inet6_n2p(&nh));
nh = fsock.sin6_addr;
trace(1, "\tNexthop: %s\n", inet6_n2p(&nh));
nh = fsock.sin6_addr;
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
rrt->rrt_gw = nh;
addroute(rrt, &nh, ifcp);
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
IN6_ARE_ADDR_EQUAL(&nh, &rrt->rrt_gw)) {
rrt->rrt_gw = nh;
addroute(rrt, &nh, ifcp);
rrt->rrt_gw = nh;
addroute(rrt, &nh, ifcp);
struct in6_addr *nh; /* next hop */
nrt = 0; np = ripbuf->rip6_nets; nh = NULL;
nh = NULL;
nrt = 0; np = ripbuf->rip6_nets; nh = NULL;
if (nh == NULL || !IN6_ARE_ADDR_EQUAL(nh, &rrt->rrt_gw)) {
nh = &rrt->rrt_gw;
} else if (nh && (rrt->rrt_index != ifcp->ifc_index ||
!IN6_ARE_ADDR_EQUAL(nh, &rrt->rrt_gw) ||
nh = NULL;
nh = NULL;
struct in6_addr nh; /* next hop */
u_char *cp = (u_char *)ip6, nh;
nh = ip6->ip6_nxt;
while (lim - cp >= (nh == IPPROTO_NONE ? 0 : 8)) {
switch (nh) {
return(useproto == nh ? cp : NULL);
return(useproto == nh ? cp : NULL);
return(useproto == nh ? none_hdr : NULL);
nh = ((struct ip6_frag *)cp)->ip6f_nxt;
nh = ((struct ip6_ext *)cp)->ip6e_nxt;
nh = ((struct ip6_ext *)cp)->ip6e_nxt;