Home
last modified time | relevance | path

Searched full:last (Results 1 – 25 of 4835) sorted by relevance

12345678910>>...194

/linux/net/netfilter/
H A Dnft_last.c17 struct nft_last *last; member
29 struct nft_last *last; in nft_last_init() local
33 last = kzalloc_obj(*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 …]
H A Dnft_set_pipapo_avx2.c142 * @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 …]
/linux/arch/xtensa/kernel/
H A Dvmlinux.lds.S233 #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 …]
/linux/drivers/vhost/
H A Diotlb.c17 #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 …]
/linux/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.c43 #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 …]
H A Dusnic_uiom_interval_tree.h43 unsigned long last; member
58 unsigned long last);
62 unsigned long last);
65 unsigned long start, unsigned long last);
67 * Inserts {start...last} into {root}. If there are overlaps,
71 unsigned long start, unsigned long last,
74 * Removed {start...last} from {root}. The nodes removed are returned in
79 unsigned long start, unsigned long last,
82 * Returns {start...last} - {root} (relative complement of {start...last} in
86 unsigned long last, int flags,
/linux/fs/xfs/scrub/
H A Dbitmap.c27 /* Last set bit of this interval. */
30 /* Last set bit of this subtree. Do not touch this. */
37 #define LAST(node) ((node)->bn_last) macro
51 uint64_t last);
55 uint64_t last);
58 __bn_subtree_last, START, LAST, static inline __maybe_unused, in INTERVAL_TREE_DEFINE() argument
78 uint64_t last = start + len - 1; local
80 while ((bn = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last))) {
81 if (bn->bn_start < start && bn->bn_last > last) {
94 new_bn->bn_start = last + 1;
[all …]
/linux/arch/mips/include/uapi/asm/
H A Dmsgbuf.h19 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 …]
/linux/include/linux/
H A Dinterval_tree_generic.h18 * 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 …]
/linux/tools/include/linux/
H A Dinterval_tree_generic.h18 * 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 …]
/linux/rust/syn/
H A Dpunctuated.rs51 last: Option<Box<T>>, field
59 last: None, in new()
66 self.inner.len() == 0 && self.last.is_none() in is_empty()
74 self.inner.len() + if self.last.is_some() { 1 } else { 0 } in len()
87 /// Borrows the last element in this sequence.
88 pub fn last(&self) -> Option<&T> { in last() method
92 /// Mutably borrows the last element in this sequence.
102 self.last.as_deref() in get()
114 self.last.as_deref_mut() in get_mut()
125 last: self.last.as_ref().map(Box::as_ref).into_iter(), in iter()
[all …]
/linux/drivers/video/fbdev/core/
H A Dfb_copyarea.h54 unsigned long first, last; in fb_copy_aligned_fwd() local
57 last = ~fb_pixel_mask(end & (BITS_PER_LONG-1), reverse); in fb_copy_aligned_fwd()
62 last = last ? (last & first) : first; in fb_copy_aligned_fwd()
65 if (last == ~0UL) in fb_copy_aligned_fwd()
68 fb_copy_offset_masked(last, 0, dst, src); in fb_copy_aligned_fwd()
90 if (last) in fb_copy_aligned_fwd()
91 fb_copy_offset_masked(last, offset, dst, src); in fb_copy_aligned_fwd()
100 unsigned long first, last; in fb_copy_aligned_rev() local
103 last = ~fb_pixel_mask(end & (BITS_PER_LONG-1), reverse); in fb_copy_aligned_rev()
107 if (last) in fb_copy_aligned_rev()
[all …]
/linux/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_svm.c78 svm_range_check_vm(struct kfd_process *p, uint64_t start, uint64_t last,
96 prange, prange->start, prange->last); in svm_range_unlink()
105 if (prange->it_node.start != 0 && prange->it_node.last != 0) in svm_range_unlink()
113 prange, prange->start, prange->last); in svm_range_add_notifier_locked()
132 prange, prange->start, prange->last); in svm_range_add_to_svms()
136 prange->it_node.last = prange->last; in svm_range_add_to_svms()
145 prange->notifier.interval_tree.last >> PAGE_SHIFT); in svm_range_remove_notifier()
148 prange->notifier.interval_tree.last != 0) in svm_range_remove_notifier()
282 uint64_t size = (prange->last - prange->start + 1) << PAGE_SHIFT; in svm_range_free()
287 prange->start, prange->last); in svm_range_free()
[all …]
/linux/kernel/bpf/
H A Drange_tree.c107 #define LAST(node) ((node)->rn_last) macro
110 __rn_subtree_last, START, LAST, in INTERVAL_TREE_DEFINE() argument
130 range_it_iter_first(struct range_tree *rt, u32 start, u32 last) in range_it_iter_first() argument
132 return __range_it_iter_first(&rt->it_root, start, last); in range_it_iter_first()
138 u32 last = start + len - 1; in range_tree_clear() local
142 while ((rn = range_it_iter_first(rt, start, last))) { in range_tree_clear()
143 if (rn->rn_start < start && rn->rn_last > last) { in range_tree_clear()
156 new_rn->rn_start = last + 1; in range_tree_clear()
164 } else if (rn->rn_last > last) { in range_tree_clear()
167 rn->rn_start = last in range_tree_clear()
181 u32 last = start + len - 1; is_range_tree_set() local
194 u32 last = start + len - 1; range_tree_set() local
[all...]
/linux/tools/perf/util/
H A Dordered-events.c20 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 …]
/linux/lib/
H A Dinterval_tree_test.c33 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search() argument
38 for (node = interval_tree_iter_first(root, start, last); node; in search()
39 node = interval_tree_iter_next(node, start, last)) in search()
53 nodes[i].last = b; in init()
111 unsigned long last = search_all ? max_endpoint : queries[j]; in search_check() local
113 results += search(&root, start, last); in search_check()
133 unsigned long start, last; in intersection_range_check() local
164 last = ULONG_MAX; in intersection_range_check()
166 last = (prandom_u32_state(&rnd) >> 4) % max_endpoint; in intersection_range_check()
167 start = (prandom_u32_state(&rnd) >> 4) % last; in intersection_range_check()
[all …]
H A Dinterval_tree.c8 #define LAST(node) ((node)->last) macro
12 START, LAST,, interval_tree)
23 * span of nodes. This makes nodes[0]->last the end of that contiguous used span
27 * next used span. A hole span is between nodes[0]->last and nodes[1]->start.
30 * nodes[0]->last and last_index.
41 if (cur->last > state->nodes[0]->last) in interval_tree_span_iter_next_gap()
45 } while (cur && (state->nodes[0]->last >= cur->start || in interval_tree_span_iter_next_gap()
46 state->nodes[0]->last + 1 == cur->start)); in interval_tree_span_iter_next_gap()
80 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_first()
98 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_next()
[all …]
/linux/drivers/gpu/drm/xe/
H A Dxe_range_fence.c14 #define XE_RANGE_TREE_LAST(_node) ((_node)->last)
49 * @last: last address of range fence
57 u64 start, u64 last, struct dma_fence *fence) in xe_range_fence_insert() argument
68 rfence->last = last; in xe_range_fence_insert()
129 * @last: last address of range fence
135 u64 last) in xe_range_fence_tree_first() argument
137 return xe_range_fence_tree_iter_first(&tree->root, start, last); in xe_range_fence_tree_first()
144 * @last: last address of range fence
149 xe_range_fence_tree_next(struct xe_range_fence *rfence, u64 start, u64 last) in xe_range_fence_tree_next() argument
151 return xe_range_fence_tree_iter_next(rfence, start, last); in xe_range_fence_tree_next()
/linux/arch/mips/sibyte/common/
H A Dcfe_console.c16 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()
/linux/drivers/crypto/marvell/cesa/
H A Dtdma.c44 engine->chain_sw.last = NULL; in mv_cesa_dma_step()
47 engine->chain_hw.last = dreq->chain.last; in mv_cesa_dma_step()
85 dreq->chain.last = NULL; in mv_cesa_dma_cleanup()
108 struct mv_cesa_tdma_desc *last = engine->chain_sw.last; in mv_cesa_tdma_chain() local
114 if (!last || dreq->chain.first->flags & CESA_TDMA_SET_STATE) in mv_cesa_tdma_chain()
117 last->next = dreq->chain.first; in mv_cesa_tdma_chain()
118 last->next_dma = cpu_to_le32(dreq->chain.first->cur_dma); in mv_cesa_tdma_chain()
120 last = dreq->chain.last; in mv_cesa_tdma_chain()
121 engine->chain_sw.last = last; in mv_cesa_tdma_chain()
124 * the last element of the current chain. in mv_cesa_tdma_chain()
[all …]
/linux/include/net/
H A Dnl802154.h182 /* keep last */
235 /* keep last */
275 /* keep last */
304 /* keep last */
323 /* keep last */
350 /* keep last */
366 /* keep last */
388 /* keep last */
399 /* keep last */
414 /* keep last */
[all …]
/linux/scripts/
H A Ddecode_stacktrace.sh269 # We need to know the index of the last element before we
271 local last=$(( ${#words[@]} - 1 ))
286 if [[ ${words[$last]} =~ \([A-Z]*\) ]]; then
287 info_str=${words[$last]}
288 unset words[$last] spaces[$last]
289 last=$(( $last - 1 ))
294 if [[ ${words[$last]} =~ ^[0-9a-f]+\] ]]; then
295 words[$last-1]="${words[$last-1]} ${words[$last]}"
296 unset words[$last] spaces[$last]
297 last=$(( $last - 1 ))
[all …]
/linux/io_uring/
H A Dslist.h28 list->last = node; in wq_list_add_after()
36 list->last = node; in wq_list_add_tail()
39 list->last->next = node; in wq_list_add_tail()
40 list->last = node; in wq_list_add_tail()
45 struct io_wq_work_node *last, in wq_list_cut() argument
50 WRITE_ONCE(list->first, last->next); in wq_list_cut()
52 prev->next = last->next; in wq_list_cut()
54 if (last == list->last) in wq_list_cut()
55 list->last = prev; in wq_list_cut()
56 last->next = NULL; in wq_list_cut()
/linux/tools/testing/selftests/vfio/lib/
H A Diova_allocator.c58 iova_t iova, last; in iova_allocator_alloc() local
67 if (check_add_overflow(iova, size - 1, &last) || in iova_allocator_alloc()
68 last > range->last) in iova_allocator_alloc()
72 iova = last & ~(size - 1); in iova_allocator_alloc()
75 if (check_add_overflow(iova, size - 1, &last) || in iova_allocator_alloc()
76 last > range->last) in iova_allocator_alloc()
79 if (last == range->last) { in iova_allocator_alloc()
83 allocator->range_offset = last - range->start + 1; in iova_allocator_alloc()
/linux/include/trace/events/
H A Dmaple_tree.h24 __field(unsigned long, last)
33 __entry->last = mas->last;
43 (unsigned long) __entry->last
57 __field(unsigned long, last)
66 __entry->last = mas->last;
76 (unsigned long) __entry->last
92 __field(unsigned long, last)
103 __entry->last = mas->last;
115 (unsigned long) __entry->last,

12345678910>>...194