darling-xnu/osfmk/ipc/mach_kernelrpc.c
2023-05-16 21:41:14 -07:00

853 lines
21 KiB
C

/*
* Copyright (c) 2011 Apple Inc. All rights reserved.
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
*
* This file contains Original Code and/or Modifications of Original Code
* as defined in and that are subject to the Apple Public Source License
* Version 2.0 (the 'License'). You may not use this file except in
* compliance with the License. The rights granted to you under the License
* may not be used to create, or enable the creation or redistribution of,
* unlawful or unlicensed copies of an Apple operating system, or to
* circumvent, violate, or enable the circumvention or violation of, any
* terms of an Apple operating system software license agreement.
*
* Please obtain a copy of the License at
* http://www.opensource.apple.com/apsl/ and read it before using this file.
*
* The Original Code and all software distributed under the License are
* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
* Please see the License for the specific language governing rights and
* limitations under the License.
*
* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
*/
#include <mach/mach_types.h>
#include <mach/mach_traps.h>
#include <mach/mach_vm_server.h>
#include <mach/mach_port_server.h>
#include <mach/mach_host_server.h>
#include <mach/mach_voucher_server.h>
#include <mach/vm_map.h>
#include <kern/task.h>
#include <kern/ipc_tt.h>
#include <kern/kalloc.h>
#include <vm/vm_protos.h>
#include <kdp/kdp_dyld.h>
kern_return_t
mach_port_get_attributes(
ipc_space_t space,
mach_port_name_t name,
int flavor,
mach_port_info_t info,
mach_msg_type_number_t *count);
extern lck_mtx_t g_dyldinfo_mtx;
int
_kernelrpc_mach_vm_allocate_trap(struct _kernelrpc_mach_vm_allocate_trap_args *args)
{
mach_vm_offset_t addr;
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
if (copyin(args->addr, (char *)&addr, sizeof(addr))) {
goto done;
}
rv = mach_vm_allocate_external(task->map, &addr, args->size, args->flags);
if (rv == KERN_SUCCESS) {
rv = copyout(&addr, args->addr, sizeof(addr));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_vm_deallocate_trap(struct _kernelrpc_mach_vm_deallocate_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_vm_deallocate(task->map, args->address, args->size);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_vm_protect_trap(struct _kernelrpc_mach_vm_protect_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_vm_protect(task->map, args->address, args->size,
args->set_maximum, args->new_protection);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_vm_map_trap(struct _kernelrpc_mach_vm_map_trap_args *args)
{
mach_vm_offset_t addr;
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
if (copyin(args->addr, (char *)&addr, sizeof(addr))) {
goto done;
}
rv = mach_vm_map_external(task->map, &addr, args->size, args->mask, args->flags,
IPC_PORT_NULL, 0, FALSE, args->cur_protection, VM_PROT_ALL,
VM_INHERIT_DEFAULT);
if (rv == KERN_SUCCESS) {
rv = copyout(&addr, args->addr, sizeof(addr));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_vm_purgable_control_trap(
struct _kernelrpc_mach_vm_purgable_control_trap_args *args)
{
int state;
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
if (copyin(args->state, (char *)&state, sizeof(state))) {
goto done;
}
rv = mach_vm_purgable_control(task->map,
args->address,
args->control,
&state);
if (rv == KERN_SUCCESS) {
rv = copyout(&state, args->state, sizeof(state));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_allocate_trap(struct _kernelrpc_mach_port_allocate_args *args)
{
task_t task = port_name_to_task(args->target);
mach_port_name_t name;
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_allocate(task->itk_space, args->right, &name);
if (rv == KERN_SUCCESS) {
rv = copyout(&name, args->name, sizeof(name));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_deallocate_trap(struct _kernelrpc_mach_port_deallocate_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_deallocate(task->itk_space, args->name);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_mod_refs_trap(struct _kernelrpc_mach_port_mod_refs_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_mod_refs(task->itk_space, args->name, args->right, args->delta);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_move_member_trap(struct _kernelrpc_mach_port_move_member_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_move_member(task->itk_space, args->member, args->after);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_insert_right_trap(struct _kernelrpc_mach_port_insert_right_args *args)
{
task_t task = port_name_to_task(args->target);
ipc_port_t port;
mach_msg_type_name_t disp;
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
if (args->name == args->poly) {
switch (args->polyPoly) {
case MACH_MSG_TYPE_MAKE_SEND:
case MACH_MSG_TYPE_COPY_SEND:
/* fastpath MAKE_SEND / COPY_SEND which is the most common case */
rv = ipc_object_insert_send_right(task->itk_space, args->poly,
args->polyPoly);
goto done;
default:
break;
}
}
rv = ipc_object_copyin(task->itk_space, args->poly, args->polyPoly,
(ipc_object_t *)&port, 0, NULL, IPC_OBJECT_COPYIN_FLAGS_ALLOW_IMMOVABLE_SEND);
if (rv != KERN_SUCCESS) {
goto done;
}
disp = ipc_object_copyin_type(args->polyPoly);
rv = mach_port_insert_right(task->itk_space, args->name, port, disp);
if (rv != KERN_SUCCESS && IP_VALID(port)) {
ipc_object_destroy(ip_to_object(port), disp);
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_get_attributes_trap(struct _kernelrpc_mach_port_get_attributes_args *args)
{
task_read_t task = port_name_to_task_read_no_eval(args->target);
int rv = MACH_SEND_INVALID_DEST;
mach_msg_type_number_t count;
if (task != current_task()) {
goto done;
}
// MIG does not define the type or size of the mach_port_info_t out array
// anywhere, so derive them from the field in the generated reply struct
#define MACH_PORT_INFO_OUT (((__Reply__mach_port_get_attributes_from_user_t*)NULL)->port_info_out)
#define MACH_PORT_INFO_STACK_LIMIT 80 // current size is 68 == 17 * sizeof(integer_t)
_Static_assert(sizeof(MACH_PORT_INFO_OUT) < MACH_PORT_INFO_STACK_LIMIT,
"mach_port_info_t has grown significantly, reevaluate stack usage");
const mach_msg_type_number_t max_count = (sizeof(MACH_PORT_INFO_OUT) / sizeof(MACH_PORT_INFO_OUT[0]));
typeof(MACH_PORT_INFO_OUT[0]) info[max_count];
/*
* zero out our stack buffer because not all flavors of
* port_get_attributes initialize the whole struct
*/
bzero(info, sizeof(MACH_PORT_INFO_OUT));
if (copyin(CAST_USER_ADDR_T(args->count), &count, sizeof(count))) {
rv = MACH_SEND_INVALID_DATA;
goto done;
}
if (count > max_count) {
count = max_count;
}
rv = mach_port_get_attributes(task->itk_space, args->name, args->flavor, info, &count);
if (rv == KERN_SUCCESS) {
rv = copyout(&count, CAST_USER_ADDR_T(args->count), sizeof(count));
}
if (rv == KERN_SUCCESS && count > 0) {
rv = copyout(info, CAST_USER_ADDR_T(args->info), count * sizeof(info[0]));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_insert_member_trap(struct _kernelrpc_mach_port_insert_member_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_insert_member(task->itk_space, args->name, args->pset);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_extract_member_trap(struct _kernelrpc_mach_port_extract_member_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_extract_member(task->itk_space, args->name, args->pset);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_construct_trap(struct _kernelrpc_mach_port_construct_args *args)
{
task_t task = port_name_to_task(args->target);
mach_port_name_t name;
int rv = MACH_SEND_INVALID_DEST;
mach_port_options_t options;
if (copyin(args->options, (char *)&options, sizeof(options))) {
rv = MACH_SEND_INVALID_DATA;
goto done;
}
if (task != current_task()) {
goto done;
}
rv = mach_port_construct(task->itk_space, &options, args->context, &name);
if (rv == KERN_SUCCESS) {
rv = copyout(&name, args->name, sizeof(name));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_destruct_trap(struct _kernelrpc_mach_port_destruct_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_destruct(task->itk_space, args->name, args->srdelta, args->guard);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_guard_trap(struct _kernelrpc_mach_port_guard_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_guard(task->itk_space, args->name, args->guard, args->strict);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_unguard_trap(struct _kernelrpc_mach_port_unguard_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
if (task != current_task()) {
goto done;
}
rv = mach_port_unguard(task->itk_space, args->name, args->guard);
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_type_trap(struct _kernelrpc_mach_port_type_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
mach_port_type_t type;
if (task != current_task()) {
goto done;
}
rv = mach_port_type(task->itk_space, args->name, &type);
if (rv == KERN_SUCCESS) {
rv = copyout(&type, args->ptype, sizeof(type));
}
done:
if (task) {
task_deallocate(task);
}
return rv;
}
int
_kernelrpc_mach_port_request_notification_trap(
struct _kernelrpc_mach_port_request_notification_args *args)
{
task_t task = port_name_to_task(args->target);
int rv = MACH_SEND_INVALID_DEST;
ipc_port_t notify, previous;
mach_msg_type_name_t disp;
mach_port_name_t previous_name = MACH_PORT_NULL;
if (task != current_task()) {
goto done;
}
disp = ipc_object_copyin_type(args->notifyPoly);
if (disp != MACH_MSG_TYPE_PORT_SEND_ONCE) {
goto done;
}
if (MACH_PORT_VALID(args->notify)) {
rv = ipc_object_copyin(task->itk_space, args->notify, args->notifyPoly,
(ipc_object_t *)&notify, 0, NULL, 0);
} else {
notify = CAST_MACH_NAME_TO_PORT(args->notify);
}
if (rv != KERN_SUCCESS) {
goto done;
}
rv = mach_port_request_notification(task->itk_space, args->name,
args->msgid, args->sync, notify, &previous);
if (rv != KERN_SUCCESS) {
ipc_object_destroy(ip_to_object(notify), disp);
goto done;
}
if (IP_VALID(previous)) {
// Remove once <rdar://problem/45522961> is fixed.
// We need to make ith_knote NULL as ipc_object_copyout() uses
// thread-argument-passing and its value should not be garbage
current_thread()->ith_knote = ITH_KNOTE_NULL;
rv = ipc_object_copyout(task->itk_space, ip_to_object(previous),
MACH_MSG_TYPE_PORT_SEND_ONCE, IPC_OBJECT_COPYOUT_FLAGS_NONE, NULL, NULL, &previous_name);
if (rv != KERN_SUCCESS) {
goto done;
}
}
rv = copyout(&previous_name, args->previous, sizeof(previous_name));
done:
if (task) {
task_deallocate(task);
}
return rv;
}
kern_return_t
host_create_mach_voucher_trap(struct host_create_mach_voucher_args *args)
{
host_t host = port_name_to_host(args->host);
ipc_voucher_t new_voucher = IV_NULL;
ipc_port_t voucher_port = IPC_PORT_NULL;
mach_port_name_t voucher_name = 0;
kern_return_t kr = KERN_SUCCESS;
if (host == HOST_NULL) {
return MACH_SEND_INVALID_DEST;
}
if (args->recipes_size < 0) {
return KERN_INVALID_ARGUMENT;
}
if (args->recipes_size > MACH_VOUCHER_ATTR_MAX_RAW_RECIPE_ARRAY_SIZE) {
return MIG_ARRAY_TOO_LARGE;
}
/* keep small recipes on the stack for speed */
uint8_t buf[MACH_VOUCHER_TRAP_STACK_LIMIT];
uint8_t *krecipes = buf;
if (args->recipes_size > MACH_VOUCHER_TRAP_STACK_LIMIT) {
krecipes = kheap_alloc(KHEAP_TEMP, args->recipes_size, Z_WAITOK);
if (krecipes == NULL) {
return KERN_RESOURCE_SHORTAGE;
}
}
if (copyin(CAST_USER_ADDR_T(args->recipes), (void *)krecipes, args->recipes_size)) {
kr = KERN_MEMORY_ERROR;
goto done;
}
kr = host_create_mach_voucher(host, krecipes, args->recipes_size, &new_voucher);
if (kr != KERN_SUCCESS) {
goto done;
}
voucher_port = convert_voucher_to_port(new_voucher);
voucher_name = ipc_port_copyout_send(voucher_port, current_space());
kr = copyout(&voucher_name, args->voucher, sizeof(voucher_name));
done:
if (args->recipes_size > MACH_VOUCHER_TRAP_STACK_LIMIT) {
kheap_free(KHEAP_TEMP, krecipes, args->recipes_size);
}
return kr;
}
kern_return_t
mach_voucher_extract_attr_recipe_trap(struct mach_voucher_extract_attr_recipe_args *args)
{
ipc_voucher_t voucher = IV_NULL;
kern_return_t kr = KERN_SUCCESS;
mach_msg_type_number_t sz = 0;
if (copyin(args->recipe_size, (void *)&sz, sizeof(sz))) {
return KERN_MEMORY_ERROR;
}
if (sz > MACH_VOUCHER_ATTR_MAX_RAW_RECIPE_ARRAY_SIZE) {
return MIG_ARRAY_TOO_LARGE;
}
voucher = convert_port_name_to_voucher(args->voucher_name);
if (voucher == IV_NULL) {
return MACH_SEND_INVALID_DEST;
}
/* keep small recipes on the stack for speed */
uint8_t buf[MACH_VOUCHER_TRAP_STACK_LIMIT];
uint8_t *krecipe = buf;
mach_msg_type_number_t max_sz = sz;
if (max_sz > MACH_VOUCHER_TRAP_STACK_LIMIT) {
krecipe = kheap_alloc(KHEAP_TEMP, max_sz, Z_WAITOK);
if (!krecipe) {
return KERN_RESOURCE_SHORTAGE;
}
}
if (copyin(CAST_USER_ADDR_T(args->recipe), (void *)krecipe, max_sz)) {
kr = KERN_MEMORY_ERROR;
goto done;
}
kr = mach_voucher_extract_attr_recipe(voucher, args->key,
(mach_voucher_attr_raw_recipe_t)krecipe, &sz);
assert(sz <= max_sz);
if (kr == KERN_SUCCESS && sz > 0) {
kr = copyout(krecipe, CAST_USER_ADDR_T(args->recipe), sz);
}
if (kr == KERN_SUCCESS) {
kr = copyout(&sz, args->recipe_size, sizeof(sz));
}
done:
if (max_sz > MACH_VOUCHER_TRAP_STACK_LIMIT) {
kheap_free(KHEAP_TEMP, krecipe, max_sz);
}
ipc_voucher_release(voucher);
return kr;
}
/*
* Mach Trap: task_dyld_process_info_notify_get_trap
*
* Return an array of active dyld notifier port names for current_task(). User
* is responsible for allocating the memory for the mach port names array
* and deallocating the port names inside the array returned.
*
* Does not consume any reference.
*
* Args:
* names_addr: Address for mach port names array. (In param only)
* names_count_addr: Number of active dyld notifier ports. (In-Out param)
* In: Number of slots available for copyout in caller
* Out: Actual number of ports copied out
*
* Returns:
*
* KERN_SUCCESS: A valid namesCnt is returned. (Can be zero)
* KERN_INVALID_ARGUMENT: Arguments are invalid.
* KERN_MEMORY_ERROR: Memory copyio operations failed.
* KERN_NO_SPACE: User allocated memory for port names copyout is insufficient.
*
* Other error code see task_info().
*/
kern_return_t
task_dyld_process_info_notify_get_trap(struct task_dyld_process_info_notify_get_trap_args *args)
{
struct task_dyld_info dyld_info;
mach_msg_type_number_t info_count = TASK_DYLD_INFO_COUNT;
mach_port_name_t copyout_names[DYLD_MAX_PROCESS_INFO_NOTIFY_COUNT];
ipc_port_t copyout_ports[DYLD_MAX_PROCESS_INFO_NOTIFY_COUNT];
ipc_port_t release_ports[DYLD_MAX_PROCESS_INFO_NOTIFY_COUNT];
uint32_t copyout_count = 0, release_count = 0, active_count = 0;
mach_vm_address_t ports_addr; /* a user space address */
mach_port_name_t new_name;
natural_t user_names_count = 0;
ipc_port_t sright;
kern_return_t kr;
ipc_port_t *portp;
ipc_entry_t entry;
if ((mach_port_name_array_t)args->names_addr == NULL || (natural_t *)args->names_count_addr == NULL) {
return KERN_INVALID_ARGUMENT;
}
kr = copyin((vm_map_address_t)args->names_count_addr, &user_names_count, sizeof(natural_t));
if (kr) {
return KERN_MEMORY_FAILURE;
}
if (user_names_count == 0) {
return KERN_NO_SPACE;
}
kr = task_info(current_task(), TASK_DYLD_INFO, (task_info_t)&dyld_info, &info_count);
if (kr) {
return kr;
}
if (dyld_info.all_image_info_format == TASK_DYLD_ALL_IMAGE_INFO_32) {
ports_addr = (mach_vm_address_t)(dyld_info.all_image_info_addr +
offsetof(struct user32_dyld_all_image_infos, notifyMachPorts));
} else {
ports_addr = (mach_vm_address_t)(dyld_info.all_image_info_addr +
offsetof(struct user64_dyld_all_image_infos, notifyMachPorts));
}
lck_mtx_lock(&g_dyldinfo_mtx);
itk_lock(current_task());
if (current_task()->itk_dyld_notify == NULL) {
itk_unlock(current_task());
(void)copyoutmap_atomic32(current_task()->map, MACH_PORT_NULL, (vm_map_address_t)ports_addr); /* reset magic */
lck_mtx_unlock(&g_dyldinfo_mtx);
kr = copyout(&copyout_count, (vm_map_address_t)args->names_count_addr, sizeof(natural_t));
return kr ? KERN_MEMORY_ERROR : KERN_SUCCESS;
}
for (int slot = 0; slot < DYLD_MAX_PROCESS_INFO_NOTIFY_COUNT; slot++) {
portp = &current_task()->itk_dyld_notify[slot];
if (*portp == IPC_PORT_NULL) {
continue;
} else {
sright = ipc_port_copy_send(*portp);
if (IP_VALID(sright)) {
copyout_ports[active_count++] = sright; /* donates */
sright = IPC_PORT_NULL;
} else {
release_ports[release_count++] = *portp; /* donates */
*portp = IPC_PORT_NULL;
}
}
}
task_dyld_process_info_update_helper(current_task(), active_count,
(vm_map_address_t)ports_addr, release_ports, release_count);
/* itk_lock, g_dyldinfo_mtx are unlocked upon return */
for (int i = 0; i < active_count; i++) {
sright = copyout_ports[i]; /* donates */
copyout_ports[i] = IPC_PORT_NULL;
assert(IP_VALID(sright));
ip_reference(sright);
/*
* Below we consume each send right in copyout_ports, and if copyout_send
* succeeds, replace it with a port ref; otherwise release the port ref.
*
* We can reuse copyout_ports array for this purpose since
* copyout_count <= active_count.
*/
new_name = ipc_port_copyout_send(sright, current_space()); /* consumes */
if (MACH_PORT_VALID(new_name)) {
copyout_names[copyout_count] = new_name;
copyout_ports[copyout_count] = sright; /* now holds port ref */
copyout_count++;
} else {
ip_release(sright);
}
}
assert(copyout_count <= active_count);
if (user_names_count < copyout_count) {
kr = KERN_NO_SPACE;
goto copyout_failed;
}
/* copyout to caller's local copy */
kr = copyout(copyout_names, (vm_map_address_t)args->names_addr,
copyout_count * sizeof(mach_port_name_t));
if (kr) {
kr = KERN_MEMORY_ERROR;
goto copyout_failed;
}
kr = copyout(&copyout_count, (vm_map_address_t)args->names_count_addr, sizeof(natural_t));
if (kr) {
kr = KERN_MEMORY_ERROR;
goto copyout_failed;
}
/* now, release port refs on copyout_ports */
for (int i = 0; i < copyout_count; i++) {
sright = copyout_ports[i];
assert(IP_VALID(sright));
ip_release(sright);
}
return KERN_SUCCESS;
copyout_failed:
/*
* No locks are held beyond this point.
*
* Release port refs on copyout_ports, and deallocate ports that we copied out
* earlier.
*/
for (int i = 0; i < copyout_count; i++) {
sright = copyout_ports[i];
assert(IP_VALID(sright));
if (ipc_right_lookup_write(current_space(), copyout_names[i], &entry)) {
/* userspace has deallocated the name we copyout */
ip_release(sright);
continue;
}
/* space is locked and active */
if (entry->ie_object == ip_to_object(sright) ||
IE_BITS_TYPE(entry->ie_bits) == MACH_PORT_TYPE_DEAD_NAME) {
(void)ipc_right_dealloc(current_space(), copyout_names[i], entry); /* unlocks space */
} else {
is_write_unlock(current_space());
}
/* space is unlocked */
ip_release(sright);
}
return kr;
}