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

  /src/sbin/routed/
defs.h 214 } rt_spares[NUM_SPARES]; member in struct:rt_entry
220 #define rt_ifp rt_spares[0].rts_ifp
221 #define rt_gate rt_spares[0].rts_gate
222 #define rt_router rt_spares[0].rts_router
223 #define rt_metric rt_spares[0].rts_metric
224 #define rt_tag rt_spares[0].rts_tag
225 #define rt_time rt_spares[0].rts_time
226 #define rt_de_ag rt_spares[0].rts_de_ag
trace.c 687 (int)(rts - rt->rt_spares),
690 (rts != rt->rt_spares
695 (int)(rts - rt->rt_spares),
700 rts != rt->rt_spares || AGE_RT(rt->rt_state,
712 && (rts != rt->rt_spares
717 (int)(rts - rt->rt_spares),
720 (rts != rt->rt_spares
802 print_rts(rt->rt_spares,
833 print_rts(rt->rt_spares, 0,0,0,0,AGE_RT(rt->rt_state,rt->rt_ifp));
850 print_rts(&RT->rt_spares[0], 0,0,0,0, AGE_RT(RT->rt_state, RT->rt_ifp))
    [all...]
table.c 1730 for (rts = rt->rt_spares, i = NUM_SPARES; i != 0; i--, rts++)
1748 rt->rt_spares[0] = *new;
1810 rt->rt_spares[0] = *new;
1823 rts = rt->rt_spares+1;
1853 if (!BETTER_LINK(rt, rts, rt->rt_spares))
1856 swap = rt->rt_spares[0];
1858 (int)(rts - rt->rt_spares));
1913 new = rt->rt_spares[0];
1980 struct rt_spare new = rt->rt_spares[0];
2005 rts = RT->rt_spares;
    [all...]
input.c 845 rts0 = rt->rt_spares;
852 if (rts0 == rt->rt_spares
output.c 613 for (rts = RT->rt_spares, i = NUM_SPARES; i != 0; i--, rts++) {
634 || RT->rt_spares[1].rts_gate == 0) {
rdisc.c 522 new = rt->rt_spares[0];

Completed in 16 milliseconds