/linux-master/mm/ |
H A D | interval_tree.c | 34 unsigned long last = vma_last_pgoff(node); local 44 if (parent->shared.rb_subtree_last < last) 45 parent->shared.rb_subtree_last = last; 49 if (parent->shared.rb_subtree_last < last) 50 parent->shared.rb_subtree_last = last; 55 node->shared.rb_subtree_last = last; 93 unsigned long first, unsigned long last) 95 return __anon_vma_interval_tree_iter_first(root, first, last); 100 unsigned long first, unsigned long last) 102 return __anon_vma_interval_tree_iter_next(node, first, last); 92 anon_vma_interval_tree_iter_first(struct rb_root_cached *root, unsigned long first, unsigned long last) argument 99 anon_vma_interval_tree_iter_next(struct anon_vma_chain *node, unsigned long first, unsigned long last) argument [all...] |
/linux-master/arch/um/drivers/ |
H A D | umcast_kern.c | 74 char *last; local 90 init->lport = simple_strtoul(port_str, &last, 10); 91 if ((*last != '\0') || (last == port_str)) { 99 init->ttl = simple_strtoul(ttl_str, &last, 10); 100 if ((*last != '\0') || (last == ttl_str)) { 120 char *last; local 136 init->lport = simple_strtoul(lport_str, &last, 10); 137 if ((*last ! [all...] |
H A D | vde_kern.c | 73 char *remain, *port_str = NULL, *mode_str = NULL, *last; local 90 init->port = simple_strtoul(port_str, &last, 10); 91 if ((*last != '\0') || (last == port_str)) { 99 init->mode = simple_strtoul(mode_str, &last, 8); 100 if ((*last != '\0') || (last == mode_str)) {
|
/linux-master/drivers/staging/media/ipu3/ |
H A D | ipu3-css-pool.c | 49 pool->last = IPU3_CSS_POOL_SIZE; 64 u32 n = (pool->last + 1) % IPU3_CSS_POOL_SIZE; 67 pool->last = n; 75 pool->entry[pool->last].valid = false; 76 pool->last = (pool->last + IPU3_CSS_POOL_SIZE - 1) % IPU3_CSS_POOL_SIZE; 80 * imgu_css_pool_last - Retrieve the nth pool entry from last 83 * @n: the distance to the last index. 86 * The nth entry from last or null map to indicate no frame stored. 92 int i = (pool->last [all...] |
H A D | ipu3-css-pool.h | 33 * @last: write pointer, initialized to IPU3_CSS_POOL_SIZE. 40 u32 last; member in struct:imgu_css_pool 52 u32 last);
|
/linux-master/drivers/infiniband/hw/cxgb4/ |
H A D | id_table.c | 51 obj = find_next_zero_bit(alloc->table, alloc->max, alloc->last); 57 alloc->last += get_random_u32_below(RANDOM_SKIP); 59 alloc->last = obj + 1; 60 if (alloc->last >= alloc->max) 61 alloc->last = 0; 88 alloc->last = get_random_u32_below(RANDOM_SKIP); 90 alloc->last = 0;
|
/linux-master/fs/xfs/scrub/ |
H A D | bitmap.c | 51 uint64_t last); 55 uint64_t last); 77 uint64_t last = start + len - 1; local 79 while ((bn = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last))) { 80 if (bn->bn_start < start && bn->bn_last > last) { 93 new_bn->bn_start = last + 1; 101 } else if (bn->bn_last > last) { 104 bn->bn_start = last + 1; 126 uint64_t last = start + len - 1; local 130 left = xbitmap64_tree_iter_first(&bitmap->xb_root, start, last); 282 uint64_t last = start + *len - 1; local 351 uint32_t last = start + len - 1; local 400 uint32_t last = start + len - 1; local 556 uint32_t last = start + *len - 1; local [all...] |
/linux-master/include/linux/ |
H A 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...] |
H A D | interval_tree.h | 10 unsigned long last; /* Last location _in_ interval */ member in struct:interval_tree_node 24 unsigned long start, unsigned long last); 28 unsigned long start, unsigned long last);
|
H A D | rculist_nulls.h | 133 struct hlist_nulls_node *i, *last = NULL; local 137 last = i; 139 if (last) { 140 WRITE_ONCE(n->next, last->next); 141 n->pprev = &last->next; 142 rcu_assign_pointer(hlist_nulls_next_rcu(last), n);
|
/linux-master/tools/include/linux/ |
H A 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...] |
/linux-master/drivers/iommu/iommufd/ |
H A D | io_pagetable.h | 78 return area->pages_node.last; 88 return area->node.last; 93 return (area->node.last - area->node.start) + 1; 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-master/drivers/gpu/drm/xe/ |
H A D | xe_range_fence.h | 28 /** @last: last address (inclusive) of range fence is interval tree */ 29 u64 last; member in struct:xe_range_fence 60 u64 last); 63 xe_range_fence_tree_next(struct xe_range_fence *rfence, u64 start, u64 last);
|
H A D | xe_range_fence.c | 14 #define XE_RANGE_TREE_LAST(_node) ((_node)->last) 49 * @last: last address of range fence 57 u64 start, u64 last, struct dma_fence *fence) 68 rfence->last = last; 129 * @last: last address of range fence 135 u64 last) 137 return xe_range_fence_tree_iter_first(&tree->root, start, last); 54 xe_range_fence_insert(struct xe_range_fence_tree *tree, struct xe_range_fence *rfence, const struct xe_range_fence_ops *ops, u64 start, u64 last, struct dma_fence *fence) argument 134 xe_range_fence_tree_first(struct xe_range_fence_tree *tree, u64 start, u64 last) argument 149 xe_range_fence_tree_next(struct xe_range_fence *rfence, u64 start, u64 last) argument [all...] |
/linux-master/drivers/video/fbdev/core/ |
H A D | sysfillrect.c | 28 unsigned long first, last; local 34 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); 38 if (last) 39 first &= last; 57 if (last) 58 *dst = comp(pat, *dst, last); 74 unsigned long first, last; local 80 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); 84 if (last) 85 first &= last; 129 unsigned long first, last; local 185 unsigned long first, last; local [all...] |
H A D | syscopyarea.c | 31 unsigned long first, last; local 36 last = ~(FB_SHIFT_HIGH(p, ~0UL, (dst_idx+n) % bits)); 42 if (last) 43 first &= last; 72 if (last) 73 *dst = comp(*src, *dst, last); 85 if (last) 86 first &= last; 102 /** We must always remember the last value read, 159 *dst = comp(d0, *dst, last); 174 unsigned long first, last; local [all...] |
/linux-master/arch/csky/include/asm/ |
H A D | switch_to.h | 27 #define switch_to(prev, next, last) \ 32 ((last) = __switch_to((prev), (next))); \
|
/linux-master/drivers/gpu/drm/amd/amdkfd/ |
H A D | kfd_migrate.h | 44 unsigned long start, unsigned long last, 48 unsigned long start, unsigned long last,
|
/linux-master/arch/um/kernel/ |
H A D | tlb.c | 125 struct host_vm_op *last; local 133 last = &hvc->ops[hvc->index - 1]; 134 if ((last->type == MMAP) && 135 (last->u.mmap.addr + last->u.mmap.len == virt) && 136 (last->u.mmap.prot == prot) && (last->u.mmap.fd == fd) && 137 (last->u.mmap.offset + last->u.mmap.len == offset)) { 138 last 162 struct host_vm_op *last; local 189 struct host_vm_op *last; local 359 unsigned long addr, last; local [all...] |
/linux-master/lib/math/ |
H A D | prime_numbers.c | 13 unsigned long last, sz; member in struct:primes 19 .last = 61, 44 .last = 31, 135 if (x < p->last) { 147 new->last = clear_multiples(y, new->primes, p->sz, sz); 150 BUG_ON(new->last <= x); 194 while (x >= p->last) { 203 x = find_next_bit(p->primes, p->last, x + 1); 256 pr_info("primes.{last=%lu, .sz=%lu, .primes[]=...x%lx} = %s\n", 257 p->last, 266 unsigned long x, last; local [all...] |
/linux-master/crypto/asymmetric_keys/ |
H A D | pkcs7_trust.c | 27 struct x509_certificate *x509, *last = NULL, *p; local 74 last = x509; 75 sig = last->sig; 81 if (last && (last->sig->auth_ids[0] || last->sig->auth_ids[1])) { 83 last->sig->auth_ids[0], 84 last->sig->auth_ids[1], 87 x509 = last; 96 /* As a last resor [all...] |
/linux-master/lib/ |
H A D | interval_tree.c | 8 #define LAST(node) ((node)->last) 22 * span of nodes. This makes nodes[0]->last the end of that contiguous used span 24 * first node starting the next used span. A hole span is between nodes[0]->last 34 if (cur->last > state->nodes[0]->last) 38 } while (cur && (state->nodes[0]->last >= cur->start || 39 state->nodes[0]->last + 1 == cur->start)); 73 iter->last_used = iter->nodes[0]->last; 91 iter->last_used = iter->nodes[0]->last; 103 iter->start_hole = iter->nodes[0]->last [all...] |
/linux-master/scripts/ |
H A D | decode_stacktrace.sh | 260 # We need to know the index of the last element before we 262 local last=$(( ${#words[@]} - 1 )) 277 if [[ ${words[$last]} =~ ^[0-9a-f]+\] ]]; then 278 words[$last-1]="${words[$last-1]} ${words[$last]}" 279 unset words[$last] 280 last=$(( $last - 1 )) 283 if [[ ${words[$last]} [all...] |
/linux-master/drivers/video/fbdev/ |
H A D | c2p_iplan2.c | 92 u32 dst_idx, first, last, w; local 100 last = 0xffffU ^ (0xffffU >> ((dst_idx+width) % 16)); 101 last |= last << 16; 108 first &= last; 144 store_iplan2_masked(p, bpp, d.words, last);
|
/linux-master/sound/pci/emu10k1/ |
H A D | voice.c | 18 * the card record and each allocation begins where the last left off. The 56 voice->last = 1; 73 pvoice->use = pvoice->dirty = pvoice->last = 0; 127 int last; local 133 last = pvoice->last; 135 } while (!last);
|