Home
last modified time | relevance | path

Searched refs:less (Results 1 - 25 of 81) sorted by relevance

1234

/kernel/linux/linux-6.6/tools/testing/selftests/bpf/progs/
H A Drbtree.c24 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
53 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
54 bpf_rbtree_add(&groot, &m->node, less); in __add_three()
63 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
91 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
92 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
137 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
138 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
139 bpf_rbtree_add(&groot, &o->node, less); in rbtree_first_and_remove()
193 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_release_aliasing()
[all...]
H A Drbtree_fail.c20 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
41 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_add()
56 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_remove()
89 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_remove_unadded_node()
146 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_to_multiple_trees()
149 bpf_rbtree_add(&groot2, &n->node, less); in rbtree_api_add_to_multiple_trees()
171 bpf_rbtree_add(&groot, res, less); in rbtree_api_use_unchecked_remove_retval()
191 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_release_unlock_escape()
237 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
H A Drefcounted_kptr_fail.c23 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
45 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes()
71 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
92 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()
H A Drefcounted_kptr.c51 static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b) in less() function
88 if (bpf_rbtree_add(root, &n->r, less)) { in __insert_in_tree_and_list()
131 if (bpf_rbtree_add(root, &m->r, less)) { in __stash_map_insert_tree()
468 bpf_rbtree_add(&broot, &n->r, less); in rbtree_wrong_owner_remove_fail_b()
518 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
552 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
/kernel/linux/linux-5.10/include/linux/
H A Drbtree_latch.h51 * @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
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
89 if (less(ltn, ltp)) in __lt_insert()
149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()
151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
[all...]
H A Dmin_heap.h24 * @less: Partial order function for this heap.
29 bool (*less)(const void *lhs, const void *rhs); member
48 if (func->less(left, smallest)) in min_heapify()
53 if (func->less(right, smallest)) in min_heapify()
128 if (func->less(parent, child)) in min_heap_push()
/kernel/linux/linux-6.6/include/linux/
H A Drbtree_latch.h51 * @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
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
89 if (less(ltn, ltp)) in __lt_insert()
149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()
151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
[all...]
H A Dmin_heap.h24 * @less: Partial order function for this heap.
29 bool (*less)(const void *lhs, const void *rhs); member
48 if (func->less(left, smallest)) in min_heapify()
53 if (func->less(right, smallest)) in min_heapify()
128 if (func->less(parent, child)) in min_heap_push()
H A Drbtree.h144 * 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 *)) in rb_add_cached()
174 if (less(node, parent)) { in rb_add_cached()
192 * @less: operator defining the (partial) node order
196 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
203 if (less(nod in rb_add()
[all...]
H A Drbtree_augmented.h65 bool (*less)(struct rb_node *, const struct rb_node *), in rb_add_augmented_cached()
74 if (less(node, parent)) { in rb_add_augmented_cached()
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/
H A Dbpf_experimental.h111 * 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)
/kernel/linux/linux-5.10/arch/nds32/lib/
H A Dmemmove.S29 andi $r2, $r2, #3 ! How many bytes are less than a word
31 beqz $p1, byte_cpy ! When n is less than a word
44 andi $r2, $r2, #3 ! How many bytes are less than a word
46 beqz $p1, reverse_byte_cpy ! When n is less than a word
H A Dclear_user.S21 andi $r1, $r1, #3 ! Bytes less than a word to copy
22 beqz $p0, byte_clear ! Only less than a word to clear
H A Dmemset.S11 andi $r2, $r2, 3 ! How many bytes are less than a word
12 beqz $p1, byte_set ! When n is less than a word
/kernel/linux/linux-6.6/tools/include/linux/
H A Drbtree.h159 * 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 *)) in rb_add_cached()
187 if (less(node, parent)) { in rb_add_cached()
203 * @less: operator defining the (partial) node order
207 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
214 if (less(nod in rb_add()
[all...]
/kernel/linux/linux-5.10/lib/
H A Dtest_min_heap.c73 .less = min_heap ? less_than : greater_than, in test_heapify_all()
106 .less = min_heap ? less_than : greater_than, in test_heap_push()
139 .less = min_heap ? less_than : greater_than, in test_heap_pop_push()
/kernel/linux/linux-6.6/lib/
H A Dtest_min_heap.c73 .less = min_heap ? less_than : greater_than, in test_heapify_all()
106 .less = min_heap ? less_than : greater_than, in test_heap_push()
139 .less = min_heap ? less_than : greater_than, in test_heap_pop_push()
/kernel/linux/linux-5.10/net/tipc/
H A Dcore.h197 static inline int less(u16 left, u16 right) in less() function
204 return !less(val, min) && !more(val, max); in in_range()
H A Dlink.c1201 if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr))) in link_retransmit_failure()
1374 if (unlikely(less(seqno, l->drop_point))) { in tipc_link_tnl_rcv()
1456 } else if (unlikely(less(seqno, expect))) { in __tipc_build_gap_ack_blks()
1646 if (less(acked, start)) { in tipc_link_advance_transmq()
1649 } else if (less(acked, end)) { in tipc_link_advance_transmq()
1780 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) { in tipc_link_rcv()
2137 return !less(session, curr_session); in tipc_link_validate_msg()
2150 return !less(msg_seqno(hdr), l->rcv_nxt_state); in tipc_link_validate_msg()
2237 if (less(l->session, msg_dest_session(hdr))) in tipc_link_proto_rcv()
2384 /* Compatibility: accept older, less saf in tipc_link_bc_init_rcv()
[all...]
/kernel/linux/linux-6.6/net/tipc/
H A Dcore.h195 static inline int less(u16 left, u16 right) in less() function
202 return !less(val, min) && !more(val, max); in tipc_in_range()
H A Dlink.c1236 if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr))) in link_retransmit_failure()
1410 if (unlikely(less(seqno, l->drop_point))) { in tipc_link_tnl_rcv()
1492 } else if (unlikely(less(seqno, expect))) { in __tipc_build_gap_ack_blks()
1682 if (less(acked, start)) { in tipc_link_advance_transmq()
1685 } else if (less(acked, end)) { in tipc_link_advance_transmq()
1816 if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) { in tipc_link_rcv()
2173 return !less(session, curr_session); in tipc_link_validate_msg()
2186 return !less(msg_seqno(hdr), l->rcv_nxt_state); in tipc_link_validate_msg()
2273 if (less(l->session, msg_dest_session(hdr))) in tipc_link_proto_rcv()
2420 /* Compatibility: accept older, less saf in tipc_link_bc_init_rcv()
[all...]
/kernel/linux/linux-5.10/crypto/
H A Dalgif_aead.c165 * less buffer space, only use the relative required input size. This in _aead_recvmsg()
171 size_t less = outlen - usedpages; in _aead_recvmsg() local
173 if (used < less) { in _aead_recvmsg()
177 used -= less; in _aead_recvmsg()
178 outlen -= less; in _aead_recvmsg()
/kernel/linux/linux-6.6/crypto/
H A Dalgif_aead.c165 * less buffer space, only use the relative required input size. This in _aead_recvmsg()
171 size_t less = outlen - usedpages; in _aead_recvmsg() local
173 if (used < less) { in _aead_recvmsg()
177 used -= less; in _aead_recvmsg()
178 outlen -= less; in _aead_recvmsg()
/kernel/linux/linux-6.6/kernel/module/
H A Dtree_lookup.c60 .less = mod_tree_less,
/kernel/linux/linux-5.10/arch/x86/crypto/
H A Dghash-clmulni-intel_asm.S7 * http://software.intel.com/en-us/articles/carry-less-multiplication-and-its-usage-for-computing-the-gcm-mode/
64 # carry-less multiplication

Completed in 16 milliseconds

1234