Searched refs:skip (Results 1 - 25 of 33) sorted by relevance

12

/xnu-2422.115.4/osfmk/mach/
H A Dnotify.defs76 skip;
95 skip;
98 skip; /* was NOTIFY_OWNERSHIP_RIGHTS: 0103 */
100 skip; /* was NOTIFY_RECEIVE_RIGHTS: 0104 */
H A Dmach_host.defs192 skip; /* was host_ipc_hash_info */
193 skip; /* was enable_bluebox */
194 skip; /* was disable_bluebox */
275 skip;
H A Dvm_map.defs110 skip;
126 skip;
147 skip;
391 skip; /* was vm_region_object_create */
480 skip; /* was vm_map_get_upl */
481 skip; /* was vm_upl_map */
482 skip; /* was vm_upl_unmap */
H A Dvm32_map.defs217 skip; /* was vm_region_object_create */
272 skip; /* was vm_map_get_upl */
273 skip; /* was vm_upl_map */
274 skip; /* was vm_upl_unmap */
H A Dthread_act.defs284 skip;
295 skip;
H A Dmach_vm.defs102 skip;
128 skip;
160 skip;
492 skip;
H A Dhost_priv.defs268 skip; /* old host_load_symbol_table */
H A Dtask.defs295 skip;
/xnu-2422.115.4/bsd/dev/dtrace/
H A Dblist.c45 * a very simple 'skip' calculation. In order to support large radixes,
134 daddr_t count, daddr_t radix, int skip);
137 daddr_t radix, int skip, daddr_t blk);
139 daddr_t skip, blist_t dest, daddr_t count);
141 int skip, daddr_t count);
144 daddr_t radix, int skip, int tab);
168 int skip = 0; local
171 * Calculate radix and skip field used for scanning.
177 skip = (skip
395 blst_meta_alloc(blmeta_t *scan, daddr_t blk, daddr_t count, daddr_t radix, int skip) argument
518 blst_meta_free(blmeta_t *scan, daddr_t freeBlk, daddr_t count, daddr_t radix, int skip, daddr_t blk) argument
606 blst_copy(blmeta_t *scan, daddr_t blk, daddr_t radix, daddr_t skip, blist_t dest, daddr_t count) argument
703 blst_radix_init(blmeta_t *scan, daddr_t radix, int skip, daddr_t count) argument
775 blst_radix_print(blmeta_t *scan, daddr_t blk, daddr_t radix, int skip, int tab) argument
[all...]
/xnu-2422.115.4/osfmk/device/
H A Ddevice.defs222 skip;
262 skip;
263 skip;
306 skip;
307 skip;
308 skip;
309 skip;
362 skip;
457 skip;
458 skip;
[all...]
/xnu-2422.115.4/libsyscall/xcodescripts/
H A Dcreate-syscalls.pl172 my $skip = 0;
176 $skip = 0;
180 $skip = -$skip;
185 $skip = ($1 eq 'COMPAT_GETFSSTAT') ? -1 : 1;
188 next if $skip < 0;
/xnu-2422.115.4/bsd/net/
H A Dradix.c110 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip,
241 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip, argument
252 cplim = cp + length; cp3 += skip; cp2 += skip;
253 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
483 rn_addmask(void *n_arg, int search, int skip) argument
495 if (skip == 0)
496 skip = 1;
497 if (mlen <= skip)
499 if (skip >
[all...]
H A Dpf_norm.c1554 r = r->skip[PF_SKIP_IFP].ptr;
1556 r = r->skip[PF_SKIP_DIR].ptr;
1558 r = r->skip[PF_SKIP_AF].ptr;
1560 r = r->skip[PF_SKIP_PROTO].ptr;
1564 r = r->skip[PF_SKIP_SRC_ADDR].ptr;
1568 r = r->skip[PF_SKIP_DST_ADDR].ptr;
1831 r = r->skip[PF_SKIP_IFP].ptr;
1833 r = r->skip[PF_SKIP_DIR].ptr;
1835 r = r->skip[PF_SKIP_AF].ptr;
1838 r = r->skip[PF_SKIP_PROT
[all...]
H A Droute.c653 sa_trim(struct sockaddr *sa, int skip) argument
655 caddr_t cp, base = (caddr_t)sa + skip;
657 if (sa->sa_len <= skip)
660 for (cp = base + (sa->sa_len - skip); cp > base && cp[-1] == 0; )
663 sa->sa_len = (cp - base) + skip;
664 if (sa->sa_len < skip) {
666 panic("%s: broken logic (sa_len %d < skip %d )", __func__,
667 sa->sa_len, skip);
669 } else if (sa->sa_len == skip) {
717 int skip, a local
[all...]
H A Dpf.c1948 head[i]->skip[i].ptr = cur; \
3413 r = r->skip[PF_SKIP_IFP].ptr;
3415 r = r->skip[PF_SKIP_DIR].ptr;
3417 r = r->skip[PF_SKIP_AF].ptr;
3419 r = r->skip[PF_SKIP_PROTO].ptr;
3431 r = r->skip[src == &r->src ? PF_SKIP_SRC_PORT :
3435 r = r->skip[PF_SKIP_DST_ADDR].ptr;
3441 r = r->skip[PF_SKIP_DST_PORT].ptr;
4349 r = r->skip[PF_SKIP_IFP].ptr;
4351 r = r->skip[PF_SKIP_DI
[all...]
/xnu-2422.115.4/bsd/kern/
H A Dsubr_log.c516 int error = 0, newl, skip; local
538 for (i = newl = skip = 0; p != msgbufp->msg_bufc + msgbufp->msg_bufx - 1; ++p) {
543 if (skip) {
545 newl = skip = 0;
549 skip = 1;
H A Dproc_info.c215 int n, skip; local
252 skip = 0;
256 skip = 1;
260 skip = 1;
264 skip = 0;
272 skip = 1;
276 skip = 1;
285 skip = 1;
290 skip = 1;
299 skip
[all...]
H A Dkern_memorystatus.c1849 boolean_t skip; local
1852 skip = FALSE;
1854 skip = TRUE;
1857 if (skip) {
1969 boolean_t skip; local
1980 /* skip if no limit set */
1985 /* skip if a currently inapplicable limit is encountered */
1991 skip = (((int32_t)footprint) <= p->p_memstat_memlimit);
1993 if (!skip && (memorystatus_jetsam_policy & kPolicyDiagnoseActive)) {
2001 if (!skip) {
[all...]
/xnu-2422.115.4/osfmk/UserNotification/
H A DUNDRequest.defs77 skip; /* was UNDDisplayCustomFromDictionary_rpc */
/xnu-2422.115.4/osfmk/default_pager/
H A Ddefault_pager_object.defs101 skip; /* default_pager_paging_file */
/xnu-2422.115.4/bsd/netinet6/
H A Desp_core.c635 /* skip bodyoff */
648 /* skip over empty mbuf */
868 /* skip bodyoff */
881 /* skip over empty mbuf */
993 esp_auth(m0, skip, length, sav, sum)
995 size_t skip; /* offset to ESP header */
1009 if (m0->m_pkthdr.len < skip) {
1010 ipseclog((LOG_DEBUG, "esp_auth: mbuf length < skip\n"));
1013 if (m0->m_pkthdr.len < skip + length) {
1015 "esp_auth: mbuf length < skip
[all...]
H A Dah_core.c1306 int i, l, skip; local
1352 skip = 1;
1357 skip = 0;
1367 skip = 0;
1373 skip = 1;
1386 if (skip)
/xnu-2422.115.4/bsd/vfs/
H A Dvfs_quota.c792 int i, skip, last; local
807 skip = dqhash2(id, mask);
809 for (last = (i + (qfp->qf_maxentries-1) * skip) & mask;
811 i = (i + skip) & mask) {
/xnu-2422.115.4/bsd/nfs/
H A Dnfs_node.c146 int skip = 0; local
164 skip = 1;
168 skip = 1;
171 if (!skip && NFS_BITMAP_ISSET(nmp->nm_fsattr.nfsa_bitmap, NFS_FATTR_CASE_INSENSITIVE))
/xnu-2422.115.4/iokit/Kernel/
H A DIODeviceTreeSupport.cpp657 UInt32 skip = 1; local
685 skip = IODTMapOneInterrupt( regEntry, localBits, index, &map, &controller );
686 if( 0 == skip) {
699 localBits += skip;
882 // Look for existence of a debug property to skip
1060 // if start of cell < start of range, or end of range >= start of cell, skip

Completed in 196 milliseconds

12