bend-osdev-acpi

Search uses release 0.1.2.0 · 1,733 definitions

Releases (3)

def AmlValue.comparethe comparison of a with b, b converted to a's type
def val.lz.z
def val.lzleading zeros dropped (one kept); z: the head is a zero with more after it
def val.lower.pick
def val.lower
def AmlValue.show_int
def val.sep
def val.ref.show
def val.show.list
def AmlValue.show

def ck.sum.gothe sum of the bytes, modulo 2^32 (tail-recursive)
def AcpiChecksum.sumthe sum of the bytes, modulo 256
def AcpiChecksum.okthe bytes sum to zero modulo 256
def AcpiChecksum.byte_forthe byte that, put at offset i of o (whose byte there is ignored), makes o sum to zero modulo 256
def ck.fix.pick
def AcpiChecksum.fixo with its byte at offset i replaced by the checksum byte (o unchanged if it has no byte i)

type AcpiAml
def AcpiAml.header
def AcpiAml.aml
def AcpiAml.widetrue when the block's integers are 64 bits wide
def AcpiAml.of_sdt
def aml.parse
def AcpiAml.parsea DSDT or SSDT at the front of o (checked; either signature)
def AcpiAml.parse_dsdt
def AcpiAml.buildthe table: the header's signature as given (DSDT or SSDT), length and checksum computed

type AcpiRawEntryone structure: its type, its offset from the start of the table, and its bytes (the type and length bytes included)
def AcpiRawEntry.kind
def AcpiRawEntry.data
type AcpiEntNextwhat comes next in the bytes: nothing, a structure of type k and length l, or a structure of type k whose length is bad
def ent.next.pick
def ent.next.go
def ent.next
def ent.rev
def ent.goevery structure consumes at least 2 bytes, so len(o) steps are enough
def AcpiRawEntry.splitthe structures in o, which starts at offset off of its table; AcpiBadEntry names the first one whose length is below 2 or runs past the end
def AcpiRawEntry.encodethe structure as bytes: its type, its length, then body (the bytes after the two header bytes)