Searched refs:left (Results 1 - 23 of 23) sorted by relevance

/darwin-on-arm/xnu/tools/tests/libMicro/
H A Dexec_bin.c43 int left; local
49 left = atoi(argv[1]);
51 left--;
53 if (left <= 0) {
57 (void) sprintf(buffer, "%d", left);
/darwin-on-arm/xnu/tools/tests/libMicro/apple/
H A Dposix_spawn_bin.c47 int left; local
54 left = atoi(argv[1]);
56 left--;
58 if (left <= 0) {
62 (void) sprintf(buffer, "%d", left);
/darwin-on-arm/xnu/bsd/hfs/hfscommon/BTree/
H A DBTreeMiscOps.c302 left - description
316 BlockDescriptor *left,
330 // assume left, middle, right point to BlockDescriptors
335 left->buffer = nil;
336 left->blockHeader = nil;
388 // BTree nodes are always grabbed in left to right order.
390 // left node.
394 // Look up the left node
395 err = GetNode (btreePtr, nodeNum, 0, left);
399 err = GetRightSiblingNode (btreePtr, left
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 DBTree.c664 BlockDescriptor left, node, right; local
670 left.buffer = nil;
671 left.blockHeader = nil;
740 &left, &node, &right, &nodeNum, &index, &foundRecord);
754 if (left.buffer == nil)
759 // BTree nodes are always grabbed in left to right order.
761 // left node.
765 // Look up the left node
766 err = GetNode (btreePtr, nodeNum, 0, &left);
770 err = GetRightSiblingNode (btreePtr, left
980 BlockDescriptor left, node, right; local
[all...]
H A DBTreeTreeOps.c430 treePathTable [level + 1].index = 1; // 1 since we always split/rotate left
502 primaryKey->skipRotate = insertParent; // don't rotate left if we have two inserts occuring
537 err = UpdateNode (btreePtr, &leftNode, 0, kLockTransaction); // all done with left sibling
587 /* sanity check our left and right nodes here. */
650 // might not have left node...
1048 if ( index == rightInsertIndex ) // insert new record in left node
1058 Panic ("RotateLeft: InsertKeyRecord (left) returned false!");
1130 NodeDescPtr left, right; local
1138 left = leftNode->buffer;
1140 PanicIf ( right->bLink != 0 && left
[all...]
/darwin-on-arm/xnu/libkern/zlib/
H A Dinftrees.c73 int left; /* number of prefix codes available */ local
158 left = 1;
160 left <<= 1;
161 left -= count[len];
162 if (left < 0) return -1; /* over-subscribed */
164 if (left > 0 && (type == CODES || max != 1))
297 left = (int)(1 << curr);
299 left -= count[curr + drop];
300 if (left <= 0) break;
302 left <<
[all...]
H A Dinfback.c151 left = strm->avail_out; \
162 strm->avail_out = left; \
232 if (left == 0) { \
234 left = state->wsize; \
235 state->whave = left; \
236 if (out(out_desc, put, left)) { \
280 unsigned have, left; /* available input and output */ local
307 left = state->wsize;
366 if (copy > left) copy = left;
[all...]
H A Dinflate.c435 left = strm->avail_out; \
446 strm->avail_out = left; \
529 input left to load n bits into the accumulator, or it continues. BITS(n)
542 state information is maintained to continue the loop where it left off
590 unsigned have, left; /* available input and output */ local
614 out = left;
853 if (copy > left) copy = left;
858 left -= copy;
980 if (have >= 6 && left >
[all...]
/darwin-on-arm/xnu/iokit/IOKit/
H A DIODeviceTreeSupport.h74 (UInt32 cellCount, UInt32 left[], UInt32 right[]);
77 (UInt32 cellCount, UInt32 left[], UInt32 right[]);
/darwin-on-arm/xnu/bsd/dev/
H A Dmemdev.c236 unsigned int left, lop, csize; local
285 left = buf_count(bp); /* Init the amount left to copy */
286 while(left) { /* Go until it is all copied */
288 lop = min((4096 - (vaddr & 4095)), (4096 - (fvaddr & 4095))); /* Get smallest amount left on sink and source */
289 csize = min(lop, left); /* Don't move more than we need to */
299 left = left - csize; /* Calculate what is left */
311 left
[all...]
/darwin-on-arm/xnu/bsd/dev/random/YarrowCoreLib/src/
H A Dprng.c456 long int left,prev;
473 for(prev=0,left=outbuflen;left>0;prev+=20,left-=20)
477 memcpy(outbuf+prev,dig,(left>20)?20:left);
/darwin-on-arm/xnu/bsd/netat/
H A Dddp_rtmptable.c40 * zero. From any point in the tree, the left side contains Network ranges
174 ptree = ptree->left;
239 else { /* walk the left sub-tree */
240 if (ptree->left)
241 ptree = ptree->left;
243 ptree->left = NewEntry;
315 rt_found = rt_found->left;
340 /* Tree pruning: take the left branch of the current
341 * node and place it at the lowest left branch
349 while ((pnextl = psub->left))
[all...]
H A Drouting_tables.h116 struct rt_entry *left; /* btree left pointer */ member in struct:rt_entry
/darwin-on-arm/xnu/bsd/hfs/
H A Dhfs_hotfiles.c85 struct hotfile_entry *left; member in struct:hotfile_entry
217 printf("hfs: Resume recording hot files on %s (%d secs left)\n",
1245 printf("hfs: hotfiles_adopt: [%d] adopted %d blocks (%d left)\n", listp->hfl_next, blksmoved, listp->hfl_totalblocks);
2024 entry = entry->left;
2028 entry = entry->left;
2060 if (entry->left)
2061 entry = entry->left;
2063 entry->left = newentry;
2075 if (entry->left)
2076 entry = entry->left;
[all...]
H A Dhfs_format.h217 int16_t left; member in struct:FndrDirInfo::__anon72
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h341 BlockDescriptor *left,
380 NodeRec *left );
382 #define GetLeftSiblingNode(btree,node,left) GetNode ((btree), ((NodeDescPtr)(node))->bLink, 0, (left))
/darwin-on-arm/xnu/libkern/libkern/
H A Dtree.h100 struct type *spe_left; /* left element */ \
134 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
135 SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
338 struct type *rbe_left; /* left element */ \
595 struct type *left; \
597 while ((left = RB_LEFT(elm, field)) != NULL) \
598 elm = left; \
627 left = parent; \
629 RB_AUGMENT(left); \
630 } while ((left
[all...]
/darwin-on-arm/xnu/bsd/nfs/
H A Dnfs_gss.c1914 * If there are still some cached contexts left,
3197 int left, bytes; local
3216 left = mbuf_len(mb);
3217 if (offset >= left) {
3219 offset -= left;
3224 left -= offset;
3227 bytes = left < len ? left : len;
3302 int left, left8, remain; local
3316 left
3341 left, &ivec, &ivec, encrypt, KG_USAGE_SEAL); local
[all...]
H A Dnfs_subs.c564 uint32_t left, need, mblen, cplen, padlen; local
591 /* we need (len - left) more bytes */
593 left = nmc->nmc_left;
594 need = len - left;
613 /* copy "left" bytes to the new mbuf */
614 bcopy(nmc->nmc_ptr, ptr, left);
615 ptr += left;
616 mbuf_setlen(mb, left);
627 /* reduce current mbuf's length by "left" */
628 mbuf_setlen(mbcur, mbuf_len(mbcur) - left);
[all...]
H A Dnfs_serv.c820 uint32_t reqlen, maxlen, count, len, tlen, left; local
887 len = left = count;
/darwin-on-arm/xnu/osfmk/arm/armv/
H A Dcpufunc-v7.s329 lsr r3, r3, #23 @ left align loc (low 4 bits)
374 lsr ip, ip, #23 @ left align LoC (low 4 bits)
392 lsr r3, r3, #23 @ left align loc (low 4 bits)
437 lsr ip, ip, #23 @ left align LoC (low 4 bits)
/darwin-on-arm/xnu/SETUP/kextsymboltool/
H A Dkextsymboltool.c182 struct symbol * left = (struct symbol *) _left; local
185 return (strcmp(left->name, right->name));
/darwin-on-arm/xnu/iokit/Kernel/
H A DIODeviceTreeSupport.cpp929 static SInt32 DefaultCompare( UInt32 cellCount, UInt32 left[], UInt32 right[] ) argument
932 return( left[ cellCount ] - right[ cellCount ] );

Completed in 136 milliseconds