Home
last modified time | relevance | path

Searched refs:last (Results 1 - 25 of 1936) sorted by relevance

12345678910>>...78

/kernel/linux/linux-5.10/drivers/mfd/
H A Dab8500-debugfs.c108 * @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
[all...]
/kernel/linux/linux-6.6/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()
60 struct nft_last *last = priv->last; nft_last_eval() local
72 struct nft_last *last = priv->last; nft_last_dump() local
[all...]
/kernel/linux/linux-5.10/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()
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()
104 find_intervals_intersection_sorted(struct rb_root_cached *root, unsigned long start, unsigned long last, struct list_head *list) find_intervals_intersection_sorted() argument
179 usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, unsigned long last, int flags) usnic_uiom_insert_interval() argument
250 usnic_uiom_remove_interval(struct rb_root_cached *root, unsigned long start, unsigned long last, struct list_head *removed) usnic_uiom_remove_interval() argument
[all...]
/kernel/linux/linux-6.6/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()
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()
104 find_intervals_intersection_sorted(struct rb_root_cached *root, unsigned long start, unsigned long last, struct list_head *list) find_intervals_intersection_sorted() argument
179 usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, unsigned long last, int flags) usnic_uiom_insert_interval() argument
250 usnic_uiom_remove_interval(struct rb_root_cached *root, unsigned long start, unsigned long last, struct list_head *removed) usnic_uiom_remove_interval() argument
[all...]
/kernel/linux/linux-5.10/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 in cfe_console_write()
[all...]
/kernel/linux/linux-6.6/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 in cfe_console_write()
[all...]
/kernel/linux/linux-5.10/arch/um/kernel/
H A Dtlb.c125 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 in add_mmap()
165 struct host_vm_op *last; add_munmap() local
195 struct host_vm_op *last; add_mprotect() local
371 unsigned long addr, last; flush_tlb_kernel_range_common() local
[all...]
/kernel/linux/linux-6.6/arch/um/kernel/
H A Dtlb.c125 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 in add_mmap()
162 struct host_vm_op *last; add_munmap() local
189 struct host_vm_op *last; add_mprotect() local
359 unsigned long addr, last; flush_tlb_kernel_range_common() local
[all...]
/kernel/linux/linux-6.6/drivers/vhost/
H A Diotlb.c17 #define LAST(map) ((map)->last)
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()
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 in vhost_iotlb_add_range_ctx()
50 vhost_iotlb_add_range_ctx(struct vhost_iotlb *iotlb, u64 start, u64 last, u64 addr, unsigned int perm, void *opaque) vhost_iotlb_add_range_ctx() argument
103 vhost_iotlb_add_range(struct vhost_iotlb *iotlb, u64 start, u64 last, u64 addr, unsigned int perm) vhost_iotlb_add_range() argument
118 vhost_iotlb_del_range(struct vhost_iotlb *iotlb, u64 start, u64 last) vhost_iotlb_del_range() argument
195 vhost_iotlb_itree_first(struct vhost_iotlb *iotlb, u64 start, u64 last) vhost_iotlb_itree_first() argument
208 vhost_iotlb_itree_next(struct vhost_iotlb_map *map, u64 start, u64 last) vhost_iotlb_itree_next() argument
[all...]
/kernel/linux/linux-5.10/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()
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()
139 unsigned long first, last; bitfill_aligned_rev() local
195 unsigned long first, last; bitfill_unaligned_rev() local
[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()
102 /** We must always remember the last value read, in bitcpy()
159 *dst = comp(d0, *dst, last); in bitcpy()
174 unsigned long first, last; bitcpy_rev() local
[all...]
/kernel/linux/linux-6.6/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()
129 unsigned long first, last; bitfill_aligned_rev() local
185 unsigned long first, last; bitfill_unaligned_rev() local
[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()
102 /** We must always remember the last value read, in bitcpy()
159 *dst = comp(d0, *dst, last); in bitcpy()
174 unsigned long first, last; bitcpy_rev() local
[all...]
/kernel/linux/linux-5.10/io_uring/
H A Dio-wq.h29 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()
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()
57 wq_list_cut(struct io_wq_work_list *list, struct io_wq_work_node *last, struct io_wq_work_node *prev) wq_list_cut() argument
[all...]
/kernel/linux/linux-6.6/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()
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()
55 wq_list_cut(struct io_wq_work_list *list, struct io_wq_work_node *last, struct io_wq_work_node *prev) wq_list_cut() argument
[all...]
/kernel/linux/linux-6.6/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()
282 uint64_t size = (prange->last in svm_range_free()
313 svm_range_new(struct svm_range_list *svms, uint64_t start, uint64_t last, bool update_mem_usage) svm_range_new() argument
928 svm_range_split_pages(struct svm_range *new, struct svm_range *old, uint64_t start, uint64_t last) svm_range_split_pages() argument
946 svm_range_split_nodes(struct svm_range *new, struct svm_range *old, uint64_t start, uint64_t last) svm_range_split_nodes() argument
987 svm_range_split_adjust(struct svm_range *new, struct svm_range *old, uint64_t start, uint64_t last) svm_range_split_adjust() argument
1047 svm_range_split(struct svm_range *prange, uint64_t start, uint64_t last, struct svm_range **new) svm_range_split() argument
1141 unsigned long start, last, size; svm_range_split_by_granularity() local
1288 svm_range_unmap_from_gpu(struct amdgpu_device *adev, struct amdgpu_vm *vm, uint64_t start, uint64_t last, struct dma_fence **fence) svm_range_unmap_from_gpu() argument
1302 svm_range_unmap_from_gpus(struct svm_range *prange, unsigned long start, unsigned long last, uint32_t trigger) svm_range_unmap_from_gpus() argument
1878 svm_range_evict(struct svm_range *prange, struct mm_struct *mm, unsigned long start, unsigned long last, enum mmu_notifier_event event) svm_range_evict() argument
2015 svm_range_split_new(struct svm_range_list *svms, uint64_t start, uint64_t last, uint64_t max_pages, struct list_head *insert_list, struct list_head *update_list) svm_range_split_new() argument
2074 unsigned long last = start + size - 1UL; svm_range_add() local
2179 unsigned long last; svm_range_update_notifier_and_interval_tree() local
2392 svm_range_unmap_split(struct mm_struct *mm, struct svm_range *parent, struct svm_range *prange, unsigned long start, unsigned long last) svm_range_unmap_split() argument
2426 svm_range_unmap_from_cpu(struct mm_struct *mm, struct svm_range *prange, unsigned long start, unsigned long last) svm_range_unmap_from_cpu() argument
2504 unsigned long last; svm_range_cpu_invalidate_pagetables() local
2654 svm_range_get_range_boundaries(struct kfd_process *p, int64_t addr, unsigned long *start, unsigned long *last, bool *is_heap_stack) svm_range_get_range_boundaries() argument
2707 svm_range_check_vm_userptr(struct kfd_process *p, uint64_t start, uint64_t last, uint64_t *bo_s, uint64_t *bo_l) svm_range_check_vm_userptr() argument
2764 unsigned long start, last; svm_range_create_unregistered_range() local
3216 svm_range_check_vm(struct kfd_process *p, uint64_t start, uint64_t last, uint64_t *bo_s, uint64_t *bo_l) svm_range_check_vm() argument
3629 uint64_t last = start + size - 1UL; svm_range_get_attr() local
[all...]
/kernel/linux/linux-5.10/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 ! in ucast_setup()
[all...]
/kernel/linux/linux-6.6/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 ! in ucast_setup()
[all...]
/kernel/linux/linux-5.10/drivers/vhost/
H A Diotlb.c17 #define LAST(map) ((map)->last)
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()
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
49 vhost_iotlb_add_range(struct vhost_iotlb *iotlb, u64 start, u64 last, u64 addr, unsigned int perm) vhost_iotlb_add_range() argument
91 vhost_iotlb_del_range(struct vhost_iotlb *iotlb, u64 start, u64 last) vhost_iotlb_del_range() argument
155 vhost_iotlb_itree_first(struct vhost_iotlb *iotlb, u64 start, u64 last) vhost_iotlb_itree_first() argument
168 vhost_iotlb_itree_next(struct vhost_iotlb_map *map, u64 start, u64 last) vhost_iotlb_itree_next() argument
[all...]
/kernel/linux/linux-5.10/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...]
/kernel/linux/linux-6.6/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...]
/kernel/linux/linux-6.6/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
[all...]
/kernel/linux/linux-6.6/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...]
/kernel/linux/linux-5.10/lib/math/
H A Dprime_numbers.c13 unsigned long last, sz; member
19 .last = 61,
44 .last = 31,
135 if (x < p->last) { in expand_to_next_prime()
147 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
150 BUG_ON(new->last <= x); in expand_to_next_prime()
194 while (x >= p->last) { in next_prime_number()
203 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
256 pr_info("primes.{last=%lu, .sz=%lu, .primes[]=...x%lx} = %s\n", in dump_primes()
257 p->last, in dump_primes()
266 unsigned long x, last; selftest() local
[all...]
/kernel/linux/linux-6.6/lib/math/
H A Dprime_numbers.c13 unsigned long last, sz; member
19 .last = 61,
44 .last = 31,
135 if (x < p->last) { in expand_to_next_prime()
147 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
150 BUG_ON(new->last <= x); in expand_to_next_prime()
194 while (x >= p->last) { in next_prime_number()
203 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
256 pr_info("primes.{last=%lu, .sz=%lu, .primes[]=...x%lx} = %s\n", in dump_primes()
257 p->last, in dump_primes()
266 unsigned long x, last; selftest() local
[all...]

Completed in 11 milliseconds

12345678910>>...78