/xnu-2422.115.4/iokit/Kernel/ |
H A D | IORangeAllocator.cpp | 136 // allocate element at index 137 bool IORangeAllocator::allocElement( UInt32 index ) 153 index * sizeof( IORangeAllocatorElement)); 154 bcopy( elements + index, 155 newElements + index + 1, 156 (numElements - index) * sizeof( IORangeAllocatorElement)); 166 bcopy( elements + index, 167 elements + index + 1, 168 (numElements - index) * sizeof( IORangeAllocatorElement)); 175 // destroy element at index 190 UInt32 index; local 246 UInt32 index; local 295 UInt32 index; local 336 UInt32 index; local 367 UInt32 index; local [all...] |
H A D | IOMultiMemoryDescriptor.cpp | 83 for ( unsigned index = 0; index < _descriptorsCount; index++ ) 84 _descriptors[index]->release(); 120 for ( unsigned index = 0; index < withCount; index++ ) 122 descriptors[index]->retain(); 123 _length += descriptors[index]->getLength(); 124 if ( _tag == 0 ) _tag = descriptors[index] [all...] |
H A D | IOInterleavedMemoryDescriptor.cpp | 97 UInt32 index; local 99 for ( index = 0; index < _descriptorCount; index++ ) 102 _descriptors[index]->complete(getDirection()); 104 _descriptors[index]->release(); 105 _descriptors[index] = 0; 107 _descriptorOffsets[index] = 0; 108 _descriptorLengths[index] = 0; 160 for ( unsigned index 186 unsigned index; local [all...] |
/xnu-2422.115.4/bsd/kern/ |
H A D | bsd_stubs.c | 119 * if index is -1, return a free slot if avaliable 120 * else see whether the index is free 123 * if index is negative, we start 124 * looking for a free slot at the absolute value of index, 128 bdevsw_isfree(int index) argument 132 if (index < 0) { 133 if (index == -1) 134 index = 1; /* start at 1 to avoid collision with volfs (Radar 2842228) */ 136 index = -index; /* star 165 bdevsw_add(int index, struct bdevsw * bsw) argument 179 bdevsw_remove(int index, struct bdevsw * bsw) argument 204 cdevsw_isfree(int index) argument 246 cdevsw_add(int index, struct cdevsw * csw) argument 260 cdevsw_remove(int index, struct cdevsw * csw) argument 283 cdevsw_add_with_bdev(int index, struct cdevsw * csw, int bdev) argument 297 cdevsw_setkqueueok(int index, struct cdevsw *csw, int use_offset) argument [all...] |
/xnu-2422.115.4/osfmk/ipc/ |
H A D | ipc_hash.c | 94 mach_port_index_t index, 132 mach_port_index_t index; local 134 index = MACH_PORT_INDEX(name); 135 ipc_hash_table_insert(space->is_table, space->is_table_size, obj, index, entry); 153 mach_port_index_t index; local 155 index = MACH_PORT_INDEX(name); 156 ipc_hash_table_delete(space->is_table, space->is_table_size, obj, index, entry); 172 * Because at least one entry in the table (index 0) is always unused, 208 mach_port_index_t hindex, index; local 223 while ((index 251 ipc_hash_table_insert( ipc_entry_t table, ipc_entry_num_t size, ipc_object_t obj, mach_port_index_t index, __assert_only ipc_entry_t entry) argument 291 ipc_hash_table_delete( ipc_entry_t table, ipc_entry_num_t size, ipc_object_t obj, mach_port_index_t index, __assert_only ipc_entry_t entry) argument [all...] |
H A D | ipc_space.c | 135 mach_port_index_t index; local 156 for (index = 0; index < new_size; index++) { 157 ipc_entry_t entry = &table[index]; 160 entry->ie_next = index+1; 228 mach_port_index_t index; local 252 for (index = 0; index < size; index 290 mach_port_index_t index; local [all...] |
H A D | ipc_table.c | 103 unsigned int index; local 110 for (index = 0, size = 1; 111 (index < num) && (size < PAGE_SIZE); 114 its[index].its_size = (ipc_table_elems_t)(size / elemsize); 115 index++; 121 for (incrsize = PAGE_SIZE; index < num;) { 125 (period < 15) && (index < num); 128 its[index].its_size = (ipc_table_elems_t)(size / elemsize); 129 index++;
|
H A D | ipc_entry.c | 97 mach_port_index_t index; local 103 index = MACH_PORT_INDEX(name); 104 if (index < space->is_table_size) { 105 entry = &space->is_table[index]; 167 * The new name can't be MACH_PORT_NULL because index 245 mach_port_index_t index = MACH_PORT_INDEX(name); local 264 * 1) The entry is reserved (index 0) 271 if (index < space->is_table_size) { 274 entry = &table[index]; 276 if (index 359 mach_port_index_t index; local 409 mach_port_index_t index; local [all...] |
/xnu-2422.115.4/EXTERNAL_HEADERS/architecture/i386/ |
H A D | sel.h | 53 index :13; member in struct:sel
|
/xnu-2422.115.4/libsyscall/wrappers/string/ |
H A D | index.c | 34 index function
|
H A D | strings.h | 74 char *index(const char *, int);
|
/xnu-2422.115.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeNodeOps.c | 63 <CS2> 7/21/97 msd Make GetRecordByIndex check its record index input; it now 126 // SearchNode - Return index for record that matches key. 132 // GetRecordOffset - Return the offset for record "index". 133 // GetRecordAddress - Return address of record "index". 134 // GetOffsetAddress - Return address of offset for record "index". 147 u_int16_t index ); 151 u_int16_t index ); 155 u_int16_t index, 160 u_int16_t index ); 165 #define GetRecordOffset(btreePtr,node,index) (*(shor 490 InsertRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, RecordPtr recPtr, u_int16_t recSize ) argument 560 InsertKeyRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr keyPtr, u_int16_t keyLength, RecordPtr recPtr, u_int16_t recSize ) argument 725 int32_t index; local 776 GetRecordByIndex(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr *keyPtr, u_int8_t * *dataPtr, u_int16_t *dataSize ) argument 1015 InsertOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, u_int16_t delta ) argument [all...] |
H A D | BTree.c | 80 <HFS7> 2/19/97 djb Enable variable sized index keys for HFS+ volumes. Added node 83 variable sized index keys). 468 u_int16_t index; local 513 foundRecord = SearchNode (btreePtr, node.buffer, &searchIterator->key, &index); 515 //�� if !foundRecord, we could still skip tree search if ( 0 < index < numRecords ) 538 err = SearchTree ( btreePtr, &searchIterator->key, treePathTable, &nodeNum, &node, &index); 557 GetRecordByIndex (btreePtr, node.buffer, index, &keyPtr, &recordPtr, &len); 581 resultIterator->hint.index = index; 614 resultIterator->hint.index 665 u_int16_t index; local 981 u_int16_t index; local 1272 u_int16_t index; local 1435 u_int16_t index; local 1583 u_int16_t index; local 1694 u_int16_t index; local [all...] |
H A D | BTreeTreeOps.c | 66 sized index keys. 68 variable sized index keys. 135 u_int16_t index, 150 u_int16_t index, 158 u_int16_t index, 190 Result: noErr - key found, index is record index 191 fsBTRecordNotFoundErr - key not found, index is insert index 207 u_int16_t index; local 351 InsertTree( BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level, Boolean replacingKey, u_int32_t *insertNode ) argument 382 InsertLevel(BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, InsertKey *primaryKey, InsertKey *secondaryKey, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level, u_int32_t *insertNode ) argument 557 InsertNode(BTreeControlBlockPtr btreePtr, InsertKey *key, BlockDescriptor *rightNode, u_int32_t node, u_int16_t index, u_int32_t *newNode, u_int16_t *newIndex, BlockDescriptor *leftNode, Boolean *updateParent, Boolean *insertParent, Boolean *rootSplit ) argument 697 DeleteTree(BTreeControlBlockPtr btreePtr, TreePathTable treePathTable, BlockDescriptor *targetNode, u_int16_t index, u_int16_t level ) argument 974 u_int16_t index, moveIndex; local 1117 SplitLeft(BTreeControlBlockPtr btreePtr, BlockDescriptor *leftNode, BlockDescriptor *rightNode, u_int32_t rightNodeNum, u_int16_t index, KeyPtr keyPtr, u_int8_t * recPtr, u_int16_t recSize, u_int16_t *insertIndex, u_int32_t *insertNodeNum, u_int16_t *recsRotated ) argument [all...] |
/xnu-2422.115.4/tools/tests/libMicro/ |
H A D | cascade_cond.c | 173 block(int index) argument 175 (void) pthread_mutex_lock(&mxs[index]); 176 while (conds[index] != 0) { 177 (void) pthread_cond_wait(&cvs[index], &mxs[index]); 179 conds[index] = 1; 180 (void) pthread_mutex_unlock(&mxs[index]); 186 unblock(int index) argument 188 (void) pthread_mutex_lock(&mxs[index]); 189 conds[index] [all...] |
H A D | file_lock.c | 47 block(int index) argument 53 fl.l_start = index; 59 unblock(int index) argument 65 fl.l_start = index;
|
/xnu-2422.115.4/osfmk/i386/ |
H A D | hibernate_restore.c | 64 uintptr_t index; local 86 index = (virt >> I386_LPGSHIFT); 89 if (phys == BootPTD[index]) return (virt); 90 BootPTD[index] = phys; 92 BootPTD[index + 1] = (phys + I386_LPGBYTES);
|
/xnu-2422.115.4/libkern/c++/ |
H A D | OSArray.cpp | 232 bool OSArray::setObject(unsigned int index, const OSMetaClassBase *anObject) argument 237 if ((index > count) || !anObject) 245 if (index != count) { 246 for (i = count; i > index; i--) 249 array[index] = anObject; 280 replaceObject(unsigned int index, const OSMetaClassBase *anObject) argument 284 if ((index >= count) || !anObject) 288 oldObject = array[index]; 289 array[index] = anObject; 295 void OSArray::removeObject(unsigned int index) argument 384 unsigned int index = (*iteratorP)++; local [all...] |
/xnu-2422.115.4/osfmk/mach/ |
H A D | memory_object_types.h | 406 ppnum_t phys_addr; /* physical page index number */ 636 #define UPL_PAGE_PRESENT(upl, index) \ 637 ((upl)[(index)].phys_addr != 0) 639 #define UPL_PHYS_PAGE(upl, index) \ 640 ((upl)[(index)].phys_addr) 642 #define UPL_SPECULATIVE_PAGE(upl, index) \ 643 (((upl)[(index)].phys_addr != 0) ? ((upl)[(index)].speculative) : FALSE) 645 #define UPL_DIRTY_PAGE(upl, index) \ 646 (((upl)[(index)] [all...] |
/xnu-2422.115.4/osfmk/kdp/ |
H A D | kdp_serial.c | 40 unsigned int index; local 42 for (index = 0; index < len; index++) {
|
/xnu-2422.115.4/tools/tests/libMicro/apple/ |
H A D | getgrnam.c | 171 int index = (random() % optRecords) * GROUPNAME_LEN; local 179 err = getgrnam_r( &grpname_list[index], grp_ptr, gbuf, BUFSIZE, &tmp_ptr); 183 debug("error: %s -> %s", &grpname_list[index], strerror(err)); 187 debug("not found: %s", &grpname_list[index] ); 193 grp = getgrnam( &grpname_list[index] ); 197 debug("error: %s -> %s", &grpname_list[index], strerror(errno)); 201 debug("not found: %s", &grpname_list[index] );
|
H A D | getpwnam.c | 204 int index = (random() % optRecords) * USERNAME_LEN; local 212 err = getpwnam_r( &username_list[index], pwd_ptr, pbuf, BUFSIZE, &tmp_ptr); 214 printf("error: %s -> %s", &username_list[index], strerror(err)); 218 debug("not found: %s", &username_list[index]); 224 passwd = getpwnam( &username_list[index] ); 228 debug("error: %s -> %s", &username_list[index], strerror(errno)); 232 debug("not found: %s", &username_list[index]);
|
/xnu-2422.115.4/osfmk/kern/ |
H A D | sched_average.c | 132 uint64_t abstime, index; local 158 for (index = 0; index < stdelta; index++) { 234 for (index = 0; index < stdelta; index++) { 259 for (index = 0; index < ninvokes; index [all...] |
/xnu-2422.115.4/libkern/libkern/c++/ |
H A D | OSArray.h | 58 * Storage and access are by array index. 452 * at a particular index. 454 * @param index The index in the array at which to insert the object. 463 * This function moves existing objects from <code>index</code> on, 465 * it does not replace an existing object at <code>index</code>. See 473 * of an array by specifying an index larger than the current count. 481 unsigned int index, 508 * Replaces an object in an array at a given index. 510 * @param index Th [all...] |
/xnu-2422.115.4/bsd/dev/random/YarrowCoreLib/src/ |
H A D | prngpriv.h | 77 UINT index; /* current byte to output */ member in struct:__anon29 119 #define GENCHECK(p) if(p->outstate.index>20) {return PRNG_ERR_OUT_OF_BOUNDS;} /* index is unsigned */
|