To be safe buffer must have at least kTransformedBufferSize */

UnsafeUnmap unmaps the virtual address space used by a closed memory. If m has not been closed using [Mem.Close], UnsafeUnmap does nothing but return

addrToMem returns the tree memory at address a and length n.

adjust for deprecated feature macros

alpha returns 1 if i is 0 and returns √2 otherwise.

Convert `digits` to decimal and write the last 9 decimal digits to result. If `digits` contains additional digits, then those are silently ignored.

Convert node n for assignment to type t.

bit returns the value of the i'th bit, with lsb == bit 0.

blsh returns a Bits with 1 at index n, 0 elsewhere (1<<n).

bytes writes the value of z into buf using big-endian encoding. len(buf) must be >= len(z)*_S. The value of z is encoded in the slice buf[i:]. The num

string_view::compare() Performs a lexicographical comparison between this `string_view` and another `string_view` `x`, returning a negative value if

* * declare constants from grammar * new_name_list [[type] = expr_list] */

cutInt scans the leading decimal number at the start of x to an integer and returns that value and the rest of the string.

string_view::data() Returns a pointer to the underlying character array (which is of course stored elsewhere). Note that `string_view::data()` may co

Returns the number of decimal digits in v, which must not contain more than 9 digits.

Decoding the type.* symbols. This has to be in sync with ../../runtime/type.go, or more specifically, with what ../gc/reflect.c stuffs in these.

Type.commonType.size

* * defaultlit on both nodes simultaneously; * if they're both ideal going in they better * get the same type going out. * force means must assign

q = (x-r)/y, with 0 <= r < y

string_view::empty() Checks if the `string_view` is empty (refers to no characters).

emptyTreeHash returns the parent hash for a root no child nodes.

slow emulation routine for 32-bit

Return node for if p.field != q.field { return false }

Store the link src->dst in dst, throwing out some quick wins.

funcpctab writes to dst a pc-value table mapping the code in func to the values returned by valfunc parameterized by arg. The invocation of valfunc to

Conventions Upper-case for power series. Lower-case for rationals. Input variables: U,V,... Output variables: ...,Y,Z Integer gcd; needed for rational

getLine returns the first n lines of data and the remainder. If data has no newline, getLine returns data, nil, false

Builds a type representing a Hmap structure for the given map type. Make sure this stays in sync with ../../runtime/hashmap.go!

A pattern matcher for call instructions. Returns true when the instruction is a call to a specific package qualified function name.

isextern reports whether s describes an external symbol that must avoid pc-relative addressing. This happens on systems like Solaris that call .so fun

* * Is this field a method on an interface? * Those methods have an anonymous * *struct{} as the receiver. * (See fakethis above.) */

Returns true for instructions that are safe points that must be annotated with liveness information.

Returns floor(log_10(2^e)); requires 0 <= e <= 1650.

allocate enough room to hold another production

Best case: use 128-bit type.

mult128bitPow10 takes a floating-point input with a 55-bit mantissa and multiplies it with 10^q. The resulting mantissa is m*P >> 119 where P is a 128

mult64bitPow10 takes a floating-point input with a 25-bit mantissa and multiplies it with 10^q. The resulting mantissa is m*P >> 57 where P is a 64-bi

Returns true if value is divisible by 5^p.

do we need the carry bit

Constructs a new basic block containing a single instruction.

nlz returns the number of leading zero bits in x.