Searched refs:rt (Results 1 - 25 of 84) sorted by relevance

1234

/illumos-gate/usr/src/uts/common/fs/zfs/
H A Drange_tree.c54 range_tree_stat_verify(range_tree_t *rt) argument
60 for (rs = avl_first(&rt->rt_root); rs != NULL;
61 rs = AVL_NEXT(&rt->rt_root, rs)) {
70 if (hist[i] != rt->rt_histogram[i]) {
72 i, hist, hist[i], rt->rt_histogram[i]);
74 VERIFY3U(hist[i], ==, rt->rt_histogram[i]);
79 range_tree_stat_incr(range_tree_t *rt, range_seg_t *rs) argument
86 sizeof (rt->rt_histogram) / sizeof (*rt->rt_histogram));
88 ASSERT(MUTEX_HELD(rt
94 range_tree_stat_decr(range_tree_t *rt, range_seg_t *rs) argument
133 range_tree_t *rt; local
151 range_tree_destroy(range_tree_t *rt) argument
165 range_tree_t *rt = arg; local
240 range_tree_t *rt = arg; local
304 range_tree_find_impl(range_tree_t *rt, uint64_t start, uint64_t size) argument
319 range_tree_find(range_tree_t *rt, uint64_t start, uint64_t size) argument
328 range_tree_verify(range_tree_t *rt, uint64_t off, uint64_t size) argument
340 range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size) argument
350 range_tree_clear(range_tree_t *rt, uint64_t start, uint64_t size) argument
364 range_tree_t *rt; local
376 range_tree_vacate(range_tree_t *rt, range_tree_func_t *func, void *arg) argument
397 range_tree_walk(range_tree_t *rt, range_tree_func_t *func, void *arg) argument
408 range_tree_space(range_tree_t *rt) argument
[all...]
H A Dspace_reftree.c116 space_reftree_add_map(avl_tree_t *t, range_tree_t *rt, int64_t refcnt) argument
120 ASSERT(MUTEX_HELD(rt->rt_lock));
122 for (rs = avl_first(&rt->rt_root); rs; rs = AVL_NEXT(&rt->rt_root, rs))
131 space_reftree_generate_map(avl_tree_t *t, range_tree_t *rt, int64_t minref) argument
137 ASSERT(MUTEX_HELD(rt->rt_lock));
139 range_tree_vacate(rt, NULL, NULL);
152 range_tree_add(rt, start, end - start);
H A Dspace_map.c56 space_map_load(space_map_t *sm, range_tree_t *rt, maptype_t maptype) argument
67 VERIFY0(range_tree_space(rt));
70 range_tree_add(rt, sm->sm_start, sm->sm_size);
117 VERIFY3U(range_tree_space(rt) + size, <=,
119 range_tree_add(rt, offset, size);
121 range_tree_remove(rt, offset, size);
127 VERIFY3U(range_tree_space(rt), ==, space);
129 range_tree_vacate(rt, NULL, NULL);
145 space_map_histogram_verify(space_map_t *sm, range_tree_t *rt) argument
152 if (rt
159 space_map_histogram_add(space_map_t *sm, range_tree_t *rt, dmu_tx_t *tx) argument
210 space_map_entries(space_map_t *sm, range_tree_t *rt) argument
236 space_map_write(space_map_t *sm, range_tree_t *rt, maptype_t maptype, dmu_tx_t *tx) argument
[all...]
/illumos-gate/usr/src/uts/common/io/hxge/
H A Dhpi.c70 hpi_rtrace_buf_init(rtrace_t *rt) argument
74 rt->next_idx = 0;
75 rt->last_idx = MAX_RTRACE_ENTRIES - 1;
76 rt->wrapped = B_FALSE;
78 rt->buf[i].ctl_addr = TRACE_CTL_INVALID;
79 rt->buf[i].val_l32 = 0;
80 rt->buf[i].val_h32 = 0;
85 hpi_rtrace_update(hpi_handle_t handle, boolean_t wr, rtrace_t *rt, argument
89 idx = rt->next_idx;
91 rt
[all...]
/illumos-gate/usr/src/uts/common/io/nxge/npi/
H A Dnpi.c73 npi_rtrace_buf_init(rtrace_t *rt) argument
77 rt->next_idx = 0;
78 rt->last_idx = MAX_RTRACE_ENTRIES - 1;
79 rt->wrapped = B_FALSE;
81 rt->buf[i].ctl_addr = TRACE_CTL_INVALID;
82 rt->buf[i].val_l32 = 0;
83 rt->buf[i].val_h32 = 0;
88 npi_rtrace_update(npi_handle_t handle, boolean_t wr, rtrace_t *rt, argument
92 idx = rt->next_idx;
94 rt
112 npi_trace_update(npi_handle_t handle, boolean_t wr, rtrace_t *rt, const char *name, uint32_t addr, uint64_t val) argument
147 npi_trace_dump( rtrace_t *rt, int count) argument
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/in.ripngd/
H A Dtables.c106 log_single(int level, struct rt_entry *rt) argument
111 (void) inet_ntop(AF_INET6, (void *)&rt->rt_dst, buf1, sizeof (buf1));
112 (void) inet_ntop(AF_INET6, (void *)&rt->rt_router, buf2, sizeof (buf2));
116 (rt->rt_ifp != NULL && rt->rt_ifp->int_name != NULL) ?
117 rt->rt_ifp->int_name : "(noname)",
118 rt->rt_metric);
180 struct rt_entry *rt; local
191 for (rt = rh->rt_forw; rt !
237 struct rt_entry *rt; local
325 rtchange(struct rt_entry *rt, struct in6_addr *gate, short metric, struct interface *ifp) argument
423 rtdown(struct rt_entry *rt) argument
448 rtdelete(struct rt_entry *rt) argument
475 struct rt_entry *rt; local
506 struct rt_entry *rt; local
527 rtdumpentry(FILE *fp, struct rt_entry *rt) argument
596 struct rt_entry *rt; local
[all...]
H A Dtimer.c54 struct rt_entry *rt; local
107 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh;
108 rt = rt->rt_forw) {
114 rt->rt_state &= ~RTS_CHANGED;
115 if ((rt->rt_state & RTS_INTERFACE) != 0)
117 rt->rt_timer += alarmtime;
118 if (rt->rt_timer >= GARBAGE_TIME) {
119 rt
161 struct rt_entry *rt; local
[all...]
H A Doutput.c136 struct rt_entry *rt; local
157 for (rt = rh->rt_forw; rt != (struct rt_entry *)rh;
158 rt = rt->rt_forw) {
160 if (IN6_IS_ADDR_LINKLOCAL(&rt->rt_dst))
162 if (IN6_IS_ADDR_UNSPECIFIED(&rt->rt_dst))
166 if (rt->rt_state & RTS_PRIVATE)
173 if (splith && rt->rt_ifp != NULL &&
175 rt
[all...]
H A Dtrace.c140 traceaction(FILE *fp, char *action, struct rt_entry *rt) argument
169 if (rt != NULL) {
173 inet_ntop(AF_INET6, (void *)&rt->rt_dst, buf1,
175 rt->rt_prefix_length);
177 inet_ntop(AF_INET6, (void *)&rt->rt_router, buf1,
179 rt->rt_metric);
180 if (rt->rt_ifp != NULL) {
182 (rt->rt_ifp->int_name != NULL) ?
183 rt->rt_ifp->int_name : "(noname)");
188 if ((rt
[all...]
H A Dinput.c131 struct rt_entry *rt; local
243 rt = rtlookup(&prefix, n->rip6_prefix_length);
245 n->rip6_metric = (rt == NULL ?
247 min(rt->rt_metric, HOPCNT_INFINITY));
430 rt = rtlookup(&prefix, n->rip6_prefix_length);
431 if (rt == NULL) {
448 rt->rt_metric == HOPCNT_INFINITY)
465 if (IN6_ARE_ADDR_EQUAL(gate, &rt->rt_router)) {
466 if (n->rip6_metric != rt->rt_metric ||
467 rt
[all...]
/illumos-gate/usr/src/uts/common/fs/zfs/sys/
H A Drange_tree.h67 void (*rtop_create)(range_tree_t *rt, void *arg);
68 void (*rtop_destroy)(range_tree_t *rt, void *arg);
69 void (*rtop_add)(range_tree_t *rt, range_seg_t *rs, void *arg);
70 void (*rtop_remove)(range_tree_t *rt, range_seg_t *rs, void *arg);
71 void (*rtop_vacate)(range_tree_t *rt, void *arg);
79 void range_tree_destroy(range_tree_t *rt);
80 boolean_t range_tree_contains(range_tree_t *rt, uint64_t start, uint64_t size);
81 uint64_t range_tree_space(range_tree_t *rt);
82 void range_tree_verify(range_tree_t *rt, uint64_t start, uint64_t size);
84 void range_tree_stat_verify(range_tree_t *rt);
[all...]
H A Dspace_reftree.h49 void space_reftree_add_map(avl_tree_t *t, range_tree_t *rt, int64_t refcnt);
50 void space_reftree_generate_map(avl_tree_t *t, range_tree_t *rt,
H A Dspace_map.h136 int space_map_load(space_map_t *sm, range_tree_t *rt, maptype_t maptype);
139 void space_map_histogram_add(space_map_t *sm, range_tree_t *rt,
148 void space_map_write(space_map_t *sm, range_tree_t *rt, maptype_t maptype,
/illumos-gate/usr/src/cmd/cron/
H A Datt1.y43 extern struct tm *tp, at, rt;
157 rt.tm_mday++;
176 rt.tm_mday = $1 - tp->tm_wday;
177 if (rt.tm_mday < 0)
178 rt.tm_mday += 7;
180 rt.tm_mday += 1;
189 rt.tm_min += $1;
192 rt.tm_hour += $1;
195 rt.tm_mday += $1;
198 rt
[all...]
/illumos-gate/usr/src/uts/common/io/ath/
H A Dath_rate.c76 const HAL_RATE_TABLE *rt = asc->asc_currates; local
79 ASSERT(rt != NULL);
84 an->an_tx_mgtrate = rt->info[0].rateCode;
85 an->an_tx_mgtratesp = an->an_tx_mgtrate | rt->info[0].shortPreamble;
100 an->an_tx_rate0 = rt->info[an->an_tx_rix0].rateCode;
102 rt->info[an->an_tx_rix0].shortPreamble;
115 an->an_tx_rate1 = rt->info[rix].rateCode;
117 rt->info[rix].shortPreamble;
124 an->an_tx_rate2 = rt->info[rix].rateCode;
126 rt
306 const HAL_RATE_TABLE *rt; local
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dtrace.c870 trace_upslot(struct rt_entry *rt, argument
887 (int)(rts - rt->rt_spares),
888 rtname(rt->rt_dst, rt->rt_mask, rts->rts_gate));
890 (rts != rt->rt_spares ||
891 AGE_RT(rt->rt_state, rts->rts_origin, new->rts_ifp)));
895 (int)(rts - rt->rt_spares),
896 rtname(rt->rt_dst, rt->rt_mask, rts->rts_gate));
900 rts != rt
979 trace_change(struct rt_entry *rt, uint16_t state, struct rt_spare *new, const char *label) argument
1025 trace_add_del(const char *action, struct rt_entry *rt) argument
[all...]
H A Dinput.c163 struct rt_entry *rt; local
394 (rt = rtget(RIP_DEFAULT, 0)))
396 (rt->rt_metric + 1));
453 rt = rtget(dst, mask);
454 if (rt == NULL && dst != RIP_DEFAULT)
455 rt = rtfind(n->n_dst);
459 if (rt == NULL) {
469 v12buf.n->n_metric = rt->rt_metric + 1;
473 v12buf.n->n_tag = rt->rt_tag;
475 on_net(rt
1066 struct rt_entry *rt; local
[all...]
H A Dtable.c1021 struct rt_entry *rt; local
1033 rt = rtget(k->k_dst, k->k_mask);
1038 if (rt != NULL) {
1039 if ((rt->rt_state & RS_STATIC) == 0) {
1050 rt_state |= rt->rt_state;
1051 if (rt->rt_state != rt_state)
1052 rtchange(rt, rt_state, &new, 0);
1247 struct rt_entry *rt; local
1257 rt = rtfind(S_ADDR(INFO_DST(info)));
1258 if (rt !
2181 struct rt_entry *rt; local
2280 struct rt_entry *rt; local
2307 struct rt_entry *rt; local
2362 rtchange(struct rt_entry *rt, uint16_t state, struct rt_spare *new, char *label) argument
2414 rts_better(struct rt_entry *rt) argument
2432 rtswitch(struct rt_entry *rt, struct rt_spare *rts) argument
2466 rtdelete(struct rt_entry *rt) argument
2506 rts_delete(struct rt_entry *rt, struct rt_spare *rts) argument
2530 rtbad(struct rt_entry *rt, struct interface *badifp) argument
2570 rtbad_sub(struct rt_entry *rt, struct interface *badifp) argument
[all...]
H A Drdisc.c356 struct rt_entry *rt; local
396 rt = rtget(RIP_DEFAULT, 0);
403 if (rt == NULL) {
421 rt = rtget(RIP_DEFAULT, 0);
422 if (rt == NULL) {
515 struct rt_entry *rt; local
522 rt = rtget(RIP_DEFAULT, 0);
523 if (rt == NULL) {
526 for (i = 0; i < rt->rt_num_spares; i++) {
527 if ((rt
577 struct rt_entry *rt; local
[all...]
H A Dif.c748 struct rt_entry *rt; local
754 rt = rtfind(ifp->int_addr);
755 if (rt != NULL &&
756 rt->rt_ifp != NULL &&
757 on_net(ifp->int_addr, rt->rt_ifp->int_net, rt->rt_ifp->int_mask)) {
1032 struct rt_entry *rt; local
1646 rt = rtget(myaddr, HOST_MASK);
1647 if (rt != NULL) {
1648 if (rt
1770 struct rt_entry *rt; local
1819 struct rt_entry *rt; local
[all...]
/illumos-gate/usr/src/lib/libast/common/string/
H A Dfmtfs.c63 struct stat rt; local
80 while ((mnt = mntread(mp)) && (stat(mnt->dir, &rt) || rt.st_dev != st->st_dev));
/illumos-gate/usr/src/lib/libc/port/locale/
H A Diswctype.c65 unsigned int rt; local
68 rt = __runetype(loc->runelocale, c);
70 rt = loc->runelocale->__runetype[c];
71 return (rt & f);
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/snoop/
H A Dsnoop_solarnet.c88 Rec_type rt; local
218 rt = getxdr_enum();
219 if (rt == REC_TYPE_NORM) {
231 } else if (rt == REC_TYPE_EOR) {
234 } while (rt != REC_TYPE_EOF);
275 rt = getxdr_enum();
276 if (rt == REC_TYPE_NORM) {
288 } else if (rt == REC_TYPE_EOR) {
291 } while (rt != REC_TYPE_EOF);
/illumos-gate/usr/src/uts/common/inet/ip/
H A Dip_mroute.c280 #define MFCFIND(mfcbp, o, g, rt) { \
282 rt = NULL; \
289 rt = _mb_rt; \
439 struct mfc *rt; local
444 MFCFIND(mfcbp, req->src.s_addr, req->grp.s_addr, rt);
446 if (rt != NULL) {
447 mutex_enter(&rt->mfc_mutex);
448 req->pktcnt = rt->mfc_pkt_cnt;
449 req->bytecnt = rt->mfc_byte_cnt;
450 req->wrong_if = rt
752 struct mfc *rt; local
1162 struct mfc *rt; local
1359 fill_route(struct mfc *rt, struct mfcctl *mfccp, ip_stack_t *ipst) argument
1438 struct mfc *rt; local
1532 struct mfc *rt; local
1975 ip_mdq(mblk_t *mp, ipha_t *ipha, ill_t *ill, ipaddr_t tunnel_src, struct mfc *rt) argument
2771 struct mfc *rt; local
3355 struct mfc *rt; local
[all...]
/illumos-gate/usr/src/cmd/priocntl/
H A DMakefile31 OBJS= $(PRIOCNTLOBJ) rt$(PROG).o ts$(PROG).o ia$(PROG).o fss$(PROG).o \
95 $(RTPROG): rt$(PRIOCNTLOBJ)
96 $(LINK.c) rt$(PRIOCNTLOBJ) -o $@ $(LDLIBS)
136 $(LINT.c) rt$(PRIOCNTLSRC) $(LDLIBS)

Completed in 126 milliseconds

1234