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

  /src/usr.bin/netstat/
vtw.h 5 void show_vtw_v4(void (*)(const vtw_t *));
6 void show_vtw_v6(void (*)(const vtw_t *));
vtw.c 121 static void process_vtw(const vtw_ctl_t *, void (*)(const vtw_t *));
205 process_vtw(const vtw_ctl_t * ctl, void (*print)(const vtw_t *))
207 vtw_t *vp;
265 show_vtw_v4(void (*print)(const vtw_t *))
373 show_vtw_v6(void (*print)(const vtw_t *))
inet.c 99 void print_vtw_v4(const vtw_t *);
190 print_vtw_v4(const vtw_t *vtw)
inet6.c 153 void print_vtw_v6(const vtw_t *);
247 print_vtw_v6(const vtw_t *vtw)
  /src/sys/netinet/
tcp_vtw.h 92 * The vestigial time waits (vtw_t), the data elements in the above, are
100 * The vtw_t are, per requirement, in a contiguous chunk. Allocation
101 * is done with a clock hand, and all vtw_t within one allocation
105 * A vtw_t will be allocated, timestamped, and have a fixed future
108 * hash bucket, placed at the head (more recent in time) and the vtw_t
112 * aged entries will hang down, tapeworm like. As the vtw_t entries
218 } vtw_t; typedef in typeref:struct:vtw_common
223 vtw_t common; /* must be first */
233 vtw_t common; /* must be first */
252 vtw_t *v; /* common *
    [all...]
tcp_vtw.c 412 vtw_alive(const vtw_t *vtw)
440 vtw_index(vtw_ctl_t *ctl, vtw_t *vtw)
456 static inline vtw_t *
492 static inline vtw_t *
493 vtw_next(vtw_ctl_t *ctl, vtw_t *vtw)
514 vtw_unhash(vtw_ctl_t *ctl, vtw_t *vtw)
676 vtw_del(vtw_ctl_t *ctl, vtw_t *vtw)
705 vtw_inshash_v4(vtw_ctl_t *ctl, vtw_t *vtw)
744 vtw_inshash_v6(vtw_ctl_t *ctl, vtw_t *vtw)
772 static vtw_t *
    [all...]

Completed in 28 milliseconds