aboutsummaryrefslogtreecommitdiff
AgeCommit message (Collapse)AuthorFilesLines
9 dayskstd: ring_buffer: implement dtorFelix Morgner2-0/+56
9 dayskstd: ring_buffer: move construction testsFelix Morgner1-32/+32
9 dayskstd: ring_buffer: add missing [c]rend() testsFelix Morgner1-0/+15
9 dayskstd: ring_buffer: implement [cr][begin|end]()Felix Morgner2-0/+180
9 dayskstd: ring_buffer: fix empty() and size()Felix Morgner2-11/+26
9 dayskstd: ring_buffer: add more range-based testsFelix Morgner1-0/+50
10 dayskstd: ring_buffer: implement [c]end()Felix Morgner2-1/+134
10 dayskstd: ring_buffer: implement [c]begin()Felix Morgner2-1/+140
10 dayskstd: ring_buffer: implement iterator typeFelix Morgner2-0/+165
10 dayskstd: ring_buffer: add n-value-initialized ctorFelix Morgner2-0/+52
10 dayskstd: ring_buffer: add write-through testsFelix Morgner1-0/+32
10 dayskstd: ring_buffer: fix const-overload testsFelix Morgner1-3/+3
10 dayskstd: ring_buffer: add ctor panic testFelix Morgner1-0/+10
10 dayskstd: ring_buffer: extract basic storageFelix Morgner2-23/+127
11 dayskstd: ring_buffer: add missing test tagFelix Morgner1-1/+1
11 dayskstd: ring_buffer: add interface type testsFelix Morgner1-0/+82
11 dayskstd: ring_buffer: implement operator[]Felix Morgner2-5/+45
11 dayskstd: ring_buffer: simplify element_atFelix Morgner1-3/+3
11 dayskstd: ring_buffer: rename element_at_indexFelix Morgner1-4/+4
11 dayskstd: ring_buffer: implement n-values ctor.Felix Morgner2-1/+99
11 dayskstd: ring_buffer: add missing documentationFelix Morgner1-4/+13
11 dayskstd: ring_buffer: rename head and tailFelix Morgner1-9/+9
11 dayskstd: ring_buffer: implement at()Felix Morgner2-0/+84
11 dayskstd: ring_buffer: implement size()Felix Morgner2-0/+18
11 dayskstd: ring_buffer: implement empty()Felix Morgner2-0/+18
11 dayskstd: ring_buffer: add do sectionsFelix Morgner1-0/+5
11 dayskstd: ring_buffer: implement max_size()Felix Morgner2-0/+16
11 dayskstd: ring_buffer: implement capacity()Felix Morgner2-4/+16
11 dayskstd: add ring_buffer includeFelix Morgner2-0/+37
11 dayschore: clean up python scriptsFelix Morgner21-57/+113
11 dayschore: update python dependenciesFelix Morgner1-182/+182
11 dayside: fix poetry dependenciesFelix Morgner2-387/+24
11 daysMerge branch 'fmorgner/implement-interrupt-locking' into 'develop'Felix Morgner14-25/+602
kapi/interrupts: implement irq_lock See merge request teachos/kernel!61
12 daysx86_64: fix flag readingFelix Morgner4-6/+92
12 dayside: enable <...> include checksFelix Morgner1-0/+2
12 dayskapi/interrupts: add testsFelix Morgner2-0/+254
12 dayskapi/interrupts: admit irq_lock dtor may panicFelix Morgner1-1/+8
12 dayskapi/interrupts: improve irq_lock protectionsFelix Morgner1-5/+53
The previous implementation suffered from four problems: 1. try_lock in the basic irq_lock always succeeded. 2. lock in the basic irq_lock always succeeded. 3. try_lock in the wrapper irq_lock did not use the base try_lock. 4. a foreign CPU could wrongly unlock a remote irq_lock. These issues are mitigated in this patch.
12 dayskapi/interrupts: tests: fix state data raceFelix Morgner1-14/+3
12 dayskapi/interrupts: tests: make IRQ state thread specificFelix Morgner1-3/+12
12 dayskapi/interrupts: implement IRQ lockFelix Morgner2-0/+110
12 dayskstd/mutex: export lockable conceptsFelix Morgner1-0/+9
12 dayskstd/concepts: add lockable conceptFelix Morgner1-0/+15
12 dayskstd/concepts: document basic_lockableFelix Morgner1-0/+12
12 dayskapi/interrupt: rework enablement APIFelix Morgner5-25/+61
2026-09-17build/x86_64: add missing -ffreestanding flagFelix Morgner1-0/+1
Enable the '-ffreestanding' flag in the x86_64 toolchain file to inform the compiler about the fact that it cannot rely on the presence of a standard library implementation, thereby suppressing some optimizations designed for regular user applications. GCC supports a number of clever optimizations, some of which rely on the presence of a standard library. One of them is "-ftree-loop-distribute-patterns". This optimization performs detection of certain loop patterns, replacing them with library calls when applicable. This is problematic for cases in which we implement the standard library functionality. Consider, a schematic, `memset``: ```c++ void memset(void * d, int v, size_t n) { for(auto i = 0uz; i < n: ++i) { d[i] = static_cast<std::byte>(v); } } ``` GCC recognizes this loop, and similar versions of it, as an implementation of `memset`. In a hosted implementation, this is an important optimization, since a standard library may be able to provide a specifically optimized version of `memset``. So the compiler replaces this `memset` loop with a call to `memset`, since it is not aware of the fact we are currently implementing `memset`. Interestingly, tail recursion optimization eliminates the call, transforming it into a jump to the start of `memset`. This leads to execution getting stuck inside `memset` with no way of exiting and no stack usage increase, thus causing an infinite lockup. While we could suppress the specific optimization, it is more effective to tell the compiler "why" it can emit a call to memset in those cases.
2026-09-14ide: silence LTRANS job server warningFelix Morgner1-0/+1
2026-09-10kstd: fix doc commentFelix Morgner1-1/+1
2026-09-10kapi/system: reduce panic buffer sizeFelix Morgner2-29/+163
Previously, we allocated a 512-byte buffer for every call of the formatted panic function. This was heavily increasing the stack size for a number of functions. We now don't print to a statically allocated buffer, but rather use the iterator-based formatting facility and a proxy iterator with a small, self-flushing buffer. This reduces that static overhead of the formatted panic function to by almost 500 bytes, while increasing possible message fidelity, since we are not longer arbitrarily limited by the buffer.
2026-09-10kernel: replace some more plain pointersFelix Morgner14-39/+45
generated by cgit v1.2.3 (git 2.25.1) at 2026-10-11 04:47:30 +0000