Symbol: less
crypto/algif_aead.c
145
size_t less = outlen - usedpages;
crypto/algif_aead.c
147
if (used < less) {
crypto/algif_aead.c
151
used -= less;
crypto/algif_aead.c
152
outlen -= less;
drivers/crypto/chelsio/chcr_algo.c
138
unsigned int less;
drivers/crypto/chelsio/chcr_algo.c
153
less = min(reqlen, sg_dma_len(sg) - skip_len);
drivers/crypto/chelsio/chcr_algo.c
154
nents += DIV_ROUND_UP(less, entlen);
drivers/crypto/chelsio/chcr_algo.c
155
reqlen -= less;
drivers/crypto/chelsio/chcr_algo.c
616
int offset = 0, soffset = 0, less, sless = 0;
drivers/crypto/chelsio/chcr_algo.c
638
less = min_t(unsigned int, sg_dma_len(dst) - offset -
drivers/crypto/chelsio/chcr_algo.c
640
dstlen += less;
drivers/crypto/chelsio/chcr_algo.c
641
offset += less;
drivers/md/dm-vdo/repair.c
168
.less = mapping_is_less_than,
drivers/md/dm-vdo/slab-depot.c
3391
.less = slab_status_is_less_than,
include/linux/min_heap.h
273
b = func->less(data + c, data + d, args) ? c : d;
include/linux/min_heap.h
280
while (b != a && func->less(data + a, data + b, args))
include/linux/min_heap.h
311
if (func->less(data + b, data + a, args))
include/linux/min_heap.h
48
bool (*less)(const void *lhs, const void *rhs, void *args);
include/linux/rbtree.h
194
bool (*less)(struct rb_node *, const struct rb_node *))
include/linux/rbtree.h
202
if (less(node, parent)) {
include/linux/rbtree.h
224
bool (*less)(struct rb_node *, const struct rb_node *))
include/linux/rbtree.h
231
if (less(node, parent))
include/linux/rbtree_augmented.h
65
bool (*less)(struct rb_node *, const struct rb_node *),
include/linux/rbtree_augmented.h
74
if (less(node, parent)) {
include/linux/rbtree_latch.h
149
__lt_insert(node, root, 0, ops->less);
include/linux/rbtree_latch.h
151
__lt_insert(node, root, 1, ops->less);
include/linux/rbtree_latch.h
65
bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b);
include/linux/rbtree_latch.h
77
bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b))
include/linux/rbtree_latch.h
89
if (less(ltn, ltp))
kernel/bpf/core.c
631
.less = bpf_tree_less,
kernel/bpf/helpers.c
2506
void *less, struct btf_record *rec, u64 off)
kernel/bpf/helpers.c
2510
bpf_callback_t cb = (bpf_callback_t)less;
kernel/bpf/helpers.c
2539
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
kernel/bpf/helpers.c
2545
return __bpf_rbtree_add(root, n, (void *)less, meta ? meta->record : NULL, off);
kernel/events/core.c
3974
.less = perf_less_group_idx,
kernel/module/tree_lookup.c
60
.less = mod_tree_less,
lib/tests/min_heap_kunit.c
102
.less = params->min_heap ? less_than : greater_than,
lib/tests/min_heap_kunit.c
133
.less = params->min_heap ? less_than : greater_than,
lib/tests/min_heap_kunit.c
171
.less = params->min_heap ? less_than : greater_than,
lib/tests/min_heap_kunit.c
72
.less = params->min_heap ? less_than : greater_than,
net/tipc/core.h
202
return !less(val, min) && !more(val, max);
net/tipc/group.c
344
if (grp->bc_ackers && less(m->bc_acked, grp->bc_snd_nxt - 1))
net/tipc/group.c
483
if (!less(bc_seqno, msg_grp_bc_seqno(_hdr)))
net/tipc/group.c
521
if (less(msg_grp_bc_seqno(hdr), m->bc_rcv_nxt))
net/tipc/link.c
1212
if (link_is_bc_sndlink(l) && !less(r->acked, msg_seqno(hdr)))
net/tipc/link.c
1386
if (unlikely(less(seqno, l->drop_point))) {
net/tipc/link.c
1468
} else if (unlikely(less(seqno, expect))) {
net/tipc/link.c
1658
if (less(acked, start)) {
net/tipc/link.c
1661
} else if (less(acked, end)) {
net/tipc/link.c
1792
if (unlikely(less(seqno, rcv_nxt) || more(seqno, win_lim))) {
net/tipc/link.c
2150
return !less(session, curr_session);
net/tipc/link.c
2163
return !less(msg_seqno(hdr), l->rcv_nxt_state);
net/tipc/link.c
2250
if (less(l->session, msg_dest_session(hdr)))
net/tipc/link.c
2478
if (less(acked, r->acked) || (acked == r->acked && !gap && !ga))
net/tipc/link.c
2523
if (more(peers_snd_nxt, l->rcv_nxt) && !less(l->rcv_nxt, from))
net/tipc/msg.c
828
if (skb_queue_empty(list) || less(seqno, buf_seqno(skb_peek(list)))) {
net/tipc/name_distr.c
347
if (less(seqno, *rcv_nxt)) {
net/tipc/node.c
1991
if ((usr != LINK_PROTOCOL) && less(oseqno, rcv_nxt))
net/tipc/node.c
2015
if (less(syncpt, n->sync_point))
tools/include/linux/rbtree.h
179
bool (*less)(struct rb_node *, const struct rb_node *))
tools/include/linux/rbtree.h
187
if (less(node, parent)) {
tools/include/linux/rbtree.h
207
bool (*less)(struct rb_node *, const struct rb_node *))
tools/include/linux/rbtree.h
214
if (less(node, parent))
tools/sched_ext/include/scx/common.bpf.h
323
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
tools/sched_ext/include/scx/common.bpf.h
325
#define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0)
tools/testing/selftests/bpf/bpf_experimental.h
120
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
tools/testing/selftests/bpf/bpf_experimental.h
124
#define bpf_rbtree_add(head, node, less) bpf_rbtree_add_impl(head, node, less, NULL, 0)
tools/testing/selftests/bpf/progs/local_kptr_stash.c
176
bpf_rbtree_add(&res->r, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
109
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
110
bpf_rbtree_add(&groot, &m->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
151
bpf_rbtree_add(&groot_array[i], &nodes[i][j]->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
153
bpf_rbtree_add(&groot_array_one[0], &nodes[2][j]->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
214
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
215
bpf_rbtree_add(&groot, &m->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
216
bpf_rbtree_add(&groot, &o->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
270
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
36
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
tools/testing/selftests/bpf/progs/rbtree.c
65
bpf_rbtree_add(root, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
66
bpf_rbtree_add(root, &m->node, less);
tools/testing/selftests/bpf/progs/rbtree.c
75
bpf_rbtree_add(root, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
147
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
150
bpf_rbtree_add(&groot2, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
172
bpf_rbtree_add(&groot, res, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
192
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
20
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
tools/testing/selftests/bpf/progs/rbtree_fail.c
238
bpf_rbtree_add(&groot, &node_a->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
41
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
56
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/rbtree_fail.c
89
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/refcounted_kptr.c
131
if (bpf_rbtree_add(root, &m->r, less)) {
tools/testing/selftests/bpf/progs/refcounted_kptr.c
468
bpf_rbtree_add(&broot, &n->r, less);
tools/testing/selftests/bpf/progs/refcounted_kptr.c
51
static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b)
tools/testing/selftests/bpf/progs/refcounted_kptr.c
518
bpf_rbtree_add(&root, &n->r, less);
tools/testing/selftests/bpf/progs/refcounted_kptr.c
552
bpf_rbtree_add(&root, &n->r, less);
tools/testing/selftests/bpf/progs/refcounted_kptr.c
88
if (bpf_rbtree_add(root, &n->r, less)) {
tools/testing/selftests/bpf/progs/refcounted_kptr_fail.c
111
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/refcounted_kptr_fail.c
23
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
tools/testing/selftests/bpf/progs/refcounted_kptr_fail.c
45
bpf_rbtree_add(&groot, &n->node, less);
tools/testing/selftests/bpf/progs/refcounted_kptr_fail.c
90
bpf_rbtree_add(&groot, &n->node, less);