Returns true if value is divisible by 5^p.

implements float arihmetic

* * For more than 8 characters section names, name contains a slash (/) that is * followed by an ASCII representation of a decimal number that is an

Orderaddrtemp ensures that *np is okay to pass by address to runtime routines. If the original argument *np is not okay, orderaddrtemp creates a tmp,

Orderblock orders the block of statements *l onto a new list, and then replaces *l with that list.

scaleDenom computes x*f. If f == 0 (zero value of denominator), the result is (a copy of) x.

scan sets z to the integer value corresponding to the longest possible prefix read from r representing a signed integer number in a given conversion b

string_view::size() Returns the number of characters in the `string_view`.

Search children (assumed to have DW_TAG_member) for the one named field and set its DW_AT_type to dwtype

trailingZeroBits returns the number of consecutive least significant zero bits of x.

Our own isdigit, isspace, isalpha, isalnum that take care of EOF and other out of range arguments.

* * allocate a register (reusing res if possible) and generate * a = &n * The caller must call Regfree(a). * The generated code checks that the re

* * allocate a register (reusing res if possible) and generate * a = n * The caller must call Regfree(a). */

Clone resolves the given ref to a hash and returns the corresponding fs.FS.

DynlinkingGo returns whether we are producing Go code that can live in separate shared libraries linked together at runtime.

Expand extends the length of the current memory to be at least n bytes and returns the extended slice.

We consider denormals not to be special. Hence only Infinity and NaN are special.

Lines reads packets from r until a flush packet. It returns a string for each packet, with any trailing newline trimmed.

Linklinehist pushes, amends, or pops an entry on the line history stack. If f != "<pop>" and n == 0, the call pushes the start of a new file named f a

NewFloat allocates and returns a new Float set to x, with precision 53 and rounding mode ToNearestEven. NewFloat panics with ErrNaN if x is a NaN.

NewMemTree returns a new in-memory [Tree].

Release syncs the memory and makes the in-memory data unreadable. Future accesses to the slice data will fault, causing the program to crash, unless [

SHA256 returns the hexadecimal SHA256 hash of data.

Scan is a support routine for fmt.Scanner; it sets z to the value of the scanned number. It accepts the formats 'b' (binary), 'o' (octal), 'd' (decima

SetUint64 sets z to x and returns z.

Sync flushes all changes from past Set and Snap calls to the underlying files and then calls the files' Sync methods to flush the changes to disk. (If

Fmt "%V": Values

* * check assign expression list to * a type list. called in * return expr-list * func(expr-list) */

bit returns the n'th bit of the key.

* * either direct or indirect */

* * if n is constant, rewrite as OLITERAL node. */

hashInner returns the hash of an inner node with the given bit position and left and right child hashes.

Inlcopy and inlcopylist recursively copy the body of a function. Any name-like node of non-local class is marked for re-export by adding it to the exp

write out error comment

* * given receiver of type t (t == r or t == *r) * return type to hang methods off (r). */

Ordermapassign appends n to order->out, introducing temporaries to make sure that all map assignments have the form m[k] = x, where x is adressable. (

Look for anything we need for the inline body

z = x >> s

* * from here down is the walk analysis * of composite literals. * most of the work is to generate * data statements for the constant * part of t

return a pointer to the name of symbol i