/macosx-10.5.8/xnu-1228.15.4/osfmk/ipc/ |
H A D | ipc_notify.c | 88 /* send-once right consumed */ 98 * Consumes a ref for right, which should be a receive right 106 ipc_port_t right) 108 mach_notify_port_destroyed(port, right); 127 /* send-once right consumed */ 144 /* send-once right consumed */ 162 /* send-once right consumed */ 104 ipc_notify_port_destroyed( ipc_port_t port, ipc_port_t right) argument
|
H A D | ipc_notify.h | 81 ipc_port_t right);
|
H A D | mach_port.c | 390 * Retrieves the type of a right in the space. 407 * KERN_INVALID_NAME The name doesn't denote a right. 446 * Changes the name denoting a right, 451 * KERN_SUCCESS The right is renamed. 454 * KERN_INVALID_NAME The oname doesn't denote a right. 456 * KERN_NAME_EXISTS The nname already denotes a right. 481 * Allocates a right in a space, using a specific name 482 * for the new right. Possible rights: 500 * KERN_SUCCESS The right is allocated. 504 * KERN_INVALID_VALUE "right" is 514 mach_port_allocate_name( ipc_space_t space, mach_port_right_t right, mach_port_name_t name) argument 551 mach_port_allocate( ipc_space_t space, mach_port_right_t right, mach_port_name_t *namep) argument 584 mach_port_allocate_qos( ipc_space_t space, mach_port_right_t right, mach_port_qos_t *qosp, mach_port_name_t *namep) argument 619 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 800 mach_port_get_refs( ipc_space_t space, mach_port_name_t name, mach_port_right_t right, mach_port_urefs_t *urefsp) argument 883 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 D | ipc_right.h | 98 /* Make a dead-name request, returning the registered send-once right */ 106 /* Cancel a dead-name request and return the send-once right */ 148 /* Modify the user-reference count for a right */ 153 mach_port_right_t right, 156 /* Retrieve information about a right */
|
H A D | ipc_object.h | 240 mach_port_right_t right, 319 /* Translate/consume the destination right of a message */
|
H A D | ipc_object.c | 142 * KERN_INVALID_NAME The name doesn't denote a right. 143 * KERN_INVALID_RIGHT Name doesn't denote the correct right. 150 mach_port_right_t right, 162 if ((entry->ie_bits & MACH_PORT_TYPE(right)) == MACH_PORT_TYPE_NONE) { 187 * KERN_INVALID_NAME A name doesn't denote a right. 188 * KERN_INVALID_RIGHT A name doesn't denote the correct right. 279 * KERN_NAME_EXISTS The name already denotes a right. 389 * KERN_NAME_EXISTS The name already denotes a right. 496 * KERN_INVALID_RIGHT Name doesn't denote correct right. 541 * or the receive right mus 147 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 D | ipc_right.c | 243 * registered send-once right. If notify is IP_NULL, 390 * Cancel a dead-name request and return the send-once right. 467 /* this was either a pure send right or a send-once right */ 498 * (or right). This makes for pretty loose reference 765 * but looks at the entry to determine the right. 944 * Modifies the user-reference count for a right. 945 * May deallocate the right, if the count goes to zero. 952 * KERN_INVALID_VALUE Bad delta for the right. 961 mach_port_right_t right, 957 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...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeMiscOps.c | 304 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 D | BTree.c | 664 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 D | BTreeTreeOps.c | 587 /* 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 ("\pRotateLeft: InsertKeyRecord (right) returned false!"); 1130 NodeDescPtr left, right; local 1137 right = rightNode->buffer; 1140 PanicIf ( right->bLink != 0 && left == 0, "\p SplitLeft: left sibling missing!?" ); 1144 if ( (right->height == 1) && (right [all...] |
/macosx-10.5.8/xnu-1228.15.4/osfmk/ddb/ |
H A D | db_sym.c | 120 char *right, 1028 char *right, 1036 if (left + eltsize - 1 >= right) { 1041 sameleft = left + (((right - left) / eltsize) / 2) * eltsize; 1045 j = right - eltsize; 1070 * Should be moved to the "right" partition. 1084 * Move to the right of the "same" partition. 1097 * to the right to free a "left" element. 1099 * to the right of the "same" partition. 1109 * waiting to be moved to the "right" 1026 qsort_recur( char *left, char *right, int eltsize, int (*compfun)(char *, char *)) argument 1206 register char *left, *right; local [all...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/netat/ |
H A D | routing_tables.h | 117 struct rt_entry *right; /* btree right pointer */ member in struct:rt_entry 158 found->right = RT_table_freelist; \
|
H A D | ddp_rtmptable.c | 41 * smaller or equal to the current Node, and the right tree points to higher 160 ptree = ptree->right; 230 if (NetStop > ptree->NetStop) { /* walk the right sub-tree */ 231 if (ptree->right) 232 ptree = ptree->right; 234 ptree->right = NewEntry; 263 RT_table_freelist = RT_table_freelist->right; 266 New->right = NULL; 301 rt_found = rt_found->right; 338 if ((pnext = rt_found->right)) { [all...] |
H A D | ddp.c | 1319 found->right = RT_table_freelist;
|
/macosx-10.5.8/xnu-1228.15.4/osfmk/mach/ |
H A D | port.h | 82 * <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 153 * mach_port_t - a named port right 156 * right in the Mach port namespace. Even so, this type is 158 * of a right coming along with the name. 164 * each right]. 183 * that a port right was present, but it died. 197 * and reused too quickly [to catch right/reference counting bugs]. 227 * a particular right t [all...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/ |
H A D | BTreesPrivate.h | 343 BlockDescriptor *right, 386 NodeRec *right ); 388 #define GetRightSiblingNode(btree,node,right) GetNode ((btree), ((NodeDescPtr)(node))->fLink, 0, (right))
|
/macosx-10.5.8/xnu-1228.15.4/iokit/IOKit/ |
H A D | IODeviceTreeSupport.h | 74 (UInt32 cellCount, UInt32 left[], UInt32 right[]);
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/ |
H A D | hfs_hotfiles.c | 86 struct hotfile_entry *right; member in struct:hotfile_entry 270 hotdata->entries[i-1].right = &hotdata->entries[i]; 1979 entry = entry->right; 1983 entry = entry->right; 2010 if (entry->right) 2011 entry = entry->right; 2013 entry->right = newentry; 2024 if (entry->right) 2025 entry = entry->right; 2028 entry->right [all...] |
H A D | hfs_format.h | 212 int16_t right; member in struct:FndrDirInfo::__anon82
|
/macosx-10.5.8/xnu-1228.15.4/iokit/Kernel/ |
H A D | IODeviceTreeSupport.cpp | 928 static SInt32 DefaultCompare( UInt32 cellCount, UInt32 left[], UInt32 right[] ) 931 return( left[ cellCount ] - right[ cellCount ] );
|
/macosx-10.5.8/xnu-1228.15.4/osfmk/ppc/ |
H A D | hw_exception.s | 551 add r31,r27,r28 ; Point right to the syscall table entry 616 add r31,r27,r28 ; Point right to the syscall table entry 731 add r28,r27,r28 ; Point right to the syscall table entry 1090 mr r3,r4 ; Get into the right register for common code 1221 ; Here we check if we are at the right level 1387 ; Here we check if we are at the right level 1688 stw r31,traceMask(0) ; Force tracing off right now 1750 ; Make sure that all savearea chains have the right type on them
|
H A D | cswtch.s | 490 stw r4,SAVact(r3) ; Indicate the right activation for this context 589 cmplw r18,r16 ; Make sure we are on the right processor 610 ; make a dummy access right now in order to get that resolved before we take the lock. 698 stw r12,SAVact(r3) ; Make sure we point to the right guy 1022 rlwinm. r8,r9,0,MSR_FP_BIT,MSR_FP_BIT ; Are floats on right now? 1180 lwz r10,liveVRS(r6) ; Get the right VRSave register 1233 stw r4,SAVact(r3) ; Indicate the right activation for this context 1240 lwz r10,liveVRS(r6) ; Get the right VRSave register 1333 cmplw r18,r16 ; Make sure we are on the right processor 1335 lwz r10,liveVRS(r26) ; Get the right VRSav [all...] |
H A D | hw_lock.s | 159 * If the sniffer finds the lock free, it jumps right up and tries to grab it. 315 * If the sniffer finds the lock free, it jumps right up and tries to grab it. 328 cmplw r0,r5 ; Are these the right bits? 356 cmplw r0,r5 ; Are these the right bits? 943 bne-- mlckespin01 ; Can not get it right now... 948 bne-- mlckespin0 ; Can not get it right now... 999 bne-- mlckspin00 ; Indirect or Can not get it right now... 1004 bne-- mlckspin01 ; Can not get it right now...
|
H A D | start.s | 173 cmplw r27,r28 ; Is this the right set? 174 beq donePVR ; We have the right one...
|
H A D | machine_routines_asm.s | 169 beq- mprdoit ; We are right on the boundary... 316 sldi r0,r0,32+8 ; Get the right bit to inhibit caching 641 sldi r0,r2,32+8 ; Get the right bit to turn off caching 1345 addi r6,r6,-1 ; Get it right
|