HomeSort by: relevance | last modified time | path
    Searched refs:neighbor (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.sbin/mrinfo/
mrinfo.c 193 * Process an incoming neighbor-list message.
216 u_int32_t neighbor; local
217 GET_ADDR(neighbor);
218 neighbor = htonl(neighbor);
221 inet_fmt(neighbor),
222 inet_name(neighbor), metric, thresh);
260 u_int32_t neighbor = *(u_int32_t*)p; local
264 inet_fmt(neighbor),
265 inet_name(neighbor), metric, thresh)
    [all...]
  /src/usr.sbin/map-mbone/
mapper.c 53 typedef struct neighbor { struct
54 struct neighbor *next;
60 } Neighbor;
65 Neighbor *neighbors; /* List of neighbors' IP addresses */
74 struct interface *interfaces; /* Else, neighbor data */
91 Neighbor * find_neighbor(u_int32_t addr, Node *node);
147 Neighbor *find_neighbor(u_int32_t addr, Node *node)
152 Neighbor *nb;
228 * Process an incoming neighbor probe message.
250 * Process an incoming neighbor-list request message
388 u_int32_t neighbor; local
529 u_int32_t neighbor; local
    [all...]
  /src/usr.sbin/rwhod/
rwhod.c 86 * We communicate with each neighbor in a list constructed at the time we're
90 struct neighbor { struct
91 struct neighbor *n_next;
98 static struct neighbor *neighbors;
361 struct neighbor *np;
474 struct neighbor *np;
531 np = (struct neighbor *)malloc(len);
533 quit("malloc of neighbor structure");
  /src/usr.sbin/mrouted/
snmp.c 373 * Find the lowest neighbor >= (V,A) spec
399 * Find a neighbor, if it exists off a given Vif
426 struct listaddr *neighbor; local
443 if (!(neighbor = find_neighbor(vifi, addr)))
461 neighbor = next_neighbor(&vifi,addr);
462 if (!neighbor)
466 put_address(newname, neighbor->al_addr, vp->namelen+1);
471 if (!(neighbor = next_neighbor(&vifi,addr+1)))
475 put_address(newname, neighbor->al_addr, vp->namelen+1);
490 long_return = (currtime - neighbor->al_ctime)*100
    [all...]

Completed in 25 milliseconds