989e18b760
Replace the bare-paren tuple grammar with explicit, position-unambiguous
forms, mirroring how structs work:
type `(A, B)` -> `Tuple(A, B)` (named keeps `:`)
value `(a, b)` -> `.(a, b)` (named uses `=`)
typed (new) -> `Tuple(A, B).(a, b)` (like `Point.{...}`)
failable `-> (T, !)` -> `-> T !`
`-> (T1, T2, !)`-> `-> Tuple(T1, T2) !` (channel outside Tuple)
Bare `(...)` is now grouping only, everywhere; a comma in bare parens is a
hard error with a migration hint. Grouping, function types `(A, B) -> R`,
param lists, lambdas, and match bindings are unaffected.
`Tuple(...)` is strictly a TYPE in every position (including `size_of` /
`type_info` args); a tuple VALUE comes only from `.(...)` (anonymous) or
`Tuple(...).(...)` (explicitly typed). A bare `Tuple(1, 2)` is a tuple
type with non-type elements -> rejected.
The ~110 tuple-bearing corpus files were migrated with a one-shot
AST-aware migrator (the `sx migrate` tool from the prior commit, removed
here). New examples: 0130 (new syntax), 0131 (typed construction), 1060
(named-tuple failable return). 1116 golden updated for the new hint text.
21 lines
811 B
Plaintext
21 lines
811 B
Plaintext
// ASM stream Phase E — x86_64 multi-output asm: `divq` produces quotient in rax
|
|
// and remainder in rdx, returned as a `(quot, rem)` tuple. Two `={rax}`/`={rdx}`
|
|
// value outputs ⇒ LLVM returns a `{ i64, i64 }` struct, which IS sx's tuple
|
|
// representation (so `q, r := …` destructures it directly). x86-pinned via
|
|
// `.build`: ir-only on a non-x86 host (the `.ir` snapshot locks the struct
|
|
// return + `%[name]` rewrite); runs natively on x86_64-linux. See 1647 for a
|
|
// multi-output example that executes on aarch64.
|
|
divmod :: (n: u64, d: u64) -> Tuple(quot: u64, rem: u64) {
|
|
return asm {
|
|
"divq %[d]",
|
|
[quot] "={rax}" -> u64,
|
|
[rem] "={rdx}" -> u64,
|
|
"{rax}" = n, "{rdx}" = 0, [d] "r" = d,
|
|
clobbers(.cc),
|
|
};
|
|
}
|
|
|
|
main :: () {
|
|
q, r := divmod(17, 5);
|
|
}
|