| 0/0 |
2026/05/09 21:15 |
flow |
patching |
1h43m
Results: map[Fixes:map[Hash:06164d2b72aa752ce4633184b3e0d97601017135 Title:VMCI: queue pairs implementation.] KernelBranch:master KernelCommit:7fd2df204f342fc17d1a0bfcd474b24232fb0f32 KernelRepo:git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git PatchDescription:misc/vmw_vmci: fix recursive locking deadlock in queue pair broker
A recursive locking deadlock can occur involving `qp_broker_list.mutex`
in the VMCI queue pair broker.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires
`qp_broker_list.mutex` and, if there are still other endpoints attached,
it calls `qp_notify_peer()` to send a notification datagram to the peer
context.
The deadlock occurs because `qp_notify_peer()` indirectly calls
`vmci_ctx_put()` on the peer's context, which can drop the reference
count to 0 if the peer context is concurrently being destroyed. When the
reference count reaches 0, `vmci_ctx_put()` synchronously calls
`ctx_free_ctx()`. This cleanup function iterates over all queue pairs
attached to the dying context and calls `vmci_qp_broker_detach()` for
each of them, which attempts to acquire `qp_broker_list.mutex` again,
resulting in a deadlock.
This issue is not isolated to `vmci_qp_broker_detach()`. There are other
places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where
`qp_notify_peer()` or `vmci_ctx_put()` are called while holding
`qp_broker_list.mutex`, such as `qp_broker_attach()` and
`vmci_qp_broker_set_page_store()`.
To fix this, defer the calls to `qp_notify_peer()` and `vmci_ctx_put()`
until after `qp_broker_list.mutex` is safely released. This ensures that
the mutex is never held when these functions are executed, completely
eliminating the recursive locking deadlock while preserving the correct
logic and behavior of the VMCI queue pair broker. PatchDiff:diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index b777bc3fd..3d61d5bf2 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -1508,17 +1508,13 @@ static int qp_notify_peer(bool attach,
* VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
* moved to the VMCOQPB_ATTACHED_NO_MEM state.
*/
-static int qp_broker_attach(struct qp_broker_entry *entry,
- u32 peer,
- u32 flags,
- u32 priv_flags,
- u64 produce_size,
- u64 consume_size,
+static int qp_broker_attach(struct qp_broker_entry *entry, u32 peer, u32 flags,
+ u32 priv_flags, u64 produce_size, u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
- vmci_event_release_cb wakeup_cb,
- void *client_data,
- struct qp_broker_entry **ent)
+ vmci_event_release_cb wakeup_cb, void *client_data,
+ struct qp_broker_entry **ent, bool *do_notify,
+ u32 *notify_peer_id, struct vmci_ctx **out_ctx)
{
const u32 context_id = vmci_ctx_get_id(context);
bool is_local = flags & VMCI_QPFLAG_LOCAL;
@@ -1585,7 +1581,7 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
- vmci_ctx_put(create_context);
+ *out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE;
@@ -1660,13 +1656,8 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
}
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, entry->qp.handle, context_id,
- entry->create_id);
- if (result < VMCI_SUCCESS)
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
+ *do_notify = true;
+ *notify_peer_id = entry->create_id;
}
entry->attach_id = context_id;
@@ -1711,6 +1702,9 @@ static int qp_broker_alloc(struct vmci_handle handle,
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result;
+ bool do_notify = false;
+ u32 notify_peer_id = VMCI_INVALID_ID;
+ struct vmci_ctx *out_ctx = NULL;
if (vmci_handle_is_invalid(handle) ||
(flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
@@ -1748,14 +1742,29 @@ static int qp_broker_alloc(struct vmci_handle handle,
context, wakeup_cb, client_data, ent);
} else {
create = false;
- result =
- qp_broker_attach(entry, peer, flags, priv_flags,
- produce_size, consume_size, page_store,
- context, wakeup_cb, client_data, ent);
+ result = qp_broker_attach(entry, peer, flags, priv_flags,
+ produce_size, consume_size,
+ page_store, context, wakeup_cb,
+ client_data, ent, &do_notify,
+ ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
+ if (out_ctx)
+ vmci_ctx_put(out_ctx);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS)
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
@@ -1968,6 +1977,8 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context);
+ bool do_notify = false;
+ u32 notify_peer_id;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID)
@@ -2035,18 +2046,26 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
entry->vmci_page_files = true;
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, handle, context_id, entry->create_id);
- if (result < VMCI_SUCCESS) {
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
- }
+ do_notify = true;
+ notify_peer_id = entry->create_id;
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS) {
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+ }
+
return result;
}
@@ -2086,6 +2105,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
u32 peer_id;
bool is_local = false;
int result;
+ bool do_notify = false;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID) {
@@ -2185,7 +2205,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
vmci_ctx_qp_destroy(context, handle);
} else {
- qp_notify_peer(false, handle, context_id, peer_id);
+ do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
@@ -2200,6 +2220,10 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify)
+ qp_notify_peer(false, handle, context_id, peer_id);
+
return result;
}
Recipients:[map[Email:arnd@arndb.de Name:Arnd Bergmann To:true] map[Email:bcm-kernel-feedback-list@broadcom.com Name:Broadcom internal kernel review list To:false] map[Email:bryan-bt.tan@broadcom.com Name:Bryan Tan To:true] map[Email:gregkh@linuxfoundation.org Name:Greg Kroah-Hartman To:true] map[Email:linux-kernel@vger.kernel.org Name: To:true] map[Email:vishnu.dasa@broadcom.com Name:Vishnu Dasa To:true]]]
|
| 1/1 |
2026/05/09 21:15 |
action |
base-commit-picker |
0m
Results: map[KernelBranch:master KernelCommit:7fd2df204f342fc17d1a0bfcd474b24232fb0f32 KernelRepo:git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git]
|
| 2/1 |
2026/05/09 21:16 |
action |
syz-repro-to-c-repro |
0m
Results: map[SimplifiedCRepro:// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mount.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <unistd.h>
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
int main(void)
{
syscall(__NR_mmap, /*addr=*/0x1ffffffff000ul, /*len=*/0x1000ul, /*prot=*/0ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
syscall(__NR_mmap, /*addr=*/0x200000000000ul, /*len=*/0x1000000ul, /*prot=PROT_WRITE|PROT_READ|PROT_EXEC*/7ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
syscall(__NR_mmap, /*addr=*/0x200001000000ul, /*len=*/0x1000ul, /*prot=*/0ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
const char* reason;
(void)reason;
intptr_t res = 0;
if (write(1, "executing program\n", sizeof("executing program\n") - 1)) {}
// openat$vmci arguments: [
// fd: const = 0xffffffffffffff9c (8 bytes)
// file: ptr[in, buffer] {
// buffer: {2f 64 65 76 2f 76 6d 63 69 00} (length 0xa)
// }
// flags: const = 0x2 (4 bytes)
// mode: const = 0x0 (2 bytes)
// ]
// returns fd_vmci
memcpy((void*)0x200000000000, "/dev/vmci\000", 10);
res = syscall(__NR_openat, /*fd=*/0xffffffffffffff9cul, /*file=*/0x200000000000ul, /*flags=*/2, /*mode=*/0);
if (res != -1)
r[0] = res;
// ioctl$IOCTL_VMCI_VERSION2 arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a7 (4 bytes)
// arg: ptr[in, vmci_version] {
// vmci_version = 0xa0000 (4 bytes)
// }
// ]
*(uint32_t*)0x200000000200 = 0xa0000;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a7, /*arg=*/0x200000000200ul);
// ioctl$IOCTL_VMCI_INIT_CONTEXT arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a0 (4 bytes)
// arg: ptr[in, vmci_init_blk] {
// vmci_init_blk {
// cid: union vmaddr_cid {
// local: const = 0x1 (4 bytes)
// }
// flags: vmci_privilege = 0x0 (4 bytes)
// }
// }
// ]
*(uint32_t*)0x200000000280 = 1;
*(uint32_t*)0x200000000284 = 0;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a0, /*arg=*/0x200000000280ul);
// ioctl$IOCTL_VMCI_QUEUEPAIR_ALLOC arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a8 (4 bytes)
// arg: ptr[in, vmci_qp_alloc_info] {
// vmci_qp_alloc_info {
// handle: vmci_handle {
// context: union vmaddr_cid {
// local: const = 0x1 (4 bytes)
// }
// rsc: int32 = 0x0 (4 bytes)
// }
// peer: union vmaddr_cid {
// any: const = 0xffffffff (4 bytes)
// }
// flags: vmci_qp = 0x0 (4 bytes)
// produce_size: int64 = 0x4 (8 bytes)
// consume_size: int64 = 0x0 (8 bytes)
// ppn_va: int64 = 0x0 (8 bytes)
// num_ppns: int64 = 0x0 (8 bytes)
// result: int32 = 0x0 (4 bytes)
// version: int32 = 0x0 (4 bytes)
// }
// }
// ]
*(uint32_t*)0x200000001340 = 1;
*(uint32_t*)0x200000001344 = 0;
*(uint32_t*)0x200000001348 = -1;
*(uint32_t*)0x20000000134c = 0;
*(uint64_t*)0x200000001350 = 4;
*(uint64_t*)0x200000001358 = 0;
*(uint64_t*)0x200000001360 = 0;
*(uint64_t*)0x200000001368 = 0;
*(uint32_t*)0x200000001370 = 0;
*(uint32_t*)0x200000001374 = 0;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a8, /*arg=*/0x200000001340ul);
// socket$inet6 arguments: [
// domain: const = 0xa (8 bytes)
// type: socket_type = 0x3 (8 bytes)
// proto: int32 = 0x8000000003c (4 bytes)
// ]
// returns sock_in6
res = syscall(__NR_socket, /*domain=*/0xaul, /*type=SOCK_RAW*/3ul, /*proto=*/0x3c);
if (res != -1)
r[1] = res;
// connect$inet6 arguments: [
// fd: sock_in6 (resource)
// addr: ptr[in, sockaddr_in6] {
// sockaddr_in6 {
// family: const = 0xa (2 bytes)
// port: int16be = 0x3 (2 bytes)
// flow: int32be = 0x8 (4 bytes)
// addr: union ipv6_addr {
// remote: ipv6_addr_t[const[0xbb, int8]] {
// a0: const = 0xfe (1 bytes)
// a1: const = 0x80 (1 bytes)
// a2: buffer: {00 00 00 00 00 00 00 00 00 00 00 00 00} (length 0xd)
// a3: const = 0xbb (1 bytes)
// }
// }
// scope: int32 = 0x7 (4 bytes)
// }
// }
// addrlen: len = 0x1c (8 bytes)
// ]
*(uint16_t*)0x200000000080 = 0xa;
*(uint16_t*)0x200000000082 = htobe16(3);
*(uint32_t*)0x200000000084 = htobe32(8);
*(uint8_t*)0x200000000088 = 0xfe;
*(uint8_t*)0x200000000089 = 0x80;
memset((void*)0x20000000008a, 0, 13);
*(uint8_t*)0x200000000097 = 0xbb;
*(uint32_t*)0x200000000098 = 7;
syscall(__NR_connect, /*fd=*/r[1], /*addr=*/0x200000000080ul, /*addrlen=*/0x1cul);
// sendmsg arguments: [
// fd: sock (resource)
// msg: ptr[in, send_msghdr] {
// send_msghdr {
// msg_name: nil
// msg_namelen: len = 0x953c (4 bytes)
// pad = 0x0 (4 bytes)
// msg_iov: ptr[in, array[iovec[in, array[int8]]]] {
// array[iovec[in, array[int8]]] {
// iovec[in, array[int8]] {
// addr: ptr[in, buffer] {
// buffer: {2b 10} (length 0x2)
// }
// len: len = 0xffbd (8 bytes)
// }
// }
// }
// msg_iovlen: len = 0x1 (8 bytes)
// msg_control: nil
// msg_controllen: bytesize = 0x0 (8 bytes)
// msg_flags: const = 0x2c (4 bytes)
// pad = 0x0 (4 bytes)
// }
// }
// f: send_flags = 0x4 (8 bytes)
// ]
*(uint64_t*)0x2000000000c0 = 0;
*(uint32_t*)0x2000000000c8 = 0x953c;
*(uint64_t*)0x2000000000d0 = 0x200000000100;
*(uint64_t*)0x200000000100 = 0x200000000000;
memcpy((void*)0x200000000000, "\x2b\x10", 2);
*(uint64_t*)0x200000000108 = 0xffbd;
*(uint64_t*)0x2000000000d8 = 1;
*(uint64_t*)0x2000000000e0 = 0;
*(uint64_t*)0x2000000000e8 = 0;
*(uint32_t*)0x2000000000f0 = 0x2c;
syscall(__NR_sendmsg, /*fd=*/r[1], /*msg=*/0x2000000000c0ul, /*f=MSG_DONTROUTE*/4ul);
return 0;
}
]
|
| 3/1 |
2026/05/09 21:16 |
action |
kernel-checkouter |
0m
Results: map[KernelSrc:/app/workdir/cache/src/cbad7996b082969065ced471e435d1359c15f2ef]
|
| 4/1 |
2026/05/09 21:16 |
action |
kernel-builder |
26m
Results: map[KernelObj:/app/workdir/cache/build/99a63fd9535f696288493fda76e7e98395514b9c]
|
| 5/1 |
2026/05/09 21:42 |
action |
crash-reproducer |
2m
Results: map[ReproducedBugTitle:possible deadlock in vmci_qp_broker_detach ReproducedCrashReport:============================================
WARNING: possible recursive locking detected
syzkaller #1 Not tainted
--------------------------------------------
syz.0.512/7305 is trying to acquire lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
but task is already holding lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
other info that might help us debug this:
Possible unsafe locking scenario:
CPU0
----
lock(qp_broker_list.mutex);
lock(qp_broker_list.mutex);
*** DEADLOCK ***
May be due to missing lock nesting notation
1 lock held by syz.0.512/7305:
#0: ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
stack backtrace:
CPU: 1 UID: 0 PID: 7305 Comm: syz.0.512 Not tainted syzkaller #1 PREEMPT(full)
Hardware name: QEMU Standard PC (Q35 + ICH9, 2009), BIOS 1.16.3-debian-1.16.3-2 04/01/2014
Call Trace:
<TASK>
dump_stack_lvl+0xe8/0x150 lib/dump_stack.c:120
print_deadlock_bug+0x279/0x290 kernel/locking/lockdep.c:3041
check_deadlock kernel/locking/lockdep.c:3093 [inline]
validate_chain kernel/locking/lockdep.c:3895 [inline]
__lock_acquire+0x253f/0x2cf0 kernel/locking/lockdep.c:5237
lock_acquire+0x106/0x350 kernel/locking/lockdep.c:5868
__mutex_lock_common kernel/locking/mutex.c:646 [inline]
__mutex_lock+0x199/0x1550 kernel/locking/mutex.c:820
vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_ctx_enqueue_datagram+0x3ab/0x420 drivers/misc/vmw_vmci/vmci_context.c:340
dg_dispatch_as_host drivers/misc/vmw_vmci/vmci_datagram.c:276 [inline]
vmci_datagram_dispatch+0x450/0xc60 drivers/misc/vmw_vmci/vmci_datagram.c:340
qp_notify_peer drivers/misc/vmw_vmci/vmci_queue_pair.c:1481 [inline]
vmci_qp_broker_detach+0x8dd/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2188
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_host_close+0x98/0x160 drivers/misc/vmw_vmci/vmci_host.c:143
__fput+0x44f/0xa60 fs/file_table.c:510
task_work_run+0x1d9/0x270 kernel/task_work.c:233
resume_user_mode_work include/linux/resume_user_mode.h:50 [inline]
__exit_to_user_mode_loop kernel/entry/common.c:67 [inline]
exit_to_user_mode_loop+0xed/0x480 kernel/entry/common.c:98
__exit_to_user_mode_prepare include/linux/irq-entry-common.h:207 [inline]
syscall_exit_to_user_mode_prepare include/linux/irq-entry-common.h:238 [inline]
syscall_exit_to_user_mode include/linux/entry-common.h:318 [inline]
do_syscall_64+0x33e/0xf80 arch/x86/entry/syscall_64.c:100
entry_SYSCALL_64_after_hwframe+0x77/0x7f
RIP: 0033:0x7f45efd9cdd9
Code: ff c3 66 2e 0f 1f 84 00 00 00 00 00 0f 1f 44 00 00 48 89 f8 48 89 f7 48 89 d6 48 89 ca 4d 89 c2 4d 89 c8 4c 8b 4c 24 08 0f 05 <48> 3d 01 f0 ff ff 73 01 c3 48 c7 c1 e8 ff ff ff f7 d8 64 89 01 48
RSP: 002b:00007ffd73cac3c8 EFLAGS: 00000246 ORIG_RAX: 00000000000001b4
RAX: 0000000000000000 RBX: 00007f45f0017da0 RCX: 00007f45efd9cdd9
RDX: 0000000000000000 RSI: 000000000000001e RDI: 0000000000000003
RBP: 00007f45f0017da0 R08: 00007f45f0016038 R09: 00007f45efe3337e
R10: 000000000003fda8 R11: 0000000000000246 R12: 000000000002029b
R13: 00007f45f0015fac R14: 000000000001ff8e R15: 00007ffd73cac4d0
</TASK>
ReproducedFaultInjection:]
|
| 6/1 |
2026/05/09 21:45 |
action |
codesearch-prepare |
19m
Results: map[Index:codesearch-index]
|
| 7/1 |
2026/05/09 22:05 |
agent |
debugger |
7m
Model:
Instruction:
You are an experienced Linux kernel developer tasked with debugging a kernel crash root cause.
You need to provide a detailed explanation of the root cause for another developer to be
able to write a fix for the bug based on your explanation. Include all relevant details
into the response: function/struct/field/etc names, code snippets, line numbers,
macro/enum values, etc.
Prefer calling several tools at the same time to save round-trips.
Prompt:
The crash is:
============================================
WARNING: possible recursive locking detected
syzkaller #1 Not tainted
--------------------------------------------
syz.0.512/7305 is trying to acquire lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
but task is already holding lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
other info that might help us debug this:
Possible unsafe locking scenario:
CPU0
----
lock(qp_broker_list.mutex);
lock(qp_broker_list.mutex);
*** DEADLOCK ***
May be due to missing lock nesting notation
1 lock held by syz.0.512/7305:
#0: ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
stack backtrace:
CPU: 1 UID: 0 PID: 7305 Comm: syz.0.512 Not tainted syzkaller #1 PREEMPT(full)
Hardware name: QEMU Standard PC (Q35 + ICH9, 2009), BIOS 1.16.3-debian-1.16.3-2 04/01/2014
Call Trace:
<TASK>
dump_stack_lvl+0xe8/0x150 lib/dump_stack.c:120
print_deadlock_bug+0x279/0x290 kernel/locking/lockdep.c:3041
check_deadlock kernel/locking/lockdep.c:3093 [inline]
validate_chain kernel/locking/lockdep.c:3895 [inline]
__lock_acquire+0x253f/0x2cf0 kernel/locking/lockdep.c:5237
lock_acquire+0x106/0x350 kernel/locking/lockdep.c:5868
__mutex_lock_common kernel/locking/mutex.c:646 [inline]
__mutex_lock+0x199/0x1550 kernel/locking/mutex.c:820
vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_ctx_enqueue_datagram+0x3ab/0x420 drivers/misc/vmw_vmci/vmci_context.c:340
dg_dispatch_as_host drivers/misc/vmw_vmci/vmci_datagram.c:276 [inline]
vmci_datagram_dispatch+0x450/0xc60 drivers/misc/vmw_vmci/vmci_datagram.c:340
qp_notify_peer drivers/misc/vmw_vmci/vmci_queue_pair.c:1481 [inline]
vmci_qp_broker_detach+0x8dd/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2188
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_host_close+0x98/0x160 drivers/misc/vmw_vmci/vmci_host.c:143
__fput+0x44f/0xa60 fs/file_table.c:510
task_work_run+0x1d9/0x270 kernel/task_work.c:233
resume_user_mode_work include/linux/resume_user_mode.h:50 [inline]
__exit_to_user_mode_loop kernel/entry/common.c:67 [inline]
exit_to_user_mode_loop+0xed/0x480 kernel/entry/common.c:98
__exit_to_user_mode_prepare include/linux/irq-entry-common.h:207 [inline]
syscall_exit_to_user_mode_prepare include/linux/irq-entry-common.h:238 [inline]
syscall_exit_to_user_mode include/linux/entry-common.h:318 [inline]
do_syscall_64+0x33e/0xf80 arch/x86/entry/syscall_64.c:100
entry_SYSCALL_64_after_hwframe+0x77/0x7f
RIP: 0033:0x7f45efd9cdd9
Code: ff c3 66 2e 0f 1f 84 00 00 00 00 00 0f 1f 44 00 00 48 89 f8 48 89 f7 48 89 d6 48 89 ca 4d 89 c2 4d 89 c8 4c 8b 4c 24 08 0f 05 <48> 3d 01 f0 ff ff 73 01 c3 48 c7 c1 e8 ff ff ff f7 d8 64 89 01 48
RSP: 002b:00007ffd73cac3c8 EFLAGS: 00000246 ORIG_RAX: 00000000000001b4
RAX: 0000000000000000 RBX: 00007f45f0017da0 RCX: 00007f45efd9cdd9
RDX: 0000000000000000 RSI: 000000000000001e RDI: 0000000000000003
RBP: 00007f45f0017da0 R08: 00007f45f0016038 R09: 00007f45efe3337e
R10: 000000000003fda8 R11: 0000000000000246 R12: 000000000002029b
R13: 00007f45f0015fac R14: 000000000001ff8e R15: 00007ffd73cac4d0
</TASK>
The following C code is a draft of the vulnerable syscall sequence. Keep in mind that
it may lack the precise threading, sandboxing, and some arguments of a working reproducer:
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mount.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <unistd.h>
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
int main(void)
{
syscall(__NR_mmap, /*addr=*/0x1ffffffff000ul, /*len=*/0x1000ul, /*prot=*/0ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
syscall(__NR_mmap, /*addr=*/0x200000000000ul, /*len=*/0x1000000ul, /*prot=PROT_WRITE|PROT_READ|PROT_EXEC*/7ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
syscall(__NR_mmap, /*addr=*/0x200001000000ul, /*len=*/0x1000ul, /*prot=*/0ul, /*flags=MAP_FIXED|MAP_ANONYMOUS|MAP_PRIVATE*/0x32ul, /*fd=*/(intptr_t)-1, /*offset=*/0ul);
const char* reason;
(void)reason;
intptr_t res = 0;
if (write(1, "executing program\n", sizeof("executing program\n") - 1)) {}
// openat$vmci arguments: [
// fd: const = 0xffffffffffffff9c (8 bytes)
// file: ptr[in, buffer] {
// buffer: {2f 64 65 76 2f 76 6d 63 69 00} (length 0xa)
// }
// flags: const = 0x2 (4 bytes)
// mode: const = 0x0 (2 bytes)
// ]
// returns fd_vmci
memcpy((void*)0x200000000000, "/dev/vmci\000", 10);
res = syscall(__NR_openat, /*fd=*/0xffffffffffffff9cul, /*file=*/0x200000000000ul, /*flags=*/2, /*mode=*/0);
if (res != -1)
r[0] = res;
// ioctl$IOCTL_VMCI_VERSION2 arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a7 (4 bytes)
// arg: ptr[in, vmci_version] {
// vmci_version = 0xa0000 (4 bytes)
// }
// ]
*(uint32_t*)0x200000000200 = 0xa0000;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a7, /*arg=*/0x200000000200ul);
// ioctl$IOCTL_VMCI_INIT_CONTEXT arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a0 (4 bytes)
// arg: ptr[in, vmci_init_blk] {
// vmci_init_blk {
// cid: union vmaddr_cid {
// local: const = 0x1 (4 bytes)
// }
// flags: vmci_privilege = 0x0 (4 bytes)
// }
// }
// ]
*(uint32_t*)0x200000000280 = 1;
*(uint32_t*)0x200000000284 = 0;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a0, /*arg=*/0x200000000280ul);
// ioctl$IOCTL_VMCI_QUEUEPAIR_ALLOC arguments: [
// fd: fd_vmci (resource)
// cmd: const = 0x7a8 (4 bytes)
// arg: ptr[in, vmci_qp_alloc_info] {
// vmci_qp_alloc_info {
// handle: vmci_handle {
// context: union vmaddr_cid {
// local: const = 0x1 (4 bytes)
// }
// rsc: int32 = 0x0 (4 bytes)
// }
// peer: union vmaddr_cid {
// any: const = 0xffffffff (4 bytes)
// }
// flags: vmci_qp = 0x0 (4 bytes)
// produce_size: int64 = 0x4 (8 bytes)
// consume_size: int64 = 0x0 (8 bytes)
// ppn_va: int64 = 0x0 (8 bytes)
// num_ppns: int64 = 0x0 (8 bytes)
// result: int32 = 0x0 (4 bytes)
// version: int32 = 0x0 (4 bytes)
// }
// }
// ]
*(uint32_t*)0x200000001340 = 1;
*(uint32_t*)0x200000001344 = 0;
*(uint32_t*)0x200000001348 = -1;
*(uint32_t*)0x20000000134c = 0;
*(uint64_t*)0x200000001350 = 4;
*(uint64_t*)0x200000001358 = 0;
*(uint64_t*)0x200000001360 = 0;
*(uint64_t*)0x200000001368 = 0;
*(uint32_t*)0x200000001370 = 0;
*(uint32_t*)0x200000001374 = 0;
syscall(__NR_ioctl, /*fd=*/r[0], /*cmd=*/0x7a8, /*arg=*/0x200000001340ul);
// socket$inet6 arguments: [
// domain: const = 0xa (8 bytes)
// type: socket_type = 0x3 (8 bytes)
// proto: int32 = 0x8000000003c (4 bytes)
// ]
// returns sock_in6
res = syscall(__NR_socket, /*domain=*/0xaul, /*type=SOCK_RAW*/3ul, /*proto=*/0x3c);
if (res != -1)
r[1] = res;
// connect$inet6 arguments: [
// fd: sock_in6 (resource)
// addr: ptr[in, sockaddr_in6] {
// sockaddr_in6 {
// family: const = 0xa (2 bytes)
// port: int16be = 0x3 (2 bytes)
// flow: int32be = 0x8 (4 bytes)
// addr: union ipv6_addr {
// remote: ipv6_addr_t[const[0xbb, int8]] {
// a0: const = 0xfe (1 bytes)
// a1: const = 0x80 (1 bytes)
// a2: buffer: {00 00 00 00 00 00 00 00 00 00 00 00 00} (length 0xd)
// a3: const = 0xbb (1 bytes)
// }
// }
// scope: int32 = 0x7 (4 bytes)
// }
// }
// addrlen: len = 0x1c (8 bytes)
// ]
*(uint16_t*)0x200000000080 = 0xa;
*(uint16_t*)0x200000000082 = htobe16(3);
*(uint32_t*)0x200000000084 = htobe32(8);
*(uint8_t*)0x200000000088 = 0xfe;
*(uint8_t*)0x200000000089 = 0x80;
memset((void*)0x20000000008a, 0, 13);
*(uint8_t*)0x200000000097 = 0xbb;
*(uint32_t*)0x200000000098 = 7;
syscall(__NR_connect, /*fd=*/r[1], /*addr=*/0x200000000080ul, /*addrlen=*/0x1cul);
// sendmsg arguments: [
// fd: sock (resource)
// msg: ptr[in, send_msghdr] {
// send_msghdr {
// msg_name: nil
// msg_namelen: len = 0x953c (4 bytes)
// pad = 0x0 (4 bytes)
// msg_iov: ptr[in, array[iovec[in, array[int8]]]] {
// array[iovec[in, array[int8]]] {
// iovec[in, array[int8]] {
// addr: ptr[in, buffer] {
// buffer: {2b 10} (length 0x2)
// }
// len: len = 0xffbd (8 bytes)
// }
// }
// }
// msg_iovlen: len = 0x1 (8 bytes)
// msg_control: nil
// msg_controllen: bytesize = 0x0 (8 bytes)
// msg_flags: const = 0x2c (4 bytes)
// pad = 0x0 (4 bytes)
// }
// }
// f: send_flags = 0x4 (8 bytes)
// ]
*(uint64_t*)0x2000000000c0 = 0;
*(uint32_t*)0x2000000000c8 = 0x953c;
*(uint64_t*)0x2000000000d0 = 0x200000000100;
*(uint64_t*)0x200000000100 = 0x200000000000;
memcpy((void*)0x200000000000, "\x2b\x10", 2);
*(uint64_t*)0x200000000108 = 0xffbd;
*(uint64_t*)0x2000000000d8 = 1;
*(uint64_t*)0x2000000000e0 = 0;
*(uint64_t*)0x2000000000e8 = 0;
*(uint32_t*)0x2000000000f0 = 0x2c;
syscall(__NR_sendmsg, /*fd=*/r[1], /*msg=*/0x2000000000c0ul, /*f=MSG_DONTROUTE*/4ul);
return 0;
}
Reply: The root cause of this crash is a recursive locking deadlock involving `qp_broker_list.mutex`.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires `qp_broker_list.mutex` and, if there are still other endpoints attached, it calls `qp_notify_peer()` to send a notification datagram to the peer context.
The deadlock occurs because `qp_notify_peer()` indirectly calls `vmci_ctx_put()` on the peer's context, which can drop the reference count to 0 if the peer context is concurrently being destroyed. When the reference count reaches 0, `vmci_ctx_put()` synchronously calls `ctx_free_ctx()`. This cleanup function iterates over all queue pairs attached to the dying context and calls `vmci_qp_broker_detach()` for each of them, which attempts to acquire `qp_broker_list.mutex` again, resulting in a deadlock.
Here is the exact call chain leading to the deadlock:
```
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex);
qp_notify_peer()
vmci_datagram_dispatch()
dg_dispatch_as_host()
vmci_ctx_enqueue_datagram()
context = vmci_ctx_get(cid);
...
vmci_ctx_put(context);
kref_put(&context->kref, ctx_free_ctx);
ctx_free_ctx()
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex); <-- DEADLOCK
```
This issue is not isolated to `vmci_qp_broker_detach()`. There are other places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where `qp_notify_peer()` or `vmci_ctx_put()` are called while holding `qp_broker_list.mutex`:
1. **`qp_broker_attach()`**: Calls `vmci_ctx_put(create_context)` directly while holding the mutex. It also calls `qp_notify_peer()`.
2. **`vmci_qp_broker_set_page_store()`**: Calls `qp_notify_peer()` while holding the mutex.
### Proposed Fix
To fix this bug, the calls to `qp_notify_peer()` and `vmci_ctx_put()` must be deferred until after `qp_broker_list.mutex` is released.
For example, in `vmci_qp_broker_detach()`, you can use a boolean flag to defer the notification:
```c
bool do_notify = false;
...
mutex_lock(&qp_broker_list.mutex);
...
if (entry->qp.ref_count == 0) {
...
} else {
do_notify = true;
...
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
A similar approach should be applied to `vmci_qp_broker_set_page_store()`.
For `qp_broker_attach()`, since it is a static helper called by `qp_broker_alloc()`, you can change its signature to pass out the `do_notify` flag, the `notify_peer_id`, and the `struct vmci_ctx **out_ctx` pointer. Then, `qp_broker_alloc()` can safely call `vmci_ctx_put()` and `qp_notify_peer()` after it unlocks `qp_broker_list.mutex`.
|
| 8/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 8473
output: 55
thoughts: 798
Thoughts: **Recursive Locking Detected in `vmci_qp_broker_detach`**
Okay, so I've got a syzkaller report flagging a potential recursive locking issue within `vmci_qp_broker_detach`. The specific lock in question is `qp_broker_list.mutex`. Let's break down this call stack and see what's happening.
Looking at the stack trace, the problem seems to be originating from the sequence of calls: `vmci_host_close` -> `vmci_ctx_put` -> `ctx_free_ctx` -> `vmci_qp_broker_detach`. Within `vmci_qp_broker_detach`, the code acquires `qp_broker_list.mutex`, which is expected. The trace continues with `qp_notify_peer`, which goes into a datagram dispatch path through `vmci_datagram_dispatch` -> `dg_dispatch_as_host` -> `vmci_ctx_enqueue_datagram`. It looks like `vmci_ctx_enqueue_datagram` then calls `vmci_ctx_put`.
Now, here's where things get interesting. `vmci_ctx_put` *again* calls `ctx_free_ctx`, which *again* calls `vmci_qp_broker_detach`. The critical observation here is that `vmci_qp_broker_detach`, *a second time*, attempts to acquire `qp_broker_list.mutex`. Essentially, there's a nested call back into the function that already holds the lock, which is a classic deadlock scenario. Time to dive into the code and trace the control flow to confirm this and find the root cause.
|
| 9/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_detach]
Results: map[SourceCode:2064: /*
2065: * The main entry point for detaching from a queue pair registered with the
2066: * queue pair broker. If more than one endpoint is attached to the queue
2067: * pair, the first endpoint will mainly decrement a reference count and
2068: * generate a notification to its peer. The last endpoint will clean up
2069: * the queue pair state registered with the broker.
2070: *
2071: * When a guest endpoint detaches, it will unmap and unregister the guest
2072: * memory backing the queue pair. If the host is still attached, it will
2073: * no longer be able to access the queue pair content.
2074: *
2075: * If the queue pair is already in a state where there is no memory
2076: * registered for the queue pair (any *_NO_MEM state), it will transition to
2077: * the VMCIQPB_SHUTDOWN_NO_MEM state. This will also happen, if a guest
2078: * endpoint is the first of two endpoints to detach. If the host endpoint is
2079: * the first out of two to detach, the queue pair will move to the
2080: * VMCIQPB_SHUTDOWN_MEM state.
2081: */
2082: int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
2083: {
2084: struct qp_broker_entry *entry;
2085: const u32 context_id = vmci_ctx_get_id(context);
2086: u32 peer_id;
2087: bool is_local = false;
2088: int result;
2089:
2090: if (vmci_handle_is_invalid(handle) || !context ||
2091: context_id == VMCI_INVALID_ID) {
2092: return VMCI_ERROR_INVALID_ARGS;
2093: }
2094:
2095: mutex_lock(&qp_broker_list.mutex);
2096:
2097: if (!vmci_ctx_qp_exists(context, handle)) {
2098: pr_devel("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
2099: context_id, handle.context, handle.resource);
2100: result = VMCI_ERROR_NOT_FOUND;
2101: goto out;
2102: }
2103:
2104: entry = qp_broker_handle_to_entry(handle);
2105: if (!entry) {
2106: pr_devel("Context (ID=0x%x) reports being attached to queue pair(handle=0x%x:0x%x) that isn't present in broker\n",
2107: context_id, handle.context, handle.resource);
2108: result = VMCI_ERROR_NOT_FOUND;
2109: goto out;
2110: }
2111:
2112: if (context_id != entry->create_id && context_id != entry->attach_id) {
2113: result = VMCI_ERROR_QUEUEPAIR_NOTATTACHED;
2114: goto out;
2115: }
2116:
2117: if (context_id == entry->create_id) {
2118: peer_id = entry->attach_id;
2119: entry->create_id = VMCI_INVALID_ID;
2120: } else {
2121: peer_id = entry->create_id;
2122: entry->attach_id = VMCI_INVALID_ID;
2123: }
2124: entry->qp.ref_count--;
2125:
2126: is_local = entry->qp.flags & VMCI_QPFLAG_LOCAL;
2127:
2128: if (context_id != VMCI_HOST_CONTEXT_ID) {
2129: bool headers_mapped;
2130:
2131: /*
2132: * Pre NOVMVM vmx'en may detach from a queue pair
2133: * before setting the page store, and in that case
2134: * there is no user memory to detach from. Also, more
2135: * recent VMX'en may detach from a queue pair in the
2136: * quiesced state.
2137: */
2138:
2139: qp_acquire_queue_mutex(entry->produce_q);
2140: headers_mapped = entry->produce_q->q_header ||
2141: entry->consume_q->q_header;
2142: if (QPBROKERSTATE_HAS_MEM(entry)) {
2143: result =
2144: qp_host_unmap_queues(INVALID_VMCI_GUEST_MEM_ID,
2145: entry->produce_q,
2146: entry->consume_q);
2147: if (result < VMCI_SUCCESS)
2148: pr_warn("Failed to unmap queue headers for queue pair (handle=0x%x:0x%x,result=%d)\n",
2149: handle.context, handle.resource,
2150: result);
2151:
2152: qp_host_unregister_user_memory(entry->produce_q,
2153: entry->consume_q);
2154:
2155: }
2156:
2157: if (!headers_mapped)
2158: qp_reset_saved_headers(entry);
2159:
2160: qp_release_queue_mutex(entry->produce_q);
2161:
2162: if (!headers_mapped && entry->wakeup_cb)
2163: entry->wakeup_cb(entry->client_data);
2164:
2165: } else {
2166: if (entry->wakeup_cb) {
2167: entry->wakeup_cb = NULL;
2168: entry->client_data = NULL;
2169: }
2170: }
2171:
2172: if (entry->qp.ref_count == 0) {
2173: qp_list_remove_entry(&qp_broker_list, &entry->qp);
2174:
2175: if (is_local)
2176: kfree(entry->local_mem);
2177:
2178: qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
2179: qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
2180: qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
2181: /* Unlink from resource hash table and free callback */
2182: vmci_resource_remove(&entry->resource);
2183:
2184: kfree(entry);
2185:
2186: vmci_ctx_qp_destroy(context, handle);
2187: } else {
2188: qp_notify_peer(false, handle, context_id, peer_id);
2189: if (context_id == VMCI_HOST_CONTEXT_ID &&
2190: QPBROKERSTATE_HAS_MEM(entry)) {
2191: entry->state = VMCIQPB_SHUTDOWN_MEM;
2192: } else {
2193: entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
2194: }
2195:
2196: if (!is_local)
2197: vmci_ctx_qp_destroy(context, handle);
2198:
2199: }
2200: result = VMCI_SUCCESS;
2201: out:
2202: mutex_unlock(&qp_broker_list.mutex);
2203: return result;
2204: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 10/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 11963
output: 52
thoughts: 78
Thoughts: Okay, let's break this down.
**Analyzing a Thread-Safe Operation**
Alright, so I'm seeing a critical section managed by the `qp_broker_list.mutex`. I've got a lock acquisition at line 2095 and it's released down at line 2202. That gives me a clear scope for what's happening within this protected region. The critical piece here is the call to `qp_notify_peer` at line 2188, right in the middle of this lock's protection.
So, `qp_notify_peer` is clearly where the core action occurs, and understanding its function within this mutex is key. I need to understand what it means to call `qp_notify_peer` with the parameters `false, handle, context_id, peer_id`, especially with this mutex in place. The `false` probably indicates something about the notification behavior, and the other parameters indicate where to send the notifications. I'm going to focus my analysis on `qp_notify_peer` now.
|
| 11/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_notify_peer]
Results: map[SourceCode:1445: /*
1446: * Enqueues an event datagram to notify the peer VM attached to
1447: * the given queue pair handle about attach/detach event by the
1448: * given VM. Returns Payload size of datagram enqueued on
1449: * success, error code otherwise.
1450: */
1451: static int qp_notify_peer(bool attach,
1452: struct vmci_handle handle,
1453: u32 my_id,
1454: u32 peer_id)
1455: {
1456: int rv;
1457: struct vmci_event_qp ev;
1458:
1459: if (vmci_handle_is_invalid(handle) || my_id == VMCI_INVALID_ID ||
1460: peer_id == VMCI_INVALID_ID)
1461: return VMCI_ERROR_INVALID_ARGS;
1462:
1463: /*
1464: * In vmci_ctx_enqueue_datagram() we enforce the upper limit on
1465: * number of pending events from the hypervisor to a given VM
1466: * otherwise a rogue VM could do an arbitrary number of attach
1467: * and detach operations causing memory pressure in the host
1468: * kernel.
1469: */
1470:
1471: memset(&ev, 0, sizeof(ev));
1472: ev.msg.hdr.dst = vmci_make_handle(peer_id, VMCI_EVENT_HANDLER);
1473: ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
1474: VMCI_CONTEXT_RESOURCE_ID);
1475: ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
1476: ev.msg.event_data.event = attach ?
1477: VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
1478: ev.payload.handle = handle;
1479: ev.payload.peer_id = my_id;
1480:
1481: rv = vmci_datagram_dispatch(VMCI_HYPERVISOR_CONTEXT_ID,
1482: &ev.msg.hdr, false);
1483: if (rv < VMCI_SUCCESS)
1484: pr_warn("Failed to enqueue queue_pair %s event datagram for context (ID=0x%x)\n",
1485: attach ? "ATTACH" : "DETACH", peer_id);
1486:
1487: return rv;
1488: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 12/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 13116
output: 53
thoughts: 17
Thoughts: Okay, here's my interpretation of that thought process, from an expert's perspective:
**Diving into the VMCI Notification Mechanism**
Alright, so `qp_notify_peer` calls `vmci_datagram_dispatch`. That's the key point. Let's break down what's likely happening here. `qp_notify_peer` likely sits somewhere in the queue processing logic, right? It's responsible for signaling a change or event to another peer – another VM, a process within the same VM, or something along those lines, via the VMCI (Virtual Machine Communication Interface) framework.
The crucial link is that this notification isn't a direct call, it's being routed through `vmci_datagram_dispatch`. So, this `datagram_dispatch` function must be the central hub for handling VMCI's unreliable datagram communications. I can deduce that `qp_notify_peer` is probably preparing a datagram payload - the data related to the notification event, maybe an event code, some parameters, whatever the peer needs to know. It then hands this prepared data off to `vmci_datagram_dispatch`.
`vmci_datagram_dispatch` itself is most likely responsible for low-level tasks: formatting the datagram, adding necessary VMCI headers, determining the destination (the peer's VMCI endpoint), and then enqueuing it for transmission, maybe using a shared memory queue or ring buffer. It probably also handles things like connection setup and tear down (if this is a connection-oriented datagram). Since it's datagram-based, I bet there's error checking and retransmission logic in there too – it's a "best-effort" delivery system, not guaranteed. This all makes sense in the overall context of VMCI's design for inter-VM communication; it keeps things relatively lightweight, avoids the overhead of a connection for simpler notification scenarios. This is a very interesting piece of the puzzle. I can immediately imagine how this translates into the broader context.
|
| 13/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_datagram.c IncludeLines:true Name:vmci_datagram_dispatch]
Results: map[SourceCode: 310: /*
311: * Dispatch datagram. This will determine the routing for the datagram
312: * and dispatch it accordingly.
313: * Returns number of bytes sent on success, error code otherwise.
314: */
315: int vmci_datagram_dispatch(u32 context_id,
316: struct vmci_datagram *dg, bool from_guest)
317: {
318: int retval;
319: enum vmci_route route;
320:
321: BUILD_BUG_ON(sizeof(struct vmci_datagram) != 24);
322:
323: if (dg->payload_size > VMCI_MAX_DG_SIZE ||
324: VMCI_DG_SIZE(dg) > VMCI_MAX_DG_SIZE) {
325: pr_devel("Payload (size=%llu bytes) too big to send\n",
326: (unsigned long long)dg->payload_size);
327: return VMCI_ERROR_INVALID_ARGS;
328: }
329:
330: retval = vmci_route(&dg->src, &dg->dst, from_guest, &route);
331: if (retval < VMCI_SUCCESS) {
332: pr_devel("Failed to route datagram (src=0x%x, dst=0x%x, err=%d)\n",
333: dg->src.context, dg->dst.context, retval);
334: return retval;
335: }
336:
337: if (VMCI_ROUTE_AS_HOST == route) {
338: if (VMCI_INVALID_ID == context_id)
339: context_id = VMCI_HOST_CONTEXT_ID;
340: return dg_dispatch_as_host(context_id, dg);
341: }
342:
343: if (VMCI_ROUTE_AS_GUEST == route)
344: return dg_dispatch_as_guest(dg);
345:
346: pr_warn("Unknown route (%d) for datagram\n", route);
347: return VMCI_ERROR_DST_UNREACHABLE;
348: }
SourceFile:drivers/misc/vmw_vmci/vmci_datagram.c]
|
| 14/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 14298
output: 53
thoughts: 19
Thoughts: Here's my take on the thought process, as if it were my own:
**Breaking Down the Data Dispatch**
Okay, so I'm looking at how we're handling VMCI datagrams, specifically the `vmci_datagram_dispatch` function. It seems pretty straightforward on the surface, but I need to understand the flow completely. The key here is this function calls `dg_dispatch_as_host`. So `vmci_datagram_dispatch` is the entry point for datagram processing and ultimately relies on `dg_dispatch_as_host` to do the actual heavy lifting. I need to figure out what `dg_dispatch_as_host` is doing exactly. Is it the main dispatcher, or does it call other functions? I need to look at the internals of `dg_dispatch_as_host` to figure out what happens with the datagram at that level. This initial call is the core of how datagrams are handled between guest and host, so I want to know exactly what the responsibility is.
|
| 15/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_datagram.c IncludeLines:true Name:dg_dispatch_as_host]
Results: map[SourceCode: 151: /*
152: * Dispatch datagram as a host, to the host, or other vm context. This
153: * function cannot dispatch to hypervisor context handlers. This should
154: * have been handled before we get here by vmci_datagram_dispatch.
155: * Returns number of bytes sent on success, error code otherwise.
156: */
157: static int dg_dispatch_as_host(u32 context_id, struct vmci_datagram *dg)
158: {
159: int retval;
160: size_t dg_size;
161: u32 src_priv_flags;
162:
163: dg_size = VMCI_DG_SIZE(dg);
164:
165: /* Host cannot send to the hypervisor. */
166: if (dg->dst.context == VMCI_HYPERVISOR_CONTEXT_ID)
167: return VMCI_ERROR_DST_UNREACHABLE;
168:
169: /* Check that source handle matches sending context. */
170: if (dg->src.context != context_id) {
171: pr_devel("Sender context (ID=0x%x) is not owner of src datagram entry (handle=0x%x:0x%x)\n",
172: context_id, dg->src.context, dg->src.resource);
173: return VMCI_ERROR_NO_ACCESS;
174: }
175:
176: /* Get hold of privileges of sending endpoint. */
177: retval = vmci_datagram_get_priv_flags(context_id, dg->src,
178: &src_priv_flags);
179: if (retval != VMCI_SUCCESS) {
180: pr_warn("Couldn't get privileges (handle=0x%x:0x%x)\n",
181: dg->src.context, dg->src.resource);
182: return retval;
183: }
184:
185: /* Determine if we should route to host or guest destination. */
186: if (dg->dst.context == VMCI_HOST_CONTEXT_ID) {
187: /* Route to host datagram entry. */
188: struct datagram_entry *dst_entry;
189: struct vmci_resource *resource;
190:
191: if (dg->src.context == VMCI_HYPERVISOR_CONTEXT_ID &&
192: dg->dst.resource == VMCI_EVENT_HANDLER) {
193: return vmci_event_dispatch(dg);
194: }
195:
196: resource = vmci_resource_by_handle(dg->dst,
197: VMCI_RESOURCE_TYPE_DATAGRAM);
198: if (!resource) {
199: pr_devel("Sending to invalid destination (handle=0x%x:0x%x)\n",
200: dg->dst.context, dg->dst.resource);
201: return VMCI_ERROR_INVALID_RESOURCE;
202: }
203: dst_entry = container_of(resource, struct datagram_entry,
204: resource);
205: if (vmci_deny_interaction(src_priv_flags,
206: dst_entry->priv_flags)) {
207: vmci_resource_put(resource);
208: return VMCI_ERROR_NO_ACCESS;
209: }
210:
211: /*
212: * If a VMCI datagram destined for the host is also sent by the
213: * host, we always run it delayed. This ensures that no locks
214: * are held when the datagram callback runs.
215: */
216: if (dst_entry->run_delayed ||
217: dg->src.context == VMCI_HOST_CONTEXT_ID) {
218: struct delayed_datagram_info *dg_info;
219:
220: if (atomic_add_return(1, &delayed_dg_host_queue_size)
221: == VMCI_MAX_DELAYED_DG_HOST_QUEUE_SIZE) {
222: atomic_dec(&delayed_dg_host_queue_size);
223: vmci_resource_put(resource);
224: return VMCI_ERROR_NO_MEM;
225: }
226:
227: dg_info = kmalloc_flex(*dg_info, msg_payload,
228: dg->payload_size, GFP_ATOMIC);
229: if (!dg_info) {
230: atomic_dec(&delayed_dg_host_queue_size);
231: vmci_resource_put(resource);
232: return VMCI_ERROR_NO_MEM;
233: }
234:
235: dg_info->in_dg_host_queue = true;
236: dg_info->entry = dst_entry;
237: dg_info->msg = *dg;
238: memcpy(&dg_info->msg_payload, dg + 1, dg->payload_size);
239:
240: INIT_WORK(&dg_info->work, dg_delayed_dispatch);
241: schedule_work(&dg_info->work);
242: retval = VMCI_SUCCESS;
243:
244: } else {
245: retval = dst_entry->recv_cb(dst_entry->client_data, dg);
246: vmci_resource_put(resource);
247: if (retval < VMCI_SUCCESS)
248: return retval;
249: }
250: } else {
251: /* Route to destination VM context. */
252: struct vmci_datagram *new_dg;
253:
254: if (context_id != dg->dst.context) {
255: if (vmci_deny_interaction(src_priv_flags,
256: vmci_context_get_priv_flags
257: (dg->dst.context))) {
258: return VMCI_ERROR_NO_ACCESS;
259: } else if (VMCI_CONTEXT_IS_VM(context_id)) {
260: /*
261: * If the sending context is a VM, it
262: * cannot reach another VM.
263: */
264:
265: pr_devel("Datagram communication between VMs not supported (src=0x%x, dst=0x%x)\n",
266: context_id, dg->dst.context);
267: return VMCI_ERROR_DST_UNREACHABLE;
268: }
269: }
270:
271: /* We make a copy to enqueue. */
272: new_dg = kmemdup(dg, dg_size, GFP_KERNEL);
273: if (new_dg == NULL)
274: return VMCI_ERROR_NO_MEM;
275:
276: retval = vmci_ctx_enqueue_datagram(dg->dst.context, new_dg);
277: if (retval < VMCI_SUCCESS) {
278: kfree(new_dg);
279: return retval;
280: }
281: }
282:
283: /*
284: * We currently truncate the size to signed 32 bits. This doesn't
285: * matter for this handler as it only support 4Kb messages.
286: */
287: return (int)dg_size;
288: }
SourceFile:drivers/misc/vmw_vmci/vmci_datagram.c]
|
| 16/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 16839
output: 54
thoughts: 21
Thoughts: Here's my understanding of the thought process, from my expert perspective:
**Deep Dive into Datagram Dispatch**
Okay, so I'm looking at `dg_dispatch_as_host`, and my immediate thought is, "Ah, right, this is where we're actually queuing up the datagrams for processing." The core function here, as I'm seeing it, is the call to `vmci_ctx_enqueue_datagram`. It's clear that this is the pivotal moment; it's the entry point for getting the data payload into the VMCI framework's internal mechanisms. We're taking the datagram, presumably with all its necessary context and metadata, and handing it off to the VMCI context for management. This enqueuing process is critical, as it likely handles things like scheduling the datagram for delivery to the appropriate VM or host endpoint, managing resources, and potentially dealing with any flow control. So, `vmci_ctx_enqueue_datagram` is the workhorse here, and the focus of any performance tuning or debugging related to datagram traffic will likely center on this critical function and any dependencies it might have. This is where I'd start looking for bottlenecks or potential optimization opportunities. I'm noting the tight coupling between the dispatch process and the datagram queuing mechanisms, understanding that one directly feeds into the other.
|
| 17/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_enqueue_datagram]
Results: map[SourceCode: 273: /*
274: * Queues a VMCI datagram for the appropriate target VM context.
275: */
276: int vmci_ctx_enqueue_datagram(u32 cid, struct vmci_datagram *dg)
277: {
278: struct vmci_datagram_queue_entry *dq_entry;
279: struct vmci_ctx *context;
280: struct vmci_handle dg_src;
281: size_t vmci_dg_size;
282:
283: vmci_dg_size = VMCI_DG_SIZE(dg);
284: if (vmci_dg_size > VMCI_MAX_DG_SIZE) {
285: pr_devel("Datagram too large (bytes=%zu)\n", vmci_dg_size);
286: return VMCI_ERROR_INVALID_ARGS;
287: }
288:
289: /* Get the target VM's VMCI context. */
290: context = vmci_ctx_get(cid);
291: if (!context) {
292: pr_devel("Invalid context (ID=0x%x)\n", cid);
293: return VMCI_ERROR_INVALID_ARGS;
294: }
295:
296: /* Allocate guest call entry and add it to the target VM's queue. */
297: dq_entry = kmalloc_obj(*dq_entry);
298: if (dq_entry == NULL) {
299: pr_warn("Failed to allocate memory for datagram\n");
300: vmci_ctx_put(context);
301: return VMCI_ERROR_NO_MEM;
302: }
303: dq_entry->dg = dg;
304: dq_entry->dg_size = vmci_dg_size;
305: dg_src = dg->src;
306: INIT_LIST_HEAD(&dq_entry->list_item);
307:
308: spin_lock(&context->lock);
309:
310: /*
311: * We put a higher limit on datagrams from the hypervisor. If
312: * the pending datagram is not from hypervisor, then we check
313: * if enqueueing it would exceed the
314: * VMCI_MAX_DATAGRAM_QUEUE_SIZE limit on the destination. If
315: * the pending datagram is from hypervisor, we allow it to be
316: * queued at the destination side provided we don't reach the
317: * VMCI_MAX_DATAGRAM_AND_EVENT_QUEUE_SIZE limit.
318: */
319: if (context->datagram_queue_size + vmci_dg_size >=
320: VMCI_MAX_DATAGRAM_QUEUE_SIZE &&
321: (!vmci_handle_is_equal(dg_src,
322: vmci_make_handle
323: (VMCI_HYPERVISOR_CONTEXT_ID,
324: VMCI_CONTEXT_RESOURCE_ID)) ||
325: context->datagram_queue_size + vmci_dg_size >=
326: VMCI_MAX_DATAGRAM_AND_EVENT_QUEUE_SIZE)) {
327: spin_unlock(&context->lock);
328: vmci_ctx_put(context);
329: kfree(dq_entry);
330: pr_devel("Context (ID=0x%x) receive queue is full\n", cid);
331: return VMCI_ERROR_NO_RESOURCES;
332: }
333:
334: list_add(&dq_entry->list_item, &context->datagram_queue);
335: context->pending_datagrams++;
336: context->datagram_queue_size += vmci_dg_size;
337: ctx_signal_notify(context);
338: wake_up(&context->host_context.wait_queue);
339: spin_unlock(&context->lock);
340: vmci_ctx_put(context);
341:
342: return vmci_dg_size;
343: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 18/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 18439
output: 51
thoughts: 59
Thoughts: Okay, here's my interpretation of that code snippet, presented as my own thought process:
**Context Management in `vmci_ctx_enqueue_datagram`**
Alright, let's break this down. Line 340 of `vmci_ctx_enqueue_datagram` is where things get interesting. I see that it's calling `vmci_ctx_put(context)`. The key here is understanding the lifecycle of this `context` object. It seems `vmci_ctx_enqueue_datagram` is responsible for managing its reference count, likely to ensure that resources are properly freed when no longer needed. So, this `vmci_ctx_put` call suggests that this function is releasing its own reference to the context, decrementing the refcount.
Now, the important part: `vmci_ctx_put` itself calls `ctx_free_ctx` if and only if the reference count drops to zero. That's the crucial mechanism for deallocation. Essentially, `ctx_free_ctx` is where the actual memory and resources associated with the context are released. It’s the final step in the context’s lifecycle, executed only when all users of the context have indicated that they are done with it. We also see this same mechanism in the error paths. This is good practice. This ensures we clean up resources if something goes wrong. This looks like a solid, thread-safe context management system.
|
| 19/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_put]
Results: map[SourceCode: 466: /*
467: * Drops reference to VMCI context. If this is the last reference to
468: * the context it will be deallocated. A context is created with
469: * a reference count of one, and on destroy, it is removed from
470: * the context list before its reference count is decremented. Thus,
471: * if we reach zero, we are sure that nobody else are about to increment
472: * it (they need the entry in the context list for that), and so there
473: * is no need for locking.
474: */
475: void vmci_ctx_put(struct vmci_ctx *context)
476: {
477: kref_put(&context->kref, ctx_free_ctx);
478: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 20/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 19118
output: 50
thoughts: 19
Thoughts: Okay, here's my interpretation of those thoughts, summarized from my perspective as an expert in the field:
**Decoding the Context Release**
Alright, so I'm seeing a critical link here. We've got `ctx_free_ctx` and it's calling `vmci_qp_broker_detach`. This is pretty telling. It means that when a context, likely a virtual machine context or some related resource, is being freed, we're explicitly detaching it from the VMCI (Virtual Machine Communication Interface) queue broker.
This screams resource management, specifically connection termination and deallocation. I'm inferring that the `vmci_qp_broker_detach` function is responsible for cleanly severing the connection and any associated data structures between the freeing context and the broker that manages the communication queues. This is essential to prevent dangling pointers, resource leaks, and potential corruption or conflicts within the VMCI subsystem. We want to avoid any lingering references and ensure all resources associated with that context are released when it's no longer needed. So, this call to the `vmci_qp_broker_detach` is right where it should be. Proper context cleanup is crucial for stability and reliability.
|
| 21/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:ctx_free_ctx]
Results: map[SourceCode: 399: /*
400: * Deallocates all parts of a context data structure. This
401: * function doesn't lock the context, because it assumes that
402: * the caller was holding the last reference to context.
403: */
404: static void ctx_free_ctx(struct kref *kref)
405: {
406: struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
407: struct vmci_datagram_queue_entry *dq_entry, *dq_entry_tmp;
408: struct vmci_handle temp_handle;
409: struct vmci_handle_list *notifier, *tmp;
410:
411: /*
412: * Fire event to all contexts interested in knowing this
413: * context is dying.
414: */
415: ctx_fire_notification(context->cid, context->priv_flags);
416:
417: /*
418: * Cleanup all queue pair resources attached to context. If
419: * the VM dies without cleaning up, this code will make sure
420: * that no resources are leaked.
421: */
422: temp_handle = vmci_handle_arr_get_entry(context->queue_pair_array, 0);
423: while (!vmci_handle_is_equal(temp_handle, VMCI_INVALID_HANDLE)) {
424: if (vmci_qp_broker_detach(temp_handle,
425: context) < VMCI_SUCCESS) {
426: /*
427: * When vmci_qp_broker_detach() succeeds it
428: * removes the handle from the array. If
429: * detach fails, we must remove the handle
430: * ourselves.
431: */
432: vmci_handle_arr_remove_entry(context->queue_pair_array,
433: temp_handle);
434: }
435: temp_handle =
436: vmci_handle_arr_get_entry(context->queue_pair_array, 0);
437: }
438:
439: /*
440: * It is fine to destroy this without locking the callQueue, as
441: * this is the only thread having a reference to the context.
442: */
443: list_for_each_entry_safe(dq_entry, dq_entry_tmp,
444: &context->datagram_queue, list_item) {
445: WARN_ON(dq_entry->dg_size != VMCI_DG_SIZE(dq_entry->dg));
446: list_del(&dq_entry->list_item);
447: kfree(dq_entry->dg);
448: kfree(dq_entry);
449: }
450:
451: list_for_each_entry_safe(notifier, tmp,
452: &context->notifier_list, node) {
453: list_del(¬ifier->node);
454: kfree(notifier);
455: }
456:
457: vmci_handle_arr_destroy(context->queue_pair_array);
458: vmci_handle_arr_destroy(context->doorbell_array);
459: vmci_handle_arr_destroy(context->pending_doorbell_array);
460: vmci_ctx_unset_notify(context);
461: if (context->cred)
462: put_cred(context->cred);
463: kfree(context);
464: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 22/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 20530
output: 51
thoughts: 355
Thoughts: **The Deadlock Conundrum**
Okay, let's break this down. The problem seems to be a deadlock triggered by `vmci_qp_broker_detach`. The sequence is: `vmci_qp_broker_detach` grabs `qp_broker_list.mutex`, then calls `qp_notify_peer`, which in turn calls `vmci_datagram_dispatch`. `vmci_datagram_dispatch` eventually reaches `vmci_ctx_enqueue_datagram` via `dg_dispatch_as_host`. Inside `vmci_ctx_enqueue_datagram`, we have the critical section: grab the context using `vmci_ctx_get(cid)`, enqueue the datagram, and then release the context with `vmci_ctx_put(context)`. The `vmci_ctx_put` has the potential to call `ctx_free_ctx` if the reference count goes to zero, which then *again* calls `vmci_qp_broker_detach` for all queue pairs attached to that context. This is where the potential deadlock appears, because it's trying to re-acquire the `qp_broker_list.mutex` that it *already* holds.
Now, wait a minute. How does `vmci_ctx_put` drop the refcount to zero? This means, if I'm understanding this correctly, that the context must have been in the process of being destroyed *before* `vmci_ctx_enqueue_datagram` even got the context. The crucial point is `vmci_ctx_get(cid)` acquiring a reference, and then `vmci_ctx_put(context)` releasing it. So if the context was concurrently being destroyed, how did `vmci_ctx_get(cid)` even *find* it in order to get a reference? It should have already gone away. That's the crux of the problem. Time to dive into the code for `vmci_ctx_get` and see what's going on there.
|
| 23/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_get]
Results: map[SourceCode: 368: /*
369: * Retrieves VMCI context corresponding to the given cid.
370: */
371: struct vmci_ctx *vmci_ctx_get(u32 cid)
372: {
373: struct vmci_ctx *c, *context = NULL;
374:
375: if (cid == VMCI_INVALID_ID)
376: return NULL;
377:
378: rcu_read_lock();
379: list_for_each_entry_rcu(c, &ctx_list.head, list_item) {
380: if (c->cid == cid) {
381: /*
382: * The context owner drops its own reference to the
383: * context only after removing it from the list and
384: * waiting for RCU grace period to expire. This
385: * means that we are not about to increase the
386: * reference count of something that is in the
387: * process of being destroyed.
388: */
389: context = c;
390: kref_get(&context->kref);
391: break;
392: }
393: }
394: rcu_read_unlock();
395:
396: return context;
397: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 24/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 21803
output: 51
thoughts: 72
Thoughts: Here's my understanding of the situation, presented as if it were my thought process:
**Deconstructing Context Destruction in VMCI**
Okay, so I'm reading this comment and I need to break down this `vmci_ctx_destroy` logic. The key takeaway from the comment is that there's a specific order of operations to avoid race conditions during context teardown. Essentially, the code protects against destroying something while its references are being incremented. The context owner *first* removes the context from the global list, *then* waits for the RCU (Read-Copy-Update) grace period to expire, and *only after that* does it release its own reference to the context. This sequence implies a careful dance to ensure that we don't accidentally try to use a context in the middle of destruction, which could be catastrophic, obviously!
Now, it's time to dig into the `vmci_ctx_destroy` function itself to see how this strategy is implemented at the code level. The comment has given me the high-level strategy and I now need to map it to the actual implementation. I'll be looking for confirmation of the sequence described in the comment: the unlinking, the grace period, and the final dereference. That's where the rubber meets the road.
|
| 25/2 |
2026/05/09 22:05 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_destroy]
Results: map[SourceCode: 185: /*
186: * Destroy VMCI context.
187: */
188: void vmci_ctx_destroy(struct vmci_ctx *context)
189: {
190: spin_lock(&ctx_list.lock);
191: list_del_rcu(&context->list_item);
192: spin_unlock(&ctx_list.lock);
193: synchronize_rcu();
194:
195: vmci_ctx_put(context);
196: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 26/2 |
2026/05/09 22:05 |
llm |
debugger |
0m
Model:
Tokens:
input: 22396
output: 55
thoughts: 1681
Thoughts: **Deadlock Analysis in VMCI Context Destruction**
Okay, so I'm looking at this VMCI code, and I see a potential race condition and subsequent deadlock scenario. It starts with the interaction between `vmci_ctx_destroy` and `vmci_ctx_get`. My initial thought was: if `vmci_ctx_destroy` removes a context from the list, calls `synchronize_rcu`, and then `vmci_ctx_put`, how can `vmci_ctx_get` even *find* the context? Digging into the stack trace, I find:
`vmci_qp_broker_detach -> vmci_ctx_put -> ctx_free_ctx -> kref_put`
It looks like `vmci_ctx_enqueue_datagram` is calling `vmci_ctx_put`, which is dropping the reference count to zero. But, `vmci_ctx_get` just *acquired* a reference! So, before the `kref_get`, the refcount was at least 1, and after `kref_get`, it's at least 2. Then, `vmci_ctx_put` drops it by one. How can it reach zero? It's concurrent access!
It's `vmci_ctx_destroy`! If it's called concurrently, it removes the context, waits on RCU, then calls `vmci_ctx_put`. If `vmci_ctx_get` found it *before* it was removed, it increments the refcount. Since `vmci_ctx_get` is inside `rcu_read_lock`, `synchronize_rcu()` waits for `vmci_ctx_get` to finish. After `vmci_ctx_get` drops `rcu_read_unlock()`, `synchronize_rcu()` can return, and then `vmci_ctx_destroy` calls `vmci_ctx_put`. At that point, the refcount is 1 (held by `vmci_ctx_enqueue_datagram`). When `vmci_ctx_enqueue_datagram` finishes, it calls `vmci_ctx_put`, dropping the refcount to 0! That's when `ctx_free_ctx` is called.
Here's where it gets interesting: `ctx_free_ctx` calls `vmci_qp_broker_detach` for *all* queue pairs. But `vmci_ctx_enqueue_datagram` was called from `dg_dispatch_as_host`, which was called from `vmci_datagram_dispatch`, which was called from `qp_notify_peer`, which was called from `vmci_qp_broker_detach`! And `vmci_qp_broker_detach` *already* holds `qp_broker_list.mutex`! So, `ctx_free_ctx` calls `vmci_qp_broker_detach` again, trying to acquire `qp_broker_list.mutex` AGAIN. DEADLOCK.
Let's break down the sequence:
* **Thread 1:** `vmci_qp_broker_detach` locks `qp_broker_list.mutex`, then calls `qp_notify_peer`. `qp_notify_peer` calls `vmci_datagram_dispatch`, then `dg_dispatch_as_host`, then `vmci_ctx_enqueue_datagram`. That calls `vmci_ctx_get` and *finds* the context, incrementing the reference count.
* **Thread 2:** runs `vmci_ctx_destroy`, removing from the list, then waits on RCU, then calls `vmci_ctx_put`, decrementing the reference count.
* **Back to Thread 1:** continues in `vmci_ctx_enqueue_datagram`, then it calls `vmci_ctx_put`, dropping the refcount to 0 and triggering `ctx_free_ctx`
* **In `ctx_free_ctx`**: then `vmci_qp_broker_detach` is called. And then `mutex_lock(&qp_broker_list.mutex)` is called. -> DEADLOCK.
Is Thread 1 operating on the *same* context as Thread 2? Yes! `vmci_qp_broker_detach` is called with a handle and context. `qp_notify_peer` sends a datagram to `peer_id`. So, `vmci_ctx_enqueue_datagram` is called with `cid = peer_id`. It gets *that* context, then puts it. If *that* context is being destroyed concurrently, its refcount drops to 0 in Thread 1, and `ctx_free_ctx` gets called for the
|
| 27/2 |
2026/05/09 22:06 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_detach]
Results: map[SourceCode:2064: /*
2065: * The main entry point for detaching from a queue pair registered with the
2066: * queue pair broker. If more than one endpoint is attached to the queue
2067: * pair, the first endpoint will mainly decrement a reference count and
2068: * generate a notification to its peer. The last endpoint will clean up
2069: * the queue pair state registered with the broker.
2070: *
2071: * When a guest endpoint detaches, it will unmap and unregister the guest
2072: * memory backing the queue pair. If the host is still attached, it will
2073: * no longer be able to access the queue pair content.
2074: *
2075: * If the queue pair is already in a state where there is no memory
2076: * registered for the queue pair (any *_NO_MEM state), it will transition to
2077: * the VMCIQPB_SHUTDOWN_NO_MEM state. This will also happen, if a guest
2078: * endpoint is the first of two endpoints to detach. If the host endpoint is
2079: * the first out of two to detach, the queue pair will move to the
2080: * VMCIQPB_SHUTDOWN_MEM state.
2081: */
2082: int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
2083: {
2084: struct qp_broker_entry *entry;
2085: const u32 context_id = vmci_ctx_get_id(context);
2086: u32 peer_id;
2087: bool is_local = false;
2088: int result;
2089:
2090: if (vmci_handle_is_invalid(handle) || !context ||
2091: context_id == VMCI_INVALID_ID) {
2092: return VMCI_ERROR_INVALID_ARGS;
2093: }
2094:
2095: mutex_lock(&qp_broker_list.mutex);
2096:
2097: if (!vmci_ctx_qp_exists(context, handle)) {
2098: pr_devel("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
2099: context_id, handle.context, handle.resource);
2100: result = VMCI_ERROR_NOT_FOUND;
2101: goto out;
2102: }
2103:
2104: entry = qp_broker_handle_to_entry(handle);
2105: if (!entry) {
2106: pr_devel("Context (ID=0x%x) reports being attached to queue pair(handle=0x%x:0x%x) that isn't present in broker\n",
2107: context_id, handle.context, handle.resource);
2108: result = VMCI_ERROR_NOT_FOUND;
2109: goto out;
2110: }
2111:
2112: if (context_id != entry->create_id && context_id != entry->attach_id) {
2113: result = VMCI_ERROR_QUEUEPAIR_NOTATTACHED;
2114: goto out;
2115: }
2116:
2117: if (context_id == entry->create_id) {
2118: peer_id = entry->attach_id;
2119: entry->create_id = VMCI_INVALID_ID;
2120: } else {
2121: peer_id = entry->create_id;
2122: entry->attach_id = VMCI_INVALID_ID;
2123: }
2124: entry->qp.ref_count--;
2125:
2126: is_local = entry->qp.flags & VMCI_QPFLAG_LOCAL;
2127:
2128: if (context_id != VMCI_HOST_CONTEXT_ID) {
2129: bool headers_mapped;
2130:
2131: /*
2132: * Pre NOVMVM vmx'en may detach from a queue pair
2133: * before setting the page store, and in that case
2134: * there is no user memory to detach from. Also, more
2135: * recent VMX'en may detach from a queue pair in the
2136: * quiesced state.
2137: */
2138:
2139: qp_acquire_queue_mutex(entry->produce_q);
2140: headers_mapped = entry->produce_q->q_header ||
2141: entry->consume_q->q_header;
2142: if (QPBROKERSTATE_HAS_MEM(entry)) {
2143: result =
2144: qp_host_unmap_queues(INVALID_VMCI_GUEST_MEM_ID,
2145: entry->produce_q,
2146: entry->consume_q);
2147: if (result < VMCI_SUCCESS)
2148: pr_warn("Failed to unmap queue headers for queue pair (handle=0x%x:0x%x,result=%d)\n",
2149: handle.context, handle.resource,
2150: result);
2151:
2152: qp_host_unregister_user_memory(entry->produce_q,
2153: entry->consume_q);
2154:
2155: }
2156:
2157: if (!headers_mapped)
2158: qp_reset_saved_headers(entry);
2159:
2160: qp_release_queue_mutex(entry->produce_q);
2161:
2162: if (!headers_mapped && entry->wakeup_cb)
2163: entry->wakeup_cb(entry->client_data);
2164:
2165: } else {
2166: if (entry->wakeup_cb) {
2167: entry->wakeup_cb = NULL;
2168: entry->client_data = NULL;
2169: }
2170: }
2171:
2172: if (entry->qp.ref_count == 0) {
2173: qp_list_remove_entry(&qp_broker_list, &entry->qp);
2174:
2175: if (is_local)
2176: kfree(entry->local_mem);
2177:
2178: qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
2179: qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
2180: qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
2181: /* Unlink from resource hash table and free callback */
2182: vmci_resource_remove(&entry->resource);
2183:
2184: kfree(entry);
2185:
2186: vmci_ctx_qp_destroy(context, handle);
2187: } else {
2188: qp_notify_peer(false, handle, context_id, peer_id);
2189: if (context_id == VMCI_HOST_CONTEXT_ID &&
2190: QPBROKERSTATE_HAS_MEM(entry)) {
2191: entry->state = VMCIQPB_SHUTDOWN_MEM;
2192: } else {
2193: entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
2194: }
2195:
2196: if (!is_local)
2197: vmci_ctx_qp_destroy(context, handle);
2198:
2199: }
2200: result = VMCI_SUCCESS;
2201: out:
2202: mutex_unlock(&qp_broker_list.mutex);
2203: return result;
2204: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 28/2 |
2026/05/09 22:06 |
llm |
debugger |
0m
Model:
Tokens:
input: 27437
output: 55
thoughts: 94
Thoughts: Okay, let me think this through.
**Optimization Considerations for `qp_notify_peer`**
Right, so I'm looking at this `qp_notify_peer` function and it's currently called *inside* the `mutex_lock(&qp_broker_list.mutex)` block. My initial thought is, can we gain some performance by moving it *outside* of the mutex? Seems like a good place to start optimization in this case. The contention on the mutex might be a bottleneck, and this could alleviate that.
However, if I pull `qp_notify_peer` out of the critical section, I'll need to capture some state. I'll need to save the `peer_id`, the `handle`, and the `context_id` before releasing the lock. That way, I can execute the notification with the correct parameters, even after we've released the lock, and ensure that the notification happens as intended.
Hang on a second... isn't `qp_notify_peer` also called within `vmci_qp_broker_alloc`? That's going to complicate things. I need to keep that in mind when making any changes. Okay, I have to ensure that any change will work for both scenarios. Back to the drawing board...
|
| 29/2 |
2026/05/09 22:06 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_alloc]
Results: map[SourceCode:1923: /*
1924: * Requests that a queue pair be allocated with the VMCI queue
1925: * pair broker. Allocates a queue pair entry if one does not
1926: * exist. Attaches to one if it exists, and retrieves the page
1927: * files backing that queue_pair. Assumes that the queue pair
1928: * broker lock is held.
1929: */
1930: int vmci_qp_broker_alloc(struct vmci_handle handle,
1931: u32 peer,
1932: u32 flags,
1933: u32 priv_flags,
1934: u64 produce_size,
1935: u64 consume_size,
1936: struct vmci_qp_page_store *page_store,
1937: struct vmci_ctx *context)
1938: {
1939: if (!QP_SIZES_ARE_VALID(produce_size, consume_size))
1940: return VMCI_ERROR_NO_RESOURCES;
1941:
1942: return qp_broker_alloc(handle, peer, flags, priv_flags,
1943: produce_size, consume_size,
1944: page_store, context, NULL, NULL, NULL, NULL);
1945: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 30/2 |
2026/05/09 22:06 |
llm |
debugger |
0m
Model:
Tokens:
input: 28268
output: 52
thoughts: 11
Thoughts: Okay, here's my summary, presented as a stream of thought:
**Checking `qp_broker_alloc`**
Right, let's get down to it. Time to check `qp_broker_alloc`. I know this code pretty well, so I need to make sure my understanding is accurate and up to date. This function is critical for... well, for the obvious reasons – it's all about resource allocation, specifically within the broker, and any issues here can cascade into serious performance problems or even outright failures. My initial thought is to quickly review what the function does and what specific resources it handles. Then, I should probably check the error handling; that's always a point of concern with allocation functions. I need to refresh my memory on any recent changes to the allocation strategies as well. Any memory leaks or fragmentation possibilities will be top of mind. Let’s start with a quick overview.
|
| 31/2 |
2026/05/09 22:06 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_alloc]
Results: map[SourceCode:1692: /*
1693: * queue_pair_Alloc for use when setting up queue pair endpoints
1694: * on the host.
1695: */
1696: static int qp_broker_alloc(struct vmci_handle handle,
1697: u32 peer,
1698: u32 flags,
1699: u32 priv_flags,
1700: u64 produce_size,
1701: u64 consume_size,
1702: struct vmci_qp_page_store *page_store,
1703: struct vmci_ctx *context,
1704: vmci_event_release_cb wakeup_cb,
1705: void *client_data,
1706: struct qp_broker_entry **ent,
1707: bool *swap)
1708: {
1709: const u32 context_id = vmci_ctx_get_id(context);
1710: bool create;
1711: struct qp_broker_entry *entry = NULL;
1712: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1713: int result;
1714:
1715: if (vmci_handle_is_invalid(handle) ||
1716: (flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
1717: !(produce_size || consume_size) ||
1718: !context || context_id == VMCI_INVALID_ID ||
1719: handle.context == VMCI_INVALID_ID) {
1720: return VMCI_ERROR_INVALID_ARGS;
1721: }
1722:
1723: if (page_store && !VMCI_QP_PAGESTORE_IS_WELLFORMED(page_store))
1724: return VMCI_ERROR_INVALID_ARGS;
1725:
1726: /*
1727: * In the initial argument check, we ensure that non-vmkernel hosts
1728: * are not allowed to create local queue pairs.
1729: */
1730:
1731: mutex_lock(&qp_broker_list.mutex);
1732:
1733: if (!is_local && vmci_ctx_qp_exists(context, handle)) {
1734: pr_devel("Context (ID=0x%x) already attached to queue pair (handle=0x%x:0x%x)\n",
1735: context_id, handle.context, handle.resource);
1736: mutex_unlock(&qp_broker_list.mutex);
1737: return VMCI_ERROR_ALREADY_EXISTS;
1738: }
1739:
1740: if (handle.resource != VMCI_INVALID_ID)
1741: entry = qp_broker_handle_to_entry(handle);
1742:
1743: if (!entry) {
1744: create = true;
1745: result =
1746: qp_broker_create(handle, peer, flags, priv_flags,
1747: produce_size, consume_size, page_store,
1748: context, wakeup_cb, client_data, ent);
1749: } else {
1750: create = false;
1751: result =
1752: qp_broker_attach(entry, peer, flags, priv_flags,
1753: produce_size, consume_size, page_store,
1754: context, wakeup_cb, client_data, ent);
1755: }
1756:
1757: mutex_unlock(&qp_broker_list.mutex);
1758:
1759: if (swap)
1760: *swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
1761: !(create && is_local);
1762:
1763: return result;
1764: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 32/2 |
2026/05/09 22:06 |
llm |
debugger |
0m
Model:
Tokens:
input: 29686
output: 52
thoughts: 48
Thoughts: Okay, here's my interpretation of those thoughts, tailored for an expert audience, presented in the first person:
**Critical Threading Inquiry**
Alright, let me just run this scenario through my head... I'm looking at `qp_broker_alloc` and trying to pin down its interactions with the broker infrastructure. I see that `qp_broker_alloc` is calling either `qp_broker_create` or `qp_broker_attach`, and the critical thing here is that it's doing so *while* holding the `qp_broker_list.mutex`. Now I have to ask myself, is there a call to `qp_notify_peer` somewhere in that code path? The question that immediately arises is how this could impact deadlock, contention, and the overall reliability and performance of the queue pairs. I have to think about whether those calls could possibly trigger any callbacks, message handling, or asynchronous operations that might introduce reentrancy issues or lock dependencies. This is the critical point: I need to determine if we've created a potential point of contention or, worse, a deadlock scenario within the queue pair locking model. It's a key area to scrutinize.
|
| 33/2 |
2026/05/09 22:06 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_attach]
Results: map[SourceCode:1490: /*
1491: * The second endpoint issuing a queue pair allocation will attach to
1492: * the queue pair registered with the queue pair broker.
1493: *
1494: * If the attacher is a guest, it will associate a VMX virtual address
1495: * range with the queue pair as specified by the page_store. At this
1496: * point, the already attach host endpoint may start using the queue
1497: * pair, and an attach event is sent to it. For compatibility with
1498: * older VMX'en, that used a separate step to set the VMX virtual
1499: * address range, the virtual address range can be registered later
1500: * using vmci_qp_broker_set_page_store. In that case, a page_store of
1501: * NULL should be used, and the attach event will be generated once
1502: * the actual page store has been set.
1503: *
1504: * If the attacher is the host, a page_store of NULL should be used as
1505: * well, since the page store information is already set by the guest.
1506: *
1507: * For new VMX and host callers, the queue pair will be moved to the
1508: * VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
1509: * moved to the VMCOQPB_ATTACHED_NO_MEM state.
1510: */
1511: static int qp_broker_attach(struct qp_broker_entry *entry,
1512: u32 peer,
1513: u32 flags,
1514: u32 priv_flags,
1515: u64 produce_size,
1516: u64 consume_size,
1517: struct vmci_qp_page_store *page_store,
1518: struct vmci_ctx *context,
1519: vmci_event_release_cb wakeup_cb,
1520: void *client_data,
1521: struct qp_broker_entry **ent)
1522: {
1523: const u32 context_id = vmci_ctx_get_id(context);
1524: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1525: int result;
1526:
1527: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
1528: entry->state != VMCIQPB_CREATED_MEM)
1529: return VMCI_ERROR_UNAVAILABLE;
1530:
1531: if (is_local) {
1532: if (!(entry->qp.flags & VMCI_QPFLAG_LOCAL) ||
1533: context_id != entry->create_id) {
1534: return VMCI_ERROR_INVALID_ARGS;
1535: }
1536: } else if (context_id == entry->create_id ||
1537: context_id == entry->attach_id) {
1538: return VMCI_ERROR_ALREADY_EXISTS;
1539: }
1540:
1541: if (VMCI_CONTEXT_IS_VM(context_id) &&
1542: VMCI_CONTEXT_IS_VM(entry->create_id))
1543: return VMCI_ERROR_DST_UNREACHABLE;
1544:
1545: /*
1546: * If we are attaching from a restricted context then the queuepair
1547: * must have been created by a trusted endpoint.
1548: */
1549: if ((context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED) &&
1550: !entry->created_by_trusted)
1551: return VMCI_ERROR_NO_ACCESS;
1552:
1553: /*
1554: * If we are attaching to a queuepair that was created by a restricted
1555: * context then we must be trusted.
1556: */
1557: if (entry->require_trusted_attach &&
1558: (!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED)))
1559: return VMCI_ERROR_NO_ACCESS;
1560:
1561: /*
1562: * If the creator specifies VMCI_INVALID_ID in "peer" field, access
1563: * control check is not performed.
1564: */
1565: if (entry->qp.peer != VMCI_INVALID_ID && entry->qp.peer != context_id)
1566: return VMCI_ERROR_NO_ACCESS;
1567:
1568: if (entry->create_id == VMCI_HOST_CONTEXT_ID) {
1569: /*
1570: * Do not attach if the caller doesn't support Host Queue Pairs
1571: * and a host created this queue pair.
1572: */
1573:
1574: if (!vmci_ctx_supports_host_qp(context))
1575: return VMCI_ERROR_INVALID_RESOURCE;
1576:
1577: } else if (context_id == VMCI_HOST_CONTEXT_ID) {
1578: struct vmci_ctx *create_context;
1579: bool supports_host_qp;
1580:
1581: /*
1582: * Do not attach a host to a user created queue pair if that
1583: * user doesn't support host queue pair end points.
1584: */
1585:
1586: create_context = vmci_ctx_get(entry->create_id);
1587: supports_host_qp = vmci_ctx_supports_host_qp(create_context);
1588: vmci_ctx_put(create_context);
1589:
1590: if (!supports_host_qp)
1591: return VMCI_ERROR_INVALID_RESOURCE;
1592: }
1593:
1594: if ((entry->qp.flags & ~VMCI_QP_ASYMM) != (flags & ~VMCI_QP_ASYMM_PEER))
1595: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1596:
1597: if (context_id != VMCI_HOST_CONTEXT_ID) {
1598: /*
1599: * The queue pair broker entry stores values from the guest
1600: * point of view, so an attaching guest should match the values
1601: * stored in the entry.
1602: */
1603:
1604: if (entry->qp.produce_size != produce_size ||
1605: entry->qp.consume_size != consume_size) {
1606: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1607: }
1608: } else if (entry->qp.produce_size != consume_size ||
1609: entry->qp.consume_size != produce_size) {
1610: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1611: }
1612:
1613: if (context_id != VMCI_HOST_CONTEXT_ID) {
1614: /*
1615: * If a guest attached to a queue pair, it will supply
1616: * the backing memory. If this is a pre NOVMVM vmx,
1617: * the backing memory will be supplied by calling
1618: * vmci_qp_broker_set_page_store() following the
1619: * return of the vmci_qp_broker_alloc() call. If it is
1620: * a vmx of version NOVMVM or later, the page store
1621: * must be supplied as part of the
1622: * vmci_qp_broker_alloc call. Under all circumstances
1623: * must the initially created queue pair not have any
1624: * memory associated with it already.
1625: */
1626:
1627: if (entry->state != VMCIQPB_CREATED_NO_MEM)
1628: return VMCI_ERROR_INVALID_ARGS;
1629:
1630: if (page_store != NULL) {
1631: /*
1632: * Patch up host state to point to guest
1633: * supplied memory. The VMX already
1634: * initialized the queue pair headers, so no
1635: * need for the kernel side to do that.
1636: */
1637:
1638: result = qp_host_register_user_memory(page_store,
1639: entry->produce_q,
1640: entry->consume_q);
1641: if (result < VMCI_SUCCESS)
1642: return result;
1643:
1644: entry->state = VMCIQPB_ATTACHED_MEM;
1645: } else {
1646: entry->state = VMCIQPB_ATTACHED_NO_MEM;
1647: }
1648: } else if (entry->state == VMCIQPB_CREATED_NO_MEM) {
1649: /*
1650: * The host side is attempting to attach to a queue
1651: * pair that doesn't have any memory associated with
1652: * it. This must be a pre NOVMVM vmx that hasn't set
1653: * the page store information yet, or a quiesced VM.
1654: */
1655:
1656: return VMCI_ERROR_UNAVAILABLE;
1657: } else {
1658: /* The host side has successfully attached to a queue pair. */
1659: entry->state = VMCIQPB_ATTACHED_MEM;
1660: }
1661:
1662: if (entry->state == VMCIQPB_ATTACHED_MEM) {
1663: result =
1664: qp_notify_peer(true, entry->qp.handle, context_id,
1665: entry->create_id);
1666: if (result < VMCI_SUCCESS)
1667: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
1668: entry->create_id, entry->qp.handle.context,
1669: entry->qp.handle.resource);
1670: }
1671:
1672: entry->attach_id = context_id;
1673: entry->qp.ref_count++;
1674: if (wakeup_cb) {
1675: entry->wakeup_cb = wakeup_cb;
1676: entry->client_data = client_data;
1677: }
1678:
1679: /*
1680: * When attaching to local queue pairs, the context already has
1681: * an entry tracking the queue pair, so don't add another one.
1682: */
1683: if (!is_local)
1684: vmci_ctx_qp_create(context, entry->qp.handle);
1685:
1686: if (ent != NULL)
1687: *ent = entry;
1688:
1689: return VMCI_SUCCESS;
1690: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 34/2 |
2026/05/09 22:06 |
llm |
debugger |
0m
Model:
Tokens:
input: 33266
output: 50
thoughts: 387
Thoughts: **Analyzing a Potential Deadlock in the Queue Pair Broker**
Okay, let's break this down. I'm seeing that `qp_broker_attach` calls `qp_notify_peer` while already holding `qp_broker_list.mutex`. That makes sense; it's protecting a shared resource. And, naturally, `qp_broker_attach` itself is called from `qp_broker_alloc`, which *also* holds that same `qp_broker_list.mutex`. So far, so good, textbook locking strategy, protecting the broker list.
But then, at line 1588, things get interesting. `qp_broker_attach` calls `vmci_ctx_put(create_context)`. I know that function's job is to release a reference to a context, and if the reference count drops to zero, the context is freed. Crucially, the code snippet reveals the intent here with `ctx_free_ctx` called. Wait a minute... I remember `ctx_free_ctx` calls `vmci_qp_broker_detach`, which tries to grab `qp_broker_list.mutex`.
That's the problem! If `vmci_ctx_put` reduces the context refcount to zero, it leads to `ctx_free_ctx` being called, which in turn calls `vmci_qp_broker_detach`. And since `vmci_qp_broker_detach` attempts to acquire `qp_broker_list.mutex`, *and* we're already holding that mutex, we have a classic deadlock situation. It's a textbook circular dependency, and a recipe for disaster.
The root cause: `vmci_ctx_put` *cannot* be called while `qp_broker_list.mutex` is held. We have to separate the resource release from the context deallocation logic.
The fix I'm considering is to defer `ctx_free_ctx` to a workqueue. This would move the actual context free and broker detach operation out of the critical section protected by `qp_broker_list.mutex`. Before I proceed, I need to verify that deferring `ctx_free_ctx` won't introduce any new synchronization issues. I should check if deferring `ctx_free_ctx` is safe.
|
| 35/2 |
2026/05/09 22:06 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:ctx_free_ctx]
Results: map[SourceCode: 399: /*
400: * Deallocates all parts of a context data structure. This
401: * function doesn't lock the context, because it assumes that
402: * the caller was holding the last reference to context.
403: */
404: static void ctx_free_ctx(struct kref *kref)
405: {
406: struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
407: struct vmci_datagram_queue_entry *dq_entry, *dq_entry_tmp;
408: struct vmci_handle temp_handle;
409: struct vmci_handle_list *notifier, *tmp;
410:
411: /*
412: * Fire event to all contexts interested in knowing this
413: * context is dying.
414: */
415: ctx_fire_notification(context->cid, context->priv_flags);
416:
417: /*
418: * Cleanup all queue pair resources attached to context. If
419: * the VM dies without cleaning up, this code will make sure
420: * that no resources are leaked.
421: */
422: temp_handle = vmci_handle_arr_get_entry(context->queue_pair_array, 0);
423: while (!vmci_handle_is_equal(temp_handle, VMCI_INVALID_HANDLE)) {
424: if (vmci_qp_broker_detach(temp_handle,
425: context) < VMCI_SUCCESS) {
426: /*
427: * When vmci_qp_broker_detach() succeeds it
428: * removes the handle from the array. If
429: * detach fails, we must remove the handle
430: * ourselves.
431: */
432: vmci_handle_arr_remove_entry(context->queue_pair_array,
433: temp_handle);
434: }
435: temp_handle =
436: vmci_handle_arr_get_entry(context->queue_pair_array, 0);
437: }
438:
439: /*
440: * It is fine to destroy this without locking the callQueue, as
441: * this is the only thread having a reference to the context.
442: */
443: list_for_each_entry_safe(dq_entry, dq_entry_tmp,
444: &context->datagram_queue, list_item) {
445: WARN_ON(dq_entry->dg_size != VMCI_DG_SIZE(dq_entry->dg));
446: list_del(&dq_entry->list_item);
447: kfree(dq_entry->dg);
448: kfree(dq_entry);
449: }
450:
451: list_for_each_entry_safe(notifier, tmp,
452: &context->notifier_list, node) {
453: list_del(¬ifier->node);
454: kfree(notifier);
455: }
456:
457: vmci_handle_arr_destroy(context->queue_pair_array);
458: vmci_handle_arr_destroy(context->doorbell_array);
459: vmci_handle_arr_destroy(context->pending_doorbell_array);
460: vmci_ctx_unset_notify(context);
461: if (context->cred)
462: put_cred(context->cred);
463: kfree(context);
464: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 36/2 |
2026/05/09 22:06 |
llm |
debugger |
1m
Model:
Tokens:
input: 35282
output: 49
thoughts: 60
Thoughts: Here's my summary, as though I'm thinking through this problem:
**Deconstructing a VMCI Context Deadlock**
Okay, I'm looking at this deadlock issue, and it's pointing at `ctx_free_ctx`. The core idea is this: if we push the freeing of the context off to a workqueue, we should be able to sidestep the deadlock. That feels like a solid first approach.
Wait a second, though... I need to consider all the angles. `vmci_ctx_put` isn't a single-entry function, is it? It's called from a bunch of different places throughout the code. If we're going to defer the context release using a workqueue, then we'll need a work queue item within the context itself. That means we're going to need to add a `struct work_struct` member to the `struct vmci_ctx`. Okay, that's doable, but it increases the size of the structure. I'll need to think through the implications of that too, but it seems like the right approach for now.
|
| 37/2 |
2026/05/09 22:07 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx]
Results: map[SourceCode: 40: struct vmci_ctx {
41: struct list_head list_item; /* For global VMCI list. */
42: u32 cid;
43: struct kref kref;
44: struct list_head datagram_queue; /* Head of per VM queue. */
45: u32 pending_datagrams;
46: size_t datagram_queue_size; /* Size of datagram queue in bytes. */
47:
48: /*
49: * Version of the code that created
50: * this context; e.g., VMX.
51: */
52: int user_version;
53: spinlock_t lock; /* Locks callQueue and handle_arrays. */
54:
55: /*
56: * queue_pairs attached to. The array of
57: * handles for queue pairs is accessed
58: * from the code for QP API, and there
59: * it is protected by the QP lock. It
60: * is also accessed from the context
61: * clean up path, which does not
62: * require a lock. VMCILock is not
63: * used to protect the QP array field.
64: */
65: struct vmci_handle_arr *queue_pair_array;
66:
67: /* Doorbells created by context. */
68: struct vmci_handle_arr *doorbell_array;
69:
70: /* Doorbells pending for context. */
71: struct vmci_handle_arr *pending_doorbell_array;
72:
73: /* Contexts current context is subscribing to. */
74: struct list_head notifier_list;
75: unsigned int n_notifiers;
76:
77: struct vmci_host host_context;
78: u32 priv_flags;
79:
80: const struct cred *cred;
81: bool *notify; /* Notify flag pointer - hosted only. */
82: struct page *notify_page; /* Page backing the notify UVA. */
83: };
SourceFile:drivers/misc/vmw_vmci/vmci_context.h]
|
| 38/2 |
2026/05/09 22:07 |
llm |
debugger |
0m
Model:
Tokens:
input: 36268
output: 52
thoughts: 671
Thoughts: **Analyzing `vmci_qp_broker_detach` and Peer Notification**
Okay, so I'm looking at this `vmci_qp_broker_detach` function, and I'm realizing something. We're currently calling `qp_notify_peer` while holding the `qp_broker_list.mutex`. My initial thought was to simply add a `work_struct` to `vmci_ctx`, but that might be overkill. Is there a more elegant solution?
Let's dissect `vmci_qp_broker_detach`. The critical part seems to be whether or not the queue is actually being destroyed. If `entry->qp.ref_count` is zero, we're removing it entirely, cleaning up memory, and then *finally* calling `vmci_ctx_qp_destroy`. In the `else` block, where `ref_count` isn't zero, we call `qp_notify_peer`. And *that's* the bit protected by the mutex.
Now, if we move `qp_notify_peer` after the `mutex_unlock(&qp_broker_list.mutex)`:
```c
bool do_notify = false;
...
} else {
do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
} else {
entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
}
if (!is_local)
vmci_ctx_qp_destroy(context, handle);
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
This *should* work. We set a `do_notify` flag. We perform all the state updates *inside* the mutex block, and only make the notification outside the lock. But... wait. I need to make sure this doesn't create any new race conditions. Let's make sure that `qp_broker_attach` doesn't also call `qp_notify_peer` while holding the same lock! We need to follow all the call paths and verify there isn't another place this is called.
|
| 39/2 |
2026/05/09 22:07 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_attach]
Results: map[SourceCode:1490: /*
1491: * The second endpoint issuing a queue pair allocation will attach to
1492: * the queue pair registered with the queue pair broker.
1493: *
1494: * If the attacher is a guest, it will associate a VMX virtual address
1495: * range with the queue pair as specified by the page_store. At this
1496: * point, the already attach host endpoint may start using the queue
1497: * pair, and an attach event is sent to it. For compatibility with
1498: * older VMX'en, that used a separate step to set the VMX virtual
1499: * address range, the virtual address range can be registered later
1500: * using vmci_qp_broker_set_page_store. In that case, a page_store of
1501: * NULL should be used, and the attach event will be generated once
1502: * the actual page store has been set.
1503: *
1504: * If the attacher is the host, a page_store of NULL should be used as
1505: * well, since the page store information is already set by the guest.
1506: *
1507: * For new VMX and host callers, the queue pair will be moved to the
1508: * VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
1509: * moved to the VMCOQPB_ATTACHED_NO_MEM state.
1510: */
1511: static int qp_broker_attach(struct qp_broker_entry *entry,
1512: u32 peer,
1513: u32 flags,
1514: u32 priv_flags,
1515: u64 produce_size,
1516: u64 consume_size,
1517: struct vmci_qp_page_store *page_store,
1518: struct vmci_ctx *context,
1519: vmci_event_release_cb wakeup_cb,
1520: void *client_data,
1521: struct qp_broker_entry **ent)
1522: {
1523: const u32 context_id = vmci_ctx_get_id(context);
1524: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1525: int result;
1526:
1527: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
1528: entry->state != VMCIQPB_CREATED_MEM)
1529: return VMCI_ERROR_UNAVAILABLE;
1530:
1531: if (is_local) {
1532: if (!(entry->qp.flags & VMCI_QPFLAG_LOCAL) ||
1533: context_id != entry->create_id) {
1534: return VMCI_ERROR_INVALID_ARGS;
1535: }
1536: } else if (context_id == entry->create_id ||
1537: context_id == entry->attach_id) {
1538: return VMCI_ERROR_ALREADY_EXISTS;
1539: }
1540:
1541: if (VMCI_CONTEXT_IS_VM(context_id) &&
1542: VMCI_CONTEXT_IS_VM(entry->create_id))
1543: return VMCI_ERROR_DST_UNREACHABLE;
1544:
1545: /*
1546: * If we are attaching from a restricted context then the queuepair
1547: * must have been created by a trusted endpoint.
1548: */
1549: if ((context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED) &&
1550: !entry->created_by_trusted)
1551: return VMCI_ERROR_NO_ACCESS;
1552:
1553: /*
1554: * If we are attaching to a queuepair that was created by a restricted
1555: * context then we must be trusted.
1556: */
1557: if (entry->require_trusted_attach &&
1558: (!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED)))
1559: return VMCI_ERROR_NO_ACCESS;
1560:
1561: /*
1562: * If the creator specifies VMCI_INVALID_ID in "peer" field, access
1563: * control check is not performed.
1564: */
1565: if (entry->qp.peer != VMCI_INVALID_ID && entry->qp.peer != context_id)
1566: return VMCI_ERROR_NO_ACCESS;
1567:
1568: if (entry->create_id == VMCI_HOST_CONTEXT_ID) {
1569: /*
1570: * Do not attach if the caller doesn't support Host Queue Pairs
1571: * and a host created this queue pair.
1572: */
1573:
1574: if (!vmci_ctx_supports_host_qp(context))
1575: return VMCI_ERROR_INVALID_RESOURCE;
1576:
1577: } else if (context_id == VMCI_HOST_CONTEXT_ID) {
1578: struct vmci_ctx *create_context;
1579: bool supports_host_qp;
1580:
1581: /*
1582: * Do not attach a host to a user created queue pair if that
1583: * user doesn't support host queue pair end points.
1584: */
1585:
1586: create_context = vmci_ctx_get(entry->create_id);
1587: supports_host_qp = vmci_ctx_supports_host_qp(create_context);
1588: vmci_ctx_put(create_context);
1589:
1590: if (!supports_host_qp)
1591: return VMCI_ERROR_INVALID_RESOURCE;
1592: }
1593:
1594: if ((entry->qp.flags & ~VMCI_QP_ASYMM) != (flags & ~VMCI_QP_ASYMM_PEER))
1595: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1596:
1597: if (context_id != VMCI_HOST_CONTEXT_ID) {
1598: /*
1599: * The queue pair broker entry stores values from the guest
1600: * point of view, so an attaching guest should match the values
1601: * stored in the entry.
1602: */
1603:
1604: if (entry->qp.produce_size != produce_size ||
1605: entry->qp.consume_size != consume_size) {
1606: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1607: }
1608: } else if (entry->qp.produce_size != consume_size ||
1609: entry->qp.consume_size != produce_size) {
1610: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1611: }
1612:
1613: if (context_id != VMCI_HOST_CONTEXT_ID) {
1614: /*
1615: * If a guest attached to a queue pair, it will supply
1616: * the backing memory. If this is a pre NOVMVM vmx,
1617: * the backing memory will be supplied by calling
1618: * vmci_qp_broker_set_page_store() following the
1619: * return of the vmci_qp_broker_alloc() call. If it is
1620: * a vmx of version NOVMVM or later, the page store
1621: * must be supplied as part of the
1622: * vmci_qp_broker_alloc call. Under all circumstances
1623: * must the initially created queue pair not have any
1624: * memory associated with it already.
1625: */
1626:
1627: if (entry->state != VMCIQPB_CREATED_NO_MEM)
1628: return VMCI_ERROR_INVALID_ARGS;
1629:
1630: if (page_store != NULL) {
1631: /*
1632: * Patch up host state to point to guest
1633: * supplied memory. The VMX already
1634: * initialized the queue pair headers, so no
1635: * need for the kernel side to do that.
1636: */
1637:
1638: result = qp_host_register_user_memory(page_store,
1639: entry->produce_q,
1640: entry->consume_q);
1641: if (result < VMCI_SUCCESS)
1642: return result;
1643:
1644: entry->state = VMCIQPB_ATTACHED_MEM;
1645: } else {
1646: entry->state = VMCIQPB_ATTACHED_NO_MEM;
1647: }
1648: } else if (entry->state == VMCIQPB_CREATED_NO_MEM) {
1649: /*
1650: * The host side is attempting to attach to a queue
1651: * pair that doesn't have any memory associated with
1652: * it. This must be a pre NOVMVM vmx that hasn't set
1653: * the page store information yet, or a quiesced VM.
1654: */
1655:
1656: return VMCI_ERROR_UNAVAILABLE;
1657: } else {
1658: /* The host side has successfully attached to a queue pair. */
1659: entry->state = VMCIQPB_ATTACHED_MEM;
1660: }
1661:
1662: if (entry->state == VMCIQPB_ATTACHED_MEM) {
1663: result =
1664: qp_notify_peer(true, entry->qp.handle, context_id,
1665: entry->create_id);
1666: if (result < VMCI_SUCCESS)
1667: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
1668: entry->create_id, entry->qp.handle.context,
1669: entry->qp.handle.resource);
1670: }
1671:
1672: entry->attach_id = context_id;
1673: entry->qp.ref_count++;
1674: if (wakeup_cb) {
1675: entry->wakeup_cb = wakeup_cb;
1676: entry->client_data = client_data;
1677: }
1678:
1679: /*
1680: * When attaching to local queue pairs, the context already has
1681: * an entry tracking the queue pair, so don't add another one.
1682: */
1683: if (!is_local)
1684: vmci_ctx_qp_create(context, entry->qp.handle);
1685:
1686: if (ent != NULL)
1687: *ent = entry;
1688:
1689: return VMCI_SUCCESS;
1690: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 40/2 |
2026/05/09 22:07 |
llm |
debugger |
0m
Model:
Tokens:
input: 40769
output: 50
thoughts: 151
Thoughts: **Addressing the Thread Safety Concerns**
Okay, so I've confirmed that `qp_broker_attach` does indeed call `qp_notify_peer` while holding `qp_broker_list.mutex`. And, annoyingly, `vmci_ctx_put(create_context)` is also executed within the protected scope of the mutex. This is problematic; it's a potential deadlock situation I need to address.
But wait a minute... I think I've got a solution! If I defer the actual freeing of the context with `ctx_free_ctx`, I should be able to kill two birds with one stone, solving both of these mutex contention issues. I can leverage the existing `kref_put` mechanism in `vmci_ctx_put`.
The current implementation uses `kref_put(&context->kref, ctx_free_ctx)`. The key is to change `kref_put` and I can change `vmci_ctx_put` to schedule a work item to call `ctx_free_ctx`! Instead of directly calling `ctx_free_ctx` immediately, I'll need to make it schedule a work item, so the actual freeing happens later, outside of the critical section. That should resolve the mutex conflicts.
|
| 41/2 |
2026/05/09 22:07 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:ctx_free_ctx]
Results: map[SourceCode: 399: /*
400: * Deallocates all parts of a context data structure. This
401: * function doesn't lock the context, because it assumes that
402: * the caller was holding the last reference to context.
403: */
404: static void ctx_free_ctx(struct kref *kref)
405: {
406: struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
407: struct vmci_datagram_queue_entry *dq_entry, *dq_entry_tmp;
408: struct vmci_handle temp_handle;
409: struct vmci_handle_list *notifier, *tmp;
410:
411: /*
412: * Fire event to all contexts interested in knowing this
413: * context is dying.
414: */
415: ctx_fire_notification(context->cid, context->priv_flags);
416:
417: /*
418: * Cleanup all queue pair resources attached to context. If
419: * the VM dies without cleaning up, this code will make sure
420: * that no resources are leaked.
421: */
422: temp_handle = vmci_handle_arr_get_entry(context->queue_pair_array, 0);
423: while (!vmci_handle_is_equal(temp_handle, VMCI_INVALID_HANDLE)) {
424: if (vmci_qp_broker_detach(temp_handle,
425: context) < VMCI_SUCCESS) {
426: /*
427: * When vmci_qp_broker_detach() succeeds it
428: * removes the handle from the array. If
429: * detach fails, we must remove the handle
430: * ourselves.
431: */
432: vmci_handle_arr_remove_entry(context->queue_pair_array,
433: temp_handle);
434: }
435: temp_handle =
436: vmci_handle_arr_get_entry(context->queue_pair_array, 0);
437: }
438:
439: /*
440: * It is fine to destroy this without locking the callQueue, as
441: * this is the only thread having a reference to the context.
442: */
443: list_for_each_entry_safe(dq_entry, dq_entry_tmp,
444: &context->datagram_queue, list_item) {
445: WARN_ON(dq_entry->dg_size != VMCI_DG_SIZE(dq_entry->dg));
446: list_del(&dq_entry->list_item);
447: kfree(dq_entry->dg);
448: kfree(dq_entry);
449: }
450:
451: list_for_each_entry_safe(notifier, tmp,
452: &context->notifier_list, node) {
453: list_del(¬ifier->node);
454: kfree(notifier);
455: }
456:
457: vmci_handle_arr_destroy(context->queue_pair_array);
458: vmci_handle_arr_destroy(context->doorbell_array);
459: vmci_handle_arr_destroy(context->pending_doorbell_array);
460: vmci_ctx_unset_notify(context);
461: if (context->cred)
462: put_cred(context->cred);
463: kfree(context);
464: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 42/2 |
2026/05/09 22:07 |
llm |
debugger |
0m
Model:
Tokens:
input: 42329
output: 24
thoughts: 251
Thoughts: **Asynchronous Cleanup of VMCI Contexts**
Okay, so I'm looking at how we're currently handling context destruction in the VMCI code, specifically focusing on `vmci_ctx_destroy`. The initial thought was, "Can we defer `ctx_free_ctx`? Maybe add an `rcu_head` or use a `work_struct`?" But then I remembered, `vmci_ctx_destroy` already calls `synchronize_rcu()`. So, using `INIT_WORK` and `schedule_work` to defer it might be redundant, or at least, not the most efficient approach.
Now, let's look at `vmci_ctx_destroy` itself. The code shows:
```c
spin_lock(&ctx_list.lock);
list_del_rcu(&context->list_item);
spin_unlock(&ctx_list.lock);
synchronize_rcu();
vmci_ctx_put(context);
```
The crucial point is that `vmci_ctx_put` *could* be scheduling a work item. If that's the case, then `vmci_ctx_destroy` will return before the context is *actually* freed. The real question is, is that a problem?
Typically, `vmci_ctx_destroy` is called during VM destruction or when the host context is closed. If it returns early, the context is still being cleaned up asynchronously in the background. My concern is, are there any potential race conditions or issues that arise from this asynchronous cleanup? It could introduce subtle timing problems. I need to understand whether this asynchronous cleanup is safe within the context of the larger system.
Time to trace where `vmci_ctx_destroy` is called and see what the wider implications are. I need to fully understand the context in which it's being used.
|
| 43/2 |
2026/05/09 22:08 |
tool |
codesearch-find-references |
0m
Args: map[Name:vmci_ctx_destroy]
Results: map[References:[map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_host_close SourceFile:drivers/misc/vmw_vmci/vmci_host.c SourceLine:143] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_host_do_init_context SourceFile:drivers/misc/vmw_vmci/vmci_host.c SourceLine:341] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_host_exit SourceFile:drivers/misc/vmw_vmci/vmci_host.c SourceLine:1022] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_host_init SourceFile:drivers/misc/vmw_vmci/vmci_host.c SourceLine:1006]] TruncatedOutput:false]
|
| 44/2 |
2026/05/09 22:08 |
llm |
debugger |
0m
Model:
Tokens:
input: 43268
output: 20
thoughts: 1410
Thoughts: **Analyzing Potential Deadlocks in VMCI Queue Pair Management**
Okay, let's break this down. I'm looking at potential deadlock scenarios within the VMCI code, specifically related to the queue pair (QP) broker and context management. It seems that the `qp_broker_list.mutex` lock is a point of contention.
First, the `vmci_host_close` function. It looks like `vmci_ctx_destroy` might be asynchronous. If that's the case, the file could close before the context is fully destroyed. Not necessarily a problem, but it prompts a closer look at potential race conditions.
My initial thought was, could the deadlock be related to the `vmci_ctx_put` call within the lock in `vmci_qp_broker_detach`? The idea is, can we avoid this particular `vmci_ctx_put` by moving the `qp_notify_peer` call outside the locked section? That looks doable. I can use a flag to indicate if a notification is necessary, then do it after unlocking the mutex.
Then, I spotted a similar pattern in `qp_broker_attach`. It also calls `qp_notify_peer` while holding the lock. This is the same concern. Can we move it too? Okay, `qp_broker_attach` is called from `qp_broker_alloc`, so the same flag and subsequent call pattern might work there as well. The question is, how do we get the right handle after the mutex is unlocked? Return a flag from `qp_broker_attach` to `qp_broker_alloc` to indicate notification? Yes, I can do that.
But wait, `qp_broker_attach` also has `vmci_ctx_put` within the locked section. Okay, now we're getting somewhere. The question is: why are we holding the lock while calling context management functions? What's going on here?
It looks like the `vmci_ctx_put` in `qp_broker_attach` is related to verifying `vmci_ctx_supports_host_qp`. I could potentially move that check *before* acquiring the lock, right? But no, I need `entry->create_id` which lives in the locked section.
Okay, let's think. `vmci_ctx_get` increments a reference count. Instead of putting it immediately, I can defer the put until *after* the mutex is unlocked. I can make `create_context` a local variable, get the context, do the `supports_host_qp` check, and then, if we're successful, return the `create_context` to the caller of `qp_broker_attach`. The caller can then do the put. Perfect.
I could also pass the `create_context` back up the chain and do the put outside. Actually, wait. I could use a workqueue to free the context after we unlock! That might solve all of these problems at once, by deferring the context release. It's probably the most elegant approach. Now, I should make sure there aren't other instances of this pattern.
|
| 45/2 |
2026/05/09 22:08 |
tool |
grepper |
0m
Args: map[Expression:vmci_ctx_put]
Results: map[Output:drivers/misc/vmw_vmci/vmci_context.c=188=void vmci_ctx_destroy(struct vmci_ctx *context)
--
drivers/misc/vmw_vmci/vmci_context.c-194-
drivers/misc/vmw_vmci/vmci_context.c:195: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-196-}
--
drivers/misc/vmw_vmci/vmci_context.c=276=int vmci_ctx_enqueue_datagram(u32 cid, struct vmci_datagram *dg)
--
drivers/misc/vmw_vmci/vmci_context.c-299- pr_warn("Failed to allocate memory for datagram\n");
drivers/misc/vmw_vmci/vmci_context.c:300: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-301- return VMCI_ERROR_NO_MEM;
--
drivers/misc/vmw_vmci/vmci_context.c-327- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:328: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-329- kfree(dq_entry);
--
drivers/misc/vmw_vmci/vmci_context.c-339- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:340: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-341-
--
drivers/misc/vmw_vmci/vmci_context.c=404=static void ctx_free_ctx(struct kref *kref)
--
drivers/misc/vmw_vmci/vmci_context.c-474- */
drivers/misc/vmw_vmci/vmci_context.c:475:void vmci_ctx_put(struct vmci_ctx *context)
drivers/misc/vmw_vmci/vmci_context.c-476-{
--
drivers/misc/vmw_vmci/vmci_context.c=578=int vmci_ctx_add_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-636- out:
drivers/misc/vmw_vmci/vmci_context.c:637: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-638- return result;
--
drivers/misc/vmw_vmci/vmci_context.c=645=int vmci_ctx_remove_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-671-
drivers/misc/vmw_vmci/vmci_context.c:672: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-673-
--
drivers/misc/vmw_vmci/vmci_context.c=744=int vmci_ctx_get_chkpt_state(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-784- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:785: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-786-
--
drivers/misc/vmw_vmci/vmci_context.c=837=int vmci_ctx_rcv_notifications_get(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-860- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:861: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-862-
--
drivers/misc/vmw_vmci/vmci_context.c=872=void vmci_ctx_rcv_notifications_release(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-907- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:908: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-909-
--
drivers/misc/vmw_vmci/vmci_context.c=921=int vmci_ctx_dbell_create(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-940- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:941: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-942-
--
drivers/misc/vmw_vmci/vmci_context.c=950=int vmci_ctx_dbell_destroy(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-967-
drivers/misc/vmw_vmci/vmci_context.c:968: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-969-
--
drivers/misc/vmw_vmci/vmci_context.c=984=int vmci_ctx_notify_dbell(u32 src_cid,
--
drivers/misc/vmw_vmci/vmci_context.c-1056- out:
drivers/misc/vmw_vmci/vmci_context.c:1057: vmci_ctx_put(dst_context);
drivers/misc/vmw_vmci/vmci_context.c-1058-
--
drivers/misc/vmw_vmci/vmci_context.c=1122=u32 vmci_context_get_priv_flags(u32 context_id)
--
drivers/misc/vmw_vmci/vmci_context.c-1132- flags = context->priv_flags;
drivers/misc/vmw_vmci/vmci_context.c:1133: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1134- return flags;
--
drivers/misc/vmw_vmci/vmci_context.c=1147=bool vmci_is_context_owner(u32 context_id, kuid_t uid)
--
drivers/misc/vmw_vmci/vmci_context.c-1155- is_owner = uid_eq(context->cred->uid, uid);
drivers/misc/vmw_vmci/vmci_context.c:1156: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1157- }
--
drivers/misc/vmw_vmci/vmci_context.h=135=struct vmci_ctx *vmci_ctx_get(u32 cid);
drivers/misc/vmw_vmci/vmci_context.h:136:void vmci_ctx_put(struct vmci_ctx *context);
drivers/misc/vmw_vmci/vmci_context.h-137-bool vmci_ctx_exists(u32 cid);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1511=static int qp_broker_attach(struct qp_broker_entry *entry,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1587- supports_host_qp = vmci_ctx_supports_host_qp(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c:1588: vmci_ctx_put(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1589-
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1770=static int qp_alloc_host_work(struct vmci_handle *handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1819- }
drivers/misc/vmw_vmci/vmci_queue_pair.c:1820: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1821- return result;
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1862=static int qp_detatch_host_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1870-
drivers/misc/vmw_vmci/vmci_queue_pair.c:1871: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1872- return result;
]
|
| 46/2 |
2026/05/09 22:08 |
llm |
debugger |
0m
Model:
Tokens:
input: 47828
output: 49
thoughts: 413
Thoughts: **Analyzing Potential Deadlocks in VMCI Context Management**
Okay, so I'm looking at this `vmci_ctx_put` function. It looks like it's called within `qp_broker_attach`, which is concerning because `qp_broker_attach` holds the `qp_broker_list.mutex` lock. Now, I see it's also called in `qp_alloc_host_work` and `qp_detatch_host_work`. Wait a minute... `qp_alloc_host_work` and `qp_detatch_host_work` *don't* hold that mutex when they call `vmci_ctx_put`. But `qp_broker_attach` *does*! Okay, let me think... `vmci_ctx_enqueue_datagram` *doesn't* hold the `qp_broker_list.mutex` directly, but it's called from `qp_notify_peer`, which in turn gets called from `vmci_qp_broker_detach` and `qp_broker_attach` *while* holding the `qp_broker_list.mutex`.
Aha! It's starting to look like a deadlock scenario if we're not careful. If `vmci_ctx_put` is involved in a process that already holds that mutex, and other code paths don't, we've got a problem. The best bet to resolve these potential deadlocks seems to be deferring the actual freeing of the context using a workqueue. This way the context freeing isn't happening in critical sections.
Alright, so I think the fix would be to add a `struct work_struct work` to `struct vmci_ctx` and schedule it in `vmci_ctx_put` when the reference count drops to zero. Oh, right. `kref_put` calls the release function when that count hits zero. That's good. Which means `ctx_free_ctx` is the release function. So, we can do something like this.
```c
static void ctx_free_ctx(struct kref *kref)
{
struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
schedule_work(&context->work);
}
```
Then the work function can handle the actual freeing. Wait a second, the current definition of `struct vmci_ctx` *doesn't* have a `work_struct`. We need to add that. Time to check the structure definition again.
|
| 47/2 |
2026/05/09 22:08 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.h IncludeLines:true Name:vmci_ctx]
Results: map[SourceCode: 40: struct vmci_ctx {
41: struct list_head list_item; /* For global VMCI list. */
42: u32 cid;
43: struct kref kref;
44: struct list_head datagram_queue; /* Head of per VM queue. */
45: u32 pending_datagrams;
46: size_t datagram_queue_size; /* Size of datagram queue in bytes. */
47:
48: /*
49: * Version of the code that created
50: * this context; e.g., VMX.
51: */
52: int user_version;
53: spinlock_t lock; /* Locks callQueue and handle_arrays. */
54:
55: /*
56: * queue_pairs attached to. The array of
57: * handles for queue pairs is accessed
58: * from the code for QP API, and there
59: * it is protected by the QP lock. It
60: * is also accessed from the context
61: * clean up path, which does not
62: * require a lock. VMCILock is not
63: * used to protect the QP array field.
64: */
65: struct vmci_handle_arr *queue_pair_array;
66:
67: /* Doorbells created by context. */
68: struct vmci_handle_arr *doorbell_array;
69:
70: /* Doorbells pending for context. */
71: struct vmci_handle_arr *pending_doorbell_array;
72:
73: /* Contexts current context is subscribing to. */
74: struct list_head notifier_list;
75: unsigned int n_notifiers;
76:
77: struct vmci_host host_context;
78: u32 priv_flags;
79:
80: const struct cred *cred;
81: bool *notify; /* Notify flag pointer - hosted only. */
82: struct page *notify_page; /* Page backing the notify UVA. */
83: };
SourceFile:drivers/misc/vmw_vmci/vmci_context.h]
|
| 48/2 |
2026/05/09 22:08 |
llm |
debugger |
0m
Model:
Tokens:
input: 49477
output: 51
thoughts: 40
Thoughts: Okay, here's my take on those thoughts, framed as an expert's internal monologue:
**Considering Adding a `work_struct` to `vmci_ctx`**
Hmm, so I'm pondering whether to add a `struct work_struct work;` member to the `vmci_ctx` structure. That could be useful for... yeah, asynchronous processing within the VMCI context, maybe? Offloading some tasks to a workqueue would certainly make sense in several scenarios. But hang on... wasn't `vmci_ctx` allocated within `vmci_ctx_create`? Right, it's created dynamically. That means I need to make sure I'm thinking through all the implications for that allocation function and how this addition would impact initialization and potential teardown later on. This seemingly simple change could ripple through quite a bit of code. I need to fully understand all the usage patterns of `vmci_ctx` before just tacking that on. Gotta make sure it's thread-safe too, of course.
|
| 49/2 |
2026/05/09 22:08 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_create]
Results: map[SourceCode: 77: /*
78: * Allocates and initializes a VMCI context.
79: */
80: struct vmci_ctx *vmci_ctx_create(u32 cid, u32 priv_flags,
81: uintptr_t event_hnd,
82: int user_version,
83: const struct cred *cred)
84: {
85: struct vmci_ctx *context;
86: int error;
87:
88: if (cid == VMCI_INVALID_ID) {
89: pr_devel("Invalid context ID for VMCI context\n");
90: error = -EINVAL;
91: goto err_out;
92: }
93:
94: if (priv_flags & ~VMCI_PRIVILEGE_ALL_FLAGS) {
95: pr_devel("Invalid flag (flags=0x%x) for VMCI context\n",
96: priv_flags);
97: error = -EINVAL;
98: goto err_out;
99: }
100:
101: if (user_version == 0) {
102: pr_devel("Invalid suer_version %d\n", user_version);
103: error = -EINVAL;
104: goto err_out;
105: }
106:
107: context = kzalloc_obj(*context);
108: if (!context) {
109: pr_warn("Failed to allocate memory for VMCI context\n");
110: error = -ENOMEM;
111: goto err_out;
112: }
113:
114: kref_init(&context->kref);
115: spin_lock_init(&context->lock);
116: INIT_LIST_HEAD(&context->list_item);
117: INIT_LIST_HEAD(&context->datagram_queue);
118: INIT_LIST_HEAD(&context->notifier_list);
119:
120: /* Initialize host-specific VMCI context. */
121: init_waitqueue_head(&context->host_context.wait_queue);
122:
123: context->queue_pair_array =
124: vmci_handle_arr_create(0, VMCI_MAX_GUEST_QP_COUNT);
125: if (!context->queue_pair_array) {
126: error = -ENOMEM;
127: goto err_free_ctx;
128: }
129:
130: context->doorbell_array =
131: vmci_handle_arr_create(0, VMCI_MAX_GUEST_DOORBELL_COUNT);
132: if (!context->doorbell_array) {
133: error = -ENOMEM;
134: goto err_free_qp_array;
135: }
136:
137: context->pending_doorbell_array =
138: vmci_handle_arr_create(0, VMCI_MAX_GUEST_DOORBELL_COUNT);
139: if (!context->pending_doorbell_array) {
140: error = -ENOMEM;
141: goto err_free_db_array;
142: }
143:
144: context->user_version = user_version;
145:
146: context->priv_flags = priv_flags;
147:
148: if (cred)
149: context->cred = get_cred(cred);
150:
151: context->notify = &ctx_dummy_notify;
152: context->notify_page = NULL;
153:
154: /*
155: * If we collide with an existing context we generate a new
156: * and use it instead. The VMX will determine if regeneration
157: * is okay. Since there isn't 4B - 16 VMs running on a given
158: * host, the below loop will terminate.
159: */
160: spin_lock(&ctx_list.lock);
161:
162: while (vmci_ctx_exists(cid)) {
163: /* We reserve the lowest 16 ids for fixed contexts. */
164: cid = max(cid, VMCI_RESERVED_CID_LIMIT - 1) + 1;
165: if (cid == VMCI_INVALID_ID)
166: cid = VMCI_RESERVED_CID_LIMIT;
167: }
168: context->cid = cid;
169:
170: list_add_tail_rcu(&context->list_item, &ctx_list.head);
171: spin_unlock(&ctx_list.lock);
172:
173: return context;
174:
175: err_free_db_array:
176: vmci_handle_arr_destroy(context->doorbell_array);
177: err_free_qp_array:
178: vmci_handle_arr_destroy(context->queue_pair_array);
179: err_free_ctx:
180: kfree(context);
181: err_out:
182: return ERR_PTR(error);
183: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 50/2 |
2026/05/09 22:08 |
llm |
debugger |
0m
Model:
Tokens:
input: 51367
output: 51
thoughts: 282
Thoughts: **My Current Reasoning on Adding a Workqueue to vmci_ctx**
Okay, so I'm thinking about how to handle asynchronous operations related to `vmci_ctx` destruction. It seems like the obvious solution is to add either a `struct rcu_work work;` or a `struct work_struct work;` to the `struct vmci_ctx` itself. That way, I can initialize it directly within `vmci_ctx_create`. This seems clean and straightforward.
But, hang on a second. I need to be careful. `ctx_free_ctx` is called from `kref_put`. Let me quickly check the surrounding code. Okay, so I see now how that works - and now I see where the memory is freed!
```c
static void ctx_free_ctx(struct kref *kref)
{
struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
schedule_work(&context->work);
}
static void ctx_free_ctx_work(struct work_struct *work)
{
struct vmci_ctx *context = container_of(work, struct vmci_ctx, work);
...
}
```
Now I'm thinking about potential issues. Using a workqueue is generally fine, but I need to consider module unloading. Since `vmw_vmci` *is* a module, I need to make absolutely sure the workqueue is flushed properly during module unload. I suppose I have the option of using `system_wq` to avoid the potential complications of managing a dedicated workqueue.
So, the real question here is: is there *any* problem with simply using `schedule_work`? If `vmci_ctx_destroy` calls `vmci_ctx_put`, which schedules the work, the `vmci_ctx` memory itself is going to be freed *later*, right? If this is the case, and assuming `vmci_exit` includes logic to properly flush the workqueue, this should be a perfectly valid approach. I'll need to double check the code around `vmci_exit` to make certain that the workqueue is flushed there. I should add a check there.
|
| 51/2 |
2026/05/09 22:08 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_guest.c IncludeLines:true Name:vmci_guest_exit]
Results: map[SourceCode: 980: void __exit vmci_guest_exit(void)
981: {
982: pci_unregister_driver(&vmci_guest_driver);
983: }
SourceFile:drivers/misc/vmw_vmci/vmci_guest.c]
|
| 52/2 |
2026/05/09 22:08 |
llm |
debugger |
1m
Model:
Tokens:
input: 52279
output: 51
thoughts: 14
Thoughts: Here's my attempt at summarizing the thought process, tailored for an expert audience:
**Identifying the Module Exit Point**
Okay, so I'm digging through this code... and aha! `vmci_exit`. That's it, that's the module exit function. The key cleanup function. It's the point where all the resources allocated by the module need to be released, and the module is effectively "shut down" or de-registered. Makes perfect sense. Now I know precisely where to focus my attention to understand how this thing is cleaned up when it's unloaded, or if there's an error. That function will contain the crucial logic I'm looking for. Time to dig in and see what happens there.
|
| 53/2 |
2026/05/09 22:09 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_driver.c IncludeLines:true Name:vmci_drv_exit]
Results: map[SourceCode: 161: static void __exit vmci_drv_exit(void)
162: {
163: if (vmci_guest_personality_initialized)
164: vmci_guest_exit();
165:
166: if (vmci_host_personality_initialized)
167: vmci_host_exit();
168:
169: vmci_event_exit();
170: }
SourceFile:drivers/misc/vmw_vmci/vmci_driver.c]
|
| 54/2 |
2026/05/09 22:09 |
llm |
debugger |
0m
Model:
Tokens:
input: 52666
output: 52
thoughts: 1476
Thoughts: **Analyzing Potential Deadlock Fixes**
Okay, so I'm thinking through this potential deadlock issue. If we use `schedule_work`, then we probably need to flush the system workqueue in `vmci_drv_exit` or `vmci_host_exit`, which is not ideal. Is there a way to solve this without adding a workqueue? Let's revisit `vmci_qp_broker_detach`.
The existing code checks `entry->qp.ref_count`. If it's zero, we remove the entry and destroy the context. If not, `qp_notify_peer` is called. The suspicion is around the locking. My thought is, if we move the `qp_notify_peer` call *outside* the lock in `vmci_qp_broker_detach` and also in `qp_broker_attach`, could that fix it? Let's see...
In `vmci_qp_broker_detach`, I'll introduce a `do_notify` flag. I'll set it when refcount isn't zero. Then I'll unlock and call `qp_notify_peer` based on the flag's value.
Now, let's look at `qp_broker_attach`. This is called by `qp_broker_alloc` but there seems to be a need to notify the peer. So, I have to figure out how to accomplish this.
Wait, `qp_broker_attach` is only called by `qp_broker_alloc`, right? Okay, so that gives me a clear entry point.
Inside `qp_broker_alloc`, there's a possibility that `entry` might be freed after `mutex_unlock` if we don't handle it carefully. But no, the refcount keeps it alive. But...I need `entry->create_id` in `qp_notify_peer`, which is called later. I'll save that value *before* unlocking. So now I have `notify_peer_id`.
I will add a `do_notify` flag. I will then unlock the mutex. If the flag is set, call `qp_notify_peer` with the saved `notify_peer_id`.
Now, what about `vmci_ctx_put` in `qp_broker_attach`? I think I can also move that outside the lock. The goal is to separate operations that might cause a deadlock. Let's create a temporary context pointer, then set this to the result of `vmci_ctx_get`. This will prevent the function from unlocking while still needing that pointer. Then, back in `qp_broker_alloc`, if the out_ctx pointer is set, I'll call `vmci_ctx_put`.
Wait, is there *any* other place where `vmci_ctx_put` is called while `qp_broker_list.mutex` is held? Time to check `qp_broker_create`.
|
| 55/2 |
2026/05/09 22:09 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_create]
Results: map[SourceCode:1264: /*
1265: * The first endpoint issuing a queue pair allocation will create the state
1266: * of the queue pair in the queue pair broker.
1267: *
1268: * If the creator is a guest, it will associate a VMX virtual address range
1269: * with the queue pair as specified by the page_store. For compatibility with
1270: * older VMX'en, that would use a separate step to set the VMX virtual
1271: * address range, the virtual address range can be registered later using
1272: * vmci_qp_broker_set_page_store. In that case, a page_store of NULL should be
1273: * used.
1274: *
1275: * If the creator is the host, a page_store of NULL should be used as well,
1276: * since the host is not able to supply a page store for the queue pair.
1277: *
1278: * For older VMX and host callers, the queue pair will be created in the
1279: * VMCIQPB_CREATED_NO_MEM state, and for current VMX callers, it will be
1280: * created in VMCOQPB_CREATED_MEM state.
1281: */
1282: static int qp_broker_create(struct vmci_handle handle,
1283: u32 peer,
1284: u32 flags,
1285: u32 priv_flags,
1286: u64 produce_size,
1287: u64 consume_size,
1288: struct vmci_qp_page_store *page_store,
1289: struct vmci_ctx *context,
1290: vmci_event_release_cb wakeup_cb,
1291: void *client_data, struct qp_broker_entry **ent)
1292: {
1293: struct qp_broker_entry *entry = NULL;
1294: const u32 context_id = vmci_ctx_get_id(context);
1295: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1296: int result;
1297: u64 guest_produce_size;
1298: u64 guest_consume_size;
1299:
1300: /* Do not create if the caller asked not to. */
1301: if (flags & VMCI_QPFLAG_ATTACH_ONLY)
1302: return VMCI_ERROR_NOT_FOUND;
1303:
1304: /*
1305: * Creator's context ID should match handle's context ID or the creator
1306: * must allow the context in handle's context ID as the "peer".
1307: */
1308: if (handle.context != context_id && handle.context != peer)
1309: return VMCI_ERROR_NO_ACCESS;
1310:
1311: if (VMCI_CONTEXT_IS_VM(context_id) && VMCI_CONTEXT_IS_VM(peer))
1312: return VMCI_ERROR_DST_UNREACHABLE;
1313:
1314: /*
1315: * Creator's context ID for local queue pairs should match the
1316: * peer, if a peer is specified.
1317: */
1318: if (is_local && peer != VMCI_INVALID_ID && context_id != peer)
1319: return VMCI_ERROR_NO_ACCESS;
1320:
1321: entry = kzalloc_obj(*entry, GFP_ATOMIC);
1322: if (!entry)
1323: return VMCI_ERROR_NO_MEM;
1324:
1325: if (vmci_ctx_get_id(context) == VMCI_HOST_CONTEXT_ID && !is_local) {
1326: /*
1327: * The queue pair broker entry stores values from the guest
1328: * point of view, so a creating host side endpoint should swap
1329: * produce and consume values -- unless it is a local queue
1330: * pair, in which case no swapping is necessary, since the local
1331: * attacher will swap queues.
1332: */
1333:
1334: guest_produce_size = consume_size;
1335: guest_consume_size = produce_size;
1336: } else {
1337: guest_produce_size = produce_size;
1338: guest_consume_size = consume_size;
1339: }
1340:
1341: entry->qp.handle = handle;
1342: entry->qp.peer = peer;
1343: entry->qp.flags = flags;
1344: entry->qp.produce_size = guest_produce_size;
1345: entry->qp.consume_size = guest_consume_size;
1346: entry->qp.ref_count = 1;
1347: entry->create_id = context_id;
1348: entry->attach_id = VMCI_INVALID_ID;
1349: entry->state = VMCIQPB_NEW;
1350: entry->require_trusted_attach =
1351: !!(context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED);
1352: entry->created_by_trusted =
1353: !!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED);
1354: entry->vmci_page_files = false;
1355: entry->wakeup_cb = wakeup_cb;
1356: entry->client_data = client_data;
1357: entry->produce_q = qp_host_alloc_queue(guest_produce_size);
1358: if (entry->produce_q == NULL) {
1359: result = VMCI_ERROR_NO_MEM;
1360: goto error;
1361: }
1362: entry->consume_q = qp_host_alloc_queue(guest_consume_size);
1363: if (entry->consume_q == NULL) {
1364: result = VMCI_ERROR_NO_MEM;
1365: goto error;
1366: }
1367:
1368: qp_init_queue_mutex(entry->produce_q, entry->consume_q);
1369:
1370: INIT_LIST_HEAD(&entry->qp.list_item);
1371:
1372: if (is_local) {
1373: u8 *tmp;
1374:
1375: entry->local_mem = kcalloc(QPE_NUM_PAGES(entry->qp),
1376: PAGE_SIZE, GFP_KERNEL);
1377: if (entry->local_mem == NULL) {
1378: result = VMCI_ERROR_NO_MEM;
1379: goto error;
1380: }
1381: entry->state = VMCIQPB_CREATED_MEM;
1382: entry->produce_q->q_header = entry->local_mem;
1383: tmp = (u8 *)entry->local_mem + PAGE_SIZE *
1384: (DIV_ROUND_UP(entry->qp.produce_size, PAGE_SIZE) + 1);
1385: entry->consume_q->q_header = (struct vmci_queue_header *)tmp;
1386: } else if (page_store) {
1387: /*
1388: * The VMX already initialized the queue pair headers, so no
1389: * need for the kernel side to do that.
1390: */
1391: result = qp_host_register_user_memory(page_store,
1392: entry->produce_q,
1393: entry->consume_q);
1394: if (result < VMCI_SUCCESS)
1395: goto error;
1396:
1397: entry->state = VMCIQPB_CREATED_MEM;
1398: } else {
1399: /*
1400: * A create without a page_store may be either a host
1401: * side create (in which case we are waiting for the
1402: * guest side to supply the memory) or an old style
1403: * queue pair create (in which case we will expect a
1404: * set page store call as the next step).
1405: */
1406: entry->state = VMCIQPB_CREATED_NO_MEM;
1407: }
1408:
1409: qp_list_add_entry(&qp_broker_list, &entry->qp);
1410: if (ent != NULL)
1411: *ent = entry;
1412:
1413: /* Add to resource obj */
1414: result = vmci_resource_add(&entry->resource,
1415: VMCI_RESOURCE_TYPE_QPAIR_HOST,
1416: handle);
1417: if (result != VMCI_SUCCESS) {
1418: pr_warn("Failed to add new resource (handle=0x%x:0x%x), error: %d",
1419: handle.context, handle.resource, result);
1420: goto error;
1421: }
1422:
1423: entry->qp.handle = vmci_resource_handle(&entry->resource);
1424: if (is_local) {
1425: vmci_q_header_init(entry->produce_q->q_header,
1426: entry->qp.handle);
1427: vmci_q_header_init(entry->consume_q->q_header,
1428: entry->qp.handle);
1429: }
1430:
1431: vmci_ctx_qp_create(context, entry->qp.handle);
1432:
1433: return VMCI_SUCCESS;
1434:
1435: error:
1436: if (entry != NULL) {
1437: qp_host_free_queue(entry->produce_q, guest_produce_size);
1438: qp_host_free_queue(entry->consume_q, guest_consume_size);
1439: kfree(entry);
1440: }
1441:
1442: return result;
1443: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 56/2 |
2026/05/09 22:09 |
llm |
debugger |
0m
Model:
Tokens:
input: 57778
output: 23
thoughts: 1346
Thoughts: **Analyzing and Fixing a Potential Deadlock in VMCI Queue Pair Broker**
Okay, so here's what I'm thinking: The code currently uses `vmci_ctx_put` in a couple of places, and it appears that `qp_broker_create` doesn't call `vmci_ctx_put`. That means the only calls to `vmci_ctx_put` where `qp_broker_list.mutex` is held occur within `qp_broker_attach` and indirectly through `vmci_ctx_enqueue_datagram` in both `vmci_qp_broker_detach` and `qp_broker_attach` when calling `qp_notify_peer`. This is a classic recipe for a deadlock if the lock acquisition order is wrong.
My gut feeling is that if we pull `qp_notify_peer` out of the critical section and also move `vmci_ctx_put` outside the lock in `qp_broker_attach`, we should be able to sidestep the problem. The idea is to release the lock *before* potentially blocking operations occur.
Let's dive into the code and see if this approach is sound. Looking at `qp_broker_attach`, specifically, the definition is as follows:
```c
static int qp_broker_attach(struct qp_broker_entry *entry,
u32 peer,
u32 flags,
u32 priv_flags,
u64 produce_size,
u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
vmci_event_release_cb wakeup_cb,
void *client_data,
struct qp_broker_entry **ent,
bool *do_notify,
struct vmci_ctx **out_ctx)
```
Hey, wait a minute, `qp_broker_attach` is a static function, so we can change its signature. That's good; it makes the refactoring easier.
Now, looking at the logic inside `qp_broker_attach`, specifically:
```c
} else if (context_id == VMCI_HOST_CONTEXT_ID) {
struct vmci_ctx *create_context;
bool supports_host_qp;
create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
*out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE;
}
```
This looks like we can move the `vmci_ctx_put` after the lock release. And also:
```c
if (entry->state == VMCIQPB_ATTACHED_MEM) {
*do_notify = true;
}
```
Okay, for the `do_notify` flag, this seems easy enough; it depends on the state of the entry.
Now, let's trace this through `qp_broker_alloc`, because this is where the changes will cascade.
```c
bool do_notify = false;
struct vmci_ctx *out_ctx = NULL;
u32 notify_peer_id = VMCI_INVALID_ID;
...
if (!entry) {
...
} else {
create = false;
result =
qp_broker_attach(entry, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent,
&do_notify, &out_ctx);
if (do_notify)
notify_peer_id = entry->create_id;
}
mutex_unlock(&qp_broker_list.mutex);
if (out_ctx)
vmci_ctx_put(out_ctx);
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
|
| 57/2 |
2026/05/09 22:10 |
tool |
codesearch-find-references |
0m
Args:
Results: map[References:[map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:qp_broker_attach SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:1664] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_qp_broker_detach SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:2188] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_qp_broker_set_page_store SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:2039]] TruncatedOutput:false]
|
| 58/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 60385
output: 59
thoughts: 45
Thoughts: Okay, here's my interpretation of that thought process, from an expert's perspective:
**Diving into the VMCI Quick Pair Messaging**
Right, so, *aha!* I've just realized something important. The `vmci_qp_broker_set_page_store` function, the one that deals with setting up the page store for the VMCI quick pair messaging system, also *calls* `qp_notify_peer`. That's significant. It means we've got a direct link there, a point of interaction between setting up the page store and notifying the peer about the change. This probably isn't a *coincidence*.
Now, my next move is clear. I need to take a closer look at `vmci_qp_broker_set_page_store`. I want to understand *how* it's calling `qp_notify_peer`, and, more importantly, *why*. Is it a simple notification of the configuration? Is there some more complex synchronization or data transfer going on? Are there any potential concurrency issues I need to be aware of? That function call is likely the key to unlocking the interaction and understanding how these two pieces of the system are coupled. Time to dig in!
|
| 59/2 |
2026/05/09 22:10 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_set_page_store]
Results: map[SourceCode:1947: /*
1948: * VMX'en with versions lower than VMCI_VERSION_NOVMVM use a separate
1949: * step to add the UVAs of the VMX mapping of the queue pair. This function
1950: * provides backwards compatibility with such VMX'en, and takes care of
1951: * registering the page store for a queue pair previously allocated by the
1952: * VMX during create or attach. This function will move the queue pair state
1953: * to either from VMCIQBP_CREATED_NO_MEM to VMCIQBP_CREATED_MEM or
1954: * VMCIQBP_ATTACHED_NO_MEM to VMCIQBP_ATTACHED_MEM. If moving to the
1955: * attached state with memory, the queue pair is ready to be used by the
1956: * host peer, and an attached event will be generated.
1957: *
1958: * Assumes that the queue pair broker lock is held.
1959: *
1960: * This function is only used by the hosted platform, since there is no
1961: * issue with backwards compatibility for vmkernel.
1962: */
1963: int vmci_qp_broker_set_page_store(struct vmci_handle handle,
1964: u64 produce_uva,
1965: u64 consume_uva,
1966: struct vmci_ctx *context)
1967: {
1968: struct qp_broker_entry *entry;
1969: int result;
1970: const u32 context_id = vmci_ctx_get_id(context);
1971:
1972: if (vmci_handle_is_invalid(handle) || !context ||
1973: context_id == VMCI_INVALID_ID)
1974: return VMCI_ERROR_INVALID_ARGS;
1975:
1976: /*
1977: * We only support guest to host queue pairs, so the VMX must
1978: * supply UVAs for the mapped page files.
1979: */
1980:
1981: if (produce_uva == 0 || consume_uva == 0)
1982: return VMCI_ERROR_INVALID_ARGS;
1983:
1984: mutex_lock(&qp_broker_list.mutex);
1985:
1986: if (!vmci_ctx_qp_exists(context, handle)) {
1987: pr_warn("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
1988: context_id, handle.context, handle.resource);
1989: result = VMCI_ERROR_NOT_FOUND;
1990: goto out;
1991: }
1992:
1993: entry = qp_broker_handle_to_entry(handle);
1994: if (!entry) {
1995: result = VMCI_ERROR_NOT_FOUND;
1996: goto out;
1997: }
1998:
1999: /*
2000: * If I'm the owner then I can set the page store.
2001: *
2002: * Or, if a host created the queue_pair and I'm the attached peer
2003: * then I can set the page store.
2004: */
2005: if (entry->create_id != context_id &&
2006: (entry->create_id != VMCI_HOST_CONTEXT_ID ||
2007: entry->attach_id != context_id)) {
2008: result = VMCI_ERROR_QUEUEPAIR_NOTOWNER;
2009: goto out;
2010: }
2011:
2012: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
2013: entry->state != VMCIQPB_ATTACHED_NO_MEM) {
2014: result = VMCI_ERROR_UNAVAILABLE;
2015: goto out;
2016: }
2017:
2018: result = qp_host_get_user_memory(produce_uva, consume_uva,
2019: entry->produce_q, entry->consume_q);
2020: if (result < VMCI_SUCCESS)
2021: goto out;
2022:
2023: result = qp_host_map_queues(entry->produce_q, entry->consume_q);
2024: if (result < VMCI_SUCCESS) {
2025: qp_host_unregister_user_memory(entry->produce_q,
2026: entry->consume_q);
2027: goto out;
2028: }
2029:
2030: if (entry->state == VMCIQPB_CREATED_NO_MEM)
2031: entry->state = VMCIQPB_CREATED_MEM;
2032: else
2033: entry->state = VMCIQPB_ATTACHED_MEM;
2034:
2035: entry->vmci_page_files = true;
2036:
2037: if (entry->state == VMCIQPB_ATTACHED_MEM) {
2038: result =
2039: qp_notify_peer(true, handle, context_id, entry->create_id);
2040: if (result < VMCI_SUCCESS) {
2041: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
2042: entry->create_id, entry->qp.handle.context,
2043: entry->qp.handle.resource);
2044: }
2045: }
2046:
2047: result = VMCI_SUCCESS;
2048: out:
2049: mutex_unlock(&qp_broker_list.mutex);
2050: return result;
2051: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 60/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 62470
output: 51
thoughts: 1037
Thoughts: **Refactoring VMCI Context Freeing: A Workqueue-Based Approach**
Okay, so I've been looking at the `vmci_qp_broker_set_page_store` function and how it interacts with the `qp_broker_list.mutex`. I've realized that like a few other places, it calls `qp_notify_peer` while holding the lock. My initial thought was that we'd have to move `qp_notify_peer` outside of the lock in *this* function too, as well as in other places. But that's going to be a maintenance nightmare - and error-prone.
Then it hit me: If we defer `ctx_free_ctx` to a workqueue, we can avoid touching all these places! Instead of directly freeing the context, `vmci_ctx_put` would simply schedule a work item. That work item would then execute `ctx_free_ctx`, which in turn calls `vmci_qp_broker_detach` for any queue pairs. Crucially, the work item runs outside the lock, so we wouldn't need to change all those individual call sites where `vmci_ctx_put` is called.
This seems like a much simpler and less risky approach. Less code modification means less chance of introducing bugs. So, let's explore this.
First, I need to add a `struct work_struct` to the `struct vmci_ctx`. This will allow us to queue a work item when the context's reference count drops to zero. Ah, but `kref_put` takes a function pointer. No problem, that's what we want.
Okay, let's go ahead and add the `work_struct`. It's just a few bytes, no real impact.
But wait, if `vmci_ctx_destroy` calls `vmci_ctx_put(context)` and then returns, the context is freed *asynchronously*. Is there any code that implicitly expects the context to be fully freed when `vmci_ctx_destroy` returns? I need to make sure we don't break anything. Let me check `vmci_host_close`. It calls `vmci_ctx_destroy`, and then immediately frees `vmci_host_dev`. But, `vmci_host_dev` and `vmci_ctx` are separate structures. Perfect. `vmci_ctx` will be freed later, in the workqueue.
What about during module exit, in `vmci_host_exit`? That calls `vmci_ctx_destroy(VMCI_HOST_CONTEXT_ID)`. But is `VMCI_HOST_CONTEXT_ID` directly used, here? It should be `vmci_ctx_destroy(host_context)`. Let me go check... Yeah, it's `host_context`. And again, there shouldn't be a problem here either.
This looks like a good plan. Deferring the free operation to a workqueue avoids a lot of unnecessary code changes and potential race conditions.
|
| 61/2 |
2026/05/09 22:10 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_host.c IncludeLines:true Name:vmci_host_exit]
Results: map[SourceCode:1017: void __exit vmci_host_exit(void)
1018: {
1019: vmci_host_device_initialized = false;
1020:
1021: misc_deregister(&vmci_host_miscdev);
1022: vmci_ctx_destroy(host_context);
1023: vmci_qp_broker_exit();
1024:
1025: pr_debug("VMCI host driver module unloaded\n");
1026: }
SourceFile:drivers/misc/vmw_vmci/vmci_host.c]
|
| 62/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 64389
output: 55
thoughts: 53
Thoughts: Okay, here's my take on those thoughts, framed as my own reasoning:
**Asynchronous Destruction and Broker Exit Concerns**
Right, so I'm looking at this cleanup sequence and a flag just went up in my head. If `vmci_ctx_destroy(host_context)` is designed to be an asynchronous operation, there's a serious potential race condition. Specifically, if the freeing of that host context isn't *guaranteed* to be complete before `vmci_qp_broker_exit()` gets called, we could be stepping on toes.
That's a nasty bug just waiting to happen, potentially corrupting memory or leading to all sorts of unpredictable behavior. I need to dig into `vmci_qp_broker_exit()` and understand exactly what it does, and whether it touches anything that would be tied to that host context. We really need to make sure the host context is fully gone before we try to take down the broker. Let's see what's what in that function.
|
| 63/2 |
2026/05/09 22:10 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_exit]
Results: map[SourceCode:1906: void vmci_qp_broker_exit(void)
1907: {
1908: struct qp_entry *entry;
1909: struct qp_broker_entry *be;
1910:
1911: mutex_lock(&qp_broker_list.mutex);
1912:
1913: while ((entry = qp_list_get_head(&qp_broker_list))) {
1914: be = (struct qp_broker_entry *)entry;
1915:
1916: qp_list_remove_entry(&qp_broker_list, entry);
1917: kfree(be);
1918: }
1919:
1920: mutex_unlock(&qp_broker_list.mutex);
1921: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 64/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 64975
output: 51
thoughts: 312
Thoughts: **My Analysis of a Potential VMCI Race Condition**
Okay, so I'm thinking through this potential race condition involving `vmci_ctx_destroy`, the workqueue, and the broker entries. If `vmci_ctx_destroy` schedules a work item, and then `vmci_qp_broker_exit` comes along and frees all the broker entries, there's a window where that work item might run *after* the entries are gone. My immediate concern is that this work item will then call `vmci_qp_broker_detach`, which in turn, accesses `qp_broker_list`.
But, hold on a second... `vmci_qp_broker_exit` *frees* the entries, it doesn't nuke the mutex protecting the list. So, if the work item *does* run after `vmci_qp_broker_exit` it'll execute `vmci_qp_broker_detach`. Since the list is empty at that point, it will return `VMCI_ERROR_NOT_FOUND`.
Okay, I need to check the code... ah, here we go:
```c
entry = qp_broker_handle_to_entry(handle);
if (!entry) {
result = VMCI_ERROR_NOT_FOUND;
goto out;
}
```
Yes, `vmci_qp_broker_detach` *explicitly* checks for a null entry and returns an error. So from a purely data integrity perspective, it *looks* safe. It won't crash.
But wait, what about the module unload scenario? If the VMCI module itself gets unloaded, that work item's code is going to be unmapped, right? That's a much more serious issue. We absolutely *have* to flush that workqueue before unloading the module to prevent executing invalid addresses. So, we need a flush, likely in `vmci_drv_exit` or `vmci_host_exit`.
Hang on... I need to consider that `vmci_ctx` is part of the *core* VMCI code, not just the host-specific part. Is there an associated `vmci_ctx_exit` function, or something similar, that handles the cleanup and workqueue flushing in a generic way? I need to track this down.
|
| 65/2 |
2026/05/09 22:10 |
tool |
codesearch-definition-source |
0m
Error:
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_exit]
Results: map[SourceCode: SourceFile:]
|
| 66/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 65862
output: 51
thoughts: 21
Thoughts: Here's my thought process, summarized as if I were considering the code:
**Checking for `vmci_drv_exit` in `vmci_driver.c`**
Okay, I need to understand how the VMCI driver is unloaded. The first place to look, of course, is the driver's exit routine. So, I'll go straight to `vmci_driver.c` and search for `vmci_drv_exit`. That function is the key to seeing how the resources are cleaned up when the module unloads. I expect to find things like unregistering the device, freeing any allocated memory, and properly handling any outstanding operations. This is crucial for resource management and preventing memory leaks or device conflicts upon module removal. Let's see what's in there.
|
| 67/2 |
2026/05/09 22:10 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_driver.c IncludeLines:true Name:vmci_drv_exit]
Results: map[SourceCode: 161: static void __exit vmci_drv_exit(void)
162: {
163: if (vmci_guest_personality_initialized)
164: vmci_guest_exit();
165:
166: if (vmci_host_personality_initialized)
167: vmci_host_exit();
168:
169: vmci_event_exit();
170: }
SourceFile:drivers/misc/vmw_vmci/vmci_driver.c]
|
| 68/2 |
2026/05/09 22:10 |
llm |
debugger |
0m
Model:
Tokens:
input: 66269
output: 52
thoughts: 746
Thoughts: **Refactoring VMCI Queue Pair Broker Detachment**
Okay, so I'm thinking about how to properly handle cleanup during VMCI driver exit, specifically concerning queue pairs and context destruction. I'm hitting a wall with how to ensure all associated work is complete before releasing resources. Initially, the idea of using `schedule_work` and then calling `flush_scheduled_work()` in `vmci_drv_exit()` seemed plausible, but `flush_scheduled_work()` is deprecated, which is a problem.
I then considered dedicated workqueues or flushing individual work items. The primary issue is efficiently tracking all those `vmci_ctx` work items. Wait, the `vmci_ctx_destroy` function actually calls `synchronize_rcu()`. Maybe I can just defer `ctx_free_ctx` with `schedule_work`, but then I'd need a global workqueue for VMCI, or potentially use `system_wq` and call `rcu_barrier()`. That won't work though, because `rcu_barrier()` is for `call_rcu()`. Also, I can't flush `system_wq`.
The thought of keeping track of the number of contexts, or maybe even just skipping the deferred `ctx_free_ctx` entirely, did come to mind. I think I have a better idea. This deadlock is likely caused by `qp_notify_peer` being called while holding a lock. The correct solution here is to move that call *outside* of the lock in the methods: `vmci_qp_broker_detach`, `qp_broker_attach`, and `vmci_qp_broker_set_page_store`. This should resolve the deadlock without introducing asynchronous destruction complexities. That's the approach I should take.
Let's review the code, and see how to implement this. I see that in `vmci_qp_broker_detach`, I can pull that `qp_notify_peer` call outside the mutex:
```c
bool do_notify = false;
...
if (entry->qp.ref_count == 0) {
...
} else {
do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
} else {
entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
}
if (!is_local)
vmci_ctx_qp_destroy(context, handle);
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
This is pretty straightforward; very clean. Now for `qp_broker_attach`. Ah, wait... `qp_broker_attach` is only called from `qp_broker_alloc`. Ok, let's revisit `qp_broker_alloc`...
|
| 69/2 |
2026/05/09 22:11 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_alloc]
Results: map[SourceCode:1692: /*
1693: * queue_pair_Alloc for use when setting up queue pair endpoints
1694: * on the host.
1695: */
1696: static int qp_broker_alloc(struct vmci_handle handle,
1697: u32 peer,
1698: u32 flags,
1699: u32 priv_flags,
1700: u64 produce_size,
1701: u64 consume_size,
1702: struct vmci_qp_page_store *page_store,
1703: struct vmci_ctx *context,
1704: vmci_event_release_cb wakeup_cb,
1705: void *client_data,
1706: struct qp_broker_entry **ent,
1707: bool *swap)
1708: {
1709: const u32 context_id = vmci_ctx_get_id(context);
1710: bool create;
1711: struct qp_broker_entry *entry = NULL;
1712: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1713: int result;
1714:
1715: if (vmci_handle_is_invalid(handle) ||
1716: (flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
1717: !(produce_size || consume_size) ||
1718: !context || context_id == VMCI_INVALID_ID ||
1719: handle.context == VMCI_INVALID_ID) {
1720: return VMCI_ERROR_INVALID_ARGS;
1721: }
1722:
1723: if (page_store && !VMCI_QP_PAGESTORE_IS_WELLFORMED(page_store))
1724: return VMCI_ERROR_INVALID_ARGS;
1725:
1726: /*
1727: * In the initial argument check, we ensure that non-vmkernel hosts
1728: * are not allowed to create local queue pairs.
1729: */
1730:
1731: mutex_lock(&qp_broker_list.mutex);
1732:
1733: if (!is_local && vmci_ctx_qp_exists(context, handle)) {
1734: pr_devel("Context (ID=0x%x) already attached to queue pair (handle=0x%x:0x%x)\n",
1735: context_id, handle.context, handle.resource);
1736: mutex_unlock(&qp_broker_list.mutex);
1737: return VMCI_ERROR_ALREADY_EXISTS;
1738: }
1739:
1740: if (handle.resource != VMCI_INVALID_ID)
1741: entry = qp_broker_handle_to_entry(handle);
1742:
1743: if (!entry) {
1744: create = true;
1745: result =
1746: qp_broker_create(handle, peer, flags, priv_flags,
1747: produce_size, consume_size, page_store,
1748: context, wakeup_cb, client_data, ent);
1749: } else {
1750: create = false;
1751: result =
1752: qp_broker_attach(entry, peer, flags, priv_flags,
1753: produce_size, consume_size, page_store,
1754: context, wakeup_cb, client_data, ent);
1755: }
1756:
1757: mutex_unlock(&qp_broker_list.mutex);
1758:
1759: if (swap)
1760: *swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
1761: !(create && is_local);
1762:
1763: return result;
1764: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 70/2 |
2026/05/09 22:11 |
llm |
debugger |
1m
Model:
Tokens:
input: 68923
output: 53
thoughts: 801
Thoughts: **Analyzing Context Management in Queue Pair Operations**
Okay, so I'm digging into this `qp_broker` code and I see something interesting with context handling, specifically around the `vmci_ctx` object. I'm making a mental note that `qp_broker_attach` is a key function here. It's called from `vmci_qp_broker_alloc` which, in turn, is also called from `qp_alloc_host_work`. Interesting architecture, so if I ever need to touch the `qp_broker_attach` signature, I see that I'll only need to update `qp_broker_alloc` since that looks to be the only consumer of the modified signature.
Looking at the code for `qp_broker_attach`, it seems pretty clean, especially the context management: we're grabbing a `vmci_ctx`, passing it out, and releasing it with `vmci_ctx_put`. Good. Then there is the page store attach function `vmci_qp_broker_set_page_store`, which also looks clean with respect to context handling and it performs a similar notification.
Now, I'm starting to get paranoid about potential context leaks, so I want to make sure I'm not missing any other places where `vmci_ctx_put` might be called with `qp_broker_list.mutex` held. Gotta be careful about that. Let me re-check `qp_broker_create` to ensure I didn't miss something. Nope, that function doesn't call it. Good. `vmci_qp_broker_alloc` doesn't directly, it calls `qp_broker_alloc`, which is already accounted for. What about detach? That calls `vmci_ctx_qp_destroy` which in turn doesn't call `vmci_ctx_put`. I'm going to quickly check `vmci_ctx_qp_destroy` just to be completely sure.
|
| 71/2 |
2026/05/09 22:12 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_context.c IncludeLines:true Name:vmci_ctx_qp_destroy]
Results: map[SourceCode:1087: /*
1088: * Unregisters a queue pair handle that was previously registered
1089: * with vmci_ctx_qp_create.
1090: */
1091: int vmci_ctx_qp_destroy(struct vmci_ctx *context, struct vmci_handle handle)
1092: {
1093: struct vmci_handle hndl;
1094:
1095: if (context == NULL || vmci_handle_is_invalid(handle))
1096: return VMCI_ERROR_INVALID_ARGS;
1097:
1098: hndl = vmci_handle_arr_remove_entry(context->queue_pair_array, handle);
1099:
1100: return vmci_handle_is_invalid(hndl) ?
1101: VMCI_ERROR_NOT_FOUND : VMCI_SUCCESS;
1102: }
SourceFile:drivers/misc/vmw_vmci/vmci_context.c]
|
| 72/2 |
2026/05/09 22:12 |
llm |
debugger |
0m
Model:
Tokens:
input: 70487
output: 56
thoughts: 534
Thoughts: **Analyzing a Potential Deadlock in VMCI Queue Pair Broker Operations**
Okay, so I've been digging into this `vmci_qp_destroy` function and I've confirmed that it doesn't call `vmci_ctx_put`. That's an important starting point. My thinking now is focused on how we can improve our locking strategy around the queue pair broker.
The key observation is that `vmci_ctx_put` or `qp_notify_peer` are only called when `qp_broker_list.mutex` is already held. So it looks like our calls that could cause a problem are limited to three places: `vmci_qp_broker_detach`, `qp_broker_attach` and `vmci_qp_broker_set_page_store`. The solution seems to move them outside this lock, in these places.
But, I need to be thorough. I need to make sure I'm not missing anything. I need to know, is there another lock that could be involved?
Looking at `qp_notify_peer`, it calls `vmci_datagram_dispatch`, which then calls `dg_dispatch_as_host`, which finally calls `vmci_ctx_enqueue_datagram`. And there, we've got a `context->lock`. Okay, but that's a spinlock, and I can see it's acquired and released *within* `vmci_ctx_enqueue_datagram`. Critically, `vmci_ctx_put` is called *outside* of that `context->lock`.
Then, `vmci_ctx_put` calls `ctx_free_ctx`, and that calls `vmci_qp_broker_detach`, which *does* acquire `qp_broker_list.mutex`. So it seems the lock dependency is: `qp_broker_list.mutex` potentially "happening before" `context->lock` (through the `qp_notify_peer` -> `vmci_ctx_enqueue_datagram` path). And `ctx_free_ctx` wants to get a hold of the `qp_broker_list.mutex` too.
So if `vmci_ctx_put` is called *while* holding `qp_broker_list.mutex`, we have a potential deadlock because `ctx_free_ctx` will try to reacquire it. If we move `vmci_ctx_put` and `qp_notify_peer` outside of that `qp_broker_list.mutex`, it resolves the potential issue because `qp_broker_list.mutex` will not be held when `vmci_ctx_put` is called and `ctx_free_ctx` can proceed safely.
I need to confirm, though, that this is the only potential problem. Is there anywhere else `vmci_ctx_put` is called while `qp_broker_list.mutex` is held? Time to check `vmci_qp_broker_unmap`.
|
| 73/2 |
2026/05/09 22:12 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_unmap]
Results: map[SourceCode:2316: /*
2317: * Removes all references to the guest memory of a given queue pair, and
2318: * will move the queue pair from state *_MEM to *_NO_MEM. It is usually
2319: * called when a VM is being quiesced where access to guest memory should
2320: * avoided.
2321: */
2322: int vmci_qp_broker_unmap(struct vmci_handle handle,
2323: struct vmci_ctx *context,
2324: u32 gid)
2325: {
2326: struct qp_broker_entry *entry;
2327: const u32 context_id = vmci_ctx_get_id(context);
2328: int result;
2329:
2330: if (vmci_handle_is_invalid(handle) || !context ||
2331: context_id == VMCI_INVALID_ID)
2332: return VMCI_ERROR_INVALID_ARGS;
2333:
2334: mutex_lock(&qp_broker_list.mutex);
2335:
2336: if (!vmci_ctx_qp_exists(context, handle)) {
2337: pr_devel("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
2338: context_id, handle.context, handle.resource);
2339: result = VMCI_ERROR_NOT_FOUND;
2340: goto out;
2341: }
2342:
2343: entry = qp_broker_handle_to_entry(handle);
2344: if (!entry) {
2345: pr_devel("Context (ID=0x%x) reports being attached to queue pair (handle=0x%x:0x%x) that isn't present in broker\n",
2346: context_id, handle.context, handle.resource);
2347: result = VMCI_ERROR_NOT_FOUND;
2348: goto out;
2349: }
2350:
2351: if (context_id != entry->create_id && context_id != entry->attach_id) {
2352: result = VMCI_ERROR_QUEUEPAIR_NOTATTACHED;
2353: goto out;
2354: }
2355:
2356: if (context_id != VMCI_HOST_CONTEXT_ID &&
2357: QPBROKERSTATE_HAS_MEM(entry)) {
2358: qp_acquire_queue_mutex(entry->produce_q);
2359: result = qp_save_headers(entry);
2360: if (result < VMCI_SUCCESS)
2361: pr_warn("Failed to save queue headers for queue pair (handle=0x%x:0x%x,result=%d)\n",
2362: handle.context, handle.resource, result);
2363:
2364: qp_host_unmap_queues(gid, entry->produce_q, entry->consume_q);
2365:
2366: /*
2367: * On hosted, when we unmap queue pairs, the VMX will also
2368: * unmap the guest memory, so we invalidate the previously
2369: * registered memory. If the queue pair is mapped again at a
2370: * later point in time, we will need to reregister the user
2371: * memory with a possibly new user VA.
2372: */
2373: qp_host_unregister_user_memory(entry->produce_q,
2374: entry->consume_q);
2375:
2376: /*
2377: * Move state from *_MEM to *_NO_MEM.
2378: */
2379: entry->state--;
2380:
2381: qp_release_queue_mutex(entry->produce_q);
2382: }
2383:
2384: result = VMCI_SUCCESS;
2385:
2386: out:
2387: mutex_unlock(&qp_broker_list.mutex);
2388: return result;
2389: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 74/2 |
2026/05/09 22:12 |
llm |
debugger |
0m
Model:
Tokens:
input: 72923
output: 852
thoughts: 1655
Thoughts: **Deadlock Analysis and Proposed Fix for `qp_broker_list.mutex` Contention**
Okay, so I've been digging into this and it's become clear: `vmci_qp_broker_unmap` isn't the culprit here. The problem lies with how `qp_notify_peer` and `vmci_ctx_put` are called within the context of the `qp_broker_list.mutex`. Specifically, these functions can lead to a recursive locking deadlock if called while holding the `qp_broker_list.mutex`.
Here's the breakdown of the issue: `qp_notify_peer` transmits a datagram to the peer context. This in turn calls `vmci_ctx_enqueue_datagram`, which *gets* a reference to the peer context and *puts* it. The crucial vulnerability arises if the peer context is being destroyed concurrently. This destruction process involves `vmci_ctx_put` dropping the reference count which might reach 0, triggering `ctx_free_ctx`. `ctx_free_ctx` then cleans up associated queue pairs by calling `vmci_qp_broker_detach`, which, critically, *attempts to acquire* `qp_broker_list.mutex`. Since the thread that initiated `qp_notify_peer` is already holding this mutex, we've got a classic recursive locking deadlock.
The same problem also occurs within `qp_broker_attach` and `vmci_qp_broker_set_page_store`, as those functions directly call `vmci_ctx_put` and `qp_notify_peer` while holding the `qp_broker_list.mutex`.
To resolve this, the key is to defer calls to `qp_notify_peer` and `vmci_ctx_put` until after `qp_broker_list.mutex` has been released. The analysis of call locations led me to determine that, as `qp_broker_alloc` is called from `vmci_qp_broker_alloc`, the best location to make the necessary changes is within `qp_broker_alloc`.
Here's the exact deadlock scenario I've identified:
1. **Thread 1:** Calls `vmci_qp_broker_detach` and acquires `qp_broker_list.mutex`.
2. **Thread 1:** Calls `qp_notify_peer` (still holding the mutex).
3. **`qp_notify_peer`:** Calls `vmci_datagram_dispatch` -> `dg_dispatch_as_host` -> `vmci_ctx_enqueue_datagram`.
4. **`vmci_ctx_enqueue_datagram`:** Calls `vmci_ctx_get(cid)` to get the peer context (which increments the reference).
5. **Concurrently, Thread 2:** Destroys the peer context (`vmci_ctx_destroy`), removes it from the list, and decrements its reference count.
6. **Thread 1's `vmci_ctx_enqueue_datagram`:** Finishes and calls `vmci_ctx_put(context)`.
7. **`vmci_ctx_put`:** Because Thread 2 already dropped the reference, this drops the refcount to 0.
8. **`vmci_ctx_put`:** calls `ctx_free_ctx`.
9. **`ctx_free_ctx`:** Iterates through and calls `vmci_qp_broker_detach`.
10. **`vmci_qp_broker_detach`:** Attempts to acquire `qp_broker_list.mutex`, but Thread 1 already holds it. DEADLOCK.
The same situation can also happen in `qp_broker_attach`, because it calls `vmci_ctx_put(create_context)` while holding `qp_broker_list.mutex`. In addition, `vmci_qp_broker_set_page_store` calls `qp_notify_peer` while holding `qp_broker_list.mutex`.
The fix is straightforward: we need to move the calls to `qp_notify_peer` and `vmci_ctx_put` *outside* the critical section protected by `qp_broker_list.mutex`.
Looking at the code snippets from `vmci_qp_broker_detach`, `qp_broker_attach`, and `vmci_qp_broker_set_page_store`, the solution involves the following:
1. **`vmci_qp_broker_detach`:** Introduce a boolean flag `do_notify` and save `peer_id`, then *defer* the call to `qp_notify_peer` until *after* `mutex_unlock(&qp_broker_list.mutex)`.
|
| 75/1 |
2026/05/09 22:12 |
action |
kernel-scratch-checkouter |
0m
Results: map[KernelScratchSrc:/app/workdir/cache/tmp/tmp3920702968]
|
| 76/1 |
2026/05/09 22:13 |
loop |
|
38m
|
| 77/2 |
2026/05/09 22:13 |
iteration |
0 |
38m
|
| 78/3 |
2026/05/09 22:13 |
agent |
patch-generator |
7m
Model:
Instruction:
You are an experienced Linux kernel developer tasked with creating a fix for a kernel bug.
You will be given a crash report, and an initial explanation of the root cause done by another
kernel expert.
Use the codeeditor tool to do code edits.
Note: you will not see your changes when looking at the code using codesearch tools.
Your final reply should contain explanation of what you did in the patch and why
(details not present in the initial explanation of the bug).
Your fix must not just prevent the given crash, but also be the best fix for the underlying
root cause from the software engineering point of view. There can be several ways to fix the
same bug. Consider alternatives, and pick the best one. For example, additional checks may be
added at different locations/functions, it's usually better to place them earlier in the
execution to avoid multiple checks at various locations later.
Frequently the same coding mistake is done in several locations in the source code.
Check if your fix should be extended/applied to similar cases around to fix other similar bugs.
But don't go too wide, don't try to fix problems kernel-wide, fix similar issues
in the same file only.
If you are changing post-conditions of a function, consider all callers of the functions,
and if they need to be updated to handle new post-conditions. For example, if you make
a function that previously never returned a NULL, return NULL, consider if callers
need to be updated to handle NULL return value.
Prefer calling several tools at the same time to save round-trips.
Prompt:
The crash that corresponds to the bug is:
============================================
WARNING: possible recursive locking detected
syzkaller #1 Not tainted
--------------------------------------------
syz.0.512/7305 is trying to acquire lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
but task is already holding lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
other info that might help us debug this:
Possible unsafe locking scenario:
CPU0
----
lock(qp_broker_list.mutex);
lock(qp_broker_list.mutex);
*** DEADLOCK ***
May be due to missing lock nesting notation
1 lock held by syz.0.512/7305:
#0: ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
stack backtrace:
CPU: 1 UID: 0 PID: 7305 Comm: syz.0.512 Not tainted syzkaller #1 PREEMPT(full)
Hardware name: QEMU Standard PC (Q35 + ICH9, 2009), BIOS 1.16.3-debian-1.16.3-2 04/01/2014
Call Trace:
<TASK>
dump_stack_lvl+0xe8/0x150 lib/dump_stack.c:120
print_deadlock_bug+0x279/0x290 kernel/locking/lockdep.c:3041
check_deadlock kernel/locking/lockdep.c:3093 [inline]
validate_chain kernel/locking/lockdep.c:3895 [inline]
__lock_acquire+0x253f/0x2cf0 kernel/locking/lockdep.c:5237
lock_acquire+0x106/0x350 kernel/locking/lockdep.c:5868
__mutex_lock_common kernel/locking/mutex.c:646 [inline]
__mutex_lock+0x199/0x1550 kernel/locking/mutex.c:820
vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_ctx_enqueue_datagram+0x3ab/0x420 drivers/misc/vmw_vmci/vmci_context.c:340
dg_dispatch_as_host drivers/misc/vmw_vmci/vmci_datagram.c:276 [inline]
vmci_datagram_dispatch+0x450/0xc60 drivers/misc/vmw_vmci/vmci_datagram.c:340
qp_notify_peer drivers/misc/vmw_vmci/vmci_queue_pair.c:1481 [inline]
vmci_qp_broker_detach+0x8dd/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2188
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_host_close+0x98/0x160 drivers/misc/vmw_vmci/vmci_host.c:143
__fput+0x44f/0xa60 fs/file_table.c:510
task_work_run+0x1d9/0x270 kernel/task_work.c:233
resume_user_mode_work include/linux/resume_user_mode.h:50 [inline]
__exit_to_user_mode_loop kernel/entry/common.c:67 [inline]
exit_to_user_mode_loop+0xed/0x480 kernel/entry/common.c:98
__exit_to_user_mode_prepare include/linux/irq-entry-common.h:207 [inline]
syscall_exit_to_user_mode_prepare include/linux/irq-entry-common.h:238 [inline]
syscall_exit_to_user_mode include/linux/entry-common.h:318 [inline]
do_syscall_64+0x33e/0xf80 arch/x86/entry/syscall_64.c:100
entry_SYSCALL_64_after_hwframe+0x77/0x7f
RIP: 0033:0x7f45efd9cdd9
Code: ff c3 66 2e 0f 1f 84 00 00 00 00 00 0f 1f 44 00 00 48 89 f8 48 89 f7 48 89 d6 48 89 ca 4d 89 c2 4d 89 c8 4c 8b 4c 24 08 0f 05 <48> 3d 01 f0 ff ff 73 01 c3 48 c7 c1 e8 ff ff ff f7 d8 64 89 01 48
RSP: 002b:00007ffd73cac3c8 EFLAGS: 00000246 ORIG_RAX: 00000000000001b4
RAX: 0000000000000000 RBX: 00007f45f0017da0 RCX: 00007f45efd9cdd9
RDX: 0000000000000000 RSI: 000000000000001e RDI: 0000000000000003
RBP: 00007f45f0017da0 R08: 00007f45f0016038 R09: 00007f45efe3337e
R10: 000000000003fda8 R11: 0000000000000246 R12: 000000000002029b
R13: 00007f45f0015fac R14: 000000000001ff8e R15: 00007ffd73cac4d0
</TASK>
The explanation of the root cause of the bug is:
The root cause of this crash is a recursive locking deadlock involving `qp_broker_list.mutex`.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires `qp_broker_list.mutex` and, if there are still other endpoints attached, it calls `qp_notify_peer()` to send a notification datagram to the peer context.
The deadlock occurs because `qp_notify_peer()` indirectly calls `vmci_ctx_put()` on the peer's context, which can drop the reference count to 0 if the peer context is concurrently being destroyed. When the reference count reaches 0, `vmci_ctx_put()` synchronously calls `ctx_free_ctx()`. This cleanup function iterates over all queue pairs attached to the dying context and calls `vmci_qp_broker_detach()` for each of them, which attempts to acquire `qp_broker_list.mutex` again, resulting in a deadlock.
Here is the exact call chain leading to the deadlock:
```
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex);
qp_notify_peer()
vmci_datagram_dispatch()
dg_dispatch_as_host()
vmci_ctx_enqueue_datagram()
context = vmci_ctx_get(cid);
...
vmci_ctx_put(context);
kref_put(&context->kref, ctx_free_ctx);
ctx_free_ctx()
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex); <-- DEADLOCK
```
This issue is not isolated to `vmci_qp_broker_detach()`. There are other places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where `qp_notify_peer()` or `vmci_ctx_put()` are called while holding `qp_broker_list.mutex`:
1. **`qp_broker_attach()`**: Calls `vmci_ctx_put(create_context)` directly while holding the mutex. It also calls `qp_notify_peer()`.
2. **`vmci_qp_broker_set_page_store()`**: Calls `qp_notify_peer()` while holding the mutex.
### Proposed Fix
To fix this bug, the calls to `qp_notify_peer()` and `vmci_ctx_put()` must be deferred until after `qp_broker_list.mutex` is released.
For example, in `vmci_qp_broker_detach()`, you can use a boolean flag to defer the notification:
```c
bool do_notify = false;
...
mutex_lock(&qp_broker_list.mutex);
...
if (entry->qp.ref_count == 0) {
...
} else {
do_notify = true;
...
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
A similar approach should be applied to `vmci_qp_broker_set_page_store()`.
For `qp_broker_attach()`, since it is a static helper called by `qp_broker_alloc()`, you can change its signature to pass out the `do_notify` flag, the `notify_peer_id`, and the `struct vmci_ctx **out_ctx` pointer. Then, `qp_broker_alloc()` can safely call `vmci_ctx_put()` and `qp_notify_peer()` after it unlocks `qp_broker_list.mutex`.
Reply: I have implemented the fix to resolve the recursive locking deadlock involving `qp_broker_list.mutex`.
### Explanation of the Fix
The root cause of the deadlock is that `qp_notify_peer()` and `vmci_ctx_put()` were being called while holding `qp_broker_list.mutex`. These functions can indirectly trigger `ctx_free_ctx()` when a context's reference count drops to zero, which then iterates over the queue pairs and attempts to acquire `qp_broker_list.mutex` again, leading to a recursive locking deadlock.
To fix this, I deferred the calls to `qp_notify_peer()` and `vmci_ctx_put()` until after `qp_broker_list.mutex` is safely released. I applied this pattern to all affected locations in `drivers/misc/vmw_vmci/vmci_queue_pair.c`:
1. **`vmci_qp_broker_detach()`**:
- Introduced a `do_notify` boolean flag.
- Instead of calling `qp_notify_peer()` directly while holding the mutex, I set `do_notify = true`.
- After `mutex_unlock(&qp_broker_list.mutex)`, I check the flag and call `qp_notify_peer()` if required.
2. **`vmci_qp_broker_set_page_store()`**:
- Similar to the detach function, I introduced `do_notify` and `notify_peer_id` variables.
- Set `do_notify = true` and `notify_peer_id = entry->create_id` instead of calling `qp_notify_peer()` directly.
- Called `qp_notify_peer()` after releasing the mutex.
3. **`qp_broker_attach()` and `qp_broker_alloc()`**:
- Modified the signature of the static helper `qp_broker_attach()` to accept three new pointer arguments: `bool *do_notify`, `u32 *notify_peer_id`, and `struct vmci_ctx **out_ctx`.
- In `qp_broker_attach()`, instead of calling `vmci_ctx_put(create_context)` directly, I assigned it to `*out_ctx = create_context`.
- In `qp_broker_attach()`, instead of calling `qp_notify_peer()` directly, I set `*do_notify = true` and `*notify_peer_id = entry->create_id`.
- In `qp_broker_alloc()`, I declared local variables for these flags and passed them to `qp_broker_attach()`. After unlocking `qp_broker_list.mutex`, I safely called `vmci_ctx_put(out_ctx)` (if not NULL) and `qp_notify_peer()` (if `do_notify` is true).
These changes ensure that `qp_broker_list.mutex` is never held when `qp_notify_peer()` or `vmci_ctx_put()` are executed, completely eliminating the recursive locking deadlock while preserving the correct logic and behavior of the VMCI queue pair broker.
|
| 79/4 |
2026/05/09 22:13 |
llm |
patch-generator |
1m
Model:
Tokens:
input: 6684
output: 37
thoughts: 330
Thoughts: **Recursive Locking Bug in `vmci_qp_broker_detach()` - Deep Dive**
Okay, so I've got a nasty recursive locking bug biting me in `vmci_qp_broker_detach()`. The culprit appears to be the `qp_broker_list.mutex`, and the stack trace is pretty damning. It looks like `vmci_qp_broker_detach` is calling itself (directly, or through a series of calls).
Let me break down what I'm seeing. `vmci_qp_broker_detach` is locking `qp_broker_list.mutex`. Then, we have this sequence: `ctx_free_ctx` calls `vmci_qp_broker_detach`, which is invoked by `vmci_ctx_put`. `vmci_ctx_put` is triggered by `vmci_ctx_enqueue_datagram` (which is itself called from `dg_dispatch_as_host`), all the way up to the data dispatch and QP notifications. Most importantly, *`vmci_qp_broker_detach` itself is called back from `qp_notify_peer`*. That's where the recursion occurs.
The explanation points out three key problem spots:
1. `vmci_qp_broker_detach()` holds the mutex and calls `qp_notify_peer()`.
2. `qp_broker_attach()` also calls `vmci_ctx_put()` and `qp_notify_peer()` while holding the mutex.
3. `vmci_qp_broker_set_page_store()` holds the mutex and calls `qp_notify_peer()`.
This feels like the "notify" mechanism is trying to do too much while already under the protection of the mutex. I need to go look at the implementation of `qp_notify_peer` more closely to understand exactly what it's doing under the hood, and how it is triggering this call-back from `vmci_qp_broker_detach()`. I'm going to start by examining `drivers/misc/vmw_vmci/vmci_queue_pair.c`, because that's likely where the problem lies. I need to figure out a safe way to handle these notifications without triggering a recursive lock attempt. Maybe move the notification *out* of the critical section? Or is there a more nuanced approach? I'll probably need to revisit the locking strategy.
|
| 80/4 |
2026/05/09 22:14 |
tool |
codesearch-file-index |
0m
Args: map[SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results: map[Entities:[map[Kind:function Name:qp_acquire_queue_mutex] map[Kind:function Name:qp_alloc_guest_work] map[Kind:function Name:qp_alloc_host_work] map[Kind:function Name:qp_alloc_hypercall] map[Kind:function Name:qp_alloc_ppn_set] map[Kind:function Name:qp_alloc_queue] map[Kind:function Name:qp_broker_alloc] map[Kind:function Name:qp_broker_attach] map[Kind:function Name:qp_broker_create] map[Kind:function Name:qp_broker_handle_to_entry] map[Kind:function Name:qp_cleanup_queue_mutex] map[Kind:function Name:qp_dequeue_locked] map[Kind:function Name:qp_detatch] map[Kind:function Name:qp_detatch_guest_work] map[Kind:function Name:qp_detatch_host_work] map[Kind:function Name:qp_detatch_hypercall] map[Kind:function Name:qp_enqueue_locked] map[Kind:function Name:qp_free_ppn_set] map[Kind:function Name:qp_free_queue] map[Kind:function Name:qp_get_queue_headers] map[Kind:function Name:qp_guest_endpoint_create] map[Kind:function Name:qp_guest_endpoint_destroy] map[Kind:function Name:qp_guest_handle_to_entry] map[Kind:function Name:qp_host_alloc_queue] map[Kind:function Name:qp_host_free_queue] map[Kind:function Name:qp_host_get_user_memory] map[Kind:function Name:qp_host_map_queues] map[Kind:function Name:qp_host_register_user_memory] map[Kind:function Name:qp_host_unmap_queues] map[Kind:function Name:qp_host_unregister_user_memory] map[Kind:function Name:qp_init_queue_mutex] map[Kind:function Name:qp_list_add_entry] map[Kind:function Name:qp_list_find] map[Kind:function Name:qp_list_get_head] map[Kind:function Name:qp_list_remove_entry] map[Kind:function Name:qp_lock] map[Kind:function Name:qp_map_queue_headers] map[Kind:function Name:qp_memcpy_from_queue_iter] map[Kind:function Name:qp_memcpy_to_queue_iter] map[Kind:function Name:qp_notify_peer] map[Kind:function Name:qp_notify_peer_local] map[Kind:function Name:qp_populate_ppn_set] map[Kind:function Name:qp_release_pages] map[Kind:function Name:qp_release_queue_mutex] map[Kind:function Name:qp_reset_saved_headers] map[Kind:function Name:qp_save_headers] map[Kind:function Name:qp_unlock] map[Kind:function Name:qp_wait_for_ready_queue] map[Kind:function Name:qp_wakeup_cb] map[Kind:function Name:vmci_qp_alloc] map[Kind:function Name:vmci_qp_broker_alloc] map[Kind:function Name:vmci_qp_broker_detach] map[Kind:function Name:vmci_qp_broker_exit] map[Kind:function Name:vmci_qp_broker_map] map[Kind:function Name:vmci_qp_broker_set_page_store] map[Kind:function Name:vmci_qp_broker_unmap] map[Kind:function Name:vmci_qp_guest_endpoints_exit] map[Kind:function Name:vmci_qpair_alloc] map[Kind:function Name:vmci_qpair_consume_buf_ready] map[Kind:function Name:vmci_qpair_consume_free_space] map[Kind:function Name:vmci_qpair_dequev] map[Kind:function Name:vmci_qpair_detach] map[Kind:function Name:vmci_qpair_enquev] map[Kind:function Name:vmci_qpair_get_consume_indexes] map[Kind:function Name:vmci_qpair_get_produce_indexes] map[Kind:function Name:vmci_qpair_peekv] map[Kind:function Name:vmci_qpair_produce_buf_ready] map[Kind:function Name:vmci_qpair_produce_free_space] map[Kind:struct Name:qp_broker_entry] map[Kind:struct Name:qp_entry] map[Kind:struct Name:qp_guest_endpoint] map[Kind:struct Name:qp_list] map[Kind:struct Name:vmci_qp] map[Kind:struct Name:vmci_queue_kern_if] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_alloc_1044] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_consume_buf_ready_1051] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_consume_free_space_1049] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_dequev_1053] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_detach_1045] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_enquev_1052] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_get_consume_indexes_1047] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_get_produce_indexes_1046] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_peekv_1054] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_produce_buf_ready_1050] map[Kind:global_variable Name:__UNIQUE_ID_addressable_vmci_qpair_produce_free_space_1048] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_alloc] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_consume_buf_ready] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_consume_free_space] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_dequev] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_detach] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_enquev] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_get_consume_indexes] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_get_produce_indexes] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_peekv] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_produce_buf_ready] map[Kind:global_variable Name:__gendwarfksyms_ptr_vmci_qpair_produce_free_space] map[Kind:global_variable Name:qp_broker_list] map[Kind:global_variable Name:qp_guest_endpoints] map[Kind:enum Name:qp_broker_state]]]
|
| 81/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 9719
output: 55
thoughts: 46
Thoughts: Here's my analysis of the provided terms, thinking about how they relate and what they mean in the bigger VMCI picture:
**Examining the VMCI Queue Pair Broker Functions**
Okay, so I'm focusing on the functions `vmci_qp_broker_detach`, `vmci_qp_broker_set_page_store`, `qp_broker_attach`, and `qp_broker_alloc`. These are the key functions I'm working with right now, and I need to really understand their interactions. `vmci_qp_broker_detach` suggests a cleanup or removal process, probably freeing resources associated with a queue pair broker, the logical counterpart of `qp_broker_attach` which has to mean some sort of initialization or setup, likely attaching a queue pair to a broker. I'm wondering if there's an implicit `vmci_qp_broker_attach` here somewhere...
Then there's `vmci_qp_broker_set_page_store`, which instantly makes me think about memory management. This strongly suggests the broker is responsible for managing the backing store for the queue pairs' pages, so this function is likely setting up the location or method for that storage. This is probably critical for performance and security, so I'll want to dig into that function. `qp_broker_alloc` is almost certainly about allocating and initializing a broker itself. I'll need to see how these functions interact to see how a queue pair broker is created, used, and eventually torn down. I'll need to figure out the broker lifecycle and resource management. I'm expecting locking to be involved... and what's the error handling like? These are the sorts of questions I'll be answering as I examine these.
|
| 82/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_detach]
Results: map[SourceCode:2064: /*
2065: * The main entry point for detaching from a queue pair registered with the
2066: * queue pair broker. If more than one endpoint is attached to the queue
2067: * pair, the first endpoint will mainly decrement a reference count and
2068: * generate a notification to its peer. The last endpoint will clean up
2069: * the queue pair state registered with the broker.
2070: *
2071: * When a guest endpoint detaches, it will unmap and unregister the guest
2072: * memory backing the queue pair. If the host is still attached, it will
2073: * no longer be able to access the queue pair content.
2074: *
2075: * If the queue pair is already in a state where there is no memory
2076: * registered for the queue pair (any *_NO_MEM state), it will transition to
2077: * the VMCIQPB_SHUTDOWN_NO_MEM state. This will also happen, if a guest
2078: * endpoint is the first of two endpoints to detach. If the host endpoint is
2079: * the first out of two to detach, the queue pair will move to the
2080: * VMCIQPB_SHUTDOWN_MEM state.
2081: */
2082: int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
2083: {
2084: struct qp_broker_entry *entry;
2085: const u32 context_id = vmci_ctx_get_id(context);
2086: u32 peer_id;
2087: bool is_local = false;
2088: int result;
2089:
2090: if (vmci_handle_is_invalid(handle) || !context ||
2091: context_id == VMCI_INVALID_ID) {
2092: return VMCI_ERROR_INVALID_ARGS;
2093: }
2094:
2095: mutex_lock(&qp_broker_list.mutex);
2096:
2097: if (!vmci_ctx_qp_exists(context, handle)) {
2098: pr_devel("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
2099: context_id, handle.context, handle.resource);
2100: result = VMCI_ERROR_NOT_FOUND;
2101: goto out;
2102: }
2103:
2104: entry = qp_broker_handle_to_entry(handle);
2105: if (!entry) {
2106: pr_devel("Context (ID=0x%x) reports being attached to queue pair(handle=0x%x:0x%x) that isn't present in broker\n",
2107: context_id, handle.context, handle.resource);
2108: result = VMCI_ERROR_NOT_FOUND;
2109: goto out;
2110: }
2111:
2112: if (context_id != entry->create_id && context_id != entry->attach_id) {
2113: result = VMCI_ERROR_QUEUEPAIR_NOTATTACHED;
2114: goto out;
2115: }
2116:
2117: if (context_id == entry->create_id) {
2118: peer_id = entry->attach_id;
2119: entry->create_id = VMCI_INVALID_ID;
2120: } else {
2121: peer_id = entry->create_id;
2122: entry->attach_id = VMCI_INVALID_ID;
2123: }
2124: entry->qp.ref_count--;
2125:
2126: is_local = entry->qp.flags & VMCI_QPFLAG_LOCAL;
2127:
2128: if (context_id != VMCI_HOST_CONTEXT_ID) {
2129: bool headers_mapped;
2130:
2131: /*
2132: * Pre NOVMVM vmx'en may detach from a queue pair
2133: * before setting the page store, and in that case
2134: * there is no user memory to detach from. Also, more
2135: * recent VMX'en may detach from a queue pair in the
2136: * quiesced state.
2137: */
2138:
2139: qp_acquire_queue_mutex(entry->produce_q);
2140: headers_mapped = entry->produce_q->q_header ||
2141: entry->consume_q->q_header;
2142: if (QPBROKERSTATE_HAS_MEM(entry)) {
2143: result =
2144: qp_host_unmap_queues(INVALID_VMCI_GUEST_MEM_ID,
2145: entry->produce_q,
2146: entry->consume_q);
2147: if (result < VMCI_SUCCESS)
2148: pr_warn("Failed to unmap queue headers for queue pair (handle=0x%x:0x%x,result=%d)\n",
2149: handle.context, handle.resource,
2150: result);
2151:
2152: qp_host_unregister_user_memory(entry->produce_q,
2153: entry->consume_q);
2154:
2155: }
2156:
2157: if (!headers_mapped)
2158: qp_reset_saved_headers(entry);
2159:
2160: qp_release_queue_mutex(entry->produce_q);
2161:
2162: if (!headers_mapped && entry->wakeup_cb)
2163: entry->wakeup_cb(entry->client_data);
2164:
2165: } else {
2166: if (entry->wakeup_cb) {
2167: entry->wakeup_cb = NULL;
2168: entry->client_data = NULL;
2169: }
2170: }
2171:
2172: if (entry->qp.ref_count == 0) {
2173: qp_list_remove_entry(&qp_broker_list, &entry->qp);
2174:
2175: if (is_local)
2176: kfree(entry->local_mem);
2177:
2178: qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
2179: qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
2180: qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
2181: /* Unlink from resource hash table and free callback */
2182: vmci_resource_remove(&entry->resource);
2183:
2184: kfree(entry);
2185:
2186: vmci_ctx_qp_destroy(context, handle);
2187: } else {
2188: qp_notify_peer(false, handle, context_id, peer_id);
2189: if (context_id == VMCI_HOST_CONTEXT_ID &&
2190: QPBROKERSTATE_HAS_MEM(entry)) {
2191: entry->state = VMCIQPB_SHUTDOWN_MEM;
2192: } else {
2193: entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
2194: }
2195:
2196: if (!is_local)
2197: vmci_ctx_qp_destroy(context, handle);
2198:
2199: }
2200: result = VMCI_SUCCESS;
2201: out:
2202: mutex_unlock(&qp_broker_list.mutex);
2203: return result;
2204: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 83/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 12467
output: 59
thoughts: 68
Thoughts: **Deferring Detachment in the VMCI QP Broker**
Alright, so I'm deep diving into `vmci_qp_broker_detach` and, bam, there it is at line 2188: `qp_notify_peer(false, handle, context_id, peer_id);`. This is the point where we're telling the peer about the detach, and it's making me think this needs to be deferred. We wouldn't want to get ahead of ourselves. Now, I should probably check `vmci_qp_broker_set_page_store` to see what’s what.
|
| 84/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_set_page_store]
Results: map[SourceCode:1947: /*
1948: * VMX'en with versions lower than VMCI_VERSION_NOVMVM use a separate
1949: * step to add the UVAs of the VMX mapping of the queue pair. This function
1950: * provides backwards compatibility with such VMX'en, and takes care of
1951: * registering the page store for a queue pair previously allocated by the
1952: * VMX during create or attach. This function will move the queue pair state
1953: * to either from VMCIQBP_CREATED_NO_MEM to VMCIQBP_CREATED_MEM or
1954: * VMCIQBP_ATTACHED_NO_MEM to VMCIQBP_ATTACHED_MEM. If moving to the
1955: * attached state with memory, the queue pair is ready to be used by the
1956: * host peer, and an attached event will be generated.
1957: *
1958: * Assumes that the queue pair broker lock is held.
1959: *
1960: * This function is only used by the hosted platform, since there is no
1961: * issue with backwards compatibility for vmkernel.
1962: */
1963: int vmci_qp_broker_set_page_store(struct vmci_handle handle,
1964: u64 produce_uva,
1965: u64 consume_uva,
1966: struct vmci_ctx *context)
1967: {
1968: struct qp_broker_entry *entry;
1969: int result;
1970: const u32 context_id = vmci_ctx_get_id(context);
1971:
1972: if (vmci_handle_is_invalid(handle) || !context ||
1973: context_id == VMCI_INVALID_ID)
1974: return VMCI_ERROR_INVALID_ARGS;
1975:
1976: /*
1977: * We only support guest to host queue pairs, so the VMX must
1978: * supply UVAs for the mapped page files.
1979: */
1980:
1981: if (produce_uva == 0 || consume_uva == 0)
1982: return VMCI_ERROR_INVALID_ARGS;
1983:
1984: mutex_lock(&qp_broker_list.mutex);
1985:
1986: if (!vmci_ctx_qp_exists(context, handle)) {
1987: pr_warn("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
1988: context_id, handle.context, handle.resource);
1989: result = VMCI_ERROR_NOT_FOUND;
1990: goto out;
1991: }
1992:
1993: entry = qp_broker_handle_to_entry(handle);
1994: if (!entry) {
1995: result = VMCI_ERROR_NOT_FOUND;
1996: goto out;
1997: }
1998:
1999: /*
2000: * If I'm the owner then I can set the page store.
2001: *
2002: * Or, if a host created the queue_pair and I'm the attached peer
2003: * then I can set the page store.
2004: */
2005: if (entry->create_id != context_id &&
2006: (entry->create_id != VMCI_HOST_CONTEXT_ID ||
2007: entry->attach_id != context_id)) {
2008: result = VMCI_ERROR_QUEUEPAIR_NOTOWNER;
2009: goto out;
2010: }
2011:
2012: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
2013: entry->state != VMCIQPB_ATTACHED_NO_MEM) {
2014: result = VMCI_ERROR_UNAVAILABLE;
2015: goto out;
2016: }
2017:
2018: result = qp_host_get_user_memory(produce_uva, consume_uva,
2019: entry->produce_q, entry->consume_q);
2020: if (result < VMCI_SUCCESS)
2021: goto out;
2022:
2023: result = qp_host_map_queues(entry->produce_q, entry->consume_q);
2024: if (result < VMCI_SUCCESS) {
2025: qp_host_unregister_user_memory(entry->produce_q,
2026: entry->consume_q);
2027: goto out;
2028: }
2029:
2030: if (entry->state == VMCIQPB_CREATED_NO_MEM)
2031: entry->state = VMCIQPB_CREATED_MEM;
2032: else
2033: entry->state = VMCIQPB_ATTACHED_MEM;
2034:
2035: entry->vmci_page_files = true;
2036:
2037: if (entry->state == VMCIQPB_ATTACHED_MEM) {
2038: result =
2039: qp_notify_peer(true, handle, context_id, entry->create_id);
2040: if (result < VMCI_SUCCESS) {
2041: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
2042: entry->create_id, entry->qp.handle.context,
2043: entry->qp.handle.resource);
2044: }
2045: }
2046:
2047: result = VMCI_SUCCESS;
2048: out:
2049: mutex_unlock(&qp_broker_list.mutex);
2050: return result;
2051: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 85/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 14450
output: 52
thoughts: 53
Thoughts: Here's my analysis of the provided code snippet:
**Diving into vmci_qp_broker_set_page_store**
Okay, so I'm looking at `vmci_qp_broker_set_page_store`, and the key point that jumps out at me is line 2038. That's where `qp_notify_peer` is being called. I need to understand the implications of that call within this specific function. To do that properly, I'm going to dig a little deeper, and the logical next steps are `qp_broker_attach` and `qp_broker_alloc`. I want to see how the broker is set up and allocated initially, because that will illuminate what `qp_notify_peer` is likely signaling or doing. Knowing the setup will let me build a clear mental model of the system's behavior. I anticipate these two functions will provide the context I require to understand the notification's purpose.
|
| 86/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_attach]
Results: map[SourceCode:1490: /*
1491: * The second endpoint issuing a queue pair allocation will attach to
1492: * the queue pair registered with the queue pair broker.
1493: *
1494: * If the attacher is a guest, it will associate a VMX virtual address
1495: * range with the queue pair as specified by the page_store. At this
1496: * point, the already attach host endpoint may start using the queue
1497: * pair, and an attach event is sent to it. For compatibility with
1498: * older VMX'en, that used a separate step to set the VMX virtual
1499: * address range, the virtual address range can be registered later
1500: * using vmci_qp_broker_set_page_store. In that case, a page_store of
1501: * NULL should be used, and the attach event will be generated once
1502: * the actual page store has been set.
1503: *
1504: * If the attacher is the host, a page_store of NULL should be used as
1505: * well, since the page store information is already set by the guest.
1506: *
1507: * For new VMX and host callers, the queue pair will be moved to the
1508: * VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
1509: * moved to the VMCOQPB_ATTACHED_NO_MEM state.
1510: */
1511: static int qp_broker_attach(struct qp_broker_entry *entry,
1512: u32 peer,
1513: u32 flags,
1514: u32 priv_flags,
1515: u64 produce_size,
1516: u64 consume_size,
1517: struct vmci_qp_page_store *page_store,
1518: struct vmci_ctx *context,
1519: vmci_event_release_cb wakeup_cb,
1520: void *client_data,
1521: struct qp_broker_entry **ent)
1522: {
1523: const u32 context_id = vmci_ctx_get_id(context);
1524: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1525: int result;
1526:
1527: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
1528: entry->state != VMCIQPB_CREATED_MEM)
1529: return VMCI_ERROR_UNAVAILABLE;
1530:
1531: if (is_local) {
1532: if (!(entry->qp.flags & VMCI_QPFLAG_LOCAL) ||
1533: context_id != entry->create_id) {
1534: return VMCI_ERROR_INVALID_ARGS;
1535: }
1536: } else if (context_id == entry->create_id ||
1537: context_id == entry->attach_id) {
1538: return VMCI_ERROR_ALREADY_EXISTS;
1539: }
1540:
1541: if (VMCI_CONTEXT_IS_VM(context_id) &&
1542: VMCI_CONTEXT_IS_VM(entry->create_id))
1543: return VMCI_ERROR_DST_UNREACHABLE;
1544:
1545: /*
1546: * If we are attaching from a restricted context then the queuepair
1547: * must have been created by a trusted endpoint.
1548: */
1549: if ((context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED) &&
1550: !entry->created_by_trusted)
1551: return VMCI_ERROR_NO_ACCESS;
1552:
1553: /*
1554: * If we are attaching to a queuepair that was created by a restricted
1555: * context then we must be trusted.
1556: */
1557: if (entry->require_trusted_attach &&
1558: (!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED)))
1559: return VMCI_ERROR_NO_ACCESS;
1560:
1561: /*
1562: * If the creator specifies VMCI_INVALID_ID in "peer" field, access
1563: * control check is not performed.
1564: */
1565: if (entry->qp.peer != VMCI_INVALID_ID && entry->qp.peer != context_id)
1566: return VMCI_ERROR_NO_ACCESS;
1567:
1568: if (entry->create_id == VMCI_HOST_CONTEXT_ID) {
1569: /*
1570: * Do not attach if the caller doesn't support Host Queue Pairs
1571: * and a host created this queue pair.
1572: */
1573:
1574: if (!vmci_ctx_supports_host_qp(context))
1575: return VMCI_ERROR_INVALID_RESOURCE;
1576:
1577: } else if (context_id == VMCI_HOST_CONTEXT_ID) {
1578: struct vmci_ctx *create_context;
1579: bool supports_host_qp;
1580:
1581: /*
1582: * Do not attach a host to a user created queue pair if that
1583: * user doesn't support host queue pair end points.
1584: */
1585:
1586: create_context = vmci_ctx_get(entry->create_id);
1587: supports_host_qp = vmci_ctx_supports_host_qp(create_context);
1588: vmci_ctx_put(create_context);
1589:
1590: if (!supports_host_qp)
1591: return VMCI_ERROR_INVALID_RESOURCE;
1592: }
1593:
1594: if ((entry->qp.flags & ~VMCI_QP_ASYMM) != (flags & ~VMCI_QP_ASYMM_PEER))
1595: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1596:
1597: if (context_id != VMCI_HOST_CONTEXT_ID) {
1598: /*
1599: * The queue pair broker entry stores values from the guest
1600: * point of view, so an attaching guest should match the values
1601: * stored in the entry.
1602: */
1603:
1604: if (entry->qp.produce_size != produce_size ||
1605: entry->qp.consume_size != consume_size) {
1606: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1607: }
1608: } else if (entry->qp.produce_size != consume_size ||
1609: entry->qp.consume_size != produce_size) {
1610: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1611: }
1612:
1613: if (context_id != VMCI_HOST_CONTEXT_ID) {
1614: /*
1615: * If a guest attached to a queue pair, it will supply
1616: * the backing memory. If this is a pre NOVMVM vmx,
1617: * the backing memory will be supplied by calling
1618: * vmci_qp_broker_set_page_store() following the
1619: * return of the vmci_qp_broker_alloc() call. If it is
1620: * a vmx of version NOVMVM or later, the page store
1621: * must be supplied as part of the
1622: * vmci_qp_broker_alloc call. Under all circumstances
1623: * must the initially created queue pair not have any
1624: * memory associated with it already.
1625: */
1626:
1627: if (entry->state != VMCIQPB_CREATED_NO_MEM)
1628: return VMCI_ERROR_INVALID_ARGS;
1629:
1630: if (page_store != NULL) {
1631: /*
1632: * Patch up host state to point to guest
1633: * supplied memory. The VMX already
1634: * initialized the queue pair headers, so no
1635: * need for the kernel side to do that.
1636: */
1637:
1638: result = qp_host_register_user_memory(page_store,
1639: entry->produce_q,
1640: entry->consume_q);
1641: if (result < VMCI_SUCCESS)
1642: return result;
1643:
1644: entry->state = VMCIQPB_ATTACHED_MEM;
1645: } else {
1646: entry->state = VMCIQPB_ATTACHED_NO_MEM;
1647: }
1648: } else if (entry->state == VMCIQPB_CREATED_NO_MEM) {
1649: /*
1650: * The host side is attempting to attach to a queue
1651: * pair that doesn't have any memory associated with
1652: * it. This must be a pre NOVMVM vmx that hasn't set
1653: * the page store information yet, or a quiesced VM.
1654: */
1655:
1656: return VMCI_ERROR_UNAVAILABLE;
1657: } else {
1658: /* The host side has successfully attached to a queue pair. */
1659: entry->state = VMCIQPB_ATTACHED_MEM;
1660: }
1661:
1662: if (entry->state == VMCIQPB_ATTACHED_MEM) {
1663: result =
1664: qp_notify_peer(true, entry->qp.handle, context_id,
1665: entry->create_id);
1666: if (result < VMCI_SUCCESS)
1667: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
1668: entry->create_id, entry->qp.handle.context,
1669: entry->qp.handle.resource);
1670: }
1671:
1672: entry->attach_id = context_id;
1673: entry->qp.ref_count++;
1674: if (wakeup_cb) {
1675: entry->wakeup_cb = wakeup_cb;
1676: entry->client_data = client_data;
1677: }
1678:
1679: /*
1680: * When attaching to local queue pairs, the context already has
1681: * an entry tracking the queue pair, so don't add another one.
1682: */
1683: if (!is_local)
1684: vmci_ctx_qp_create(context, entry->qp.handle);
1685:
1686: if (ent != NULL)
1687: *ent = entry;
1688:
1689: return VMCI_SUCCESS;
1690: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 87/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 17992
output: 52
thoughts: 178
Thoughts: **Refactoring the Broker Attachment Process**
Okay, so I'm looking at `qp_broker_attach`, and I see the problem immediately: `vmci_ctx_put` is called at line 1588, and `qp_notify_peer` is at line 1664. That's a classic race condition waiting to happen. The description suggests a good, clean refactoring approach. Instead of having those calls embedded within `qp_broker_attach` itself, which is a static helper for `qp_broker_alloc`, we can make the call more explicit.
The idea is to modify `qp_broker_attach`’s signature to pass out the `do_notify` flag, the `notify_peer_id`, and a `struct vmci_ctx **out_ctx` pointer. This means the return is essentially changed to allow the caller to handle the context and notification. Then, `qp_broker_alloc` can handle the `vmci_ctx_put()` and `qp_notify_peer()` calls *after* it’s safely unlocked `qp_broker_list.mutex`. That way, the critical section protection is maintained, and we can avoid the potential for resource leaks and concurrency issues. I will now look at the implementation of `vmci_qp_broker_alloc` and `qp_broker_alloc` and formulate a new approach based on this understanding.
|
| 88/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_alloc]
Results: map[SourceCode:1692: /*
1693: * queue_pair_Alloc for use when setting up queue pair endpoints
1694: * on the host.
1695: */
1696: static int qp_broker_alloc(struct vmci_handle handle,
1697: u32 peer,
1698: u32 flags,
1699: u32 priv_flags,
1700: u64 produce_size,
1701: u64 consume_size,
1702: struct vmci_qp_page_store *page_store,
1703: struct vmci_ctx *context,
1704: vmci_event_release_cb wakeup_cb,
1705: void *client_data,
1706: struct qp_broker_entry **ent,
1707: bool *swap)
1708: {
1709: const u32 context_id = vmci_ctx_get_id(context);
1710: bool create;
1711: struct qp_broker_entry *entry = NULL;
1712: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1713: int result;
1714:
1715: if (vmci_handle_is_invalid(handle) ||
1716: (flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
1717: !(produce_size || consume_size) ||
1718: !context || context_id == VMCI_INVALID_ID ||
1719: handle.context == VMCI_INVALID_ID) {
1720: return VMCI_ERROR_INVALID_ARGS;
1721: }
1722:
1723: if (page_store && !VMCI_QP_PAGESTORE_IS_WELLFORMED(page_store))
1724: return VMCI_ERROR_INVALID_ARGS;
1725:
1726: /*
1727: * In the initial argument check, we ensure that non-vmkernel hosts
1728: * are not allowed to create local queue pairs.
1729: */
1730:
1731: mutex_lock(&qp_broker_list.mutex);
1732:
1733: if (!is_local && vmci_ctx_qp_exists(context, handle)) {
1734: pr_devel("Context (ID=0x%x) already attached to queue pair (handle=0x%x:0x%x)\n",
1735: context_id, handle.context, handle.resource);
1736: mutex_unlock(&qp_broker_list.mutex);
1737: return VMCI_ERROR_ALREADY_EXISTS;
1738: }
1739:
1740: if (handle.resource != VMCI_INVALID_ID)
1741: entry = qp_broker_handle_to_entry(handle);
1742:
1743: if (!entry) {
1744: create = true;
1745: result =
1746: qp_broker_create(handle, peer, flags, priv_flags,
1747: produce_size, consume_size, page_store,
1748: context, wakeup_cb, client_data, ent);
1749: } else {
1750: create = false;
1751: result =
1752: qp_broker_attach(entry, peer, flags, priv_flags,
1753: produce_size, consume_size, page_store,
1754: context, wakeup_cb, client_data, ent);
1755: }
1756:
1757: mutex_unlock(&qp_broker_list.mutex);
1758:
1759: if (swap)
1760: *swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
1761: !(create && is_local);
1762:
1763: return result;
1764: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 89/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 19687
output: 55
thoughts: 55
Thoughts: Okay, let me think this through.
**Refining the `qp_broker_attach` Function**
Right, so I'm looking at `qp_broker_attach` and the fundamental requirement here is that the function needs to evolve. Specifically, it needs to be updated to return a few key pieces of information. It should provide `do_notify`, `notify_peer_id`, and `out_ctx`. I get the need to pass these items back to the caller.
Let me just make sure I have the flow correct... Ah, yes. I recall that `qp_broker_alloc` is called by `vmci_qp_broker_alloc`. This informs how to connect the changes I need to make in this code path.
|
| 90/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_alloc]
Results: map[SourceCode:1923: /*
1924: * Requests that a queue pair be allocated with the VMCI queue
1925: * pair broker. Allocates a queue pair entry if one does not
1926: * exist. Attaches to one if it exists, and retrieves the page
1927: * files backing that queue_pair. Assumes that the queue pair
1928: * broker lock is held.
1929: */
1930: int vmci_qp_broker_alloc(struct vmci_handle handle,
1931: u32 peer,
1932: u32 flags,
1933: u32 priv_flags,
1934: u64 produce_size,
1935: u64 consume_size,
1936: struct vmci_qp_page_store *page_store,
1937: struct vmci_ctx *context)
1938: {
1939: if (!QP_SIZES_ARE_VALID(produce_size, consume_size))
1940: return VMCI_ERROR_NO_RESOURCES;
1941:
1942: return qp_broker_alloc(handle, peer, flags, priv_flags,
1943: produce_size, consume_size,
1944: page_store, context, NULL, NULL, NULL, NULL);
1945: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 91/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 20365
output: 60
thoughts: 61
Thoughts: Here's my take on the thought process:
**Diving Deep into `qp_broker_alloc` Dependencies**
Okay, hold on a second. I thought `qp_broker_alloc` was only used in this particular context, but now I'm seeing a call to it from `vmci_qp_guest_endpoints_exit`? That doesn't seem right. Or wait… am I misremembering? Did `vmci_qpair_alloc` actually make the call to `qp_broker_alloc`? I need to clarify the exact call structure here, because my mental map of these interactions isn't quite clicking. Alright, time to go back to the source and get a definitive answer. I need to get a firm handle on all the references to `qp_broker_alloc` to ensure I'm getting the complete picture.
|
| 92/4 |
2026/05/09 22:14 |
tool |
codesearch-find-references |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeSnippetLines:0 Name:qp_broker_alloc SourceTreePrefix:]
Results: map[References:[map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:qp_alloc_host_work SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:1796] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_qp_broker_alloc SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:1942]] TruncatedOutput:false]
|
| 93/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 20814
output: 54
thoughts: 19
Thoughts: Okay, here's the summary, rendered as if I'm thinking it:
**Digging into the Allocation Chain**
Right, so `qp_alloc_host_work`… that's where the magic happens, or at least, *starts* to happen, isn't it? And, as I suspected, this function appears to directly call `qp_broker_alloc`. That makes sense; it's the natural progression. I need to remember to check the return value, since a failure there would cause all sorts of problems down the line. It's the broker that handles actual resource allocation, so *this* call is the pivotal point for getting the host work structure the resources that it needs. I'll need to figure out what parameters are being passed and how the broker decides what to actually allocate.
|
| 94/4 |
2026/05/09 22:14 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_alloc_host_work]
Results: map[SourceCode:1766: /*
1767: * This function implements the kernel API for allocating a queue
1768: * pair.
1769: */
1770: static int qp_alloc_host_work(struct vmci_handle *handle,
1771: struct vmci_queue **produce_q,
1772: u64 produce_size,
1773: struct vmci_queue **consume_q,
1774: u64 consume_size,
1775: u32 peer,
1776: u32 flags,
1777: u32 priv_flags,
1778: vmci_event_release_cb wakeup_cb,
1779: void *client_data)
1780: {
1781: struct vmci_handle new_handle;
1782: struct vmci_ctx *context;
1783: struct qp_broker_entry *entry;
1784: int result;
1785: bool swap;
1786:
1787: if (vmci_handle_is_invalid(*handle)) {
1788: new_handle = vmci_make_handle(
1789: VMCI_HOST_CONTEXT_ID, VMCI_INVALID_ID);
1790: } else
1791: new_handle = *handle;
1792:
1793: context = vmci_ctx_get(VMCI_HOST_CONTEXT_ID);
1794: entry = NULL;
1795: result =
1796: qp_broker_alloc(new_handle, peer, flags, priv_flags,
1797: produce_size, consume_size, NULL, context,
1798: wakeup_cb, client_data, &entry, &swap);
1799: if (result == VMCI_SUCCESS) {
1800: if (swap) {
1801: /*
1802: * If this is a local queue pair, the attacher
1803: * will swap around produce and consume
1804: * queues.
1805: */
1806:
1807: *produce_q = entry->consume_q;
1808: *consume_q = entry->produce_q;
1809: } else {
1810: *produce_q = entry->produce_q;
1811: *consume_q = entry->consume_q;
1812: }
1813:
1814: *handle = vmci_resource_handle(&entry->resource);
1815: } else {
1816: *handle = VMCI_INVALID_HANDLE;
1817: pr_devel("queue pair broker failed to alloc (result=%d)\n",
1818: result);
1819: }
1820: vmci_ctx_put(context);
1821: return result;
1822: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 95/4 |
2026/05/09 22:14 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 21914
output: 340
thoughts: 1458
Thoughts: **Refactoring Queue Pair Broker Attachment and Allocation**
Okay, so I'm looking at how `qp_broker_attach` and `qp_broker_alloc` manage context and peer notifications. It seems like we can improve this by deferring certain operations. Currently, `qp_broker_attach` calls `vmci_ctx_put` directly on line 1588. I'm thinking we can return the context instead. If we pass a `struct vmci_ctx **out_ctx` to `qp_broker_attach`, we can defer the `vmci_ctx_put` to after the `qp_broker_list.mutex` is unlocked. This would be a cleaner separation of concerns and could potentially reduce contention.
`qp_broker_attach` also does a direct call to `qp_notify_peer` on line 1664. Similarly, I want to avoid this. We can return the necessary information to perform the notification later. To achieve this, I'll return a `bool *do_notify` and a `u32 *notify_peer_id` from `qp_broker_attach` and `qp_broker_alloc` to indicate whether and to whom notification is required.
I also need to check `qp_broker_alloc`. The changes in `qp_broker_attach` require a corresponding update to `qp_broker_alloc`. It seems like my idea works there too, so I'll include the necessary updates in both.
|
| 96/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode:static int qp_broker_attach(struct qp_broker_entry *entry,
u32 peer,
u32 flags,
u32 priv_flags,
u64 produce_size,
u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
vmci_event_release_cb wakeup_cb,
void *client_data,
struct qp_broker_entry **ent) NewCode:static int qp_broker_attach(struct qp_broker_entry *entry,
u32 peer,
u32 flags,
u32 priv_flags,
u64 produce_size,
u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
vmci_event_release_cb wakeup_cb,
void *client_data,
struct qp_broker_entry **ent,
bool *do_notify,
u32 *notify_peer_id,
struct vmci_ctx **out_ctx) SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 97/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 24042
output: 195
thoughts: 11
Thoughts: Okay, here's my take on those thoughts, tailored for an expert audience, presented in the first person:
**Modifying `qp_broker_attach` Body**
Alright, I'm thinking about the `qp_broker_attach` body. I need to make some key modifications here. Essentially, I'm at the point where I'm ready to dive into the core implementation. The goal is to refine the existing logic or add a new block. I have to make sure to consider potential impacts on all related functionalities. I'm focusing on efficiency; how can I optimize this part of the system for both performance and resource utilization? I also need to make sure I am accounting for edge cases and error handling. This has to be robust. Before I commit to any changes, I need to outline exactly what aspects of the existing code I will need to refine.
|
| 98/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode: create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
vmci_ctx_put(create_context);
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE; NewCode: create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
*out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE; SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 99/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 24436
output: 220
thoughts: 87
Thoughts: Okay, let me think this through.
**Analyzing the VMCI Error Handling and Context Release**
Alright, so if `supports_host_qp` is false, the code correctly returns `VMCI_ERROR_INVALID_RESOURCE`. That part seems sound. But wait... `out_ctx` is *still* being set in this scenario. This means that even with the error, the caller function, `qp_broker_alloc`, will eventually call `vmci_ctx_put(out_ctx)` after it releases the mutex. Excellent! That takes care of the context properly, even in failure scenarios. It's good to see the error handling is robust; prevents potential memory leaks or resource contention.
Now, my focus shifts. I need to modify the `qp_notify_peer` section within `qp_broker_attach`. Based on the context, I think I see how to integrate this with the updated behavior of the function.
|
| 100/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode: if (entry->state == VMCIQPB_ATTACHED_MEM) {
result =
qp_notify_peer(true, entry->qp.handle, context_id,
entry->create_id);
if (result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
entry->create_id, entry->qp.handle.context,
entry->qp.handle.resource);
} NewCode: if (entry->state == VMCIQPB_ATTACHED_MEM) {
*do_notify = true;
*notify_peer_id = entry->create_id;
} SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 101/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 24947
output: 482
thoughts: 17
Thoughts: Okay, here's my take on those thoughts, tailored for an expert audience, presented in the first person:
**Modifying `qp_broker_alloc` for Enhanced Argument Handling**
Right, so the next logical step is to dive into `qp_broker_alloc`. I need to refactor this function to properly accept and manage those new arguments we've been discussing. The goal is elegant integration, ensuring that the existing functionality isn't broken, but can gracefully handle the additions. Thinking about the design, I'll need to consider the scope of these new arguments; are they fundamental configuration parameters, or optional performance tunings? That will dictate whether I implement default values, validation checks, and error handling within the function itself, or if those responsibilities are pushed higher up in the call stack. Ultimately, I need a clear and maintainable interface that will allow these arguments to be correctly passed and used. This change must work in concert with any existing methods that use this call, so I'll also have to evaluate how these changes will impact any of those.
|
| 102/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode:static int qp_broker_alloc(struct vmci_handle handle,
u32 peer,
u32 flags,
u32 priv_flags,
u64 produce_size,
u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
vmci_event_release_cb wakeup_cb,
void *client_data,
struct qp_broker_entry **ent,
bool *swap)
{
const u32 context_id = vmci_ctx_get_id(context);
bool create;
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result; NewCode:static int qp_broker_alloc(struct vmci_handle handle,
u32 peer,
u32 flags,
u32 priv_flags,
u64 produce_size,
u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
vmci_event_release_cb wakeup_cb,
void *client_data,
struct qp_broker_entry **ent,
bool *swap)
{
const u32 context_id = vmci_ctx_get_id(context);
bool create;
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result;
bool do_notify = false;
u32 notify_peer_id = VMCI_INVALID_ID;
struct vmci_ctx *out_ctx = NULL; SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 103/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 25674
output: 445
thoughts: 29
Thoughts: Okay, here's my summary, taking on the persona you requested:
**Refactoring the Broker Allocation**
Alright, let's get down to brass tacks. I'm looking at the `qp_broker_alloc` function. The call to `qp_broker_attach` here… it needs to be modified. It's not quite right in the context of the overall allocation strategy I'm aiming for. I have a hunch about how I can streamline this for better resource management and potential performance gains. I need to make sure the attachment happens in the correct order, and that whatever modifications are being made there do not violate the core principles I'm going for.
Then, there's the code that follows the `mutex_unlock`. That section needs a critical review. I suspect there might be a subtle race condition in that area, or perhaps some unnecessary overhead. I want to ensure the data is properly synchronized at that stage. So, I need to take a close look at what's happening *after* the mutex release. Specifically, I'll be focused on:
* **Order of Operations:** I need to make certain this change won't introduce any unforeseen issues.
* **Data Integrity:** Does the unlock create a window for corruption if done as described? I need to think this through.
* **Optimization:** Perhaps there is an improved method of accomplishing the same results.
I'm confident I can identify the specific improvements needed.
|
| 104/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode: } else {
create = false;
result =
qp_broker_attach(entry, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent);
}
mutex_unlock(&qp_broker_list.mutex);
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
return result;
} NewCode: } else {
create = false;
result =
qp_broker_attach(entry, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent,
&do_notify, ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
if (out_ctx)
vmci_ctx_put(out_ctx);
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
return result;
} SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 105/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 26463
output: 220
thoughts: 377
Thoughts: **Analyzing the Broker Handle Flow**
Okay, let's step through this. I was initially concerned about how the `handle` is used in `qp_broker_alloc` and subsequently passed to `qp_notify_peer`. Specifically, I was thinking: if the initial `handle` is `VMCI_INVALID_ID` and gets allocated within `qp_broker_create`, could the `handle.resource` field, used in `qp_notify_peer`, be incorrect?
But, let's back up and trace the control flow. We know `qp_broker_attach` is only called if the `entry` is found, implying the `handle.resource` was *not* `VMCI_INVALID_ID` to begin with. Then, I remember `qp_broker_attach` uses `entry->qp.handle`. So the handle that's being used inside of `qp_broker_attach` is the one assigned to the entry. Now, let's re-examine `qp_broker_alloc` closely.
Looking at the code block again:
```c
if (handle.resource != VMCI_INVALID_ID)
entry = qp_broker_handle_to_entry(handle);
if (!entry) {
create = true;
result =
qp_broker_create(handle, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent);
} else {
create = false;
result =
qp_broker_attach(entry, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent,
&do_notify, ¬ify_peer_id, &out_ctx);
}
```
Okay, the logic confirms it. If `entry` *is* found (meaning `handle.resource != VMCI_INVALID_ID`), then the passed `handle` must be valid, and it has to be equal to `entry->qp.handle`. Therefore, passing that `handle` to `qp_notify_peer` is, in fact, the correct thing to do. So my initial concern was unfounded. With that out of the way, I can now focus on the modifications required in `vmci_qp_broker_detach`.
|
| 106/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode:int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
{
struct qp_broker_entry *entry;
const u32 context_id = vmci_ctx_get_id(context);
u32 peer_id;
bool is_local = false;
int result; NewCode:int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
{
struct qp_broker_entry *entry;
const u32 context_id = vmci_ctx_get_id(context);
u32 peer_id;
bool is_local = false;
int result;
bool do_notify = false; SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 107/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 27598
output: 729
thoughts: 22
Thoughts: Okay, here's my summary, tailored as if I'm thinking it:
**Focusing on VMCI Queue Pair Detachment**
Alright, let's get down to brass tacks. I'm taking a look at this `vmci_qp_broker_detach` function, specifically that `qp_notify_peer` section. I need to make some adjustments there. I'm assuming there's some interaction happening with the peer queue pair during detachment, probably to signal that the connection is closing down cleanly or to handle some final state transition. I've got to ensure the logic in that part is sound, considering the overall detachment process. There might be some tricky race conditions or synchronization issues to address here, depending on how this notification is handled and what the peer is doing at the same time. The goal is a clean, reliable, and thread-safe detachment. Time to dig in!
|
| 108/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode: if (entry->qp.ref_count == 0) {
qp_list_remove_entry(&qp_broker_list, &entry->qp);
if (is_local)
kfree(entry->local_mem);
qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
/* Unlink from resource hash table and free callback */
vmci_resource_remove(&entry->resource);
kfree(entry);
vmci_ctx_qp_destroy(context, handle);
} else {
qp_notify_peer(false, handle, context_id, peer_id);
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
} else {
entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
}
if (!is_local)
vmci_ctx_qp_destroy(context, handle);
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
return result;
} NewCode: if (entry->qp.ref_count == 0) {
qp_list_remove_entry(&qp_broker_list, &entry->qp);
if (is_local)
kfree(entry->local_mem);
qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
/* Unlink from resource hash table and free callback */
vmci_resource_remove(&entry->resource);
kfree(entry);
vmci_ctx_qp_destroy(context, handle);
} else {
do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
} else {
entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
}
if (!is_local)
vmci_ctx_qp_destroy(context, handle);
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
} SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 109/4 |
2026/05/09 22:15 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 28545
output: 249
thoughts: 16
Thoughts: Okay, here's my take on those thoughts, tailored for an expert audience, and delivered as a first-person summary:
**Reflecting on `vmci_qp_broker_set_page_store` Modification**
Alright, so the task at hand is crystal clear: I need to delve into the `vmci_qp_broker_set_page_store` function and make some modifications. The specifics of *what* those modifications are, I'll need to determine based on the underlying requirement. However, the function itself is the focal point. This is core infrastructure and has the potential to impact performance and stability. I'll need to carefully consider any changes to ensure they're backwards compatible and do not introduce any subtle regressions. My approach, as always, is to dissect the code, identify the purpose of the existing implementation, pinpoint the potential impact of my changes, and implement a robust set of unit and integration tests. The page store itself is crucial for message handling, so any performance hit is something I want to avoid. The concurrency aspects are something to consider as well. Any changes that introduce new locking or synchronization primitives need to be thoroughly analyzed. In addition, I will verify the function's interaction with the underlying VMCI messaging layer and its integration with other parts of the system. I will take advantage of existing VMCI unit tests, and extend them to cover my new case.
|
| 110/4 |
2026/05/09 22:15 |
tool |
codeeditor |
0m
Args: map[CurrentCode:int vmci_qp_broker_set_page_store(struct vmci_handle handle,
u64 produce_uva,
u64 consume_uva,
struct vmci_ctx *context)
{
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context); NewCode:int vmci_qp_broker_set_page_store(struct vmci_handle handle,
u64 produce_uva,
u64 consume_uva,
struct vmci_ctx *context)
{
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context);
bool do_notify = false;
u32 notify_peer_id; SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 111/4 |
2026/05/09 22:15 |
llm |
patch-generator |
1m
Model:
Tokens:
input: 29106
output: 398
thoughts: 26
Thoughts: Okay, here's my take on those thoughts, tailored for an expert audience and presented in the first person:
**Modifying `vmci_qp_broker_set_page_store`**
Alright, let's dive into this. The task at hand is to modify the `qp_notify_peer` part within the `vmci_qp_broker_set_page_store` function. The implications are fairly clear, given the context. We're dealing with the notification mechanism related to page stores within the VMCI queue pair broker. This means we're likely tweaking how the broker signals a peer VM about changes, perhaps a new page store assignment or a change in the backing pages, for a queue pair. The devil is always in the details, so let's think about the specific areas that require attention.
First, I need to consider the current implementation. What's the current notification method? Is it an interrupt, a polling mechanism, or something else entirely? Understanding the existing flow is crucial to avoid introducing regressions or unexpected behavior. What are the dependencies? Are there other parts of the system that rely on this notification? I'll need to trace the code path back and forth to ensure any change is properly integrated.
Second, the motivation for the modification needs to be clear. Are we improving performance? Reducing overhead? Addressing a specific bug? Or is this part of a larger, architectural change? This will influence the design decisions. If it's performance-related, I'll be looking closely at any potential locking contention or unnecessary wake-ups. If it’s bug-related, I need to understand the root cause and the specific conditions that trigger the bug.
Third, what's the expected impact on the peer VM? A poorly designed notification mechanism can lead to resource starvation or unnecessary context switches on the peer. Therefore, I need to think carefully about the timing, granularity, and content of the notification. Does it require a lock? Are there any race conditions I need to consider? Can this be made asynchronous to reduce latency? How are errors handled? I should anticipate potential error scenarios and how they’re propagated, ensuring they're graceful. I need to keep the overhead on both sides minimal.
Finally, I'll need to carefully test any changes. A thorough testing strategy is essential. That includes unit tests for the modified function itself, integration tests to verify the interactions with the rest of the VMCI stack, and potentially system-level tests to ensure the overall system behavior remains correct. I'll need to verify that this change doesn’t introduce any regressions or performance bottlenecks. I need to be sure any modifications are backward-compatible, if possible, or have a clear migration strategy.
|
| 112/4 |
2026/05/09 22:16 |
tool |
codeeditor |
0m
Args: map[CurrentCode: if (entry->state == VMCIQPB_ATTACHED_MEM) {
result =
qp_notify_peer(true, handle, context_id, entry->create_id);
if (result < VMCI_SUCCESS) {
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
entry->create_id, entry->qp.handle.context,
entry->qp.handle.resource);
}
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
return result;
} NewCode: if (entry->state == VMCIQPB_ATTACHED_MEM) {
do_notify = true;
notify_peer_id = entry->create_id;
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS) {
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
}
return result;
} SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
Results:
|
| 113/4 |
2026/05/09 22:16 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 30101
output: 60
thoughts: 20
Thoughts: Okay, here's my summary, framed as my internal thought process:
**Investigating `qp_notify_peer` Calls**
Right, time to dig deeper. I need to make sure I've got the full picture here regarding `qp_notify_peer`. My initial look was good, but I can't just assume I've found every instance. I need to be *thorough*. So, let's see, the next logical step is to systematically search the codebase. I need to find all the other locations where `qp_notify_peer` is actually called. That's the key to understanding its complete impact and identifying any potential subtle interactions or unexpected uses. Let's get to it.
|
| 114/4 |
2026/05/09 22:17 |
tool |
codesearch-find-references |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeSnippetLines:0 Name:qp_notify_peer SourceTreePrefix:]
Results: map[References:[map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:qp_broker_attach SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:1664] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_qp_broker_detach SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:2188] map[ReferenceKind:calls ReferencingEntityKind:function ReferencingEntityName:vmci_qp_broker_set_page_store SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c SourceLine:2039]] TruncatedOutput:false]
|
| 115/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 30545
output: 20
thoughts: 92
Thoughts: Okay, here's my summary, considering my expertise:
**Debugging a Stubborn Code Search Issue**
Hold on a second... didn't I just meticulously update `qp_broker_attach`, `vmci_qp_broker_set_page_store`, and `vmci_qp_broker_detach`? I'm absolutely certain I addressed those references. But the code search tool is *still* pointing to the old line numbers! Damn. Of course. It's probably using the cached, original file content for the search index. That makes perfect sense. No wonder I was pulling my hair out for a minute there.
Alright, that explains *that*. Now, let's refocus and make sure I haven't missed any other potential thread safety violations related to `vmci_ctx_put` and that damn `qp_broker_list.mutex`. Gotta double-check the entire codebase for similar scenarios. One misstep and you're in for a world of pain down the line.
|
| 116/4 |
2026/05/09 22:17 |
tool |
grepper |
0m
Args: map[Expression:vmci_ctx_put]
Results: map[Output:drivers/misc/vmw_vmci/vmci_context.c=188=void vmci_ctx_destroy(struct vmci_ctx *context)
--
drivers/misc/vmw_vmci/vmci_context.c-194-
drivers/misc/vmw_vmci/vmci_context.c:195: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-196-}
--
drivers/misc/vmw_vmci/vmci_context.c=276=int vmci_ctx_enqueue_datagram(u32 cid, struct vmci_datagram *dg)
--
drivers/misc/vmw_vmci/vmci_context.c-299- pr_warn("Failed to allocate memory for datagram\n");
drivers/misc/vmw_vmci/vmci_context.c:300: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-301- return VMCI_ERROR_NO_MEM;
--
drivers/misc/vmw_vmci/vmci_context.c-327- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:328: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-329- kfree(dq_entry);
--
drivers/misc/vmw_vmci/vmci_context.c-339- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:340: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-341-
--
drivers/misc/vmw_vmci/vmci_context.c=404=static void ctx_free_ctx(struct kref *kref)
--
drivers/misc/vmw_vmci/vmci_context.c-474- */
drivers/misc/vmw_vmci/vmci_context.c:475:void vmci_ctx_put(struct vmci_ctx *context)
drivers/misc/vmw_vmci/vmci_context.c-476-{
--
drivers/misc/vmw_vmci/vmci_context.c=578=int vmci_ctx_add_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-636- out:
drivers/misc/vmw_vmci/vmci_context.c:637: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-638- return result;
--
drivers/misc/vmw_vmci/vmci_context.c=645=int vmci_ctx_remove_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-671-
drivers/misc/vmw_vmci/vmci_context.c:672: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-673-
--
drivers/misc/vmw_vmci/vmci_context.c=744=int vmci_ctx_get_chkpt_state(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-784- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:785: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-786-
--
drivers/misc/vmw_vmci/vmci_context.c=837=int vmci_ctx_rcv_notifications_get(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-860- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:861: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-862-
--
drivers/misc/vmw_vmci/vmci_context.c=872=void vmci_ctx_rcv_notifications_release(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-907- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:908: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-909-
--
drivers/misc/vmw_vmci/vmci_context.c=921=int vmci_ctx_dbell_create(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-940- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:941: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-942-
--
drivers/misc/vmw_vmci/vmci_context.c=950=int vmci_ctx_dbell_destroy(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-967-
drivers/misc/vmw_vmci/vmci_context.c:968: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-969-
--
drivers/misc/vmw_vmci/vmci_context.c=984=int vmci_ctx_notify_dbell(u32 src_cid,
--
drivers/misc/vmw_vmci/vmci_context.c-1056- out:
drivers/misc/vmw_vmci/vmci_context.c:1057: vmci_ctx_put(dst_context);
drivers/misc/vmw_vmci/vmci_context.c-1058-
--
drivers/misc/vmw_vmci/vmci_context.c=1122=u32 vmci_context_get_priv_flags(u32 context_id)
--
drivers/misc/vmw_vmci/vmci_context.c-1132- flags = context->priv_flags;
drivers/misc/vmw_vmci/vmci_context.c:1133: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1134- return flags;
--
drivers/misc/vmw_vmci/vmci_context.c=1147=bool vmci_is_context_owner(u32 context_id, kuid_t uid)
--
drivers/misc/vmw_vmci/vmci_context.c-1155- is_owner = uid_eq(context->cred->uid, uid);
drivers/misc/vmw_vmci/vmci_context.c:1156: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1157- }
--
drivers/misc/vmw_vmci/vmci_context.h=135=struct vmci_ctx *vmci_ctx_get(u32 cid);
drivers/misc/vmw_vmci/vmci_context.h:136:void vmci_ctx_put(struct vmci_ctx *context);
drivers/misc/vmw_vmci/vmci_context.h-137-bool vmci_ctx_exists(u32 cid);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1511=static int qp_broker_attach(struct qp_broker_entry *entry,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1587- supports_host_qp = vmci_ctx_supports_host_qp(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c:1588: vmci_ctx_put(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1589-
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1770=static int qp_alloc_host_work(struct vmci_handle *handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1819- }
drivers/misc/vmw_vmci/vmci_queue_pair.c:1820: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1821- return result;
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1862=static int qp_detatch_host_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1870-
drivers/misc/vmw_vmci/vmci_queue_pair.c:1871: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1872- return result;
]
|
| 117/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 33332
output: 19
thoughts: 92
Thoughts: Okay, let me think this through.
**Analyzing VMCI Queue Pair Locking**
Right, so I've been focusing on `vmci_queue_pair.c` and specifically `vmci_ctx_put` called while holding a lock. I'm pretty sure I've already squashed the bug in `qp_broker_attach`, that was a classic race condition.
But hold on a second… I need to be *thorough*. Just because I fixed one instance doesn’t mean there aren't others. I need to make *absolutely sure* there aren’t other places where `qp_notify_peer` is called while still under the protection of `qp_broker_list.mutex`. Let's cast a wider net. I'm going to revisit `qp_broker_create` and other functions related to the broker functionality. Gotta be methodical about this.
|
| 118/4 |
2026/05/09 22:17 |
tool |
grepper |
0m
Args: map[Expression:qp_notify_peer]
Results: map[Output:drivers/misc/vmw_vmci/vmci_queue_pair.c=838=qp_broker_handle_to_entry(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-851- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:852:static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
drivers/misc/vmw_vmci/vmci_queue_pair.c-853-{
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1023=static int qp_detatch_guest_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1040- if (entry->qp.ref_count > 1) {
drivers/misc/vmw_vmci/vmci_queue_pair.c:1041: result = qp_notify_peer_local(false, handle);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1042- /*
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1093=static int qp_alloc_guest_work(struct vmci_handle *handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1140- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:1141: result = qp_notify_peer_local(true, *handle);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1142- if (result < VMCI_SUCCESS)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1282=static int qp_broker_create(struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1450- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:1451:static int qp_notify_peer(bool attach,
drivers/misc/vmw_vmci/vmci_queue_pair.c-1452- struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1511=static int qp_broker_attach(struct qp_broker_entry *entry,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1663- result =
drivers/misc/vmw_vmci/vmci_queue_pair.c:1664: qp_notify_peer(true, entry->qp.handle, context_id,
drivers/misc/vmw_vmci/vmci_queue_pair.c-1665- entry->create_id);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1963=int vmci_qp_broker_set_page_store(struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-2038- result =
drivers/misc/vmw_vmci/vmci_queue_pair.c:2039: qp_notify_peer(true, handle, context_id, entry->create_id);
drivers/misc/vmw_vmci/vmci_queue_pair.c-2040- if (result < VMCI_SUCCESS) {
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=2082=int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-2187- } else {
drivers/misc/vmw_vmci/vmci_queue_pair.c:2188: qp_notify_peer(false, handle, context_id, peer_id);
drivers/misc/vmw_vmci/vmci_queue_pair.c-2189- if (context_id == VMCI_HOST_CONTEXT_ID &&
]
|
| 119/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 34713
output: 54
thoughts: 61
Thoughts: **Investigating Peer Notification in Qlogic Code**
Okay, so I'm digging into this Qlogic code and immediately a question pops up. I see `qp_notify_peer_local` is called in both `qp_detatch_guest_work` and `qp_alloc_guest_work`. That's interesting, and it makes me wonder: does this function, `qp_notify_peer_local`, acquire the `qp_broker_list.mutex`? That's the critical question here, isn't it? Gotta make sure we're handling our locking correctly, especially around shared resources like that broker list. Let me dive into the code for `qp_notify_peer_local` and confirm. Let's see what's actually going on in there.
|
| 120/4 |
2026/05/09 22:17 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_notify_peer_local]
Results: map[SourceCode: 848: /*
849: * Dispatches a queue pair event message directly into the local event
850: * queue.
851: */
852: static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
853: {
854: u32 context_id = vmci_get_context_id();
855: struct vmci_event_qp ev;
856:
857: memset(&ev, 0, sizeof(ev));
858: ev.msg.hdr.dst = vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
859: ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
860: VMCI_CONTEXT_RESOURCE_ID);
861: ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
862: ev.msg.event_data.event =
863: attach ? VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
864: ev.payload.peer_id = context_id;
865: ev.payload.handle = handle;
866:
867: return vmci_event_dispatch(&ev.msg.hdr);
868: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 121/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 35418
output: 55
thoughts: 104
Thoughts: Okay, let's break this down.
**Investigating Potential Data Race in VMCI Queue Pair Notification**
Right, so I'm digging into this `qp_notify_peer_local` function. Something immediately strikes me: it doesn't appear to be grabbing the `qp_broker_list.mutex`. That's unusual, and potentially problematic. It directly calls `vmci_event_dispatch`, which immediately makes me think that the data structure may not be protected. I need to understand the control flow here, because that's where any race conditions would come from.
Hmm, wait a second. Going back a step, `qp_notify_peer` itself is calling `vmci_datagram_dispatch`. *That* calls `dg_dispatch_as_host`, which in turn calls `vmci_ctx_enqueue_datagram`. Then, finally, we have `vmci_ctx_put`. OK, this is making more sense. I need to trace this control flow. The lack of mutex acquisition in the `qp_notify_peer_local` and potential interaction of the intermediate functions with shared data could be a race condition.
Now, let's take a look at the changes in `vmci_qp_broker_detach`. I need to ensure that whatever is happening during detach is handled correctly, given that `qp_notify_peer_local` is calling those other functions. Detaching might be interacting with the critical sections, especially if there's a disconnect or shutdown scenario. I have to look carefully at the lock acquisitions and releases in relation to the event dispatching. This warrants some serious scrutiny.
|
| 122/4 |
2026/05/09 22:17 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:vmci_qp_broker_detach]
Results: map[SourceCode:2064: /*
2065: * The main entry point for detaching from a queue pair registered with the
2066: * queue pair broker. If more than one endpoint is attached to the queue
2067: * pair, the first endpoint will mainly decrement a reference count and
2068: * generate a notification to its peer. The last endpoint will clean up
2069: * the queue pair state registered with the broker.
2070: *
2071: * When a guest endpoint detaches, it will unmap and unregister the guest
2072: * memory backing the queue pair. If the host is still attached, it will
2073: * no longer be able to access the queue pair content.
2074: *
2075: * If the queue pair is already in a state where there is no memory
2076: * registered for the queue pair (any *_NO_MEM state), it will transition to
2077: * the VMCIQPB_SHUTDOWN_NO_MEM state. This will also happen, if a guest
2078: * endpoint is the first of two endpoints to detach. If the host endpoint is
2079: * the first out of two to detach, the queue pair will move to the
2080: * VMCIQPB_SHUTDOWN_MEM state.
2081: */
2082: int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
2083: {
2084: struct qp_broker_entry *entry;
2085: const u32 context_id = vmci_ctx_get_id(context);
2086: u32 peer_id;
2087: bool is_local = false;
2088: int result;
2089:
2090: if (vmci_handle_is_invalid(handle) || !context ||
2091: context_id == VMCI_INVALID_ID) {
2092: return VMCI_ERROR_INVALID_ARGS;
2093: }
2094:
2095: mutex_lock(&qp_broker_list.mutex);
2096:
2097: if (!vmci_ctx_qp_exists(context, handle)) {
2098: pr_devel("Context (ID=0x%x) not attached to queue pair (handle=0x%x:0x%x)\n",
2099: context_id, handle.context, handle.resource);
2100: result = VMCI_ERROR_NOT_FOUND;
2101: goto out;
2102: }
2103:
2104: entry = qp_broker_handle_to_entry(handle);
2105: if (!entry) {
2106: pr_devel("Context (ID=0x%x) reports being attached to queue pair(handle=0x%x:0x%x) that isn't present in broker\n",
2107: context_id, handle.context, handle.resource);
2108: result = VMCI_ERROR_NOT_FOUND;
2109: goto out;
2110: }
2111:
2112: if (context_id != entry->create_id && context_id != entry->attach_id) {
2113: result = VMCI_ERROR_QUEUEPAIR_NOTATTACHED;
2114: goto out;
2115: }
2116:
2117: if (context_id == entry->create_id) {
2118: peer_id = entry->attach_id;
2119: entry->create_id = VMCI_INVALID_ID;
2120: } else {
2121: peer_id = entry->create_id;
2122: entry->attach_id = VMCI_INVALID_ID;
2123: }
2124: entry->qp.ref_count--;
2125:
2126: is_local = entry->qp.flags & VMCI_QPFLAG_LOCAL;
2127:
2128: if (context_id != VMCI_HOST_CONTEXT_ID) {
2129: bool headers_mapped;
2130:
2131: /*
2132: * Pre NOVMVM vmx'en may detach from a queue pair
2133: * before setting the page store, and in that case
2134: * there is no user memory to detach from. Also, more
2135: * recent VMX'en may detach from a queue pair in the
2136: * quiesced state.
2137: */
2138:
2139: qp_acquire_queue_mutex(entry->produce_q);
2140: headers_mapped = entry->produce_q->q_header ||
2141: entry->consume_q->q_header;
2142: if (QPBROKERSTATE_HAS_MEM(entry)) {
2143: result =
2144: qp_host_unmap_queues(INVALID_VMCI_GUEST_MEM_ID,
2145: entry->produce_q,
2146: entry->consume_q);
2147: if (result < VMCI_SUCCESS)
2148: pr_warn("Failed to unmap queue headers for queue pair (handle=0x%x:0x%x,result=%d)\n",
2149: handle.context, handle.resource,
2150: result);
2151:
2152: qp_host_unregister_user_memory(entry->produce_q,
2153: entry->consume_q);
2154:
2155: }
2156:
2157: if (!headers_mapped)
2158: qp_reset_saved_headers(entry);
2159:
2160: qp_release_queue_mutex(entry->produce_q);
2161:
2162: if (!headers_mapped && entry->wakeup_cb)
2163: entry->wakeup_cb(entry->client_data);
2164:
2165: } else {
2166: if (entry->wakeup_cb) {
2167: entry->wakeup_cb = NULL;
2168: entry->client_data = NULL;
2169: }
2170: }
2171:
2172: if (entry->qp.ref_count == 0) {
2173: qp_list_remove_entry(&qp_broker_list, &entry->qp);
2174:
2175: if (is_local)
2176: kfree(entry->local_mem);
2177:
2178: qp_cleanup_queue_mutex(entry->produce_q, entry->consume_q);
2179: qp_host_free_queue(entry->produce_q, entry->qp.produce_size);
2180: qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
2181: /* Unlink from resource hash table and free callback */
2182: vmci_resource_remove(&entry->resource);
2183:
2184: kfree(entry);
2185:
2186: vmci_ctx_qp_destroy(context, handle);
2187: } else {
2188: qp_notify_peer(false, handle, context_id, peer_id);
2189: if (context_id == VMCI_HOST_CONTEXT_ID &&
2190: QPBROKERSTATE_HAS_MEM(entry)) {
2191: entry->state = VMCIQPB_SHUTDOWN_MEM;
2192: } else {
2193: entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
2194: }
2195:
2196: if (!is_local)
2197: vmci_ctx_qp_destroy(context, handle);
2198:
2199: }
2200: result = VMCI_SUCCESS;
2201: out:
2202: mutex_unlock(&qp_broker_list.mutex);
2203: return result;
2204: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 123/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 38201
output: 22
thoughts: 33
Thoughts: Okay, let me think.
**Checking My Work: vmci_qp_broker_detach**
Hmm, I could swear I already went over `vmci_qp_broker_detach`. Let's just double check the current version of the code for that function. No need to re-tread ground I've already covered, even if it was a few builds ago. It's best to be thorough, especially with the potential for those subtle edge-case issues that always seem to pop up. Let's get right to it and see what we have.
|
| 124/4 |
2026/05/09 22:17 |
tool |
grepper |
0m
Args: map[Expression:vmci_qp_broker_detach]
Results: map[Output:drivers/misc/vmw_vmci/vmci_context.c=404=static void ctx_free_ctx(struct kref *kref)
--
drivers/misc/vmw_vmci/vmci_context.c-423- while (!vmci_handle_is_equal(temp_handle, VMCI_INVALID_HANDLE)) {
drivers/misc/vmw_vmci/vmci_context.c:424: if (vmci_qp_broker_detach(temp_handle,
drivers/misc/vmw_vmci/vmci_context.c-425- context) < VMCI_SUCCESS) {
drivers/misc/vmw_vmci/vmci_context.c-426- /*
drivers/misc/vmw_vmci/vmci_context.c:427: * When vmci_qp_broker_detach() succeeds it
drivers/misc/vmw_vmci/vmci_context.c-428- * removes the handle from the array. If
--
drivers/misc/vmw_vmci/vmci_host.c=447=static int vmci_host_do_alloc_queuepair(struct vmci_host_dev *vmci_host_dev,
--
drivers/misc/vmw_vmci/vmci_host.c-506- if (vmci_status >= VMCI_SUCCESS) {
drivers/misc/vmw_vmci/vmci_host.c:507: vmci_status = vmci_qp_broker_detach(handle,
drivers/misc/vmw_vmci/vmci_host.c-508- vmci_host_dev->context);
--
drivers/misc/vmw_vmci/vmci_host.c=635=static int vmci_host_do_qp_detach(struct vmci_host_dev *vmci_host_dev,
--
drivers/misc/vmw_vmci/vmci_host.c-650-
drivers/misc/vmw_vmci/vmci_host.c:651: result = vmci_qp_broker_detach(detach_info.handle,
drivers/misc/vmw_vmci/vmci_host.c-652- vmci_host_dev->context);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1862=static int qp_detatch_host_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1868-
drivers/misc/vmw_vmci/vmci_queue_pair.c:1869: result = vmci_qp_broker_detach(handle, context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1870-
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=2058=static void qp_reset_saved_headers(struct qp_broker_entry *entry)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-2081- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:2082:int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
drivers/misc/vmw_vmci/vmci_queue_pair.c-2083-{
--
drivers/misc/vmw_vmci/vmci_queue_pair.h=147=int vmci_qp_broker_set_page_store(struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.h-149- struct vmci_ctx *context);
drivers/misc/vmw_vmci/vmci_queue_pair.h:150:int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context);
drivers/misc/vmw_vmci/vmci_queue_pair.h-151-
]
|
| 125/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 39394
output: 17
thoughts: 19
Thoughts: Okay, let's dive into this. Here's how I'd approach summarizing the "thoughts," assuming I'm an expert in this field:
**Verifying `vmci_queue_pair.c` Changes**
Alright, time to get a good look at what's been done to `vmci_queue_pair.c`. My immediate goal is to confirm that any modifications are sound and don't introduce any regressions or unexpected behaviors. I need to make sure the changes align with the overall VMCI architecture and the intended purpose of queue pair management.
First, I'll need to jog my memory and quickly re-familiarize myself with the specific changes. What exactly was altered? Was it related to resource allocation, interrupt handling, data transfer semantics, or perhaps synchronization primitives? I need to know the 'what' before I can even begin evaluating the 'how' and 'why'.
Then, I'll systematically review the code, focusing on areas where the modifications are concentrated. I'll mentally step through the code execution paths, simulating different scenarios and edge cases. I'll pay close attention to potential race conditions, memory leaks, and any deviations from the established coding conventions or design principles. A meticulous examination is key.
Are there any new function calls introduced? If so, I need to understand their purpose, impact, and interactions with existing VMCI components. Did the modifications require any changes to data structures? If so, I'll need to check the impact of those structural changes on existing functions that use those structures.
I'll also consider the potential impact on performance. Were any optimizations attempted? Did the changes inadvertently introduce bottlenecks or overhead? If so, I'll need to evaluate whether the trade-offs are acceptable given the benefits gained. This means mentally benchmarking the code.
Finally, I'll check that the changes are adequately documented and that the commit messages clearly explain the rationale behind the modifications. Proper documentation is crucial for maintainability and future troubleshooting. If there are unit tests, I'll review them to make sure they're robust and cover the new functionality. I may even need to write additional tests to ensure comprehensive coverage. In short, let's make sure it's all rock solid.
|
| 126/4 |
2026/05/09 22:17 |
tool |
grepper |
0m
Args: map[Expression:do_notify]
Results: map[Output:
Full output is too long, showing 500 out of 726 lines.
Use more precise expression if possible.
[arch/arc/include/asm/entry.h=151=extern void do_signal(struct pt_regs *);
arch/arc/include/asm/entry.h:152:extern void do_notify_resume(struct pt_regs *);
arch/arc/include/asm/entry.h-153-extern int do_privilege_fault(unsigned long, struct pt_regs *);
--
arch/arc/kernel/entry.S=262=resume_user_mode_begin:
--
arch/arc/kernel/entry.S-282- ; --- (Slow Path #2) pending signal ---
arch/arc/kernel/entry.S:283: mov r0, sp ; pt_regs for arg to do_signal()/do_notify_resume()
arch/arc/kernel/entry.S-284-
--
arch/arc/kernel/entry.S-315- btst r9, TIF_NOTIFY_RESUME
arch/arc/kernel/entry.S:316: blnz @do_notify_resume
arch/arc/kernel/entry.S-317- b resume_user_mode_begin ; unconditionally back to U mode ret chks
--
arch/arc/kernel/signal.c=403=void do_signal(struct pt_regs *regs)
--
arch/arc/kernel/signal.c-435-
arch/arc/kernel/signal.c:436:void do_notify_resume(struct pt_regs *regs)
arch/arc/kernel/signal.c-437-{
--
arch/arm64/kernel/fpsimd.c=1772=void fpsimd_restore_current_state(void)
--
arch/arm64/kernel/fpsimd.c-1784- * process, ensuring this has TIF_FOREIGN_FPSTATE set and
arch/arm64/kernel/fpsimd.c:1785: * do_notify_resume() will call fpsimd_restore_current_state() to
arch/arm64/kernel/fpsimd.c-1786- * install the user FP/SIMD context.
--
arch/arm64/kernel/fpsimd.c-1789- * TIF_FOREIGN_FPSTATE prior to the first return to userspace, and
arch/arm64/kernel/fpsimd.c:1790: * we must clear TIF_FOREIGN_FPSTATE to avoid do_notify_resume()
arch/arm64/kernel/fpsimd.c-1791- * looping forever calling fpsimd_restore_current_state().
--
arch/arm64/kernel/syscall.c=62=static void el0_svc_common(struct pt_regs *regs, int scno, int sc_nr,
--
arch/arm64/kernel/syscall.c-90- * Process the asynchronous tag check fault before the actual
arch/arm64/kernel/syscall.c:91: * syscall. do_notify_resume() will send a signal to userspace
arch/arm64/kernel/syscall.c-92- * before the syscall is restarted.
--
arch/csky/include/asm/traps.h=53=asmlinkage void trap_c(struct pt_regs *regs);
arch/csky/include/asm/traps.h-54-
arch/csky/include/asm/traps.h:55:asmlinkage void do_notify_resume(struct pt_regs *regs,
arch/csky/include/asm/traps.h-56- unsigned long thread_info_flags);
--
arch/csky/kernel/entry.S=178=exit_work:
--
arch/csky/kernel/entry.S-187- mov a1, r10
arch/csky/kernel/entry.S:188: jmpi do_notify_resume
arch/csky/kernel/entry.S-189-
--
arch/csky/kernel/signal.c=213=static void do_signal(struct pt_regs *regs)
--
arch/csky/kernel/signal.c-254- */
arch/csky/kernel/signal.c:255:asmlinkage void do_notify_resume(struct pt_regs *regs,
arch/csky/kernel/signal.c-256- unsigned long thread_info_flags)
--
arch/m68k/68000/entry.S=117=Lsignal_return:
--
arch/m68k/68000/entry.S-120- pea %sp@(SWITCH_STACK_SIZE)
arch/m68k/68000/entry.S:121: bsrw do_notify_resume
arch/m68k/68000/entry.S-122- addql #4,%sp
--
arch/m68k/coldfire/entry.S=146=Lsignal_return:
--
arch/m68k/coldfire/entry.S-149- pea %sp@(SWITCH_STACK_SIZE)
arch/m68k/coldfire/entry.S:150: jsr do_notify_resume
arch/m68k/coldfire/entry.S-151- addql #4,%sp
--
arch/m68k/kernel/entry.S=265=do_signal_return:
--
arch/m68k/kernel/entry.S-269- pea %sp@(SWITCH_STACK_SIZE)
arch/m68k/kernel/entry.S:270: bsrl do_notify_resume
arch/m68k/kernel/entry.S-271- addql #4,%sp
--
arch/m68k/kernel/signal.c=1093=static void do_signal(struct pt_regs *regs)
--
arch/m68k/kernel/signal.c-1113-
arch/m68k/kernel/signal.c:1114:asmlinkage void do_notify_resume(struct pt_regs *regs)
arch/m68k/kernel/signal.c-1115-{
--
arch/m68k/kernel/signal.h-4-
arch/m68k/kernel/signal.h:5:asmlinkage void do_notify_resume(struct pt_regs *regs);
arch/m68k/kernel/signal.h-6-asmlinkage void *do_sigreturn(struct pt_regs *regs, struct switch_stack *sw);
--
arch/microblaze/include/asm/entry.h=29=DECLARE_PER_CPU(unsigned int, CURRENT_SAVE); /* Saved current pointer */
arch/microblaze/include/asm/entry.h-30-
arch/microblaze/include/asm/entry.h:31:extern asmlinkage void do_notify_resume(struct pt_regs *regs, int in_syscall);
arch/microblaze/include/asm/entry.h-32-# endif /* __ASSEMBLER__ */
--
arch/microblaze/kernel/entry.S=434=C_ENTRY(ret_from_trap):
--
arch/microblaze/kernel/entry.S-469- addik r5, r1, 0; /* Arg 1: struct pt_regs *regs */
arch/microblaze/kernel/entry.S:470: bralid r15, do_notify_resume; /* Handle any signals */
arch/microblaze/kernel/entry.S-471- add r6, r30, r0; /* Arg 2: int in_syscall */
--
arch/microblaze/kernel/entry.S=621=C_ENTRY(ret_from_exc):
--
arch/microblaze/kernel/entry.S-652- * the normal entry sequence, so that it may be safely restored
arch/microblaze/kernel/entry.S:653: * (in a possibly modified form) after do_notify_resume returns. */
arch/microblaze/kernel/entry.S-654- addik r5, r1, 0; /* Arg 1: struct pt_regs *regs */
arch/microblaze/kernel/entry.S:655: bralid r15, do_notify_resume; /* Handle any signals */
arch/microblaze/kernel/entry.S-656- addi r6, r0, 0; /* Arg 2: int in_syscall */
--
arch/microblaze/kernel/entry.S=736=ret_from_irq:
--
arch/microblaze/kernel/entry.S-753- addik r5, r1, 0; /* Arg 1: struct pt_regs *regs */
arch/microblaze/kernel/entry.S:754: bralid r15, do_notify_resume; /* Handle any signals */
arch/microblaze/kernel/entry.S-755- addi r6, r0, 0; /* Arg 2: int in_syscall */
--
arch/microblaze/kernel/entry.S=1014=dbtrap_call: /* Return point for kernel/user entry + 8 because of rtsd r15, 8 */
--
arch/microblaze/kernel/entry.S-1039- addik r5, r1, 0; /* Arg 1: struct pt_regs *regs */
arch/microblaze/kernel/entry.S:1040: bralid r15, do_notify_resume; /* Handle any signals */
arch/microblaze/kernel/entry.S-1041- addi r6, r0, 0; /* Arg 2: int in_syscall */
--
arch/microblaze/kernel/signal.c=280=static void do_signal(struct pt_regs *regs, int in_syscall)
--
arch/microblaze/kernel/signal.c-307-
arch/microblaze/kernel/signal.c:308:asmlinkage void do_notify_resume(struct pt_regs *regs, int in_syscall)
arch/microblaze/kernel/signal.c-309-{
--
arch/mips/include/asm/signal.h=33=extern int protected_restore_fp_context(void __user *sc);
arch/mips/include/asm/signal.h:34:void do_notify_resume(struct pt_regs *regs, void *unused, __u32 thread_info_flags);
arch/mips/include/asm/signal.h-35-
--
arch/mips/kernel/entry.S=138=work_notifysig: # deal with pending signals and
--
arch/mips/kernel/entry.S-141- li a1, 0
arch/mips/kernel/entry.S:142: jal do_notify_resume # a2 already loaded
arch/mips/kernel/entry.S-143- j resume_userspace_check
--
arch/mips/kernel/ptrace.c=1354=asmlinkage void syscall_trace_leave(struct pt_regs *regs)
--
arch/mips/kernel/ptrace.c-1357- * We may come here right after calling schedule_user()
arch/mips/kernel/ptrace.c:1358: * or do_notify_resume(), in which case we can be in RCU
arch/mips/kernel/ptrace.c-1359- * user mode.
--
arch/mips/kernel/signal.c=864=static void do_signal(struct pt_regs *regs)
--
arch/mips/kernel/signal.c-903- */
arch/mips/kernel/signal.c:904:asmlinkage void do_notify_resume(struct pt_regs *regs, void *unused,
arch/mips/kernel/signal.c-905- __u32 thread_info_flags)
--
arch/nios2/kernel/entry.S=312=Lsignal_return:
--
arch/nios2/kernel/entry.S-316- SAVE_SWITCH_STACK
arch/nios2/kernel/entry.S:317: call do_notify_resume
arch/nios2/kernel/entry.S-318- beq r2, r0, no_work_pending
--
arch/nios2/kernel/signal.c=234=static int do_signal(struct pt_regs *regs)
--
arch/nios2/kernel/signal.c-301-
arch/nios2/kernel/signal.c:302:asmlinkage int do_notify_resume(struct pt_regs *regs)
arch/nios2/kernel/signal.c-303-{
--
arch/parisc/include/asm/processor.h=307=extern void sys_rt_sigreturn(struct pt_regs *, int);
arch/parisc/include/asm/processor.h:308:extern void do_notify_resume(struct pt_regs *, long);
arch/parisc/include/asm/processor.h-309-extern long do_syscall_trace_enter(struct pt_regs *);
--
arch/parisc/kernel/entry.S=851=ENTRY(intr_return)
--
arch/parisc/kernel/entry.S-856-
arch/parisc/kernel/entry.S:857: .import do_notify_resume,code
arch/parisc/kernel/entry.S-858-intr_check_sig:
--
arch/parisc/kernel/entry.S-887-
arch/parisc/kernel/entry.S:888: BL do_notify_resume,%r2
arch/parisc/kernel/entry.S-889- copy %r16, %r26 /* struct pt_regs *regs */
--
arch/parisc/kernel/entry.S=1745=syscall_do_signal:
--
arch/parisc/kernel/entry.S-1758-
arch/parisc/kernel/entry.S:1759: BL do_notify_resume,%r2
arch/parisc/kernel/entry.S-1760- ldi 1, %r25 /* long in_syscall = 1 */
--
arch/parisc/kernel/signal.c=548=static void do_signal(struct pt_regs *regs, long in_syscall)
--
arch/parisc/kernel/signal.c-580-
arch/parisc/kernel/signal.c:581:asmlinkage void do_notify_resume(struct pt_regs *regs, long in_syscall)
arch/parisc/kernel/signal.c-582-{
--
arch/powerpc/include/asm/signal.h=9=struct pt_regs;
arch/powerpc/include/asm/signal.h:10:void do_notify_resume(struct pt_regs *regs, unsigned long thread_info_flags);
arch/powerpc/include/asm/signal.h-11-
--
arch/powerpc/include/asm/spu.h=255=extern void notify_spus_active(void);
arch/powerpc/include/asm/spu.h:256:extern void do_notify_spus_active(void);
arch/powerpc/include/asm/spu.h-257-
--
arch/powerpc/kernel/interrupt.c=184=interrupt_exit_user_prepare_main(unsigned long ret, struct pt_regs *regs)
--
arch/powerpc/kernel/interrupt.c-201- ret |= _TIF_RESTOREALL;
arch/powerpc/kernel/interrupt.c:202: do_notify_resume(regs, ti_flags);
arch/powerpc/kernel/interrupt.c-203- }
--
arch/powerpc/kernel/signal.c=243=static void do_signal(struct task_struct *tsk)
--
arch/powerpc/kernel/signal.c-294-
arch/powerpc/kernel/signal.c:295:void do_notify_resume(struct pt_regs *regs, unsigned long thread_info_flags)
arch/powerpc/kernel/signal.c-296-{
--
arch/powerpc/platforms/cell/spufs/sched.c=167=static int node_allowed(struct spu_context *ctx, int node)
--
arch/powerpc/platforms/cell/spufs/sched.c-177-
arch/powerpc/platforms/cell/spufs/sched.c:178:void do_notify_spus_active(void)
arch/powerpc/platforms/cell/spufs/sched.c-179-{
--
arch/powerpc/platforms/cell/spufs/syscalls.c=80=struct spufs_calls spufs_calls = {
--
arch/powerpc/platforms/cell/spufs/syscalls.c-82- .spu_run = do_spu_run,
arch/powerpc/platforms/cell/spufs/syscalls.c:83: .notify_spus_active = do_notify_spus_active,
arch/powerpc/platforms/cell/spufs/syscalls.c-84- .owner = THIS_MODULE,
--
arch/powerpc/platforms/powernv/opal.c=326=EXPORT_SYMBOL_GPL(opal_message_notifier_unregister);
arch/powerpc/platforms/powernv/opal.c-327-
arch/powerpc/platforms/powernv/opal.c:328:static void opal_message_do_notify(uint32_t msg_type, void *msg)
arch/powerpc/platforms/powernv/opal.c-329-{
--
arch/powerpc/platforms/powernv/opal.c=352=static void opal_handle_message(void)
--
arch/powerpc/platforms/powernv/opal.c-375- }
arch/powerpc/platforms/powernv/opal.c:376: opal_message_do_notify(type, (void *)opal_msg);
arch/powerpc/platforms/powernv/opal.c-377-}
--
arch/sh/include/asm/syscalls_32.h=23=asmlinkage void do_syscall_trace_leave(struct pt_regs *regs);
arch/sh/include/asm/syscalls_32.h:24:asmlinkage void do_notify_resume(struct pt_regs *regs, unsigned int save_r0,
arch/sh/include/asm/syscalls_32.h-25- unsigned long thread_info_flags);
--
arch/sh/kernel/entry-common.S=147=work_resched:
--
arch/sh/kernel/entry-common.S-161-1: .long schedule
arch/sh/kernel/entry-common.S:162:2: .long do_notify_resume
arch/sh/kernel/entry-common.S-163-3: .long resume_userspace
--
arch/sh/kernel/signal_32.c=459=static void do_signal(struct pt_regs *regs, unsigned int save_r0)
--
arch/sh/kernel/signal_32.c-500-
arch/sh/kernel/signal_32.c:501:asmlinkage void do_notify_resume(struct pt_regs *regs, unsigned int save_r0,
arch/sh/kernel/signal_32.c-502- unsigned long thread_info_flags)
--
arch/sparc/kernel/entry.h=79=void timer_interrupt(int irq, struct pt_regs *regs);
arch/sparc/kernel/entry.h-80-
arch/sparc/kernel/entry.h:81:void do_notify_resume(struct pt_regs *regs,
arch/sparc/kernel/entry.h-82- unsigned long orig_i0,
--
arch/sparc/kernel/kernel.h=167=asmlinkage void do_rt_sigreturn(struct pt_regs *regs);
arch/sparc/kernel/kernel.h:168:void do_notify_resume(struct pt_regs *regs, unsigned long orig_i0,
arch/sparc/kernel/kernel.h-169- unsigned long thread_info_flags);
--
arch/sparc/kernel/rtrap_32.S=72=signal_p:
--
arch/sparc/kernel/rtrap_32.S-78- mov %l6, %o1
arch/sparc/kernel/rtrap_32.S:79: call do_notify_resume
arch/sparc/kernel/rtrap_32.S-80- add %sp, STACKFRAME_SZ, %o0 ! pt_regs ptr
--
arch/sparc/kernel/rtrap_64.S=65=__handle_signal:
--
arch/sparc/kernel/rtrap_64.S-68- mov %l0, %o2
arch/sparc/kernel/rtrap_64.S:69: call do_notify_resume
arch/sparc/kernel/rtrap_64.S-70-661: wrpr %g0, RTRAP_PSTATE, %pstate
--
arch/sparc/kernel/signal_32.c=455=static void do_signal(struct pt_regs *regs, unsigned long orig_i0)
--
arch/sparc/kernel/signal_32.c-520-
arch/sparc/kernel/signal_32.c:521:void do_notify_resume(struct pt_regs *regs, unsigned long orig_i0,
arch/sparc/kernel/signal_32.c-522- unsigned long thread_info_flags)
--
arch/sparc/kernel/signal_64.c=476=static void do_signal(struct pt_regs *regs, unsigned long orig_i0)
--
arch/sparc/kernel/signal_64.c-546-
arch/sparc/kernel/signal_64.c:547:void do_notify_resume(struct pt_regs *regs, unsigned long orig_i0, unsigned long thread_info_flags)
arch/sparc/kernel/signal_64.c-548-{
--
arch/xtensa/include/asm/processor.h=220=void init_arch(bp_tag_t *bp_start);
arch/xtensa/include/asm/processor.h:221:void do_notify_resume(struct pt_regs *regs);
arch/xtensa/include/asm/processor.h-222-
--
arch/xtensa/kernel/entry.S=481=common_exception_return:
--
arch/xtensa/kernel/entry.S-522- mov abi_arg0, a1
arch/xtensa/kernel/entry.S:523: abi_call do_notify_resume # int do_notify_resume(struct pt_regs*)
arch/xtensa/kernel/entry.S-524- j .Ltif_loop
--
arch/xtensa/kernel/signal.c=453=static void do_signal(struct pt_regs *regs)
--
arch/xtensa/kernel/signal.c-526-
arch/xtensa/kernel/signal.c:527:void do_notify_resume(struct pt_regs *regs)
arch/xtensa/kernel/signal.c-528-{
--
drivers/acpi/acpica/acinterp.h=299=acpi_status
drivers/acpi/acpica/acinterp.h:300:acpi_ex_system_do_notify_op(union acpi_operand_object *value,
drivers/acpi/acpica/acinterp.h-301- union acpi_operand_object *obj_desc);
--
drivers/md/dm-vdo/repair.c=793=static void add_slab_journal_entries(struct vdo_completion *completion)
--
drivers/md/dm-vdo/repair.c-802- vdo_prepare_completion(completion, add_slab_journal_entries,
drivers/md/dm-vdo/repair.c:803: vdo_notify_slab_journals_are_recovered,
drivers/md/dm-vdo/repair.c-804- completion->callback_thread_id, repair);
--
drivers/md/dm-vdo/repair.c-841-
drivers/md/dm-vdo/repair.c:842: vdo_notify_slab_journals_are_recovered(completion);
drivers/md/dm-vdo/repair.c-843-}
--
drivers/md/dm-vdo/repair.c=851=void vdo_replay_into_slab_journals(struct block_allocator *allocator, void *context)
--
drivers/md/dm-vdo/repair.c-861- repair->block_map_data_blocks = vdo->recovery_journal->block_map_data_blocks;
drivers/md/dm-vdo/repair.c:862: vdo_notify_slab_journals_are_recovered(completion);
drivers/md/dm-vdo/repair.c-863- return;
--
drivers/md/dm-vdo/slab-depot.c=3514=static void initiate_load(struct admin_state *state)
--
drivers/md/dm-vdo/slab-depot.c-3545-/**
drivers/md/dm-vdo/slab-depot.c:3546: * vdo_notify_slab_journals_are_recovered() - Inform a block allocator that its slab journals have
drivers/md/dm-vdo/slab-depot.c-3547- * been recovered from the recovery journal.
--
drivers/md/dm-vdo/slab-depot.c-3549- */
drivers/md/dm-vdo/slab-depot.c:3550:void vdo_notify_slab_journals_are_recovered(struct vdo_completion *completion)
drivers/md/dm-vdo/slab-depot.c-3551-{
--
drivers/md/dm-vdo/slab-depot.h=547=int __must_check vdo_release_block_reference(struct block_allocator *allocator,
--
drivers/md/dm-vdo/slab-depot.h-549-
drivers/md/dm-vdo/slab-depot.h:550:void vdo_notify_slab_journals_are_recovered(struct vdo_completion *completion);
drivers/md/dm-vdo/slab-depot.h-551-
--
drivers/misc/vmw_vmci/vmci_host.c=781=static int vmci_host_do_set_notify(struct vmci_host_dev *vmci_host_dev,
--
drivers/misc/vmw_vmci/vmci_host.c-807-
drivers/misc/vmw_vmci/vmci_host.c:808:static int vmci_host_do_notify_resource(struct vmci_host_dev *vmci_host_dev,
drivers/misc/vmw_vmci/vmci_host.c-809- const char *ioctl_name,
--
drivers/net/tun.c=3042=static long __tun_chr_ioctl(struct file *file, unsigned int cmd,
--
drivers/net/tun.c-3055- int ret;
drivers/net/tun.c:3056: bool do_notify = false;
drivers/net/tun.c-3057-
--
drivers/net/tun.c-3150- __module_get(THIS_MODULE);
drivers/net/tun.c:3151: do_notify = true;
drivers/net/tun.c-3152- }
--
drivers/net/tun.c-3155- module_put(THIS_MODULE);
drivers/net/tun.c:3156: do_notify = true;
drivers/net/tun.c-3157- }
--
drivers/net/tun.c-3170- tun->owner = owner;
drivers/net/tun.c:3171: do_notify = true;
drivers/net/tun.c-3172- netif_info(tun, drv, tun->dev, "owner set to %u\n",
--
drivers/net/tun.c-3183- tun->group = group;
drivers/net/tun.c:3184: do_notify = true;
drivers/net/tun.c-3185- netif_info(tun, drv, tun->dev, "group set to %u\n",
--
drivers/net/tun.c-3325-
drivers/net/tun.c:3326: if (do_notify)
drivers/net/tun.c-3327- netdev_state_change(tun->dev);
--
drivers/net/vxlan/vxlan_core.c=934=static void vxlan_fdb_destroy(struct vxlan_dev *vxlan, struct vxlan_fdb *f,
drivers/net/vxlan/vxlan_core.c:935: bool do_notify, bool swdev_notify)
drivers/net/vxlan/vxlan_core.c-936-{
--
drivers/net/vxlan/vxlan_core.c-941- --vxlan->addrcnt;
drivers/net/vxlan/vxlan_core.c:942: if (do_notify) {
drivers/net/vxlan/vxlan_core.c-943- if (rcu_access_pointer(f->nh))
--
drivers/scsi/isci/port.c=640=void sci_port_deactivate_phy(struct isci_port *iport, struct isci_phy *iphy,
drivers/scsi/isci/port.c:641: bool do_notify_user)
drivers/scsi/isci/port.c-642-{
--
drivers/scsi/isci/port.c-659-
drivers/scsi/isci/port.c:660: if (do_notify_user == true)
drivers/scsi/isci/port.c-661- isci_port_link_down(ihost, iphy, iport);
--
drivers/scsi/isci/port.h=224=void sci_port_deactivate_phy(
--
drivers/scsi/isci/port.h-226- struct isci_phy *iphy,
drivers/scsi/isci/port.h:227: bool do_notify_user);
drivers/scsi/isci/port.h-228-
--
drivers/usb/gadget/function/f_ecm.c=361=static struct usb_gadget_strings *ecm_strings[] = {
--
drivers/usb/gadget/function/f_ecm.c-367-
drivers/usb/gadget/function/f_ecm.c:368:static void ecm_do_notify(struct f_ecm *ecm)
drivers/usb/gadget/function/f_ecm.c-369-{
--
drivers/usb/gadget/function/f_ecm.c=424=static void ecm_notify(struct f_ecm *ecm)
--
drivers/usb/gadget/function/f_ecm.c-431- ecm->notify_state = ECM_NOTIFY_CONNECT;
drivers/usb/gadget/function/f_ecm.c:432: ecm_do_notify(ecm);
drivers/usb/gadget/function/f_ecm.c-433-}
--
drivers/usb/gadget/function/f_ecm.c=435=static void ecm_notify_complete(struct usb_ep *ep, struct usb_request *req)
--
drivers/usb/gadget/function/f_ecm.c-456- }
drivers/usb/gadget/function/f_ecm.c:457: ecm_do_notify(ecm);
drivers/usb/gadget/function/f_ecm.c-458-}
--
drivers/usb/gadget/function/f_ncm.c=520=static inline void ncm_reset_values(struct f_ncm *ncm)
--
drivers/usb/gadget/function/f_ncm.c-536- */
drivers/usb/gadget/function/f_ncm.c:537:static void ncm_do_notify(struct f_ncm *ncm)
drivers/usb/gadget/function/f_ncm.c-538-{
--
drivers/usb/gadget/function/f_ncm.c=605=static void ncm_notify(struct f_ncm *ncm)
--
drivers/usb/gadget/function/f_ncm.c-617- ncm->notify_state = NCM_NOTIFY_SPEED;
drivers/usb/gadget/function/f_ncm.c:618: ncm_do_notify(ncm);
drivers/usb/gadget/function/f_ncm.c-619-}
--
drivers/usb/gadget/function/f_ncm.c=621=static void ncm_notify_complete(struct usb_ep *ep, struct usb_request *req)
--
drivers/usb/gadget/function/f_ncm.c-644- }
drivers/usb/gadget/function/f_ncm.c:645: ncm_do_notify(ncm);
drivers/usb/gadget/function/f_ncm.c-646- spin_unlock(&ncm->lock);
--
fs/overlayfs/copy_up.c=368=static int ovl_set_size(struct ovl_fs *ofs,
--
fs/overlayfs/copy_up.c-375-
fs/overlayfs/copy_up.c:376: return ovl_do_notify_change(ofs, upperdentry, &attr);
fs/overlayfs/copy_up.c-377-}
--
fs/overlayfs/copy_up.c=379=static int ovl_set_timestamps(struct ovl_fs *ofs, struct dentry *upperdentry,
--
fs/overlayfs/copy_up.c-388-
fs/overlayfs/copy_up.c:389: return ovl_do_notify_change(ofs, upperdentry, &attr);
fs/overlayfs/copy_up.c-390-}
--
fs/overlayfs/copy_up.c=392=int ovl_set_attr(struct ovl_fs *ofs, struct dentry *upperdentry,
--
fs/overlayfs/copy_up.c-401- };
fs/overlayfs/copy_up.c:402: err = ovl_do_notify_change(ofs, upperdentry, &attr);
fs/overlayfs/copy_up.c-403- }
--
fs/overlayfs/copy_up.c-409- };
fs/overlayfs/copy_up.c:410: err = ovl_do_notify_change(ofs, upperdentry, &attr);
fs/overlayfs/copy_up.c-411- }
--
fs/overlayfs/dir.c=484=static int ovl_create_over_whiteout(struct dentry *dentry, struct inode *inode,
--
fs/overlayfs/dir.c-540- inode_lock(newdentry->d_inode);
fs/overlayfs/dir.c:541: err = ovl_do_notify_change(ofs, newdentry, &attr);
fs/overlayfs/dir.c-542- inode_unlock(newdentry->d_inode);
--
fs/overlayfs/inode.c=21=int ovl_setattr(struct mnt_idmap *idmap, struct dentry *dentry,
--
fs/overlayfs/inode.c-80- with_ovl_creds(dentry->d_sb)
fs/overlayfs/inode.c:81: err = ovl_do_notify_change(ofs, upperdentry, attr);
fs/overlayfs/inode.c-82- if (!err)
--
fs/overlayfs/overlayfs.h=188=static inline const char *ovl_xattr(struct ovl_fs *ofs, enum ovl_xattr ox)
--
fs/overlayfs/overlayfs.h-204- */
fs/overlayfs/overlayfs.h:205:static inline int ovl_do_notify_change(struct ovl_fs *ofs,
fs/overlayfs/overlayfs.h-206- struct dentry *upperdentry,
--
fs/overlayfs/super.c=311=static struct dentry *ovl_workdir_create(struct ovl_fs *ofs,
--
fs/overlayfs/super.c-378- inode_lock(work->d_inode);
fs/overlayfs/super.c:379: err = ovl_do_notify_change(ofs, work, &attr);
fs/overlayfs/super.c-380- inode_unlock(work->d_inode);
--
include/linux/pid.h=84=int pidfd_prepare(struct pid *pid, unsigned int flags, struct file **ret_file);
include/linux/pid.h:85:void do_notify_pidfd(struct task_struct *task);
include/linux/pid.h-86-
--
include/linux/sched/signal.h=340=extern int kill_pid(struct pid *pid, int sig, int priv);
include/linux/sched/signal.h:341:extern __must_check bool do_notify_parent(struct task_struct *, int);
include/linux/sched/signal.h-342-extern void __wake_up_parent(struct task_struct *p, struct task_struct *parent);
--
ipc/mqueue.c=769=static inline void set_cookie(struct sk_buff *skb, char code)
--
ipc/mqueue.c-776- */
ipc/mqueue.c:777:static void __do_notify(struct mqueue_inode_info *info)
ipc/mqueue.c-778-{
--
ipc/mqueue.c=1037=static int do_mq_timedsend(mqd_t mqdes, const char __user *u_msg_ptr,
--
ipc/mqueue.c-1128- goto out_unlock;
ipc/mqueue.c:1129: __do_notify(info);
ipc/mqueue.c-1130- }
--
kernel/exit.c=244=void release_task(struct task_struct *p)
--
kernel/exit.c-275- && leader->exit_state == EXIT_ZOMBIE) {
kernel/exit.c:276: /* for pidfs_exit() and do_notify_parent() */
kernel/exit.c-277- if (leader->signal->flags & SIGNAL_GROUP_EXIT)
--
kernel/exit.c-283- */
kernel/exit.c:284: zap_leader = do_notify_parent(leader, leader->exit_signal);
kernel/exit.c-285- if (zap_leader)
--
kernel/exit.c=674=static void reparent_leader(struct task_struct *father, struct task_struct *p,
--
kernel/exit.c-685- p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) {
kernel/exit.c:686: if (do_notify_parent(p, p->exit_signal)) {
kernel/exit.c-687- p->exit_state = EXIT_DEAD;
--
kernel/exit.c=737=static void exit_notify(struct task_struct *tsk, int group_dead)
--
kernel/exit.c-753- ? tsk->exit_signal : SIGCHLD;
kernel/exit.c:754: autoreap = do_notify_parent(tsk, sig);
kernel/exit.c-755- } else if (thread_group_leader(tsk)) {
kernel/exit.c-756- autoreap = thread_group_empty(tsk) &&
]
]
|
| 127/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 50194
output: 16
thoughts: 10
Thoughts: Here's your summary:
**The Ah-Ha Moment**
Hold on a second... I was about to go down this rabbit hole of debugging and manual comparison, but wait a minute... *I can just check the git diff!* That's it! That will show me the exact changes, the context, everything. No need for a convoluted process. This is the fastest and most efficient way to figure out what's going on with the code. Why didn't I think of that sooner? Okay, git diff it is. Let's see what we've got. This should be quick.
|
| 128/4 |
2026/05/09 22:17 |
tool |
grepper |
0m
Args:
Results: map[Output:Documentation/bpf/drgn.rst=99=For example, to print ``struct bpf_prog_aux`` for BPF program id 53077:
--
Documentation/bpf/drgn.rst-102-
Documentation/bpf/drgn.rst:103: % git diff
Documentation/bpf/drgn.rst-104- diff --git a/tools/bpf_inspect.py b/tools/bpf_inspect.py
--
Documentation/dev-tools/clang-format.rst=52=To do so, you can run something like::
--
Documentation/dev-tools/clang-format.rst-56-
Documentation/dev-tools/clang-format.rst:57:And then take a look at the git diff.
Documentation/dev-tools/clang-format.rst-58-
--
Documentation/dev-tools/clang-format.rst=60=the style options in the configuration file; as well as testing new
--
Documentation/dev-tools/clang-format.rst-63-``clang-format`` also supports reading unified diffs, so you can review
Documentation/dev-tools/clang-format.rst:64:patches and git diffs easily. See the documentation at:
Documentation/dev-tools/clang-format.rst-65-
--
Documentation/filesystems/path-lookup.txt=351=kbuild 2696672 10 64442(2.3%) 108764(4.0%) 1 1590
Documentation/filesystems/path-lookup.txt:352:git diff 39605 0 28 2 0 106
Documentation/filesystems/path-lookup.txt-353-vfstest 24185492 4945 708725(2.9%) 1076136(4.4%) 0 2651
--
Documentation/maintainer/messy-diffstat.rst=26=this will do the job::
Documentation/maintainer/messy-diffstat.rst-27-
Documentation/maintainer/messy-diffstat.rst:28: $ git diff --stat --summary vN-rc2..vN-rc3
Documentation/maintainer/messy-diffstat.rst-29-
--
Documentation/maintainer/messy-diffstat.rst=36=result in the simplest case is a history that looks like::
--
Documentation/maintainer/messy-diffstat.rst-41-
Documentation/maintainer/messy-diffstat.rst:42:If that maintainer now uses ``git diff`` to see what has changed between
Documentation/maintainer/messy-diffstat.rst-43-the mainline branch (let's call it "linus") and cN, there are still two
--
Documentation/maintainer/messy-diffstat.rst=59=What is happening here is that there are no longer two clear end points for
Documentation/maintainer/messy-diffstat.rst:60:the ``git diff`` operation to use. The development culminating in cN
Documentation/maintainer/messy-diffstat.rst:61:started in two different places; to generate the diffstat, ``git diff``
Documentation/maintainer/messy-diffstat.rst-62-ends up having pick one of them and hoping for the best. If the diffstat
--
Documentation/maintainer/messy-diffstat.rst=89=generate a diffstat with the desired information::
Documentation/maintainer/messy-diffstat.rst-90-
Documentation/maintainer/messy-diffstat.rst:91: $ git diff -C --stat --summary linus..TEMP
Documentation/maintainer/messy-diffstat.rst-92-
--
Documentation/process/backporting.rst=264=This is what you would see if you opened the file in your editor.
Documentation/process/backporting.rst:265:However, if you were to run ``git diff`` without any arguments, the
Documentation/process/backporting.rst-266-output would look something like this::
Documentation/process/backporting.rst-267-
Documentation/process/backporting.rst:268: $ git diff
Documentation/process/backporting.rst-269- [...]
--
Documentation/process/backporting.rst-275-
Documentation/process/backporting.rst:276:When you are resolving a conflict, the behavior of ``git diff`` differs
Documentation/process/backporting.rst-277-from its normal behavior. Notice the two columns of diff markers
--
Documentation/process/backporting.rst=294=from. While this is useful for spotting other changes that you need to
Documentation/process/backporting.rst:295:take into account, this also makes the output of ``git diff`` somewhat
Documentation/process/backporting.rst-296-intimidating and difficult to read. You may instead prefer to run
Documentation/process/backporting.rst:297:``git diff HEAD`` (or ``git diff --ours``) which shows only the diff
Documentation/process/backporting.rst-298-between the current branch before cherry-picking and the current working
Documentation/process/backporting.rst=299=directory. It looks like this::
Documentation/process/backporting.rst-300-
Documentation/process/backporting.rst:301: $ git diff HEAD
Documentation/process/backporting.rst-302- [...]
--
Documentation/process/backporting.rst=374=For particularly nasty conflicts with many conflict markers, you can use
Documentation/process/backporting.rst-375-``git add`` or ``git add -i`` to selectively stage your resolutions to
Documentation/process/backporting.rst:376:get them out of the way; this also lets you use ``git diff HEAD`` to
Documentation/process/backporting.rst:377:always see what remains to be resolved or ``git diff --cached`` to see
Documentation/process/backporting.rst-378-what your patch looks like so far.
--
Documentation/process/backporting.rst=438=A good way to ensure that you review the error paths is to always use
Documentation/process/backporting.rst:439:``git diff -W`` and ``git show -W`` (AKA ``--function-context``) when
Documentation/process/backporting.rst-440-inspecting your changes. For C code, this will show you the whole
--
Documentation/process/backporting.rst=482=them according to the changes between them::
Documentation/process/backporting.rst-483-
Documentation/process/backporting.rst:484: colordiff -yw -W 200 <(git diff -W <upstream commit>^-) <(git diff -W HEAD^-) | less -SR
Documentation/process/backporting.rst-485-
--
Documentation/process/backporting.rst=494=the official `git rev-parse documentation`_.
--
Documentation/process/backporting.rst-497-
Documentation/process/backporting.rst:498:Again, note the inclusion of ``-W`` for ``git diff``; this ensures that
Documentation/process/backporting.rst-499-you will see the full function for any function that has changed.
--
Documentation/translations/it_IT/dev-tools/clang-format.rst=61=Per farlo, potete eseguire qualcosa del genere::
--
Documentation/translations/it_IT/dev-tools/clang-format.rst-65-
Documentation/translations/it_IT/dev-tools/clang-format.rst:66:E poi date un'occhiata a *git diff*.
Documentation/translations/it_IT/dev-tools/clang-format.rst-67-
--
Documentation/translations/it_IT/dev-tools/clang-format.rst=70=le nuove funzionalità/versioni di ``clang-format``.
--
Documentation/translations/it_IT/dev-tools/clang-format.rst-72-``clang-format`` è in grado di leggere diversi diff unificati, quindi
Documentation/translations/it_IT/dev-tools/clang-format.rst:73:potrete revisionare facilmente delle modifiche e *git diff*.
Documentation/translations/it_IT/dev-tools/clang-format.rst-74-La documentazione si trova al seguente indirizzo:
--
Documentation/translations/ja_JP/SubmittingPatches=487=Fixes: タグは、そのパッチが以前のコミットにあった問題を修正することを示します。
--
Documentation/translations/ja_JP/SubmittingPatches-621-
Documentation/translations/ja_JP/SubmittingPatches:622:diffstat の結果を生成するために「 git diff -M --stat --summary 」を使って
Documentation/translations/ja_JP/SubmittingPatches-623-ください。-M オプションはファイル名の変更を検知でき、--summary オプションは
--
scripts/check-uapi.sh=141=tree_is_dirty() {
scripts/check-uapi.sh:142: ! git diff --quiet
scripts/check-uapi.sh-143-}
--
scripts/git.orderFile-6-# one-off usage:
scripts/git.orderFile:7:# git diff -O scripts/git.orderFile ...
scripts/git.orderFile-8-#
--
scripts/package/gen-diff-patch=15=fi
--
scripts/package/gen-diff-patch-17-# The source tarball, which is generated by 'git archive', contains everything
scripts/package/gen-diff-patch:18:# you committed in the repository. If you have local diff ('git diff HEAD'),
scripts/package/gen-diff-patch-19-# it will go into ${diff_patch}. If untracked files are remaining, the resulting
--
scripts/setlocalversion=58=scm_version()
--
scripts/setlocalversion-149- git --no-optional-locks status -uno --porcelain 2>/dev/null ||
scripts/setlocalversion:150: git diff-index --name-only HEAD
scripts/setlocalversion-151- } | read dummy; then
--
tools/perf/arch/x86/tests/gen-insn-x86-dat.sh=34=trap - EXIT
tools/perf/arch/x86/tests/gen-insn-x86-dat.sh-35-
tools/perf/arch/x86/tests/gen-insn-x86-dat.sh:36:echo "Done (use git diff to see the changes)"
--
tools/power/cpupower/utils/version-gen.sh=14=if test -d ../../../.git -o -f ../../../.git &&
--
tools/power/cpupower/utils/version-gen.sh-19- git update-index -q --refresh
tools/power/cpupower/utils/version-gen.sh:20: test -z "$(git diff-index --name-only HEAD --)" ||
tools/power/cpupower/utils/version-gen.sh-21- VN="$VN-dirty" ;;
--
tools/testing/selftests/rcutorture/bin/mktestid.sh=20=then
--
tools/testing/selftests/rcutorture/bin/mktestid.sh-26- echo >> ${resdir}/testid.txt
tools/testing/selftests/rcutorture/bin/mktestid.sh:27: echo ' ---' Output of "'"git diff HEAD"'": >> ${resdir}/testid.txt
tools/testing/selftests/rcutorture/bin/mktestid.sh:28: git diff HEAD >> ${resdir}/testid.txt
tools/testing/selftests/rcutorture/bin/mktestid.sh-29-fi
]
|
| 129/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 53282
output: 52
thoughts: 1056
Thoughts: **Analyzing Queue Pair Notification Logic**
Okay, so I'm trying to wrap my head around this `qp_notify_peer` call within the queue pair broker code. My initial thought was whether I could use `git diff` with `default_api:grepper` to quickly locate instances, but that's not quite right. `git diff` provides the output, while `grepper` *executes* `git grep`. I need to be precise.
First, I wanted to map out all the places `qp_notify_peer` is called. I had a look at `vmci_qp_broker_detach`, `vmci_qp_broker_set_page_store`, and `qp_broker_attach`, and I confirmed those. Just to be sure, I've verified that the three call sites are: `qp_broker_attach`, `vmci_qp_broker_set_page_store`, and `vmci_qp_broker_detach`.
I then checked `qp_broker_create` to see if it makes the call. No, that one calls `qp_notify_peer_local` instead, so that's distinct.
Next, I looked at `qp_broker_alloc` because it calls both `qp_broker_create` and `qp_broker_attach`. I remember that I'd previously modified `qp_broker_alloc` to handle `do_notify` and `out_ctx`, so this warrants closer examination.
Let's re-examine each of the original call sites: `vmci_qp_broker_detach` looks right.
```c
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
```
Okay, confirmed. Let's look at `vmci_qp_broker_set_page_store`:
```c
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS) {
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
}
```
This also checks out. Then `qp_broker_attach`.
```c
if (entry->state == VMCIQPB_ATTACHED_MEM) {
*do_notify = true;
*notify_peer_id = entry->create_id;
}
```
That seems fine as well.
Now, back to `qp_broker_alloc` – this is where it gets interesting because of how it handles `create` and `attach`:
```c
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
```
A potential gotcha: what if `handle` in `qp_broker_alloc` has `VMCI_INVALID_ID` for resource? Then `qp_broker_handle_to_entry` wouldn't be called, so the `entry` would be NULL, and therefore `create` is true. Then, `qp_broker_attach` isn't called. So if `handle.resource == VMCI_INVALID_ID` and `qp_broker_create` is called. That means `create` is true and `do_notify` remains false, so `qp_notify_peer` isn't called. This appears to be correct logic.
Next I need to be sure about `vmci_ctx_put(out_ctx)` inside `qp_broker_alloc`.
```c
if (out_ctx)
vmci_ctx_put(out_ctx);
```
This seems okay too.
Finally, I need to make sure that `vmci_ctx_put` isn't being called elsewhere while holding `qp_broker_list.mutex`. I searched for calls to `vmci_ctx_put` to double-check. I found that it's also called in `qp_broker_attach`. I'll have to examine `qp_broker_create`
|
| 130/4 |
2026/05/09 22:17 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_create]
Results: map[SourceCode:1264: /*
1265: * The first endpoint issuing a queue pair allocation will create the state
1266: * of the queue pair in the queue pair broker.
1267: *
1268: * If the creator is a guest, it will associate a VMX virtual address range
1269: * with the queue pair as specified by the page_store. For compatibility with
1270: * older VMX'en, that would use a separate step to set the VMX virtual
1271: * address range, the virtual address range can be registered later using
1272: * vmci_qp_broker_set_page_store. In that case, a page_store of NULL should be
1273: * used.
1274: *
1275: * If the creator is the host, a page_store of NULL should be used as well,
1276: * since the host is not able to supply a page store for the queue pair.
1277: *
1278: * For older VMX and host callers, the queue pair will be created in the
1279: * VMCIQPB_CREATED_NO_MEM state, and for current VMX callers, it will be
1280: * created in VMCOQPB_CREATED_MEM state.
1281: */
1282: static int qp_broker_create(struct vmci_handle handle,
1283: u32 peer,
1284: u32 flags,
1285: u32 priv_flags,
1286: u64 produce_size,
1287: u64 consume_size,
1288: struct vmci_qp_page_store *page_store,
1289: struct vmci_ctx *context,
1290: vmci_event_release_cb wakeup_cb,
1291: void *client_data, struct qp_broker_entry **ent)
1292: {
1293: struct qp_broker_entry *entry = NULL;
1294: const u32 context_id = vmci_ctx_get_id(context);
1295: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1296: int result;
1297: u64 guest_produce_size;
1298: u64 guest_consume_size;
1299:
1300: /* Do not create if the caller asked not to. */
1301: if (flags & VMCI_QPFLAG_ATTACH_ONLY)
1302: return VMCI_ERROR_NOT_FOUND;
1303:
1304: /*
1305: * Creator's context ID should match handle's context ID or the creator
1306: * must allow the context in handle's context ID as the "peer".
1307: */
1308: if (handle.context != context_id && handle.context != peer)
1309: return VMCI_ERROR_NO_ACCESS;
1310:
1311: if (VMCI_CONTEXT_IS_VM(context_id) && VMCI_CONTEXT_IS_VM(peer))
1312: return VMCI_ERROR_DST_UNREACHABLE;
1313:
1314: /*
1315: * Creator's context ID for local queue pairs should match the
1316: * peer, if a peer is specified.
1317: */
1318: if (is_local && peer != VMCI_INVALID_ID && context_id != peer)
1319: return VMCI_ERROR_NO_ACCESS;
1320:
1321: entry = kzalloc_obj(*entry, GFP_ATOMIC);
1322: if (!entry)
1323: return VMCI_ERROR_NO_MEM;
1324:
1325: if (vmci_ctx_get_id(context) == VMCI_HOST_CONTEXT_ID && !is_local) {
1326: /*
1327: * The queue pair broker entry stores values from the guest
1328: * point of view, so a creating host side endpoint should swap
1329: * produce and consume values -- unless it is a local queue
1330: * pair, in which case no swapping is necessary, since the local
1331: * attacher will swap queues.
1332: */
1333:
1334: guest_produce_size = consume_size;
1335: guest_consume_size = produce_size;
1336: } else {
1337: guest_produce_size = produce_size;
1338: guest_consume_size = consume_size;
1339: }
1340:
1341: entry->qp.handle = handle;
1342: entry->qp.peer = peer;
1343: entry->qp.flags = flags;
1344: entry->qp.produce_size = guest_produce_size;
1345: entry->qp.consume_size = guest_consume_size;
1346: entry->qp.ref_count = 1;
1347: entry->create_id = context_id;
1348: entry->attach_id = VMCI_INVALID_ID;
1349: entry->state = VMCIQPB_NEW;
1350: entry->require_trusted_attach =
1351: !!(context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED);
1352: entry->created_by_trusted =
1353: !!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED);
1354: entry->vmci_page_files = false;
1355: entry->wakeup_cb = wakeup_cb;
1356: entry->client_data = client_data;
1357: entry->produce_q = qp_host_alloc_queue(guest_produce_size);
1358: if (entry->produce_q == NULL) {
1359: result = VMCI_ERROR_NO_MEM;
1360: goto error;
1361: }
1362: entry->consume_q = qp_host_alloc_queue(guest_consume_size);
1363: if (entry->consume_q == NULL) {
1364: result = VMCI_ERROR_NO_MEM;
1365: goto error;
1366: }
1367:
1368: qp_init_queue_mutex(entry->produce_q, entry->consume_q);
1369:
1370: INIT_LIST_HEAD(&entry->qp.list_item);
1371:
1372: if (is_local) {
1373: u8 *tmp;
1374:
1375: entry->local_mem = kcalloc(QPE_NUM_PAGES(entry->qp),
1376: PAGE_SIZE, GFP_KERNEL);
1377: if (entry->local_mem == NULL) {
1378: result = VMCI_ERROR_NO_MEM;
1379: goto error;
1380: }
1381: entry->state = VMCIQPB_CREATED_MEM;
1382: entry->produce_q->q_header = entry->local_mem;
1383: tmp = (u8 *)entry->local_mem + PAGE_SIZE *
1384: (DIV_ROUND_UP(entry->qp.produce_size, PAGE_SIZE) + 1);
1385: entry->consume_q->q_header = (struct vmci_queue_header *)tmp;
1386: } else if (page_store) {
1387: /*
1388: * The VMX already initialized the queue pair headers, so no
1389: * need for the kernel side to do that.
1390: */
1391: result = qp_host_register_user_memory(page_store,
1392: entry->produce_q,
1393: entry->consume_q);
1394: if (result < VMCI_SUCCESS)
1395: goto error;
1396:
1397: entry->state = VMCIQPB_CREATED_MEM;
1398: } else {
1399: /*
1400: * A create without a page_store may be either a host
1401: * side create (in which case we are waiting for the
1402: * guest side to supply the memory) or an old style
1403: * queue pair create (in which case we will expect a
1404: * set page store call as the next step).
1405: */
1406: entry->state = VMCIQPB_CREATED_NO_MEM;
1407: }
1408:
1409: qp_list_add_entry(&qp_broker_list, &entry->qp);
1410: if (ent != NULL)
1411: *ent = entry;
1412:
1413: /* Add to resource obj */
1414: result = vmci_resource_add(&entry->resource,
1415: VMCI_RESOURCE_TYPE_QPAIR_HOST,
1416: handle);
1417: if (result != VMCI_SUCCESS) {
1418: pr_warn("Failed to add new resource (handle=0x%x:0x%x), error: %d",
1419: handle.context, handle.resource, result);
1420: goto error;
1421: }
1422:
1423: entry->qp.handle = vmci_resource_handle(&entry->resource);
1424: if (is_local) {
1425: vmci_q_header_init(entry->produce_q->q_header,
1426: entry->qp.handle);
1427: vmci_q_header_init(entry->consume_q->q_header,
1428: entry->qp.handle);
1429: }
1430:
1431: vmci_ctx_qp_create(context, entry->qp.handle);
1432:
1433: return VMCI_SUCCESS;
1434:
1435: error:
1436: if (entry != NULL) {
1437: qp_host_free_queue(entry->produce_q, guest_produce_size);
1438: qp_host_free_queue(entry->consume_q, guest_consume_size);
1439: kfree(entry);
1440: }
1441:
1442: return result;
1443: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 131/4 |
2026/05/09 22:17 |
llm |
patch-generator |
0m
Model:
Tokens:
input: 58371
output: 56
thoughts: 1031
Thoughts: **Reviewing Queue Pair Broker Logic**
Okay, so I thought I had squashed the bugs, given that `qp_broker_create` doesn't call `vmci_ctx_put`. But I need to be absolutely certain. Let's do a thorough check of the remaining functions, specifically `vmci_qp_broker_set_page_store`, `vmci_qp_broker_detach`, `qp_broker_alloc`, and `qp_broker_attach`.
In `qp_broker_alloc`, I see a conditional `vmci_ctx_put` and the `qp_notify_peer` call. I need to make sure the arguments passed to `qp_notify_peer` are correct. Specifically, `handle`. If `handle.resource` was `VMCI_INVALID_ID`, `qp_broker_create` sets `entry->qp.handle` to the new handle. But `qp_broker_alloc` is passing `handle` to `qp_notify_peer`. Wait a minute, if `qp_broker_attach` is called, `handle.resource` *wasn't* `VMCI_INVALID_ID`. This is because `qp_broker_attach` is only called if the entry was found, meaning that the `handle.resource` is not `VMCI_INVALID_ID`. So, the `handle` passed to `qp_broker_alloc` is already valid with the correct resource ID. That seems right.
What if `handle` *was* `VMCI_INVALID_ID` and `qp_broker_create` was called? Then `do_notify` is false, so `qp_notify_peer` isn't called, so `handle` isn't used. Okay, that looks correct.
Now, let's look at `vmci_qp_broker_detach`. It calls `qp_notify_peer` with `handle`. Seems fine.
Next up, `vmci_qp_broker_set_page_store`, also calls `qp_notify_peer` with `handle`. Again, looks correct.
Okay, now let's go back and re-evaluate `qp_broker_attach`. Ah, I remember, I made a change here. I had this code:
```c
if (entry->state == VMCIQPB_ATTACHED_MEM) {
*do_notify = true;
*notify_peer_id = entry->create_id;
}
```
...and the original was:
```c
if (entry->state == VMCIQPB_ATTACHED_MEM) {
result =
qp_notify_peer(true, entry->qp.handle, context_id,
entry->create_id);
if (result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
entry->create_id, entry->qp.handle.context,
entry->qp.handle.resource);
}
```
I removed the `pr_warn` from `qp_broker_attach` and moved it to `qp_broker_alloc`. Now, wait a second. In `qp_broker_alloc` I used `handle.context` and `handle.resource`. Is the `handle` in `qp_broker_alloc` the same as `entry->qp.handle`? Yes! Because `entry = qp_broker_handle_to_entry(handle);` finds the entry by `handle`. Wait, `qp_broker_handle_to_entry` matches `handle.resource` and `handle.context`? I had better check `qp_broker_handle_to_entry`.
|
| 132/4 |
2026/05/09 22:18 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_handle_to_entry]
Results: map[SourceCode: 834: /*
835: * Finds the entry in the list corresponding to a given handle.
836: */
837: static struct qp_broker_entry *
838: qp_broker_handle_to_entry(struct vmci_handle handle)
839: {
840: struct qp_broker_entry *entry;
841: struct qp_entry *qp = qp_list_find(&qp_broker_list, handle);
842:
843: entry = qp ? container_of(
844: qp, struct qp_broker_entry, qp) : NULL;
845: return entry;
846: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 133/4 |
2026/05/09 22:18 |
llm |
patch-generator |
1m
Model:
Tokens:
input: 60523
output: 52
thoughts: 342
Thoughts: **Analyzing Queue Pair Broker Allocation**
Okay, so `handle` is consistent throughout, that much is clear. But I need to think through a specific error case, a tricky one really. What if `qp_broker_alloc` fails *after* `qp_broker_attach` has been called? I mean, specifically after the call, not before. Let's dig in. I'm looking at this snippet from `qp_broker_alloc`:
```c
} else {
create = false;
result =
qp_broker_attach(entry, peer, flags, priv_flags,
produce_size, consume_size, page_store,
context, wakeup_cb, client_data, ent,
&do_notify, ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
if (out_ctx)
vmci_ctx_put(out_ctx);
if (do_notify) {
int notify_result;
notify_result = qp_notify_peer(true, handle, context_id, notify_peer_id);
if (notify_result < VMCI_SUCCESS)
pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
notify_peer_id, handle.context, handle.resource);
}
```
Okay, I see the logic. `do_notify` is *only* set to true within `qp_broker_attach`. So, if `qp_broker_attach` fails, `do_notify` remains false, so the notification is skipped. So no notification will be sent. I should take another look at the `qp_broker_attach` function to confirm that's how it's implemented. Gotta make sure nothing else could potentially set `do_notify` to true.
|
| 134/4 |
2026/05/09 22:19 |
tool |
codesearch-definition-source |
0m
Args: map[ContextFile:drivers/misc/vmw_vmci/vmci_queue_pair.c IncludeLines:true Name:qp_broker_attach]
Results: map[SourceCode:1490: /*
1491: * The second endpoint issuing a queue pair allocation will attach to
1492: * the queue pair registered with the queue pair broker.
1493: *
1494: * If the attacher is a guest, it will associate a VMX virtual address
1495: * range with the queue pair as specified by the page_store. At this
1496: * point, the already attach host endpoint may start using the queue
1497: * pair, and an attach event is sent to it. For compatibility with
1498: * older VMX'en, that used a separate step to set the VMX virtual
1499: * address range, the virtual address range can be registered later
1500: * using vmci_qp_broker_set_page_store. In that case, a page_store of
1501: * NULL should be used, and the attach event will be generated once
1502: * the actual page store has been set.
1503: *
1504: * If the attacher is the host, a page_store of NULL should be used as
1505: * well, since the page store information is already set by the guest.
1506: *
1507: * For new VMX and host callers, the queue pair will be moved to the
1508: * VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
1509: * moved to the VMCOQPB_ATTACHED_NO_MEM state.
1510: */
1511: static int qp_broker_attach(struct qp_broker_entry *entry,
1512: u32 peer,
1513: u32 flags,
1514: u32 priv_flags,
1515: u64 produce_size,
1516: u64 consume_size,
1517: struct vmci_qp_page_store *page_store,
1518: struct vmci_ctx *context,
1519: vmci_event_release_cb wakeup_cb,
1520: void *client_data,
1521: struct qp_broker_entry **ent)
1522: {
1523: const u32 context_id = vmci_ctx_get_id(context);
1524: bool is_local = flags & VMCI_QPFLAG_LOCAL;
1525: int result;
1526:
1527: if (entry->state != VMCIQPB_CREATED_NO_MEM &&
1528: entry->state != VMCIQPB_CREATED_MEM)
1529: return VMCI_ERROR_UNAVAILABLE;
1530:
1531: if (is_local) {
1532: if (!(entry->qp.flags & VMCI_QPFLAG_LOCAL) ||
1533: context_id != entry->create_id) {
1534: return VMCI_ERROR_INVALID_ARGS;
1535: }
1536: } else if (context_id == entry->create_id ||
1537: context_id == entry->attach_id) {
1538: return VMCI_ERROR_ALREADY_EXISTS;
1539: }
1540:
1541: if (VMCI_CONTEXT_IS_VM(context_id) &&
1542: VMCI_CONTEXT_IS_VM(entry->create_id))
1543: return VMCI_ERROR_DST_UNREACHABLE;
1544:
1545: /*
1546: * If we are attaching from a restricted context then the queuepair
1547: * must have been created by a trusted endpoint.
1548: */
1549: if ((context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED) &&
1550: !entry->created_by_trusted)
1551: return VMCI_ERROR_NO_ACCESS;
1552:
1553: /*
1554: * If we are attaching to a queuepair that was created by a restricted
1555: * context then we must be trusted.
1556: */
1557: if (entry->require_trusted_attach &&
1558: (!(priv_flags & VMCI_PRIVILEGE_FLAG_TRUSTED)))
1559: return VMCI_ERROR_NO_ACCESS;
1560:
1561: /*
1562: * If the creator specifies VMCI_INVALID_ID in "peer" field, access
1563: * control check is not performed.
1564: */
1565: if (entry->qp.peer != VMCI_INVALID_ID && entry->qp.peer != context_id)
1566: return VMCI_ERROR_NO_ACCESS;
1567:
1568: if (entry->create_id == VMCI_HOST_CONTEXT_ID) {
1569: /*
1570: * Do not attach if the caller doesn't support Host Queue Pairs
1571: * and a host created this queue pair.
1572: */
1573:
1574: if (!vmci_ctx_supports_host_qp(context))
1575: return VMCI_ERROR_INVALID_RESOURCE;
1576:
1577: } else if (context_id == VMCI_HOST_CONTEXT_ID) {
1578: struct vmci_ctx *create_context;
1579: bool supports_host_qp;
1580:
1581: /*
1582: * Do not attach a host to a user created queue pair if that
1583: * user doesn't support host queue pair end points.
1584: */
1585:
1586: create_context = vmci_ctx_get(entry->create_id);
1587: supports_host_qp = vmci_ctx_supports_host_qp(create_context);
1588: vmci_ctx_put(create_context);
1589:
1590: if (!supports_host_qp)
1591: return VMCI_ERROR_INVALID_RESOURCE;
1592: }
1593:
1594: if ((entry->qp.flags & ~VMCI_QP_ASYMM) != (flags & ~VMCI_QP_ASYMM_PEER))
1595: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1596:
1597: if (context_id != VMCI_HOST_CONTEXT_ID) {
1598: /*
1599: * The queue pair broker entry stores values from the guest
1600: * point of view, so an attaching guest should match the values
1601: * stored in the entry.
1602: */
1603:
1604: if (entry->qp.produce_size != produce_size ||
1605: entry->qp.consume_size != consume_size) {
1606: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1607: }
1608: } else if (entry->qp.produce_size != consume_size ||
1609: entry->qp.consume_size != produce_size) {
1610: return VMCI_ERROR_QUEUEPAIR_MISMATCH;
1611: }
1612:
1613: if (context_id != VMCI_HOST_CONTEXT_ID) {
1614: /*
1615: * If a guest attached to a queue pair, it will supply
1616: * the backing memory. If this is a pre NOVMVM vmx,
1617: * the backing memory will be supplied by calling
1618: * vmci_qp_broker_set_page_store() following the
1619: * return of the vmci_qp_broker_alloc() call. If it is
1620: * a vmx of version NOVMVM or later, the page store
1621: * must be supplied as part of the
1622: * vmci_qp_broker_alloc call. Under all circumstances
1623: * must the initially created queue pair not have any
1624: * memory associated with it already.
1625: */
1626:
1627: if (entry->state != VMCIQPB_CREATED_NO_MEM)
1628: return VMCI_ERROR_INVALID_ARGS;
1629:
1630: if (page_store != NULL) {
1631: /*
1632: * Patch up host state to point to guest
1633: * supplied memory. The VMX already
1634: * initialized the queue pair headers, so no
1635: * need for the kernel side to do that.
1636: */
1637:
1638: result = qp_host_register_user_memory(page_store,
1639: entry->produce_q,
1640: entry->consume_q);
1641: if (result < VMCI_SUCCESS)
1642: return result;
1643:
1644: entry->state = VMCIQPB_ATTACHED_MEM;
1645: } else {
1646: entry->state = VMCIQPB_ATTACHED_NO_MEM;
1647: }
1648: } else if (entry->state == VMCIQPB_CREATED_NO_MEM) {
1649: /*
1650: * The host side is attempting to attach to a queue
1651: * pair that doesn't have any memory associated with
1652: * it. This must be a pre NOVMVM vmx that hasn't set
1653: * the page store information yet, or a quiesced VM.
1654: */
1655:
1656: return VMCI_ERROR_UNAVAILABLE;
1657: } else {
1658: /* The host side has successfully attached to a queue pair. */
1659: entry->state = VMCIQPB_ATTACHED_MEM;
1660: }
1661:
1662: if (entry->state == VMCIQPB_ATTACHED_MEM) {
1663: result =
1664: qp_notify_peer(true, entry->qp.handle, context_id,
1665: entry->create_id);
1666: if (result < VMCI_SUCCESS)
1667: pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
1668: entry->create_id, entry->qp.handle.context,
1669: entry->qp.handle.resource);
1670: }
1671:
1672: entry->attach_id = context_id;
1673: entry->qp.ref_count++;
1674: if (wakeup_cb) {
1675: entry->wakeup_cb = wakeup_cb;
1676: entry->client_data = client_data;
1677: }
1678:
1679: /*
1680: * When attaching to local queue pairs, the context already has
1681: * an entry tracking the queue pair, so don't add another one.
1682: */
1683: if (!is_local)
1684: vmci_ctx_qp_create(context, entry->qp.handle);
1685:
1686: if (ent != NULL)
1687: *ent = entry;
1688:
1689: return VMCI_SUCCESS;
1690: }
SourceFile:drivers/misc/vmw_vmci/vmci_queue_pair.c]
|
| 135/4 |
2026/05/09 22:19 |
llm |
patch-generator |
1m
Model:
Tokens:
input: 64589
output: 679
thoughts: 2225
Thoughts: **Reviewing the Queue Pair Broker Fix**
Okay, first things first, I thought I might have missed an incorrect change to `qp_broker_attach`, but let's see... Ah, `codesearch-definition-source` is showing me the original file content. Yep, `codesearch-definition-source` always shows the original. So, the changes are correct. I can breathe.
Now, let me go through these changes again, methodically. I need to be absolutely sure this is solid.
In `vmci_qp_broker_detach`: Everything looks correct; if there's no reference count, the state is set appropriately, and if there are remaining endpoints, we correctly set `do_notify` to true and notify the peer *after* the mutex is unlocked. Perfect.
Next, `vmci_qp_broker_set_page_store`: Here too, we correctly set the `do_notify` flag and `notify_peer_id` when the state is `VMCIQPB_ATTACHED_MEM`. Again, the call to `qp_notify_peer` happens after the mutex is released. Good, good.
Now `qp_broker_attach`: I remember this one. We're now passing pointers for `do_notify`, `notify_peer_id`, and `out_ctx`, rather than calling the functions in-place. We get the context, and check for host QP support, then the `do_notify` and `notify_peer_id` variables are set correctly based on the `VMCIQPB_ATTACHED_MEM` state.
Finally, `qp_broker_alloc`: This seems right. We now pass the pointers to `qp_broker_attach`, and we call the `vmci_ctx_put` function and `qp_notify_peer` only *after* the mutex is released. This avoids calling `ctx_free_ctx` while holding the mutex, therefore the deadlock.
Is there any other place where `vmci_ctx_put` is called while holding `qp_broker_list.mutex`? No, a quick search through `vmci_queue_pair.c` confirms that we've correctly changed the only place where it was done inside the mutex.
Is there any other place where `qp_notify_peer` is called while holding `qp_broker_list.mutex`? No, I checked and there's no more calling the `qp_notify_peer` inside `vmci_queue_pair.c`.
The fix appears complete and correct. We deferred the notification and context put functions to prevent the recursive locking deadlock.
Now, let's write a final summary to explain these changes and be done with it.
|
| 136/3 |
2026/05/09 22:20 |
action |
test-patch |
31m
Results: map[PatchDiff:diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index b777bc3fd..3d61d5bf2 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -1508,17 +1508,13 @@ static int qp_notify_peer(bool attach,
* VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
* moved to the VMCOQPB_ATTACHED_NO_MEM state.
*/
-static int qp_broker_attach(struct qp_broker_entry *entry,
- u32 peer,
- u32 flags,
- u32 priv_flags,
- u64 produce_size,
- u64 consume_size,
+static int qp_broker_attach(struct qp_broker_entry *entry, u32 peer, u32 flags,
+ u32 priv_flags, u64 produce_size, u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
- vmci_event_release_cb wakeup_cb,
- void *client_data,
- struct qp_broker_entry **ent)
+ vmci_event_release_cb wakeup_cb, void *client_data,
+ struct qp_broker_entry **ent, bool *do_notify,
+ u32 *notify_peer_id, struct vmci_ctx **out_ctx)
{
const u32 context_id = vmci_ctx_get_id(context);
bool is_local = flags & VMCI_QPFLAG_LOCAL;
@@ -1585,7 +1581,7 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
- vmci_ctx_put(create_context);
+ *out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE;
@@ -1660,13 +1656,8 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
}
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, entry->qp.handle, context_id,
- entry->create_id);
- if (result < VMCI_SUCCESS)
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
+ *do_notify = true;
+ *notify_peer_id = entry->create_id;
}
entry->attach_id = context_id;
@@ -1711,6 +1702,9 @@ static int qp_broker_alloc(struct vmci_handle handle,
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result;
+ bool do_notify = false;
+ u32 notify_peer_id = VMCI_INVALID_ID;
+ struct vmci_ctx *out_ctx = NULL;
if (vmci_handle_is_invalid(handle) ||
(flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
@@ -1748,14 +1742,29 @@ static int qp_broker_alloc(struct vmci_handle handle,
context, wakeup_cb, client_data, ent);
} else {
create = false;
- result =
- qp_broker_attach(entry, peer, flags, priv_flags,
- produce_size, consume_size, page_store,
- context, wakeup_cb, client_data, ent);
+ result = qp_broker_attach(entry, peer, flags, priv_flags,
+ produce_size, consume_size,
+ page_store, context, wakeup_cb,
+ client_data, ent, &do_notify,
+ ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
+ if (out_ctx)
+ vmci_ctx_put(out_ctx);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS)
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
@@ -1968,6 +1977,8 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context);
+ bool do_notify = false;
+ u32 notify_peer_id;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID)
@@ -2035,18 +2046,26 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
entry->vmci_page_files = true;
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, handle, context_id, entry->create_id);
- if (result < VMCI_SUCCESS) {
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
- }
+ do_notify = true;
+ notify_peer_id = entry->create_id;
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS) {
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+ }
+
return result;
}
@@ -2086,6 +2105,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
u32 peer_id;
bool is_local = false;
int result;
+ bool do_notify = false;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID) {
@@ -2185,7 +2205,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
vmci_ctx_qp_destroy(context, handle);
} else {
- qp_notify_peer(false, handle, context_id, peer_id);
+ do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
@@ -2200,6 +2220,10 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify)
+ qp_notify_peer(false, handle, context_id, peer_id);
+
return result;
}
TestError:]
|
| 137/1 |
2026/05/09 22:51 |
agent |
fixes-finder |
7m
Model:
Results: map[FixesHash:06164d2b72aa752ce4633184b3e0d97601017135]
Instruction:
You are an experienced Linux kernel developer tasked with identifying the commit
that introduced the bug being fixed. Identifying the correct buggy commit is crucial
for proper kernel maintenance (backporting to stable trees, etc.).
Your investigation strategy:
1. Examine the patch that fixes the bug. Use git tools (like git-log or git-blame)
to trace the history of the lines or functions modified by the patch.
2. Analyze the stack trace in the crash report. Identify the key files and functions
involved in the crash and investigate their history to see when the problematic
logic was introduced.
3. Compare the bug explanation with the commit history to find the point where
the described logic error first appeared.
A bug is typically introduced when a piece of code is first written, or when
a refactoring changed its logic in a way that introduced the bug.
Trace the history of relevant symbols or find when specific code patterns were introduced/removed.
You must provide exactly one bug-introducing commit hash.
If you are unable to confidently determine the bug-introducing commit after investigation,
return an empty string rather than guessing.
Prefer calling several tools at the same time to save round-trips.
Use set-results tool to provide results of the analysis.
It must be called exactly once before the final reply.
Ignore results of this tool.
Prompt:
The crash is:
============================================
WARNING: possible recursive locking detected
syzkaller #1 Not tainted
--------------------------------------------
syz.0.512/7305 is trying to acquire lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
but task is already holding lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
other info that might help us debug this:
Possible unsafe locking scenario:
CPU0
----
lock(qp_broker_list.mutex);
lock(qp_broker_list.mutex);
*** DEADLOCK ***
May be due to missing lock nesting notation
1 lock held by syz.0.512/7305:
#0: ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
stack backtrace:
CPU: 1 UID: 0 PID: 7305 Comm: syz.0.512 Not tainted syzkaller #1 PREEMPT(full)
Hardware name: QEMU Standard PC (Q35 + ICH9, 2009), BIOS 1.16.3-debian-1.16.3-2 04/01/2014
Call Trace:
<TASK>
dump_stack_lvl+0xe8/0x150 lib/dump_stack.c:120
print_deadlock_bug+0x279/0x290 kernel/locking/lockdep.c:3041
check_deadlock kernel/locking/lockdep.c:3093 [inline]
validate_chain kernel/locking/lockdep.c:3895 [inline]
__lock_acquire+0x253f/0x2cf0 kernel/locking/lockdep.c:5237
lock_acquire+0x106/0x350 kernel/locking/lockdep.c:5868
__mutex_lock_common kernel/locking/mutex.c:646 [inline]
__mutex_lock+0x199/0x1550 kernel/locking/mutex.c:820
vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_ctx_enqueue_datagram+0x3ab/0x420 drivers/misc/vmw_vmci/vmci_context.c:340
dg_dispatch_as_host drivers/misc/vmw_vmci/vmci_datagram.c:276 [inline]
vmci_datagram_dispatch+0x450/0xc60 drivers/misc/vmw_vmci/vmci_datagram.c:340
qp_notify_peer drivers/misc/vmw_vmci/vmci_queue_pair.c:1481 [inline]
vmci_qp_broker_detach+0x8dd/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2188
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_host_close+0x98/0x160 drivers/misc/vmw_vmci/vmci_host.c:143
__fput+0x44f/0xa60 fs/file_table.c:510
task_work_run+0x1d9/0x270 kernel/task_work.c:233
resume_user_mode_work include/linux/resume_user_mode.h:50 [inline]
__exit_to_user_mode_loop kernel/entry/common.c:67 [inline]
exit_to_user_mode_loop+0xed/0x480 kernel/entry/common.c:98
__exit_to_user_mode_prepare include/linux/irq-entry-common.h:207 [inline]
syscall_exit_to_user_mode_prepare include/linux/irq-entry-common.h:238 [inline]
syscall_exit_to_user_mode include/linux/entry-common.h:318 [inline]
do_syscall_64+0x33e/0xf80 arch/x86/entry/syscall_64.c:100
entry_SYSCALL_64_after_hwframe+0x77/0x7f
RIP: 0033:0x7f45efd9cdd9
Code: ff c3 66 2e 0f 1f 84 00 00 00 00 00 0f 1f 44 00 00 48 89 f8 48 89 f7 48 89 d6 48 89 ca 4d 89 c2 4d 89 c8 4c 8b 4c 24 08 0f 05 <48> 3d 01 f0 ff ff 73 01 c3 48 c7 c1 e8 ff ff ff f7 d8 64 89 01 48
RSP: 002b:00007ffd73cac3c8 EFLAGS: 00000246 ORIG_RAX: 00000000000001b4
RAX: 0000000000000000 RBX: 00007f45f0017da0 RCX: 00007f45efd9cdd9
RDX: 0000000000000000 RSI: 000000000000001e RDI: 0000000000000003
RBP: 00007f45f0017da0 R08: 00007f45f0016038 R09: 00007f45efe3337e
R10: 000000000003fda8 R11: 0000000000000246 R12: 000000000002029b
R13: 00007f45f0015fac R14: 000000000001ff8e R15: 00007ffd73cac4d0
</TASK>
The explanation of the root cause is:
The root cause of this crash is a recursive locking deadlock involving `qp_broker_list.mutex`.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires `qp_broker_list.mutex` and, if there are still other endpoints attached, it calls `qp_notify_peer()` to send a notification datagram to the peer context.
The deadlock occurs because `qp_notify_peer()` indirectly calls `vmci_ctx_put()` on the peer's context, which can drop the reference count to 0 if the peer context is concurrently being destroyed. When the reference count reaches 0, `vmci_ctx_put()` synchronously calls `ctx_free_ctx()`. This cleanup function iterates over all queue pairs attached to the dying context and calls `vmci_qp_broker_detach()` for each of them, which attempts to acquire `qp_broker_list.mutex` again, resulting in a deadlock.
Here is the exact call chain leading to the deadlock:
```
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex);
qp_notify_peer()
vmci_datagram_dispatch()
dg_dispatch_as_host()
vmci_ctx_enqueue_datagram()
context = vmci_ctx_get(cid);
...
vmci_ctx_put(context);
kref_put(&context->kref, ctx_free_ctx);
ctx_free_ctx()
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex); <-- DEADLOCK
```
This issue is not isolated to `vmci_qp_broker_detach()`. There are other places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where `qp_notify_peer()` or `vmci_ctx_put()` are called while holding `qp_broker_list.mutex`:
1. **`qp_broker_attach()`**: Calls `vmci_ctx_put(create_context)` directly while holding the mutex. It also calls `qp_notify_peer()`.
2. **`vmci_qp_broker_set_page_store()`**: Calls `qp_notify_peer()` while holding the mutex.
### Proposed Fix
To fix this bug, the calls to `qp_notify_peer()` and `vmci_ctx_put()` must be deferred until after `qp_broker_list.mutex` is released.
For example, in `vmci_qp_broker_detach()`, you can use a boolean flag to defer the notification:
```c
bool do_notify = false;
...
mutex_lock(&qp_broker_list.mutex);
...
if (entry->qp.ref_count == 0) {
...
} else {
do_notify = true;
...
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
A similar approach should be applied to `vmci_qp_broker_set_page_store()`.
For `qp_broker_attach()`, since it is a static helper called by `qp_broker_alloc()`, you can change its signature to pass out the `do_notify` flag, the `notify_peer_id`, and the `struct vmci_ctx **out_ctx` pointer. Then, `qp_broker_alloc()` can safely call `vmci_ctx_put()` and `qp_notify_peer()` after it unlocks `qp_broker_list.mutex`.
The patch that fixes the bug is:
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index b777bc3fd..3d61d5bf2 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -1508,17 +1508,13 @@ static int qp_notify_peer(bool attach,
* VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
* moved to the VMCOQPB_ATTACHED_NO_MEM state.
*/
-static int qp_broker_attach(struct qp_broker_entry *entry,
- u32 peer,
- u32 flags,
- u32 priv_flags,
- u64 produce_size,
- u64 consume_size,
+static int qp_broker_attach(struct qp_broker_entry *entry, u32 peer, u32 flags,
+ u32 priv_flags, u64 produce_size, u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
- vmci_event_release_cb wakeup_cb,
- void *client_data,
- struct qp_broker_entry **ent)
+ vmci_event_release_cb wakeup_cb, void *client_data,
+ struct qp_broker_entry **ent, bool *do_notify,
+ u32 *notify_peer_id, struct vmci_ctx **out_ctx)
{
const u32 context_id = vmci_ctx_get_id(context);
bool is_local = flags & VMCI_QPFLAG_LOCAL;
@@ -1585,7 +1581,7 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
- vmci_ctx_put(create_context);
+ *out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE;
@@ -1660,13 +1656,8 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
}
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, entry->qp.handle, context_id,
- entry->create_id);
- if (result < VMCI_SUCCESS)
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
+ *do_notify = true;
+ *notify_peer_id = entry->create_id;
}
entry->attach_id = context_id;
@@ -1711,6 +1702,9 @@ static int qp_broker_alloc(struct vmci_handle handle,
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result;
+ bool do_notify = false;
+ u32 notify_peer_id = VMCI_INVALID_ID;
+ struct vmci_ctx *out_ctx = NULL;
if (vmci_handle_is_invalid(handle) ||
(flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
@@ -1748,14 +1742,29 @@ static int qp_broker_alloc(struct vmci_handle handle,
context, wakeup_cb, client_data, ent);
} else {
create = false;
- result =
- qp_broker_attach(entry, peer, flags, priv_flags,
- produce_size, consume_size, page_store,
- context, wakeup_cb, client_data, ent);
+ result = qp_broker_attach(entry, peer, flags, priv_flags,
+ produce_size, consume_size,
+ page_store, context, wakeup_cb,
+ client_data, ent, &do_notify,
+ ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
+ if (out_ctx)
+ vmci_ctx_put(out_ctx);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS)
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
@@ -1968,6 +1977,8 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context);
+ bool do_notify = false;
+ u32 notify_peer_id;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID)
@@ -2035,18 +2046,26 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
entry->vmci_page_files = true;
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, handle, context_id, entry->create_id);
- if (result < VMCI_SUCCESS) {
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
- }
+ do_notify = true;
+ notify_peer_id = entry->create_id;
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS) {
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+ }
+
return result;
}
@@ -2086,6 +2105,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
u32 peer_id;
bool is_local = false;
int result;
+ bool do_notify = false;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID) {
@@ -2185,7 +2205,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
vmci_ctx_qp_destroy(context, handle);
} else {
- qp_notify_peer(false, handle, context_id, peer_id);
+ do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
@@ -2200,6 +2220,10 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify)
+ qp_notify_peer(false, handle, context_id, peer_id);
+
return result;
}
Search for the commit(s) that introduced this bug.
|
| 138/2 |
2026/05/09 22:51 |
llm |
fixes-finder |
1m
Model:
Tokens:
input: 8877
output: 48
thoughts: 246
Thoughts: **Tracing a Recursive Locking Deadlock in vmci_queue_pair.c**
Okay, so we've got a tricky one here. We're tracking down a recursive locking deadlock, specifically in `drivers/misc/vmw_vmci/vmci_queue_pair.c`. The root of the problem seems to be centered around `qp_broker_list.mutex`. My initial assessment is that `qp_notify_peer()` and `vmci_ctx_put()` are being called while we're *already* holding `qp_broker_list.mutex`. The issue is that these functions, either directly or indirectly, potentially trigger a call to `vmci_qp_broker_detach()`. And *that* function, in turn, attempts to acquire `qp_broker_list.mutex` again, which is where we're going to get the deadlock.
Therefore, the key lies in identifying when `qp_notify_peer()` and `vmci_ctx_put()` were introduced within the critical sections controlled by `qp_broker_list.mutex` in a number of relevant functions. Specifically, I need to look at the history of `vmci_qp_broker_detach()`, `qp_broker_attach()` and `vmci_qp_broker_set_page_store()` to see when `qp_notify_peer()` and `vmci_ctx_put()` were added within them.
To do this efficiently, I'll leverage `git log`. We'll use it to trace the commit history of `vmci_qp_broker_detach` and `qp_broker_attach`, pinpointing the precise changes that might have introduced this recursive locking vulnerability.
|
| 139/2 |
2026/05/09 22:52 |
tool |
git-log |
0m
Args: map[SourcePath:drivers/misc/vmw_vmci/vmci_queue_pair.c SymbolName:vmci_qp_broker_detach]
Results: map[Output:234b7f8d3bf2 vmci: fix duplicated code for different branches
06164d2b72aa VMCI: queue pairs implementation.
]
|
| 140/2 |
2026/05/09 22:53 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 9583
output: 45
thoughts: 34
Thoughts: Here's my take on this, considering I'm deep in the code:
**Analyzing the VMCI Queue Pair Implementation**
Okay, so I'm looking at this file, and my gut feeling is that "VMCI: queue pairs implementation" is probably the very first commit to this particular chunk of code. It's a pretty standard initial commit message, so it's a good starting point. I want to trace the history and see how this particular function, `qp_broker_attach`, has evolved. Understanding its past is key to understanding its current behavior and its interactions with the rest of the VMCI system. Tracing the commit history will give me all that information. Let's see what that reveals about the design choices and the evolution of the queue pair handling.
|
| 141/2 |
2026/05/09 22:53 |
tool |
git-log |
0m
Args: map[SourcePath:drivers/misc/vmw_vmci/vmci_queue_pair.c SymbolName:qp_broker_attach]
Results: map[Output:45412befe8fe VMCI: Remove non-blocking/pinned queuepair support
06164d2b72aa VMCI: queue pairs implementation.
]
|
| 142/2 |
2026/05/09 22:53 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 9879
output: 52
thoughts: 18
Thoughts: Okay, here's my attempt at summarizing that thought process, keeping in mind I'm speaking to a fellow expert:
**Investigating `vmci_qp_broker_set_page_store`**
Alright, time to dive into this one. Let's see what we have here. My initial thought is to take a look at the `vmci_qp_broker_set_page_store` function. I need to refresh my memory on exactly what its role is within the VMCI (Virtual Machine Communication Interface) architecture. I'm assuming it's related to how page stores are handled, but I want to be certain. I need to understand how the page store is set, managed, and if there are any specific contexts in which this function is critical. What are the potential implications of any errors or misconfigurations within this function? I'll probably start by quickly scanning the function's definition, comments, and related code within the VMCI codebase. Gotta get a good grip on the overall flow before I dig any deeper. Specifically, I'll be looking for any potential race conditions, memory leaks, or synchronization issues related to page store updates.
|
| 143/2 |
2026/05/09 22:53 |
tool |
git-log |
0m
Args: map[SourcePath:drivers/misc/vmw_vmci/vmci_queue_pair.c SymbolName:vmci_qp_broker_set_page_store]
Results: map[Output:06164d2b72aa VMCI: queue pairs implementation.
]
|
| 144/2 |
2026/05/09 22:54 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 10224
output: 26
thoughts: 54
Thoughts: Okay, here's my take on those thoughts, framed as my own mental process, given my expertise:
**Debugging Analysis: Identifying the Root Cause**
Alright, looking at this, it seems the culprit for this bug *likely* reared its head in that initial commit: `06164d2b72aa VMCI: queue pairs implementation.` That feels like a very specific area to start scrutinizing. Given the likely complexity of VMCI queue pair implementation, it's not surprising if an issue emerged there.
To confirm my initial hunch, the next step is crystal clear. I need to dive into the detailed *diff* of that commit, `06164d2b72aa`. A close examination of the code changes introduced there is going to be crucial. I'll be looking for anything that deviates from established design patterns or potentially introduces race conditions, memory leaks, or incorrect synchronization primitives. The devil, as always, is in the details. Once I have those lines in front of me, I can determine if any part of that commit is related to the symptoms I am seeing.
|
| 145/2 |
2026/05/09 22:54 |
tool |
git-show |
0m
Args:
Results: map[Output:
Full output is too long, showing 1000 out of 3636 lines.
[commit 06164d2b72aa752ce4633184b3e0d97601017135
Author: George Zhang <georgezhang@vmware.com>
Date: Tue Jan 8 15:54:54 2013 -0800
VMCI: queue pairs implementation.
VMCI queue pairs allow for bi-directional ordered communication between host and guests.
Signed-off-by: George Zhang <georgezhang@vmware.com>
Acked-by: Andy king <acking@vmware.com>
Acked-by: Dmitry Torokhov <dtor@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
new file mode 100644
index 000000000000..1123111ba1bf
--- /dev/null
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -0,0 +1,3420 @@
+/*
+ * VMware VMCI Driver
+ *
+ * Copyright (C) 2012 VMware, Inc. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation version 2 and no later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ */
+
+#include <linux/device-mapper.h>
+#include <linux/vmw_vmci_defs.h>
+#include <linux/vmw_vmci_api.h>
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/mutex.h>
+#include <linux/socket.h>
+#include <linux/wait.h>
+
+#include "vmci_handle_array.h"
+#include "vmci_queue_pair.h"
+#include "vmci_datagram.h"
+#include "vmci_resource.h"
+#include "vmci_context.h"
+#include "vmci_driver.h"
+#include "vmci_event.h"
+#include "vmci_route.h"
+
+/*
+ * In the following, we will distinguish between two kinds of VMX processes -
+ * the ones with versions lower than VMCI_VERSION_NOVMVM that use specialized
+ * VMCI page files in the VMX and supporting VM to VM communication and the
+ * newer ones that use the guest memory directly. We will in the following
+ * refer to the older VMX versions as old-style VMX'en, and the newer ones as
+ * new-style VMX'en.
+ *
+ * The state transition datagram is as follows (the VMCIQPB_ prefix has been
+ * removed for readability) - see below for more details on the transtions:
+ *
+ * -------------- NEW -------------
+ * | |
+ * \_/ \_/
+ * CREATED_NO_MEM <-----------------> CREATED_MEM
+ * | | |
+ * | o-----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * ATTACHED_NO_MEM <----------------> ATTACHED_MEM
+ * | | |
+ * | o----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * SHUTDOWN_NO_MEM <----------------> SHUTDOWN_MEM
+ * | |
+ * | |
+ * -------------> gone <-------------
+ *
+ * In more detail. When a VMCI queue pair is first created, it will be in the
+ * VMCIQPB_NEW state. It will then move into one of the following states:
+ *
+ * - VMCIQPB_CREATED_NO_MEM: this state indicates that either:
+ *
+ * - the created was performed by a host endpoint, in which case there is
+ * no backing memory yet.
+ *
+ * - the create was initiated by an old-style VMX, that uses
+ * vmci_qp_broker_set_page_store to specify the UVAs of the queue pair at
+ * a later point in time. This state can be distinguished from the one
+ * above by the context ID of the creator. A host side is not allowed to
+ * attach until the page store has been set.
+ *
+ * - VMCIQPB_CREATED_MEM: this state is the result when the queue pair
+ * is created by a VMX using the queue pair device backend that
+ * sets the UVAs of the queue pair immediately and stores the
+ * information for later attachers. At this point, it is ready for
+ * the host side to attach to it.
+ *
+ * Once the queue pair is in one of the created states (with the exception of
+ * the case mentioned for older VMX'en above), it is possible to attach to the
+ * queue pair. Again we have two new states possible:
+ *
+ * - VMCIQPB_ATTACHED_MEM: this state can be reached through the following
+ * paths:
+ *
+ * - from VMCIQPB_CREATED_NO_MEM when a new-style VMX allocates a queue
+ * pair, and attaches to a queue pair previously created by the host side.
+ *
+ * - from VMCIQPB_CREATED_MEM when the host side attaches to a queue pair
+ * already created by a guest.
+ *
+ * - from VMCIQPB_ATTACHED_NO_MEM, when an old-style VMX calls
+ * vmci_qp_broker_set_page_store (see below).
+ *
+ * - VMCIQPB_ATTACHED_NO_MEM: If the queue pair already was in the
+ * VMCIQPB_CREATED_NO_MEM due to a host side create, an old-style VMX will
+ * bring the queue pair into this state. Once vmci_qp_broker_set_page_store
+ * is called to register the user memory, the VMCIQPB_ATTACH_MEM state
+ * will be entered.
+ *
+ * From the attached queue pair, the queue pair can enter the shutdown states
+ * when either side of the queue pair detaches. If the guest side detaches
+ * first, the queue pair will enter the VMCIQPB_SHUTDOWN_NO_MEM state, where
+ * the content of the queue pair will no longer be available. If the host
+ * side detaches first, the queue pair will either enter the
+ * VMCIQPB_SHUTDOWN_MEM, if the guest memory is currently mapped, or
+ * VMCIQPB_SHUTDOWN_NO_MEM, if the guest memory is not mapped
+ * (e.g., the host detaches while a guest is stunned).
+ *
+ * New-style VMX'en will also unmap guest memory, if the guest is
+ * quiesced, e.g., during a snapshot operation. In that case, the guest
+ * memory will no longer be available, and the queue pair will transition from
+ * *_MEM state to a *_NO_MEM state. The VMX may later map the memory once more,
+ * in which case the queue pair will transition from the *_NO_MEM state at that
+ * point back to the *_MEM state. Note that the *_NO_MEM state may have changed,
+ * since the peer may have either attached or detached in the meantime. The
+ * values are laid out such that ++ on a state will move from a *_NO_MEM to a
+ * *_MEM state, and vice versa.
+ */
+
+/*
+ * VMCIMemcpy{To,From}QueueFunc() prototypes. Functions of these
+ * types are passed around to enqueue and dequeue routines. Note that
+ * often the functions passed are simply wrappers around memcpy
+ * itself.
+ *
+ * Note: In order for the memcpy typedefs to be compatible with the VMKernel,
+ * there's an unused last parameter for the hosted side. In
+ * ESX, that parameter holds a buffer type.
+ */
+typedef int vmci_memcpy_to_queue_func(struct vmci_queue *queue,
+ u64 queue_offset, const void *src,
+ size_t src_offset, size_t size);
+typedef int vmci_memcpy_from_queue_func(void *dest, size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size);
+
+/* The Kernel specific component of the struct vmci_queue structure. */
+struct vmci_queue_kern_if {
+ struct page **page;
+ struct page **header_page;
+ void *va;
+ struct mutex __mutex; /* Protects the queue. */
+ struct mutex *mutex; /* Shared by producer and consumer queues. */
+ bool host;
+ size_t num_pages;
+ bool mapped;
+};
+
+/*
+ * This structure is opaque to the clients.
+ */
+struct vmci_qp {
+ struct vmci_handle handle;
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ u64 produce_q_size;
+ u64 consume_q_size;
+ u32 peer;
+ u32 flags;
+ u32 priv_flags;
+ bool guest_endpoint;
+ unsigned int blocked;
+ unsigned int generation;
+ wait_queue_head_t event;
+};
+
+enum qp_broker_state {
+ VMCIQPB_NEW,
+ VMCIQPB_CREATED_NO_MEM,
+ VMCIQPB_CREATED_MEM,
+ VMCIQPB_ATTACHED_NO_MEM,
+ VMCIQPB_ATTACHED_MEM,
+ VMCIQPB_SHUTDOWN_NO_MEM,
+ VMCIQPB_SHUTDOWN_MEM,
+ VMCIQPB_GONE
+};
+
+#define QPBROKERSTATE_HAS_MEM(_qpb) (_qpb->state == VMCIQPB_CREATED_MEM || \
+ _qpb->state == VMCIQPB_ATTACHED_MEM || \
+ _qpb->state == VMCIQPB_SHUTDOWN_MEM)
+
+/*
+ * In the queue pair broker, we always use the guest point of view for
+ * the produce and consume queue values and references, e.g., the
+ * produce queue size stored is the guests produce queue size. The
+ * host endpoint will need to swap these around. The only exception is
+ * the local queue pairs on the host, in which case the host endpoint
+ * that creates the queue pair will have the right orientation, and
+ * the attaching host endpoint will need to swap.
+ */
+struct qp_entry {
+ struct list_head list_item;
+ struct vmci_handle handle;
+ u32 peer;
+ u32 flags;
+ u64 produce_size;
+ u64 consume_size;
+ u32 ref_count;
+};
+
+struct qp_broker_entry {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u32 create_id;
+ u32 attach_id;
+ enum qp_broker_state state;
+ bool require_trusted_attach;
+ bool created_by_trusted;
+ bool vmci_page_files; /* Created by VMX using VMCI page files */
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ struct vmci_queue_header saved_produce_q;
+ struct vmci_queue_header saved_consume_q;
+ vmci_event_release_cb wakeup_cb;
+ void *client_data;
+ void *local_mem; /* Kernel memory for local queue pair */
+};
+
+struct qp_guest_endpoint {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u64 num_ppns;
+ void *produce_q;
+ void *consume_q;
+ struct PPNSet ppn_set;
+};
+
+struct qp_list {
+ struct list_head head;
+ struct mutex mutex; /* Protect queue list. */
+};
+
+static struct qp_list qp_broker_list = {
+ .head = LIST_HEAD_INIT(qp_broker_list.head),
+ .mutex = __MUTEX_INITIALIZER(qp_broker_list.mutex),
+};
+
+static struct qp_list qp_guest_endpoints = {
+ .head = LIST_HEAD_INIT(qp_guest_endpoints.head),
+ .mutex = __MUTEX_INITIALIZER(qp_guest_endpoints.mutex),
+};
+
+#define INVALID_VMCI_GUEST_MEM_ID 0
+#define QPE_NUM_PAGES(_QPE) ((u32) \
+ (dm_div_up(_QPE.produce_size, PAGE_SIZE) + \
+ dm_div_up(_QPE.consume_size, PAGE_SIZE) + 2))
+
+
+/*
+ * Frees kernel VA space for a given queue and its queue header, and
+ * frees physical data pages.
+ */
+static void qp_free_queue(void *q, u64 size)
+{
+ struct vmci_queue *queue = q;
+
+ if (queue) {
+ u64 i = dm_div_up(size, PAGE_SIZE);
+
+ if (queue->kernel_if->mapped) {
+ vunmap(queue->kernel_if->va);
+ queue->kernel_if->va = NULL;
+ }
+
+ while (i)
+ __free_page(queue->kernel_if->page[--i]);
+
+ vfree(queue->q_header);
+ }
+}
+
+/*
+ * Allocates kernel VA space of specified size, plus space for the
+ * queue structure/kernel interface and the queue header. Allocates
+ * physical pages for the queue data pages.
+ *
+ * PAGE m: struct vmci_queue_header (struct vmci_queue->q_header)
+ * PAGE m+1: struct vmci_queue
+ * PAGE m+1+q: struct vmci_queue_kern_if (struct vmci_queue->kernel_if)
+ * PAGE n-size: Data pages (struct vmci_queue->kernel_if->page[])
+ */
+static void *qp_alloc_queue(u64 size, u32 flags)
+{
+ u64 i;
+ struct vmci_queue *queue;
+ struct vmci_queue_header *q_header;
+ const u64 num_data_pages = dm_div_up(size, PAGE_SIZE);
+ const uint queue_size =
+ PAGE_SIZE +
+ sizeof(*queue) + sizeof(*(queue->kernel_if)) +
+ num_data_pages * sizeof(*(queue->kernel_if->page));
+
+ q_header = vmalloc(queue_size);
+ if (!q_header)
+ return NULL;
+
+ queue = (void *)q_header + PAGE_SIZE;
+ queue->q_header = q_header;
+ queue->saved_header = NULL;
+ queue->kernel_if = (struct vmci_queue_kern_if *)(queue + 1);
+ queue->kernel_if->header_page = NULL; /* Unused in guest. */
+ queue->kernel_if->page = (struct page **)(queue->kernel_if + 1);
+ queue->kernel_if->host = false;
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+
+ for (i = 0; i < num_data_pages; i++) {
+ queue->kernel_if->page[i] = alloc_pages(GFP_KERNEL, 0);
+ if (!queue->kernel_if->page[i])
+ goto fail;
+ }
+
+ if (vmci_qp_pinned(flags)) {
+ queue->kernel_if->va =
+ vmap(queue->kernel_if->page, num_data_pages, VM_MAP,
+ PAGE_KERNEL);
+ if (!queue->kernel_if->va)
+ goto fail;
+
+ queue->kernel_if->mapped = true;
+ }
+
+ return (void *)queue;
+
+ fail:
+ qp_free_queue(queue, i * PAGE_SIZE);
+ return NULL;
+}
+
+/*
+ * Copies from a given buffer or iovector to a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up from this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)src;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_fromiovec((u8 *)va + page_offset,
+ iov, to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)va + page_offset,
+ (u8 *)src + bytes_copied, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Copies to a given buffer or iovector from a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_from_queue(void *dest,
+ const struct vmci_queue *queue,
+ u64 queue_offset,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)dest;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_toiovec(iov, (u8 *)va + page_offset,
+ to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)dest + bytes_copied,
+ (u8 *)va + page_offset, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Allocates two list of PPNs --- one for the pages in the produce queue,
+ * and the other for the pages in the consume queue. Intializes the list
+ * of PPNs with the page frame numbers of the KVA for the two queues (and
+ * the queue headers).
+ */
+static int qp_alloc_ppn_set(void *prod_q,
+ u64 num_produce_pages,
+ void *cons_q,
+ u64 num_consume_pages, struct PPNSet *ppn_set)
+{
+ u32 *produce_ppns;
+ u32 *consume_ppns;
+ struct vmci_queue *produce_q = prod_q;
+ struct vmci_queue *consume_q = cons_q;
+ u64 i;
+
+ if (!produce_q || !num_produce_pages || !consume_q ||
+ !num_consume_pages || !ppn_set)
+ return VMCI_ERROR_INVALID_ARGS;
+
+ if (ppn_set->initialized)
+ return VMCI_ERROR_ALREADY_EXISTS;
+
+ produce_ppns =
+ kmalloc(num_produce_pages * sizeof(*produce_ppns), GFP_KERNEL);
+ if (!produce_ppns)
+ return VMCI_ERROR_NO_MEM;
+
+ consume_ppns =
+ kmalloc(num_consume_pages * sizeof(*consume_ppns), GFP_KERNEL);
+ if (!consume_ppns) {
+ kfree(produce_ppns);
+ return VMCI_ERROR_NO_MEM;
+ }
+
+ produce_ppns[0] = page_to_pfn(vmalloc_to_page(produce_q->q_header));
+ for (i = 1; i < num_produce_pages; i++) {
+ unsigned long pfn;
+
+ produce_ppns[i] =
+ page_to_pfn(produce_q->kernel_if->page[i - 1]);
+ pfn = produce_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*produce_ppns)
+ && pfn != produce_ppns[i])
+ goto ppn_error;
+ }
+
+ consume_ppns[0] = page_to_pfn(vmalloc_to_page(consume_q->q_header));
+ for (i = 1; i < num_consume_pages; i++) {
+ unsigned long pfn;
+
+ consume_ppns[i] =
+ page_to_pfn(consume_q->kernel_if->page[i - 1]);
+ pfn = consume_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*consume_ppns)
+ && pfn != consume_ppns[i])
+ goto ppn_error;
+ }
+
+ ppn_set->num_produce_pages = num_produce_pages;
+ ppn_set->num_consume_pages = num_consume_pages;
+ ppn_set->produce_ppns = produce_ppns;
+ ppn_set->consume_ppns = consume_ppns;
+ ppn_set->initialized = true;
+ return VMCI_SUCCESS;
+
+ ppn_error:
+ kfree(produce_ppns);
+ kfree(consume_ppns);
+ return VMCI_ERROR_INVALID_ARGS;
+}
+
+/*
+ * Frees the two list of PPNs for a queue pair.
+ */
+static void qp_free_ppn_set(struct PPNSet *ppn_set)
+{
+ if (ppn_set->initialized) {
+ /* Do not call these functions on NULL inputs. */
+ kfree(ppn_set->produce_ppns);
+ kfree(ppn_set->consume_ppns);
+ }
+ memset(ppn_set, 0, sizeof(*ppn_set));
+}
+
+/*
+ * Populates the list of PPNs in the hypercall structure with the PPNS
+ * of the produce queue and the consume queue.
+ */
+static int qp_populate_ppn_set(u8 *call_buf, const struct PPNSet *ppn_set)
+{
+ memcpy(call_buf, ppn_set->produce_ppns,
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns));
+ memcpy(call_buf +
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns),
+ ppn_set->consume_ppns,
+ ppn_set->num_consume_pages * sizeof(*ppn_set->consume_ppns));
+
+ return VMCI_SUCCESS;
+}
+
+static int qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src, size_t src_offset, size_t size)
+{
+ return __qp_memcpy_to_queue(queue, queue_offset,
+ (u8 *)src + src_offset, size, false);
+}
+
+static int qp_memcpy_from_queue(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ return __qp_memcpy_from_queue((u8 *)dest + dest_offset,
+ queue, queue_offset, size, false);
+}
+
+/*
+ * Copies from a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_to_queue_iov(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t src_offset, size_t size)
+{
+
+ /*
+ * We ignore src_offset because src is really a struct iovec * and will
+ * maintain offset internally.
+ */
+ return __qp_memcpy_to_queue(queue, queue_offset, src, size, true);
+}
+
+/*
+ * Copies to a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_from_queue_iov(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ /*
+ * We ignore dest_offset because dest is really a struct iovec * and
+ * will maintain offset internally.
+ */
+ return __qp_memcpy_from_queue(dest, queue, queue_offset, size, true);
+}
+
+/*
+ * Allocates kernel VA space of specified size plus space for the queue
+ * and kernel interface. This is different from the guest queue allocator,
+ * because we do not allocate our own queue header/data pages here but
+ * share those of the guest.
+ */
+static struct vmci_queue *qp_host_alloc_queue(u64 size)
+{
+ struct vmci_queue *queue;
+ const size_t num_pages = dm_div_up(size, PAGE_SIZE) + 1;
+ const size_t queue_size = sizeof(*queue) + sizeof(*(queue->kernel_if));
+ const size_t queue_page_size =
+ num_pages * sizeof(*queue->kernel_if->page);
+
+ queue = kzalloc(queue_size + queue_page_size, GFP_KERNEL);
+ if (queue) {
+ queue->q_header = NULL;
+ queue->saved_header = NULL;
+ queue->kernel_if =
+ (struct vmci_queue_kern_if *)((u8 *)queue +
+ sizeof(*queue));
+ queue->kernel_if->host = true;
+ queue->kernel_if->mutex = NULL;
+ queue->kernel_if->num_pages = num_pages;
+ queue->kernel_if->header_page =
+ (struct page **)((u8 *)queue + queue_size);
+ queue->kernel_if->page = &queue->kernel_if->header_page[1];
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+ }
+
+ return queue;
+}
+
+/*
+ * Frees kernel memory for a given queue (header plus translation
+ * structure).
+ */
+static void qp_host_free_queue(struct vmci_queue *queue, u64 queue_size)
+{
+ kfree(queue);
+}
+
+/*
+ * Initialize the mutex for the pair of queues. This mutex is used to
+ * protect the q_header and the buffer from changing out from under any
+ * users of either queue. Of course, it's only any good if the mutexes
+ * are actually acquired. Queue structure must lie on non-paged memory
+ * or we cannot guarantee access to the mutex.
+ */
+static void qp_init_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ /*
+ * Only the host queue has shared state - the guest queues do not
+ * need to synchronize access using a queue mutex.
+ */
+
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ consume_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ mutex_init(produce_q->kernel_if->mutex);
+ }
+}
+
+/*
+ * Cleans up the mutex for the pair of queues.
+ */
+static void qp_cleanup_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = NULL;
+ consume_q->kernel_if->mutex = NULL;
+ }
+}
+
+/*
+ * Acquire the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_acquire_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_lock(queue->kernel_if->mutex);
+}
+
+/*
+ * Release the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_release_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_unlock(queue->kernel_if->mutex);
+}
+
+/*
+ * Helper function to release pages in the PageStoreAttachInfo
+ * previously obtained using get_user_pages.
+ */
+static void qp_release_pages(struct page **pages,
+ u64 num_pages, bool dirty)
+{
+ int i;
+
+ for (i = 0; i < num_pages; i++) {
+ if (dirty)
+ set_page_dirty(pages[i]);
+
+ page_cache_release(pages[i]);
+ pages[i] = NULL;
+ }
+}
+
+/*
+ * Lock the user pages referenced by the {produce,consume}Buffer
+ * struct into memory and populate the {produce,consume}Pages
+ * arrays in the attach structure with them.
+ */
+static int qp_host_get_user_memory(u64 produce_uva,
+ u64 consume_uva,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int retval;
+ int err = VMCI_SUCCESS;
+
+ down_write(¤t->mm->mmap_sem);
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) produce_uva,
+ produce_q->kernel_if->num_pages,
+ 1, 0, produce_q->kernel_if->header_page, NULL);
+ if (retval < produce_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(produce) failed (retval=%d)", retval);
+ qp_release_pages(produce_q->kernel_if->header_page, retval,
+ false);
+ err = VMCI_ERROR_NO_MEM;
+ goto out;
+ }
+
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) consume_uva,
+ consume_q->kernel_if->num_pages,
+ 1, 0, consume_q->kernel_if->header_page, NULL);
+ if (retval < consume_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(consume) failed (retval=%d)", retval);
+ qp_release_pages(consume_q->kernel_if->header_page, retval,
+ false);
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, false);
+ err = VMCI_ERROR_NO_MEM;
+ }
+
+ out:
+ up_write(¤t->mm->mmap_sem);
+
+ return err;
+}
+
+/*
+ * Registers the specification of the user pages used for backing a queue
+ * pair. Enough information to map in pages is stored in the OS specific
+ * part of the struct vmci_queue structure.
+ */
+static int qp_host_register_user_memory(struct vmci_qp_page_store *page_store,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ u64 produce_uva;
+ u64 consume_uva;
+
+ /*
+ * The new style and the old style mapping only differs in
+ * that we either get a single or two UVAs, so we split the
+ * single UVA range at the appropriate spot.
+ */
+ produce_uva = page_store->pages;
+ consume_uva = page_store->pages +
+ produce_q->kernel_if->num_pages * PAGE_SIZE;
+ return qp_host_get_user_memory(produce_uva, consume_uva, produce_q,
+ consume_q);
+}
+
+/*
+ * Releases and removes the references to user pages stored in the attach
+ * struct. Pages are released from the page cache and may become
+ * swappable again.
+ */
+static void qp_host_unregister_user_memory(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, true);
+ memset(produce_q->kernel_if->header_page, 0,
+ sizeof(*produce_q->kernel_if->header_page) *
+ produce_q->kernel_if->num_pages);
+ qp_release_pages(consume_q->kernel_if->header_page,
+ consume_q->kernel_if->num_pages, true);
+ memset(consume_q->kernel_if->header_page, 0,
+ sizeof(*consume_q->kernel_if->header_page) *
+ consume_q->kernel_if->num_pages);
+}
+
+/*
+ * Once qp_host_register_user_memory has been performed on a
+ * queue, the queue pair headers can be mapped into the
+ * kernel. Once mapped, they must be unmapped with
+ * qp_host_unmap_queues prior to calling
+ * qp_host_unregister_user_memory.
+ * Pages are pinned.
+ */
+static int qp_host_map_queues(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int result;
+
+ if (!produce_q->q_header || !consume_q->q_header) {
+ struct page *headers[2];
+
+ if (produce_q->q_header != consume_q->q_header)
+ return VMCI_ERROR_QUEUEPAIR_MISMATCH;
+
+ if (produce_q->kernel_if->header_page == NULL ||
+ *produce_q->kernel_if->header_page == NULL)
+ return VMCI_ERROR_UNAVAILABLE;
+
+ headers[0] = *produce_q->kernel_if->header_page;
+ headers[1] = *consume_q->kernel_if->header_page;
+
+ produce_q->q_header = vmap(headers, 2, VM_MAP, PAGE_KERNEL);
+ if (produce_q->q_header != NULL) {
+ consume_q->q_header =
+ (struct vmci_queue_header *)((u8 *)
+ produce_q->q_header +
+ PAGE_SIZE);
+ result = VMCI_SUCCESS;
+ } else {
+ pr_warn("vmap failed\n");
+ result = VMCI_ERROR_NO_MEM;
+ }
+ } else {
+ result = VMCI_SUCCESS;
+ }
+
+ return result;
+}
+
+/*
+ * Unmaps previously mapped queue pair headers from the kernel.
+ * Pages are unpinned.
+ */
+static int qp_host_unmap_queues(u32 gid,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->q_header) {
+ if (produce_q->q_header < consume_q->q_header)
+ vunmap(produce_q->q_header);
+ else
+ vunmap(consume_q->q_header);
+
+ produce_q->q_header = NULL;
+ consume_q->q_header = NULL;
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle. Assumes
+ * that the list is locked.
+ */
+static struct qp_entry *qp_list_find(struct qp_list *qp_list,
+ struct vmci_handle handle)
+{
+ struct qp_entry *entry;
+
+ if (vmci_handle_is_invalid(handle))
+ return NULL;
+
+ list_for_each_entry(entry, &qp_list->head, list_item) {
+ if (vmci_handle_is_equal(entry->handle, handle))
+ return entry;
+ }
+
+ return NULL;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_guest_endpoint *
+qp_guest_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_guest_endpoint *entry;
+ struct qp_entry *qp = qp_list_find(&qp_guest_endpoints, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_guest_endpoint, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_broker_entry *
+qp_broker_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_broker_entry *entry;
+ struct qp_entry *qp = qp_list_find(&qp_broker_list, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_broker_entry, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Dispatches a queue pair event message directly into the local event
+ * queue.
+ */
+static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
+{
+ u32 context_id = vmci_get_context_id();
+ struct vmci_event_qp ev;
+
+ ev.msg.hdr.dst = vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
+ ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID);
+ ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
+ ev.msg.event_data.event =
+ attach ? VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
+ ev.payload.peer_id = context_id;
+ ev.payload.handle = handle;
+
+ return vmci_event_dispatch(&ev.msg.hdr);
+}
+
+/*
+ * Allocates and initializes a qp_guest_endpoint structure.
+ * Allocates a queue_pair rid (and handle) iff the given entry has
+ * an invalid handle. 0 through VMCI_RESERVED_RESOURCE_ID_MAX
+ * are reserved handles. Assumes that the QP list mutex is held
+ * by the caller.
+ */
+static struct qp_guest_endpoint *
+qp_guest_endpoint_create(struct vmci_handle handle,
+ u32 peer,
+ u32 flags,
+ u64 produce_size,
+ u64 consume_size,
+ void *produce_q,
+ void *consume_q)
+{
+ int result;
+ struct qp_guest_endpoint *entry;
+ /* One page each for the queue headers. */
+ const u64 num_ppns = dm_div_up(produce_size, PAGE_SIZE) +
+ dm_div_up(consume_size, PAGE_SIZE) + 2;
+
+ if (vmci_handle_is_invalid(handle)) {
+ u32 context_id = vmci_get_context_id();
+
+ handle = vmci_make_handle(context_id, VMCI_INVALID_ID);
+ }
+
+ entry = kzalloc(sizeof(*entry), GFP_KERNEL);
+ if (entry) {
+ entry->qp.peer = peer;
+ entry->qp.flags = flags;
+ entry->qp.produce_size = produce_size;
+ entry->qp.consume_size = consume_size;
+ entry->qp.ref_count = 0;
]
]
|
| 146/2 |
2026/05/09 22:54 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 22024
output: 19
thoughts: 36
Thoughts: Okay, here's my take on those thoughts, tailored for an expert audience:
**Investigating a Truncated Output**
Damn, it looks like I'm dealing with a truncated output, which is always frustrating. My first instinct is to dig into the code directly. Given the context, and what I'm seeing, I'm going to jump straight to searching for instances of `qp_notify_peer` within the commit `06164d2b72aa`. I'm hoping that specific commit will give me a localized view of where the problem might be originating or the related functionality that I can scrutinize. This approach should quickly reveal whether a bug exists in the recent code or if a change has occurred that has triggered the truncation. I'll need to look at the surrounding calls and the data being passed in/out. I'm assuming that this function is related to the data transfer and potentially some kind of notification mechanism that is used with the data, and since the data is truncated, this is the area I want to focus on.
|
| 147/2 |
2026/05/09 22:54 |
tool |
grepper |
0m
Args: map[Expression:qp_notify_peer]
Results: map[Output:drivers/misc/vmw_vmci/vmci_queue_pair.c=838=qp_broker_handle_to_entry(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-851- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:852:static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
drivers/misc/vmw_vmci/vmci_queue_pair.c-853-{
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1023=static int qp_detatch_guest_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1040- if (entry->qp.ref_count > 1) {
drivers/misc/vmw_vmci/vmci_queue_pair.c:1041: result = qp_notify_peer_local(false, handle);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1042- /*
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1093=static int qp_alloc_guest_work(struct vmci_handle *handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1140- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:1141: result = qp_notify_peer_local(true, *handle);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1142- if (result < VMCI_SUCCESS)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1282=static int qp_broker_create(struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1450- */
drivers/misc/vmw_vmci/vmci_queue_pair.c:1451:static int qp_notify_peer(bool attach,
drivers/misc/vmw_vmci/vmci_queue_pair.c-1452- struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1511=static int qp_broker_attach(struct qp_broker_entry *entry,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1663- result =
drivers/misc/vmw_vmci/vmci_queue_pair.c:1664: qp_notify_peer(true, entry->qp.handle, context_id,
drivers/misc/vmw_vmci/vmci_queue_pair.c-1665- entry->create_id);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1963=int vmci_qp_broker_set_page_store(struct vmci_handle handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-2038- result =
drivers/misc/vmw_vmci/vmci_queue_pair.c:2039: qp_notify_peer(true, handle, context_id, entry->create_id);
drivers/misc/vmw_vmci/vmci_queue_pair.c-2040- if (result < VMCI_SUCCESS) {
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=2082=int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-2187- } else {
drivers/misc/vmw_vmci/vmci_queue_pair.c:2188: qp_notify_peer(false, handle, context_id, peer_id);
drivers/misc/vmw_vmci/vmci_queue_pair.c-2189- if (context_id == VMCI_HOST_CONTEXT_ID &&
]
|
| 148/2 |
2026/05/09 22:54 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 23384
output: 20
thoughts: 20
Thoughts: Here's a summary of my thought process, as requested:
**Navigating the `qp_broker_attach` Function**
Okay, so I need to understand what's happening within `qp_broker_attach`. My first instinct is to check how `vmci_ctx_put` is being used within that function. I need to see if there's anything unusual or potentially problematic happening around that specific call. Specifically, I need to know how the context is being handled before and after the `put` operation. Are there any resource dependencies, error checks, or sequencing concerns related to `vmci_ctx_put` within this section of code? That seems like a good starting point for my investigation.
|
| 149/2 |
2026/05/09 22:54 |
tool |
grepper |
0m
Args: map[Expression:vmci_ctx_put]
Results: map[Output:drivers/misc/vmw_vmci/vmci_context.c=188=void vmci_ctx_destroy(struct vmci_ctx *context)
--
drivers/misc/vmw_vmci/vmci_context.c-194-
drivers/misc/vmw_vmci/vmci_context.c:195: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-196-}
--
drivers/misc/vmw_vmci/vmci_context.c=276=int vmci_ctx_enqueue_datagram(u32 cid, struct vmci_datagram *dg)
--
drivers/misc/vmw_vmci/vmci_context.c-299- pr_warn("Failed to allocate memory for datagram\n");
drivers/misc/vmw_vmci/vmci_context.c:300: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-301- return VMCI_ERROR_NO_MEM;
--
drivers/misc/vmw_vmci/vmci_context.c-327- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:328: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-329- kfree(dq_entry);
--
drivers/misc/vmw_vmci/vmci_context.c-339- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:340: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-341-
--
drivers/misc/vmw_vmci/vmci_context.c=404=static void ctx_free_ctx(struct kref *kref)
--
drivers/misc/vmw_vmci/vmci_context.c-474- */
drivers/misc/vmw_vmci/vmci_context.c:475:void vmci_ctx_put(struct vmci_ctx *context)
drivers/misc/vmw_vmci/vmci_context.c-476-{
--
drivers/misc/vmw_vmci/vmci_context.c=578=int vmci_ctx_add_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-636- out:
drivers/misc/vmw_vmci/vmci_context.c:637: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-638- return result;
--
drivers/misc/vmw_vmci/vmci_context.c=645=int vmci_ctx_remove_notification(u32 context_id, u32 remote_cid)
--
drivers/misc/vmw_vmci/vmci_context.c-671-
drivers/misc/vmw_vmci/vmci_context.c:672: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-673-
--
drivers/misc/vmw_vmci/vmci_context.c=744=int vmci_ctx_get_chkpt_state(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-784- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:785: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-786-
--
drivers/misc/vmw_vmci/vmci_context.c=837=int vmci_ctx_rcv_notifications_get(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-860- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:861: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-862-
--
drivers/misc/vmw_vmci/vmci_context.c=872=void vmci_ctx_rcv_notifications_release(u32 context_id,
--
drivers/misc/vmw_vmci/vmci_context.c-907- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:908: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-909-
--
drivers/misc/vmw_vmci/vmci_context.c=921=int vmci_ctx_dbell_create(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-940- spin_unlock(&context->lock);
drivers/misc/vmw_vmci/vmci_context.c:941: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-942-
--
drivers/misc/vmw_vmci/vmci_context.c=950=int vmci_ctx_dbell_destroy(u32 context_id, struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_context.c-967-
drivers/misc/vmw_vmci/vmci_context.c:968: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-969-
--
drivers/misc/vmw_vmci/vmci_context.c=984=int vmci_ctx_notify_dbell(u32 src_cid,
--
drivers/misc/vmw_vmci/vmci_context.c-1056- out:
drivers/misc/vmw_vmci/vmci_context.c:1057: vmci_ctx_put(dst_context);
drivers/misc/vmw_vmci/vmci_context.c-1058-
--
drivers/misc/vmw_vmci/vmci_context.c=1122=u32 vmci_context_get_priv_flags(u32 context_id)
--
drivers/misc/vmw_vmci/vmci_context.c-1132- flags = context->priv_flags;
drivers/misc/vmw_vmci/vmci_context.c:1133: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1134- return flags;
--
drivers/misc/vmw_vmci/vmci_context.c=1147=bool vmci_is_context_owner(u32 context_id, kuid_t uid)
--
drivers/misc/vmw_vmci/vmci_context.c-1155- is_owner = uid_eq(context->cred->uid, uid);
drivers/misc/vmw_vmci/vmci_context.c:1156: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_context.c-1157- }
--
drivers/misc/vmw_vmci/vmci_context.h=135=struct vmci_ctx *vmci_ctx_get(u32 cid);
drivers/misc/vmw_vmci/vmci_context.h:136:void vmci_ctx_put(struct vmci_ctx *context);
drivers/misc/vmw_vmci/vmci_context.h-137-bool vmci_ctx_exists(u32 cid);
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1511=static int qp_broker_attach(struct qp_broker_entry *entry,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1587- supports_host_qp = vmci_ctx_supports_host_qp(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c:1588: vmci_ctx_put(create_context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1589-
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1770=static int qp_alloc_host_work(struct vmci_handle *handle,
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1819- }
drivers/misc/vmw_vmci/vmci_queue_pair.c:1820: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1821- return result;
--
drivers/misc/vmw_vmci/vmci_queue_pair.c=1862=static int qp_detatch_host_work(struct vmci_handle handle)
--
drivers/misc/vmw_vmci/vmci_queue_pair.c-1870-
drivers/misc/vmw_vmci/vmci_queue_pair.c:1871: vmci_ctx_put(context);
drivers/misc/vmw_vmci/vmci_queue_pair.c-1872- return result;
]
|
| 150/2 |
2026/05/09 22:54 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 26036
output: 53
thoughts: 256
Thoughts: **Analyzing VMCI Queue Pair Broker Interactions**
Okay, so I'm focusing on the interaction of these VMCI components. My initial observation is that `vmci_ctx_put` is invoked in `qp_broker_attach` at line 1588. Also, `qp_notify_peer` gets called in a few places: `qp_broker_attach` at line 1664, `vmci_qp_broker_set_page_store` at line 2039, and `vmci_qp_broker_detach` at line 2188.
Now, I need to verify something specific related to a recent commit. I need to re-examine commit `06164d2b72aa752ce4633184b3e0d97601017135`. I'm going to look for whether `qp_notify_peer` is present within `qp_broker_attach`, `vmci_qp_broker_set_page_store`, and `vmci_qp_broker_detach` and, importantly, whether these calls are protected by the `qp_broker_list.mutex`. This is a critical point for synchronization and potential race conditions.
To get a clear picture of what's going on, I'll start by specifically scrutinizing the `vmci_qp_broker_detach` function within that particular commit. This will give me a good starting point to assess the locking and sequencing in this crucial area of the code.
|
| 151/2 |
2026/05/09 22:54 |
tool |
git-show |
0m
Args: map[Commit:06164d2b72aa752ce4633184b3e0d97601017135]
Results: map[Output:
Full output is too long, showing 1000 out of 3636 lines.
[commit 06164d2b72aa752ce4633184b3e0d97601017135
Author: George Zhang <georgezhang@vmware.com>
Date: Tue Jan 8 15:54:54 2013 -0800
VMCI: queue pairs implementation.
VMCI queue pairs allow for bi-directional ordered communication between host and guests.
Signed-off-by: George Zhang <georgezhang@vmware.com>
Acked-by: Andy king <acking@vmware.com>
Acked-by: Dmitry Torokhov <dtor@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
new file mode 100644
index 000000000000..1123111ba1bf
--- /dev/null
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -0,0 +1,3420 @@
+/*
+ * VMware VMCI Driver
+ *
+ * Copyright (C) 2012 VMware, Inc. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation version 2 and no later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ */
+
+#include <linux/device-mapper.h>
+#include <linux/vmw_vmci_defs.h>
+#include <linux/vmw_vmci_api.h>
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/mutex.h>
+#include <linux/socket.h>
+#include <linux/wait.h>
+
+#include "vmci_handle_array.h"
+#include "vmci_queue_pair.h"
+#include "vmci_datagram.h"
+#include "vmci_resource.h"
+#include "vmci_context.h"
+#include "vmci_driver.h"
+#include "vmci_event.h"
+#include "vmci_route.h"
+
+/*
+ * In the following, we will distinguish between two kinds of VMX processes -
+ * the ones with versions lower than VMCI_VERSION_NOVMVM that use specialized
+ * VMCI page files in the VMX and supporting VM to VM communication and the
+ * newer ones that use the guest memory directly. We will in the following
+ * refer to the older VMX versions as old-style VMX'en, and the newer ones as
+ * new-style VMX'en.
+ *
+ * The state transition datagram is as follows (the VMCIQPB_ prefix has been
+ * removed for readability) - see below for more details on the transtions:
+ *
+ * -------------- NEW -------------
+ * | |
+ * \_/ \_/
+ * CREATED_NO_MEM <-----------------> CREATED_MEM
+ * | | |
+ * | o-----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * ATTACHED_NO_MEM <----------------> ATTACHED_MEM
+ * | | |
+ * | o----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * SHUTDOWN_NO_MEM <----------------> SHUTDOWN_MEM
+ * | |
+ * | |
+ * -------------> gone <-------------
+ *
+ * In more detail. When a VMCI queue pair is first created, it will be in the
+ * VMCIQPB_NEW state. It will then move into one of the following states:
+ *
+ * - VMCIQPB_CREATED_NO_MEM: this state indicates that either:
+ *
+ * - the created was performed by a host endpoint, in which case there is
+ * no backing memory yet.
+ *
+ * - the create was initiated by an old-style VMX, that uses
+ * vmci_qp_broker_set_page_store to specify the UVAs of the queue pair at
+ * a later point in time. This state can be distinguished from the one
+ * above by the context ID of the creator. A host side is not allowed to
+ * attach until the page store has been set.
+ *
+ * - VMCIQPB_CREATED_MEM: this state is the result when the queue pair
+ * is created by a VMX using the queue pair device backend that
+ * sets the UVAs of the queue pair immediately and stores the
+ * information for later attachers. At this point, it is ready for
+ * the host side to attach to it.
+ *
+ * Once the queue pair is in one of the created states (with the exception of
+ * the case mentioned for older VMX'en above), it is possible to attach to the
+ * queue pair. Again we have two new states possible:
+ *
+ * - VMCIQPB_ATTACHED_MEM: this state can be reached through the following
+ * paths:
+ *
+ * - from VMCIQPB_CREATED_NO_MEM when a new-style VMX allocates a queue
+ * pair, and attaches to a queue pair previously created by the host side.
+ *
+ * - from VMCIQPB_CREATED_MEM when the host side attaches to a queue pair
+ * already created by a guest.
+ *
+ * - from VMCIQPB_ATTACHED_NO_MEM, when an old-style VMX calls
+ * vmci_qp_broker_set_page_store (see below).
+ *
+ * - VMCIQPB_ATTACHED_NO_MEM: If the queue pair already was in the
+ * VMCIQPB_CREATED_NO_MEM due to a host side create, an old-style VMX will
+ * bring the queue pair into this state. Once vmci_qp_broker_set_page_store
+ * is called to register the user memory, the VMCIQPB_ATTACH_MEM state
+ * will be entered.
+ *
+ * From the attached queue pair, the queue pair can enter the shutdown states
+ * when either side of the queue pair detaches. If the guest side detaches
+ * first, the queue pair will enter the VMCIQPB_SHUTDOWN_NO_MEM state, where
+ * the content of the queue pair will no longer be available. If the host
+ * side detaches first, the queue pair will either enter the
+ * VMCIQPB_SHUTDOWN_MEM, if the guest memory is currently mapped, or
+ * VMCIQPB_SHUTDOWN_NO_MEM, if the guest memory is not mapped
+ * (e.g., the host detaches while a guest is stunned).
+ *
+ * New-style VMX'en will also unmap guest memory, if the guest is
+ * quiesced, e.g., during a snapshot operation. In that case, the guest
+ * memory will no longer be available, and the queue pair will transition from
+ * *_MEM state to a *_NO_MEM state. The VMX may later map the memory once more,
+ * in which case the queue pair will transition from the *_NO_MEM state at that
+ * point back to the *_MEM state. Note that the *_NO_MEM state may have changed,
+ * since the peer may have either attached or detached in the meantime. The
+ * values are laid out such that ++ on a state will move from a *_NO_MEM to a
+ * *_MEM state, and vice versa.
+ */
+
+/*
+ * VMCIMemcpy{To,From}QueueFunc() prototypes. Functions of these
+ * types are passed around to enqueue and dequeue routines. Note that
+ * often the functions passed are simply wrappers around memcpy
+ * itself.
+ *
+ * Note: In order for the memcpy typedefs to be compatible with the VMKernel,
+ * there's an unused last parameter for the hosted side. In
+ * ESX, that parameter holds a buffer type.
+ */
+typedef int vmci_memcpy_to_queue_func(struct vmci_queue *queue,
+ u64 queue_offset, const void *src,
+ size_t src_offset, size_t size);
+typedef int vmci_memcpy_from_queue_func(void *dest, size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size);
+
+/* The Kernel specific component of the struct vmci_queue structure. */
+struct vmci_queue_kern_if {
+ struct page **page;
+ struct page **header_page;
+ void *va;
+ struct mutex __mutex; /* Protects the queue. */
+ struct mutex *mutex; /* Shared by producer and consumer queues. */
+ bool host;
+ size_t num_pages;
+ bool mapped;
+};
+
+/*
+ * This structure is opaque to the clients.
+ */
+struct vmci_qp {
+ struct vmci_handle handle;
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ u64 produce_q_size;
+ u64 consume_q_size;
+ u32 peer;
+ u32 flags;
+ u32 priv_flags;
+ bool guest_endpoint;
+ unsigned int blocked;
+ unsigned int generation;
+ wait_queue_head_t event;
+};
+
+enum qp_broker_state {
+ VMCIQPB_NEW,
+ VMCIQPB_CREATED_NO_MEM,
+ VMCIQPB_CREATED_MEM,
+ VMCIQPB_ATTACHED_NO_MEM,
+ VMCIQPB_ATTACHED_MEM,
+ VMCIQPB_SHUTDOWN_NO_MEM,
+ VMCIQPB_SHUTDOWN_MEM,
+ VMCIQPB_GONE
+};
+
+#define QPBROKERSTATE_HAS_MEM(_qpb) (_qpb->state == VMCIQPB_CREATED_MEM || \
+ _qpb->state == VMCIQPB_ATTACHED_MEM || \
+ _qpb->state == VMCIQPB_SHUTDOWN_MEM)
+
+/*
+ * In the queue pair broker, we always use the guest point of view for
+ * the produce and consume queue values and references, e.g., the
+ * produce queue size stored is the guests produce queue size. The
+ * host endpoint will need to swap these around. The only exception is
+ * the local queue pairs on the host, in which case the host endpoint
+ * that creates the queue pair will have the right orientation, and
+ * the attaching host endpoint will need to swap.
+ */
+struct qp_entry {
+ struct list_head list_item;
+ struct vmci_handle handle;
+ u32 peer;
+ u32 flags;
+ u64 produce_size;
+ u64 consume_size;
+ u32 ref_count;
+};
+
+struct qp_broker_entry {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u32 create_id;
+ u32 attach_id;
+ enum qp_broker_state state;
+ bool require_trusted_attach;
+ bool created_by_trusted;
+ bool vmci_page_files; /* Created by VMX using VMCI page files */
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ struct vmci_queue_header saved_produce_q;
+ struct vmci_queue_header saved_consume_q;
+ vmci_event_release_cb wakeup_cb;
+ void *client_data;
+ void *local_mem; /* Kernel memory for local queue pair */
+};
+
+struct qp_guest_endpoint {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u64 num_ppns;
+ void *produce_q;
+ void *consume_q;
+ struct PPNSet ppn_set;
+};
+
+struct qp_list {
+ struct list_head head;
+ struct mutex mutex; /* Protect queue list. */
+};
+
+static struct qp_list qp_broker_list = {
+ .head = LIST_HEAD_INIT(qp_broker_list.head),
+ .mutex = __MUTEX_INITIALIZER(qp_broker_list.mutex),
+};
+
+static struct qp_list qp_guest_endpoints = {
+ .head = LIST_HEAD_INIT(qp_guest_endpoints.head),
+ .mutex = __MUTEX_INITIALIZER(qp_guest_endpoints.mutex),
+};
+
+#define INVALID_VMCI_GUEST_MEM_ID 0
+#define QPE_NUM_PAGES(_QPE) ((u32) \
+ (dm_div_up(_QPE.produce_size, PAGE_SIZE) + \
+ dm_div_up(_QPE.consume_size, PAGE_SIZE) + 2))
+
+
+/*
+ * Frees kernel VA space for a given queue and its queue header, and
+ * frees physical data pages.
+ */
+static void qp_free_queue(void *q, u64 size)
+{
+ struct vmci_queue *queue = q;
+
+ if (queue) {
+ u64 i = dm_div_up(size, PAGE_SIZE);
+
+ if (queue->kernel_if->mapped) {
+ vunmap(queue->kernel_if->va);
+ queue->kernel_if->va = NULL;
+ }
+
+ while (i)
+ __free_page(queue->kernel_if->page[--i]);
+
+ vfree(queue->q_header);
+ }
+}
+
+/*
+ * Allocates kernel VA space of specified size, plus space for the
+ * queue structure/kernel interface and the queue header. Allocates
+ * physical pages for the queue data pages.
+ *
+ * PAGE m: struct vmci_queue_header (struct vmci_queue->q_header)
+ * PAGE m+1: struct vmci_queue
+ * PAGE m+1+q: struct vmci_queue_kern_if (struct vmci_queue->kernel_if)
+ * PAGE n-size: Data pages (struct vmci_queue->kernel_if->page[])
+ */
+static void *qp_alloc_queue(u64 size, u32 flags)
+{
+ u64 i;
+ struct vmci_queue *queue;
+ struct vmci_queue_header *q_header;
+ const u64 num_data_pages = dm_div_up(size, PAGE_SIZE);
+ const uint queue_size =
+ PAGE_SIZE +
+ sizeof(*queue) + sizeof(*(queue->kernel_if)) +
+ num_data_pages * sizeof(*(queue->kernel_if->page));
+
+ q_header = vmalloc(queue_size);
+ if (!q_header)
+ return NULL;
+
+ queue = (void *)q_header + PAGE_SIZE;
+ queue->q_header = q_header;
+ queue->saved_header = NULL;
+ queue->kernel_if = (struct vmci_queue_kern_if *)(queue + 1);
+ queue->kernel_if->header_page = NULL; /* Unused in guest. */
+ queue->kernel_if->page = (struct page **)(queue->kernel_if + 1);
+ queue->kernel_if->host = false;
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+
+ for (i = 0; i < num_data_pages; i++) {
+ queue->kernel_if->page[i] = alloc_pages(GFP_KERNEL, 0);
+ if (!queue->kernel_if->page[i])
+ goto fail;
+ }
+
+ if (vmci_qp_pinned(flags)) {
+ queue->kernel_if->va =
+ vmap(queue->kernel_if->page, num_data_pages, VM_MAP,
+ PAGE_KERNEL);
+ if (!queue->kernel_if->va)
+ goto fail;
+
+ queue->kernel_if->mapped = true;
+ }
+
+ return (void *)queue;
+
+ fail:
+ qp_free_queue(queue, i * PAGE_SIZE);
+ return NULL;
+}
+
+/*
+ * Copies from a given buffer or iovector to a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up from this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)src;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_fromiovec((u8 *)va + page_offset,
+ iov, to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)va + page_offset,
+ (u8 *)src + bytes_copied, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Copies to a given buffer or iovector from a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_from_queue(void *dest,
+ const struct vmci_queue *queue,
+ u64 queue_offset,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)dest;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_toiovec(iov, (u8 *)va + page_offset,
+ to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)dest + bytes_copied,
+ (u8 *)va + page_offset, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Allocates two list of PPNs --- one for the pages in the produce queue,
+ * and the other for the pages in the consume queue. Intializes the list
+ * of PPNs with the page frame numbers of the KVA for the two queues (and
+ * the queue headers).
+ */
+static int qp_alloc_ppn_set(void *prod_q,
+ u64 num_produce_pages,
+ void *cons_q,
+ u64 num_consume_pages, struct PPNSet *ppn_set)
+{
+ u32 *produce_ppns;
+ u32 *consume_ppns;
+ struct vmci_queue *produce_q = prod_q;
+ struct vmci_queue *consume_q = cons_q;
+ u64 i;
+
+ if (!produce_q || !num_produce_pages || !consume_q ||
+ !num_consume_pages || !ppn_set)
+ return VMCI_ERROR_INVALID_ARGS;
+
+ if (ppn_set->initialized)
+ return VMCI_ERROR_ALREADY_EXISTS;
+
+ produce_ppns =
+ kmalloc(num_produce_pages * sizeof(*produce_ppns), GFP_KERNEL);
+ if (!produce_ppns)
+ return VMCI_ERROR_NO_MEM;
+
+ consume_ppns =
+ kmalloc(num_consume_pages * sizeof(*consume_ppns), GFP_KERNEL);
+ if (!consume_ppns) {
+ kfree(produce_ppns);
+ return VMCI_ERROR_NO_MEM;
+ }
+
+ produce_ppns[0] = page_to_pfn(vmalloc_to_page(produce_q->q_header));
+ for (i = 1; i < num_produce_pages; i++) {
+ unsigned long pfn;
+
+ produce_ppns[i] =
+ page_to_pfn(produce_q->kernel_if->page[i - 1]);
+ pfn = produce_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*produce_ppns)
+ && pfn != produce_ppns[i])
+ goto ppn_error;
+ }
+
+ consume_ppns[0] = page_to_pfn(vmalloc_to_page(consume_q->q_header));
+ for (i = 1; i < num_consume_pages; i++) {
+ unsigned long pfn;
+
+ consume_ppns[i] =
+ page_to_pfn(consume_q->kernel_if->page[i - 1]);
+ pfn = consume_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*consume_ppns)
+ && pfn != consume_ppns[i])
+ goto ppn_error;
+ }
+
+ ppn_set->num_produce_pages = num_produce_pages;
+ ppn_set->num_consume_pages = num_consume_pages;
+ ppn_set->produce_ppns = produce_ppns;
+ ppn_set->consume_ppns = consume_ppns;
+ ppn_set->initialized = true;
+ return VMCI_SUCCESS;
+
+ ppn_error:
+ kfree(produce_ppns);
+ kfree(consume_ppns);
+ return VMCI_ERROR_INVALID_ARGS;
+}
+
+/*
+ * Frees the two list of PPNs for a queue pair.
+ */
+static void qp_free_ppn_set(struct PPNSet *ppn_set)
+{
+ if (ppn_set->initialized) {
+ /* Do not call these functions on NULL inputs. */
+ kfree(ppn_set->produce_ppns);
+ kfree(ppn_set->consume_ppns);
+ }
+ memset(ppn_set, 0, sizeof(*ppn_set));
+}
+
+/*
+ * Populates the list of PPNs in the hypercall structure with the PPNS
+ * of the produce queue and the consume queue.
+ */
+static int qp_populate_ppn_set(u8 *call_buf, const struct PPNSet *ppn_set)
+{
+ memcpy(call_buf, ppn_set->produce_ppns,
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns));
+ memcpy(call_buf +
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns),
+ ppn_set->consume_ppns,
+ ppn_set->num_consume_pages * sizeof(*ppn_set->consume_ppns));
+
+ return VMCI_SUCCESS;
+}
+
+static int qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src, size_t src_offset, size_t size)
+{
+ return __qp_memcpy_to_queue(queue, queue_offset,
+ (u8 *)src + src_offset, size, false);
+}
+
+static int qp_memcpy_from_queue(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ return __qp_memcpy_from_queue((u8 *)dest + dest_offset,
+ queue, queue_offset, size, false);
+}
+
+/*
+ * Copies from a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_to_queue_iov(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t src_offset, size_t size)
+{
+
+ /*
+ * We ignore src_offset because src is really a struct iovec * and will
+ * maintain offset internally.
+ */
+ return __qp_memcpy_to_queue(queue, queue_offset, src, size, true);
+}
+
+/*
+ * Copies to a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_from_queue_iov(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ /*
+ * We ignore dest_offset because dest is really a struct iovec * and
+ * will maintain offset internally.
+ */
+ return __qp_memcpy_from_queue(dest, queue, queue_offset, size, true);
+}
+
+/*
+ * Allocates kernel VA space of specified size plus space for the queue
+ * and kernel interface. This is different from the guest queue allocator,
+ * because we do not allocate our own queue header/data pages here but
+ * share those of the guest.
+ */
+static struct vmci_queue *qp_host_alloc_queue(u64 size)
+{
+ struct vmci_queue *queue;
+ const size_t num_pages = dm_div_up(size, PAGE_SIZE) + 1;
+ const size_t queue_size = sizeof(*queue) + sizeof(*(queue->kernel_if));
+ const size_t queue_page_size =
+ num_pages * sizeof(*queue->kernel_if->page);
+
+ queue = kzalloc(queue_size + queue_page_size, GFP_KERNEL);
+ if (queue) {
+ queue->q_header = NULL;
+ queue->saved_header = NULL;
+ queue->kernel_if =
+ (struct vmci_queue_kern_if *)((u8 *)queue +
+ sizeof(*queue));
+ queue->kernel_if->host = true;
+ queue->kernel_if->mutex = NULL;
+ queue->kernel_if->num_pages = num_pages;
+ queue->kernel_if->header_page =
+ (struct page **)((u8 *)queue + queue_size);
+ queue->kernel_if->page = &queue->kernel_if->header_page[1];
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+ }
+
+ return queue;
+}
+
+/*
+ * Frees kernel memory for a given queue (header plus translation
+ * structure).
+ */
+static void qp_host_free_queue(struct vmci_queue *queue, u64 queue_size)
+{
+ kfree(queue);
+}
+
+/*
+ * Initialize the mutex for the pair of queues. This mutex is used to
+ * protect the q_header and the buffer from changing out from under any
+ * users of either queue. Of course, it's only any good if the mutexes
+ * are actually acquired. Queue structure must lie on non-paged memory
+ * or we cannot guarantee access to the mutex.
+ */
+static void qp_init_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ /*
+ * Only the host queue has shared state - the guest queues do not
+ * need to synchronize access using a queue mutex.
+ */
+
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ consume_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ mutex_init(produce_q->kernel_if->mutex);
+ }
+}
+
+/*
+ * Cleans up the mutex for the pair of queues.
+ */
+static void qp_cleanup_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = NULL;
+ consume_q->kernel_if->mutex = NULL;
+ }
+}
+
+/*
+ * Acquire the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_acquire_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_lock(queue->kernel_if->mutex);
+}
+
+/*
+ * Release the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_release_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_unlock(queue->kernel_if->mutex);
+}
+
+/*
+ * Helper function to release pages in the PageStoreAttachInfo
+ * previously obtained using get_user_pages.
+ */
+static void qp_release_pages(struct page **pages,
+ u64 num_pages, bool dirty)
+{
+ int i;
+
+ for (i = 0; i < num_pages; i++) {
+ if (dirty)
+ set_page_dirty(pages[i]);
+
+ page_cache_release(pages[i]);
+ pages[i] = NULL;
+ }
+}
+
+/*
+ * Lock the user pages referenced by the {produce,consume}Buffer
+ * struct into memory and populate the {produce,consume}Pages
+ * arrays in the attach structure with them.
+ */
+static int qp_host_get_user_memory(u64 produce_uva,
+ u64 consume_uva,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int retval;
+ int err = VMCI_SUCCESS;
+
+ down_write(¤t->mm->mmap_sem);
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) produce_uva,
+ produce_q->kernel_if->num_pages,
+ 1, 0, produce_q->kernel_if->header_page, NULL);
+ if (retval < produce_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(produce) failed (retval=%d)", retval);
+ qp_release_pages(produce_q->kernel_if->header_page, retval,
+ false);
+ err = VMCI_ERROR_NO_MEM;
+ goto out;
+ }
+
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) consume_uva,
+ consume_q->kernel_if->num_pages,
+ 1, 0, consume_q->kernel_if->header_page, NULL);
+ if (retval < consume_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(consume) failed (retval=%d)", retval);
+ qp_release_pages(consume_q->kernel_if->header_page, retval,
+ false);
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, false);
+ err = VMCI_ERROR_NO_MEM;
+ }
+
+ out:
+ up_write(¤t->mm->mmap_sem);
+
+ return err;
+}
+
+/*
+ * Registers the specification of the user pages used for backing a queue
+ * pair. Enough information to map in pages is stored in the OS specific
+ * part of the struct vmci_queue structure.
+ */
+static int qp_host_register_user_memory(struct vmci_qp_page_store *page_store,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ u64 produce_uva;
+ u64 consume_uva;
+
+ /*
+ * The new style and the old style mapping only differs in
+ * that we either get a single or two UVAs, so we split the
+ * single UVA range at the appropriate spot.
+ */
+ produce_uva = page_store->pages;
+ consume_uva = page_store->pages +
+ produce_q->kernel_if->num_pages * PAGE_SIZE;
+ return qp_host_get_user_memory(produce_uva, consume_uva, produce_q,
+ consume_q);
+}
+
+/*
+ * Releases and removes the references to user pages stored in the attach
+ * struct. Pages are released from the page cache and may become
+ * swappable again.
+ */
+static void qp_host_unregister_user_memory(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, true);
+ memset(produce_q->kernel_if->header_page, 0,
+ sizeof(*produce_q->kernel_if->header_page) *
+ produce_q->kernel_if->num_pages);
+ qp_release_pages(consume_q->kernel_if->header_page,
+ consume_q->kernel_if->num_pages, true);
+ memset(consume_q->kernel_if->header_page, 0,
+ sizeof(*consume_q->kernel_if->header_page) *
+ consume_q->kernel_if->num_pages);
+}
+
+/*
+ * Once qp_host_register_user_memory has been performed on a
+ * queue, the queue pair headers can be mapped into the
+ * kernel. Once mapped, they must be unmapped with
+ * qp_host_unmap_queues prior to calling
+ * qp_host_unregister_user_memory.
+ * Pages are pinned.
+ */
+static int qp_host_map_queues(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int result;
+
+ if (!produce_q->q_header || !consume_q->q_header) {
+ struct page *headers[2];
+
+ if (produce_q->q_header != consume_q->q_header)
+ return VMCI_ERROR_QUEUEPAIR_MISMATCH;
+
+ if (produce_q->kernel_if->header_page == NULL ||
+ *produce_q->kernel_if->header_page == NULL)
+ return VMCI_ERROR_UNAVAILABLE;
+
+ headers[0] = *produce_q->kernel_if->header_page;
+ headers[1] = *consume_q->kernel_if->header_page;
+
+ produce_q->q_header = vmap(headers, 2, VM_MAP, PAGE_KERNEL);
+ if (produce_q->q_header != NULL) {
+ consume_q->q_header =
+ (struct vmci_queue_header *)((u8 *)
+ produce_q->q_header +
+ PAGE_SIZE);
+ result = VMCI_SUCCESS;
+ } else {
+ pr_warn("vmap failed\n");
+ result = VMCI_ERROR_NO_MEM;
+ }
+ } else {
+ result = VMCI_SUCCESS;
+ }
+
+ return result;
+}
+
+/*
+ * Unmaps previously mapped queue pair headers from the kernel.
+ * Pages are unpinned.
+ */
+static int qp_host_unmap_queues(u32 gid,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->q_header) {
+ if (produce_q->q_header < consume_q->q_header)
+ vunmap(produce_q->q_header);
+ else
+ vunmap(consume_q->q_header);
+
+ produce_q->q_header = NULL;
+ consume_q->q_header = NULL;
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle. Assumes
+ * that the list is locked.
+ */
+static struct qp_entry *qp_list_find(struct qp_list *qp_list,
+ struct vmci_handle handle)
+{
+ struct qp_entry *entry;
+
+ if (vmci_handle_is_invalid(handle))
+ return NULL;
+
+ list_for_each_entry(entry, &qp_list->head, list_item) {
+ if (vmci_handle_is_equal(entry->handle, handle))
+ return entry;
+ }
+
+ return NULL;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_guest_endpoint *
+qp_guest_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_guest_endpoint *entry;
+ struct qp_entry *qp = qp_list_find(&qp_guest_endpoints, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_guest_endpoint, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_broker_entry *
+qp_broker_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_broker_entry *entry;
+ struct qp_entry *qp = qp_list_find(&qp_broker_list, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_broker_entry, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Dispatches a queue pair event message directly into the local event
+ * queue.
+ */
+static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
+{
+ u32 context_id = vmci_get_context_id();
+ struct vmci_event_qp ev;
+
+ ev.msg.hdr.dst = vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
+ ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID);
+ ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
+ ev.msg.event_data.event =
+ attach ? VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
+ ev.payload.peer_id = context_id;
+ ev.payload.handle = handle;
+
+ return vmci_event_dispatch(&ev.msg.hdr);
+}
+
+/*
+ * Allocates and initializes a qp_guest_endpoint structure.
+ * Allocates a queue_pair rid (and handle) iff the given entry has
+ * an invalid handle. 0 through VMCI_RESERVED_RESOURCE_ID_MAX
+ * are reserved handles. Assumes that the QP list mutex is held
+ * by the caller.
+ */
+static struct qp_guest_endpoint *
+qp_guest_endpoint_create(struct vmci_handle handle,
+ u32 peer,
+ u32 flags,
+ u64 produce_size,
+ u64 consume_size,
+ void *produce_q,
+ void *consume_q)
+{
+ int result;
+ struct qp_guest_endpoint *entry;
+ /* One page each for the queue headers. */
+ const u64 num_ppns = dm_div_up(produce_size, PAGE_SIZE) +
+ dm_div_up(consume_size, PAGE_SIZE) + 2;
+
+ if (vmci_handle_is_invalid(handle)) {
+ u32 context_id = vmci_get_context_id();
+
+ handle = vmci_make_handle(context_id, VMCI_INVALID_ID);
+ }
+
+ entry = kzalloc(sizeof(*entry), GFP_KERNEL);
+ if (entry) {
+ entry->qp.peer = peer;
+ entry->qp.flags = flags;
+ entry->qp.produce_size = produce_size;
+ entry->qp.consume_size = consume_size;
+ entry->qp.ref_count = 0;
]
]
|
| 152/2 |
2026/05/09 22:54 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 38166
output: 70
thoughts: 38
Thoughts: Okay, here's my take on those thoughts, framed as an expert's internal monologue:
**Quick Git Dive to Pinpoint the Change**
Hmm, right, I need to figure out when `qp_notify_peer` was introduced into `vmci_qp_broker_detach`. I could meticulously grep through the codebase, or maybe even fire up a debugger and step through the logic... but hold on a second. There's a much more efficient way to tackle this using Git. I can leverage `git log`'s power. It's built for exactly this kind of investigation!
Instead of manually sifting, I can just use `git log` with the `-G` option. `-G` is perfect for this. It lets me search the commit history for changes that *introduced* lines containing a particular regular expression. I'll simply target `qp_notify_peer` within the `vmci_qp_broker_detach` context. That should give me the exact commit(s) where the function call was added, right away. No need for complex scripts or digging through old diffs by hand. Time to get this figured out with a quick Git command!
|
| 153/2 |
2026/05/09 22:54 |
tool |
git-log |
0m
Args: map[CodeRegexp:qp_notify_peer.*handle.*context_id.*peer_id SourcePath:drivers/misc/vmw_vmci/vmci_queue_pair.c SymbolName:vmci_qp_broker_detach]
Results: map[Output:234b7f8d3bf2 vmci: fix duplicated code for different branches
06164d2b72aa VMCI: queue pairs implementation.
]
|
| 154/2 |
2026/05/09 22:55 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 38575
output: 26
thoughts: 31
Thoughts: Okay, here's my interpretation of those thoughts, presented as a first-person expert summary:
**Initial Assessment: Code Review Required**
Right, let's dive in. The first thought is immediate: I need to examine `06164d2b72aa` and `234b7f8d3bf2`. Based on the context, I'm assuming these are likely commit hashes, perhaps identifiers for specific versions of code, configurations, or data. My immediate focus is on understanding what changes or issues are represented by those identifiers. I'll need to use my typical methods to assess these. I'll probably start with a `git log` command or equivalent to see the associated metadata like author, date, and commit message. Then I'll dive in to the diffs to see the specific changes. Depending on the scale of the changes in the diff, I'll then move on to tests or the code itself.
|
| 155/2 |
2026/05/09 22:55 |
tool |
git-show |
0m
Args:
Results: map[Output:commit 234b7f8d3bf2738024b155b87303ed1218e620fa
Author: Gustavo A. R. Silva <gustavo@embeddedor.com>
Date: Thu Aug 17 20:43:10 2017 -0500
vmci: fix duplicated code for different branches
Refactor code in order to avoid identical code for different branches.
This issue was detected with the help of Coccinelle.
Addresses-Coverity-ID: 1226762
Signed-off-by: Gustavo A. R. Silva <gustavo@embeddedor.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index 06c4974ee8dd..8af5c2672f71 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -2235,14 +2235,8 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
handle.context, handle.resource,
result);
- if (entry->vmci_page_files)
- qp_host_unregister_user_memory(entry->produce_q,
- entry->
- consume_q);
- else
- qp_host_unregister_user_memory(entry->produce_q,
- entry->
- consume_q);
+ qp_host_unregister_user_memory(entry->produce_q,
+ entry->consume_q);
}
]
|
| 156/2 |
2026/05/09 22:55 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 39344
output: 58
thoughts: 127
Thoughts: Okay, here's my take on those commits:
**Analyzing the Code Changes**
Alright, let's see. `234b7f8d3bf2` looks like a straightforward refactoring, nothing inherently problematic there. My initial hunch is that it's just tidying up code after the fact, or maybe reorganizing things for clarity.
However, the real culprit seems to be `06164d2b72aa752ce4633184b3e0d97601017135`. It seems that this commit is when the bug was introduced. This warrants closer inspection.
Now, a critical point: I need to verify if `vmci_ctx_put` was also introduced in `06164d2b72aa752ce4633184b3e0d97601017135`. It's possible that this function call is related to the bug. I'll check its definition to get further insights.
|
| 157/2 |
2026/05/09 22:55 |
tool |
git-log |
0m
Args: map[CodeRegexp:vmci_ctx_put SourcePath:drivers/misc/vmw_vmci/vmci_queue_pair.c SymbolName:qp_broker_attach]
Results: map[Output:45412befe8fe VMCI: Remove non-blocking/pinned queuepair support
06164d2b72aa VMCI: queue pairs implementation.
]
|
| 158/2 |
2026/05/09 22:55 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 39815
output: 24
thoughts: 15
Thoughts: Okay, here's my interpretation of that request, formatted as requested:
**Assessing the Landscape: A Quick Diagnostic Check**
Alright, let's dive in. The instruction is to examine and provide insight on that code, which looks like a SHA-1 hash or similar. Now, I understand I'm expected to offer a fulsome summary of *my* thought process, which in this context means detailing how I'd approach analyzing a piece of information like this.
So, first, that string, `45412befe8fe`, immediately triggers a mental checklist. Is it a hash? If so, what algorithm is most likely? My initial guess based on its length is a SHA-1. I’d now confirm that, of course. I'd consider using a hash identifier tool, or at least a quick online hash checker to confirm.
Assuming it *is* a known hash function, and let's say it's SHA-1. What's the context? Is it from a log file? A configuration file? A database? Knowing its source is crucial. I need context. This affects how I should proceed. If it's a password hash, I would think, "time to be cautious and proceed cautiously."
Next steps would be dictated by the context. If it's a known value, maybe I'd need to look up a corresponding password, if applicable. If it is new, I'd want to understand how this hash was created. Was it a result of some process that needs verification?
So, while the instruction provides just that string, my mind races to explore the immediate considerations to determine the next steps I must take.
|
| 159/2 |
2026/05/09 22:55 |
tool |
git-show |
0m
Args:
Results: map[Output:commit 45412befe8fee657effc15112af05ca9dbea61fc
Author: Andy King <acking@vmware.com>
Date: Fri Aug 23 09:22:13 2013 -0700
VMCI: Remove non-blocking/pinned queuepair support
We added this for a special case that doesn't exist on Linux. Remove
the non-blocking/pinned queuepair code and simplify the driver in
preparation for adding virtual IOMMU support.
Acked-by: Aditya Sarwade <asarwade@vmware.com>
Signed-off-by: Andy King <acking@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index 8ff2e5ee8fb8..8698e0c5bdb4 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -148,12 +148,10 @@ typedef int vmci_memcpy_from_queue_func(void *dest, size_t dest_offset,
struct vmci_queue_kern_if {
struct page **page;
struct page **header_page;
- void *va;
struct mutex __mutex; /* Protects the queue. */
struct mutex *mutex; /* Shared by producer and consumer queues. */
bool host;
size_t num_pages;
- bool mapped;
};
/*
@@ -267,11 +265,6 @@ static void qp_free_queue(void *q, u64 size)
if (queue) {
u64 i = DIV_ROUND_UP(size, PAGE_SIZE);
- if (queue->kernel_if->mapped) {
- vunmap(queue->kernel_if->va);
- queue->kernel_if->va = NULL;
- }
-
while (i)
__free_page(queue->kernel_if->page[--i]);
@@ -311,8 +304,6 @@ static void *qp_alloc_queue(u64 size, u32 flags)
queue->kernel_if->header_page = NULL; /* Unused in guest. */
queue->kernel_if->page = (struct page **)(queue->kernel_if + 1);
queue->kernel_if->host = false;
- queue->kernel_if->va = NULL;
- queue->kernel_if->mapped = false;
for (i = 0; i < num_data_pages; i++) {
queue->kernel_if->page[i] = alloc_pages(GFP_KERNEL, 0);
@@ -320,16 +311,6 @@ static void *qp_alloc_queue(u64 size, u32 flags)
goto fail;
}
- if (vmci_qp_pinned(flags)) {
- queue->kernel_if->va =
- vmap(queue->kernel_if->page, num_data_pages, VM_MAP,
- PAGE_KERNEL);
- if (!queue->kernel_if->va)
- goto fail;
-
- queue->kernel_if->mapped = true;
- }
-
return (void *)queue;
fail:
@@ -359,11 +340,7 @@ static int __qp_memcpy_to_queue(struct vmci_queue *queue,
void *va;
size_t to_copy;
- if (!kernel_if->mapped)
- va = kmap(kernel_if->page[page_index]);
- else
- va = (void *)((u8 *)kernel_if->va +
- (page_index * PAGE_SIZE));
+ va = kmap(kernel_if->page[page_index]);
if (size - bytes_copied > PAGE_SIZE - page_offset)
/* Enough payload to fill up from this page. */
@@ -388,8 +365,7 @@ static int __qp_memcpy_to_queue(struct vmci_queue *queue,
}
bytes_copied += to_copy;
- if (!kernel_if->mapped)
- kunmap(kernel_if->page[page_index]);
+ kunmap(kernel_if->page[page_index]);
}
return VMCI_SUCCESS;
@@ -417,11 +393,7 @@ static int __qp_memcpy_from_queue(void *dest,
void *va;
size_t to_copy;
- if (!kernel_if->mapped)
- va = kmap(kernel_if->page[page_index]);
- else
- va = (void *)((u8 *)kernel_if->va +
- (page_index * PAGE_SIZE));
+ va = kmap(kernel_if->page[page_index]);
if (size - bytes_copied > PAGE_SIZE - page_offset)
/* Enough payload to fill up this page. */
@@ -446,8 +418,7 @@ static int __qp_memcpy_from_queue(void *dest,
}
bytes_copied += to_copy;
- if (!kernel_if->mapped)
- kunmap(kernel_if->page[page_index]);
+ kunmap(kernel_if->page[page_index]);
}
return VMCI_SUCCESS;
@@ -634,8 +605,6 @@ static struct vmci_queue *qp_host_alloc_queue(u64 size)
queue->kernel_if->header_page =
(struct page **)((u8 *)queue + queue_size);
queue->kernel_if->page = &queue->kernel_if->header_page[1];
- queue->kernel_if->va = NULL;
- queue->kernel_if->mapped = false;
}
return queue;
@@ -1720,21 +1689,6 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
if (result < VMCI_SUCCESS)
return result;
- /*
- * Preemptively load in the headers if non-blocking to
- * prevent blocking later.
- */
- if (entry->qp.flags & VMCI_QPFLAG_NONBLOCK) {
- result = qp_host_map_queues(entry->produce_q,
- entry->consume_q);
- if (result < VMCI_SUCCESS) {
- qp_host_unregister_user_memory(
- entry->produce_q,
- entry->consume_q);
- return result;
- }
- }
-
entry->state = VMCIQPB_ATTACHED_MEM;
} else {
entry->state = VMCIQPB_ATTACHED_NO_MEM;
@@ -1749,24 +1703,6 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
return VMCI_ERROR_UNAVAILABLE;
} else {
- /*
- * For non-blocking queue pairs, we cannot rely on
- * enqueue/dequeue to map in the pages on the
- * host-side, since it may block, so we make an
- * attempt here.
- */
-
- if (flags & VMCI_QPFLAG_NONBLOCK) {
- result =
- qp_host_map_queues(entry->produce_q,
- entry->consume_q);
- if (result < VMCI_SUCCESS)
- return result;
-
- entry->qp.flags |= flags &
- (VMCI_QPFLAG_NONBLOCK | VMCI_QPFLAG_PINNED);
- }
-
/* The host side has successfully attached to a queue pair. */
entry->state = VMCIQPB_ATTACHED_MEM;
}
@@ -2543,24 +2479,19 @@ void vmci_qp_guest_endpoints_exit(void)
* Since non-blocking isn't yet implemented on the host personality we
* have no reason to acquire a spin lock. So to avoid the use of an
* unnecessary lock only acquire the mutex if we can block.
- * Note: It is assumed that QPFLAG_PINNED implies QPFLAG_NONBLOCK. Therefore
- * we can use the same locking function for access to both the queue
- * and the queue headers as it is the same logic. Assert this behvior.
*/
static void qp_lock(const struct vmci_qp *qpair)
{
- if (vmci_can_block(qpair->flags))
- qp_acquire_queue_mutex(qpair->produce_q);
+ qp_acquire_queue_mutex(qpair->produce_q);
}
/*
* Helper routine that unlocks the queue pair after calling
- * qp_lock. Respects non-blocking and pinning flags.
+ * qp_lock.
*/
static void qp_unlock(const struct vmci_qp *qpair)
{
- if (vmci_can_block(qpair->flags))
- qp_release_queue_mutex(qpair->produce_q);
+ qp_release_queue_mutex(qpair->produce_q);
}
/*
@@ -2568,17 +2499,12 @@ static void qp_unlock(const struct vmci_qp *qpair)
* currently not mapped, it will be attempted to do so.
*/
static int qp_map_queue_headers(struct vmci_queue *produce_q,
- struct vmci_queue *consume_q,
- bool can_block)
+ struct vmci_queue *consume_q)
{
int result;
if (NULL == produce_q->q_header || NULL == consume_q->q_header) {
- if (can_block)
- result = qp_host_map_queues(produce_q, consume_q);
- else
- result = VMCI_ERROR_QUEUEPAIR_NOT_READY;
-
+ result = qp_host_map_queues(produce_q, consume_q);
if (result < VMCI_SUCCESS)
return (produce_q->saved_header &&
consume_q->saved_header) ?
@@ -2601,8 +2527,7 @@ static int qp_get_queue_headers(const struct vmci_qp *qpair,
{
int result;
- result = qp_map_queue_headers(qpair->produce_q, qpair->consume_q,
- vmci_can_block(qpair->flags));
+ result = qp_map_queue_headers(qpair->produce_q, qpair->consume_q);
if (result == VMCI_SUCCESS) {
*produce_q_header = qpair->produce_q->q_header;
*consume_q_header = qpair->consume_q->q_header;
@@ -2645,9 +2570,6 @@ static bool qp_wait_for_ready_queue(struct vmci_qp *qpair)
{
unsigned int generation;
- if (qpair->flags & VMCI_QPFLAG_NONBLOCK)
- return false;
-
qpair->blocked++;
generation = qpair->generation;
qp_unlock(qpair);
@@ -2674,15 +2596,14 @@ static ssize_t qp_enqueue_locked(struct vmci_queue *produce_q,
const u64 produce_q_size,
const void *buf,
size_t buf_size,
- vmci_memcpy_to_queue_func memcpy_to_queue,
- bool can_block)
+ vmci_memcpy_to_queue_func memcpy_to_queue)
{
s64 free_space;
u64 tail;
size_t written;
ssize_t result;
- result = qp_map_queue_headers(produce_q, consume_q, can_block);
+ result = qp_map_queue_headers(produce_q, consume_q);
if (unlikely(result != VMCI_SUCCESS))
return result;
@@ -2737,15 +2658,14 @@ static ssize_t qp_dequeue_locked(struct vmci_queue *produce_q,
void *buf,
size_t buf_size,
vmci_memcpy_from_queue_func memcpy_from_queue,
- bool update_consumer,
- bool can_block)
+ bool update_consumer)
{
s64 buf_ready;
u64 head;
size_t read;
ssize_t result;
- result = qp_map_queue_headers(produce_q, consume_q, can_block);
+ result = qp_map_queue_headers(produce_q, consume_q);
if (unlikely(result != VMCI_SUCCESS))
return result;
@@ -2842,32 +2762,11 @@ int vmci_qpair_alloc(struct vmci_qp **qpair,
route = vmci_guest_code_active() ?
VMCI_ROUTE_AS_GUEST : VMCI_ROUTE_AS_HOST;
- /* If NONBLOCK or PINNED is set, we better be the guest personality. */
- if ((!vmci_can_block(flags) || vmci_qp_pinned(flags)) &&
- VMCI_ROUTE_AS_GUEST != route) {
- pr_devel("Not guest personality w/ NONBLOCK OR PINNED set");
+ if (flags & (VMCI_QPFLAG_NONBLOCK | VMCI_QPFLAG_PINNED)) {
+ pr_devel("NONBLOCK OR PINNED set");
return VMCI_ERROR_INVALID_ARGS;
}
- /*
- * Limit the size of pinned QPs and check sanity.
- *
- * Pinned pages implies non-blocking mode. Mutexes aren't acquired
- * when the NONBLOCK flag is set in qpair code; and also should not be
- * acquired when the PINNED flagged is set. Since pinning pages
- * implies we want speed, it makes no sense not to have NONBLOCK
- * set if PINNED is set. Hence enforce this implication.
- */
- if (vmci_qp_pinned(flags)) {
- if (vmci_can_block(flags)) {
- pr_err("Attempted to enable pinning w/o non-blocking");
- return VMCI_ERROR_INVALID_ARGS;
- }
-
- if (produce_qsize + consume_qsize > VMCI_MAX_PINNED_QP_MEMORY)
- return VMCI_ERROR_NO_RESOURCES;
- }
-
my_qpair = kzalloc(sizeof(*my_qpair), GFP_KERNEL);
if (!my_qpair)
return VMCI_ERROR_NO_MEM;
@@ -3195,8 +3094,7 @@ ssize_t vmci_qpair_enqueue(struct vmci_qp *qpair,
qpair->consume_q,
qpair->produce_q_size,
buf, buf_size,
- qp_memcpy_to_queue,
- vmci_can_block(qpair->flags));
+ qp_memcpy_to_queue);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
@@ -3237,8 +3135,7 @@ ssize_t vmci_qpair_dequeue(struct vmci_qp *qpair,
qpair->consume_q,
qpair->consume_q_size,
buf, buf_size,
- qp_memcpy_from_queue, true,
- vmci_can_block(qpair->flags));
+ qp_memcpy_from_queue, true);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
@@ -3280,8 +3177,7 @@ ssize_t vmci_qpair_peek(struct vmci_qp *qpair,
qpair->consume_q,
qpair->consume_q_size,
buf, buf_size,
- qp_memcpy_from_queue, false,
- vmci_can_block(qpair->flags));
+ qp_memcpy_from_queue, false);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
@@ -3323,8 +3219,7 @@ ssize_t vmci_qpair_enquev(struct vmci_qp *qpair,
qpair->consume_q,
qpair->produce_q_size,
iov, iov_size,
- qp_memcpy_to_queue_iov,
- vmci_can_block(qpair->flags));
+ qp_memcpy_to_queue_iov);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
@@ -3367,7 +3262,7 @@ ssize_t vmci_qpair_dequev(struct vmci_qp *qpair,
qpair->consume_q_size,
iov, iov_size,
qp_memcpy_from_queue_iov,
- true, vmci_can_block(qpair->flags));
+ true);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
@@ -3411,7 +3306,7 @@ ssize_t vmci_qpair_peekv(struct vmci_qp *qpair,
qpair->consume_q_size,
iov, iov_size,
qp_memcpy_from_queue_iov,
- false, vmci_can_block(qpair->flags));
+ false);
if (result == VMCI_ERROR_QUEUEPAIR_NOT_READY &&
!qp_wait_for_ready_queue(qpair))
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.h b/drivers/misc/vmw_vmci/vmci_queue_pair.h
index 58c6959f6b6d..ed177f04ef24 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.h
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.h
@@ -146,24 +146,6 @@ VMCI_QP_PAGESTORE_IS_WELLFORMED(struct vmci_qp_page_store *page_store)
return page_store->len >= 2;
}
-/*
- * Helper function to check if the non-blocking flag
- * is set for a given queue pair.
- */
-static inline bool vmci_can_block(u32 flags)
-{
- return !(flags & VMCI_QPFLAG_NONBLOCK);
-}
-
-/*
- * Helper function to check if the queue pair is pinned
- * into memory.
- */
-static inline bool vmci_qp_pinned(u32 flags)
-{
- return flags & VMCI_QPFLAG_PINNED;
-}
-
void vmci_qp_broker_exit(void);
int vmci_qp_broker_alloc(struct vmci_handle handle, u32 peer,
u32 flags, u32 priv_flags,
]
|
| 160/2 |
2026/05/09 22:55 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 45418
output: 53
thoughts: 137
Thoughts: Okay, here's my analysis of these changes:
**Analyzing the Queuepair Modification**
Alright, let's break this down. It seems commit `45412befe8fe` is the one that's been responsible for removing the support for non-blocking and/or pinned queuepairs, so that's the starting point. My concern here is to understand the root cause. This bug, apparently, was introduced earlier, back in `06164d2b72aa752ce4633184b3e0d97601017135`.
Now, the crucial question is *why*. My initial suspicion is around the `vmci_qp_broker_detach` function. I need to verify whether the `qp_notify_peer` call, which I would expect to be critical for proper queuepair management, was correctly protected *inside* the mutex within that problematic commit, `06164d2b72aa752ce4633184b3e0d97601017135`. That's the likely spot for a concurrency issue. I need to check the code itself to confirm whether the locking was present.
|
| 161/2 |
2026/05/09 22:56 |
tool |
git-show |
0m
Args: map[Commit:06164d2b72aa752ce4633184b3e0d97601017135]
Results: map[Output:
Full output is too long, showing 1000 out of 3636 lines.
[commit 06164d2b72aa752ce4633184b3e0d97601017135
Author: George Zhang <georgezhang@vmware.com>
Date: Tue Jan 8 15:54:54 2013 -0800
VMCI: queue pairs implementation.
VMCI queue pairs allow for bi-directional ordered communication between host and guests.
Signed-off-by: George Zhang <georgezhang@vmware.com>
Acked-by: Andy king <acking@vmware.com>
Acked-by: Dmitry Torokhov <dtor@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
new file mode 100644
index 000000000000..1123111ba1bf
--- /dev/null
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -0,0 +1,3420 @@
+/*
+ * VMware VMCI Driver
+ *
+ * Copyright (C) 2012 VMware, Inc. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation version 2 and no later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ */
+
+#include <linux/device-mapper.h>
+#include <linux/vmw_vmci_defs.h>
+#include <linux/vmw_vmci_api.h>
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/mutex.h>
+#include <linux/socket.h>
+#include <linux/wait.h>
+
+#include "vmci_handle_array.h"
+#include "vmci_queue_pair.h"
+#include "vmci_datagram.h"
+#include "vmci_resource.h"
+#include "vmci_context.h"
+#include "vmci_driver.h"
+#include "vmci_event.h"
+#include "vmci_route.h"
+
+/*
+ * In the following, we will distinguish between two kinds of VMX processes -
+ * the ones with versions lower than VMCI_VERSION_NOVMVM that use specialized
+ * VMCI page files in the VMX and supporting VM to VM communication and the
+ * newer ones that use the guest memory directly. We will in the following
+ * refer to the older VMX versions as old-style VMX'en, and the newer ones as
+ * new-style VMX'en.
+ *
+ * The state transition datagram is as follows (the VMCIQPB_ prefix has been
+ * removed for readability) - see below for more details on the transtions:
+ *
+ * -------------- NEW -------------
+ * | |
+ * \_/ \_/
+ * CREATED_NO_MEM <-----------------> CREATED_MEM
+ * | | |
+ * | o-----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * ATTACHED_NO_MEM <----------------> ATTACHED_MEM
+ * | | |
+ * | o----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * SHUTDOWN_NO_MEM <----------------> SHUTDOWN_MEM
+ * | |
+ * | |
+ * -------------> gone <-------------
+ *
+ * In more detail. When a VMCI queue pair is first created, it will be in the
+ * VMCIQPB_NEW state. It will then move into one of the following states:
+ *
+ * - VMCIQPB_CREATED_NO_MEM: this state indicates that either:
+ *
+ * - the created was performed by a host endpoint, in which case there is
+ * no backing memory yet.
+ *
+ * - the create was initiated by an old-style VMX, that uses
+ * vmci_qp_broker_set_page_store to specify the UVAs of the queue pair at
+ * a later point in time. This state can be distinguished from the one
+ * above by the context ID of the creator. A host side is not allowed to
+ * attach until the page store has been set.
+ *
+ * - VMCIQPB_CREATED_MEM: this state is the result when the queue pair
+ * is created by a VMX using the queue pair device backend that
+ * sets the UVAs of the queue pair immediately and stores the
+ * information for later attachers. At this point, it is ready for
+ * the host side to attach to it.
+ *
+ * Once the queue pair is in one of the created states (with the exception of
+ * the case mentioned for older VMX'en above), it is possible to attach to the
+ * queue pair. Again we have two new states possible:
+ *
+ * - VMCIQPB_ATTACHED_MEM: this state can be reached through the following
+ * paths:
+ *
+ * - from VMCIQPB_CREATED_NO_MEM when a new-style VMX allocates a queue
+ * pair, and attaches to a queue pair previously created by the host side.
+ *
+ * - from VMCIQPB_CREATED_MEM when the host side attaches to a queue pair
+ * already created by a guest.
+ *
+ * - from VMCIQPB_ATTACHED_NO_MEM, when an old-style VMX calls
+ * vmci_qp_broker_set_page_store (see below).
+ *
+ * - VMCIQPB_ATTACHED_NO_MEM: If the queue pair already was in the
+ * VMCIQPB_CREATED_NO_MEM due to a host side create, an old-style VMX will
+ * bring the queue pair into this state. Once vmci_qp_broker_set_page_store
+ * is called to register the user memory, the VMCIQPB_ATTACH_MEM state
+ * will be entered.
+ *
+ * From the attached queue pair, the queue pair can enter the shutdown states
+ * when either side of the queue pair detaches. If the guest side detaches
+ * first, the queue pair will enter the VMCIQPB_SHUTDOWN_NO_MEM state, where
+ * the content of the queue pair will no longer be available. If the host
+ * side detaches first, the queue pair will either enter the
+ * VMCIQPB_SHUTDOWN_MEM, if the guest memory is currently mapped, or
+ * VMCIQPB_SHUTDOWN_NO_MEM, if the guest memory is not mapped
+ * (e.g., the host detaches while a guest is stunned).
+ *
+ * New-style VMX'en will also unmap guest memory, if the guest is
+ * quiesced, e.g., during a snapshot operation. In that case, the guest
+ * memory will no longer be available, and the queue pair will transition from
+ * *_MEM state to a *_NO_MEM state. The VMX may later map the memory once more,
+ * in which case the queue pair will transition from the *_NO_MEM state at that
+ * point back to the *_MEM state. Note that the *_NO_MEM state may have changed,
+ * since the peer may have either attached or detached in the meantime. The
+ * values are laid out such that ++ on a state will move from a *_NO_MEM to a
+ * *_MEM state, and vice versa.
+ */
+
+/*
+ * VMCIMemcpy{To,From}QueueFunc() prototypes. Functions of these
+ * types are passed around to enqueue and dequeue routines. Note that
+ * often the functions passed are simply wrappers around memcpy
+ * itself.
+ *
+ * Note: In order for the memcpy typedefs to be compatible with the VMKernel,
+ * there's an unused last parameter for the hosted side. In
+ * ESX, that parameter holds a buffer type.
+ */
+typedef int vmci_memcpy_to_queue_func(struct vmci_queue *queue,
+ u64 queue_offset, const void *src,
+ size_t src_offset, size_t size);
+typedef int vmci_memcpy_from_queue_func(void *dest, size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size);
+
+/* The Kernel specific component of the struct vmci_queue structure. */
+struct vmci_queue_kern_if {
+ struct page **page;
+ struct page **header_page;
+ void *va;
+ struct mutex __mutex; /* Protects the queue. */
+ struct mutex *mutex; /* Shared by producer and consumer queues. */
+ bool host;
+ size_t num_pages;
+ bool mapped;
+};
+
+/*
+ * This structure is opaque to the clients.
+ */
+struct vmci_qp {
+ struct vmci_handle handle;
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ u64 produce_q_size;
+ u64 consume_q_size;
+ u32 peer;
+ u32 flags;
+ u32 priv_flags;
+ bool guest_endpoint;
+ unsigned int blocked;
+ unsigned int generation;
+ wait_queue_head_t event;
+};
+
+enum qp_broker_state {
+ VMCIQPB_NEW,
+ VMCIQPB_CREATED_NO_MEM,
+ VMCIQPB_CREATED_MEM,
+ VMCIQPB_ATTACHED_NO_MEM,
+ VMCIQPB_ATTACHED_MEM,
+ VMCIQPB_SHUTDOWN_NO_MEM,
+ VMCIQPB_SHUTDOWN_MEM,
+ VMCIQPB_GONE
+};
+
+#define QPBROKERSTATE_HAS_MEM(_qpb) (_qpb->state == VMCIQPB_CREATED_MEM || \
+ _qpb->state == VMCIQPB_ATTACHED_MEM || \
+ _qpb->state == VMCIQPB_SHUTDOWN_MEM)
+
+/*
+ * In the queue pair broker, we always use the guest point of view for
+ * the produce and consume queue values and references, e.g., the
+ * produce queue size stored is the guests produce queue size. The
+ * host endpoint will need to swap these around. The only exception is
+ * the local queue pairs on the host, in which case the host endpoint
+ * that creates the queue pair will have the right orientation, and
+ * the attaching host endpoint will need to swap.
+ */
+struct qp_entry {
+ struct list_head list_item;
+ struct vmci_handle handle;
+ u32 peer;
+ u32 flags;
+ u64 produce_size;
+ u64 consume_size;
+ u32 ref_count;
+};
+
+struct qp_broker_entry {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u32 create_id;
+ u32 attach_id;
+ enum qp_broker_state state;
+ bool require_trusted_attach;
+ bool created_by_trusted;
+ bool vmci_page_files; /* Created by VMX using VMCI page files */
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ struct vmci_queue_header saved_produce_q;
+ struct vmci_queue_header saved_consume_q;
+ vmci_event_release_cb wakeup_cb;
+ void *client_data;
+ void *local_mem; /* Kernel memory for local queue pair */
+};
+
+struct qp_guest_endpoint {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u64 num_ppns;
+ void *produce_q;
+ void *consume_q;
+ struct PPNSet ppn_set;
+};
+
+struct qp_list {
+ struct list_head head;
+ struct mutex mutex; /* Protect queue list. */
+};
+
+static struct qp_list qp_broker_list = {
+ .head = LIST_HEAD_INIT(qp_broker_list.head),
+ .mutex = __MUTEX_INITIALIZER(qp_broker_list.mutex),
+};
+
+static struct qp_list qp_guest_endpoints = {
+ .head = LIST_HEAD_INIT(qp_guest_endpoints.head),
+ .mutex = __MUTEX_INITIALIZER(qp_guest_endpoints.mutex),
+};
+
+#define INVALID_VMCI_GUEST_MEM_ID 0
+#define QPE_NUM_PAGES(_QPE) ((u32) \
+ (dm_div_up(_QPE.produce_size, PAGE_SIZE) + \
+ dm_div_up(_QPE.consume_size, PAGE_SIZE) + 2))
+
+
+/*
+ * Frees kernel VA space for a given queue and its queue header, and
+ * frees physical data pages.
+ */
+static void qp_free_queue(void *q, u64 size)
+{
+ struct vmci_queue *queue = q;
+
+ if (queue) {
+ u64 i = dm_div_up(size, PAGE_SIZE);
+
+ if (queue->kernel_if->mapped) {
+ vunmap(queue->kernel_if->va);
+ queue->kernel_if->va = NULL;
+ }
+
+ while (i)
+ __free_page(queue->kernel_if->page[--i]);
+
+ vfree(queue->q_header);
+ }
+}
+
+/*
+ * Allocates kernel VA space of specified size, plus space for the
+ * queue structure/kernel interface and the queue header. Allocates
+ * physical pages for the queue data pages.
+ *
+ * PAGE m: struct vmci_queue_header (struct vmci_queue->q_header)
+ * PAGE m+1: struct vmci_queue
+ * PAGE m+1+q: struct vmci_queue_kern_if (struct vmci_queue->kernel_if)
+ * PAGE n-size: Data pages (struct vmci_queue->kernel_if->page[])
+ */
+static void *qp_alloc_queue(u64 size, u32 flags)
+{
+ u64 i;
+ struct vmci_queue *queue;
+ struct vmci_queue_header *q_header;
+ const u64 num_data_pages = dm_div_up(size, PAGE_SIZE);
+ const uint queue_size =
+ PAGE_SIZE +
+ sizeof(*queue) + sizeof(*(queue->kernel_if)) +
+ num_data_pages * sizeof(*(queue->kernel_if->page));
+
+ q_header = vmalloc(queue_size);
+ if (!q_header)
+ return NULL;
+
+ queue = (void *)q_header + PAGE_SIZE;
+ queue->q_header = q_header;
+ queue->saved_header = NULL;
+ queue->kernel_if = (struct vmci_queue_kern_if *)(queue + 1);
+ queue->kernel_if->header_page = NULL; /* Unused in guest. */
+ queue->kernel_if->page = (struct page **)(queue->kernel_if + 1);
+ queue->kernel_if->host = false;
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+
+ for (i = 0; i < num_data_pages; i++) {
+ queue->kernel_if->page[i] = alloc_pages(GFP_KERNEL, 0);
+ if (!queue->kernel_if->page[i])
+ goto fail;
+ }
+
+ if (vmci_qp_pinned(flags)) {
+ queue->kernel_if->va =
+ vmap(queue->kernel_if->page, num_data_pages, VM_MAP,
+ PAGE_KERNEL);
+ if (!queue->kernel_if->va)
+ goto fail;
+
+ queue->kernel_if->mapped = true;
+ }
+
+ return (void *)queue;
+
+ fail:
+ qp_free_queue(queue, i * PAGE_SIZE);
+ return NULL;
+}
+
+/*
+ * Copies from a given buffer or iovector to a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up from this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)src;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_fromiovec((u8 *)va + page_offset,
+ iov, to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)va + page_offset,
+ (u8 *)src + bytes_copied, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Copies to a given buffer or iovector from a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_from_queue(void *dest,
+ const struct vmci_queue *queue,
+ u64 queue_offset,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)dest;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_toiovec(iov, (u8 *)va + page_offset,
+ to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)dest + bytes_copied,
+ (u8 *)va + page_offset, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Allocates two list of PPNs --- one for the pages in the produce queue,
+ * and the other for the pages in the consume queue. Intializes the list
+ * of PPNs with the page frame numbers of the KVA for the two queues (and
+ * the queue headers).
+ */
+static int qp_alloc_ppn_set(void *prod_q,
+ u64 num_produce_pages,
+ void *cons_q,
+ u64 num_consume_pages, struct PPNSet *ppn_set)
+{
+ u32 *produce_ppns;
+ u32 *consume_ppns;
+ struct vmci_queue *produce_q = prod_q;
+ struct vmci_queue *consume_q = cons_q;
+ u64 i;
+
+ if (!produce_q || !num_produce_pages || !consume_q ||
+ !num_consume_pages || !ppn_set)
+ return VMCI_ERROR_INVALID_ARGS;
+
+ if (ppn_set->initialized)
+ return VMCI_ERROR_ALREADY_EXISTS;
+
+ produce_ppns =
+ kmalloc(num_produce_pages * sizeof(*produce_ppns), GFP_KERNEL);
+ if (!produce_ppns)
+ return VMCI_ERROR_NO_MEM;
+
+ consume_ppns =
+ kmalloc(num_consume_pages * sizeof(*consume_ppns), GFP_KERNEL);
+ if (!consume_ppns) {
+ kfree(produce_ppns);
+ return VMCI_ERROR_NO_MEM;
+ }
+
+ produce_ppns[0] = page_to_pfn(vmalloc_to_page(produce_q->q_header));
+ for (i = 1; i < num_produce_pages; i++) {
+ unsigned long pfn;
+
+ produce_ppns[i] =
+ page_to_pfn(produce_q->kernel_if->page[i - 1]);
+ pfn = produce_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*produce_ppns)
+ && pfn != produce_ppns[i])
+ goto ppn_error;
+ }
+
+ consume_ppns[0] = page_to_pfn(vmalloc_to_page(consume_q->q_header));
+ for (i = 1; i < num_consume_pages; i++) {
+ unsigned long pfn;
+
+ consume_ppns[i] =
+ page_to_pfn(consume_q->kernel_if->page[i - 1]);
+ pfn = consume_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*consume_ppns)
+ && pfn != consume_ppns[i])
+ goto ppn_error;
+ }
+
+ ppn_set->num_produce_pages = num_produce_pages;
+ ppn_set->num_consume_pages = num_consume_pages;
+ ppn_set->produce_ppns = produce_ppns;
+ ppn_set->consume_ppns = consume_ppns;
+ ppn_set->initialized = true;
+ return VMCI_SUCCESS;
+
+ ppn_error:
+ kfree(produce_ppns);
+ kfree(consume_ppns);
+ return VMCI_ERROR_INVALID_ARGS;
+}
+
+/*
+ * Frees the two list of PPNs for a queue pair.
+ */
+static void qp_free_ppn_set(struct PPNSet *ppn_set)
+{
+ if (ppn_set->initialized) {
+ /* Do not call these functions on NULL inputs. */
+ kfree(ppn_set->produce_ppns);
+ kfree(ppn_set->consume_ppns);
+ }
+ memset(ppn_set, 0, sizeof(*ppn_set));
+}
+
+/*
+ * Populates the list of PPNs in the hypercall structure with the PPNS
+ * of the produce queue and the consume queue.
+ */
+static int qp_populate_ppn_set(u8 *call_buf, const struct PPNSet *ppn_set)
+{
+ memcpy(call_buf, ppn_set->produce_ppns,
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns));
+ memcpy(call_buf +
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns),
+ ppn_set->consume_ppns,
+ ppn_set->num_consume_pages * sizeof(*ppn_set->consume_ppns));
+
+ return VMCI_SUCCESS;
+}
+
+static int qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src, size_t src_offset, size_t size)
+{
+ return __qp_memcpy_to_queue(queue, queue_offset,
+ (u8 *)src + src_offset, size, false);
+}
+
+static int qp_memcpy_from_queue(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ return __qp_memcpy_from_queue((u8 *)dest + dest_offset,
+ queue, queue_offset, size, false);
+}
+
+/*
+ * Copies from a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_to_queue_iov(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t src_offset, size_t size)
+{
+
+ /*
+ * We ignore src_offset because src is really a struct iovec * and will
+ * maintain offset internally.
+ */
+ return __qp_memcpy_to_queue(queue, queue_offset, src, size, true);
+}
+
+/*
+ * Copies to a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_from_queue_iov(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ /*
+ * We ignore dest_offset because dest is really a struct iovec * and
+ * will maintain offset internally.
+ */
+ return __qp_memcpy_from_queue(dest, queue, queue_offset, size, true);
+}
+
+/*
+ * Allocates kernel VA space of specified size plus space for the queue
+ * and kernel interface. This is different from the guest queue allocator,
+ * because we do not allocate our own queue header/data pages here but
+ * share those of the guest.
+ */
+static struct vmci_queue *qp_host_alloc_queue(u64 size)
+{
+ struct vmci_queue *queue;
+ const size_t num_pages = dm_div_up(size, PAGE_SIZE) + 1;
+ const size_t queue_size = sizeof(*queue) + sizeof(*(queue->kernel_if));
+ const size_t queue_page_size =
+ num_pages * sizeof(*queue->kernel_if->page);
+
+ queue = kzalloc(queue_size + queue_page_size, GFP_KERNEL);
+ if (queue) {
+ queue->q_header = NULL;
+ queue->saved_header = NULL;
+ queue->kernel_if =
+ (struct vmci_queue_kern_if *)((u8 *)queue +
+ sizeof(*queue));
+ queue->kernel_if->host = true;
+ queue->kernel_if->mutex = NULL;
+ queue->kernel_if->num_pages = num_pages;
+ queue->kernel_if->header_page =
+ (struct page **)((u8 *)queue + queue_size);
+ queue->kernel_if->page = &queue->kernel_if->header_page[1];
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+ }
+
+ return queue;
+}
+
+/*
+ * Frees kernel memory for a given queue (header plus translation
+ * structure).
+ */
+static void qp_host_free_queue(struct vmci_queue *queue, u64 queue_size)
+{
+ kfree(queue);
+}
+
+/*
+ * Initialize the mutex for the pair of queues. This mutex is used to
+ * protect the q_header and the buffer from changing out from under any
+ * users of either queue. Of course, it's only any good if the mutexes
+ * are actually acquired. Queue structure must lie on non-paged memory
+ * or we cannot guarantee access to the mutex.
+ */
+static void qp_init_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ /*
+ * Only the host queue has shared state - the guest queues do not
+ * need to synchronize access using a queue mutex.
+ */
+
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ consume_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ mutex_init(produce_q->kernel_if->mutex);
+ }
+}
+
+/*
+ * Cleans up the mutex for the pair of queues.
+ */
+static void qp_cleanup_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = NULL;
+ consume_q->kernel_if->mutex = NULL;
+ }
+}
+
+/*
+ * Acquire the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_acquire_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_lock(queue->kernel_if->mutex);
+}
+
+/*
+ * Release the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_release_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_unlock(queue->kernel_if->mutex);
+}
+
+/*
+ * Helper function to release pages in the PageStoreAttachInfo
+ * previously obtained using get_user_pages.
+ */
+static void qp_release_pages(struct page **pages,
+ u64 num_pages, bool dirty)
+{
+ int i;
+
+ for (i = 0; i < num_pages; i++) {
+ if (dirty)
+ set_page_dirty(pages[i]);
+
+ page_cache_release(pages[i]);
+ pages[i] = NULL;
+ }
+}
+
+/*
+ * Lock the user pages referenced by the {produce,consume}Buffer
+ * struct into memory and populate the {produce,consume}Pages
+ * arrays in the attach structure with them.
+ */
+static int qp_host_get_user_memory(u64 produce_uva,
+ u64 consume_uva,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int retval;
+ int err = VMCI_SUCCESS;
+
+ down_write(¤t->mm->mmap_sem);
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) produce_uva,
+ produce_q->kernel_if->num_pages,
+ 1, 0, produce_q->kernel_if->header_page, NULL);
+ if (retval < produce_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(produce) failed (retval=%d)", retval);
+ qp_release_pages(produce_q->kernel_if->header_page, retval,
+ false);
+ err = VMCI_ERROR_NO_MEM;
+ goto out;
+ }
+
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) consume_uva,
+ consume_q->kernel_if->num_pages,
+ 1, 0, consume_q->kernel_if->header_page, NULL);
+ if (retval < consume_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(consume) failed (retval=%d)", retval);
+ qp_release_pages(consume_q->kernel_if->header_page, retval,
+ false);
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, false);
+ err = VMCI_ERROR_NO_MEM;
+ }
+
+ out:
+ up_write(¤t->mm->mmap_sem);
+
+ return err;
+}
+
+/*
+ * Registers the specification of the user pages used for backing a queue
+ * pair. Enough information to map in pages is stored in the OS specific
+ * part of the struct vmci_queue structure.
+ */
+static int qp_host_register_user_memory(struct vmci_qp_page_store *page_store,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ u64 produce_uva;
+ u64 consume_uva;
+
+ /*
+ * The new style and the old style mapping only differs in
+ * that we either get a single or two UVAs, so we split the
+ * single UVA range at the appropriate spot.
+ */
+ produce_uva = page_store->pages;
+ consume_uva = page_store->pages +
+ produce_q->kernel_if->num_pages * PAGE_SIZE;
+ return qp_host_get_user_memory(produce_uva, consume_uva, produce_q,
+ consume_q);
+}
+
+/*
+ * Releases and removes the references to user pages stored in the attach
+ * struct. Pages are released from the page cache and may become
+ * swappable again.
+ */
+static void qp_host_unregister_user_memory(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, true);
+ memset(produce_q->kernel_if->header_page, 0,
+ sizeof(*produce_q->kernel_if->header_page) *
+ produce_q->kernel_if->num_pages);
+ qp_release_pages(consume_q->kernel_if->header_page,
+ consume_q->kernel_if->num_pages, true);
+ memset(consume_q->kernel_if->header_page, 0,
+ sizeof(*consume_q->kernel_if->header_page) *
+ consume_q->kernel_if->num_pages);
+}
+
+/*
+ * Once qp_host_register_user_memory has been performed on a
+ * queue, the queue pair headers can be mapped into the
+ * kernel. Once mapped, they must be unmapped with
+ * qp_host_unmap_queues prior to calling
+ * qp_host_unregister_user_memory.
+ * Pages are pinned.
+ */
+static int qp_host_map_queues(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int result;
+
+ if (!produce_q->q_header || !consume_q->q_header) {
+ struct page *headers[2];
+
+ if (produce_q->q_header != consume_q->q_header)
+ return VMCI_ERROR_QUEUEPAIR_MISMATCH;
+
+ if (produce_q->kernel_if->header_page == NULL ||
+ *produce_q->kernel_if->header_page == NULL)
+ return VMCI_ERROR_UNAVAILABLE;
+
+ headers[0] = *produce_q->kernel_if->header_page;
+ headers[1] = *consume_q->kernel_if->header_page;
+
+ produce_q->q_header = vmap(headers, 2, VM_MAP, PAGE_KERNEL);
+ if (produce_q->q_header != NULL) {
+ consume_q->q_header =
+ (struct vmci_queue_header *)((u8 *)
+ produce_q->q_header +
+ PAGE_SIZE);
+ result = VMCI_SUCCESS;
+ } else {
+ pr_warn("vmap failed\n");
+ result = VMCI_ERROR_NO_MEM;
+ }
+ } else {
+ result = VMCI_SUCCESS;
+ }
+
+ return result;
+}
+
+/*
+ * Unmaps previously mapped queue pair headers from the kernel.
+ * Pages are unpinned.
+ */
+static int qp_host_unmap_queues(u32 gid,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->q_header) {
+ if (produce_q->q_header < consume_q->q_header)
+ vunmap(produce_q->q_header);
+ else
+ vunmap(consume_q->q_header);
+
+ produce_q->q_header = NULL;
+ consume_q->q_header = NULL;
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle. Assumes
+ * that the list is locked.
+ */
+static struct qp_entry *qp_list_find(struct qp_list *qp_list,
+ struct vmci_handle handle)
+{
+ struct qp_entry *entry;
+
+ if (vmci_handle_is_invalid(handle))
+ return NULL;
+
+ list_for_each_entry(entry, &qp_list->head, list_item) {
+ if (vmci_handle_is_equal(entry->handle, handle))
+ return entry;
+ }
+
+ return NULL;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_guest_endpoint *
+qp_guest_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_guest_endpoint *entry;
+ struct qp_entry *qp = qp_list_find(&qp_guest_endpoints, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_guest_endpoint, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_broker_entry *
+qp_broker_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_broker_entry *entry;
+ struct qp_entry *qp = qp_list_find(&qp_broker_list, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_broker_entry, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Dispatches a queue pair event message directly into the local event
+ * queue.
+ */
+static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
+{
+ u32 context_id = vmci_get_context_id();
+ struct vmci_event_qp ev;
+
+ ev.msg.hdr.dst = vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
+ ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID);
+ ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
+ ev.msg.event_data.event =
+ attach ? VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
+ ev.payload.peer_id = context_id;
+ ev.payload.handle = handle;
+
+ return vmci_event_dispatch(&ev.msg.hdr);
+}
+
+/*
+ * Allocates and initializes a qp_guest_endpoint structure.
+ * Allocates a queue_pair rid (and handle) iff the given entry has
+ * an invalid handle. 0 through VMCI_RESERVED_RESOURCE_ID_MAX
+ * are reserved handles. Assumes that the QP list mutex is held
+ * by the caller.
+ */
+static struct qp_guest_endpoint *
+qp_guest_endpoint_create(struct vmci_handle handle,
+ u32 peer,
+ u32 flags,
+ u64 produce_size,
+ u64 consume_size,
+ void *produce_q,
+ void *consume_q)
+{
+ int result;
+ struct qp_guest_endpoint *entry;
+ /* One page each for the queue headers. */
+ const u64 num_ppns = dm_div_up(produce_size, PAGE_SIZE) +
+ dm_div_up(consume_size, PAGE_SIZE) + 2;
+
+ if (vmci_handle_is_invalid(handle)) {
+ u32 context_id = vmci_get_context_id();
+
+ handle = vmci_make_handle(context_id, VMCI_INVALID_ID);
+ }
+
+ entry = kzalloc(sizeof(*entry), GFP_KERNEL);
+ if (entry) {
+ entry->qp.peer = peer;
+ entry->qp.flags = flags;
+ entry->qp.produce_size = produce_size;
+ entry->qp.consume_size = consume_size;
+ entry->qp.ref_count = 0;
]
]
|
| 162/2 |
2026/05/09 22:56 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 57366
output: 48
thoughts: 86
Thoughts: Okay, here's my take on those thoughts, framed as an expert's internal monologue:
**Investigating a Potential Notification Issue**
Alright, based on that `grepper` output I saw earlier, specifically looking at `qp_notify_peer`, it looks like `vmci_qp_broker_detach` is calling it, and that's happening at line 2188 in the current code base. My gut feeling is that we might be having a notification issue related to this call, so I need to dig deeper. The first thing I'll do is check the `git blame` for `vmci_qp_broker_detach`. I need to see the history of that function in `drivers/misc/vmw_vmci/vmci_queue_pair.c` to understand any recent modifications that might be relevant to this notification and possible notification error, such as when it was introduced, any related bug fixes, or any refactoring that might have touched this area. A quick check of the blame will give me some context before I dive into the code more thoroughly. It's a good starting point for tracing the potential issue related to the `qp_notify_peer` call.
|
| 163/2 |
2026/05/09 22:56 |
tool |
git-blame |
0m
Args: map[End:2200 File:drivers/misc/vmw_vmci/vmci_queue_pair.c Start:2180]
Results: map[Output:06164d2b72aa7 2180) qp_host_free_queue(entry->consume_q, entry->qp.consume_size);
06164d2b72aa7 2181) /* Unlink from resource hash table and free callback */
06164d2b72aa7 2182) vmci_resource_remove(&entry->resource);
06164d2b72aa7 2183)
06164d2b72aa7 2184) kfree(entry);
06164d2b72aa7 2185)
06164d2b72aa7 2186) vmci_ctx_qp_destroy(context, handle);
06164d2b72aa7 2187) } else {
06164d2b72aa7 2188) qp_notify_peer(false, handle, context_id, peer_id);
06164d2b72aa7 2189) if (context_id == VMCI_HOST_CONTEXT_ID &&
06164d2b72aa7 2190) QPBROKERSTATE_HAS_MEM(entry)) {
06164d2b72aa7 2191) entry->state = VMCIQPB_SHUTDOWN_MEM;
06164d2b72aa7 2192) } else {
06164d2b72aa7 2193) entry->state = VMCIQPB_SHUTDOWN_NO_MEM;
06164d2b72aa7 2194) }
06164d2b72aa7 2195)
06164d2b72aa7 2196) if (!is_local)
06164d2b72aa7 2197) vmci_ctx_qp_destroy(context, handle);
06164d2b72aa7 2198)
06164d2b72aa7 2199) }
06164d2b72aa7 2200) result = VMCI_SUCCESS;
]
|
| 164/2 |
2026/05/09 22:56 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 58379
output: 48
thoughts: 91
Thoughts: Okay, here's my summary, presented as a stream of thought:
**Tracing the Origins of a Function Call**
Alright, let's see... the `qp_notify_peer` function, I recall that's a relatively recent addition, and my records confirm that it's from commit `06164d2b72aa752ce4633184b3e0d97601017135`. Now, I need to understand its relationship with other parts of the system. I suspect it's related to the queue pair functionality. Specifically, I'm interested in how it hooks into the broker attachment process.
To confirm my suspicions and to grasp the broader context, I need to see when `qp_broker_attach` in `drivers/misc/vmw_vmci/vmci_queue_pair.c` was introduced or modified in relation to `qp_notify_peer`. Therefore, I should run a `git blame` on that function to trace its commit history and see if it was modified around the same time as `qp_notify_peer`. This will give me a clear picture of how they interact and where potential issues might be.
|
| 165/2 |
2026/05/09 22:56 |
tool |
git-blame |
0m
Args: map[End:1670 File:drivers/misc/vmw_vmci/vmci_queue_pair.c Start:1650]
Results: map[Output:06164d2b72aa7 1650) * The host side is attempting to attach to a queue
06164d2b72aa7 1651) * pair that doesn't have any memory associated with
06164d2b72aa7 1652) * it. This must be a pre NOVMVM vmx that hasn't set
06164d2b72aa7 1653) * the page store information yet, or a quiesced VM.
06164d2b72aa7 1654) */
06164d2b72aa7 1655)
06164d2b72aa7 1656) return VMCI_ERROR_UNAVAILABLE;
06164d2b72aa7 1657) } else {
06164d2b72aa7 1658) /* The host side has successfully attached to a queue pair. */
06164d2b72aa7 1659) entry->state = VMCIQPB_ATTACHED_MEM;
06164d2b72aa7 1660) }
06164d2b72aa7 1661)
06164d2b72aa7 1662) if (entry->state == VMCIQPB_ATTACHED_MEM) {
06164d2b72aa7 1663) result =
06164d2b72aa7 1664) qp_notify_peer(true, entry->qp.handle, context_id,
06164d2b72aa7 1665) entry->create_id);
06164d2b72aa7 1666) if (result < VMCI_SUCCESS)
06164d2b72aa7 1667) pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
06164d2b72aa7 1668) entry->create_id, entry->qp.handle.context,
06164d2b72aa7 1669) entry->qp.handle.resource);
06164d2b72aa7 1670) }
]
|
| 166/2 |
2026/05/09 22:56 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 59438
output: 48
thoughts: 17
Thoughts: Okay, here's my interpretation of that thought process, tailored for an expert audience, and presented in the first person:
**Analyzing `vmci_ctx_put` in `qp_broker_attach`**
Alright, so I'm looking at the `vmci_ctx_put` function within the `qp_broker_attach` context. My immediate thought is, what are the implications of placing this function call here? Given my understanding of the larger system architecture, `qp_broker_attach` is clearly a critical point for resource management and connection establishment. `vmci_ctx_put` likely involves releasing a Virtual Machine Communication Interface (VMCI) context, so I need to understand why it’s being done here.
Is this context release happening *after* a successful connection? Is it due to an error, a disconnection, or during clean-up? Knowing the exact conditions under which this call executes is paramount. I'm already mentally running through the possible code paths that lead to `qp_broker_attach` and tracing the lifecycle of the VMCI context.
Is there a potential for resource leaks if a failure occurs *before* this `vmci_ctx_put` call? That would be a major concern, and I need to investigate any error handling present. I also need to verify that this context release is paired with a corresponding allocation or reference increment somewhere. Improper pairing is always a red flag.
Moreover, I want to consider the potential for race conditions or synchronization issues. If multiple threads or processes can access this context, when and how is access being serialized? Am I dealing with a simple reference count, a mutex, or something more complex? The timing of this release is crucial, and it needs to be robust under all plausible scenarios. I’ll need to check the code around `qp_broker_attach` for any obvious synchronization primitives or their absence. Finally, I'm thinking about the potential performance impact, particularly if this context is released frequently. It will be helpful to know the overall impact of this function call.
|
| 167/2 |
2026/05/09 22:56 |
tool |
git-blame |
0m
Args: map[End:1595 File:drivers/misc/vmw_vmci/vmci_queue_pair.c Start:1580]
Results: map[Output:06164d2b72aa7 1580)
06164d2b72aa7 1581) /*
06164d2b72aa7 1582) * Do not attach a host to a user created queue pair if that
06164d2b72aa7 1583) * user doesn't support host queue pair end points.
06164d2b72aa7 1584) */
06164d2b72aa7 1585)
06164d2b72aa7 1586) create_context = vmci_ctx_get(entry->create_id);
06164d2b72aa7 1587) supports_host_qp = vmci_ctx_supports_host_qp(create_context);
06164d2b72aa7 1588) vmci_ctx_put(create_context);
06164d2b72aa7 1589)
06164d2b72aa7 1590) if (!supports_host_qp)
06164d2b72aa7 1591) return VMCI_ERROR_INVALID_RESOURCE;
06164d2b72aa7 1592) }
06164d2b72aa7 1593)
06164d2b72aa7 1594) if ((entry->qp.flags & ~VMCI_QP_ASYMM) != (flags & ~VMCI_QP_ASYMM_PEER))
06164d2b72aa7 1595) return VMCI_ERROR_QUEUEPAIR_MISMATCH;
]
|
| 168/2 |
2026/05/09 22:56 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 60417
output: 53
thoughts: 275
Thoughts: **Analyzing the VMCI Queue Pair Deadlock**
Okay, so the issue definitely stems from commit `06164d2b72aa752ce4633184b3e0d97601017135`. That's the one titled "VMCI: queue pairs implementation." This looks like the first implementation of queue pairs, so naturally, that's where I need to start.
Now, before I jump to conclusions, I need to rule out any other potential culprits. Let's see if there were any subsequent commits that might have inadvertently exacerbated the problem, but my gut tells me this is the root cause. This deadlock is that nasty recursive locking scenario. I know the problem: `qp_notify_peer` indirectly calls `vmci_ctx_put`. And that's the rub! Because `vmci_ctx_put` can, *synchronously*, call `ctx_free_ctx`, and `ctx_free_ctx` calls `vmci_qp_broker_detach`. Which, in turn, tries to grab `qp_broker_list.mutex` again. Pure deadlock.
The critical question now is, was `vmci_ctx_put` *actually* calling `ctx_free_ctx` synchronously in that original commit? The key lies in understanding the control flow there. Time to dig into the code for `vmci_ctx_put` as it was implemented in `06164d2b72aa752ce4633184b3e0d97601017135`. That's the line I need to trace and understand.
|
| 169/2 |
2026/05/09 22:56 |
tool |
git-show |
0m
Args: map[Commit:06164d2b72aa752ce4633184b3e0d97601017135]
Results: map[Output:
Full output is too long, showing 1000 out of 3636 lines.
[commit 06164d2b72aa752ce4633184b3e0d97601017135
Author: George Zhang <georgezhang@vmware.com>
Date: Tue Jan 8 15:54:54 2013 -0800
VMCI: queue pairs implementation.
VMCI queue pairs allow for bi-directional ordered communication between host and guests.
Signed-off-by: George Zhang <georgezhang@vmware.com>
Acked-by: Andy king <acking@vmware.com>
Acked-by: Dmitry Torokhov <dtor@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
new file mode 100644
index 000000000000..1123111ba1bf
--- /dev/null
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -0,0 +1,3420 @@
+/*
+ * VMware VMCI Driver
+ *
+ * Copyright (C) 2012 VMware, Inc. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation version 2 and no later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ */
+
+#include <linux/device-mapper.h>
+#include <linux/vmw_vmci_defs.h>
+#include <linux/vmw_vmci_api.h>
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/mutex.h>
+#include <linux/socket.h>
+#include <linux/wait.h>
+
+#include "vmci_handle_array.h"
+#include "vmci_queue_pair.h"
+#include "vmci_datagram.h"
+#include "vmci_resource.h"
+#include "vmci_context.h"
+#include "vmci_driver.h"
+#include "vmci_event.h"
+#include "vmci_route.h"
+
+/*
+ * In the following, we will distinguish between two kinds of VMX processes -
+ * the ones with versions lower than VMCI_VERSION_NOVMVM that use specialized
+ * VMCI page files in the VMX and supporting VM to VM communication and the
+ * newer ones that use the guest memory directly. We will in the following
+ * refer to the older VMX versions as old-style VMX'en, and the newer ones as
+ * new-style VMX'en.
+ *
+ * The state transition datagram is as follows (the VMCIQPB_ prefix has been
+ * removed for readability) - see below for more details on the transtions:
+ *
+ * -------------- NEW -------------
+ * | |
+ * \_/ \_/
+ * CREATED_NO_MEM <-----------------> CREATED_MEM
+ * | | |
+ * | o-----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * ATTACHED_NO_MEM <----------------> ATTACHED_MEM
+ * | | |
+ * | o----------------------o |
+ * | | |
+ * \_/ \_/ \_/
+ * SHUTDOWN_NO_MEM <----------------> SHUTDOWN_MEM
+ * | |
+ * | |
+ * -------------> gone <-------------
+ *
+ * In more detail. When a VMCI queue pair is first created, it will be in the
+ * VMCIQPB_NEW state. It will then move into one of the following states:
+ *
+ * - VMCIQPB_CREATED_NO_MEM: this state indicates that either:
+ *
+ * - the created was performed by a host endpoint, in which case there is
+ * no backing memory yet.
+ *
+ * - the create was initiated by an old-style VMX, that uses
+ * vmci_qp_broker_set_page_store to specify the UVAs of the queue pair at
+ * a later point in time. This state can be distinguished from the one
+ * above by the context ID of the creator. A host side is not allowed to
+ * attach until the page store has been set.
+ *
+ * - VMCIQPB_CREATED_MEM: this state is the result when the queue pair
+ * is created by a VMX using the queue pair device backend that
+ * sets the UVAs of the queue pair immediately and stores the
+ * information for later attachers. At this point, it is ready for
+ * the host side to attach to it.
+ *
+ * Once the queue pair is in one of the created states (with the exception of
+ * the case mentioned for older VMX'en above), it is possible to attach to the
+ * queue pair. Again we have two new states possible:
+ *
+ * - VMCIQPB_ATTACHED_MEM: this state can be reached through the following
+ * paths:
+ *
+ * - from VMCIQPB_CREATED_NO_MEM when a new-style VMX allocates a queue
+ * pair, and attaches to a queue pair previously created by the host side.
+ *
+ * - from VMCIQPB_CREATED_MEM when the host side attaches to a queue pair
+ * already created by a guest.
+ *
+ * - from VMCIQPB_ATTACHED_NO_MEM, when an old-style VMX calls
+ * vmci_qp_broker_set_page_store (see below).
+ *
+ * - VMCIQPB_ATTACHED_NO_MEM: If the queue pair already was in the
+ * VMCIQPB_CREATED_NO_MEM due to a host side create, an old-style VMX will
+ * bring the queue pair into this state. Once vmci_qp_broker_set_page_store
+ * is called to register the user memory, the VMCIQPB_ATTACH_MEM state
+ * will be entered.
+ *
+ * From the attached queue pair, the queue pair can enter the shutdown states
+ * when either side of the queue pair detaches. If the guest side detaches
+ * first, the queue pair will enter the VMCIQPB_SHUTDOWN_NO_MEM state, where
+ * the content of the queue pair will no longer be available. If the host
+ * side detaches first, the queue pair will either enter the
+ * VMCIQPB_SHUTDOWN_MEM, if the guest memory is currently mapped, or
+ * VMCIQPB_SHUTDOWN_NO_MEM, if the guest memory is not mapped
+ * (e.g., the host detaches while a guest is stunned).
+ *
+ * New-style VMX'en will also unmap guest memory, if the guest is
+ * quiesced, e.g., during a snapshot operation. In that case, the guest
+ * memory will no longer be available, and the queue pair will transition from
+ * *_MEM state to a *_NO_MEM state. The VMX may later map the memory once more,
+ * in which case the queue pair will transition from the *_NO_MEM state at that
+ * point back to the *_MEM state. Note that the *_NO_MEM state may have changed,
+ * since the peer may have either attached or detached in the meantime. The
+ * values are laid out such that ++ on a state will move from a *_NO_MEM to a
+ * *_MEM state, and vice versa.
+ */
+
+/*
+ * VMCIMemcpy{To,From}QueueFunc() prototypes. Functions of these
+ * types are passed around to enqueue and dequeue routines. Note that
+ * often the functions passed are simply wrappers around memcpy
+ * itself.
+ *
+ * Note: In order for the memcpy typedefs to be compatible with the VMKernel,
+ * there's an unused last parameter for the hosted side. In
+ * ESX, that parameter holds a buffer type.
+ */
+typedef int vmci_memcpy_to_queue_func(struct vmci_queue *queue,
+ u64 queue_offset, const void *src,
+ size_t src_offset, size_t size);
+typedef int vmci_memcpy_from_queue_func(void *dest, size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size);
+
+/* The Kernel specific component of the struct vmci_queue structure. */
+struct vmci_queue_kern_if {
+ struct page **page;
+ struct page **header_page;
+ void *va;
+ struct mutex __mutex; /* Protects the queue. */
+ struct mutex *mutex; /* Shared by producer and consumer queues. */
+ bool host;
+ size_t num_pages;
+ bool mapped;
+};
+
+/*
+ * This structure is opaque to the clients.
+ */
+struct vmci_qp {
+ struct vmci_handle handle;
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ u64 produce_q_size;
+ u64 consume_q_size;
+ u32 peer;
+ u32 flags;
+ u32 priv_flags;
+ bool guest_endpoint;
+ unsigned int blocked;
+ unsigned int generation;
+ wait_queue_head_t event;
+};
+
+enum qp_broker_state {
+ VMCIQPB_NEW,
+ VMCIQPB_CREATED_NO_MEM,
+ VMCIQPB_CREATED_MEM,
+ VMCIQPB_ATTACHED_NO_MEM,
+ VMCIQPB_ATTACHED_MEM,
+ VMCIQPB_SHUTDOWN_NO_MEM,
+ VMCIQPB_SHUTDOWN_MEM,
+ VMCIQPB_GONE
+};
+
+#define QPBROKERSTATE_HAS_MEM(_qpb) (_qpb->state == VMCIQPB_CREATED_MEM || \
+ _qpb->state == VMCIQPB_ATTACHED_MEM || \
+ _qpb->state == VMCIQPB_SHUTDOWN_MEM)
+
+/*
+ * In the queue pair broker, we always use the guest point of view for
+ * the produce and consume queue values and references, e.g., the
+ * produce queue size stored is the guests produce queue size. The
+ * host endpoint will need to swap these around. The only exception is
+ * the local queue pairs on the host, in which case the host endpoint
+ * that creates the queue pair will have the right orientation, and
+ * the attaching host endpoint will need to swap.
+ */
+struct qp_entry {
+ struct list_head list_item;
+ struct vmci_handle handle;
+ u32 peer;
+ u32 flags;
+ u64 produce_size;
+ u64 consume_size;
+ u32 ref_count;
+};
+
+struct qp_broker_entry {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u32 create_id;
+ u32 attach_id;
+ enum qp_broker_state state;
+ bool require_trusted_attach;
+ bool created_by_trusted;
+ bool vmci_page_files; /* Created by VMX using VMCI page files */
+ struct vmci_queue *produce_q;
+ struct vmci_queue *consume_q;
+ struct vmci_queue_header saved_produce_q;
+ struct vmci_queue_header saved_consume_q;
+ vmci_event_release_cb wakeup_cb;
+ void *client_data;
+ void *local_mem; /* Kernel memory for local queue pair */
+};
+
+struct qp_guest_endpoint {
+ struct vmci_resource resource;
+ struct qp_entry qp;
+ u64 num_ppns;
+ void *produce_q;
+ void *consume_q;
+ struct PPNSet ppn_set;
+};
+
+struct qp_list {
+ struct list_head head;
+ struct mutex mutex; /* Protect queue list. */
+};
+
+static struct qp_list qp_broker_list = {
+ .head = LIST_HEAD_INIT(qp_broker_list.head),
+ .mutex = __MUTEX_INITIALIZER(qp_broker_list.mutex),
+};
+
+static struct qp_list qp_guest_endpoints = {
+ .head = LIST_HEAD_INIT(qp_guest_endpoints.head),
+ .mutex = __MUTEX_INITIALIZER(qp_guest_endpoints.mutex),
+};
+
+#define INVALID_VMCI_GUEST_MEM_ID 0
+#define QPE_NUM_PAGES(_QPE) ((u32) \
+ (dm_div_up(_QPE.produce_size, PAGE_SIZE) + \
+ dm_div_up(_QPE.consume_size, PAGE_SIZE) + 2))
+
+
+/*
+ * Frees kernel VA space for a given queue and its queue header, and
+ * frees physical data pages.
+ */
+static void qp_free_queue(void *q, u64 size)
+{
+ struct vmci_queue *queue = q;
+
+ if (queue) {
+ u64 i = dm_div_up(size, PAGE_SIZE);
+
+ if (queue->kernel_if->mapped) {
+ vunmap(queue->kernel_if->va);
+ queue->kernel_if->va = NULL;
+ }
+
+ while (i)
+ __free_page(queue->kernel_if->page[--i]);
+
+ vfree(queue->q_header);
+ }
+}
+
+/*
+ * Allocates kernel VA space of specified size, plus space for the
+ * queue structure/kernel interface and the queue header. Allocates
+ * physical pages for the queue data pages.
+ *
+ * PAGE m: struct vmci_queue_header (struct vmci_queue->q_header)
+ * PAGE m+1: struct vmci_queue
+ * PAGE m+1+q: struct vmci_queue_kern_if (struct vmci_queue->kernel_if)
+ * PAGE n-size: Data pages (struct vmci_queue->kernel_if->page[])
+ */
+static void *qp_alloc_queue(u64 size, u32 flags)
+{
+ u64 i;
+ struct vmci_queue *queue;
+ struct vmci_queue_header *q_header;
+ const u64 num_data_pages = dm_div_up(size, PAGE_SIZE);
+ const uint queue_size =
+ PAGE_SIZE +
+ sizeof(*queue) + sizeof(*(queue->kernel_if)) +
+ num_data_pages * sizeof(*(queue->kernel_if->page));
+
+ q_header = vmalloc(queue_size);
+ if (!q_header)
+ return NULL;
+
+ queue = (void *)q_header + PAGE_SIZE;
+ queue->q_header = q_header;
+ queue->saved_header = NULL;
+ queue->kernel_if = (struct vmci_queue_kern_if *)(queue + 1);
+ queue->kernel_if->header_page = NULL; /* Unused in guest. */
+ queue->kernel_if->page = (struct page **)(queue->kernel_if + 1);
+ queue->kernel_if->host = false;
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+
+ for (i = 0; i < num_data_pages; i++) {
+ queue->kernel_if->page[i] = alloc_pages(GFP_KERNEL, 0);
+ if (!queue->kernel_if->page[i])
+ goto fail;
+ }
+
+ if (vmci_qp_pinned(flags)) {
+ queue->kernel_if->va =
+ vmap(queue->kernel_if->page, num_data_pages, VM_MAP,
+ PAGE_KERNEL);
+ if (!queue->kernel_if->va)
+ goto fail;
+
+ queue->kernel_if->mapped = true;
+ }
+
+ return (void *)queue;
+
+ fail:
+ qp_free_queue(queue, i * PAGE_SIZE);
+ return NULL;
+}
+
+/*
+ * Copies from a given buffer or iovector to a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up from this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)src;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_fromiovec((u8 *)va + page_offset,
+ iov, to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)va + page_offset,
+ (u8 *)src + bytes_copied, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Copies to a given buffer or iovector from a VMCI Queue. Uses
+ * kmap()/kunmap() to dynamically map/unmap required portions of the queue
+ * by traversing the offset -> page translation structure for the queue.
+ * Assumes that offset + size does not wrap around in the queue.
+ */
+static int __qp_memcpy_from_queue(void *dest,
+ const struct vmci_queue *queue,
+ u64 queue_offset,
+ size_t size,
+ bool is_iovec)
+{
+ struct vmci_queue_kern_if *kernel_if = queue->kernel_if;
+ size_t bytes_copied = 0;
+
+ while (bytes_copied < size) {
+ u64 page_index = (queue_offset + bytes_copied) / PAGE_SIZE;
+ size_t page_offset =
+ (queue_offset + bytes_copied) & (PAGE_SIZE - 1);
+ void *va;
+ size_t to_copy;
+
+ if (!kernel_if->mapped)
+ va = kmap(kernel_if->page[page_index]);
+ else
+ va = (void *)((u8 *)kernel_if->va +
+ (page_index * PAGE_SIZE));
+
+ if (size - bytes_copied > PAGE_SIZE - page_offset)
+ /* Enough payload to fill up this page. */
+ to_copy = PAGE_SIZE - page_offset;
+ else
+ to_copy = size - bytes_copied;
+
+ if (is_iovec) {
+ struct iovec *iov = (struct iovec *)dest;
+ int err;
+
+ /* The iovec will track bytes_copied internally. */
+ err = memcpy_toiovec(iov, (u8 *)va + page_offset,
+ to_copy);
+ if (err != 0) {
+ kunmap(kernel_if->page[page_index]);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+ } else {
+ memcpy((u8 *)dest + bytes_copied,
+ (u8 *)va + page_offset, to_copy);
+ }
+
+ bytes_copied += to_copy;
+ if (!kernel_if->mapped)
+ kunmap(kernel_if->page[page_index]);
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Allocates two list of PPNs --- one for the pages in the produce queue,
+ * and the other for the pages in the consume queue. Intializes the list
+ * of PPNs with the page frame numbers of the KVA for the two queues (and
+ * the queue headers).
+ */
+static int qp_alloc_ppn_set(void *prod_q,
+ u64 num_produce_pages,
+ void *cons_q,
+ u64 num_consume_pages, struct PPNSet *ppn_set)
+{
+ u32 *produce_ppns;
+ u32 *consume_ppns;
+ struct vmci_queue *produce_q = prod_q;
+ struct vmci_queue *consume_q = cons_q;
+ u64 i;
+
+ if (!produce_q || !num_produce_pages || !consume_q ||
+ !num_consume_pages || !ppn_set)
+ return VMCI_ERROR_INVALID_ARGS;
+
+ if (ppn_set->initialized)
+ return VMCI_ERROR_ALREADY_EXISTS;
+
+ produce_ppns =
+ kmalloc(num_produce_pages * sizeof(*produce_ppns), GFP_KERNEL);
+ if (!produce_ppns)
+ return VMCI_ERROR_NO_MEM;
+
+ consume_ppns =
+ kmalloc(num_consume_pages * sizeof(*consume_ppns), GFP_KERNEL);
+ if (!consume_ppns) {
+ kfree(produce_ppns);
+ return VMCI_ERROR_NO_MEM;
+ }
+
+ produce_ppns[0] = page_to_pfn(vmalloc_to_page(produce_q->q_header));
+ for (i = 1; i < num_produce_pages; i++) {
+ unsigned long pfn;
+
+ produce_ppns[i] =
+ page_to_pfn(produce_q->kernel_if->page[i - 1]);
+ pfn = produce_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*produce_ppns)
+ && pfn != produce_ppns[i])
+ goto ppn_error;
+ }
+
+ consume_ppns[0] = page_to_pfn(vmalloc_to_page(consume_q->q_header));
+ for (i = 1; i < num_consume_pages; i++) {
+ unsigned long pfn;
+
+ consume_ppns[i] =
+ page_to_pfn(consume_q->kernel_if->page[i - 1]);
+ pfn = consume_ppns[i];
+
+ /* Fail allocation if PFN isn't supported by hypervisor. */
+ if (sizeof(pfn) > sizeof(*consume_ppns)
+ && pfn != consume_ppns[i])
+ goto ppn_error;
+ }
+
+ ppn_set->num_produce_pages = num_produce_pages;
+ ppn_set->num_consume_pages = num_consume_pages;
+ ppn_set->produce_ppns = produce_ppns;
+ ppn_set->consume_ppns = consume_ppns;
+ ppn_set->initialized = true;
+ return VMCI_SUCCESS;
+
+ ppn_error:
+ kfree(produce_ppns);
+ kfree(consume_ppns);
+ return VMCI_ERROR_INVALID_ARGS;
+}
+
+/*
+ * Frees the two list of PPNs for a queue pair.
+ */
+static void qp_free_ppn_set(struct PPNSet *ppn_set)
+{
+ if (ppn_set->initialized) {
+ /* Do not call these functions on NULL inputs. */
+ kfree(ppn_set->produce_ppns);
+ kfree(ppn_set->consume_ppns);
+ }
+ memset(ppn_set, 0, sizeof(*ppn_set));
+}
+
+/*
+ * Populates the list of PPNs in the hypercall structure with the PPNS
+ * of the produce queue and the consume queue.
+ */
+static int qp_populate_ppn_set(u8 *call_buf, const struct PPNSet *ppn_set)
+{
+ memcpy(call_buf, ppn_set->produce_ppns,
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns));
+ memcpy(call_buf +
+ ppn_set->num_produce_pages * sizeof(*ppn_set->produce_ppns),
+ ppn_set->consume_ppns,
+ ppn_set->num_consume_pages * sizeof(*ppn_set->consume_ppns));
+
+ return VMCI_SUCCESS;
+}
+
+static int qp_memcpy_to_queue(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src, size_t src_offset, size_t size)
+{
+ return __qp_memcpy_to_queue(queue, queue_offset,
+ (u8 *)src + src_offset, size, false);
+}
+
+static int qp_memcpy_from_queue(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ return __qp_memcpy_from_queue((u8 *)dest + dest_offset,
+ queue, queue_offset, size, false);
+}
+
+/*
+ * Copies from a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_to_queue_iov(struct vmci_queue *queue,
+ u64 queue_offset,
+ const void *src,
+ size_t src_offset, size_t size)
+{
+
+ /*
+ * We ignore src_offset because src is really a struct iovec * and will
+ * maintain offset internally.
+ */
+ return __qp_memcpy_to_queue(queue, queue_offset, src, size, true);
+}
+
+/*
+ * Copies to a given iovec from a VMCI Queue.
+ */
+static int qp_memcpy_from_queue_iov(void *dest,
+ size_t dest_offset,
+ const struct vmci_queue *queue,
+ u64 queue_offset, size_t size)
+{
+ /*
+ * We ignore dest_offset because dest is really a struct iovec * and
+ * will maintain offset internally.
+ */
+ return __qp_memcpy_from_queue(dest, queue, queue_offset, size, true);
+}
+
+/*
+ * Allocates kernel VA space of specified size plus space for the queue
+ * and kernel interface. This is different from the guest queue allocator,
+ * because we do not allocate our own queue header/data pages here but
+ * share those of the guest.
+ */
+static struct vmci_queue *qp_host_alloc_queue(u64 size)
+{
+ struct vmci_queue *queue;
+ const size_t num_pages = dm_div_up(size, PAGE_SIZE) + 1;
+ const size_t queue_size = sizeof(*queue) + sizeof(*(queue->kernel_if));
+ const size_t queue_page_size =
+ num_pages * sizeof(*queue->kernel_if->page);
+
+ queue = kzalloc(queue_size + queue_page_size, GFP_KERNEL);
+ if (queue) {
+ queue->q_header = NULL;
+ queue->saved_header = NULL;
+ queue->kernel_if =
+ (struct vmci_queue_kern_if *)((u8 *)queue +
+ sizeof(*queue));
+ queue->kernel_if->host = true;
+ queue->kernel_if->mutex = NULL;
+ queue->kernel_if->num_pages = num_pages;
+ queue->kernel_if->header_page =
+ (struct page **)((u8 *)queue + queue_size);
+ queue->kernel_if->page = &queue->kernel_if->header_page[1];
+ queue->kernel_if->va = NULL;
+ queue->kernel_if->mapped = false;
+ }
+
+ return queue;
+}
+
+/*
+ * Frees kernel memory for a given queue (header plus translation
+ * structure).
+ */
+static void qp_host_free_queue(struct vmci_queue *queue, u64 queue_size)
+{
+ kfree(queue);
+}
+
+/*
+ * Initialize the mutex for the pair of queues. This mutex is used to
+ * protect the q_header and the buffer from changing out from under any
+ * users of either queue. Of course, it's only any good if the mutexes
+ * are actually acquired. Queue structure must lie on non-paged memory
+ * or we cannot guarantee access to the mutex.
+ */
+static void qp_init_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ /*
+ * Only the host queue has shared state - the guest queues do not
+ * need to synchronize access using a queue mutex.
+ */
+
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ consume_q->kernel_if->mutex = &produce_q->kernel_if->__mutex;
+ mutex_init(produce_q->kernel_if->mutex);
+ }
+}
+
+/*
+ * Cleans up the mutex for the pair of queues.
+ */
+static void qp_cleanup_queue_mutex(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->kernel_if->host) {
+ produce_q->kernel_if->mutex = NULL;
+ consume_q->kernel_if->mutex = NULL;
+ }
+}
+
+/*
+ * Acquire the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_acquire_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_lock(queue->kernel_if->mutex);
+}
+
+/*
+ * Release the mutex for the queue. Note that the produce_q and
+ * the consume_q share a mutex. So, only one of the two need to
+ * be passed in to this routine. Either will work just fine.
+ */
+static void qp_release_queue_mutex(struct vmci_queue *queue)
+{
+ if (queue->kernel_if->host)
+ mutex_unlock(queue->kernel_if->mutex);
+}
+
+/*
+ * Helper function to release pages in the PageStoreAttachInfo
+ * previously obtained using get_user_pages.
+ */
+static void qp_release_pages(struct page **pages,
+ u64 num_pages, bool dirty)
+{
+ int i;
+
+ for (i = 0; i < num_pages; i++) {
+ if (dirty)
+ set_page_dirty(pages[i]);
+
+ page_cache_release(pages[i]);
+ pages[i] = NULL;
+ }
+}
+
+/*
+ * Lock the user pages referenced by the {produce,consume}Buffer
+ * struct into memory and populate the {produce,consume}Pages
+ * arrays in the attach structure with them.
+ */
+static int qp_host_get_user_memory(u64 produce_uva,
+ u64 consume_uva,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int retval;
+ int err = VMCI_SUCCESS;
+
+ down_write(¤t->mm->mmap_sem);
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) produce_uva,
+ produce_q->kernel_if->num_pages,
+ 1, 0, produce_q->kernel_if->header_page, NULL);
+ if (retval < produce_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(produce) failed (retval=%d)", retval);
+ qp_release_pages(produce_q->kernel_if->header_page, retval,
+ false);
+ err = VMCI_ERROR_NO_MEM;
+ goto out;
+ }
+
+ retval = get_user_pages(current,
+ current->mm,
+ (uintptr_t) consume_uva,
+ consume_q->kernel_if->num_pages,
+ 1, 0, consume_q->kernel_if->header_page, NULL);
+ if (retval < consume_q->kernel_if->num_pages) {
+ pr_warn("get_user_pages(consume) failed (retval=%d)", retval);
+ qp_release_pages(consume_q->kernel_if->header_page, retval,
+ false);
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, false);
+ err = VMCI_ERROR_NO_MEM;
+ }
+
+ out:
+ up_write(¤t->mm->mmap_sem);
+
+ return err;
+}
+
+/*
+ * Registers the specification of the user pages used for backing a queue
+ * pair. Enough information to map in pages is stored in the OS specific
+ * part of the struct vmci_queue structure.
+ */
+static int qp_host_register_user_memory(struct vmci_qp_page_store *page_store,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ u64 produce_uva;
+ u64 consume_uva;
+
+ /*
+ * The new style and the old style mapping only differs in
+ * that we either get a single or two UVAs, so we split the
+ * single UVA range at the appropriate spot.
+ */
+ produce_uva = page_store->pages;
+ consume_uva = page_store->pages +
+ produce_q->kernel_if->num_pages * PAGE_SIZE;
+ return qp_host_get_user_memory(produce_uva, consume_uva, produce_q,
+ consume_q);
+}
+
+/*
+ * Releases and removes the references to user pages stored in the attach
+ * struct. Pages are released from the page cache and may become
+ * swappable again.
+ */
+static void qp_host_unregister_user_memory(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ qp_release_pages(produce_q->kernel_if->header_page,
+ produce_q->kernel_if->num_pages, true);
+ memset(produce_q->kernel_if->header_page, 0,
+ sizeof(*produce_q->kernel_if->header_page) *
+ produce_q->kernel_if->num_pages);
+ qp_release_pages(consume_q->kernel_if->header_page,
+ consume_q->kernel_if->num_pages, true);
+ memset(consume_q->kernel_if->header_page, 0,
+ sizeof(*consume_q->kernel_if->header_page) *
+ consume_q->kernel_if->num_pages);
+}
+
+/*
+ * Once qp_host_register_user_memory has been performed on a
+ * queue, the queue pair headers can be mapped into the
+ * kernel. Once mapped, they must be unmapped with
+ * qp_host_unmap_queues prior to calling
+ * qp_host_unregister_user_memory.
+ * Pages are pinned.
+ */
+static int qp_host_map_queues(struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ int result;
+
+ if (!produce_q->q_header || !consume_q->q_header) {
+ struct page *headers[2];
+
+ if (produce_q->q_header != consume_q->q_header)
+ return VMCI_ERROR_QUEUEPAIR_MISMATCH;
+
+ if (produce_q->kernel_if->header_page == NULL ||
+ *produce_q->kernel_if->header_page == NULL)
+ return VMCI_ERROR_UNAVAILABLE;
+
+ headers[0] = *produce_q->kernel_if->header_page;
+ headers[1] = *consume_q->kernel_if->header_page;
+
+ produce_q->q_header = vmap(headers, 2, VM_MAP, PAGE_KERNEL);
+ if (produce_q->q_header != NULL) {
+ consume_q->q_header =
+ (struct vmci_queue_header *)((u8 *)
+ produce_q->q_header +
+ PAGE_SIZE);
+ result = VMCI_SUCCESS;
+ } else {
+ pr_warn("vmap failed\n");
+ result = VMCI_ERROR_NO_MEM;
+ }
+ } else {
+ result = VMCI_SUCCESS;
+ }
+
+ return result;
+}
+
+/*
+ * Unmaps previously mapped queue pair headers from the kernel.
+ * Pages are unpinned.
+ */
+static int qp_host_unmap_queues(u32 gid,
+ struct vmci_queue *produce_q,
+ struct vmci_queue *consume_q)
+{
+ if (produce_q->q_header) {
+ if (produce_q->q_header < consume_q->q_header)
+ vunmap(produce_q->q_header);
+ else
+ vunmap(consume_q->q_header);
+
+ produce_q->q_header = NULL;
+ consume_q->q_header = NULL;
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle. Assumes
+ * that the list is locked.
+ */
+static struct qp_entry *qp_list_find(struct qp_list *qp_list,
+ struct vmci_handle handle)
+{
+ struct qp_entry *entry;
+
+ if (vmci_handle_is_invalid(handle))
+ return NULL;
+
+ list_for_each_entry(entry, &qp_list->head, list_item) {
+ if (vmci_handle_is_equal(entry->handle, handle))
+ return entry;
+ }
+
+ return NULL;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_guest_endpoint *
+qp_guest_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_guest_endpoint *entry;
+ struct qp_entry *qp = qp_list_find(&qp_guest_endpoints, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_guest_endpoint, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Finds the entry in the list corresponding to a given handle.
+ */
+static struct qp_broker_entry *
+qp_broker_handle_to_entry(struct vmci_handle handle)
+{
+ struct qp_broker_entry *entry;
+ struct qp_entry *qp = qp_list_find(&qp_broker_list, handle);
+
+ entry = qp ? container_of(
+ qp, struct qp_broker_entry, qp) : NULL;
+ return entry;
+}
+
+/*
+ * Dispatches a queue pair event message directly into the local event
+ * queue.
+ */
+static int qp_notify_peer_local(bool attach, struct vmci_handle handle)
+{
+ u32 context_id = vmci_get_context_id();
+ struct vmci_event_qp ev;
+
+ ev.msg.hdr.dst = vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
+ ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID);
+ ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
+ ev.msg.event_data.event =
+ attach ? VMCI_EVENT_QP_PEER_ATTACH : VMCI_EVENT_QP_PEER_DETACH;
+ ev.payload.peer_id = context_id;
+ ev.payload.handle = handle;
+
+ return vmci_event_dispatch(&ev.msg.hdr);
+}
+
+/*
+ * Allocates and initializes a qp_guest_endpoint structure.
+ * Allocates a queue_pair rid (and handle) iff the given entry has
+ * an invalid handle. 0 through VMCI_RESERVED_RESOURCE_ID_MAX
+ * are reserved handles. Assumes that the QP list mutex is held
+ * by the caller.
+ */
+static struct qp_guest_endpoint *
+qp_guest_endpoint_create(struct vmci_handle handle,
+ u32 peer,
+ u32 flags,
+ u64 produce_size,
+ u64 consume_size,
+ void *produce_q,
+ void *consume_q)
+{
+ int result;
+ struct qp_guest_endpoint *entry;
+ /* One page each for the queue headers. */
+ const u64 num_ppns = dm_div_up(produce_size, PAGE_SIZE) +
+ dm_div_up(consume_size, PAGE_SIZE) + 2;
+
+ if (vmci_handle_is_invalid(handle)) {
+ u32 context_id = vmci_get_context_id();
+
+ handle = vmci_make_handle(context_id, VMCI_INVALID_ID);
+ }
+
+ entry = kzalloc(sizeof(*entry), GFP_KERNEL);
+ if (entry) {
+ entry->qp.peer = peer;
+ entry->qp.flags = flags;
+ entry->qp.produce_size = produce_size;
+ entry->qp.consume_size = consume_size;
+ entry->qp.ref_count = 0;
]
]
|
| 170/2 |
2026/05/09 22:56 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 72595
output: 57
thoughts: 72
Thoughts: Here's my summary, as the thought process unfolds:
**Diving into vmci_ctx_put**
Okay, time to get my hands dirty. I need to understand what's happening with context management in the VMCI driver. First, let's zero in on `vmci_ctx_put`. This function, based on its name, is almost certainly responsible for releasing or deallocating a VMCI context.
The best place to start is the code itself, so let's navigate to the source. I'll need to check `drivers/misc/vmw_vmci/vmci_context.c`. I have a feeling the relevant code will be in there.
And I need to make sure I'm looking at the correct version; I'll need to go to commit `06164d2b72aa752ce4633184b3e0d97601017135`. This ensures I'm looking at the specific version that's relevant to whatever issue or analysis I'm currently focused on. With the specific commit, I am certain to get the right context!
|
| 171/2 |
2026/05/09 22:56 |
tool |
git-log |
0m
Args: map[CodeRegexp:vmci_ctx_put SourcePath:drivers/misc/vmw_vmci/vmci_context.c SymbolName:vmci_ctx_put]
Results: map[Output:28d6692cd8fb VMCI: context implementation.
]
|
| 172/2 |
2026/05/09 22:57 |
llm |
fixes-finder |
1m
Model:
Tokens:
input: 73005
output: 25
thoughts: 16
Thoughts: Okay, let's dive into this. Here's my take on those thoughts, as if they're my own:
**Investigating a Specific Identifier**
Alright, the instruction says to check `28d6692cd8fb`. That's a very specific string. Immediately, my mind jumps to a few possibilities, given my experience. Is this a commit hash? A file hash (MD5, SHA-1, etc.)? Maybe a database key? The format certainly *suggests* a cryptographic hash, likely hexadecimal. I'll need to know the *context* to determine its precise meaning. My initial thought process now begins to narrow based on that. I'm going to start by pulling up the relevant documentation or the system context that contains this identifier. From there, I'll be able to decide whether I need to search for it, or use it for comparison to get the information needed.
|
| 173/2 |
2026/05/09 22:58 |
tool |
git-show |
0m
Args:
Results: map[Output:
Full output is too long, showing 1000 out of 1422 lines.
[commit 28d6692cd8fb2a900edba5e5983be4478756ef6f
Author: George Zhang <georgezhang@vmware.com>
Date: Tue Jan 8 15:52:59 2013 -0800
VMCI: context implementation.
VMCI Context code maintains state for vmci and allows the driver to communicate
with multiple VMs.
Signed-off-by: George Zhang <georgezhang@vmware.com>
Acked-by: Andy king <acking@vmware.com>
Acked-by: Dmitry Torokhov <dtor@vmware.com>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
diff --git a/drivers/misc/vmw_vmci/vmci_context.c b/drivers/misc/vmw_vmci/vmci_context.c
new file mode 100644
index 000000000000..f866a4baecb5
--- /dev/null
+++ b/drivers/misc/vmw_vmci/vmci_context.c
@@ -0,0 +1,1214 @@
+/*
+ * VMware VMCI Driver
+ *
+ * Copyright (C) 2012 VMware, Inc. All rights reserved.
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation version 2 and no later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+ * for more details.
+ */
+
+#include <linux/vmw_vmci_defs.h>
+#include <linux/vmw_vmci_api.h>
+#include <linux/highmem.h>
+#include <linux/kernel.h>
+#include <linux/module.h>
+#include <linux/sched.h>
+#include <linux/slab.h>
+
+#include "vmci_queue_pair.h"
+#include "vmci_datagram.h"
+#include "vmci_doorbell.h"
+#include "vmci_context.h"
+#include "vmci_driver.h"
+#include "vmci_event.h"
+
+/*
+ * List of current VMCI contexts. Contexts can be added by
+ * vmci_ctx_create() and removed via vmci_ctx_destroy().
+ * These, along with context lookup, are protected by the
+ * list structure's lock.
+ */
+static struct {
+ struct list_head head;
+ spinlock_t lock; /* Spinlock for context list operations */
+} ctx_list = {
+ .head = LIST_HEAD_INIT(ctx_list.head),
+ .lock = __SPIN_LOCK_UNLOCKED(ctx_list.lock),
+};
+
+/* Used by contexts that did not set up notify flag pointers */
+static bool ctx_dummy_notify;
+
+static void ctx_signal_notify(struct vmci_ctx *context)
+{
+ *context->notify = true;
+}
+
+static void ctx_clear_notify(struct vmci_ctx *context)
+{
+ *context->notify = false;
+}
+
+/*
+ * If nothing requires the attention of the guest, clears both
+ * notify flag and call.
+ */
+static void ctx_clear_notify_call(struct vmci_ctx *context)
+{
+ if (context->pending_datagrams == 0 &&
+ vmci_handle_arr_get_size(context->pending_doorbell_array) == 0)
+ ctx_clear_notify(context);
+}
+
+/*
+ * Sets the context's notify flag iff datagrams are pending for this
+ * context. Called from vmci_setup_notify().
+ */
+void vmci_ctx_check_signal_notify(struct vmci_ctx *context)
+{
+ spin_lock(&context->lock);
+ if (context->pending_datagrams)
+ ctx_signal_notify(context);
+ spin_unlock(&context->lock);
+}
+
+/*
+ * Allocates and initializes a VMCI context.
+ */
+struct vmci_ctx *vmci_ctx_create(u32 cid, u32 priv_flags,
+ uintptr_t event_hnd,
+ int user_version,
+ const struct cred *cred)
+{
+ struct vmci_ctx *context;
+ int error;
+
+ if (cid == VMCI_INVALID_ID) {
+ pr_devel("Invalid context ID for VMCI context\n");
+ error = -EINVAL;
+ goto err_out;
+ }
+
+ if (priv_flags & ~VMCI_PRIVILEGE_ALL_FLAGS) {
+ pr_devel("Invalid flag (flags=0x%x) for VMCI context\n",
+ priv_flags);
+ error = -EINVAL;
+ goto err_out;
+ }
+
+ if (user_version == 0) {
+ pr_devel("Invalid suer_version %d\n", user_version);
+ error = -EINVAL;
+ goto err_out;
+ }
+
+ context = kzalloc(sizeof(*context), GFP_KERNEL);
+ if (!context) {
+ pr_warn("Failed to allocate memory for VMCI context\n");
+ error = -EINVAL;
+ goto err_out;
+ }
+
+ kref_init(&context->kref);
+ spin_lock_init(&context->lock);
+ INIT_LIST_HEAD(&context->list_item);
+ INIT_LIST_HEAD(&context->datagram_queue);
+ INIT_LIST_HEAD(&context->notifier_list);
+
+ /* Initialize host-specific VMCI context. */
+ init_waitqueue_head(&context->host_context.wait_queue);
+
+ context->queue_pair_array = vmci_handle_arr_create(0);
+ if (!context->queue_pair_array) {
+ error = -ENOMEM;
+ goto err_free_ctx;
+ }
+
+ context->doorbell_array = vmci_handle_arr_create(0);
+ if (!context->doorbell_array) {
+ error = -ENOMEM;
+ goto err_free_qp_array;
+ }
+
+ context->pending_doorbell_array = vmci_handle_arr_create(0);
+ if (!context->pending_doorbell_array) {
+ error = -ENOMEM;
+ goto err_free_db_array;
+ }
+
+ context->user_version = user_version;
+
+ context->priv_flags = priv_flags;
+
+ if (cred)
+ context->cred = get_cred(cred);
+
+ context->notify = &ctx_dummy_notify;
+ context->notify_page = NULL;
+
+ /*
+ * If we collide with an existing context we generate a new
+ * and use it instead. The VMX will determine if regeneration
+ * is okay. Since there isn't 4B - 16 VMs running on a given
+ * host, the below loop will terminate.
+ */
+ spin_lock(&ctx_list.lock);
+
+ while (vmci_ctx_exists(cid)) {
+ /* We reserve the lowest 16 ids for fixed contexts. */
+ cid = max(cid, VMCI_RESERVED_CID_LIMIT - 1) + 1;
+ if (cid == VMCI_INVALID_ID)
+ cid = VMCI_RESERVED_CID_LIMIT;
+ }
+ context->cid = cid;
+
+ list_add_tail_rcu(&context->list_item, &ctx_list.head);
+ spin_unlock(&ctx_list.lock);
+
+ return context;
+
+ err_free_db_array:
+ vmci_handle_arr_destroy(context->doorbell_array);
+ err_free_qp_array:
+ vmci_handle_arr_destroy(context->queue_pair_array);
+ err_free_ctx:
+ kfree(context);
+ err_out:
+ return ERR_PTR(error);
+}
+
+/*
+ * Destroy VMCI context.
+ */
+void vmci_ctx_destroy(struct vmci_ctx *context)
+{
+ spin_lock(&ctx_list.lock);
+ list_del_rcu(&context->list_item);
+ spin_unlock(&ctx_list.lock);
+ synchronize_rcu();
+
+ vmci_ctx_put(context);
+}
+
+/*
+ * Fire notification for all contexts interested in given cid.
+ */
+static int ctx_fire_notification(u32 context_id, u32 priv_flags)
+{
+ u32 i, array_size;
+ struct vmci_ctx *sub_ctx;
+ struct vmci_handle_arr *subscriber_array;
+ struct vmci_handle context_handle =
+ vmci_make_handle(context_id, VMCI_EVENT_HANDLER);
+
+ /*
+ * We create an array to hold the subscribers we find when
+ * scanning through all contexts.
+ */
+ subscriber_array = vmci_handle_arr_create(0);
+ if (subscriber_array == NULL)
+ return VMCI_ERROR_NO_MEM;
+
+ /*
+ * Scan all contexts to find who is interested in being
+ * notified about given contextID.
+ */
+ rcu_read_lock();
+ list_for_each_entry_rcu(sub_ctx, &ctx_list.head, list_item) {
+ struct vmci_handle_list *node;
+
+ /*
+ * We only deliver notifications of the removal of
+ * contexts, if the two contexts are allowed to
+ * interact.
+ */
+ if (vmci_deny_interaction(priv_flags, sub_ctx->priv_flags))
+ continue;
+
+ list_for_each_entry_rcu(node, &sub_ctx->notifier_list, node) {
+ if (!vmci_handle_is_equal(node->handle, context_handle))
+ continue;
+
+ vmci_handle_arr_append_entry(&subscriber_array,
+ vmci_make_handle(sub_ctx->cid,
+ VMCI_EVENT_HANDLER));
+ }
+ }
+ rcu_read_unlock();
+
+ /* Fire event to all subscribers. */
+ array_size = vmci_handle_arr_get_size(subscriber_array);
+ for (i = 0; i < array_size; i++) {
+ int result;
+ struct vmci_event_ctx ev;
+
+ ev.msg.hdr.dst = vmci_handle_arr_get_entry(subscriber_array, i);
+ ev.msg.hdr.src = vmci_make_handle(VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID);
+ ev.msg.hdr.payload_size = sizeof(ev) - sizeof(ev.msg.hdr);
+ ev.msg.event_data.event = VMCI_EVENT_CTX_REMOVED;
+ ev.payload.context_id = context_id;
+
+ result = vmci_datagram_dispatch(VMCI_HYPERVISOR_CONTEXT_ID,
+ &ev.msg.hdr, false);
+ if (result < VMCI_SUCCESS) {
+ pr_devel("Failed to enqueue event datagram (type=%d) for context (ID=0x%x)\n",
+ ev.msg.event_data.event,
+ ev.msg.hdr.dst.context);
+ /* We continue to enqueue on next subscriber. */
+ }
+ }
+ vmci_handle_arr_destroy(subscriber_array);
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Returns the current number of pending datagrams. The call may
+ * also serve as a synchronization point for the datagram queue,
+ * as no enqueue operations can occur concurrently.
+ */
+int vmci_ctx_pending_datagrams(u32 cid, u32 *pending)
+{
+ struct vmci_ctx *context;
+
+ context = vmci_ctx_get(cid);
+ if (context == NULL)
+ return VMCI_ERROR_INVALID_ARGS;
+
+ spin_lock(&context->lock);
+ if (pending)
+ *pending = context->pending_datagrams;
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Queues a VMCI datagram for the appropriate target VM context.
+ */
+int vmci_ctx_enqueue_datagram(u32 cid, struct vmci_datagram *dg)
+{
+ struct vmci_datagram_queue_entry *dq_entry;
+ struct vmci_ctx *context;
+ struct vmci_handle dg_src;
+ size_t vmci_dg_size;
+
+ vmci_dg_size = VMCI_DG_SIZE(dg);
+ if (vmci_dg_size > VMCI_MAX_DG_SIZE) {
+ pr_devel("Datagram too large (bytes=%Zu)\n", vmci_dg_size);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+
+ /* Get the target VM's VMCI context. */
+ context = vmci_ctx_get(cid);
+ if (!context) {
+ pr_devel("Invalid context (ID=0x%x)\n", cid);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+
+ /* Allocate guest call entry and add it to the target VM's queue. */
+ dq_entry = kmalloc(sizeof(*dq_entry), GFP_KERNEL);
+ if (dq_entry == NULL) {
+ pr_warn("Failed to allocate memory for datagram\n");
+ vmci_ctx_put(context);
+ return VMCI_ERROR_NO_MEM;
+ }
+ dq_entry->dg = dg;
+ dq_entry->dg_size = vmci_dg_size;
+ dg_src = dg->src;
+ INIT_LIST_HEAD(&dq_entry->list_item);
+
+ spin_lock(&context->lock);
+
+ /*
+ * We put a higher limit on datagrams from the hypervisor. If
+ * the pending datagram is not from hypervisor, then we check
+ * if enqueueing it would exceed the
+ * VMCI_MAX_DATAGRAM_QUEUE_SIZE limit on the destination. If
+ * the pending datagram is from hypervisor, we allow it to be
+ * queued at the destination side provided we don't reach the
+ * VMCI_MAX_DATAGRAM_AND_EVENT_QUEUE_SIZE limit.
+ */
+ if (context->datagram_queue_size + vmci_dg_size >=
+ VMCI_MAX_DATAGRAM_QUEUE_SIZE &&
+ (!vmci_handle_is_equal(dg_src,
+ vmci_make_handle
+ (VMCI_HYPERVISOR_CONTEXT_ID,
+ VMCI_CONTEXT_RESOURCE_ID)) ||
+ context->datagram_queue_size + vmci_dg_size >=
+ VMCI_MAX_DATAGRAM_AND_EVENT_QUEUE_SIZE)) {
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+ kfree(dq_entry);
+ pr_devel("Context (ID=0x%x) receive queue is full\n", cid);
+ return VMCI_ERROR_NO_RESOURCES;
+ }
+
+ list_add(&dq_entry->list_item, &context->datagram_queue);
+ context->pending_datagrams++;
+ context->datagram_queue_size += vmci_dg_size;
+ ctx_signal_notify(context);
+ wake_up(&context->host_context.wait_queue);
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ return vmci_dg_size;
+}
+
+/*
+ * Verifies whether a context with the specified context ID exists.
+ * FIXME: utility is dubious as no decisions can be reliably made
+ * using this data as context can appear and disappear at any time.
+ */
+bool vmci_ctx_exists(u32 cid)
+{
+ struct vmci_ctx *context;
+ bool exists = false;
+
+ rcu_read_lock();
+
+ list_for_each_entry_rcu(context, &ctx_list.head, list_item) {
+ if (context->cid == cid) {
+ exists = true;
+ break;
+ }
+ }
+
+ rcu_read_unlock();
+ return exists;
+}
+
+/*
+ * Retrieves VMCI context corresponding to the given cid.
+ */
+struct vmci_ctx *vmci_ctx_get(u32 cid)
+{
+ struct vmci_ctx *c, *context = NULL;
+
+ if (cid == VMCI_INVALID_ID)
+ return NULL;
+
+ rcu_read_lock();
+ list_for_each_entry_rcu(c, &ctx_list.head, list_item) {
+ if (c->cid == cid) {
+ /*
+ * The context owner drops its own reference to the
+ * context only after removing it from the list and
+ * waiting for RCU grace period to expire. This
+ * means that we are not about to increase the
+ * reference count of something that is in the
+ * process of being destroyed.
+ */
+ context = c;
+ kref_get(&context->kref);
+ break;
+ }
+ }
+ rcu_read_unlock();
+
+ return context;
+}
+
+/*
+ * Deallocates all parts of a context data structure. This
+ * function doesn't lock the context, because it assumes that
+ * the caller was holding the last reference to context.
+ */
+static void ctx_free_ctx(struct kref *kref)
+{
+ struct vmci_ctx *context = container_of(kref, struct vmci_ctx, kref);
+ struct vmci_datagram_queue_entry *dq_entry, *dq_entry_tmp;
+ struct vmci_handle temp_handle;
+ struct vmci_handle_list *notifier, *tmp;
+
+ /*
+ * Fire event to all contexts interested in knowing this
+ * context is dying.
+ */
+ ctx_fire_notification(context->cid, context->priv_flags);
+
+ /*
+ * Cleanup all queue pair resources attached to context. If
+ * the VM dies without cleaning up, this code will make sure
+ * that no resources are leaked.
+ */
+ temp_handle = vmci_handle_arr_get_entry(context->queue_pair_array, 0);
+ while (!vmci_handle_is_equal(temp_handle, VMCI_INVALID_HANDLE)) {
+ if (vmci_qp_broker_detach(temp_handle,
+ context) < VMCI_SUCCESS) {
+ /*
+ * When vmci_qp_broker_detach() succeeds it
+ * removes the handle from the array. If
+ * detach fails, we must remove the handle
+ * ourselves.
+ */
+ vmci_handle_arr_remove_entry(context->queue_pair_array,
+ temp_handle);
+ }
+ temp_handle =
+ vmci_handle_arr_get_entry(context->queue_pair_array, 0);
+ }
+
+ /*
+ * It is fine to destroy this without locking the callQueue, as
+ * this is the only thread having a reference to the context.
+ */
+ list_for_each_entry_safe(dq_entry, dq_entry_tmp,
+ &context->datagram_queue, list_item) {
+ WARN_ON(dq_entry->dg_size != VMCI_DG_SIZE(dq_entry->dg));
+ list_del(&dq_entry->list_item);
+ kfree(dq_entry->dg);
+ kfree(dq_entry);
+ }
+
+ list_for_each_entry_safe(notifier, tmp,
+ &context->notifier_list, node) {
+ list_del(¬ifier->node);
+ kfree(notifier);
+ }
+
+ vmci_handle_arr_destroy(context->queue_pair_array);
+ vmci_handle_arr_destroy(context->doorbell_array);
+ vmci_handle_arr_destroy(context->pending_doorbell_array);
+ vmci_ctx_unset_notify(context);
+ if (context->cred)
+ put_cred(context->cred);
+ kfree(context);
+}
+
+/*
+ * Drops reference to VMCI context. If this is the last reference to
+ * the context it will be deallocated. A context is created with
+ * a reference count of one, and on destroy, it is removed from
+ * the context list before its reference count is decremented. Thus,
+ * if we reach zero, we are sure that nobody else are about to increment
+ * it (they need the entry in the context list for that), and so there
+ * is no need for locking.
+ */
+void vmci_ctx_put(struct vmci_ctx *context)
+{
+ kref_put(&context->kref, ctx_free_ctx);
+}
+
+/*
+ * Dequeues the next datagram and returns it to caller.
+ * The caller passes in a pointer to the max size datagram
+ * it can handle and the datagram is only unqueued if the
+ * size is less than max_size. If larger max_size is set to
+ * the size of the datagram to give the caller a chance to
+ * set up a larger buffer for the guestcall.
+ */
+int vmci_ctx_dequeue_datagram(struct vmci_ctx *context,
+ size_t *max_size,
+ struct vmci_datagram **dg)
+{
+ struct vmci_datagram_queue_entry *dq_entry;
+ struct list_head *list_item;
+ int rv;
+
+ /* Dequeue the next datagram entry. */
+ spin_lock(&context->lock);
+ if (context->pending_datagrams == 0) {
+ ctx_clear_notify_call(context);
+ spin_unlock(&context->lock);
+ pr_devel("No datagrams pending\n");
+ return VMCI_ERROR_NO_MORE_DATAGRAMS;
+ }
+
+ list_item = context->datagram_queue.next;
+
+ dq_entry =
+ list_entry(list_item, struct vmci_datagram_queue_entry, list_item);
+
+ /* Check size of caller's buffer. */
+ if (*max_size < dq_entry->dg_size) {
+ *max_size = dq_entry->dg_size;
+ spin_unlock(&context->lock);
+ pr_devel("Caller's buffer should be at least (size=%u bytes)\n",
+ (u32) *max_size);
+ return VMCI_ERROR_NO_MEM;
+ }
+
+ list_del(list_item);
+ context->pending_datagrams--;
+ context->datagram_queue_size -= dq_entry->dg_size;
+ if (context->pending_datagrams == 0) {
+ ctx_clear_notify_call(context);
+ rv = VMCI_SUCCESS;
+ } else {
+ /*
+ * Return the size of the next datagram.
+ */
+ struct vmci_datagram_queue_entry *next_entry;
+
+ list_item = context->datagram_queue.next;
+ next_entry =
+ list_entry(list_item, struct vmci_datagram_queue_entry,
+ list_item);
+
+ /*
+ * The following size_t -> int truncation is fine as
+ * the maximum size of a (routable) datagram is 68KB.
+ */
+ rv = (int)next_entry->dg_size;
+ }
+ spin_unlock(&context->lock);
+
+ /* Caller must free datagram. */
+ *dg = dq_entry->dg;
+ dq_entry->dg = NULL;
+ kfree(dq_entry);
+
+ return rv;
+}
+
+/*
+ * Reverts actions set up by vmci_setup_notify(). Unmaps and unlocks the
+ * page mapped/locked by vmci_setup_notify().
+ */
+void vmci_ctx_unset_notify(struct vmci_ctx *context)
+{
+ struct page *notify_page;
+
+ spin_lock(&context->lock);
+
+ notify_page = context->notify_page;
+ context->notify = &ctx_dummy_notify;
+ context->notify_page = NULL;
+
+ spin_unlock(&context->lock);
+
+ if (notify_page) {
+ kunmap(notify_page);
+ put_page(notify_page);
+ }
+}
+
+/*
+ * Add remote_cid to list of contexts current contexts wants
+ * notifications from/about.
+ */
+int vmci_ctx_add_notification(u32 context_id, u32 remote_cid)
+{
+ struct vmci_ctx *context;
+ struct vmci_handle_list *notifier, *n;
+ int result;
+ bool exists = false;
+
+ context = vmci_ctx_get(context_id);
+ if (!context)
+ return VMCI_ERROR_NOT_FOUND;
+
+ if (VMCI_CONTEXT_IS_VM(context_id) && VMCI_CONTEXT_IS_VM(remote_cid)) {
+ pr_devel("Context removed notifications for other VMs not supported (src=0x%x, remote=0x%x)\n",
+ context_id, remote_cid);
+ result = VMCI_ERROR_DST_UNREACHABLE;
+ goto out;
+ }
+
+ if (context->priv_flags & VMCI_PRIVILEGE_FLAG_RESTRICTED) {
+ result = VMCI_ERROR_NO_ACCESS;
+ goto out;
+ }
+
+ notifier = kmalloc(sizeof(struct vmci_handle_list), GFP_KERNEL);
+ if (!notifier) {
+ result = VMCI_ERROR_NO_MEM;
+ goto out;
+ }
+
+ INIT_LIST_HEAD(¬ifier->node);
+ notifier->handle = vmci_make_handle(remote_cid, VMCI_EVENT_HANDLER);
+
+ spin_lock(&context->lock);
+
+ list_for_each_entry(n, &context->notifier_list, node) {
+ if (vmci_handle_is_equal(n->handle, notifier->handle)) {
+ exists = true;
+ break;
+ }
+ }
+
+ if (exists) {
+ kfree(notifier);
+ result = VMCI_ERROR_ALREADY_EXISTS;
+ } else {
+ list_add_tail_rcu(¬ifier->node, &context->notifier_list);
+ context->n_notifiers++;
+ result = VMCI_SUCCESS;
+ }
+
+ spin_unlock(&context->lock);
+
+ out:
+ vmci_ctx_put(context);
+ return result;
+}
+
+/*
+ * Remove remote_cid from current context's list of contexts it is
+ * interested in getting notifications from/about.
+ */
+int vmci_ctx_remove_notification(u32 context_id, u32 remote_cid)
+{
+ struct vmci_ctx *context;
+ struct vmci_handle_list *notifier, *tmp;
+ struct vmci_handle handle;
+ bool found = false;
+
+ context = vmci_ctx_get(context_id);
+ if (!context)
+ return VMCI_ERROR_NOT_FOUND;
+
+ handle = vmci_make_handle(remote_cid, VMCI_EVENT_HANDLER);
+
+ spin_lock(&context->lock);
+ list_for_each_entry_safe(notifier, tmp,
+ &context->notifier_list, node) {
+ if (vmci_handle_is_equal(notifier->handle, handle)) {
+ list_del_rcu(¬ifier->node);
+ context->n_notifiers--;
+ found = true;
+ break;
+ }
+ }
+ spin_unlock(&context->lock);
+
+ if (found) {
+ synchronize_rcu();
+ kfree(notifier);
+ }
+
+ vmci_ctx_put(context);
+
+ return found ? VMCI_SUCCESS : VMCI_ERROR_NOT_FOUND;
+}
+
+static int vmci_ctx_get_chkpt_notifiers(struct vmci_ctx *context,
+ u32 *buf_size, void **pbuf)
+{
+ u32 *notifiers;
+ size_t data_size;
+ struct vmci_handle_list *entry;
+ int i = 0;
+
+ if (context->n_notifiers == 0) {
+ *buf_size = 0;
+ *pbuf = NULL;
+ return VMCI_SUCCESS;
+ }
+
+ data_size = context->n_notifiers * sizeof(*notifiers);
+ if (*buf_size < data_size) {
+ *buf_size = data_size;
+ return VMCI_ERROR_MORE_DATA;
+ }
+
+ notifiers = kmalloc(data_size, GFP_ATOMIC); /* FIXME: want GFP_KERNEL */
+ if (!notifiers)
+ return VMCI_ERROR_NO_MEM;
+
+ list_for_each_entry(entry, &context->notifier_list, node)
+ notifiers[i++] = entry->handle.context;
+
+ *buf_size = data_size;
+ *pbuf = notifiers;
+ return VMCI_SUCCESS;
+}
+
+static int vmci_ctx_get_chkpt_doorbells(struct vmci_ctx *context,
+ u32 *buf_size, void **pbuf)
+{
+ struct dbell_cpt_state *dbells;
+ size_t n_doorbells;
+ int i;
+
+ n_doorbells = vmci_handle_arr_get_size(context->doorbell_array);
+ if (n_doorbells > 0) {
+ size_t data_size = n_doorbells * sizeof(*dbells);
+ if (*buf_size < data_size) {
+ *buf_size = data_size;
+ return VMCI_ERROR_MORE_DATA;
+ }
+
+ dbells = kmalloc(data_size, GFP_ATOMIC);
+ if (!dbells)
+ return VMCI_ERROR_NO_MEM;
+
+ for (i = 0; i < n_doorbells; i++)
+ dbells[i].handle = vmci_handle_arr_get_entry(
+ context->doorbell_array, i);
+
+ *buf_size = data_size;
+ *pbuf = dbells;
+ } else {
+ *buf_size = 0;
+ *pbuf = NULL;
+ }
+
+ return VMCI_SUCCESS;
+}
+
+/*
+ * Get current context's checkpoint state of given type.
+ */
+int vmci_ctx_get_chkpt_state(u32 context_id,
+ u32 cpt_type,
+ u32 *buf_size,
+ void **pbuf)
+{
+ struct vmci_ctx *context;
+ int result;
+
+ context = vmci_ctx_get(context_id);
+ if (!context)
+ return VMCI_ERROR_NOT_FOUND;
+
+ spin_lock(&context->lock);
+
+ switch (cpt_type) {
+ case VMCI_NOTIFICATION_CPT_STATE:
+ result = vmci_ctx_get_chkpt_notifiers(context, buf_size, pbuf);
+ break;
+
+ case VMCI_WELLKNOWN_CPT_STATE:
+ /*
+ * For compatibility with VMX'en with VM to VM communication, we
+ * always return zero wellknown handles.
+ */
+
+ *buf_size = 0;
+ *pbuf = NULL;
+ result = VMCI_SUCCESS;
+ break;
+
+ case VMCI_DOORBELL_CPT_STATE:
+ result = vmci_ctx_get_chkpt_doorbells(context, buf_size, pbuf);
+ break;
+
+ default:
+ pr_devel("Invalid cpt state (type=%d)\n", cpt_type);
+ result = VMCI_ERROR_INVALID_ARGS;
+ break;
+ }
+
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ return result;
+}
+
+/*
+ * Set current context's checkpoint state of given type.
+ */
+int vmci_ctx_set_chkpt_state(u32 context_id,
+ u32 cpt_type,
+ u32 buf_size,
+ void *cpt_buf)
+{
+ u32 i;
+ u32 current_id;
+ int result = VMCI_SUCCESS;
+ u32 num_ids = buf_size / sizeof(u32);
+
+ if (cpt_type == VMCI_WELLKNOWN_CPT_STATE && num_ids > 0) {
+ /*
+ * We would end up here if VMX with VM to VM communication
+ * attempts to restore a checkpoint with wellknown handles.
+ */
+ pr_warn("Attempt to restore checkpoint with obsolete wellknown handles\n");
+ return VMCI_ERROR_OBSOLETE;
+ }
+
+ if (cpt_type != VMCI_NOTIFICATION_CPT_STATE) {
+ pr_devel("Invalid cpt state (type=%d)\n", cpt_type);
+ return VMCI_ERROR_INVALID_ARGS;
+ }
+
+ for (i = 0; i < num_ids && result == VMCI_SUCCESS; i++) {
+ current_id = ((u32 *)cpt_buf)[i];
+ result = vmci_ctx_add_notification(context_id, current_id);
+ if (result != VMCI_SUCCESS)
+ break;
+ }
+ if (result != VMCI_SUCCESS)
+ pr_devel("Failed to set cpt state (type=%d) (error=%d)\n",
+ cpt_type, result);
+
+ return result;
+}
+
+/*
+ * Retrieves the specified context's pending notifications in the
+ * form of a handle array. The handle arrays returned are the
+ * actual data - not a copy and should not be modified by the
+ * caller. They must be released using
+ * vmci_ctx_rcv_notifications_release.
+ */
+int vmci_ctx_rcv_notifications_get(u32 context_id,
+ struct vmci_handle_arr **db_handle_array,
+ struct vmci_handle_arr **qp_handle_array)
+{
+ struct vmci_ctx *context;
+ int result = VMCI_SUCCESS;
+
+ context = vmci_ctx_get(context_id);
+ if (context == NULL)
+ return VMCI_ERROR_NOT_FOUND;
+
+ spin_lock(&context->lock);
+
+ *db_handle_array = context->pending_doorbell_array;
+ context->pending_doorbell_array = vmci_handle_arr_create(0);
+ if (!context->pending_doorbell_array) {
+ context->pending_doorbell_array = *db_handle_array;
+ *db_handle_array = NULL;
+ result = VMCI_ERROR_NO_MEM;
+ }
+ *qp_handle_array = NULL;
+
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ return result;
+}
+
+/*
+ * Releases handle arrays with pending notifications previously
+ * retrieved using vmci_ctx_rcv_notifications_get. If the
+ * notifications were not successfully handed over to the guest,
+ * success must be false.
+ */
+void vmci_ctx_rcv_notifications_release(u32 context_id,
+ struct vmci_handle_arr *db_handle_array,
+ struct vmci_handle_arr *qp_handle_array,
+ bool success)
+{
+ struct vmci_ctx *context = vmci_ctx_get(context_id);
+
+ spin_lock(&context->lock);
+ if (!success) {
+ struct vmci_handle handle;
+
+ /*
+ * New notifications may have been added while we were not
+ * holding the context lock, so we transfer any new pending
+ * doorbell notifications to the old array, and reinstate the
+ * old array.
+ */
+
+ handle = vmci_handle_arr_remove_tail(
+ context->pending_doorbell_array);
+ while (!vmci_handle_is_invalid(handle)) {
+ if (!vmci_handle_arr_has_entry(db_handle_array,
+ handle)) {
+ vmci_handle_arr_append_entry(
+ &db_handle_array, handle);
+ }
+ handle = vmci_handle_arr_remove_tail(
+ context->pending_doorbell_array);
+ }
+ vmci_handle_arr_destroy(context->pending_doorbell_array);
+ context->pending_doorbell_array = db_handle_array;
+ db_handle_array = NULL;
+ } else {
+ ctx_clear_notify_call(context);
+ }
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ if (db_handle_array)
+ vmci_handle_arr_destroy(db_handle_array);
+
+ if (qp_handle_array)
+ vmci_handle_arr_destroy(qp_handle_array);
+}
+
+/*
+ * Registers that a new doorbell handle has been allocated by the
+ * context. Only doorbell handles registered can be notified.
+ */
+int vmci_ctx_dbell_create(u32 context_id, struct vmci_handle handle)
+{
+ struct vmci_ctx *context;
+ int result;
+
+ if (context_id == VMCI_INVALID_ID || vmci_handle_is_invalid(handle))
+ return VMCI_ERROR_INVALID_ARGS;
+
+ context = vmci_ctx_get(context_id);
+ if (context == NULL)
+ return VMCI_ERROR_NOT_FOUND;
+
+ spin_lock(&context->lock);
+ if (!vmci_handle_arr_has_entry(context->doorbell_array, handle)) {
+ vmci_handle_arr_append_entry(&context->doorbell_array, handle);
+ result = VMCI_SUCCESS;
+ } else {
+ result = VMCI_ERROR_DUPLICATE_ENTRY;
+ }
+
+ spin_unlock(&context->lock);
+ vmci_ctx_put(context);
+
+ return result;
+}
+
+/*
+ * Unregisters a doorbell handle that was previously registered
+ * with vmci_ctx_dbell_create.
+ */
+int vmci_ctx_dbell_destroy(u32 context_id, struct vmci_handle handle)
+{
+ struct vmci_ctx *context;
+ struct vmci_handle removed_handle;
+
+ if (context_id == VMCI_INVALID_ID || vmci_handle_is_invalid(handle))
+ return VMCI_ERROR_INVALID_ARGS;
+
+ context = vmci_ctx_get(context_id);
+ if (context == NULL)
+ return VMCI_ERROR_NOT_FOUND;
+
]
]
|
| 174/2 |
2026/05/09 22:58 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 83727
output: 48
thoughts: 867
Thoughts: **Analyzing the VMCI Queue Pair Deadlock**
Okay, so I'm diving into this VMCI queue pair deadlock. My initial thought was that commit `06164d2b72aa752ce4633184b3e0d97601017135` was the culprit, specifically because `vmci_ctx_put` calls `kref_put(&context->kref, ctx_free_ctx)`, and `ctx_free_ctx` then triggers `vmci_qp_broker_detach`. That seems like a classic recursive locking scenario, right?
But, wait, let's back up and verify that assumption. I need to be sure. I'm seeing this bug in `drivers/misc/vmw_vmci/vmci_queue_pair.c`, and that commit *does* introduce that file. So, okay, it's the initial implementation of the queue pairs. That makes sense. Let's see if there was another potential introduction.
Okay, let's check `vmci_ctx_put`. Did it *ever* get changed to call `ctx_free_ctx` synchronously later? No, it was introduced in `28d6692cd8fb2a900edba5e5983be4478756ef6f` and *already* called `kref_put` and `ctx_free_ctx` which in turn called `vmci_qp_broker_detach`. So, yeah, it looks like the deadlock was baked in from the beginning.
Let me double-check that commit hash. `06164d2b72aa752ce4633184b3e0d97601017135`... Yes, "VMCI: queue pairs implementation." Okay, that's consistent.
Now, could `vmci_qp_broker_detach` have been modified later to include some trigger that created the conflict? No, I'm pulling up the `git-blame` and it looks like `qp_notify_peer` was in there from the start. That was in `06164d2b72aa752ce4633184b3e0d97601017135`, and `qp_notify_peer` was also in `qp_broker_attach` in that commit. And `vmci_ctx_put` was in `qp_broker_attach` in `06164d2b72aa752ce4633184b3e0d97601017135`.
Just to be absolutely sure, let's verify `vmci_qp_broker_set_page_store` in `06164d2b72aa752ce4633184b3e0d97601017135`.
|
| 175/2 |
2026/05/09 22:58 |
tool |
git-blame |
0m
Args: map[End:2045 File:drivers/misc/vmw_vmci/vmci_queue_pair.c Start:2030]
Results: map[Output:06164d2b72aa7 2030) if (entry->state == VMCIQPB_CREATED_NO_MEM)
06164d2b72aa7 2031) entry->state = VMCIQPB_CREATED_MEM;
06164d2b72aa7 2032) else
06164d2b72aa7 2033) entry->state = VMCIQPB_ATTACHED_MEM;
06164d2b72aa7 2034)
06164d2b72aa7 2035) entry->vmci_page_files = true;
06164d2b72aa7 2036)
06164d2b72aa7 2037) if (entry->state == VMCIQPB_ATTACHED_MEM) {
06164d2b72aa7 2038) result =
06164d2b72aa7 2039) qp_notify_peer(true, handle, context_id, entry->create_id);
06164d2b72aa7 2040) if (result < VMCI_SUCCESS) {
06164d2b72aa7 2041) pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
06164d2b72aa7 2042) entry->create_id, entry->qp.handle.context,
06164d2b72aa7 2043) entry->qp.handle.resource);
06164d2b72aa7 2044) }
06164d2b72aa7 2045) }
]
|
| 176/2 |
2026/05/09 22:58 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 85822
output: 53
thoughts: 710
Thoughts: **Root Cause Analysis: VMCI Queue Pair Recursive Locking Deadlock**
Okay, let's break this down. My initial thought was that `qp_notify_peer` was being called from `vmci_qp_broker_set_page_store`, which led me to suspect that commit `06164d2b72aa752ce4633184b3e0d97601017135` introduced the bug. Seems likely.
Aha, the issue here is a recursive locking deadlock! We're dealing with the `qp_broker_list.mutex`. Now, was that mutex introduced in `06164d2b72aa752ce4633184b3e0d97601017135`? Yes, both `qp_broker_list` and its mutex were introduced in that very commit. Excellent. That's a strong clue.
Now, let me check something. I want to see if `vmci_ctx_put` was calling `ctx_free_ctx`, which in turn calls `vmci_qp_broker_detach` in the same commit. Wait a minute... `vmci_ctx_put` is in `vmci_context.c`, which was actually introduced in `28d6692cd8fb2a900edba5e5983be4478756ef6f`. Okay, but these two commits, `06164d2b72aa752ce4633184b3e0d97601017135` and `28d6692cd8fb2a900edba5e5983be4478756ef6f`, are part of the same patch series: the VMCI driver introduction. I recall that `06164d2b72aa752ce4633184b3e0d97601017135` specifically handled "VMCI: queue pairs implementation" and `28d6692cd8fb2a900edba5e5983be4478756ef6f` implemented "VMCI: context implementation".
Given that the deadlock is happening within `vmci_queue_pair.c` (and the `qp_broker_list.mutex`), the commit that introduced the problematic code is definitely `06164d2b72aa752ce4633184b3e0d97601017135`. Time to go back and verify the commit hash one more time.
|
| 177/2 |
2026/05/09 22:58 |
tool |
git-show |
0m
Error:
Args: map[Commit:06164d2b72aa752ce4633184b3e0d97601017135]
|
| 178/2 |
2026/05/09 22:58 |
llm |
fixes-finder |
0m
Model:
Tokens:
input: 87237
output: 55
thoughts: 238
Thoughts: **Identifying the Root Cause**
Right, I've got it. The suspect commit hash is `06164d2b72aa752ce4633184b3e0d97601017135`. Let's just do a quick scan to make absolutely sure there isn't anything else in the vicinity that might be the source of this.
The core of the issue is the locking order: `qp_notify_peer` and `vmci_ctx_put` were being called while holding `qp_broker_list.mutex`. Looking back, I can see that this problematic sequence was introduced with that specific commit, `06164d2b72aa752ce4633184b3e0d97601017135`.
The fix neatly addresses this by deferring the calls to `qp_notify_peer` and `vmci_ctx_put` until *after* `qp_broker_list.mutex` has been released.
With that, I am fairly certain that `06164d2b72aa752ce4633184b3e0d97601017135` is indeed the culprit here.
|
| 179/2 |
2026/05/09 22:58 |
tool |
set-results |
0m
Args: map[FixesHash:06164d2b72aa752ce4633184b3e0d97601017135]
Results: map[FixesHash:06164d2b72aa752ce4633184b3e0d97601017135]
|
| 180/1 |
2026/05/09 22:58 |
action |
format-fixes |
0m
Results: map[Fixes:map[Hash:06164d2b72aa752ce4633184b3e0d97601017135 Title:VMCI: queue pairs implementation.]]
|
| 181/1 |
2026/05/09 22:58 |
action |
get-maintainers |
0m
Results: map[Recipients:[map[Email:arnd@arndb.de Name:Arnd Bergmann To:true] map[Email:bcm-kernel-feedback-list@broadcom.com Name:Broadcom internal kernel review list To:false] map[Email:bryan-bt.tan@broadcom.com Name:Bryan Tan To:true] map[Email:gregkh@linuxfoundation.org Name:Greg Kroah-Hartman To:true] map[Email:linux-kernel@vger.kernel.org Name: To:true] map[Email:vishnu.dasa@broadcom.com Name:Vishnu Dasa To:true]]]
|
| 182/1 |
2026/05/09 22:58 |
action |
get-recent-commits |
0m
Results: map[RecentCommits:misc: vmw_vmci: Fix spelling mistakes in comments
Convert 'alloc_obj' family to use the new default GFP_KERNEL argument
treewide: Replace kmalloc with kmalloc_obj for non-scalar types
misc: vmw_vmci: Remove unused qpair functions
use less confusing names for iov_iter direction initializers
misc/vmw_vmci: fix an infoleak in vmci_host_do_receive_datagram()
misc/vmw_vmci: Use kmap_local_page() in vmci_queue_pair.c
VMCI: Add support for ARM64
VMCI: fix NULL pointer dereference when unmapping queue pair
drivers/misc/vmw_vmci: restrict too big queue size in qp_host_alloc_queue
VMCI: Enforce queuepair max size for IOCTL_VMCI_QUEUEPAIR_ALLOC
VMCI: Use set_page_dirty_lock() when unregistering guest memory
VMCI: Stop log spew when qp allocation isn't possible
VMCI: check return value of get_user_pages_fast() for errors
treewide: Replace GPLv2 boilerplate/reference with SPDX - rule 321
mm/gup: change GUP fast to use flags rather than a write 'bool'
VMCI: Support upto 64-bit PPNs
iov_iter: Separate type from direction and use accessor functions
vmci: type promotion bug in qp_host_get_user_memory()
misc: vmci: remove redundant variable is_local
]
|
| 183/1 |
2026/05/09 22:58 |
agent |
description-generator |
0m
Model:
Instruction:
You are an experienced Linux kernel developer tasked with writing a commit description for
a kernel bug fixing commit. The description should start with a one-line summary,
and then include description of the bug being fixed, and how it's fixed by the provided patch.
Your final reply should contain only the text of the commit description.
Phrase the one-line summary so that it is not longer than 72 characters.
Prefer calling several tools at the same time to save round-trips.
Prompt:
The crash that corresponds to the bug is:
============================================
WARNING: possible recursive locking detected
syzkaller #1 Not tainted
--------------------------------------------
syz.0.512/7305 is trying to acquire lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
but task is already holding lock:
ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
other info that might help us debug this:
Possible unsafe locking scenario:
CPU0
----
lock(qp_broker_list.mutex);
lock(qp_broker_list.mutex);
*** DEADLOCK ***
May be due to missing lock nesting notation
1 lock held by syz.0.512/7305:
#0: ffffffff8ef94ef0 (qp_broker_list.mutex){+.+.}-{4:4}, at: vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
stack backtrace:
CPU: 1 UID: 0 PID: 7305 Comm: syz.0.512 Not tainted syzkaller #1 PREEMPT(full)
Hardware name: QEMU Standard PC (Q35 + ICH9, 2009), BIOS 1.16.3-debian-1.16.3-2 04/01/2014
Call Trace:
<TASK>
dump_stack_lvl+0xe8/0x150 lib/dump_stack.c:120
print_deadlock_bug+0x279/0x290 kernel/locking/lockdep.c:3041
check_deadlock kernel/locking/lockdep.c:3093 [inline]
validate_chain kernel/locking/lockdep.c:3895 [inline]
__lock_acquire+0x253f/0x2cf0 kernel/locking/lockdep.c:5237
lock_acquire+0x106/0x350 kernel/locking/lockdep.c:5868
__mutex_lock_common kernel/locking/mutex.c:646 [inline]
__mutex_lock+0x199/0x1550 kernel/locking/mutex.c:820
vmci_qp_broker_detach+0x117/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2095
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_ctx_enqueue_datagram+0x3ab/0x420 drivers/misc/vmw_vmci/vmci_context.c:340
dg_dispatch_as_host drivers/misc/vmw_vmci/vmci_datagram.c:276 [inline]
vmci_datagram_dispatch+0x450/0xc60 drivers/misc/vmw_vmci/vmci_datagram.c:340
qp_notify_peer drivers/misc/vmw_vmci/vmci_queue_pair.c:1481 [inline]
vmci_qp_broker_detach+0x8dd/0xf20 drivers/misc/vmw_vmci/vmci_queue_pair.c:2188
ctx_free_ctx drivers/misc/vmw_vmci/vmci_context.c:424 [inline]
kref_put include/linux/kref.h:65 [inline]
vmci_ctx_put+0x64e/0xc40 drivers/misc/vmw_vmci/vmci_context.c:477
vmci_host_close+0x98/0x160 drivers/misc/vmw_vmci/vmci_host.c:143
__fput+0x44f/0xa60 fs/file_table.c:510
task_work_run+0x1d9/0x270 kernel/task_work.c:233
resume_user_mode_work include/linux/resume_user_mode.h:50 [inline]
__exit_to_user_mode_loop kernel/entry/common.c:67 [inline]
exit_to_user_mode_loop+0xed/0x480 kernel/entry/common.c:98
__exit_to_user_mode_prepare include/linux/irq-entry-common.h:207 [inline]
syscall_exit_to_user_mode_prepare include/linux/irq-entry-common.h:238 [inline]
syscall_exit_to_user_mode include/linux/entry-common.h:318 [inline]
do_syscall_64+0x33e/0xf80 arch/x86/entry/syscall_64.c:100
entry_SYSCALL_64_after_hwframe+0x77/0x7f
RIP: 0033:0x7f45efd9cdd9
Code: ff c3 66 2e 0f 1f 84 00 00 00 00 00 0f 1f 44 00 00 48 89 f8 48 89 f7 48 89 d6 48 89 ca 4d 89 c2 4d 89 c8 4c 8b 4c 24 08 0f 05 <48> 3d 01 f0 ff ff 73 01 c3 48 c7 c1 e8 ff ff ff f7 d8 64 89 01 48
RSP: 002b:00007ffd73cac3c8 EFLAGS: 00000246 ORIG_RAX: 00000000000001b4
RAX: 0000000000000000 RBX: 00007f45f0017da0 RCX: 00007f45efd9cdd9
RDX: 0000000000000000 RSI: 000000000000001e RDI: 0000000000000003
RBP: 00007f45f0017da0 R08: 00007f45f0016038 R09: 00007f45efe3337e
R10: 000000000003fda8 R11: 0000000000000246 R12: 000000000002029b
R13: 00007f45f0015fac R14: 000000000001ff8e R15: 00007ffd73cac4d0
</TASK>
The explanation of the root cause of the bug is:
The root cause of this crash is a recursive locking deadlock involving `qp_broker_list.mutex`.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires `qp_broker_list.mutex` and, if there are still other endpoints attached, it calls `qp_notify_peer()` to send a notification datagram to the peer context.
The deadlock occurs because `qp_notify_peer()` indirectly calls `vmci_ctx_put()` on the peer's context, which can drop the reference count to 0 if the peer context is concurrently being destroyed. When the reference count reaches 0, `vmci_ctx_put()` synchronously calls `ctx_free_ctx()`. This cleanup function iterates over all queue pairs attached to the dying context and calls `vmci_qp_broker_detach()` for each of them, which attempts to acquire `qp_broker_list.mutex` again, resulting in a deadlock.
Here is the exact call chain leading to the deadlock:
```
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex);
qp_notify_peer()
vmci_datagram_dispatch()
dg_dispatch_as_host()
vmci_ctx_enqueue_datagram()
context = vmci_ctx_get(cid);
...
vmci_ctx_put(context);
kref_put(&context->kref, ctx_free_ctx);
ctx_free_ctx()
vmci_qp_broker_detach()
mutex_lock(&qp_broker_list.mutex); <-- DEADLOCK
```
This issue is not isolated to `vmci_qp_broker_detach()`. There are other places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where `qp_notify_peer()` or `vmci_ctx_put()` are called while holding `qp_broker_list.mutex`:
1. **`qp_broker_attach()`**: Calls `vmci_ctx_put(create_context)` directly while holding the mutex. It also calls `qp_notify_peer()`.
2. **`vmci_qp_broker_set_page_store()`**: Calls `qp_notify_peer()` while holding the mutex.
### Proposed Fix
To fix this bug, the calls to `qp_notify_peer()` and `vmci_ctx_put()` must be deferred until after `qp_broker_list.mutex` is released.
For example, in `vmci_qp_broker_detach()`, you can use a boolean flag to defer the notification:
```c
bool do_notify = false;
...
mutex_lock(&qp_broker_list.mutex);
...
if (entry->qp.ref_count == 0) {
...
} else {
do_notify = true;
...
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
if (do_notify)
qp_notify_peer(false, handle, context_id, peer_id);
return result;
```
A similar approach should be applied to `vmci_qp_broker_set_page_store()`.
For `qp_broker_attach()`, since it is a static helper called by `qp_broker_alloc()`, you can change its signature to pass out the `do_notify` flag, the `notify_peer_id`, and the `struct vmci_ctx **out_ctx` pointer. Then, `qp_broker_alloc()` can safely call `vmci_ctx_put()` and `qp_notify_peer()` after it unlocks `qp_broker_list.mutex`.
The diff of the bug fix is:
diff --git a/drivers/misc/vmw_vmci/vmci_queue_pair.c b/drivers/misc/vmw_vmci/vmci_queue_pair.c
index b777bc3fd..3d61d5bf2 100644
--- a/drivers/misc/vmw_vmci/vmci_queue_pair.c
+++ b/drivers/misc/vmw_vmci/vmci_queue_pair.c
@@ -1508,17 +1508,13 @@ static int qp_notify_peer(bool attach,
* VMCIQPB_ATTACHED_MEM state, and for older VMX callers, it will be
* moved to the VMCOQPB_ATTACHED_NO_MEM state.
*/
-static int qp_broker_attach(struct qp_broker_entry *entry,
- u32 peer,
- u32 flags,
- u32 priv_flags,
- u64 produce_size,
- u64 consume_size,
+static int qp_broker_attach(struct qp_broker_entry *entry, u32 peer, u32 flags,
+ u32 priv_flags, u64 produce_size, u64 consume_size,
struct vmci_qp_page_store *page_store,
struct vmci_ctx *context,
- vmci_event_release_cb wakeup_cb,
- void *client_data,
- struct qp_broker_entry **ent)
+ vmci_event_release_cb wakeup_cb, void *client_data,
+ struct qp_broker_entry **ent, bool *do_notify,
+ u32 *notify_peer_id, struct vmci_ctx **out_ctx)
{
const u32 context_id = vmci_ctx_get_id(context);
bool is_local = flags & VMCI_QPFLAG_LOCAL;
@@ -1585,7 +1581,7 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
create_context = vmci_ctx_get(entry->create_id);
supports_host_qp = vmci_ctx_supports_host_qp(create_context);
- vmci_ctx_put(create_context);
+ *out_ctx = create_context;
if (!supports_host_qp)
return VMCI_ERROR_INVALID_RESOURCE;
@@ -1660,13 +1656,8 @@ static int qp_broker_attach(struct qp_broker_entry *entry,
}
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, entry->qp.handle, context_id,
- entry->create_id);
- if (result < VMCI_SUCCESS)
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
+ *do_notify = true;
+ *notify_peer_id = entry->create_id;
}
entry->attach_id = context_id;
@@ -1711,6 +1702,9 @@ static int qp_broker_alloc(struct vmci_handle handle,
struct qp_broker_entry *entry = NULL;
bool is_local = flags & VMCI_QPFLAG_LOCAL;
int result;
+ bool do_notify = false;
+ u32 notify_peer_id = VMCI_INVALID_ID;
+ struct vmci_ctx *out_ctx = NULL;
if (vmci_handle_is_invalid(handle) ||
(flags & ~VMCI_QP_ALL_FLAGS) || is_local ||
@@ -1748,14 +1742,29 @@ static int qp_broker_alloc(struct vmci_handle handle,
context, wakeup_cb, client_data, ent);
} else {
create = false;
- result =
- qp_broker_attach(entry, peer, flags, priv_flags,
- produce_size, consume_size, page_store,
- context, wakeup_cb, client_data, ent);
+ result = qp_broker_attach(entry, peer, flags, priv_flags,
+ produce_size, consume_size,
+ page_store, context, wakeup_cb,
+ client_data, ent, &do_notify,
+ ¬ify_peer_id, &out_ctx);
}
mutex_unlock(&qp_broker_list.mutex);
+ if (out_ctx)
+ vmci_ctx_put(out_ctx);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS)
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+
if (swap)
*swap = (context_id == VMCI_HOST_CONTEXT_ID) &&
!(create && is_local);
@@ -1968,6 +1977,8 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
struct qp_broker_entry *entry;
int result;
const u32 context_id = vmci_ctx_get_id(context);
+ bool do_notify = false;
+ u32 notify_peer_id;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID)
@@ -2035,18 +2046,26 @@ int vmci_qp_broker_set_page_store(struct vmci_handle handle,
entry->vmci_page_files = true;
if (entry->state == VMCIQPB_ATTACHED_MEM) {
- result =
- qp_notify_peer(true, handle, context_id, entry->create_id);
- if (result < VMCI_SUCCESS) {
- pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
- entry->create_id, entry->qp.handle.context,
- entry->qp.handle.resource);
- }
+ do_notify = true;
+ notify_peer_id = entry->create_id;
}
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify) {
+ int notify_result;
+
+ notify_result = qp_notify_peer(true, handle, context_id,
+ notify_peer_id);
+ if (notify_result < VMCI_SUCCESS) {
+ pr_warn("Failed to notify peer (ID=0x%x) of attach to queue pair (handle=0x%x:0x%x)\n",
+ notify_peer_id, handle.context,
+ handle.resource);
+ }
+ }
+
return result;
}
@@ -2086,6 +2105,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
u32 peer_id;
bool is_local = false;
int result;
+ bool do_notify = false;
if (vmci_handle_is_invalid(handle) || !context ||
context_id == VMCI_INVALID_ID) {
@@ -2185,7 +2205,7 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
vmci_ctx_qp_destroy(context, handle);
} else {
- qp_notify_peer(false, handle, context_id, peer_id);
+ do_notify = true;
if (context_id == VMCI_HOST_CONTEXT_ID &&
QPBROKERSTATE_HAS_MEM(entry)) {
entry->state = VMCIQPB_SHUTDOWN_MEM;
@@ -2200,6 +2220,10 @@ int vmci_qp_broker_detach(struct vmci_handle handle, struct vmci_ctx *context)
result = VMCI_SUCCESS;
out:
mutex_unlock(&qp_broker_list.mutex);
+
+ if (do_notify)
+ qp_notify_peer(false, handle, context_id, peer_id);
+
return result;
}
Additional description of the patch:
I have implemented the fix to resolve the recursive locking deadlock involving `qp_broker_list.mutex`.
### Explanation of the Fix
The root cause of the deadlock is that `qp_notify_peer()` and `vmci_ctx_put()` were being called while holding `qp_broker_list.mutex`. These functions can indirectly trigger `ctx_free_ctx()` when a context's reference count drops to zero, which then iterates over the queue pairs and attempts to acquire `qp_broker_list.mutex` again, leading to a recursive locking deadlock.
To fix this, I deferred the calls to `qp_notify_peer()` and `vmci_ctx_put()` until after `qp_broker_list.mutex` is safely released. I applied this pattern to all affected locations in `drivers/misc/vmw_vmci/vmci_queue_pair.c`:
1. **`vmci_qp_broker_detach()`**:
- Introduced a `do_notify` boolean flag.
- Instead of calling `qp_notify_peer()` directly while holding the mutex, I set `do_notify = true`.
- After `mutex_unlock(&qp_broker_list.mutex)`, I check the flag and call `qp_notify_peer()` if required.
2. **`vmci_qp_broker_set_page_store()`**:
- Similar to the detach function, I introduced `do_notify` and `notify_peer_id` variables.
- Set `do_notify = true` and `notify_peer_id = entry->create_id` instead of calling `qp_notify_peer()` directly.
- Called `qp_notify_peer()` after releasing the mutex.
3. **`qp_broker_attach()` and `qp_broker_alloc()`**:
- Modified the signature of the static helper `qp_broker_attach()` to accept three new pointer arguments: `bool *do_notify`, `u32 *notify_peer_id`, and `struct vmci_ctx **out_ctx`.
- In `qp_broker_attach()`, instead of calling `vmci_ctx_put(create_context)` directly, I assigned it to `*out_ctx = create_context`.
- In `qp_broker_attach()`, instead of calling `qp_notify_peer()` directly, I set `*do_notify = true` and `*notify_peer_id = entry->create_id`.
- In `qp_broker_alloc()`, I declared local variables for these flags and passed them to `qp_broker_attach()`. After unlocking `qp_broker_list.mutex`, I safely called `vmci_ctx_put(out_ctx)` (if not NULL) and `qp_notify_peer()` (if `do_notify` is true).
These changes ensure that `qp_broker_list.mutex` is never held when `qp_notify_peer()` or `vmci_ctx_put()` are executed, completely eliminating the recursive locking deadlock while preserving the correct logic and behavior of the VMCI queue pair broker.
Here are summaries of recent commits that touched the same files.
Format the summary line consistently with these, look how prefixes
are specified, letter capitalization, style, etc.
misc: vmw_vmci: Fix spelling mistakes in comments
Convert 'alloc_obj' family to use the new default GFP_KERNEL argument
treewide: Replace kmalloc with kmalloc_obj for non-scalar types
misc: vmw_vmci: Remove unused qpair functions
use less confusing names for iov_iter direction initializers
misc/vmw_vmci: fix an infoleak in vmci_host_do_receive_datagram()
misc/vmw_vmci: Use kmap_local_page() in vmci_queue_pair.c
VMCI: Add support for ARM64
VMCI: fix NULL pointer dereference when unmapping queue pair
drivers/misc/vmw_vmci: restrict too big queue size in qp_host_alloc_queue
VMCI: Enforce queuepair max size for IOCTL_VMCI_QUEUEPAIR_ALLOC
VMCI: Use set_page_dirty_lock() when unregistering guest memory
VMCI: Stop log spew when qp allocation isn't possible
VMCI: check return value of get_user_pages_fast() for errors
treewide: Replace GPLv2 boilerplate/reference with SPDX - rule 321
mm/gup: change GUP fast to use flags rather than a write 'bool'
VMCI: Support upto 64-bit PPNs
iov_iter: Separate type from direction and use accessor functions
vmci: type promotion bug in qp_host_get_user_memory()
misc: vmci: remove redundant variable is_local
Reply: misc/vmw_vmci: fix recursive locking deadlock in queue pair broker
A recursive locking deadlock can occur involving `qp_broker_list.mutex`
in the VMCI queue pair broker.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires
`qp_broker_list.mutex` and, if there are still other endpoints attached,
it calls `qp_notify_peer()` to send a notification datagram to the peer
context.
The deadlock occurs because `qp_notify_peer()` indirectly calls
`vmci_ctx_put()` on the peer's context, which can drop the reference
count to 0 if the peer context is concurrently being destroyed. When the
reference count reaches 0, `vmci_ctx_put()` synchronously calls
`ctx_free_ctx()`. This cleanup function iterates over all queue pairs
attached to the dying context and calls `vmci_qp_broker_detach()` for
each of them, which attempts to acquire `qp_broker_list.mutex` again,
resulting in a deadlock.
This issue is not isolated to `vmci_qp_broker_detach()`. There are other
places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where
`qp_notify_peer()` or `vmci_ctx_put()` are called while holding
`qp_broker_list.mutex`, such as `qp_broker_attach()` and
`vmci_qp_broker_set_page_store()`.
To fix this, defer the calls to `qp_notify_peer()` and `vmci_ctx_put()`
until after `qp_broker_list.mutex` is safely released. This ensures that
the mutex is never held when these functions are executed, completely
eliminating the recursive locking deadlock while preserving the correct
logic and behavior of the VMCI queue pair broker.
|
| 184/2 |
2026/05/09 22:58 |
llm |
description-generator |
0m
Model:
Tokens:
input: 9657
output: 415
thoughts: 1608
Thoughts: **Crafting the Perfect Commit Message**
Okay, so I need to create a commit message for this VMCI bug fix. Let's see... the core issue is a recursive locking deadlock with `qp_broker_list.mutex` in `vmci_queue_pair.c`. This happens when `qp_notify_peer()` or `vmci_ctx_put()` are called while holding the mutex, which can then trigger a call to `ctx_free_ctx()` and attempt to reacquire the same mutex, leading to a deadlock.
First, the one-line summary. Something concise, keeping it under 72 characters is a good practice. Looking at the existing commit prefixes, "misc: vmw_vmci:", "misc/vmw_vmci:", or even "VMCI:" seem appropriate. "misc/vmw_vmci: Fix recursive locking deadlock in queue pair broker" (66 chars) feels good, or maybe "misc: vmw_vmci: Fix recursive locking deadlock in queue pair broker" (67 chars). Either works, maybe I'll go with the shorter one. Let's go with "misc/vmw_vmci: Fix recursive locking deadlock in queue pair broker".
Now for the detailed description. I have the explanation provided, so let's start with a clear, concise description of the bug. It seems that when a queue pair is detached, `vmci_qp_broker_detach()` holds the mutex and calls `qp_notify_peer()` which calls `vmci_ctx_put()` on the peer context. If the peer context is being destroyed concurrently, `vmci_ctx_put()` calls `ctx_free_ctx()` which attempts to reacquire the mutex, thus causing a deadlock. However, it looks like this is not just in `vmci_qp_broker_detach()`. There are other call sites too, so I'll include those.
The fix is straightforward: defer the calls to `qp_notify_peer()` and `vmci_ctx_put()` until after the mutex is released. This applies to all affected functions: `vmci_qp_broker_detach()`, `vmci_qp_broker_set_page_store()`, `qp_broker_attach()` and `qp_broker_alloc()`.
Let's put together the commit message:
```
misc/vmw_vmci: fix recursive locking deadlock in queue pair broker
A recursive locking deadlock can occur involving `qp_broker_list.mutex`
in the VMCI queue pair broker.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires
`qp_broker_list.mutex` and, if there are still other endpoints attached,
it calls `qp_notify_peer()` to send a notification datagram to the peer
context.
The deadlock occurs because `qp_notify_peer()` indirectly calls
`vmci_ctx_put()` on the peer's context, which can drop the reference
count to 0 if the peer context is concurrently being destroyed. When the
reference count reaches 0, `vmci_ctx_put()` synchronously calls
`ctx_free_ctx()`. This cleanup function iterates over all queue pairs
attached to the dying context and calls `vmci_qp_broker_detach()` for
each of them, which attempts to acquire `qp_broker_list.mutex` again,
resulting in a deadlock.
This issue is not isolated to `vmci_qp_broker_detach()`. There are other
places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where
`qp_notify_peer()` or `vmci_ctx_put()` are called while holding
`qp_broker_list.mutex`, such as `qp_broker_attach()` and
`vmci_qp_broker_set_page_store()`.
To fix this, defer the calls to `qp_notify_peer()` and `vmci_ctx_put()`
until after `qp_broker_list.mutex` is safely released. This ensures that
the mutex is never held when these functions are executed, completely
eliminating the recursive locking deadlock while preserving the correct
logic and behavior of the VMCI queue pair broker.
```
The line lengths look good, and the explanation is complete. No need to use any external tools here, it's all good. I think this will do the trick!
|
| 185/1 |
2026/05/09 22:59 |
action |
format-patch-description |
0m
Results: map[PatchDescription:misc/vmw_vmci: fix recursive locking deadlock in queue pair broker
A recursive locking deadlock can occur involving `qp_broker_list.mutex`
in the VMCI queue pair broker.
When a queue pair is detached, `vmci_qp_broker_detach()` acquires
`qp_broker_list.mutex` and, if there are still other endpoints attached,
it calls `qp_notify_peer()` to send a notification datagram to the peer
context.
The deadlock occurs because `qp_notify_peer()` indirectly calls
`vmci_ctx_put()` on the peer's context, which can drop the reference
count to 0 if the peer context is concurrently being destroyed. When the
reference count reaches 0, `vmci_ctx_put()` synchronously calls
`ctx_free_ctx()`. This cleanup function iterates over all queue pairs
attached to the dying context and calls `vmci_qp_broker_detach()` for
each of them, which attempts to acquire `qp_broker_list.mutex` again,
resulting in a deadlock.
This issue is not isolated to `vmci_qp_broker_detach()`. There are other
places in `drivers/misc/vmw_vmci/vmci_queue_pair.c` where
`qp_notify_peer()` or `vmci_ctx_put()` are called while holding
`qp_broker_list.mutex`, such as `qp_broker_attach()` and
`vmci_qp_broker_set_page_store()`.
To fix this, defer the calls to `qp_notify_peer()` and `vmci_ctx_put()`
until after `qp_broker_list.mutex` is safely released. This ensures that
the mutex is never held when these functions are executed, completely
eliminating the recursive locking deadlock while preserving the correct
logic and behavior of the VMCI queue pair broker.]
|