Implemented an assembler

src/core/Function.go

@@ -3,7 +3,10 @@ package core
 import (
 	"fmt"
 
+	"git.urbach.dev/cli/q/src/asm"
+	"git.urbach.dev/cli/q/src/cpu"
 	"git.urbach.dev/cli/q/src/fs"
+	"git.urbach.dev/cli/q/src/set"
 	"git.urbach.dev/cli/q/src/ssa"
 	"git.urbach.dev/cli/q/src/token"
 )
@@ -11,14 +14,18 @@ import (
 // Function is the smallest unit of code.
 type Function struct {
 	ssa.IR
-	Name        string
-	UniqueName  string
-	File        *fs.File
-	Input       []*Parameter
-	Output      []*Parameter
-	Body        token.List
-	Identifiers map[string]ssa.Value
-	Err         error
+	Name         string
+	UniqueName   string
+	File         *fs.File
+	Input        []*Parameter
+	Output       []*Parameter
+	Body         token.List
+	Identifiers  map[string]ssa.Value
+	All          *Environment
+	Dependencies set.Ordered[*Function]
+	Assembler    asm.Assembler
+	CPU          *cpu.CPU
+	Err          error
 }
 
 // NewFunction creates a new function.
@@ -33,6 +40,24 @@ func NewFunction(name string, file *fs.File) *Function {
 				{Instructions: make([]ssa.Value, 0, 8)},
 			},
 		},
+		Assembler: asm.Assembler{
+			Instructions: make([]asm.Instruction, 0, 8),
+		},
+	}
+}
+
+// EachDependency recursively finds all the calls to other functions.
+// It avoids calling the same function twice with the help of a hashmap.
+func (f *Function) EachDependency(traversed map[*Function]bool, call func(*Function)) {
+	call(f)
+	traversed[f] = true
+
+	for dep := range f.Dependencies.All() {
+		if traversed[dep] {
+			continue
+		}
+
+		dep.EachDependency(traversed, call)
 	}
 }
 
@@ -41,6 +66,11 @@ func (f *Function) IsExtern() bool {
 	return f.Body == nil
 }
 
+// IsLeaf returns true if the function doesn't call other functions.
+func (f *Function) IsLeaf() bool {
+	return f.Dependencies.Count() == 0
+}
+
 // String returns the unique name.
 func (f *Function) String() string {
 	return f.UniqueName