Searched refs:entries (Results 1 - 25 of 34) sorted by relevance

12

/darwin-on-arm/xnu/libkern/kxld/
H A Dkxld_array.c79 STAILQ_FOREACH(srcpool, &array->pools, entries) {
88 STAILQ_FOREACH_SAFE(srcpool, &array->pools, entries, tmp) {
89 STAILQ_REMOVE(&array->pools, srcpool, kxld_array_pool, entries);
90 STAILQ_INSERT_TAIL(&srcpools, srcpool, entries);
116 STAILQ_FOREACH_SAFE(srcpool, &srcpools, entries, tmp) {
120 STAILQ_REMOVE(&srcpools, srcpool, kxld_array_pool, entries);
159 STAILQ_INSERT_HEAD(&array->pools, pool, entries);
238 STAILQ_FOREACH(srcpool, &srcarray->pools, entries) {
257 STAILQ_FOREACH(pool, &array->pools, entries) {
273 STAILQ_FOREACH(pool, &array->pools, entries) {
[all...]
H A Dkxld_vtable.c162 * Initializes a vtable object by matching up relocation entries to the vtable's
163 * entries and finding the corresponding symbols.
201 /* Count the number of consecutive relocation entries to find the number of
202 * vtable entries. For some reason, the __TEXT,__const relocations are
222 rval = kxld_array_init(&vtable->entries, sizeof(KXLDVTableEntry), nentries);
227 for (i = 0; i < vtable->entries.nitems; ++i) {
229 entry = kxld_array_get_item(&vtable->entries, i);
250 * entries and performing reverse symbol lookups on those values.
272 /* Count the number of entries (the vtable is null-terminated) */
286 rval = kxld_array_init(&vtable->entries, sizeo
[all...]
H A Dkxld_array.h91 STAILQ_ENTRY(kxld_array_pool) entries; member in struct:kxld_array_pool
H A Dkxld_vtable.h56 KXLDArray entries; member in struct:kxld_vtable
/darwin-on-arm/xnu/bsd/sys/
H A Ddtrace_ptss.h52 * Each page in user space is represented by a dt_ptss_page. Page entries
66 * As each page is allocated, its entries are chained and added to the
84 struct dtrace_ptss_page_entry entries[DTRACE_PTSS_ENTRIES_PER_PAGE]; member in struct:dtrace_ptss_page
H A Dkern_memorystatus.h124 memorystatus_jetsam_snapshot_entry_t entries[1]; member in struct:jetsam_snapshot
/darwin-on-arm/xnu/bsd/dev/dtrace/
H A Ddtrace_ptss.c70 // CAS the entries onto the free list.
72 page->entries[DTRACE_PTSS_ENTRIES_PER_PAGE-1].next = p->p_dtrace_ptss_free_list;
73 } while (!OSCompareAndSwapPtr((void *)page->entries[DTRACE_PTSS_ENTRIES_PER_PAGE-1].next,
74 (void *)&page->entries[0],
147 * It returns a dtrace_ptss_page that has its entries chained, with the last
148 * entries next field set to NULL. It does not add the page or the entries to
190 // Chain the page entries.
193 ptss_page->entries[i].addr = addr + (i * DTRACE_PTSS_SCRATCH_SPACE_PER_THREAD);
194 ptss_page->entries[
[all...]
/darwin-on-arm/xnu/security/
H A Dmac_internal.h110 struct mac_policy_list_element *entries; member in struct:mac_policy_list
304 mpc = mac_policy_list.entries[i].mpc; \
315 mpc = mac_policy_list.entries[i].mpc; \
341 mpc = mac_policy_list.entries[i].mpc; \
352 mpc = mac_policy_list.entries[i].mpc; \
379 mpc = mac_policy_list.entries[i].mpc; \
390 mpc = mac_policy_list.entries[i].mpc; \
421 mpc = mac_policy_list.entries[i].mpc; \
430 mpc = mac_policy_list.entries[i].mpc; \
H A Dmac_audit.c248 mpc = mac_policy_list.entries[i].mpc;
260 mpc = mac_policy_list.entries[i].mpc;
293 mpc = mac_policy_list.entries[i].mpc;
305 mpc = mac_policy_list.entries[i].mpc;
H A Dmac_base.c494 mac_policy_list.entries = kalloc(sizeof(struct mac_policy_list_element) * MAC_POLICY_LIST_CHUNKSIZE);
495 bzero(mac_policy_list.entries, sizeof(struct mac_policy_list_element) * MAC_POLICY_LIST_CHUNKSIZE);
814 /* copy old entries into new list */
815 memcpy(tmac_policy_list_element, mac_policy_list.entries,
820 kfree(mac_policy_list.entries,
824 mac_policy_list.entries = tmac_policy_list_element;
833 if (mac_policy_list.entries[i].mpc == NULL)
836 if (strcmp(mac_policy_list.entries[i].mpc->mpc_name,
870 if (mac_policy_list.entries[i].mpc == NULL) {
891 mac_policy_list.entries[*handle
[all...]
/darwin-on-arm/xnu/bsd/vfs/
H A Dvfs_xattr.c1213 attribute header, attribute entries, and attribute data.
1261 * size supported (including the attribute entries). All of
1262 * the attribute entries must reside within this limit. If
1290 u_int16_t numEntries; /* number of entries which follow */
1291 apple_double_entry_t entries[2]; /* 'finfo' & 'rsrc' always exist */ member in struct:apple_double_header
1308 /* Header + entries must fit into 64K. Data may extend beyond 64K. */
1313 u_int32_t total_size; /* file offset of end of attribute header + entries + data */
1429 * - number of entries
1449 if (rawsize < offsetof(apple_double_header_t, entries))
1465 /* Calculate where the entries[] arra
[all...]
/darwin-on-arm/xnu/bsd/miscfs/devfs/
H A Ddevfsdefs.h102 int entries; member in struct:devfs_stats
229 OSAddAtomic(1, &devfs_stats.entries);
235 OSAddAtomic(-1, &devfs_stats.entries);
H A Ddevfs_vfsops.c294 + devfs_stats.entries * sizeof(devdirent_t)
317 + devfs_stats.entries * sizeof(devdirent_t)
/darwin-on-arm/xnu/osfmk/kern/
H A Dprocessor_data.h81 ipc_kmsg_t entries[IKM_STASH]; member in struct:processor_data::ikm_cache
H A Dhost_notify.c54 queue_chain_t entries; member in struct:host_notify_entry
/darwin-on-arm/xnu/bsd/net/
H A Dpf_ioctl.c511 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next;
724 rule = TAILQ_NEXT(rule, entries);
738 TAILQ_REMOVE(poola, mv_pool_pa, entries);
739 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
752 TAILQ_REMOVE(poola, empty_pool_pa, entries);
772 TAILQ_REMOVE(rulequeue, rule, entries);
773 rule->entries.tqe_prev = NULL;
778 rule->entries.tqe_prev != NULL)
811 TAILQ_FOREACH(tag, head, entries)
[all...]
H A Dpf.c1929 head[i] = TAILQ_NEXT(head[i], entries); \
2005 cur = TAILQ_NEXT(cur, entries);
2808 *r = TAILQ_NEXT(*r, entries);
2864 *r = TAILQ_NEXT(f->r, entries);
3119 if ((rpool->cur = TAILQ_NEXT(rpool->cur, entries)) == NULL)
3382 r = TAILQ_NEXT(r, entries);
3385 r = TAILQ_NEXT(r, entries);
3389 r = TAILQ_NEXT(r, entries);
3399 r = TAILQ_NEXT(r, entries);
3404 r = TAILQ_NEXT(r, entries);
[all...]
/darwin-on-arm/xnu/bsd/netinet/
H A Dtcp_timer.h192 struct timerlisthead lhead; /* head of the list of timer entries */
201 uint32_t entries; /* Number of entries on the list */ member in struct:tcptimerlist
202 uint32_t maxentries; /* Max number of entries at any time */
H A Dtcp_timer.c925 listp->entries--;
1146 listp->entries--;
1273 listp->entries++;
1274 if (listp->entries > listp->maxentries)
1275 listp->maxentries = listp->entries;
/darwin-on-arm/xnu/bsd/hfs/
H A Dhfs_catalog.h104 u_int32_t cau_entries; /* total directory entries (valence) */
193 * (which works out to be 60 entries per call). The 8K limit
206 u_int32_t maxentries; /* number of entries requested */
207 u_int32_t realentries; /* number of valid entries returned */
208 u_int32_t skipentries; /* number of entries skipped (reserved HFS+ files) */
209 struct cat_entry entry[1]; /* array of entries */
212 #define CE_LIST_SIZE(entries) \
213 sizeof (*ce_list) + (((entries) - 1) * sizeof (struct cat_entry))
H A Dhfs_attrlist.c78 * It does not do . and .. entries. The problem is if you are at the root of the
82 * simpler, this call will only return entries in its directory, hfs like.
198 * Obtain a list of catalog entries and pack their attributes until
199 * the output buffer is full or maxcount entries have been packed.
249 /* Process the catalog entries. */
307 /* Pack catalog entries into attribute buffer. */
350 /* If we skipped catalog entries for reserved files that should
358 /* If there are more entries then save the last name. */
378 /* No more entries. */
399 /* Drop directory hint on error or if there are no more entries */
785 u_int32_t entries; local
[all...]
H A Dhfs_hotfiles.c104 hotfile_entry_t entries[1]; member in struct:hotfile_data
277 hotdata->entries[i-1].right = &hotdata->entries[i];
279 hotdata->freelist = &hotdata->entries[0];
761 * there can be two entries for the same file id.
1123 * Skip invalid entries (already in hot area).
1786 hfc_btree_create(struct hfsmount *hfsmp, unsigned int nodesize, unsigned int entries) argument
1874 nodecnt = 2 + howmany(entries * 2, entirespernode);
2242 printf("hfs: hf_getsortedlist returned %d entries\n", i);
/darwin-on-arm/xnu/bsd/kern/
H A Dkern_authorization.c644 KAUTH_DEBUG(" ACL - %d entries, initial residual %x", eval->ae_count, eval->ae_residual);
648 * Skip inherit-only entries.
786 int entries, error, index; local
796 * ACL and any inherited ACE entries from the container object.
821 * there are potentially inheritable ACE entries, but
835 * Compute the number of entries in the result ACL by scanning the
838 entries = 0;
842 entries++;
856 entries += initial->acl_entrycount;
862 * If there is no initial ACL, and no inheritable entries, th
[all...]
/darwin-on-arm/xnu/osfmk/i386/
H A Di386_init.c207 pt_entry_t entries[PTE_PER_PAGE]; member in struct:__anon931
227 physmapL2[i].entries[j] =
293 // IdlePDPT entries
342 // IdlePDPT entries
/darwin-on-arm/xnu/iokit/Kernel/
H A DIOService.cpp4785 // don't call family if we've done all the entries in the table
5185 CpuDelayEntry *entries = (CpuDelayEntry *) sCpuDelayData->getBytesNoCopy(); local
5193 IOService *thisService = entries[i].fService;
5194 bool sameType = (delayType == entries[i].fDelayType);
5202 const UInt32 thisMax = entries[i].fMaxDelay;
5215 entries[replace] = ne;
5222 IOService *thisService = entries[i].fService;
5223 if (thisService && (delayType == entries[i].fDelayType)) {
5224 UInt32 thisMax = entries[i].fMaxDelay;
5236 entries[replac
5302 CpuDelayEntry *entries = (CpuDelayEntry *) sCpuDelayData->getBytesNoCopy(); local
[all...]

Completed in 228 milliseconds

12