Lines Matching +full:no +full:- +full:legacy +full:- +full:irq

8 "symmetric" in the sense that no specific CPU is treated specially by
12 No special application code needs to be written to take advantage of
26 non-Zephyr code).
54 on top of the pre-existing :c:struct:`atomic_` layer (itself usually
58 One important difference between IRQ locks and spinlocks is that the
65 re-acquire it or it will deadlock (it is perfectly legal to nest
71 recursive semantics above, spinlocks in single-CPU contexts produce
72 identical code to legacy IRQ locks.  In fact the entirety of the
75 Legacy irq_lock() emulation
80 SMP systems with identical semantics to their legacy versions.  They
85 and that it is re-acquired when necessary to restore the lock state
93 IRQ lock is global, means that code expecting to be run in an SMP
109 :c:func:`k_thread_cpu_mask_enable` will re-enable execution.  There are also
113 suspended, otherwise an ``-EINVAL`` will be returned.
116 involved in doing the per-CPU mask test requires that the list be
117 traversed in full.  The kernel does not keep a per-CPU run queue.
146 many architectures the timer is a per-CPU device and needs to be
157    :figclass: align-center
170 until the thread that had been aborted is no longer runnable.  If it
175 that system idle be implemented using a low-power mode with as many
178 thread becomes runnable, the idle CPU has no way to "wake up" to
179 handle the newly-runnable load.
191 APIs will evolve over time to encompass more functionality (e.g. cross-CPU
192 calls), and that the scheduler-specific calls here will be implemented in
204 "DEAD" or for it to re-enter the queue (in which case we terminate it
206 "aborted" check happens on any interrupt exit, so there is no special
242     may be more than one valid set--one of which may be optimal.
244     To better illustrate the distinction, consider a 2-CPU system with ready
258 There are three types of costs/penalties associated with the IPI cascades--and
270 In general, Zephyr kernel code is SMP-agnostic and, like application
275 Per-CPU data
281 running concurrently.  Likewise a kernel-provided interrupt stack
287 Compatibility fields are provided for legacy uniprocessor code trying
294 implemented using a CPU-provided register or addressing mode that can
296 make it available to any kernel-mode code.
306 Switch-based context switching
310 Unfortunately, this function takes no argument specifying a thread to
321 with the swap call, and as we don't want per-architecture assembly
323 somewhat lower-level context switch primitives for SMP systems:
333 Similarly, on interrupt exit, switch-based architectures are expected
342 the caller-saved registers on the current thread's stack when interrupted
343 in order to minimize interrupt latency, and preserve the callee-saved
358 true.  A uniprocessor architecture built with :kconfig:option:`CONFIG_SMP` set to No might