Searched refs:right (Results 1 - 6 of 6) sorted by relevance
/net/tipc/ |
H A D | link.h | 264 static inline int less_eq(u32 left, u32 right) argument 266 return mod(right - left) < 32768u; 269 static inline int less(u32 left, u32 right) argument 271 return less_eq(left, right) && (mod(right) != mod(left)); 274 static inline u32 lesser(u32 left, u32 right) argument 276 return less_eq(left, right) ? left : right;
|
/net/ipv6/ |
H A D | ip6_fib.c | 480 fn = dir ? fn->right : fn->left; 514 pn->right = ln; 575 pn->right = in; 587 in->right = ln; 591 in->right = fn; 613 pn->right = ln; 618 ln->right = fn; 1012 next = dir ? fn->right : fn->left; 1111 fn = fn->right; 1156 if (fn->right) [all...] |
/net/ipv4/ |
H A D | fib_trie.c | 730 struct tnode *left, *right; local 738 right = tnode_new(inode->key|m, inode->pos + 1, 741 if (!right) { 747 put_child(tn, 2*i+1, (struct rt_trie_node *) right); 754 struct tnode *left, *right; local 785 * ones, 'left' and 'right', each with half of the 791 * left's key and "1" in right's key. Since we are 795 * left and right. So... we synthesize that bit in the 810 right = (struct tnode *) tnode_get_child(tn, 2*i+1); 813 BUG_ON(!right); 835 struct rt_trie_node *left, *right; local [all...] |
/net/sched/ |
H A D | em_meta.c | 53 * the right, eating up any number of octets and thus supporting 876 if (TCF_META_TYPE(hdr->left.kind) != TCF_META_TYPE(hdr->right.kind) || 879 TCF_META_ID(hdr->right.kind) > TCF_META_ID_MAX) 889 memcpy(&meta->rvalue.hdr, &hdr->right, sizeof(hdr->right)); 925 memcpy(&hdr.right, &meta->rvalue.hdr, sizeof(hdr.right));
|
/net/ceph/crush/ |
H A D | mapper.c | 178 static int right(int x) function 207 /* descend to the left or right? */ 212 n = right(n);
|
/net/netfilter/ |
H A D | x_tables.c | 461 int mid, left = 0, right = xt[af].cur - 1; local 463 while (left <= right) { 464 mid = (left + right) >> 1; 468 right = mid - 1;
|
Completed in 152 milliseconds