| /kernel/linux/linux-6.6/net/netfilter/ |
| D | nft_last.c | 17 struct nft_last *last; member
29 struct nft_last *last; in nft_last_init() local
33 last = kzalloc(sizeof(*last), GFP_KERNEL_ACCOUNT); in nft_last_init()
34 if (!last) in nft_last_init()
38 last->set = ntohl(nla_get_be32(tb[NFTA_LAST_SET])); in nft_last_init()
40 if (last->set && tb[NFTA_LAST_MSECS]) { in nft_last_init()
45 last->jiffies = jiffies - (unsigned long)last_jiffies; in nft_last_init()
47 priv->last = last; in nft_last_init()
51 kfree(last); in nft_last_init()
60 struct nft_last *last = priv->last; in nft_last_eval() local
[all …]
|
| D | nft_set_pipapo_avx2.c | 142 * @last: Return index of first set bit, if this is the last field
150 * Return: first set bit index if @last, index of first filled word otherwise.
154 union nft_pipapo_map_bucket *mt, bool last) in nft_pipapo_avx2_refill() argument
164 if (last) \ in nft_pipapo_avx2_refill()
193 * @last: Last field: stop at the first match and return bit index
211 * Return: -1 on no match, rule index of match if @last, otherwise first long
217 bool first, bool last) in nft_pipapo_avx2_lookup_4b_2() argument
243 b = nft_pipapo_avx2_refill(i_ul, &map[i_ul], fill, f->mt, last); in nft_pipapo_avx2_lookup_4b_2()
244 if (last) in nft_pipapo_avx2_lookup_4b_2()
268 * @last: Last field: stop at the first match and return bit index
[all …]
|
| /kernel/linux/linux-5.10/drivers/mfd/ |
| D | ab8500-debugfs.c | 108 * @last: the last address of the range
113 u8 last; member
165 .last = 0x02,
169 .last = 0x42,
173 .last = 0x81,
182 .last = 0x0D,
186 .last = 0x17,
190 .last = 0x30,
194 .last = 0x33,
203 .last = 0x00,
[all …]
|
| /kernel/linux/linux-6.6/arch/xtensa/kernel/ |
| D | vmlinux.lds.S | 233 #undef LAST
234 #define LAST .dummy macro
243 LAST)
244 #undef LAST
245 #define LAST .WindowVectors.text macro
250 LAST)
251 #undef LAST
252 #define LAST .DebugInterruptVector.text macro
257 LAST)
258 # undef LAST
[all …]
|
| /kernel/linux/linux-6.6/drivers/vhost/ |
| D | iotlb.c | 17 #define LAST(map) ((map)->last) macro
21 START, LAST, static inline, vhost_iotlb_itree);
42 * @last: last of IOVA range
47 * Returns an error last is smaller than start or memory allocation
51 u64 start, u64 last, in vhost_iotlb_add_range_ctx() argument
57 if (last < start) in vhost_iotlb_add_range_ctx()
63 if (start == 0 && last == ULONG_MAX) { in vhost_iotlb_add_range_ctx()
64 u64 mid = last / 2; in vhost_iotlb_add_range_ctx()
87 map->size = last - start + 1; in vhost_iotlb_add_range_ctx()
88 map->last = last; in vhost_iotlb_add_range_ctx()
[all …]
|
| /kernel/linux/linux-5.10/drivers/vhost/ |
| D | iotlb.c | 17 #define LAST(map) ((map)->last) macro
21 START, LAST, static inline, vhost_iotlb_itree);
42 * @last: last of IOVA range
46 * Returns an error last is smaller than start or memory allocation
50 u64 start, u64 last, in vhost_iotlb_add_range() argument
55 if (last < start) in vhost_iotlb_add_range()
70 map->size = last - start + 1; in vhost_iotlb_add_range()
71 map->last = last; in vhost_iotlb_add_range()
89 * @last: last of IOVA range
91 void vhost_iotlb_del_range(struct vhost_iotlb *iotlb, u64 start, u64 last) in vhost_iotlb_del_range() argument
[all …]
|
| /kernel/linux/linux-5.10/arch/xtensa/kernel/ |
| D | vmlinux.lds.S | 226 #undef LAST
227 #define LAST .dummy macro
240 #undef LAST
241 #define LAST .DebugInterruptVector.text macro
246 LAST)
247 # undef LAST
248 # define LAST .Level2InterruptVector.text macro
254 LAST)
255 # undef LAST
256 # define LAST .Level3InterruptVector.text macro
[all …]
|
| /kernel/linux/linux-5.10/drivers/infiniband/hw/usnic/ |
| D | usnic_uiom_interval_tree.c | 43 #define LAST(node) ((node)->last) macro
70 usnic_uiom_interval_node_alloc(long int start, long int last, int ref_cnt, in usnic_uiom_interval_node_alloc() argument
79 interval->last = last; in usnic_uiom_interval_node_alloc()
105 unsigned long start, unsigned long last, in find_intervals_intersection_sorted() argument
112 for (node = usnic_uiom_interval_tree_iter_first(root, start, last); in find_intervals_intersection_sorted()
114 node = usnic_uiom_interval_tree_iter_next(node, start, last)) in find_intervals_intersection_sorted()
120 int usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last, in usnic_uiom_get_intervals_diff() argument
132 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_get_intervals_diff()
148 if (pivot > interval->last) { in usnic_uiom_get_intervals_diff()
150 } else if (pivot <= interval->last && in usnic_uiom_get_intervals_diff()
[all …]
|
| /kernel/linux/linux-6.6/drivers/infiniband/hw/usnic/ |
| D | usnic_uiom_interval_tree.c | 43 #define LAST(node) ((node)->last) macro
70 usnic_uiom_interval_node_alloc(long int start, long int last, int ref_cnt, in usnic_uiom_interval_node_alloc() argument
79 interval->last = last; in usnic_uiom_interval_node_alloc()
105 unsigned long start, unsigned long last, in find_intervals_intersection_sorted() argument
112 for (node = usnic_uiom_interval_tree_iter_first(root, start, last); in find_intervals_intersection_sorted()
114 node = usnic_uiom_interval_tree_iter_next(node, start, last)) in find_intervals_intersection_sorted()
120 int usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last, in usnic_uiom_get_intervals_diff() argument
132 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_get_intervals_diff()
148 if (pivot > interval->last) { in usnic_uiom_get_intervals_diff()
150 } else if (pivot <= interval->last && in usnic_uiom_get_intervals_diff()
[all …]
|
| /kernel/linux/linux-6.6/arch/mips/include/uapi/asm/ |
| D | msgbuf.h | 19 long msg_stime; /* last msgsnd time */
20 long msg_rtime; /* last msgrcv time */
21 long msg_ctime; /* last change time */
25 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
26 __kernel_pid_t msg_lrpid; /* last receive pid */
34 unsigned long msg_stime; /* last msgsnd time */
36 unsigned long msg_rtime; /* last msgrcv time */
38 unsigned long msg_ctime; /* last change time */
42 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
43 __kernel_pid_t msg_lrpid; /* last receive pid */
[all …]
|
| /kernel/linux/linux-5.10/arch/mips/include/uapi/asm/ |
| D | msgbuf.h | 19 long msg_stime; /* last msgsnd time */
20 long msg_rtime; /* last msgrcv time */
21 long msg_ctime; /* last change time */
25 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
26 __kernel_pid_t msg_lrpid; /* last receive pid */
34 unsigned long msg_stime; /* last msgsnd time */
36 unsigned long msg_rtime; /* last msgrcv time */
38 unsigned long msg_ctime; /* last change time */
42 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
43 __kernel_pid_t msg_lrpid; /* last receive pid */
[all …]
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | interval_tree_generic.h | 18 * ITSUBTREE: name of ITTYPE field within ITSTRUCT holding last-in-subtree
20 * ITLAST(n): last endpoint of ITSTRUCT node n
42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
49 if (parent->ITSUBTREE < last) \
50 parent->ITSUBTREE = last; \
59 node->ITSUBTREE = last; \
72 * Iterate over intervals intersecting [start;last] \
74 * Note that a node's interval intersects [start;last] iff: \
75 * Cond1: ITSTART(node) <= last \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
[all …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | interval_tree_generic.h | 18 * ITSUBTREE: name of ITTYPE field within ITSTRUCT holding last-in-subtree
20 * ITLAST(n): last endpoint of ITSTRUCT node n
42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
49 if (parent->ITSUBTREE < last) \
50 parent->ITSUBTREE = last; \
59 node->ITSUBTREE = last; \
72 * Iterate over intervals intersecting [start;last] \
74 * Note that a node's interval intersects [start;last] iff: \
75 * Cond1: ITSTART(node) <= last \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
[all …]
|
| /kernel/linux/linux-6.6/tools/include/linux/ |
| D | interval_tree_generic.h | 18 * ITSUBTREE: name of ITTYPE field within ITSTRUCT holding last-in-subtree
20 * ITLAST(n): last endpoint of ITSTRUCT node n
42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
49 if (parent->ITSUBTREE < last) \
50 parent->ITSUBTREE = last; \
59 node->ITSUBTREE = last; \
72 * Iterate over intervals intersecting [start;last] \
74 * Note that a node's interval intersects [start;last] iff: \
75 * Cond1: ITSTART(node) <= last \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
[all …]
|
| /kernel/linux/linux-6.6/arch/um/kernel/ |
| D | tlb.c | 125 struct host_vm_op *last; in add_mmap() local
133 last = &hvc->ops[hvc->index - 1]; in add_mmap()
134 if ((last->type == MMAP) && in add_mmap()
135 (last->u.mmap.addr + last->u.mmap.len == virt) && in add_mmap()
136 (last->u.mmap.prot == prot) && (last->u.mmap.fd == fd) && in add_mmap()
137 (last->u.mmap.offset + last->u.mmap.len == offset)) { in add_mmap()
138 last->u.mmap.len += len; in add_mmap()
162 struct host_vm_op *last; in add_munmap() local
166 last = &hvc->ops[hvc->index - 1]; in add_munmap()
167 if ((last->type == MUNMAP) && in add_munmap()
[all …]
|
| /kernel/linux/linux-5.10/arch/um/kernel/ |
| D | tlb.c | 125 struct host_vm_op *last; in add_mmap() local
136 last = &hvc->ops[hvc->index - 1]; in add_mmap()
137 if ((last->type == MMAP) && in add_mmap()
138 (last->u.mmap.addr + last->u.mmap.len == virt) && in add_mmap()
139 (last->u.mmap.prot == prot) && (last->u.mmap.fd == fd) && in add_mmap()
140 (last->u.mmap.offset + last->u.mmap.len == offset)) { in add_mmap()
141 last->u.mmap.len += len; in add_mmap()
165 struct host_vm_op *last; in add_munmap() local
172 last = &hvc->ops[hvc->index - 1]; in add_munmap()
173 if ((last->type == MUNMAP) && in add_munmap()
[all …]
|
| /kernel/linux/linux-6.6/io_uring/ |
| D | slist.h | 30 list->last = node; in wq_list_add_after()
38 list->last = node; in wq_list_add_tail()
41 list->last->next = node; in wq_list_add_tail()
42 list->last = node; in wq_list_add_tail()
51 list->last = node; in wq_list_add_head()
56 struct io_wq_work_node *last, in wq_list_cut() argument
61 WRITE_ONCE(list->first, last->next); in wq_list_cut()
63 prev->next = last->next; in wq_list_cut()
65 if (last == list->last) in wq_list_cut()
66 list->last = prev; in wq_list_cut()
[all …]
|
| /kernel/linux/linux-6.6/arch/mips/sibyte/common/ |
| D | cfe_console.c | 16 int i, last, written; in cfe_console_write() local
18 for (i=0, last=0; i<count; i++) { in cfe_console_write()
24 written = cfe_write(cfe_cons_handle, &str[last], i-last); in cfe_console_write()
27 last += written; in cfe_console_write()
28 } while (last < i); in cfe_console_write()
33 if (last != count) { in cfe_console_write()
35 written = cfe_write(cfe_cons_handle, &str[last], count-last); in cfe_console_write()
38 last += written; in cfe_console_write()
39 } while (last < count); in cfe_console_write()
|
| /kernel/linux/linux-5.10/arch/mips/sibyte/common/ |
| D | cfe_console.c | 16 int i, last, written; in cfe_console_write() local
18 for (i=0, last=0; i<count; i++) { in cfe_console_write()
24 written = cfe_write(cfe_cons_handle, &str[last], i-last); in cfe_console_write()
27 last += written; in cfe_console_write()
28 } while (last < i); in cfe_console_write()
33 if (last != count) { in cfe_console_write()
35 written = cfe_write(cfe_cons_handle, &str[last], count-last); in cfe_console_write()
38 last += written; in cfe_console_write()
39 } while (last < count); in cfe_console_write()
|
| /kernel/linux/linux-5.10/drivers/video/fbdev/core/ |
| D | sysfillrect.c | 28 unsigned long first, last; in bitfill_aligned() local
34 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_aligned()
38 if (last) in bitfill_aligned()
39 first &= last; in bitfill_aligned()
67 if (last) in bitfill_aligned()
68 *dst = comp(pat, *dst, last); in bitfill_aligned()
84 unsigned long first, last; in bitfill_unaligned() local
90 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_unaligned()
94 if (last) in bitfill_unaligned()
95 first &= last; in bitfill_unaligned()
[all …]
|
| /kernel/linux/linux-6.6/drivers/video/fbdev/core/ |
| D | sysfillrect.c | 28 unsigned long first, last; in bitfill_aligned() local
34 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_aligned()
38 if (last) in bitfill_aligned()
39 first &= last; in bitfill_aligned()
57 if (last) in bitfill_aligned()
58 *dst = comp(pat, *dst, last); in bitfill_aligned()
74 unsigned long first, last; in bitfill_unaligned() local
80 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_unaligned()
84 if (last) in bitfill_unaligned()
85 first &= last; in bitfill_unaligned()
[all …]
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | ordered-events.c | 20 struct ordered_event *last = oe->last; in queue_event() local
25 oe->last = new; in queue_event()
29 if (!last) { in queue_event()
36 * last event might point to some random place in the list as it's in queue_event()
37 * the last queued event. We expect that the new event is close to in queue_event()
40 if (last->timestamp <= timestamp) { in queue_event()
41 while (last->timestamp <= timestamp) { in queue_event()
42 p = last->list.next; in queue_event()
48 last = list_entry(p, struct ordered_event, list); in queue_event()
50 list_add_tail(&new->list, &last->list); in queue_event()
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| D | ordered-events.c | 20 struct ordered_event *last = oe->last; in queue_event() local
25 oe->last = new; in queue_event()
29 if (!last) { in queue_event()
36 * last event might point to some random place in the list as it's in queue_event()
37 * the last queued event. We expect that the new event is close to in queue_event()
40 if (last->timestamp <= timestamp) { in queue_event()
41 while (last->timestamp <= timestamp) { in queue_event()
42 p = last->list.next; in queue_event()
48 last = list_entry(p, struct ordered_event, list); in queue_event()
50 list_add_tail(&new->list, &last->list); in queue_event()
[all …]
|
| /kernel/linux/linux-5.10/io_uring/ |
| D | io-wq.h | 29 struct io_wq_work_node *last; member
41 list->last = node; in wq_list_add_after()
49 list->last = node; in wq_list_add_tail()
52 list->last->next = node; in wq_list_add_tail()
53 list->last = node; in wq_list_add_tail()
58 struct io_wq_work_node *last, in wq_list_cut() argument
63 WRITE_ONCE(list->first, last->next); in wq_list_cut()
65 prev->next = last->next; in wq_list_cut()
67 if (last == list->last) in wq_list_cut()
68 list->last = prev; in wq_list_cut()
[all …]
|
| /kernel/linux/linux-5.10/net/netfilter/ |
| D | nft_set_pipapo_avx2.c | 143 * @last: Return index of first set bit, if this is the last field
151 * Return: first set bit index if @last, index of first filled word otherwise.
155 union nft_pipapo_map_bucket *mt, bool last) in nft_pipapo_avx2_refill() argument
165 if (last) \ in nft_pipapo_avx2_refill()
194 * @last: Last field: stop at the first match and return bit index
212 * Return: -1 on no match, rule index of match if @last, otherwise first long
217 const u8 *pkt, bool first, bool last) in nft_pipapo_avx2_lookup_4b_2() argument
243 b = nft_pipapo_avx2_refill(i_ul, &map[i_ul], fill, f->mt, last); in nft_pipapo_avx2_lookup_4b_2()
244 if (last) in nft_pipapo_avx2_lookup_4b_2()
268 * @last: Last field: stop at the first match and return bit index
[all …]
|