/macosx-10.5.8/xnu-1228.15.4/libsyscall/ |
H A D | GNUmakefile | 4 all:
|
H A D | Makefile.xbs | 4 .MAIN: all 5 all: lib${LIB}.a lib${LIB}_static.a lib${LIB}_debug.a lib${LIB}_profile.a
|
/macosx-10.5.8/xnu-1228.15.4/tools/lockstat/ |
H A D | Makefile | 5 all: $(TARGETS)
|
/macosx-10.5.8/xnu-1228.15.4/tools/tests/affinity/ |
H A D | Makefile | 11 all: $(TESTS)
|
/macosx-10.5.8/xnu-1228.15.4/iokit/Tests/ |
H A D | Tests.cpp | 18 * The Original Code and all software distributed under the License are 51 OSOrderedSet * all; local 59 all = iter->iterateAll(); 60 IOLog("\nCount %d\n", all->getCount() ); 61 all->release(); 89 all = iter->iterateAll(); 90 IOLog("del gc/, count now %d\n", all->getCount() ); 91 all->release();
|
/macosx-10.5.8/xnu-1228.15.4/iokit/Kernel/ |
H A D | IOKitDebug.cpp | 18 * The Original Code and all software distributed under the License are 70 OSOrderedSet * all; local 76 all = iter->iterateAll(); 77 if( all) { 78 IOLog("Count %d\n", all->getCount() ); 79 all->release(); 127 OSOrderedSet * all; local 133 all = iter->iterateAll(); 134 if( all) { 135 dbugprintf("Count %d\n", all [all...] |
H A D | IORegistryEntry.cpp | 18 * The Original Code and all software distributed under the License are 301 OSArray * all; local 320 all = getParentSetReference( plane ); 321 if( all) for( index = 0; 322 (next = (IORegistryEntry *) all->getObject(index)); 328 all = getChildSetReference( plane ); 329 if( all) for( index = 0; 330 (next = (IORegistryEntry *) all->getObject(index)); 1727 OSOrderedSet * all; local 1734 all [all...] |
/macosx-10.5.8/xnu-1228.15.4/tools/tests/MMTest/ |
H A D | Makefile | 6 all: $(TARGETS)
|
/macosx-10.5.8/xnu-1228.15.4/libkern/ppc/ |
H A D | strlen.s | 18 * The Original Code and all software distributed under the License are 40 ; if ( y & z ) = 0 then all bytes in dataWord are non-zero 72 beq LLoop ; if r4 is zero, then all bytes are non-zero
|
/macosx-10.5.8/xnu-1228.15.4/osfmk/ppc/ |
H A D | machine_routines_asm.s | 18 * The Original Code and all software distributed under the License are 58 ori r0,r0,lo16(MASK(MSR_EE)+MASK(MSR_FP)+MASK(MSR_IR)+MASK(MSR_DR)) // turn off all 4 177 mtmsr r2 ; Translation and all off 212 sync ; Make sure all is well 232 eieio ; Make sure of all previous accesses 233 sync ; Make sure it is all caught up 331 eieio ; Make sure of all previous accesses 643 bnelr++ cr7 ; We are not in the I/O area, all ready... 657 blr ; Finally, all ready... 1056 eqv r10,r10,r10 ; Get all foxe [all...] |
H A D | AltiAssist.s | 18 * The Original Code and all software distributed under the License are 89 li r11,T_IN_VAIN ; We are all done
|
H A D | hw_exception.s | 18 * The Original Code and all software distributed under the License are 261 b chkfac ; Go end it all... 265 ; Here is where we go when we detect that the kernel stack is all messed up. 693 * ast_taken will save all state and bring us back here 740 /* thread_exception_return returns to here, almost all 765 b chkfac ; Go end it all... 801 * ast_taken will save all state and bring us back here 1102 ; This section is common to all exception exits. It throws away vector 1127 beq-- chkenax ; Yeah, skip it all... 1183 li r21,0 ; Assume we popped all th [all...] |
H A D | misc_asm.s | 18 * The Original Code and all software distributed under the License are 55 * General entry for all debuggers. This gets us onto the debug stack and 94 andc r0,r0,r8 ; Turn off all the interesting stuff 168 * are different between ppc601 and ppc603/4, we define them all.
|
H A D | skiplists.s | 18 * The Original Code and all software distributed under the License are 43 * Searching, adding, and deleting from a skip-list can all be done in O(ln(n)) time. 44 * Because the first skip-list is just a sorted list of all mappings, it is also 45 * efficient to purge a sparsely populated pmap of all the mappings in a large range, 116 subi r8,r8,4 ; we use all 64 bits of ptrs 355 subi r8,r8,4 ; we use all 64 bits of ptrs 439 bne mapSrchFull64d ; mapSearchFull must search all lists to get prev ptrs 521 bne mapSrchFull32d ; mapSearchFull must search all lists to get prev ptrs 562 subi r10,r10,4 ; we use all 8 bytes of the ptr fields 681 subi r11,r11,4 ; we use all 6 [all...] |
H A D | cswtch.s | 18 * The Original Code and all software distributed under the License are 497 bl fp_store ; save all 32 FPRs in the save area at r3 597 ; Also check to see if all we are here just to re-enable the MSR 709 bl fp_store ; store all 32 FPRs 716 ; The context is all saved now and the facility is free. 912 fmr f1,f0 ; Do them all 943 b fsenable ; Finish setting it all up... 948 ; is still live. Essentially, all we are doing is turning on the facility. It may have 1079 * vrvalid (all other registers are splatted with 0s). This is done because we 1341 ; Also check to see if all w [all...] |
H A D | lowmem_vectors.s | 18 * The Original Code and all software distributed under the License are 778 * with interrupts and VM off, in 64-bit mode if supported, and with all registers live 792 mfcr r13 ; save callers entire cr (we use all fields below) 1011 sync ; Make sure it all goes 1129 sync ; Make sure it all goes 1157 mtcr r13 ; restore all 8 fields 1191 * misses, so these stores won't take all that long. Except the first line that is because 1195 * Note that if we are attempting to sleep (as opposed to nap or doze) all interruptions 1472 bne+ cr5,xcp32xit ; Skip all of this if no tracing here... 1572 sync ; Make sure it all goe [all...] |
H A D | hw_vm.s | 18 * The Original Code and all software distributed under the License are 77 ; |00000000|00000002|22222222|11111111|111111BB|BBBBBBBB|BBBB////| - SID Hash - this is all 112 * 3) find mapping full path - finds all possible list previous elements 127 * 3) find mapping full path - finds all possible list previous elements 317 eqv r4,r4,r4 ; Get all ones 445 * We disable translation and all interruptions here. This keeps is 454 * 2) find mapping full path - finds all possible list previous elements 469 * 2) find mapping full path - finds all possible list previous elements 488 * 2) find mapping full path - finds all possible list previous elements 502 * 14) repeat 11 - 13 for all page [all...] |
H A D | start.s | 18 * The Original Code and all software distributed under the License are 243 sync ; Make sure we see it all 430 bl EXT(cacheInit) ; Initializes all caches (including the TLB) 438 bl EXT(hw_clear_maps) ; Mark all maps as absent from hash table 879 andis. r0,r11,1 ; Have we done them all?
|
H A D | savearea_asm.s | 18 * The Original Code and all software distributed under the License are 579 eieio ; Make sure all is committed 728 * and turn all translation off. 808 * address. We assume that IR, DR, and EE are all off, that SF is on, and: 835 * process of restoring all context and it needs to keep it until the last second.) 879 * address. We assume that IR, DR, and EE are all off, and: 906 * process of restoring all context and it needs to keep it until the last second.) 955 * If the savearea being released is the last on a pool page (i.e., all entries 1052 ; r30 = what SACalloc looks like when all saveareas are free 1156 ; r30 = what SACalloc looks like when all savearea [all...] |
H A D | vmachmon_asm.s | 18 * The Original Code and all software distributed under the License are 72 .long EXT(vmm_tear_down_all) ; Tears down all VMMs 80 .long EXT(vmm_unmap_all_pages) ; Unmaps all pages from the VM space 141 .long EXT(vmm_purge_local) ; Purge all local guest mappings */ 180 ; all needed parameters and/or adds 32-/64-bit flavors to the needed functions. 415 rlwinm. r7,r6,0,vmmXStartb,vmmXStartb ; Clear all but start bit 453 ; First, we save the volatile registers we care about. Remember, all register 818 ; all non-volatile registers. 833 stmw r13,FM_ARG0(r1) ; Save all non-volatile registers 887 vfeNotRun: lmw r13,FM_ARG0(r1) ; Restore all no [all...] |
H A D | hw_lock.s | 18 * The Original Code and all software distributed under the License are 326 andc r12,r12,r4 ; Clear all bits in the bit mask 1169 EPILOG ; Restore all saved registers 1389 EPILOG ; Restore all saved registers 1410 EPILOG ; Restore all saved registers
|
H A D | ppc_disasm.i | 137 # gets invoked as a catch-all for the 011111 instructions below. But that
|
/macosx-10.5.8/xnu-1228.15.4/bsd/dev/dtrace/ |
H A D | dtrace_glue.c | 18 * The Original Code and all software distributed under the License are 129 * Because the proc_lock is not held at all times on all code 159 * Because the proc_lock is not held at all times on all code 256 int PRIV_POLICY_CHOICE(void* cred, int priv, int all) argument 258 #pragma unused(priv, all) 773 * We ignore the M_NOWAIT bit in kmflag (all of kmflag, in fact). 789 * We ignore the M_NOWAIT bit in kmflag (all of kmflag, in fact).
|
/macosx-10.5.8/xnu-1228.15.4/bsd/vfs/ |
H A D | vfs_bio.c | 18 * The Original Code and all software distributed under the License are 1035 * Flush out and invalidate all buffers associated with a vnode. 1050 * the lists may not be empty, but all that's left at this 2417 * with Atomic updates... all other counters 3757 * would not change the value. sysctl() can get all the values 3793 static void buqlimprt(int all); 3992 buqlimprt(int all) argument 3998 if (all)
|
/macosx-10.5.8/xnu-1228.15.4/bsd/netinet/ |
H A D | ip_dummynet.c | 18 * The Original Code and all software distributed under the License are 132 * ready_heap contains all dn_flow_queue related to fixed-rate pipes. 148 static struct dn_pipe *all_pipes = NULL ; /* list of all pipes */ 149 static struct dn_flow_set *all_flow_sets = NULL ;/* list of all flow_sets */ 451 * In all cases, we make sure that the data structures are consistent 697 * now compute V = max(V, min(S_i)). Remember that all elements in sch 779 /* make all time measurements in milliseconds (ms) - 1181 /* make all time measurements in milliseconds (ms) - 1319 * Note that for all flows in scheduler_heap (SCH), S_i <= V, 1320 * and for all flow 1384 purge_flow_set(struct dn_flow_set *fs, int all) argument [all...] |