Home
last modified time | relevance | path

Searched refs:last (Results 1 – 25 of 1681) sorted by relevance

12345678910>>...68

/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(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 …]
H A Dnft_set_pipapo_avx2.c154 union nft_pipapo_map_bucket *mt, bool last) in nft_pipapo_avx2_refill() argument
164 if (last) \ in nft_pipapo_avx2_refill()
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()
280 bool first, bool last) in nft_pipapo_avx2_lookup_4b_4() argument
320 b = nft_pipapo_avx2_refill(i_ul, &map[i_ul], fill, f->mt, last); in nft_pipapo_avx2_lookup_4b_4()
321 if (last) in nft_pipapo_avx2_lookup_4b_4()
357 bool first, bool last) in nft_pipapo_avx2_lookup_4b_8() argument
415 b = nft_pipapo_avx2_refill(i_ul, &map[i_ul], fill, f->mt, last); in nft_pipapo_avx2_lookup_4b_8()
[all …]
/linux/drivers/infiniband/hw/usnic/
H A Dusnic_uiom_interval_tree.c43 #define LAST(node) ((node)->last)
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);
61 unsigned long start, unsigned long last);
67 unsigned long start, unsigned long last,
75 unsigned long start, unsigned long last,
82 unsigned long last, int flags,
/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/video/fbdev/core/
H A Dsysfillrect.c28 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 …]
H A Dcfbfillrect.c38 unsigned long first, last; in bitfill_aligned() local
44 last = ~fb_shifted_pixels_mask_long(p, (dst_idx+n) % bits, bswapmask); in bitfill_aligned()
48 if (last) in bitfill_aligned()
49 first &= last; in bitfill_aligned()
78 if (last) in bitfill_aligned()
79 FB_WRITEL(comp(pat, FB_READL(dst), last), dst); in bitfill_aligned()
95 unsigned long first, last; in bitfill_unaligned() local
101 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitfill_unaligned()
105 if (last) in bitfill_unaligned()
106 first &= last; in bitfill_unaligned()
[all …]
H A Dsyscopyarea.c31 unsigned long first, last; in bitcpy() local
36 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); in bitcpy()
42 if (last) in bitcpy()
43 first &= last; in bitcpy()
72 if (last) in bitcpy()
73 *dst = comp(*src, *dst, last); in bitcpy()
85 if (last) in bitcpy()
86 first &= last; in bitcpy()
159 *dst = comp(d0, *dst, last); in bitcpy()
174 unsigned long first, last; in bitcpy_rev() local
[all …]
/linux/drivers/vhost/
H A Diotlb.c17 #define LAST(map) ((map)->last)
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()
104 u64 start, u64 last, in vhost_iotlb_add_range() argument
107 return vhost_iotlb_add_range_ctx(iotlb, start, last, in vhost_iotlb_add_range()
118 void vhost_iotlb_del_range(struct vhost_iotlb *iotlb, u64 start, u64 last) in vhost_iotlb_del_range() argument
[all …]
/linux/io_uring/
H A Dslist.h30 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 …]
/linux/lib/math/
H A Dprime_numbers.c11 unsigned long last, sz; member
17 .last = 61,
42 .last = 31,
133 if (x < p->last) { in expand_to_next_prime()
145 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
148 BUG_ON(new->last <= x); in expand_to_next_prime()
192 while (x >= p->last) { in next_prime_number()
201 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
255 p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf); in dump_primes()
264 unsigned long x, last; in selftest() local
[all …]
/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,
/linux/arch/um/drivers/
H A Dumcast_kern.c74 char *last; in mcast_setup() local
90 init->lport = simple_strtoul(port_str, &last, 10); in mcast_setup()
91 if ((*last != '\0') || (last == port_str)) { in mcast_setup()
99 init->ttl = simple_strtoul(ttl_str, &last, 10); in mcast_setup()
100 if ((*last != '\0') || (last == ttl_str)) { in mcast_setup()
120 char *last; in ucast_setup() local
136 init->lport = simple_strtoul(lport_str, &last, 10); in ucast_setup()
137 if ((*last != '\0') || (last == lport_str)) { in ucast_setup()
145 init->rport = simple_strtoul(rport_str, &last, 10); in ucast_setup()
146 if ((*last != '\0') || (last == rport_str)) { in ucast_setup()
/linux/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_svm.c77 svm_range_check_vm(struct kfd_process *p, uint64_t start, uint64_t last,
95 prange, prange->start, prange->last); in svm_range_unlink()
104 if (prange->it_node.start != 0 && prange->it_node.last != 0) in svm_range_unlink()
112 prange, prange->start, prange->last); in svm_range_add_notifier_locked()
131 prange, prange->start, prange->last); in svm_range_add_to_svms()
135 prange->it_node.last = prange->last; in svm_range_add_to_svms()
144 prange->notifier.interval_tree.last >> PAGE_SHIFT); in svm_range_remove_notifier()
147 prange->notifier.interval_tree.last != 0) in svm_range_remove_notifier()
281 uint64_t size = (prange->last - prange->start + 1) << PAGE_SHIFT; in svm_range_free()
286 prange->start, prange->last); in svm_range_free()
[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()
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()
52 while (last->timestamp > timestamp) { in queue_event()
53 p = last->list.prev; in queue_event()
[all …]
/linux/tools/include/linux/
H A Dinterval_tree_generic.h42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
49 if (parent->ITSUBTREE < last) \
50 parent->ITSUBTREE = last; \
59 node->ITSUBTREE = last; \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
104 if (ITSTART(node) <= last) { /* Cond1 */ \
120 ITTYPE start, ITTYPE last) \
145 if (ITSTART(leftmost) > last) \
148 return ITPREFIX ## _subtree_search(node, start, last); \
152 ITPREFIX ## _iter_next(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
[all …]
/linux/include/linux/
H A Dinterval_tree_generic.h42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
49 if (parent->ITSUBTREE < last) \
50 parent->ITSUBTREE = last; \
59 node->ITSUBTREE = last; \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
104 if (ITSTART(node) <= last) { /* Cond1 */ \
120 ITTYPE start, ITTYPE last) \
145 if (ITSTART(leftmost) > last) \
148 return ITPREFIX ## _subtree_search(node, start, last); \
152 ITPREFIX ## _iter_next(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
[all …]
/linux/scripts/
H A Ddecode_stacktrace.sh268 local last=$(( ${#words[@]} - 1 ))
283 if [[ ${words[$last]} =~ ^[0-9a-f]+\] ]]; then
284 words[$last-1]="${words[$last-1]} ${words[$last]}"
285 unset words[$last]
286 last=$(( $last - 1 ))
289 if [[ ${words[$last]} =~ \[([^]]+)\] ]]; then
290 module=${words[$last]}
301 symbol=${words[$last-1]}
302 unset words[$last-1]
305 symbol=${words[$last]}
[all …]
/linux/mm/
H A Dinterval_tree.c34 unsigned long last = vma_last_pgoff(node); in vma_interval_tree_insert_after() local
44 if (parent->shared.rb_subtree_last < last) in vma_interval_tree_insert_after()
45 parent->shared.rb_subtree_last = last; in vma_interval_tree_insert_after()
49 if (parent->shared.rb_subtree_last < last) in vma_interval_tree_insert_after()
50 parent->shared.rb_subtree_last = last; in vma_interval_tree_insert_after()
55 node->shared.rb_subtree_last = last; in vma_interval_tree_insert_after()
93 unsigned long first, unsigned long last) in anon_vma_interval_tree_iter_first() argument
95 return __anon_vma_interval_tree_iter_first(root, first, last); in anon_vma_interval_tree_iter_first()
100 unsigned long first, unsigned long last) in anon_vma_interval_tree_iter_next() argument
102 return __anon_vma_interval_tree_iter_next(node, first, last); in anon_vma_interval_tree_iter_next()
/linux/drivers/iommu/iommufd/
H A Dio_pagetable.h78 return area->pages_node.last; in iopt_area_last_index()
88 return area->node.last; in iopt_area_last_iova()
93 return (area->node.last - area->node.start) + 1; in iopt_area_length()
120 unsigned long last) \
126 last); \
133 unsigned long last) \
137 node = interval_tree_iter_next(&last_node->node, start, last); \
218 unsigned long last, struct page **out_pages);
220 unsigned long last, struct page **out_pages);
222 unsigned long last);
[all …]
/linux/net/sunrpc/xprtrdma/
H A Dfrwr_ops.c499 struct ib_send_wr *first, **prev, *last; in frwr_unmap_sync() local
516 last = &mr->mr_invwr; in frwr_unmap_sync()
517 last->next = NULL; in frwr_unmap_sync()
518 last->wr_cqe = &mr->mr_cqe; in frwr_unmap_sync()
519 last->sg_list = NULL; in frwr_unmap_sync()
520 last->num_sge = 0; in frwr_unmap_sync()
521 last->opcode = IB_WR_LOCAL_INV; in frwr_unmap_sync()
522 last->send_flags = IB_SEND_SIGNALED; in frwr_unmap_sync()
523 last->ex.invalidate_rkey = mr->mr_handle; in frwr_unmap_sync()
525 last->wr_cqe->done = frwr_wc_localinv; in frwr_unmap_sync()
[all …]
/linux/drivers/base/regmap/
H A Dregcache-maple.c44 unsigned long index, last; in regcache_maple_write() local
60 last = reg; in regcache_maple_write()
65 lower_sz = (mas.last - mas.index + 1) * sizeof(unsigned long); in regcache_maple_write()
70 last = mas.last; in regcache_maple_write()
71 upper_sz = (mas.last - mas.index + 1) * sizeof(unsigned long); in regcache_maple_write()
76 entry = kmalloc((last - index + 1) * sizeof(unsigned long), in regcache_maple_write()
94 mas_set_range(&mas, index, last); in regcache_maple_write()
145 if (mas.last > max) { in regcache_maple_drop()
147 upper_last = mas.last; in regcache_maple_drop()
150 mas.last - max, sizeof(*upper), in regcache_maple_drop()
[all …]
/linux/crypto/asymmetric_keys/
H A Dpkcs7_trust.c27 struct x509_certificate *x509, *last = NULL, *p; in pkcs7_validate_trust_one() local
74 last = x509; in pkcs7_validate_trust_one()
75 sig = last->sig; in pkcs7_validate_trust_one()
81 if (last && (last->sig->auth_ids[0] || last->sig->auth_ids[1])) { in pkcs7_validate_trust_one()
83 last->sig->auth_ids[0], in pkcs7_validate_trust_one()
84 last->sig->auth_ids[1], in pkcs7_validate_trust_one()
87 x509 = last; in pkcs7_validate_trust_one()
/linux/drivers/infiniband/hw/cxgb4/
H A Did_table.c51 obj = find_next_zero_bit(alloc->table, alloc->max, alloc->last); in c4iw_id_alloc()
57 alloc->last += get_random_u32_below(RANDOM_SKIP); in c4iw_id_alloc()
59 alloc->last = obj + 1; in c4iw_id_alloc()
60 if (alloc->last >= alloc->max) in c4iw_id_alloc()
61 alloc->last = 0; in c4iw_id_alloc()
88 alloc->last = get_random_u32_below(RANDOM_SKIP); in c4iw_id_table_alloc()
90 alloc->last = 0; in c4iw_id_table_alloc()
/linux/lib/
H A Dinterval_tree.c8 #define LAST(node) ((node)->last)
34 if (cur->last > state->nodes[0]->last) in interval_tree_span_iter_next_gap()
38 } while (cur && (state->nodes[0]->last >= cur->start || in interval_tree_span_iter_next_gap()
39 state->nodes[0]->last + 1 == cur->start)); in interval_tree_span_iter_next_gap()
73 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_first()
91 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_next()
103 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()
111 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()

12345678910>>...68