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) {
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;
history_set_fun(TYPE(History) *h, TYPE(History) *nh)
if (nh->h_first == NULL || nh->h_next == NULL || nh->h_last == NULL ||
nh->h_prev == NULL || nh->h_curr == NULL || nh->h_set == NULL ||
nh->h_enter == NULL || nh->h_add == NULL || nh->h_clear == NULL ||
nh->h_del == NULL || nh->h_ref == NULL) {
h->h_first = nh->h_first;
h->h_next = nh->h_next;
h->h_last = nh->h_last;
h->h_prev = nh->h_prev;
h->h_curr = nh->h_curr;
h->h_set = nh->h_set;
h->h_clear = nh->h_clear;
h->h_enter = nh->h_enter;
h->h_add = nh->h_add;
h->h_del = nh->h_del;
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;
nh = ((struct ip6_ext *)cp)->ip6e_nxt;
printf("Unknown Header(%d)\n", nh);
#define windermere_bus_space_subregion(t, h, o, s, nh) \
bus_space_subregion((t), (h), (o) >> 2, (s), (nh))
bus_size_t size, bus_space_handle_t *nh)
*nh = h + (offset << CHIP_ALIGN_STRIDE);
nh(h, C[i].m, C[i].mlen, k);
nh(h0, m, MIN(mlen, 1024), nhk);
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);
ioflag |= nh->nh_seqcount << IO_SEQSHIFT;
nh->nh_nextoff = uiop->uio_offset;
struct nfsheur *nh;
nh = nfsrv_sequential_heuristic(uiop, vp);
ioflags |= nh->nh_seqcount << IO_SEQSHIFT;
nh->nh_nextoff = uiop->uio_offset;
Elf_Nhdr nh;
if (note.nh.n_namesz == ELF_NOTE_NETBSD_NAMESZ &&
note.nh.n_descsz == ELF_NOTE_NETBSD_DESCSZ &&
note.nh.n_type == ELF_NOTE_TYPE_NETBSD_TAG &&
const int off = hlen, nh = ip->ip_p;
(*inetsw[ip_protox[nh]].pr_input)(m, off, nh);
nh = fsock.sin6_addr;
ifcp->ifc_name, inet6_n2p(&nh), ntohs(fsock.sin6_port), (int)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; nip = ripbuf->rip6_nets; nh = NULL;
nh = NULL;
nrt = 0; nip = 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;
switch (nh) {
nh = ((struct ip6_frag *)cp)->ip6f_nxt;
nh = ((struct ip6_ext *)cp)->ip6e_nxt;
nh = ((struct ip6_ext *)cp)->ip6e_nxt;