Home
last modified time | relevance | path

Searched refs:here (Results 1 - 25 of 200) sorted by relevance

12345678

/kernel/linux/linux-5.10/drivers/block/drbd/
H A Ddrbd_interval.c33 struct drbd_interval *here = in drbd_insert_interval() local
37 if (here->end < this_end) in drbd_insert_interval()
38 here->end = this_end; in drbd_insert_interval()
39 if (this->sector < here->sector) in drbd_insert_interval()
41 else if (this->sector > here->sector) in drbd_insert_interval()
43 else if (this < here) in drbd_insert_interval()
45 else if (this > here) in drbd_insert_interval()
74 struct drbd_interval *here = in drbd_contains_interval() local
77 if (sector < here->sector) in drbd_contains_interval()
79 else if (sector > here in drbd_contains_interval()
121 struct drbd_interval *here = drbd_find_overlap() local
[all...]
/kernel/linux/linux-6.6/drivers/block/drbd/
H A Ddrbd_interval.c33 struct drbd_interval *here = in drbd_insert_interval() local
37 if (here->end < this_end) in drbd_insert_interval()
38 here->end = this_end; in drbd_insert_interval()
39 if (this->sector < here->sector) in drbd_insert_interval()
41 else if (this->sector > here->sector) in drbd_insert_interval()
43 else if (this < here) in drbd_insert_interval()
45 else if (this > here) in drbd_insert_interval()
75 struct drbd_interval *here = in drbd_contains_interval() local
78 if (sector < here->sector) in drbd_contains_interval()
80 else if (sector > here in drbd_contains_interval()
127 struct drbd_interval *here = drbd_find_overlap() local
[all...]
/kernel/linux/linux-5.10/net/rxrpc/
H A Dskbuff.c25 const void *here = __builtin_return_address(0); in rxrpc_new_skb() local
28 rxrpc_skb(skb)->rx_flags, here); in rxrpc_new_skb()
36 const void *here = __builtin_return_address(0); in rxrpc_see_skb() local
40 rxrpc_skb(skb)->rx_flags, here); in rxrpc_see_skb()
49 const void *here = __builtin_return_address(0); in rxrpc_get_skb() local
52 rxrpc_skb(skb)->rx_flags, here); in rxrpc_get_skb()
61 const void *here = __builtin_return_address(0); in rxrpc_eaten_skb() local
63 trace_rxrpc_skb(skb, op, 0, n, 0, here); in rxrpc_eaten_skb()
71 const void *here = __builtin_return_address(0); in rxrpc_free_skb() local
76 rxrpc_skb(skb)->rx_flags, here); in rxrpc_free_skb()
86 const void *here = __builtin_return_address(0); rxrpc_purge_queue() local
[all...]
H A Dcall_object.c282 const void *here = __builtin_return_address(0); variable
305 here, (const void *)p->user_call_ID);
357 refcount_read(&call->ref), here, NULL);
377 refcount_read(&call->ref), here, ERR_PTR(-EEXIST));
391 refcount_read(&call->ref), here, ERR_PTR(ret));
446 const void *here = __builtin_return_address(0); in rxrpc_queue_call() local
453 here, NULL); in rxrpc_queue_call()
464 const void *here = __builtin_return_address(0); in __rxrpc_queue_call() local
469 here, NULL); in __rxrpc_queue_call()
480 const void *here in rxrpc_see_call() local
491 const void *here = __builtin_return_address(0); rxrpc_try_get_call() local
505 const void *here = __builtin_return_address(0); rxrpc_get_call() local
530 const void *here = __builtin_return_address(0); rxrpc_release_call() local
624 const void *here = __builtin_return_address(0); rxrpc_put_call() local
[all...]
H A Dconn_object.c254 * must carry a ref on the connection to prevent us getting here whilst in rxrpc_kill_connection()
266 const void *here = __builtin_return_address(0); in rxrpc_queue_conn() local
272 trace_rxrpc_conn(conn->debug_id, rxrpc_conn_queued, r + 1, here); in rxrpc_queue_conn()
283 const void *here = __builtin_return_address(0); in rxrpc_see_connection() local
287 trace_rxrpc_conn(conn->debug_id, rxrpc_conn_seen, n, here); in rxrpc_see_connection()
296 const void *here = __builtin_return_address(0); in rxrpc_get_connection() local
300 trace_rxrpc_conn(conn->debug_id, rxrpc_conn_got, r, here); in rxrpc_get_connection()
310 const void *here = __builtin_return_address(0); in rxrpc_get_connection_maybe() local
315 trace_rxrpc_conn(conn->debug_id, rxrpc_conn_got, r + 1, here); in rxrpc_get_connection_maybe()
337 const void *here in rxrpc_put_service_conn() local
[all...]
H A Dpeer_object.c212 const void *here = __builtin_return_address(0); in rxrpc_alloc_peer() local
236 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_new, 1, here); in rxrpc_alloc_peer()
390 const void *here = __builtin_return_address(0); in rxrpc_get_peer() local
394 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_got, r + 1, here); in rxrpc_get_peer()
403 const void *here = __builtin_return_address(0); in rxrpc_get_peer_maybe() local
408 trace_rxrpc_peer(peer->debug_id, rxrpc_peer_got, r + 1, here); in rxrpc_get_peer_maybe()
437 const void *here = __builtin_return_address(0); in rxrpc_put_peer() local
445 trace_rxrpc_peer(debug_id, rxrpc_peer_put, r - 1, here); in rxrpc_put_peer()
457 const void *here = __builtin_return_address(0); in rxrpc_put_peer_locked() local
463 trace_rxrpc_peer(debug_id, rxrpc_peer_put, r - 1, here); in rxrpc_put_peer_locked()
[all...]
H A Dlocal_object.c220 * reject that here. It is possible that the object is dying - in rxrpc_lookup_local()
286 const void *here = __builtin_return_address(0); in rxrpc_get_local() local
290 trace_rxrpc_local(local->debug_id, rxrpc_local_got, r + 1, here); in rxrpc_get_local()
299 const void *here = __builtin_return_address(0); in rxrpc_get_local_maybe() local
305 r + 1, here); in rxrpc_get_local_maybe()
317 const void *here = __builtin_return_address(0); in rxrpc_queue_local() local
322 trace_rxrpc_local(debug_id, rxrpc_local_queued, r + 1, here); in rxrpc_queue_local()
332 const void *here = __builtin_return_address(0); in rxrpc_put_local() local
341 trace_rxrpc_local(debug_id, rxrpc_local_put, r, here); in rxrpc_put_local()
/kernel/linux/linux-5.10/fs/ext2/
H A Dxattr.c413 struct ext2_xattr_entry *here = NULL, *last = NULL; in ext2_xattr_set() local
421 * here -- The named entry found, or the place for inserting, within in ext2_xattr_set()
464 * Find the named attribute. If not found, 'here' will point in ext2_xattr_set()
482 here = last; in ext2_xattr_set()
487 here = last; in ext2_xattr_set()
510 free += EXT2_XATTR_SIZE(le32_to_cpu(here->e_value_size)); in ext2_xattr_set()
545 offset = (char *)here - bh->b_data; in ext2_xattr_set()
546 here = ENTRY((char *)header + offset); in ext2_xattr_set()
559 last = here = ENTRY(header+1); in ext2_xattr_set()
562 /* Iff we are modifying the block in-place, bh is locked here in ext2_xattr_set()
1040 struct ext2_xattr_entry *here; ext2_xattr_rehash() local
[all...]
H A Dballoc.c603 ext2_grpblk_t here, next; in find_next_usable_block() local
618 here = ext2_find_next_zero_bit(bh->b_data, end_goal, start); in find_next_usable_block()
619 if (here < end_goal) in find_next_usable_block()
620 return here; in find_next_usable_block()
624 here = start; in find_next_usable_block()
625 if (here < 0) in find_next_usable_block()
626 here = 0; in find_next_usable_block()
628 p = ((char *)bh->b_data) + (here >> 3); in find_next_usable_block()
629 r = memscan(p, 0, ((maxblocks + 7) >> 3) - (here >> 3)); in find_next_usable_block()
632 if (next < maxblocks && next >= here) in find_next_usable_block()
[all...]
/kernel/linux/linux-6.6/fs/ext2/
H A Dxattr.c412 struct ext2_xattr_entry *here = NULL, *last = NULL; in ext2_xattr_set() local
420 * here -- The named entry found, or the place for inserting, within in ext2_xattr_set()
463 * Find the named attribute. If not found, 'here' will point in ext2_xattr_set()
481 here = last; in ext2_xattr_set()
486 here = last; in ext2_xattr_set()
509 free += EXT2_XATTR_SIZE(le32_to_cpu(here->e_value_size)); in ext2_xattr_set()
545 offset = (char *)here - bh->b_data; in ext2_xattr_set()
546 here = ENTRY((char *)header + offset); in ext2_xattr_set()
557 last = here = ENTRY(header+1); in ext2_xattr_set()
561 /* Iff we are modifying the block in-place, bh is locked here in ext2_xattr_set()
1027 struct ext2_xattr_entry *here; ext2_xattr_rehash() local
[all...]
H A Dballoc.c602 ext2_grpblk_t here, next; in find_next_usable_block() local
617 here = ext2_find_next_zero_bit(bh->b_data, end_goal, start); in find_next_usable_block()
618 if (here < end_goal) in find_next_usable_block()
619 return here; in find_next_usable_block()
623 here = start; in find_next_usable_block()
624 if (here < 0) in find_next_usable_block()
625 here = 0; in find_next_usable_block()
627 p = ((char *)bh->b_data) + (here >> 3); in find_next_usable_block()
628 r = memscan(p, 0, ((maxblocks + 7) >> 3) - (here >> 3)); in find_next_usable_block()
631 if (next < maxblocks && next >= here) in find_next_usable_block()
[all...]
/kernel/linux/linux-5.10/fs/ext4/
H A Dxattr.c1568 struct ext4_xattr_entry *here = s->here; in ext4_xattr_set_entry() local
1577 old_size = (!s->not_found && !here->e_value_inum) ? in ext4_xattr_set_entry()
1578 EXT4_XATTR_SIZE(le32_to_cpu(here->e_value_size)) : 0; in ext4_xattr_set_entry()
1586 size_t offs = le16_to_cpu(here->e_value_offs); in ext4_xattr_set_entry()
1589 here->e_value_size = cpu_to_le32(i->value_len); in ext4_xattr_set_entry()
1648 if (!s->not_found && here->e_value_inum) { in ext4_xattr_set_entry()
1650 le32_to_cpu(here->e_value_inum), in ext4_xattr_set_entry()
1651 le32_to_cpu(here->e_hash), in ext4_xattr_set_entry()
1696 le32_to_cpu(here in ext4_xattr_set_entry()
3126 struct ext4_xattr_entry *here; ext4_xattr_rehash() local
[all...]
/kernel/linux/linux-5.10/drivers/usb/host/
H A Dehci-sched.c67 union ehci_shadow here = *prev_p; in periodic_unlink() local
70 while (here.ptr && here.ptr != ptr) { in periodic_unlink()
73 hw_p = shadow_next_periodic(ehci, &here, in periodic_unlink()
75 here = *prev_p; in periodic_unlink()
78 if (!here.ptr) in periodic_unlink()
84 *prev_p = *periodic_next_shadow(ehci, &here, in periodic_unlink()
88 *shadow_next_periodic(ehci, &here, Q_NEXT_TYPE(ehci, *hw_p)) in periodic_unlink()
90 *hw_p = *shadow_next_periodic(ehci, &here, in periodic_unlink()
423 union ehci_shadow here; in tt_no_collision() local
532 union ehci_shadow here = *prev; qh_link_periodic() local
1708 union ehci_shadow here = *prev; itd_link() local
[all...]
/kernel/linux/linux-6.6/drivers/usb/host/
H A Dehci-sched.c67 union ehci_shadow here = *prev_p; in periodic_unlink() local
70 while (here.ptr && here.ptr != ptr) { in periodic_unlink()
73 hw_p = shadow_next_periodic(ehci, &here, in periodic_unlink()
75 here = *prev_p; in periodic_unlink()
78 if (!here.ptr) in periodic_unlink()
84 *prev_p = *periodic_next_shadow(ehci, &here, in periodic_unlink()
88 *shadow_next_periodic(ehci, &here, Q_NEXT_TYPE(ehci, *hw_p)) in periodic_unlink()
90 *hw_p = *shadow_next_periodic(ehci, &here, in periodic_unlink()
248 * find_tt() will not return any error here a in reserve_release_intr_bandwidth()
429 union ehci_shadow here; tt_no_collision() local
539 union ehci_shadow here = *prev; qh_link_periodic() local
1719 union ehci_shadow here = *prev; itd_link() local
[all...]
/kernel/linux/linux-6.6/fs/ext4/
H A Dxattr.c1622 struct ext4_xattr_entry *here = s->here; in ext4_xattr_set_entry() local
1631 old_size = (!s->not_found && !here->e_value_inum) ? in ext4_xattr_set_entry()
1632 EXT4_XATTR_SIZE(le32_to_cpu(here->e_value_size)) : 0; in ext4_xattr_set_entry()
1640 size_t offs = le16_to_cpu(here->e_value_offs); in ext4_xattr_set_entry()
1643 here->e_value_size = cpu_to_le32(i->value_len); in ext4_xattr_set_entry()
1702 if (!s->not_found && here->e_value_inum) { in ext4_xattr_set_entry()
1704 le32_to_cpu(here->e_value_inum), in ext4_xattr_set_entry()
1705 le32_to_cpu(here->e_hash), in ext4_xattr_set_entry()
1750 le32_to_cpu(here in ext4_xattr_set_entry()
3204 struct ext4_xattr_entry *here; ext4_xattr_rehash() local
[all...]
/kernel/linux/linux-5.10/arch/sh/lib/
H A Dmemcpy.S20 sub r4,r5 ! From here, r5 has the distance to r0
21 add r6,r0 ! From here, r0 points the end of copying point
27 ! From here, r6 is free
/kernel/linux/linux-6.6/arch/sh/lib/
H A Dmemcpy.S20 sub r4,r5 ! From here, r5 has the distance to r0
21 add r6,r0 ! From here, r0 points the end of copying point
27 ! From here, r6 is free
/kernel/linux/linux-6.6/arch/arm/kernel/
H A Dreturn_address.c44 here: in return_address()
45 frame.pc = (unsigned long)&&here; in return_address()
/kernel/linux/linux-5.10/fs/f2fs/
H A Dxattr.c630 struct f2fs_xattr_entry *here, *last; in __f2fs_setxattr() local
658 here = __find_xattr(base_addr, last_base_addr, index, len, name); in __f2fs_setxattr()
659 if (!here) { in __f2fs_setxattr()
667 found = IS_XATTR_LAST_ENTRY(here) ? 0 : 1; in __f2fs_setxattr()
675 if (value && f2fs_xattr_value_same(here, value, size)) in __f2fs_setxattr()
682 last = here; in __f2fs_setxattr()
706 free = free + ENTRY_SIZE(here); in __f2fs_setxattr()
720 struct f2fs_xattr_entry *next = XATTR_NEXT_ENTRY(here); in __f2fs_setxattr()
721 int oldsize = ENTRY_SIZE(here); in __f2fs_setxattr()
723 memmove(here, nex in __f2fs_setxattr()
[all...]
/kernel/linux/linux-6.6/fs/f2fs/
H A Dxattr.c632 struct f2fs_xattr_entry *here, *last; in __f2fs_setxattr() local
660 here = __find_xattr(base_addr, last_base_addr, NULL, index, len, name); in __f2fs_setxattr()
661 if (!here) { in __f2fs_setxattr()
681 found = IS_XATTR_LAST_ENTRY(here) ? 0 : 1; in __f2fs_setxattr()
689 if (value && f2fs_xattr_value_same(here, value, size)) in __f2fs_setxattr()
696 last = here; in __f2fs_setxattr()
722 free = free + ENTRY_SIZE(here); in __f2fs_setxattr()
736 struct f2fs_xattr_entry *next = XATTR_NEXT_ENTRY(here); in __f2fs_setxattr()
737 int oldsize = ENTRY_SIZE(here); in __f2fs_setxattr()
739 memmove(here, nex in __f2fs_setxattr()
[all...]
/kernel/linux/linux-5.10/arch/m68k/math-emu/
H A Dfp_entry.S76 | send some signal to program here
80 | we jump here after an access error while trying to access
96 | it does not really belong here, but...
111 | directly here, these function may only be called from within
/kernel/linux/linux-6.6/arch/m68k/math-emu/
H A Dfp_entry.S76 | send some signal to program here
80 | we jump here after an access error while trying to access
96 | it does not really belong here, but...
111 | directly here, these function may only be called from within
/kernel/linux/linux-5.10/arch/c6x/lib/
H A Ddivu.S45 ;; first 3 here.
57 ;; RETURN A may happen here (note: must happen before the next branch)
75 ;; loop backwards branch happens here
H A Ddivremu.S33 ;; first 3 here.
45 ;; RETURN A may happen here (note: must happen before the next branch)
63 ;; loop backwards branch happens here
H A Dremu.S30 ;; so we duplicate most of the divsi3 code here.
47 ;; RETURN A may happen here (note: must happen before the next branch)
61 ;; loop backwards branch happens here

Completed in 21 milliseconds

12345678