/macosx-10.10.1/Security-57031.1.35/Security/include/security_keychain/ |
H A D | SecFrameworkP.c | 219 UInt8 block[64]; 226 memset(result->block + 20, 0, 44); 231 CC_SHA1(seed, seedLength, result->block); 238 if (read(fd, result->block, 20) != 20) 244 CC_SHA1_Update(&result->sha1, result->block, 64); 257 CC_SHA1_Update(&randomref->sha1, randomref->block, 64); 258 OSWriteBigInt32(randomref->block, 0, randomref->sha1.h0); 259 OSWriteBigInt32(randomref->block, 4, randomref->sha1.h1); 260 OSWriteBigInt32(randomref->block, 8, randomref->sha1.h2); 261 OSWriteBigInt32(randomref->block, 1 [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_keychain/Security/ |
H A D | SecFrameworkP.c | 219 UInt8 block[64]; 226 memset(result->block + 20, 0, 44); 231 CC_SHA1(seed, seedLength, result->block); 238 if (read(fd, result->block, 20) != 20) 244 CC_SHA1_Update(&result->sha1, result->block, 64); 257 CC_SHA1_Update(&randomref->sha1, randomref->block, 64); 258 OSWriteBigInt32(randomref->block, 0, randomref->sha1.h0); 259 OSWriteBigInt32(randomref->block, 4, randomref->sha1.h1); 260 OSWriteBigInt32(randomref->block, 8, randomref->sha1.h2); 261 OSWriteBigInt32(randomref->block, 1 [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_keychain/lib/ |
H A D | SecFrameworkP.c | 219 UInt8 block[64]; 226 memset(result->block + 20, 0, 44); 231 CC_SHA1(seed, seedLength, result->block); 238 if (read(fd, result->block, 20) != 20) 244 CC_SHA1_Update(&result->sha1, result->block, 64); 257 CC_SHA1_Update(&randomref->sha1, randomref->block, 64); 258 OSWriteBigInt32(randomref->block, 0, randomref->sha1.h0); 259 OSWriteBigInt32(randomref->block, 4, randomref->sha1.h1); 260 OSWriteBigInt32(randomref->block, 8, randomref->sha1.h2); 261 OSWriteBigInt32(randomref->block, 1 [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/sec/Security/ |
H A D | SecFramework.c | 176 UInt8 block[64]; 183 memset(result->block + 20, 0, 44); 188 CCDigest(kCCDigestSHA1, seed, seedLength, result->block); 195 if (read(fd, result->block, 20) != 20) 201 CC_SHA1_Update(&result->sha1, result->block, 64); 214 CC_SHA1_Update(&randomref->sha1, randomref->block, 64); 215 OSWriteBigInt32(randomref->block, 0, randomref->sha1.h0); 216 OSWriteBigInt32(randomref->block, 4, randomref->sha1.h1); 217 OSWriteBigInt32(randomref->block, 8, randomref->sha1.h2); 218 OSWriteBigInt32(randomref->block, 1 [all...] |
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | BlockStack.h | 50 T* m_spareBlock; // Used to avoid thrash at block boundaries. 73 T* block = m_spareBlock ? m_spareBlock : static_cast<T*>(fastMalloc(blockSize)); local 76 m_blocks.append(block); 77 return block;
|
/macosx-10.10.1/libdispatch-442.1.4/src/ |
H A D | once.c | 37 dispatch_once(dispatch_once_t *val, dispatch_block_t block) argument 39 dispatch_once_f(val, block, _dispatch_Block_invoke(block));
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGTypeCheckHoistingPhase.cpp | 108 BasicBlock* block = m_graph.block(blockIndex); local 109 if (!block) 111 for (unsigned indexInBlock = 0; indexInBlock < block->size(); ++indexInBlock) { 112 Node* node = block->at(indexInBlock); 121 // If the basic block previously only had the SetArgument as its 149 if (block->variablesAtTail.operand(variable->local()) == node) 150 block->variablesAtTail.operand(variable->local()) = getLocal; 152 m_graph.substituteGetLocal(*block, indexInBlock, variable, getLocal); 190 insertionSet.execute(block); 212 BasicBlock* block = m_graph.block(blockIndex); local 315 BasicBlock* block = m_graph.block(blockIndex); local 444 BasicBlock* block = m_graph.block(blockIndex); local [all...] |
/macosx-10.10.1/xnu-2782.1.97/bsd/hfs/ |
H A D | hfs_btreeio.c | 96 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...] |
/macosx-10.10.1/ICU-531.30/icuSources/common/ |
H A D | utrie2_builder.cpp | 53 * including the bad-UTF-8-data block is not a multiple of UTRIE2_DATA_BLOCK_LENGTH 54 * and map[block>>UTRIE2_SHIFT_2] (used in reference counting and compaction 58 * assumes that a single index-2 block is used for 0x400 code points 61 * Requires UTRIE2_SHIFT_1<=16. Otherwise one single index-2 block contains 74 /** The null index-2 block, following the gap in the index-2 table. */ 81 * The null data block. 92 * Below, compaction uses a block length of 64 for 2-byte UTF-8. 141 newTrie->firstFreeBlock=0; /* no free block in the list */ 147 * - the bad-UTF-8-data block 148 * - the null data block 460 int32_t i2, block; local 559 releaseDataBlock(UNewTrie2 *trie, int32_t block) argument 566 isWritableBlock(UNewTrie2 *trie, int32_t block) argument 571 setIndex2Entry(UNewTrie2 *trie, int32_t i2, int32_t block) argument 619 int32_t block; local 662 writeBlock(uint32_t *block, uint32_t value) argument 674 fillBlock(uint32_t *block, UChar32 start, UChar32 limit, uint32_t value, uint32_t initialValue, UBool overwrite) argument 705 int32_t block, rest, repeatBlock; local 866 int32_t block; local 881 int32_t block; local 904 int32_t i1, i2, j, i2Block, prevI2Block, index2NullOffset, block, prevBlock, nullBlock; local [all...] |
/macosx-10.10.1/libauto-186/ |
H A D | Zone.h | 127 pthread_mutex_t _mark_bits_mutex; // protects the per-Region and Large block mark bits. 135 spin_lock_t _large_lock; // protects _large_list, _in_large, and large block refcounts 183 void deallocate_large(Large *large, void *block); 184 void deallocate_large_internal(Large *large, void *block); 198 // Allocates a large block from the universal pool (directly from vm_memory.) 206 // Find a large block in this zone. 208 inline Large *find_large(void *block) { return Large::large(block); } argument 214 // Release memory allocated for a small block 216 void deallocate_small_medium(void *block); 682 block_refcount(BlockRef block) argument 690 block_increment_refcount(BlockRef block) argument 708 block_decrement_refcount(BlockRef block) argument 715 is_local(void *block) argument 730 block_is_garbage(void *block) argument 1083 zombify_internal(BlockRef block) argument 1302 handle_overretained_garbage(BlockRef block) argument 1439 layout_map_for_block(void *block) argument 1449 weak_layout_map_for_block(void *block) argument [all...] |
H A D | Thread.h | 99 void *block = (*this)[i]; local 100 if (block) { 101 Subzone *subzone = Subzone::subzone(block); 102 usword_t q = subzone->quantum_index_unchecked(block); 211 LockedBoolean _scanning; // if state is true, collector is scanning, unbind will block. 236 // remove block from local set. Assumes its there. 238 inline void remove_local(void *block) { argument 240 _localAllocations.remove(block); 248 // a block is escaping the stack; remove it from local set (cheaply) 250 template <class BlockRef> void block_escaped_internal(BlockRef block); 362 block_escaped(BlockRef block) argument 400 add_local_allocation(void *block) argument [all...] |
H A D | auto_weak.cpp | 116 append_referrer_no_lock(list, old_refs[i].referrer, old_refs[i].block); 144 ref.block = new_block; 302 if ((uintptr_t(ref.block) & 1)) ref.block = (auto_weak_callback_block_t*)displace(ref.block, -1); 323 if ((uintptr_t(ref.block) & 1)) ref.block = (auto_weak_callback_block_t*)displace(ref.block, -1); 366 (type & AUTO_OBJECT) ? "an object" : "a data block", 374 if (ref->block) { 382 auto_weak_callback_block_t *block = ref->block; local 447 weak_register_no_lock(Zone *azone, const void *referent, void **referrer, auto_weak_callback_block_t *block) argument 477 weak_register(Zone *azone, const void *referent, void **referrer, auto_weak_callback_block_t *block) argument 644 weak_unregister_with_layout(Zone *azone, void *block[], const unsigned char *layout) argument 709 weak_call_callbacks(auto_weak_callback_block_t *block) argument [all...] |
H A D | ZoneDump.cpp | 56 // send single block information 57 void *block = subzone->quantum_address(q); local 59 node_dump(block, subzone->size(q), subzone->layout(q), ref.refcount()); 66 // send single block information 148 // send single block information 149 void *block = subzone->quantum_address(q); local 151 _visitor->visit_node(block, subzone->size(q), subzone->layout(q), ref.refcount(), subzone->is_thread_local(q)); 158 // send single block information 194 visitor->visit_weak(*ref.referrer, ref.referrer, ref.block); 202 void *block local [all...] |
/macosx-10.10.1/ruby-106/ruby/lib/ |
H A D | logger.rb | 133 # 1. Message in a block. 149 # The block form allows you to create potentially complex log messages, 156 # and the entire block will not even be evaluated. Compare to this: 263 # The block should return an Object that can be written to the logging 336 # +message+ and +block+ are given. 337 # +block+:: 366 def add(severity, message = nil, progname = nil, &block) 401 def debug(progname = nil, &block) 402 add(DEBUG, nil, progname, &block) 408 # info(progname, &block) [all...] |
H A D | open3.rb | 45 # Non-block form: 69 # The block form also waits the process when it returns. 82 def popen3(*cmd, &block) 99 popen_run(cmd, opts, [in_r, out_w, err_w], [in_w, out_r, err_r], &block) 114 # Non-block form: 143 def popen2(*cmd, &block) 157 popen_run(cmd, opts, [in_r, out_w], [in_w, out_r], &block) 172 # Non-block form: 192 def popen2e(*cmd, &block) 206 popen_run(cmd, opts, [in_r, out_w], [in_w, out_r], &block) [all...] |
/macosx-10.10.1/ruby-106/ruby/test/ruby/ |
H A D | test_iterator.rb | 48 def tt3(&block) 49 tt2(raise(ArgumentError,""),&block) 62 def tt4 &block 63 tt2(raise(ArgumentError,""),&block) 117 def each0(&block); @body.each(&block); end 118 def each1(&block); @body.each {|*x| block.call(*x) } end 119 def each2(&block); @body.each {|*x| block [all...] |
/macosx-10.10.1/JavaScriptCore-7600.1.17/ftl/ |
H A D | FTLOutput.cpp | 55 LBasicBlock Output::appendTo(LBasicBlock block, LBasicBlock nextBlock) argument 57 appendTo(block); 61 void Output::appendTo(LBasicBlock block) argument 63 m_block = block; 65 llvm->PositionBuilderAtEnd(m_builder, block);
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/inspector/remote/ |
H A D | RemoteInspectorDebuggableConnection.mm | 59 for (const auto& block : queueCopy) 60 block(); 105 for (const auto& block : queueCopy) 106 block(); 135 void RemoteInspectorDebuggableConnection::dispatchAsyncOnDebuggable(void (^block)()) 138 queueTaskOnPrivateRunLoop(block); 144 WebCoreWebThreadRun(block); 149 RemoteInspectorQueueTaskOnGlobalQueue(block); 257 void RemoteInspectorDebuggableConnection::queueTaskOnPrivateRunLoop(void (^block)()) 263 m_queue.append(RemoteInspectorBlock(block)); [all...] |
/macosx-10.10.1/ruby-106/ruby/ext/dl/lib/dl/ |
H A D | value.rb | 39 def wrap_args(args, tys, funcs, &block) 43 result.push(wrap_arg(arg, tys[idx], funcs, &block)) 48 def wrap_arg(arg, ty, funcs = [], &block) 65 if( block ) 66 arg.bind_at_call(&block) 69 raise(RuntimeError, "block must be given.")
|
/macosx-10.10.1/ruby-106/ruby/ext/fiddle/lib/fiddle/ |
H A D | value.rb | 39 def wrap_args(args, tys, funcs, &block) 43 result.push(wrap_arg(arg, tys[idx], funcs, &block)) 48 def wrap_arg(arg, ty, funcs = [], &block) 63 if( block ) 64 arg.bind_at_call(&block) 67 raise(RuntimeError, "block must be given.")
|
/macosx-10.10.1/ruby-106/ruby/lib/rake/ |
H A D | file_utils.rb | 33 def sh(*cmd, &block) 35 shell_runner = block_given? ? block : create_shell_runner(cmd) 77 def ruby(*args,&block) 80 sh(*([RUBY] + args + [options]), &block) 82 sh("#{RUBY} #{args.first}", options, &block)
|
/macosx-10.10.1/tcl-105/tcl84/tcl/generic/ |
H A D | tclAlloc.c | 58 * The overhead on a block is at least 8 bytes. When free, this space 59 * contains a pointer to the next free block, and the bottom two bits must 63 * requested block, less 1, rounded up to a multiple of sizeof(RMAGIC). 78 unsigned long ovu_size; /* actual block size */ 102 * nextf[i] is the pointer to the next free block of size 2^(i+3). The 103 * smallest allocatable block is MINBLOCK bytes. The overhead information 118 struct block { struct 119 struct block *nextPtr; /* Linked list. */ 120 struct block *prevPtr; /* Linked list for big blocks, ensures 8-byte 124 static struct block *blockLis [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/ |
H A D | ckDES.c | 446 static void round(desInst dinst, int num, unsigned long int *block) { argument 454 block[1] ^= f(block[0],dinst->kn[num]); 456 block[0] ^= f(block[1],dinst->kn[num]); 465 register char *ib, *ob; /* ptr to input or output block */ 474 /* Clear output block */ 488 /* In-place encryption of 64-bit block */ 489 void endes(desInst dinst, char *block) { argument 494 permute(block,iper 516 dedes(desInst dinst, char *block) argument [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
H A D | ckDES.c | 446 static void round(desInst dinst, int num, unsigned long int *block) { argument 454 block[1] ^= f(block[0],dinst->kn[num]); 456 block[0] ^= f(block[1],dinst->kn[num]); 465 register char *ib, *ob; /* ptr to input or output block */ 474 /* Clear output block */ 488 /* In-place encryption of 64-bit block */ 489 void endes(desInst dinst, char *block) { argument 494 permute(block,iper 516 dedes(desInst dinst, char *block) argument [all...] |
/macosx-10.10.1/gpt-12/ |
H A D | remove.c | 44 static off_t block, size; variable 96 if (block > 0 && block != m->map_start) 160 if (block > 0) 162 block = strtoll(optarg, &p, 10); 163 if (*p != 0 || block < 1) 192 (block > 0 || entry > 0 || size > 0 || !uuid_is_nil(&type, NULL)))
|