/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/ |
H A D | hfs_btreeio.c | 75 OSStatus GetBTreeBlock(FileReference vp, u_int32_t blockNum, GetBlockOptions options, BlockDescriptor *block) argument 81 /* If the btree block is being read using hint, it is 94 offset = (daddr64_t)blockNum * (daddr64_t)block->blockSize; 95 bp = buf_getblk(vp, (daddr64_t)blockNum, block->blockSize, 0, 0, BLK_META); 97 VNOP_BLOCKMAP(vp, offset, block->blockSize, &blkno, NULL, NULL, 0, NULL) == 0) { 101 retval = buf_meta_bread(vp, (daddr64_t)blockNum, block->blockSize, NOCRED, &bp); 107 block->blockHeader = bp; 108 block->buffer = (char *)buf_dataptr(bp); 109 block->blockNum = buf_lblkno(bp); 110 block 194 BlockDescriptor block; local [all...] |
H A D | hfs_btreeio.h | 44 GetBlockOptions options, BlockDescriptor *block);
|
H A D | hfs_readwrite.c | 233 eflags = kEFDeferMask; /* defer file block allocations */ 385 read without being zeroed. The current last block is filled with zeroes 464 * zeroing of the last block, above), then we'll zero fill from the current EOF 1471 /* On magic value for location, set nextAllocation to next block 1922 * Converts a logical block number to a physical block, and optionally returns 1923 * the amount of remaining blocks in a run. The logical block is based on hfsNode.logBlockSize. 1924 * The physical block number is based on the device block size, currently its 512. 1925 * The block ru 3059 BlockDescriptor block; local [all...] |
H A D | hfs_vfsops.c | 176 /* Establish the free block reserve. */ 224 * is in progress and therefore block any further 971 /* Get the logical block size (treated as physical block size everywhere) */ 976 /* Get the physical block size. */ 984 * block size is same as logical block size 999 /* resetting block size may fail if getting block count did */ 1010 * block siz 4024 u_long block; local 4480 u_long block; local 4767 u_int32_t block; local [all...] |
/macosx-10.5.8/xnu-1228.15.4/osfmk/kdp/ |
H A D | kdp_core.h | 50 unsigned int tu_block; /* block # */ 80 struct corehdr *create_panic_header(unsigned int request, const char *corename, unsigned length, unsigned block);
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeScanner.c | 150 BlockDescriptor block; local 193 block.blockHeader = NULL; /* No buffer cache buffer */ 194 block.buffer = scanState->currentNodePtr; 195 block.blockNum = scanState->nodeNum; 196 block.blockSize = scanState->btcb->nodeSize; 197 block.blockReadFromDisk = 1; 198 block.isModified = 0; 206 err = hfs_swap_BTNode(&block, fref, kSwapBTNodeBigToHost, true); 256 // map logical block in catalog btree file to physical block o [all...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/dev/random/YarrowCoreLib/src/ |
H A D | sha1mod.c | 52 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 53 |(rol(block->l[i],8)&0x00FF00FF)) 55 #define blk0(i) block->l[i] 57 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 58 ^block->l[(i+2)&15]^block->l[i&15],1)) 68 /* Hash a single 512-bit block 78 CHAR64LONG16* block; local [all...] |
/macosx-10.5.8/xnu-1228.15.4/libkern/crypto/ |
H A D | md5.c | 168 * MD5 block update operation. Continues an MD5 message-digest 169 * operation, processing another message block, and updating the 241 * MD5 basic transformation. Transforms state based on block. 245 const u_int8_t block[64], MD5_CTX *context) 251 x15 = FETCH_32(block + 60); 252 x14 = FETCH_32(block + 56); 253 x13 = FETCH_32(block + 52); 254 x12 = FETCH_32(block + 48); 255 x11 = FETCH_32(block + 44); 256 x10 = FETCH_32(block 244 MD5Transform(u_int32_t a, u_int32_t b, u_int32_t c, u_int32_t d, const u_int8_t block[64], MD5_CTX *context) argument [all...] |
H A D | sha1.c | 174 * SHA1 block update operation. Continues a SHA1 message-digest 175 * operation, processing another message block, and updating the 359 * SHA1 basic transformation. Transforms state based on block. 363 u_int32_t e, const u_int8_t block[64], SHA1_CTX *context) 369 w15 = FETCH_32(block + 60); 370 w14 = FETCH_32(block + 56); 371 w13 = FETCH_32(block + 52); 372 w12 = FETCH_32(block + 48); 373 w11 = FETCH_32(block + 44); 374 w10 = FETCH_32(block 362 SHA1Transform(u_int32_t a, u_int32_t b, u_int32_t c, u_int32_t d, u_int32_t e, const u_int8_t block[64], SHA1_CTX *context) argument [all...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/kern/ |
H A D | kern_lockf.c | 391 struct lockf *block; local 414 * Scan lock list for this file looking for locks that would block us. 416 while ((block = lf_getblock(lock))) { 436 (block->lf_flags & F_POSIX)) { 442 /* The block is waiting on something */ 443 wproc = (struct proc *)block->lf_id; 460 * which would block us, and make 515 lock->lf_next = block; 516 TAILQ_INSERT_TAIL(&block->lf_blkhd, lock, lf_block); 517 block 821 struct lockf *block; local [all...] |
H A D | kern_synch.c | 170 /* It can still block in proc_exit() after the teardown. */ 196 goto block; 208 goto block; 218 block:
|
H A D | tty_pty.c | 493 * We want to block until the slave 593 * Need to block timeouts (ttrstart). 656 goto block; 659 goto block; 717 goto block; 728 block:
|
H A D | tty_ptmx.c | 878 * We want to block until the slave 1076 * Need to block timeouts (ttrstart). 1158 goto block; 1161 goto block; 1219 goto block; 1230 block:
|
/macosx-10.5.8/xnu-1228.15.4/bsd/netat/ |
H A D | adsp_Write.c | 172 FillSendQueue(sp, pb); /* Copy from write param block to send queue */ 219 CheckData(block, size, current) 220 char *block; 228 if ((block[i] & 0xff) != (current & 0xff)) { 230 adsp_bad_block = block;
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/Misc/ |
H A D | VolumeAllocation.c | 44 asked for. Returns the starting block number, and number of 60 specifies where to begin the search (by block number). The 61 block number of the first block in the range is returned. 77 Given an allocation block number, read the bitmap block that 78 contains that allocation block into a caller-supplied buffer. 81 Release a bitmap block back into the buffer cache. 167 ; the requested starting allocation block. If there is not enough 168 ; room there, a block o 502 daddr64_t block; local 681 register u_int32_t block; // current block number local [all...] |
/macosx-10.5.8/xnu-1228.15.4/osfmk/ppc/ |
H A D | mcount.s | 59 lwz r7,ACT_PER_PROC(r7) ; Get the per_proc block 70 lwz r7,ACT_PER_PROC(r7) ; Get the per_proc block
|
H A D | savearea_asm.s | 228 * This routine will add a savearea block to the free list. 229 * We also queue the block to the free pool list. This is a 230 * circular double linked list. Because this block has no free entries, 254 b saveQueue64a ; Fill the whole block... 283 b saveQueue32a ; Fill the whole block... 1053 ; r31 = free pool block list 1077 bne+ cr7,sttoss ; Not an empty block 1080 ; We have an empty block. Remove it from the pool list. 1102 ; A pool block that had no free entries now has one. Stick it on the pool list. 1157 ; r31 = free pool block lis [all...] |
H A D | atomic_switch.s | 114 lwz r2,ACT_PER_PROC(r2) ; Get the per_proc block 224 lwz r3,ACT_PER_PROC(r3) ; Get the per_proc block
|
H A D | misc_asm.s | 70 lwz r8,ACT_PER_PROC(r8) ; Get the per_proc block 98 lwz r8,ACT_PER_PROC(r8) ; Get the per_proc block
|
H A D | skiplists.s | 151 ; Mapping not found, check to see if prev node was a block mapping or nested pmap. 152 ; If not, or if our address is not covered by the block or nested map, return 0. 153 ; Note the advantage of keeping the check for block mappings (and nested pmaps) 163 lhz r11,mpBSize(r9) ; get #pages/#segments in block/submap mapping 239 ; Mapping not found, check to see if prev node was a block mapping or nested pmap. 240 ; If not, or if our address is not covered by the block or nested map, return 0. 241 ; Note the advantage of keeping the check for block mappings (and nested pmaps) 251 lhz r11,mpBSize(r9) ; get #pages/#segments in block/submap mapping 260 rlwinm r10,r10,0,0,19 ; zero low 12 bits of block mapping va 378 lhz r11,mpBSize(r3) ; get #pages/#segments in block/subma [all...] |
H A D | hw_vm.s | 104 * Maps a page or block into a pmap 108 * Make mapping - not block or I/O - note: this is low-level, upper should remove duplicates 123 * Make mapping - block or I/O - note: this is low-level, upper should remove duplicates 167 rlwinm r11,r4,0,0,19 ; Round down to get mapping block address 202 lhz r23,mpBSize(r31) ; Get the block size for later 485 * Remove mapping via pmap, I/O or block 504 * 16) invalidate tlb entries for the whole block map but no more than the full tlb 653 ; mapping (more than one if a block) and accumulate the reference 664 cmplwi cr5,r0,mpBlock ; Remember whether this is a block mapping 681 beq- cr5,hrmBlock32 ; Go treat block speciall [all...] |
H A D | hw_exception.s | 102 lwz r25,ACT_PER_PROC(r13) ; Get the per_proc block 237 lwz r10,ACT_PER_PROC(r8) ; Get the per_proc block 325 lwz r25,ACT_PER_PROC(r13) ; Get the per_proc block 534 lwz r10,ACT_PER_PROC(r10) ; Get the per_proc block 683 lwz r10,ACT_PER_PROC(r10) ; Get the per_proc block 794 lwz r10,ACT_PER_PROC(r10) ; Get the per_proc block 900 lwz r25,ACT_PER_PROC(r13) ; Get the per_proc block 1039 lwz r10,ACT_PER_PROC(r8) ; Get the per_proc block 1111 ; R10 = per_proc block 1647 lwz r10,ACT_PER_PROC(r10) ; Get the per_proc block [all...] |
H A D | cswtch.s | 56 lwz r6,ACT_PER_PROC(r6) ; Get the per_proc block 130 lwz r12,ACT_PER_PROC(r3) ; Get the per_proc block 399 lwz r6,ACT_PER_PROC(r6) ; Get the per_proc block 433 ; First, make sure that the live context block is not mucked with while 484 lwz r6,ACT_PER_PROC(r6) ; Get the per_proc block 554 lwz r26,ACT_PER_PROC(r17) ; Get the per_proc block 618 ; Make sure that the live context block is not mucked with while 723 ; Make sure that the live context block is not mucked with while 1031 lwz r8,ACT_PER_PROC(r8) ; Get the per_proc block 1109 lwz r6,ACT_PER_PROC(r6) ; Get the per_proc block [all...] |
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/ |
H A D | BTreesInternal.h | 122 daddr64_t blockNum; /* logical block number (used by hfs_swap_BTNode) */ 147 kGetBlockHint = 0x00000001, // if set, the block is being looked up using hint 175 BlockDescriptor *block );
|
/macosx-10.5.8/xnu-1228.15.4/bsd/dev/vn/ |
H A D | shadow.c | 92 u_char * block_bitmap; /* 1 bit per block; 1=written */ 313 shadow_map_block_to_band(shadow_map_t * map, unsigned long block) argument 315 return (block / map->blocks_per_band); 410 * The number of bytes required in a block bitmap to represent a file of size 416 * An 8GB file requires (assuming 512 byte block): 433 * Calculate the block offset within the shadow to read, and the number 490 * Calculate the block offset within the shadow to write, and the number 585 /* create a block bitmap, one bit per block */
|