Searched refs:block (Results 1 - 24 of 24) sorted by relevance

/xnu-2422.115.4/tools/tests/libMicro/
H A Dcascade_fcntl.c131 block(int index) function
193 /* block their first move */
194 e += block(ts->ts_them0);
206 /* wait to be unblocked (id == 0 will not block) */
207 e += block(ts->ts_us0);
210 /* allow them to block us again */
213 /* block their next + 1 move */
214 e += block(ts->ts_them1);
220 e += block(ts->ts_us1);
224 e += block(t
[all...]
H A Dcascade_flock.c139 block(int index) function
189 /* block their first move */
190 e += block(ts->ts_them0);
202 /* wait to be unblocked (id == 0 will not block) */
203 e += block(ts->ts_us0);
206 /* allow them to block us again */
209 /* block their next + 1 move */
210 e += block(ts->ts_them1);
216 e += block(ts->ts_us1);
220 e += block(t
[all...]
H A Dcascade_lockf.c134 block(int index) function
184 /* block their first move */
185 e += block(ts->ts_them0);
197 /* wait to be unblocked (id == 0 will not block) */
198 e += block(ts->ts_us0);
201 /* allow them to block us again */
204 /* block their next + 1 move */
205 e += block(ts->ts_them1);
211 e += block(ts->ts_us1);
215 e += block(t
[all...]
H A Dcascade_mutex.c138 block(int index) function
188 /* block their first move */
189 e += block(ts->ts_them0);
201 /* wait to be unblocked (id == 0 will not block) */
202 e += block(ts->ts_us0);
205 /* allow them to block us again */
208 /* block their next + 1 move */
209 e += block(ts->ts_them1);
215 e += block(ts->ts_us1);
219 e += block(t
[all...]
H A Dcascade_cond.c173 block(int index) function
239 /* block their first move */
240 e += block(ts->ts_them0);
252 /* wait to be unblocked (id == 0 will not block) */
253 e += block(ts->ts_us0);
256 /* allow them to block us again */
259 /* block their next + 1 move */
260 e += block(ts->ts_them1);
266 e += block(ts->ts_us1);
270 e += block(t
[all...]
H A Dfile_lock.c47 block(int index) function
99 e += block(0);
/xnu-2422.115.4/bsd/hfs/
H A Dhfs_btreeio.c96 OSStatus GetBTreeBlock(FileReference vp, u_int32_t blockNum, GetBlockOptions options, BlockDescriptor *block) argument
102 /* If the btree block is being read using hint, it is
115 offset = (daddr64_t)blockNum * (daddr64_t)block->blockSize;
116 bp = buf_getblk(vp, (daddr64_t)blockNum, block->blockSize, 0, 0, BLK_META);
118 VNOP_BLOCKMAP(vp, offset, block->blockSize, &blkno, NULL, NULL, 0, NULL) == 0) {
122 retval = buf_meta_bread(vp, (daddr64_t)blockNum, block->blockSize, NOCRED, &bp);
128 block->blockHeader = bp;
129 block->buffer = (char *)buf_dataptr(bp);
130 block->blockNum = buf_lblkno(bp);
131 block
239 BlockDescriptor block; local
[all...]
H A Dhfs_btreeio.h44 GetBlockOptions options, BlockDescriptor *block);
H A Dhfs_readwrite.c351 eflags = kEFDeferMask; /* defer file block allocations */
403 * of which are because we may be writing to a (portion of a) block
405 * prior, uninitialized contents of the block. The cases are:
414 * old EOF and new EOF are in the same block, we still need to
572 read without being zeroed. The current last block is filled with zeroes
651 * zeroing of the last block, above), then we'll zero fill from the current EOF
2050 /* On magic value for location, set nextAllocation to next block
2123 * volume is currently initialized as normal volume (sorted by block
2125 * for sparse device (sorted by start block).
2813 * Converts a logical block numbe
4775 BlockDescriptor block; local
[all...]
/xnu-2422.115.4/bsd/kern/
H A Dkern_lockf.c453 struct lockf *block; local
479 * Scan lock list for this file looking for locks that would block us.
481 while ((block = lf_getblock(lock, -1))) {
502 (block->lf_flags & F_POSIX)) {
508 /* The block is waiting on something */
509 wproc = (struct proc *)block->lf_id;
526 * which would block us, and make
581 lock->lf_next = block;
582 TAILQ_INSERT_TAIL(&block->lf_blkhd, lock, lf_block);
585 block
925 struct lockf *block; local
1384 lf_hold_assertion(task_t block_task, struct lockf *block) argument
1405 lf_jump_to_queue_head(struct lockf *block, struct lockf *lock) argument
1423 lf_drop_assertion(struct lockf *block) argument
[all...]
H A Dkern_synch.c174 /* It can still block in proc_exit() after the teardown. */
213 goto block;
229 goto block;
243 block:
H A Dtty_pty.c503 * We want to block until the slave
605 * Need to block timeouts (ttrstart).
668 goto block;
671 goto block;
729 goto block;
742 block:
H A Dtty_ptmx.c911 * We want to block until the slave
1115 * Need to block timeouts (ttrstart).
1192 goto block;
1195 goto block;
1253 goto block;
1266 block:
/xnu-2422.115.4/bsd/hfs/hfscommon/BTree/
H A DBTreeScanner.c150 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...]
/xnu-2422.115.4/bsd/dev/random/YarrowCoreLib/src/
H A Dsha1mod.c52 #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...]
/xnu-2422.115.4/osfmk/kdp/
H A Dkdp_core.h55 unsigned int tu_block; /* block # */
89 struct corehdr *create_panic_header(unsigned int request, const char *corename, unsigned length, unsigned block);
H A Dkdp_udp.c1521 unsigned length, unsigned int block)
1595 coreh->th_block = htonl((unsigned int) block);
1520 create_panic_header(unsigned int request, const char *corename, unsigned length, unsigned int block) argument
/xnu-2422.115.4/bsd/dev/random/
H A Dfips_sha1.c173 * SHA1 block update operation. Continues a SHA1 message-digest
174 * operation, processing another message block, and updating the
263 * SHA1 basic transformation. Transforms state based on block.
267 u_int32_t e, const u_int8_t block[64], SHA1_CTX *context)
273 w15 = FETCH_32(block + 60);
274 w14 = FETCH_32(block + 56);
275 w13 = FETCH_32(block + 52);
276 w12 = FETCH_32(block + 48);
277 w11 = FETCH_32(block + 44);
278 w10 = FETCH_32(block
266 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...]
/xnu-2422.115.4/bsd/hfs/hfscommon/Misc/
H A DVolumeAllocation.c44 asked for. Returns the starting block number, and number of
91 specifies where to begin the search (by block number). The
92 block number of the first block in the range is returned. This is only
112 Given an allocation block number, read the bitmap block that
113 contains that allocation block into a caller-supplied buffer.
116 Release a bitmap block back into the buffer cache.
119 Given an allocation block number, read a range of bitmap that
120 must begin at that allocation block int
1390 daddr64_t block; local
1462 daddr64_t block; local
1868 register u_int32_t block; // current block number local
3661 hfs_find_summary_free(struct hfsmount *hfsmp, uint32_t block, uint32_t *newblock) argument
3847 hfs_get_summary_index(struct hfsmount *hfsmp, uint32_t block, uint32_t* index) argument
[all...]
/xnu-2422.115.4/libkern/libkern/crypto/
H A Ddes.h80 /* Single DES ECB - 1 block */
84 /* Triple DES ECB - 1 block */
86 void des3_ecb_encrypt(des_cblock *block, des_cblock *, des3_ecb_key_schedule *ks, int encrypt);
/xnu-2422.115.4/osfmk/kern/
H A Dledger.c668 * observed peak for the current time block, *or* we
669 * haven't yet recorded a peak for the current time block --
690 * are several possible ways to handle it. We can block,
892 * The peak for this time block isn't stale, and it
1153 uint32_t block; local
1222 block = 0;
1231 block |= ledger_check_needblock(thl, now);
1233 block |= ledger_check_needblock(l, now);
1236 * If we are supposed to block on the availability of one or more
1241 if (block) {
1257 uint32_t flags, block = 0; local
[all...]
/xnu-2422.115.4/bsd/hfs/hfscommon/headers/
H A DBTreesInternal.h122 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 );
/xnu-2422.115.4/libkern/zlib/
H A Dzutil.h118 /* The three kinds of block type */
133 void _Cdecl farfree( void *block );
/xnu-2422.115.4/bsd/dev/vn/
H A Dshadow.c92 u_char * block_bitmap; /* 1 bit per block; 1=written */
313 shadow_map_block_to_band(shadow_map_t * map, uint32_t 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 */

Completed in 185 milliseconds