Searched refs:right (Results 1 - 23 of 23) sorted by relevance

/xnu-2782.1.97/osfmk/ipc/
H A Dipc_notify.h86 ipc_port_t right);
H A Dipc_notify.c88 /* send-once right consumed */
106 /* send-once right consumed */
116 * Consumes a ref for right, which should be a receive right
124 ipc_port_t right)
126 mach_notify_port_destroyed(port, right);
145 /* send-once right consumed */
162 /* send-once right consumed */
180 /* send-once right consumed */
122 ipc_notify_port_destroyed( ipc_port_t port, ipc_port_t right) argument
H A Dmach_port.c423 * Retrieves the type of a right in the space.
440 * KERN_INVALID_NAME The name doesn't denote a right.
483 * Changes the name denoting a right,
488 * KERN_SUCCESS The right is renamed.
491 * KERN_INVALID_NAME The oname doesn't denote a right.
493 * KERN_NAME_EXISTS The nname already denotes a right.
513 * Allocates a right in a space, using a specific name
514 * for the new right. Possible rights:
532 * KERN_SUCCESS The right is allocated.
536 * KERN_INVALID_VALUE "right" is
546 mach_port_allocate_name( ipc_space_t space, mach_port_right_t right, mach_port_name_t name) argument
583 mach_port_allocate( ipc_space_t space, mach_port_right_t right, mach_port_name_t *namep) argument
616 mach_port_allocate_qos( ipc_space_t space, mach_port_right_t right, mach_port_qos_t *qosp, mach_port_name_t *namep) argument
651 mach_port_allocate_full( ipc_space_t space, mach_port_right_t right, mach_port_t proto, mach_port_qos_t *qosp, mach_port_name_t *namep) argument
831 mach_port_get_refs( ipc_space_t space, mach_port_name_t name, mach_port_right_t right, mach_port_urefs_t *urefsp) argument
915 mach_port_mod_refs( ipc_space_t space, mach_port_name_t name, mach_port_right_t right, mach_port_delta_t delta) argument
[all...]
H A Dipc_object.h238 mach_port_right_t right,
322 /* Translate/consume the destination right of a message */
H A Dipc_right.h98 /* Make a notification request, returning the previous send-once right */
107 /* Cancel a notification request and return the send-once right */
151 /* Modify the user-reference count for a right */
156 mach_port_right_t right,
159 /* Destroy a receive right; Modify ref count for send rights */
167 /* Retrieve information about a right */
H A Dmach_kernelrpc.c131 rv = mach_port_allocate(task->itk_space, args->right, &name);
185 rv = mach_port_mod_refs(task->itk_space, args->name, args->right, args->delta);
H A Dipc_object.c137 * KERN_INVALID_NAME The name doesn't denote a right.
138 * KERN_INVALID_RIGHT Name doesn't denote the correct right.
145 mach_port_right_t right,
157 if ((entry->ie_bits & MACH_PORT_TYPE(right)) == MACH_PORT_TYPE_NONE) {
182 * KERN_INVALID_NAME A name doesn't denote a right.
183 * KERN_INVALID_RIGHT A name doesn't denote the correct right.
274 * KERN_NAME_EXISTS The name already denotes a right.
382 * KERN_NAME_EXISTS The name already denotes a right.
490 * KERN_INVALID_RIGHT Name doesn't denote correct right.
565 * or the receive right mus
142 ipc_object_translate( ipc_space_t space, mach_port_name_t name, mach_port_right_t right, ipc_object_t *objectp) argument
[all...]
H A Dipc_right.c251 * registered send-once right. If notify is IP_NULL,
437 * Cancel a notification request and return the send-once right.
518 /* this was either a pure send right or a send-once right */
556 * trying to actually move a send-right reference would
558 * all calls that deal with the right eventually come
867 * but looks at the entry to determine the right.
1053 * Modifies the user-reference count for a right.
1054 * May deallocate the right, if the count goes to zero.
1061 * KERN_INVALID_VALUE Bad delta for the right
1066 ipc_right_delta( ipc_space_t space, mach_port_name_t name, ipc_entry_t entry, mach_port_right_t right, mach_port_delta_t delta) argument
[all...]
/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/
H A DBTreeMiscOps.c304 right - description
318 BlockDescriptor *right,
330 // assume left, middle, right point to BlockDescriptors
339 right->buffer = nil;
340 right->blockHeader = nil;
388 // BTree nodes are always grabbed in left to right order.
411 *right = *middle;
432 *right = *middle;
449 err = GetRightSiblingNode (btreePtr, middle->buffer, right);
452 if ( ((NodeDescPtr) right
314 FindIteratorPosition(BTreeControlBlockPtr btreePtr, BTreeIteratorPtr iterator, BlockDescriptor *left, BlockDescriptor *middle, BlockDescriptor *right, u_int32_t *returnNodeNum, u_int16_t *returnIndex, Boolean *foundRecord ) argument
[all...]
H A DBTree.c664 BlockDescriptor left, node, right; local
672 right.buffer = nil;
673 right.blockHeader = nil;
740 &left, &node, &right, &nodeNum, &index, &foundRecord);
759 // BTree nodes are always grabbed in left to right order.
777 // Before we stomp on "right", we'd better release it if needed
778 if (right.buffer != nil) {
779 err = ReleaseNode(btreePtr, &right);
782 right = node;
809 if (right
980 BlockDescriptor left, node, right; local
[all...]
H A DBTreeTreeOps.c587 /* sanity check our left and right nodes here. */
598 // we can assume right node is initialized.
994 // add size of insert record to right node
1080 if ( moveIndex <= rightInsertIndex ) // then insert new record in right node
1088 Panic ("RotateLeft: InsertKeyRecord (right) returned false!");
1130 NodeDescPtr left, right; local
1137 right = rightNode->buffer;
1140 PanicIf ( right->bLink != 0 && left == 0, " SplitLeft: left sibling missing!?" );
1144 if ( (right->height == 1) && (right
[all...]
/xnu-2782.1.97/libsyscall/mach/
H A Dmach_port.c79 mach_port_right_t right,
84 rv = _kernelrpc_mach_port_allocate_name(task, right, name);
92 mach_port_right_t right,
97 rv = _kernelrpc_mach_port_allocate_trap(task, right, name);
100 rv = _kernelrpc_mach_port_allocate(task, right, name);
139 mach_port_right_t right,
144 rv = _kernelrpc_mach_port_get_refs(task, name, right, refs);
153 mach_port_right_t right,
158 rv = _kernelrpc_mach_port_mod_refs_trap(task, name, right, delta);
161 rv = _kernelrpc_mach_port_mod_refs(task, name, right, delt
77 mach_port_allocate_name( ipc_space_t task, mach_port_right_t right, mach_port_name_t name) argument
90 mach_port_allocate( ipc_space_t task, mach_port_right_t right, mach_port_name_t *name) argument
136 mach_port_get_refs( ipc_space_t task, mach_port_name_t name, mach_port_right_t right, mach_port_urefs_t *refs) argument
150 mach_port_mod_refs( ipc_space_t task, mach_port_name_t name, mach_port_right_t right, mach_port_delta_t delta) argument
328 mach_port_allocate_qos( ipc_space_t task, mach_port_right_t right, mach_port_qos_t *qos, mach_port_name_t *name) argument
342 mach_port_allocate_full( ipc_space_t task, mach_port_right_t right, mach_port_t proto, mach_port_qos_t *qos, mach_port_name_t *name) argument
[all...]
/xnu-2782.1.97/osfmk/mach/
H A Dmach_port.defs117 * The right must be one of
129 right : mach_port_right_t;
134 * The right must be one of
139 * It can use any name not associated with a right.
144 right : mach_port_right_t;
161 * correct type of right. This allows a user task
172 * A send-once right always has one user ref.
174 * A send right always has one or more user refs.
175 * A receive right always has one user ref.
176 * The right mus
[all...]
H A Dport.h82 * <mach/message.h> - message queue [and port right passing] mechanism
102 * See mach_port_t for a type that implies a "named right."
112 * mach_port_t - a named port right
161 * mach_port_t - a named port right
164 * right in the Mach port namespace. Even so, this type is
166 * of a right coming along with the name.
172 * each right].
189 * that a port right was present, but it died.
203 * and reused too quickly [to catch right/reference counting bugs].
233 * a particular right t
[all...]
H A Dmach_traps.h182 mach_port_right_t right,
200 mach_port_right_t right,
615 PAD_ARG_(mach_port_right_t, right);
639 PAD_ARG_(mach_port_right_t, right);
/xnu-2782.1.97/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h343 BlockDescriptor *right,
386 NodeRec *right );
388 #define GetRightSiblingNode(btree,node,right) GetNode ((btree), ((NodeDescPtr)(node))->fLink, 0, (right))
/xnu-2782.1.97/iokit/IOKit/
H A DIODeviceTreeSupport.h74 (UInt32 cellCount, UInt32 left[], UInt32 right[]);
/xnu-2782.1.97/bsd/hfs/
H A Dhfs_hotfiles.c86 struct hotfile_entry *right; member in struct:hotfile_entry
277 hotdata->entries[i-1].right = &hotdata->entries[i];
2037 entry = entry->right;
2041 entry = entry->right;
2068 if (entry->right)
2069 entry = entry->right;
2071 entry->right = newentry;
2082 if (entry->right)
2083 entry = entry->right;
2086 entry->right
[all...]
H A Dhfs_format.h211 int16_t right; member in struct:FndrDirInfo::__anon62
/xnu-2782.1.97/SETUP/kextsymboltool/
H A Dkextsymboltool.c198 struct symbol * right = (struct symbol *) _right; local
200 return (strcmp(left->name, right->name));
/xnu-2782.1.97/libkern/libkern/
H A Dtree.h101 struct type *spe_right; /* right element */ \
134 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
136 SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
338 struct type *rbe_right; /* right element */ \
/xnu-2782.1.97/libsa/
H A Dbootstrap.cpp394 #error Pick the right way to free prelinked data on this arch
/xnu-2782.1.97/iokit/Kernel/
H A DIODeviceTreeSupport.cpp932 static SInt32 DefaultCompare( UInt32 cellCount, UInt32 left[], UInt32 right[] )
935 return( left[ cellCount ] - right[ cellCount ] );

Completed in 153 milliseconds