Exclude architectures other than the one being built

Return iterator of nodes matching the device_type string 'device_type'

Given the bitmap index, byte index within the bitmap, and bit index within the byte, return the corresponding PhysAddr.

Mark the bits corresponding to the given physical range as allocated, regardless of the existing state.

Linearly iterate over the nodes in the order they occur in the flattened device tree

Recursively write out all the tables and all its children

Return the ranges values as u64 whether the size is 1 or 2 cells. Doesn't support > 2 cells.

Return recursive virtual addresses for the current kernel or user page tables. This depends on the recursive entry of root page tables to have been se

Round down by a power of 2

Round up by a power of 2

For the given arch, return a compatible toolchain triple that is installed and can be used by cargo check. It will prefer the default toolchain if it

Allocates the requested number of bytes with the given alignment. Returns `None` if the allocation cannot be satisfied, otherwise returns `Some` of a

Map a buffer to device memory TODO Maybe make this a macro and wrap the error reporting?

Allocates a block from the misc list. This is a simple first-fit allocator.

Attempts to allocate from an existing list: for requests that can be satisfied from one of the quick lists, try and do so; otherwise, attempt an alloc

Allocates an aligned block of size `size` from `tail`. If `tail` is not already aligned to the given alignment, then we try to free blocks larger than

Executes the `CLI` instruction that disables interrupt delivery on the current CPU, by clearing the "Interrupt Enable" bit (`IF`) in the `RFLAGS` regi

Try to convert the error into an ExceptionClass enum, or return the original number as the error.

Retrieves a copy of the `RFLAGS` registers.

Frees a block to the misc list. This looks up the given address in the hash of allocated misc blocks to find its header. If the block header is not

Frees a prefix that came from a tail allocation. This attempts to store blocks into the quick lists.

Free unused pages in mem that aren't covered by the memory map. Assumes that custom_map is sorted and that available_mem can be used to set the upper

Given a virtual address, return the physical address. Makes a massive assumption that the code is mapped offset to KZERO, so should be used with extr

Given an empty, statically allocated page table. We need to write a recursive entry in the last entry. To do this, we need to know the physical addr

The bitmap allocator has all pages marked as allocated initially. We'll add some pages (mark free) to allow us to set up the page tables and build a

Is bit `i` within the bitmap set?

Loads the "Global Table Descriptor Register" (`GDTR`) with the base address and inclusive limit of a "Global Descriptor Table" (GDT). # Safety The re

Loads the "Interrupt Descriptor Table Register" (`IDTR`) with the base address and inclusive limit of an "Interrupt Descriptor Table" (IDT). # Safety

Loads the "Task Register" (`TR`) with the given 16-bit selector index, which identifies a "Task State Selector" (that points to a "Task State Segment"

Map the physical range using the requested page size. This aligns on page size boundaries, and rounds the requested range so that both the alignment r

Ensure there's a mapping from va to entry, creating any intermediate page tables that don't already exist. If a mapping already exists, replace it. r

Ensure there's a mapping from va to entry, creating any intermediate page tables that don't already exist. If a mapping already exists, replace it. r