rbp 117 arch/x86/entry/calling.h pushq %rbp /* pt_regs->rbp */ rbp 154 arch/x86/entry/calling.h popq %rbp rbp 36 arch/x86/include/asm/frame.h leaq 1+\ptregs_offset(%rsp), %rbp rbp 90 arch/x86/include/asm/inst.h .ifc \r64,%rbp rbp 183 arch/x86/include/asm/kexec.h uint64_t rbp; rbp 55 arch/x86/include/asm/unwind_hints.h .elseif \base == %rbp rbp 119 arch/x86/include/uapi/asm/kvm.h __u64 rsi, rdi, rsp, rbp; rbp 53 arch/x86/include/uapi/asm/ptrace.h unsigned long rbp; rbp 336 arch/x86/include/uapi/asm/sigcontext.h __u64 rbp; rbp 1973 arch/x86/kvm/emulate.c ulong rbp; rbp 1978 arch/x86/kvm/emulate.c rbp = reg_read(ctxt, VCPU_REGS_RBP); rbp 1979 arch/x86/kvm/emulate.c rc = push(ctxt, &rbp, stack_size(ctxt)); rbp 26 arch/x86/kvm/kvm_cache_regs.h BUILD_KVM_GPR_ACCESSORS(rbp, RBP) rbp 5774 arch/x86/kvm/svm.c [rbp]"i"(offsetof(struct vcpu_svm, vcpu.arch.regs[VCPU_REGS_RBP])) rbp 8648 arch/x86/kvm/x86.c regs->rbp = kvm_rbp_read(vcpu); rbp 8684 arch/x86/kvm/x86.c kvm_rbp_write(vcpu, regs->rbp); rbp 1569 drivers/md/dm-crypt.c struct rb_node **rbp, *parent; rbp 1591 drivers/md/dm-crypt.c rbp = &cc->write_tree.rb_node; rbp 1594 drivers/md/dm-crypt.c while (*rbp) { rbp 1595 drivers/md/dm-crypt.c parent = *rbp; rbp 1597 drivers/md/dm-crypt.c rbp = &(*rbp)->rb_left; rbp 1599 drivers/md/dm-crypt.c rbp = &(*rbp)->rb_right; rbp 1601 drivers/md/dm-crypt.c rb_link_node(&io->rb_node, parent, rbp); rbp 2113 drivers/md/dm-thin.c struct rb_node **rbp, *parent; rbp 2117 drivers/md/dm-thin.c rbp = &tc->sort_bio_list.rb_node; rbp 2119 drivers/md/dm-thin.c while (*rbp) { rbp 2120 drivers/md/dm-thin.c parent = *rbp; rbp 2124 drivers/md/dm-thin.c rbp = &(*rbp)->rb_left; rbp 2126 drivers/md/dm-thin.c rbp = &(*rbp)->rb_right; rbp 2130 drivers/md/dm-thin.c rb_link_node(&pbd->rb_node, parent, rbp); rbp 814 fs/eventpoll.c struct rb_node *rbp; rbp 834 fs/eventpoll.c for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { rbp 835 fs/eventpoll.c epi = rb_entry(rbp, struct epitem, rbn); rbp 850 fs/eventpoll.c while ((rbp = rb_first_cached(&ep->rbr)) != NULL) { rbp 851 fs/eventpoll.c epi = rb_entry(rbp, struct epitem, rbn); rbp 950 fs/eventpoll.c struct rb_node *rbp; rbp 953 fs/eventpoll.c for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { rbp 954 fs/eventpoll.c struct epitem *epi = rb_entry(rbp, struct epitem, rbn); rbp 1051 fs/eventpoll.c struct rb_node *rbp; rbp 1056 fs/eventpoll.c for (rbp = ep->rbr.rb_root.rb_node; rbp; ) { rbp 1057 fs/eventpoll.c epi = rb_entry(rbp, struct epitem, rbn); rbp 1060 fs/eventpoll.c rbp = rbp->rb_right; rbp 1062 fs/eventpoll.c rbp = rbp->rb_left; rbp 1075 fs/eventpoll.c struct rb_node *rbp; rbp 1078 fs/eventpoll.c for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { rbp 1079 fs/eventpoll.c epi = rb_entry(rbp, struct epitem, rbn); rbp 1968 fs/eventpoll.c struct rb_node *rbp; rbp 1974 fs/eventpoll.c for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = rb_next(rbp)) { rbp 1975 fs/eventpoll.c epi = rb_entry(rbp, struct epitem, rbn); rbp 2299 fs/xfs/libxfs/xfs_btree.c struct xfs_buf *rbp; /* right buffer pointer */ rbp 2315 fs/xfs/libxfs/xfs_btree.c right = xfs_btree_get_block(cur, level, &rbp); rbp 2318 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_check_block(cur, right, level, rbp); rbp 2403 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_block(cur, rbp, XFS_BB_NUMRECS); rbp 2426 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_keys(cur, rbp, 1, rrecs); rbp 2427 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_ptrs(cur, rbp, 1, rrecs); rbp 2433 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_recs(cur, rbp, 1, rrecs); rbp 2494 fs/xfs/libxfs/xfs_btree.c struct xfs_buf *rbp; /* right buffer pointer */ rbp 2531 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); rbp 2575 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_keys(cur, rbp, 1, rrecs + 1); rbp 2576 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_ptrs(cur, rbp, 1, rrecs + 1); rbp 2592 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_recs(cur, rbp, 1, rrecs + 1); rbp 2602 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_block(cur, rbp, XFS_BB_NUMRECS); rbp 2665 fs/xfs/libxfs/xfs_btree.c struct xfs_buf *rbp; /* right buffer pointer */ rbp 2698 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_get_buf_block(cur, &rptr, &right, &rbp); rbp 2703 fs/xfs/libxfs/xfs_btree.c xfs_btree_init_block_cur(cur, rbp, xfs_btree_get_level(left), 0); rbp 2750 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_keys(cur, rbp, 1, rrecs); rbp 2751 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_ptrs(cur, rbp, 1, rrecs); rbp 2765 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_recs(cur, rbp, 1, rrecs); rbp 2780 fs/xfs/libxfs/xfs_btree.c xfs_btree_log_block(cur, rbp, XFS_BB_ALL_BITS); rbp 2809 fs/xfs/libxfs/xfs_btree.c xfs_btree_setbuf(cur, level, rbp); rbp 3031 fs/xfs/libxfs/xfs_btree.c struct xfs_buf *rbp; /* right buffer pointer */ rbp 3077 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); rbp 3080 fs/xfs/libxfs/xfs_btree.c bp = rbp; rbp 3084 fs/xfs/libxfs/xfs_btree.c rbp = bp; rbp 3085 fs/xfs/libxfs/xfs_btree.c xfs_btree_buf_to_ptr(cur, rbp, &rptr); rbp 3675 fs/xfs/libxfs/xfs_btree.c struct xfs_buf *rbp; /* right buffer pointer */ rbp 3881 fs/xfs/libxfs/xfs_btree.c right = xfs_btree_get_block(tcur, level, &rbp); rbp 3883 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_check_block(tcur, right, level, rbp); rbp 4005 fs/xfs/libxfs/xfs_btree.c rbp = bp; rbp 4023 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); rbp 4103 fs/xfs/libxfs/xfs_btree.c error = xfs_btree_free_block(cur, rbp); rbp 33 fs/xfs/xfs_extent_busy.c struct rb_node **rbp; rbp 48 fs/xfs/xfs_extent_busy.c rbp = &pag->pagb_tree.rb_node; rbp 49 fs/xfs/xfs_extent_busy.c while (*rbp) { rbp 50 fs/xfs/xfs_extent_busy.c parent = *rbp; rbp 54 fs/xfs/xfs_extent_busy.c rbp = &(*rbp)->rb_left; rbp 57 fs/xfs/xfs_extent_busy.c rbp = &(*rbp)->rb_right; rbp 64 fs/xfs/xfs_extent_busy.c rb_link_node(&new->rb_node, parent, rbp); rbp 89 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rbp 96 fs/xfs/xfs_extent_busy.c rbp = pag->pagb_tree.rb_node; rbp 99 fs/xfs/xfs_extent_busy.c while (rbp) { rbp 100 fs/xfs/xfs_extent_busy.c busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); rbp 105 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_left; rbp 110 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_right; rbp 290 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rbp 297 fs/xfs/xfs_extent_busy.c rbp = pag->pagb_tree.rb_node; rbp 298 fs/xfs/xfs_extent_busy.c while (rbp) { rbp 300 fs/xfs/xfs_extent_busy.c rb_entry(rbp, struct xfs_extent_busy, rb_node); rbp 305 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_left; rbp 308 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_right; rbp 341 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rbp 350 fs/xfs/xfs_extent_busy.c rbp = args->pag->pagb_tree.rb_node; rbp 351 fs/xfs/xfs_extent_busy.c while (rbp && flen >= args->minlen) { rbp 353 fs/xfs/xfs_extent_busy.c rb_entry(rbp, struct xfs_extent_busy, rb_node); rbp 359 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_left; rbp 362 fs/xfs/xfs_extent_busy.c rbp = rbp->rb_right; rbp 97 include/xen/interface/hvm/hvm_vcpu.h uint64_t rbp; rbp 701 net/ceph/osdmap.c struct rb_node *rbp; rbp 703 net/ceph/osdmap.c for (rbp = rb_first(&map->pg_pools); rbp; rbp = rb_next(rbp)) { rbp 705 net/ceph/osdmap.c rb_entry(rbp, struct ceph_pg_pool_info, node); rbp 119 tools/arch/x86/include/uapi/asm/kvm.h __u64 rsi, rdi, rsp, rbp; rbp 75 tools/perf/arch/x86/util/dwarf-regs.c REG_OFFSET_NAME_64("%bp", rbp), rbp 86 tools/perf/arch/x86/util/perf_regs.c SDT_NAME_REG(rbp, bp), rbp 165 tools/perf/util/intel-pt-decoder/intel-pt-decoder.h uint64_t rbp; rbp 403 tools/testing/selftests/bpf/bpf_helpers.h #define PT_REGS_FP(x) ((x)->rbp) rbp 104 tools/testing/selftests/kvm/lib/x86_64/processor.c regs->rsi, regs->rdi, regs->rsp, regs->rbp); rbp 54 tools/testing/selftests/kvm/x86_64/sync_regs_test.c REG_COMPARE(rbp); rbp 60 tools/testing/selftests/x86/test_syscall_vdso.c uint64_t rsi, rdi, rbp, rsp; rbp 120 tools/testing/selftests/x86/test_syscall_vdso.c printf("si:%016llx di:%016llx bp:%016llx sp:%016llx\n", regs64.rsi, regs64.rdi, regs64.rbp, regs64.rsp);