/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/reiserfs/ |
H A D | do_balan.c | 24 static inline void buffer_info_init_left(struct tree_balance *tb, argument 27 bi->tb = tb; 28 bi->bi_bh = tb->L[0]; 29 bi->bi_parent = tb->FL[0]; 30 bi->bi_position = get_left_neighbor_position(tb, 0); 33 static inline void buffer_info_init_right(struct tree_balance *tb, argument 36 bi->tb = tb; 37 bi->bi_bh = tb 42 buffer_info_init_tbS0(struct tree_balance *tb, struct buffer_info *bi) argument 51 buffer_info_init_bh(struct tree_balance *tb, struct buffer_info *bi, struct buffer_head *bh) argument 61 do_balance_mark_leaf_dirty(struct tree_balance *tb, struct buffer_head *bh, int flag) argument 101 balance_leaf_when_delete(struct tree_balance *tb, int flag) argument 271 balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr ) argument 1652 get_FEB(struct tree_balance *tb) argument 1676 store_thrown(struct tree_balance *tb, struct buffer_head *bh) argument 1693 free_thrown(struct tree_balance *tb) argument 1711 reiserfs_invalidate_buffer(struct tree_balance *tb, struct buffer_head *bh) argument 1723 replace_key(struct tree_balance *tb, struct buffer_head *dest, int n_dest, struct buffer_head *src, int n_src) argument 1750 get_left_neighbor_position(struct tree_balance *tb, int h) argument 1764 get_right_neighbor_position(struct tree_balance *tb, int h) argument 1807 locked_or_not_in_tree(struct tree_balance *tb, struct buffer_head *bh, char *which) argument 1818 check_before_balancing(struct tree_balance *tb) argument 1851 check_after_balance_leaf(struct tree_balance *tb) argument 1899 check_leaf_level(struct tree_balance *tb) argument 1906 check_internal_levels(struct tree_balance *tb) argument 1957 do_balance_starts(struct tree_balance *tb) argument 1973 do_balance_completed(struct tree_balance *tb) argument 1995 do_balance(struct tree_balance *tb, struct item_head *ih, const char *body, int flag) argument [all...] |
H A D | ibalance.c | 25 struct tree_balance *tb, 36 src_bi->tb = tb; 37 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); 38 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); 39 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); 40 dest_bi->tb = tb; 41 dest_bi->bi_bh = tb->L[h]; 42 dest_bi->bi_parent = tb 24 internal_define_dest_src_infos(int shift_mode, struct tree_balance *tb, int h, struct buffer_info *dest_bi, struct buffer_info *src_bi, int *d_key, struct buffer_head **cf) argument 462 internal_shift_left(int mode, struct tree_balance *tb, int h, int pointer_amount) argument 500 internal_shift1_left(struct tree_balance *tb, int h, int pointer_amount) argument 526 internal_shift_right(int mode, struct tree_balance *tb, int h, int pointer_amount) argument 567 internal_shift1_right(struct tree_balance *tb, int h, int pointer_amount) argument 589 balance_internal_when_delete(struct tree_balance *tb, int h, int child_pos) argument 711 replace_lkey(struct tree_balance *tb, int h, struct item_head *key) argument 726 replace_rkey(struct tree_balance *tb, int h, struct item_head *key) argument 740 balance_internal(struct tree_balance *tb, int h, int child_pos, struct item_head *insert_key, struct buffer_head **insert_ptr ) argument [all...] |
H A D | fix_node.c | 78 static void create_virtual_node(struct tree_balance *tb, int h) argument 81 struct virtual_node *vn = tb->tb_vn; 83 struct buffer_head *Sh; /* this comes from tb->S[h] */ 85 Sh = PATH_H_PBUFFER(tb->tb_path, h); 89 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; 103 vn->vn_vi = (struct virtual_item *)(tb->tb_vn + 1); 136 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); 137 if (tb->vn_buf + tb->vn_buf_size < vn->vn_free_ptr) 138 reiserfs_panic(tb 202 check_left(struct tree_balance *tb, int h, int cur_free) argument 282 check_right(struct tree_balance *tb, int h, int cur_free) argument 365 get_num_ver(int mode, struct tree_balance *tb, int h, int from, int from_bytes, int to, int to_bytes, short *snum012, int flow) argument 584 set_parameters(struct tree_balance *tb, int h, int lnum, int rnum, int blk_num, short *s012, int lb, int rb) argument 611 is_leaf_removable(struct tree_balance *tb) argument 653 are_leaves_removable(struct tree_balance *tb, int lfree, int rfree) argument 749 free_buffers_in_tb(struct tree_balance *tb) argument 778 get_empty_nodes(struct tree_balance *tb, int h) argument 853 get_lfree(struct tree_balance *tb, int h) argument 875 get_rfree(struct tree_balance *tb, int h) argument 896 is_left_neighbor_in_cache(struct tree_balance *tb, int h) argument 954 get_far_parent(struct tree_balance *tb, int h, struct buffer_head **pfather, struct buffer_head **pcom_father, char c_lr_par) argument 1080 get_parents(struct tree_balance *tb, int h) argument 1169 can_node_be_removed(int mode, int lfree, int sfree, int rfree, struct tree_balance *tb, int h) argument 1218 ip_check_balance(struct tree_balance *tb, int h) argument 1561 dc_check_balance_internal(struct tree_balance *tb, int h) argument 1741 dc_check_balance_leaf(struct tree_balance *tb, int h) argument 1835 dc_check_balance(struct tree_balance *tb, int h) argument 1864 check_balance(int mode, struct tree_balance *tb, int h, int inum, int pos_in_item, struct item_head *ins_ih, const void *data) argument 1893 get_direct_parent(struct tree_balance *tb, int h) argument 1947 get_neighbors(struct tree_balance *tb, int h) argument 2057 get_mem_for_virtual_node(struct tree_balance *tb) argument 2154 wait_tb_buffers_until_unlocked(struct tree_balance *tb) argument 2329 fix_nodes(int op_mode, struct tree_balance *tb, struct item_head *ins_ih, const void *data) argument 2549 unfix_nodes(struct tree_balance *tb) argument [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/reiserfs/ |
H A D | do_balan.c | 24 static inline void buffer_info_init_left(struct tree_balance *tb, argument 27 bi->tb = tb; 28 bi->bi_bh = tb->L[0]; 29 bi->bi_parent = tb->FL[0]; 30 bi->bi_position = get_left_neighbor_position(tb, 0); 33 static inline void buffer_info_init_right(struct tree_balance *tb, argument 36 bi->tb = tb; 37 bi->bi_bh = tb 42 buffer_info_init_tbS0(struct tree_balance *tb, struct buffer_info *bi) argument 51 buffer_info_init_bh(struct tree_balance *tb, struct buffer_info *bi, struct buffer_head *bh) argument 61 do_balance_mark_leaf_dirty(struct tree_balance *tb, struct buffer_head *bh, int flag) argument 101 balance_leaf_when_delete(struct tree_balance *tb, int flag) argument 271 balance_leaf(struct tree_balance *tb, struct item_head *ih, const char *body, int flag, struct item_head *insert_key, struct buffer_head **insert_ptr ) argument 1652 get_FEB(struct tree_balance *tb) argument 1676 store_thrown(struct tree_balance *tb, struct buffer_head *bh) argument 1693 free_thrown(struct tree_balance *tb) argument 1711 reiserfs_invalidate_buffer(struct tree_balance *tb, struct buffer_head *bh) argument 1723 replace_key(struct tree_balance *tb, struct buffer_head *dest, int n_dest, struct buffer_head *src, int n_src) argument 1750 get_left_neighbor_position(struct tree_balance *tb, int h) argument 1764 get_right_neighbor_position(struct tree_balance *tb, int h) argument 1807 locked_or_not_in_tree(struct tree_balance *tb, struct buffer_head *bh, char *which) argument 1818 check_before_balancing(struct tree_balance *tb) argument 1851 check_after_balance_leaf(struct tree_balance *tb) argument 1899 check_leaf_level(struct tree_balance *tb) argument 1906 check_internal_levels(struct tree_balance *tb) argument 1957 do_balance_starts(struct tree_balance *tb) argument 1973 do_balance_completed(struct tree_balance *tb) argument 1995 do_balance(struct tree_balance *tb, struct item_head *ih, const char *body, int flag) argument [all...] |
H A D | ibalance.c | 25 struct tree_balance *tb, 36 src_bi->tb = tb; 37 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); 38 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); 39 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); 40 dest_bi->tb = tb; 41 dest_bi->bi_bh = tb->L[h]; 42 dest_bi->bi_parent = tb 24 internal_define_dest_src_infos(int shift_mode, struct tree_balance *tb, int h, struct buffer_info *dest_bi, struct buffer_info *src_bi, int *d_key, struct buffer_head **cf) argument 462 internal_shift_left(int mode, struct tree_balance *tb, int h, int pointer_amount) argument 500 internal_shift1_left(struct tree_balance *tb, int h, int pointer_amount) argument 526 internal_shift_right(int mode, struct tree_balance *tb, int h, int pointer_amount) argument 567 internal_shift1_right(struct tree_balance *tb, int h, int pointer_amount) argument 589 balance_internal_when_delete(struct tree_balance *tb, int h, int child_pos) argument 711 replace_lkey(struct tree_balance *tb, int h, struct item_head *key) argument 726 replace_rkey(struct tree_balance *tb, int h, struct item_head *key) argument 740 balance_internal(struct tree_balance *tb, int h, int child_pos, struct item_head *insert_key, struct buffer_head **insert_ptr ) argument [all...] |
H A D | fix_node.c | 78 static void create_virtual_node(struct tree_balance *tb, int h) argument 81 struct virtual_node *vn = tb->tb_vn; 83 struct buffer_head *Sh; /* this comes from tb->S[h] */ 85 Sh = PATH_H_PBUFFER(tb->tb_path, h); 89 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; 103 vn->vn_vi = (struct virtual_item *)(tb->tb_vn + 1); 136 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); 137 if (tb->vn_buf + tb->vn_buf_size < vn->vn_free_ptr) 138 reiserfs_panic(tb 202 check_left(struct tree_balance *tb, int h, int cur_free) argument 282 check_right(struct tree_balance *tb, int h, int cur_free) argument 365 get_num_ver(int mode, struct tree_balance *tb, int h, int from, int from_bytes, int to, int to_bytes, short *snum012, int flow) argument 584 set_parameters(struct tree_balance *tb, int h, int lnum, int rnum, int blk_num, short *s012, int lb, int rb) argument 611 is_leaf_removable(struct tree_balance *tb) argument 653 are_leaves_removable(struct tree_balance *tb, int lfree, int rfree) argument 749 free_buffers_in_tb(struct tree_balance *tb) argument 778 get_empty_nodes(struct tree_balance *tb, int h) argument 853 get_lfree(struct tree_balance *tb, int h) argument 875 get_rfree(struct tree_balance *tb, int h) argument 896 is_left_neighbor_in_cache(struct tree_balance *tb, int h) argument 954 get_far_parent(struct tree_balance *tb, int h, struct buffer_head **pfather, struct buffer_head **pcom_father, char c_lr_par) argument 1080 get_parents(struct tree_balance *tb, int h) argument 1169 can_node_be_removed(int mode, int lfree, int sfree, int rfree, struct tree_balance *tb, int h) argument 1218 ip_check_balance(struct tree_balance *tb, int h) argument 1561 dc_check_balance_internal(struct tree_balance *tb, int h) argument 1741 dc_check_balance_leaf(struct tree_balance *tb, int h) argument 1835 dc_check_balance(struct tree_balance *tb, int h) argument 1864 check_balance(int mode, struct tree_balance *tb, int h, int inum, int pos_in_item, struct item_head *ins_ih, const void *data) argument 1893 get_direct_parent(struct tree_balance *tb, int h) argument 1947 get_neighbors(struct tree_balance *tb, int h) argument 2057 get_mem_for_virtual_node(struct tree_balance *tb) argument 2154 wait_tb_buffers_until_unlocked(struct tree_balance *tb) argument 2329 fix_nodes(int op_mode, struct tree_balance *tb, struct item_head *ins_ih, const void *data) argument 2549 unfix_nodes(struct tree_balance *tb) argument [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/include/linux/ |
H A D | tty_flip.h | 14 struct tty_buffer *tb = tty->buf.tail; local 15 if (tb && tb->used < tb->size) { 16 tb->flag_buf_ptr[tb->used] = flag; 17 tb->char_buf_ptr[tb->used++] = ch;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/linux/ |
H A D | tty_flip.h | 14 struct tty_buffer *tb = tty->buf.tail; local 15 if (tb && tb->used < tb->size) { 16 tb->flag_buf_ptr[tb->used] = flag; 17 tb->char_buf_ptr[tb->used++] = ch;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/net/wireless/wl12xx/ |
H A D | wl1271_testmode.c | 67 static int wl1271_tm_cmd_test(struct wl1271 *wl, struct nlattr *tb[]) argument 76 if (!tb[WL1271_TM_ATTR_DATA]) 79 buf = nla_data(tb[WL1271_TM_ATTR_DATA]); 80 buf_len = nla_len(tb[WL1271_TM_ATTR_DATA]); 82 if (tb[WL1271_TM_ATTR_ANSWER]) 83 answer = nla_get_u8(tb[WL1271_TM_ATTR_ANSWER]); 116 static int wl1271_tm_cmd_interrogate(struct wl1271 *wl, struct nlattr *tb[]) argument 125 if (!tb[WL1271_TM_ATTR_IE_ID]) 128 ie_id = nla_get_u8(tb[WL1271_TM_ATTR_IE_ID]); 156 static int wl1271_tm_cmd_configure(struct wl1271 *wl, struct nlattr *tb[]) argument 188 wl1271_tm_cmd_nvs_push(struct wl1271 *wl, struct nlattr *tb[]) argument 231 wl1271_tm_cmd_set_plt_mode(struct wl1271 *wl, struct nlattr *tb[]) argument 261 struct nlattr *tb[WL1271_TM_ATTR_MAX + 1]; local [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/net/wireless/wl12xx/ |
H A D | wl1271_testmode.c | 67 static int wl1271_tm_cmd_test(struct wl1271 *wl, struct nlattr *tb[]) argument 76 if (!tb[WL1271_TM_ATTR_DATA]) 79 buf = nla_data(tb[WL1271_TM_ATTR_DATA]); 80 buf_len = nla_len(tb[WL1271_TM_ATTR_DATA]); 82 if (tb[WL1271_TM_ATTR_ANSWER]) 83 answer = nla_get_u8(tb[WL1271_TM_ATTR_ANSWER]); 116 static int wl1271_tm_cmd_interrogate(struct wl1271 *wl, struct nlattr *tb[]) argument 125 if (!tb[WL1271_TM_ATTR_IE_ID]) 128 ie_id = nla_get_u8(tb[WL1271_TM_ATTR_IE_ID]); 156 static int wl1271_tm_cmd_configure(struct wl1271 *wl, struct nlattr *tb[]) argument 188 wl1271_tm_cmd_nvs_push(struct wl1271 *wl, struct nlattr *tb[]) argument 231 wl1271_tm_cmd_set_plt_mode(struct wl1271 *wl, struct nlattr *tb[]) argument 261 struct nlattr *tb[WL1271_TM_ATTR_MAX + 1]; local [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/iproute2/tc/ |
H A D | f_tcindex.c | 128 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 133 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 136 if (tb[TCA_TCINDEX_HASH]) { 139 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 141 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 144 if (tb[TCA_TCINDEX_MASK]) { 147 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 149 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 152 if (tb[TCA_TCINDEX_SHIFT]) { 155 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 137 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 140 memset(tb, 0, sizeof(tb)); 141 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 142 if (tb[TCA_DSMARK_MASK]) { 143 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 146 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 148 if (tb[TCA_DSMARK_VALUE]) { 149 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 152 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/iproute2-3.x/tc/ |
H A D | f_tcindex.c | 124 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 129 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 132 if (tb[TCA_TCINDEX_HASH]) { 135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 137 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 140 if (tb[TCA_TCINDEX_MASK]) { 143 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 145 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 148 if (tb[TCA_TCINDEX_SHIFT]) { 151 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 134 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 137 memset(tb, 0, sizeof(tb)); 138 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 139 if (tb[TCA_DSMARK_MASK]) { 140 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 143 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 145 if (tb[TCA_DSMARK_VALUE]) { 146 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 149 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/iproute2/tc/ |
H A D | f_tcindex.c | 128 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 133 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 136 if (tb[TCA_TCINDEX_HASH]) { 139 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 141 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 144 if (tb[TCA_TCINDEX_MASK]) { 147 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 149 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 152 if (tb[TCA_TCINDEX_SHIFT]) { 155 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 137 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 140 memset(tb, 0, sizeof(tb)); 141 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 142 if (tb[TCA_DSMARK_MASK]) { 143 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 146 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 148 if (tb[TCA_DSMARK_VALUE]) { 149 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 152 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/iproute2-3.x/tc/ |
H A D | f_tcindex.c | 124 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 129 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 132 if (tb[TCA_TCINDEX_HASH]) { 135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 137 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 140 if (tb[TCA_TCINDEX_MASK]) { 143 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 145 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 148 if (tb[TCA_TCINDEX_SHIFT]) { 151 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 134 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 137 memset(tb, 0, sizeof(tb)); 138 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 139 if (tb[TCA_DSMARK_MASK]) { 140 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 143 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 145 if (tb[TCA_DSMARK_VALUE]) { 146 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 149 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/iproute2/tc/ |
H A D | f_tcindex.c | 128 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 133 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 136 if (tb[TCA_TCINDEX_HASH]) { 139 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 141 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 144 if (tb[TCA_TCINDEX_MASK]) { 147 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 149 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 152 if (tb[TCA_TCINDEX_SHIFT]) { 155 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 137 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 140 memset(tb, 0, sizeof(tb)); 141 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 142 if (tb[TCA_DSMARK_MASK]) { 143 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 146 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 148 if (tb[TCA_DSMARK_VALUE]) { 149 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 152 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/iproute2-3.x/tc/ |
H A D | f_tcindex.c | 124 struct rtattr *tb[TCA_TCINDEX_MAX+1]; local 129 parse_rtattr_nested(tb, TCA_TCINDEX_MAX, opt); 132 if (tb[TCA_TCINDEX_HASH]) { 135 if (RTA_PAYLOAD(tb[TCA_TCINDEX_HASH]) < sizeof(hash)) 137 hash = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_HASH]); 140 if (tb[TCA_TCINDEX_MASK]) { 143 if (RTA_PAYLOAD(tb[TCA_TCINDEX_MASK]) < sizeof(mask)) 145 mask = *(__u16 *) RTA_DATA(tb[TCA_TCINDEX_MASK]); 148 if (tb[TCA_TCINDEX_SHIFT]) { 151 if (RTA_PAYLOAD(tb[TCA_TCINDEX_SHIF [all...] |
H A D | q_dsmark.c | 134 struct rtattr *tb[TCA_DSMARK_MAX+1]; local 137 memset(tb, 0, sizeof(tb)); 138 parse_rtattr(tb, TCA_DSMARK_MAX, RTA_DATA(opt), RTA_PAYLOAD(opt)); 139 if (tb[TCA_DSMARK_MASK]) { 140 if (!RTA_PAYLOAD(tb[TCA_DSMARK_MASK])) 143 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_MASK])); 145 if (tb[TCA_DSMARK_VALUE]) { 146 if (!RTA_PAYLOAD(tb[TCA_DSMARK_VALUE])) 149 *(__u8 *) RTA_DATA(tb[TCA_DSMARK_VALU [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/busybox/networking/ |
H A D | tc.c | 19 #define parse_rtattr_nested(tb, max, rta) \ 20 (parse_rtattr((tb), (max), RTA_DATA(rta), RTA_PAYLOAD(rta))) 22 /* nullifies tb on error */ 23 #define __parse_rtattr_nested_compat(tb, max, rta, len) \ 27 parse_rtattr_nested(tb, max, rta); \ 29 memset(tb, 0, sizeof(struct rtattr *) * (max + 1)); \ 32 #define parse_rtattr_nested_compat(tb, max, rta, data, len) \ 34 __parse_rtattr_nested_compat(tb, max, rta, len); }) 162 struct rtattr *tb[TCA_PRIO_MAX+1]; local 166 parse_rtattr_nested_compat(tb, TCA_PRIO_MA 187 struct rtattr *tb[TCA_CBQ_MAX+1]; local 282 struct rtattr * tb[TCA_MAX+1]; local 338 struct rtattr * tb[TCA_MAX+1]; local 406 struct rtattr * tb[TCA_MAX+1]; local [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/busybox/networking/ |
H A D | tc.c | 19 #define parse_rtattr_nested(tb, max, rta) \ 20 (parse_rtattr((tb), (max), RTA_DATA(rta), RTA_PAYLOAD(rta))) 22 /* nullifies tb on error */ 23 #define __parse_rtattr_nested_compat(tb, max, rta, len) \ 27 parse_rtattr_nested(tb, max, rta); \ 29 memset(tb, 0, sizeof(struct rtattr *) * (max + 1)); \ 32 #define parse_rtattr_nested_compat(tb, max, rta, data, len) \ 34 __parse_rtattr_nested_compat(tb, max, rta, len); }) 162 struct rtattr *tb[TCA_PRIO_MAX+1]; local 166 parse_rtattr_nested_compat(tb, TCA_PRIO_MA 187 struct rtattr *tb[TCA_CBQ_MAX+1]; local 282 struct rtattr * tb[TCA_MAX+1]; local 338 struct rtattr * tb[TCA_MAX+1]; local 406 struct rtattr * tb[TCA_MAX+1]; local [all...] |
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/busybox/networking/ |
H A D | tc.c | 19 #define parse_rtattr_nested(tb, max, rta) \ 20 (parse_rtattr((tb), (max), RTA_DATA(rta), RTA_PAYLOAD(rta))) 22 /* nullifies tb on error */ 23 #define __parse_rtattr_nested_compat(tb, max, rta, len) \ 27 parse_rtattr_nested(tb, max, rta); \ 29 memset(tb, 0, sizeof(struct rtattr *) * (max + 1)); \ 32 #define parse_rtattr_nested_compat(tb, max, rta, data, len) \ 34 __parse_rtattr_nested_compat(tb, max, rta, len); }) 162 struct rtattr *tb[TCA_PRIO_MAX+1]; local 166 parse_rtattr_nested_compat(tb, TCA_PRIO_MA 187 struct rtattr *tb[TCA_CBQ_MAX+1]; local 282 struct rtattr * tb[TCA_MAX+1]; local 338 struct rtattr * tb[TCA_MAX+1]; local 406 struct rtattr * tb[TCA_MAX+1]; local [all...] |