/linux-master/include/linux/ |
H A D | rbtree_latch.h | 51 * @less: used for insertion; provides the (partial) order between two elements. 56 * comp(a->key,b) < 0 := less(a,b) 57 * comp(a->key,b) > 0 := less(b,a) 58 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a) 65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b); member in struct:latch_tree_ops 77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) 89 if (less(ltn, ltp)) 149 __lt_insert(node, root, 0, ops->less); 151 __lt_insert(node, root, 1, ops->less); [all...] |
H A D | min_heap.h | 24 * @less: Partial order function for this heap. 29 bool (*less)(const void *lhs, const void *rhs); member in struct:min_heap_callbacks 49 i = func->less(left, right) ? i * 2 + 1 : i * 2 + 2; 57 while (i != pos && func->less(root, data + i * func->elem_size)) 130 if (func->less(parent, child))
|
H A D | rbtree.h | 144 * comp(a->key,b) < 0 := less(a,b) 145 * comp(a->key,b) > 0 := less(b,a) 146 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a) 160 * @less: operator defining the (partial) node order 166 bool (*less)(struct rb_node *, const struct rb_node *)) 174 if (less(node, parent)) { 192 * @less: operator defining the (partial) node order 196 bool (*less)(struct rb_node *, const struct rb_node *)) 203 if (less(nod [all...] |
H A D | rbtree_augmented.h | 65 bool (*less)(struct rb_node *, const struct rb_node *), 74 if (less(node, parent)) {
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | rbtree.c | 24 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) function 53 bpf_rbtree_add(&groot, &n->node, less); 54 bpf_rbtree_add(&groot, &m->node, less); 63 bpf_rbtree_add(&groot, &n->node, less); 91 bpf_rbtree_add(&groot, &n->node, less); 92 bpf_rbtree_add(&groot, &m->node, less); 137 bpf_rbtree_add(&groot, &n->node, less); 138 bpf_rbtree_add(&groot, &m->node, less); 139 bpf_rbtree_add(&groot, &o->node, less); 193 bpf_rbtree_add(&groot, &n->node, less); [all...] |
H A D | rbtree_fail.c | 20 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) function 41 bpf_rbtree_add(&groot, &n->node, less); 56 bpf_rbtree_add(&groot, &n->node, less); 89 bpf_rbtree_add(&groot, &n->node, less); 146 bpf_rbtree_add(&groot, &n->node, less); 149 bpf_rbtree_add(&groot2, &n->node, less); 171 bpf_rbtree_add(&groot, res, less); 191 bpf_rbtree_add(&groot, &n->node, less); 237 bpf_rbtree_add(&groot, &node_a->node, less);
|
H A D | refcounted_kptr_fail.c | 23 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) function 45 bpf_rbtree_add(&groot, &n->node, less); 90 bpf_rbtree_add(&groot, &n->node, less); 111 bpf_rbtree_add(&groot, &n->node, less);
|
H A D | refcounted_kptr.c | 51 static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b) function 88 if (bpf_rbtree_add(root, &n->r, less)) { 131 if (bpf_rbtree_add(root, &m->r, less)) { 468 bpf_rbtree_add(&broot, &n->r, less); 518 bpf_rbtree_add(&root, &n->r, less); 552 bpf_rbtree_add(&root, &n->r, less);
|
H A D | local_kptr_stash.c | 75 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) function 158 bpf_rbtree_add(&res->r, &n->node, less);
|
/linux-master/lib/ |
H A D | test_min_heap.c | 73 .less = min_heap ? less_than : greater_than, 106 .less = min_heap ? less_than : greater_than, 139 .less = min_heap ? less_than : greater_than,
|
/linux-master/tools/include/linux/ |
H A D | rbtree.h | 159 * comp(a->key,b) < 0 := less(a,b) 160 * comp(a->key,b) > 0 := less(b,a) 161 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a) 175 * @less: operator defining the (partial) node order 179 bool (*less)(struct rb_node *, const struct rb_node *)) 187 if (less(node, parent)) { 203 * @less: operator defining the (partial) node order 207 bool (*less)(struct rb_node *, const struct rb_node *)) 214 if (less(nod [all...] |
/linux-master/net/tipc/ |
H A D | core.h | 195 static inline int less(u16 left, u16 right) function 202 return !less(val, min) && !more(val, max);
|
H A D | link.c | 1221 if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr))) 1395 if (unlikely(less(seqno, l->drop_point))) { 1477 } else if (unlikely(less(seqno, expect))) { 1667 if (less(acked, start)) { 1670 } else if (less(acked, end)) { 1801 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) { 2158 return !less(session, curr_session); 2171 return !less(msg_seqno(hdr), l->rcv_nxt_state); 2258 if (less(l->session, msg_dest_session(hdr))) 2405 /* Compatibility: accept older, less saf [all...] |
/linux-master/kernel/module/ |
H A D | tree_lookup.c | 60 .less = mod_tree_less,
|
/linux-master/tools/testing/selftests/bpf/ |
H A D | bpf_experimental.h | 111 * Add 'node' to rbtree with root 'root' using comparator 'less' 120 bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b), 124 #define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0)
|
/linux-master/arch/x86/crypto/ |
H A D | ghash-clmulni-intel_asm.S | 64 # carry-less multiplication
|
H A D | crc32c-pcl-intel-asm_64.S | 113 ## If len is less than 8 and we're unaligned, we need to jump 257 # len is less than 8 if we got here
|
H A D | crct10dif-pcl-asm_64.S | 101 # For sizes less than 256 bytes, we can't fold 128 bytes at a time.
|
/linux-master/crypto/ |
H A D | algif_aead.c | 165 * less buffer space, only use the relative required input size. This 171 size_t less = outlen - usedpages; local 173 if (used < less) { 177 used -= less; 178 outlen -= less;
|
/linux-master/arch/mips/cavium-octeon/ |
H A D | octeon-memcpy.S | 228 # Jump here if there are less than 16*NBYTES left. 256 # Jump here if there are less than 8*NBYTES left. 275 # Jump here if there are less than 4*NBYTES left. This means
|
/linux-master/arch/alpha/lib/ |
H A D | memchr.S | 67 ldq_u $6, -1($5) #-e1 : eight or less bytes to search
|
H A D | ev6-memchr.S | 65 ldq_u $6, -1($5) # L : L U U L : eight or less bytes to search Latency=3
|
/linux-master/arch/m68k/fpsp040/ |
H A D | res_func.S | 709 blt fix_stk |if less, not wrap case 748 blt fix_stk |if less, not wrap case 813 blt fix_stk |if less, not wrap case 822 blt fix_stk |if less, not wrap case 988 blt fix_stk |if less, not wrap case 997 blt fix_stk |if less, not wrap case 1169 blt fix_stk |if less, not wrap case 1180 blt fix_stk |if less, not wrap case
|
H A D | bindec.S | 87 | or less than LEN -1 digits, adjust ILOG and repeat from 608 | or less than LEN -1 digits, adjust ILOG and repeat from 679 fblt A14_st |if less, all is ok, go to A14 759 subil #0x3ffd,%d0 |sub bias less 2 to make fract
|
H A D | sint.S | 149 | Input is less than zero. Restore sign, and check for directed
|