Searched refs:entry (Results 101 - 122 of 122) sorted by relevance

12345

/macosx-10.5.8/xnu-1228.15.4/iokit/IOKit/
H A DIORegistryEntry.h50 typedef void (*IORegistryEntryApplierFunction)(IORegistryEntry * entry,
88 @abstract Synchronized method to obtain a property from a registry entry or one of its parents (or children) in the hierarchy. Available in Mac OS X 10.1 or later.
89 @discussion This method will search for a property, starting first with this registry entry's property table, then iterating recusively through either the parent registry entries or the child registry entries of this entry. Once the first occurrence is found, it will lookup and return the value of the property, using the OSDictionary::getObject semantics. The iteration keeps track of entries that have been recursed into previously to avoid loops. This method is synchronized with other IORegistryEntry accesses to the property table(s).
92 @param options kIORegistryIterateRecursively may be set to recurse automatically into the registry hierarchy. Without this option, this method degenerates into the standard getProperty() call. kIORegistryIterateParents may be set to iterate the parents of the entry, in place of the children.
103 @abstract Synchronized method to obtain a property from a registry entry or one of its parents (or children) in the hierarchy. Available in Mac OS X 10.1 or later.
104 @discussion This method will search for a property, starting first with this registry entry's property table, then iterating recusively through either the parent registry entries or the child registry entries of this entry. Once the first occurrence is found, it will lookup and return the value of the property, using the OSDictionary::getObject semantics. The iteration keeps track of entries that have been recursed into previously to avoid loops. This method is synchronized with other IORegistryEntry accesses to the property table(s).
107 @param options kIORegistryIterateRecursively may be set to recurse automatically into the registry hierarchy. Without this option, this method degenerates into the standard getProperty() call. kIORegistryIterateParents may be set to iterate the parents of the entry, in place of the children.
118 @abstract Synchronized method to obtain a property from a registry entry o
[all...]
/macosx-10.5.8/xnu-1228.15.4/osfmk/ppc/
H A Dmappings.c347 physent = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
373 mflags = mflags | (pindex << 16); /* Stick in the physical entry table index */
452 curpmap = pmap; /* Remember entry */
527 * This routine takes a physical entry and runs through all mappings attached to it and changes
542 physent = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
557 * This routine takes a physical entry and runs through all mappings attached to it and turns
566 physent = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
580 * This routine takes a physical entry and runs through all mappings attached to it and turns
589 physent = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
603 * This routine takes a physical entry an
1783 struct phys_entry * entry; local
[all...]
H A Dpmap.c187 unsigned int entry; local
193 entry = (unsigned int)pmap_mem_regions[i].mrPhysTab + ((pa - pmap_mem_regions[i].mrStart) * sizeof(phys_entry_t));
194 return (struct phys_entry *)entry;
850 pp = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
967 pp = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
1021 pp = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
1425 * a fault; therefore, its page table entry
1541 physent = mapping_phys_lookup(pa, &pindex); /* Get physical entry */
1544 return 0; /* If there is no physical entry or marked guarded,
1545 the entry i
[all...]
H A Dhw_exception.s32 /* Low level routines dealing with exception entry and exit.
35 * Interrupt, trap, system call and debugger entry. Each has it's own
131 lwz r31,savesrr1+4(r4) ; Pick up the entry MSR
301 * this is an error - jump to the debugger entry
551 add r31,r27,r28 ; Point right to the syscall table entry
609 add r27,r27,r3 ; for a total of 20x (5 words/entry)
616 add r31,r27,r28 ; Point right to the syscall table entry
729 add r27,r27,r4 ; for a total of 20x (5 words/entry)
731 add r28,r27,r28 ; Point right to the syscall table entry
1797 addi r29,r29,vmmCEntrySize ; (TEST/DEBUG) Get the next entry
[all...]
H A Dmachine_routines_asm.s347 mtmsrd r12 ; Restore entry MSR
671 mtmsr r10 ; Restore entry MSR (sans FP and VEC)
685 rdwrpcok: mtmsrd r10 ; Restore entry MSR (sans FP and VEC)
1252 cipurgeTLB: tlbie r6 ; Purge this entry
1630 cinoexit: mtspr hid0,r9 ; Turn off the invalidate (needed for some older machines) and restore entry conditions
1632 mtmsr r7 ; Restore MSR to entry
1763 mtspr hid0,r9 ; Restore entry hid0
1773 mtspr hid1,r12 ; Restore entry hid1
1778 mtspr hid4,r4 ; Restore entry hid4
1782 mtmsr r7 ; Restore MSR to entry
[all...]
H A Dstart.s228 cmplwi cr1,r16,PATCH_FEATURE ; Is it a patch feature entry
234 cmplwi cr1,r16,PATCH_PROCESSOR ; Is it a patch processor entry
248 addi r11,r11,peSize ; Point to the next patch entry
822 stw r0,lgpPcfg+(pcfSize*pcfLargePcfg)(0) ; Set the 16M primary large page configuration entry
H A Dstatus.c1402 thread_setentrypoint(thread_t thread, uint64_t entry) argument
1408 sv->save_srr0 = entry;
1440 * If a valid entry point is specified, use it.
1460 * If a valid entry point is specified, use it.
H A Dvmachmon_asm.s161 bge- cr1,vmmBogus ; It is a bogus entry
162 add r12,r10,r11 ; Get the vmm dispatch syscall entry
345 * The vmm_execute_vm entry point is for the fused vmm_map_execute and vmm_protect_execute
378 add r2,r2,r28 ; Point to the entry
384 lwz r4,vmmFlags(r2) ; Get the flags for the selected entry
459 mr r27,r2 ; Save the context entry
799 mr r27,r2 ; Save the context entry
865 mr r27,r2 ; Save the context entry
H A Dhw_lock.s206 mftb r8 ; Get timestamp on entry
210 mftb r8 ; Get timestamp on entry
1055 mftb r8 ; Get timestamp on entry
1059 mftb r8 ; Get timestamp on entry
1802 mftb r8 ; Get timestamp on entry
1806 mftb r8 ; Get timestamp on entry
H A Dcswtch.s168 sc ; Cut trace entry of context switch
557 mr r25,r4 ; Save the entry savearea
1298 mr r25,r4 ; Save the entry savearea
2209 vr_ld2: ; initial entry pt
H A Dskiplists.s992 lwz r0,4(r27) ; Get the explicit entry flag
1275 lwz r0,4(r31) ; Get the explicit entry flag
H A DEmulate.s55 ; a fault does occur, the exception that caused entry to the emulation
H A DFirmware.s2474 ; On entry R3 points to savearea.
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/
H A Dhfs_catalog.c83 /* Map file mode type to directory entry types */
2378 cep = &list->entry[list->realentries++];
2476 * If the last entry wasn't cached then position the btree iterator
2481 * (i.e. just before the first entry)
2491 * Iterate until we reach the entry just
2540 cep = &ce_list->entry[i];
2561 /* Repack entry from inode record. */
2604 * uses the next file id as the seek offset of each entry.
2625 struct direntry * entry = NULL; local
2663 entry
[all...]
/macosx-10.5.8/xnu-1228.15.4/osfmk/kern/
H A Dthread.h660 mach_vm_offset_t entry);
/macosx-10.5.8/xnu-1228.15.4/bsd/net/
H A Ddlil.c646 interface_filter_t entry = NULL; local
662 TAILQ_FOREACH(entry, &ifp->if_flt_head, filt_next) {
663 if (entry == filter)
666 if (entry == filter)
671 if (entry != filter) {
2866 * and PF_VLAN, where each bucket contains exactly one entry;
H A Droute.c119 #define RTD_INUSE 0xFEEDFACE /* entry is in use */
120 #define RTD_FREED 0xDEADBEEF /* entry is freed */
350 * for looking up an exact match for a scoped route entry.
492 * callee adds a reference to entry and checks for root node as well
559 struct rtentry * entry; local
562 entry = rtalloc1_locked(dst, report, ignflags);
564 return (entry);
601 * to decide if the routing table entry should be purged immediately
604 * flag on the entry so that the code below reclaims the storage.
796 * Force a routing table entry t
[all...]
/macosx-10.5.8/xnu-1228.15.4/iokit/Kernel/
H A DIOPMrootDomain.cpp1279 // We iterate 'features' dictionary looking for an entry tagged
2962 IORegistryEntry * entry; local
3019 while ((entry = iter->getNextObject()))
3021 node = OSDynamicCast(IOService, entry);
H A DIOServicePM.cpp719 IORegistryEntry * entry; local
724 if ((entry = OSDynamicCast(IORegistryEntry, next)) &&
725 isChild(entry, gIOPowerPlane))
H A DIOMemoryDescriptor.cpp726 _memEntry = initData->fMemEntry; // Grab the new named entry
2361 // set memory entry cache
2431 IOMemoryDescriptorMapMemEntry(vm_map_t map, ipc_port_t entry, IOOptionBits options, bool pageable,
2438 ref.sharedMem = entry;
/macosx-10.5.8/xnu-1228.15.4/osfmk/vm/
H A Dvm_map.h121 * vm_map_entry_t an entry in an address map.
192 * stored in the address map entry.
195 struct vm_map_entry *prev; /* previous entry */
196 struct vm_map_entry *next; /* next entry */
267 struct vm_map_header hdr; /* Map entry header */
341 * entry onto which the other entries that represent
380 * Useful macros for entry list copy objects
422 * return the entry allocated for that range. */
431 /* Lookup map entry containing or the specified address in the given map */
435 vm_map_entry_t *entry); /* OU
[all...]
/macosx-10.5.8/xnu-1228.15.4/osfmk/i386/
H A Dpmap.c251 * valid virtual mappings of that page. An entry is
282 block if it needed an entry and none were available - we'd panic. Some time ago I
304 and one or all terminate. The list hanging off each pv array entry could have thousands of
318 pages in the system are not aliased and hence represented by a single pv entry I've kept
319 the rooted entry size as small as possible because there is one of these dedicated for
321 link and the ppn entry needed for matching while running the hash list to find the entry we
343 The main flow difference is that the code is now aware of the rooted entry and the hashed
344 entries. Code that runs the pv list still starts with the rooted entry and then continues
345 down the qlink onto the hashed entries. Code that is looking up a specific pv entry firs
4178 vm_map_entry_t entry; local
[all...]

Completed in 303 milliseconds

12345