summaryrefslogtreecommitdiff
path: root/chapter16
diff options
context:
space:
mode:
authorCliff Click <cliffc@acm.org>2025-02-07 08:58:36 -0800
committerGitHub <noreply@github.com>2025-02-07 08:58:36 -0800
commit34e7282dd7c58b49702c7ecd9f80a46398efd0c1 (patch)
tree9a047322c5f29b342bfc78842fcba1ad775132cc /chapter16
parente0ab1b3a6fe5205c1d41b91de66254f0c1b46b36 (diff)
downloadSimple-34e7282dd7c58b49702c7ecd9f80a46398efd0c1.tar.gz
Simple-34e7282dd7c58b49702c7ecd9f80a46398efd0c1.zip
Ch19 (#155)
* Initial push Major CodeGen cleanup; most static globals move into the CodeGen object. * Minor progress bug with mutual recursion * Add test from pr#148 * First cut x86 "port" Only "return 0;", no registers, no encoding, but yah gotta start somewhere * Update README.md * Update README.md * Update ListScheduler.java * command line launcher for simple Parser bug fref in args Some new test cases. * Add basic RegMask for more than 64 bits of register mask. Add calling convention basics to X86; con+ret RegMasks. GCM computes CFG for all users. Drop unused MultiUse. Pick up reg-pressure aware ListScheduler. Re-layout CodeGen file to get code & data chunks nearer each other. minor Ary extension * ASM Printer InstSel handles folding 2+ ideal ops into 1 machine op * handle instSel for some control flow Bool,If,CProj,Region,Phi Handle 2-op expansions Shuffle instSel graph walk back again. * Basic if-block inst selects and asm prints * Add mul-by-coinstant to shift * left shift codegen basic * exclude RSP from *write* mask * 2-arg add (not immediate) mul-by-small constant opt. Some utilities. * Handle first loop Change inst sel walk again to pre-order, to set an early visit bit to stop cycles. CFGNode copies dom/loop info. Cmp not-immediate form. Ret/Fun lazy updates * inst select for new struct allocation * Float, bitwise and arithmetic operands codegen x86-64 (#150) * left shift codegen basic * sar codegen basic * merge * some basic ops * addf * divf, subf, mulf * rsp allowed in bitwise input, not output * formatting * left shift codegen basic * sar codegen basic * merge * some basic ops * addf * divf, subf, mulf * rsp allowed in bitwise input, not output * formatting * Remove non-exsting FP+imm ops * Handle first loop Change inst sel walk again to pre-order, to set an early visit bit to stop cycles. CFGNode copies dom/loop info. Cmp not-immediate form. Ret/Fun lazy updates * float ops without imm values * merge * merge * inst select for new struct allocation * left shift codegen basic * sar codegen basic * merge * some basic ops * addf * divf, subf, mulf * rsp allowed in bitwise input, not output * formatting * Remove non-exsting FP+imm ops * left shift codegen basic * sar codegen basic * merge * some basic ops * addf * divf, subf, mulf * rsp allowed in bitwise input, not output * formatting * float ops without imm values * merge * merge * Rebased on ch 19 * Update tests --------- Co-authored-by: Cliff Click <cliffc@acm.org> * cleanup after merge alpha-sort helper fcns implicit test vs zero/null * Add LEA op asm print works on ideal nodes for all tests * Minor cleanup lea * x86 addressing modes during inst select Drop New taking inits; just follow with initializing stores. Simplifies inst selelection which otherwise needs to undo this optimization and emit following init stores. Basic load/store for now, op-to-mem comes later add same becomes Shl by 1. Drop DivF-immiedate * extended ch13, 14,15,16 (#153) * merge2 * merge3 * Fix a few minor fuzzer bugs * Force array layout ld/st get size (but not signed/unsigned) Add unsigned LT for later range checks. * Fix a bunch of float issues was deleting required inputs * simpler invariant defensive copy inputs for simpler invariant in complex sharing patterns inc/dec form (just the opcode now). * Call & CallR X86 instructions * Add-from-memory op Remove FP immediate forms. * Remove name from TFP Never shoulda been there (but was convenient for awhile). Moved into FunNode, found by checking the linker table with a TFP. * New (#154) * merge2 * merge3 * GCM for float ops fixed, other cleanup - small extensions * call setup * merge2 * remove debug prints add check for bad call convention fix 3 tests (bad merge?) * cleanup call convention abi Needs more love at some point... * one more cleanup ABI --------- Co-authored-by: Cliff Click <cliffc@acm.org> * Add CmpMem form Common addressing mode print LEA can skip a base * Add a AddFMemX86 A bunch of mem op patterns are missing, hopefully they are just cut-n-paste from the existing patterns. * Docs * XMM reg mask fix Minor README updates * Allow inverted cmp/mem narrowing stores can bypass an AndMask Array length loads do not need control Some missing print info * Support "*ptr op= val" at least for MemAdd * missed golden rule update * Array len is u32 load-after-store zero/sign-extends if the store is truncating * One more missed case --------- Co-authored-by: hadha <helsgithub15@gmail.com> Co-authored-by: Tamás Hadházy <85063808+Hels15@users.noreply.github.com>
Diffstat (limited to 'chapter16')
-rw-r--r--chapter16/README.md25
1 files changed, 16 insertions, 9 deletions
diff --git a/chapter16/README.md b/chapter16/README.md
index 1489d93d..a19c68db 100644
--- a/chapter16/README.md
+++ b/chapter16/README.md
@@ -1,5 +1,12 @@
# Chapter 16: Constructors and Final fields
+# Table of Contents
+
+1. [Constructors](#constructors)
+2. [Initialization code](#initialization-code)
+3. [Final fields](#final-fields)
+4. [Multiple Decls](#multiple-declarations-of-the-same-type)
+
In this chapter, we add constructors and final fields.
You can also read [this chapter](https://github.com/SeaOfNodes/Simple/tree/linear-chapter16) in a linear Git revision history on the [linear](https://github.com/SeaOfNodes/Simple/tree/linear) branch and [compare](https://github.com/SeaOfNodes/Simple/compare/linear-chapter15...linear-chapter16) it to the previous chapter.
@@ -41,8 +48,8 @@ allocation. They do not start with the default value, although the
initialization can be to the default.
```
-struct Person { u8[] name; }
-return new Person; // ERROR: not-null field 'name' not initalized
+struct Person { u8[] name; };
+return new Person; // ERROR: 'Person' is not fully initialized, field 'name' needs to be set in a constructor
```
@@ -91,18 +98,18 @@ x = 3; // ERROR: cannot re-assign a final field
```
```
-struct Person { u8[]? !name; }
+struct Person { u8[]? !name; };
return new Person { name = null; }; // OK: final name is assigned
```
```
-struct Point { int !x; int !y; int !z; }
-return new Point { x=arg; y=z; z=x; } // ERROR: final field z used before initialized
+struct Point { int !x; int !y; int !z; };
+return new Point { x=arg; y=z; z=x; }; // ERROR: 'Point' is not fully initialized, field 'y' needs to be set in a constructor
```
```
-struct Point { int x; int y; int z; } // Fields not-final, default to 0
-return new Point { x=arg; y=z; z=x; } // Ok: x=arg, y=0, z=arg
+struct Point { int x; int y; int z; }; // Fields not-final, default to 0
+return new Point { x=arg; y=z; z=x; }; // Ok: x=arg, y=0, z=arg
```
@@ -113,9 +120,9 @@ is commonly seen in other languages:
```
int x,y; // Two int variables declared
-struct Point { int x,y,z; } // Three fields declared
+struct Point { int x,y,z; }; // Three fields declared
```
```
int !x=3,!y=5; // Two int variables declared, both are final and initialized
-```
+``` \ No newline at end of file