Home
last modified time | relevance | path

Searched refs:order (Results 1 – 25 of 38) sorted by relevance

12

/xnu-11215/EXTERNAL_HEADERS/
H A Dstdatomic.h100 #define atomic_thread_fence(order) __c11_atomic_thread_fence(order) argument
101 #define atomic_signal_fence(order) __c11_atomic_signal_fence(order) argument
203 …efine atomic_flag_test_and_set_explicit(object, order) __c11_atomic_exchange(&(object)->_Value, 1,… argument
206 #define atomic_flag_clear_explicit(object, order) __c11_atomic_store(&(object)->_Value, 0, order) argument
/xnu-11215/tests/sched/
H A Dclutch_runqueue.c167 for (int order = 0; order < 2; order++) { variable
168 …enqueue_threads(2, (order == 0 ? lowpri_but_interactive : highpri), (order == 0 ? highpri : lowpri…
170 …score_max / 2) + 2, root_bucket_to_highest_pri[bucket], clutch_interactivity_score_max / 2, order);
204 for (int order = 0; order < 2; order++) { variable
205 enqueue_threads(2, (order == 0 ? lowpri : highpri), (order == 0 ? highpri : lowpri));
207 …ueue-order %d", root_bucket_to_highest_pri[bucket] - 1, root_bucket_to_highest_pri[bucket], order);
/xnu-11215/bsd/sys/
H A Dgmon.h150 uint16_t order; member
157 uint16_t order; member
/xnu-11215/osfmk/arm64/
H A Dtlb.h380 unsigned order = (unsigned)(sizeof(npages) * 8) - (unsigned)__builtin_clz(npages - 1) - 1; in generate_rtlbi_param() local
381 unsigned scale = ((order ? order : 1) - 1) / 5; in generate_rtlbi_param()
/xnu-11215/doc/lifecycle/
H A Dstartup.md13 A subsystem can use ranks to order the various initializers that make up its
17 The subsystem module will basically run hooks in that order:
22 // run in no particular order for a given rank in the given subsystem
32 1. add a new value to the `startup_subsystem_id_t` enum in the right order
/xnu-11215/doc/vm/
H A Dmemorystatus_kills.md31 …ss over its soft memory limit is eligible. Processes are killed in ascending jetsam priority order.
35 …ble to recycle any vnodes, we kill processes in ascending jetsam priority order to free up vnodes.…
39 …cal`. The `memorystatus_thread` will kill processes in ascending priority order until available pa…
94 …ssor.c`. The `memorystatus_thread` will kill in ascending jetsam priority order until the space sh…
101 … eligible processes (ones in app coalitions) in ascending jetsam priority order. If we're approach…
H A Dmemorystatus_notify.md94 need not be overly large; thus jetsam thresholds are generally on the order of
/xnu-11215/tools/lldbmacros/core/
H A Dstandard.py291 order = ((n//10) | 1).bit_length() // 10
292 return "{:.1f}{}".format(n / (1024 ** order), "BKMGTPE"[order])
/xnu-11215/doc/mach_ipc/
H A Dkmsg.md358 In order to reduce how appetizing this is, IPC kmsg inside of the kernel
359 use PAC in order to check the integrity of kernel messages.
371 In order to make descriptor pointers unattractive, XNU now signs these
421 In order to hide the PAC ABI that XNU uses, these 3 entry points are specialized
/xnu-11215/doc/scheduler/
H A Dsched_clutch_edge.md16 In order to reason about higher level user workloads, the clutch scheduler schedules groups of thre…
41 …order. Now, if a small burst of user-critical workload shows up, a high bucket has to wait for the…
53 …order) buckets that have warp remaining. If there is such a higher bucket, it would select that bu…
55 …eshare` buckets overlap, it is important to maintain some native priority order between those buck…
118 The scheduler maintains a root level priority for the hierarchy in order to make decisions regardin…
198 In order to choose a cluster & processor for a runnable thread, the edge scheduler uses the preferr…
244 The order of cluster iteration in the algorithm above specifically picks homogeneous clusters befor…
256 …tion via `sched_edge_processor_idle()`. This routine tries to do the following operations in order:
265 The policy of doing these operations in this specific order is chosen to ensure that threads are no…
273 …load balance cluster shared resource intensive threads across clusters in order to reduce contenti…
[all …]
/xnu-11215/libkern/zlib/
H A Dinfback.c284 static const unsigned short order[19] = /* permutation of code lengths */ in inflateBack() local
395 state->lens[order[state->have++]] = (unsigned short)BITS(3); in inflateBack()
399 state->lens[order[state->have++]] = 0; in inflateBack()
H A Dinflate.c597 static const unsigned short order[19] = /* permutation of code lengths */ in inflate() local
895 state->lens[order[state->have++]] = (unsigned short)BITS(3); in inflate()
899 state->lens[order[state->have++]] = 0; in inflate()
/xnu-11215/tests/ktrace/
H A Dkdebug_tests.c595 int order) in expect_dyld_image_info() argument
598 if (order == 0) { in expect_dyld_image_info()
614 } else if (order == 1) { in expect_dyld_image_info()
624 T_ASSERT_FAIL("unrecognized order of events %d", order); in expect_dyld_image_info()
627 if (order == 0) { in expect_dyld_image_info()
639 } else if (order == 1) { in expect_dyld_image_info()
653 } else if (order == 2) { in expect_dyld_image_info()
661 T_ASSERT_FAIL("unrecognized order of events %d", order); in expect_dyld_image_info()
/xnu-11215/bsd/netinet/
H A Dflow_divert.h104 int32_t order; member
H A Dflow_divert.c2140 } else if ((group->order < lower_order_group->order)) { in flow_divert_derive_kernel_control_unit()
2954 int32_t order = FLOW_DIVERT_ORDER_LAST; in flow_divert_handle_group_init() local
2999 …error = flow_divert_packet_get_tlv(packet, offset, FLOW_DIVERT_TLV_ORDER, sizeof(order), &order, N… in flow_divert_handle_group_init()
3001 FDLOG(LOG_INFO, &nil_pcb, "group %u order is %u", group->ctl_unit, order); in flow_divert_handle_group_init()
3002 group->order = order; in flow_divert_handle_group_init()
4468 new_group->order = FLOW_DIVERT_ORDER_LAST; in flow_divert_allocate_group()
/xnu-11215/doc/primitives/
H A Datomics.md138 (See *dependency* memory order later in this documentation).
285 Unlike the C11 variant, it lets the reader know in program order that this will
326 ### the *dependency* memory order
328 Because the C11 *consume* memory order is broken in various ways,
339 very much like the *consume* memory order is intended to provide.
H A Dstring-handling.md41 the argument order: just like for `strlcpy`, the indexable string goes first.
234 should prefer APIs in the following order:
/xnu-11215/osfmk/kern/
H A Dzalloc.c1759 order, with_extra, zba_head(order, with_extra)); in zba_head_corruption_panic()
1851 return (offs >> order) + (1 << (ZBA_MAX_ORDER - order + 1)) - 1; in zba_node()
1857 vm_offset_t offs = (node - (1 << (ZBA_MAX_ORDER - order + 1)) + 1) << order; in zba_chain_for_node()
1878 size_t node = zba_node(addr, order); in zba_free()
1890 order++; in zba_free()
1894 zba_push_block(zba_chain_for_node(zbah, node, order), order, with_extra); in zba_free()
1975 uint32_t cur = order; in zba_alloc()
1982 cur = order; in zba_alloc()
1989 while (cur > order) { in zba_alloc()
2190 while (i < 1u << order) { in zone_meta_bits_alloc_init()
[all …]
/xnu-11215/bsd/net/
H A Dnecp.c3030 necp_policy_order order = 0; in necp_handle_policy_add() local
3036 …get_tlv(tlv_buffer, tlv_buffer_length, offset, NECP_TLV_POLICY_ORDER, sizeof(order), &order, NULL); in necp_handle_policy_add()
3939 new_policy->order = order; in necp_policy_create()
3953 NECPLOG(LOG_DEBUG, "Created NECP policy, order %d", order); in necp_policy_create()
5008 new_kernel_policy->order = order; in necp_kernel_socket_policy_add()
5462 lower_policy->order >= upper_policy->result_parameter.skip_policy_order) { in necp_kernel_socket_policy_results_overlap()
6953 new_kernel_policy->order = order; in necp_kernel_ip_output_policy_add()
7333 current_session_last_non_skip_policy = inner_policy->order; in necp_kernel_ip_output_policies_reprocess()
7342 if (kernel_policy->order >= current_session_last_non_skip_policy) { in necp_kernel_ip_output_policies_reprocess()
10116 if (policy_search_array[i]->order < skip_order) { in necp_socket_find_policy_match_with_info_locked()
[all …]
H A Dnecp.h1077 u_int32_t order; // session order (read only via sysctl) member
1306 necp_policy_order order; member
1353 necp_policy_order order; member
1388 necp_policy_order order; member
/xnu-11215/makedefs/
H A DMakeInc.dir9 # to be a list of subdirectories in order for the build system to automatically
/xnu-11215/iokit/DriverKit/
H A DIODispatchQueue.iig68 * All blocks submitted to dispatch queues are dequeued in FIFO order.
78 … * FIFO order. The new object has retain count 1 and should be released by the caller.
/xnu-11215/doc/observability/
H A Dmt_stackshot.md43 In order to split up work between CPUs, each task is put into a workqueue for
87 task in order (to keep the output identical to singlethreaded stackshot), so we
/xnu-11215/iokit/Kernel/
H A DIOServicePM.cpp2221 IOPMPowerStateIndex order, powerState; in requestPowerDomainState() local
2299 for (order = 0; order < fNumberOfPowerStates; order++) { in requestPowerDomainState()
2300 powerState = fPowerStates[order].stateOrderToIndex; in requestPowerDomainState()
2306 if (order >= fNumberOfPowerStates) { in requestPowerDomainState()
7618 for (long order = fNumberOfPowerStates - 1; order >= 0; order--) { in getPowerStateForDomainFlags() local
7619 stateIndex = fPowerStates[order].stateOrderToIndex; in getPowerStateForDomainFlags()
/xnu-11215/doc/arm/
H A Dsme.md104 indirect reads from these bits will appear in program order relative to any
215 By extension, xnu will always issue this hint before entering WFI. In order to

12