forked from go-llvm/llgo
/
literals.go
176 lines (160 loc) · 5.6 KB
/
literals.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
/*
Copyright (c) 2011, 2012 Andrew Wilkins <axwalk@gmail.com>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
package llgo
import (
"fmt"
"github.com/axw/gollvm/llvm"
"github.com/axw/llgo/types"
"go/ast"
)
func (c *compiler) VisitBasicLit(lit *ast.BasicLit) Value {
return c.NewConstValue(lit.Kind, lit.Value)
}
func (c *compiler) VisitFuncLit(lit *ast.FuncLit) Value {
fn_type := c.VisitFuncType(lit.Type)
fn := llvm.AddFunction(c.module.Module, "", c.types.ToLLVM(fn_type))
fn.SetFunctionCallConv(llvm.FastCallConv)
defer c.builder.SetInsertPointAtEnd(c.builder.GetInsertBlock())
entry := llvm.AddBasicBlock(fn, "entry")
c.builder.SetInsertPointAtEnd(entry)
fn_value := c.NewLLVMValue(fn, fn_type)
c.functions = append(c.functions, fn_value)
c.VisitBlockStmt(lit.Body)
if fn_type.Results == nil {
lasti := entry.LastInstruction()
if lasti.IsNil() || lasti.Opcode() != llvm.Ret {
// Assume nil return type, AST should be checked first.
c.builder.CreateRetVoid()
}
}
c.functions = c.functions[0 : len(c.functions)-1]
return fn_value
}
func (c *compiler) VisitCompositeLit(lit *ast.CompositeLit) Value {
typ := c.GetType(lit.Type)
var valuemap map[Value]Value
var valuelist []Value
if lit.Elts != nil {
for _, elt := range lit.Elts {
var value Value
if kv, iskv := elt.(*ast.KeyValueExpr); iskv {
key := c.VisitExpr(kv.Key)
value = c.VisitExpr(kv.Value)
if valuemap == nil {
valuemap = make(map[Value]Value)
}
valuemap[key] = value
} else {
value = c.VisitExpr(elt)
valuelist = append(valuelist, value)
}
}
}
// For array/slice types, convert key:value to contiguous
// values initialiser.
switch types.Underlying(typ).(type) {
case *types.Array, *types.Slice:
if len(valuemap) > 0 {
maxi := int64(-1)
for key, _ := range valuemap {
i := key.(ConstValue).Int64()
if i < 0 {
panic("array index must be non-negative integer constant")
} else if i > maxi {
maxi = i
}
}
valuelist = make([]Value, maxi+1)
for key, value := range valuemap {
i := key.(ConstValue).Int64()
valuelist[i] = value
}
}
}
origtyp := typ
switch typ := types.Underlying(typ).(type) {
case *types.Array:
typ.Len = uint64(len(valuelist))
elttype := typ.Elt
llvm_values := make([]llvm.Value, typ.Len)
for i, value := range valuelist {
if value == nil {
llvm_values[i] = llvm.ConstNull(c.types.ToLLVM(elttype))
} else {
llvm_values[i] = value.Convert(elttype).LLVMValue()
}
}
// TODO set non-const values after creating const array.
return c.NewLLVMValue(
llvm.ConstArray(c.types.ToLLVM(elttype), llvm_values), origtyp)
case *types.Slice:
ptr := c.builder.CreateMalloc(c.types.ToLLVM(typ), "")
length := llvm.ConstInt(llvm.Int32Type(), uint64(len(valuelist)), false)
valuesPtr := c.builder.CreateArrayMalloc(c.types.ToLLVM(typ.Elt), length, "")
//valuesPtr = c.builder.CreateBitCast(valuesPtr, llvm.PointerType(valuesPtr.Type(), 0), "")
// TODO check result of mallocs
c.builder.CreateStore(valuesPtr, c.builder.CreateStructGEP(ptr, 0, "")) // data
c.builder.CreateStore(length, c.builder.CreateStructGEP(ptr, 1, "")) // len
c.builder.CreateStore(length, c.builder.CreateStructGEP(ptr, 2, "")) // cap
null := llvm.ConstNull(c.types.ToLLVM(typ.Elt))
for i, value := range valuelist {
index := llvm.ConstInt(llvm.Int32Type(), uint64(i), false)
valuePtr := c.builder.CreateGEP(valuesPtr, []llvm.Value{index}, "")
if value == nil {
c.builder.CreateStore(null, valuePtr)
} else {
c.builder.CreateStore(value.Convert(typ.Elt).LLVMValue(), valuePtr)
}
}
m := c.NewLLVMValue(ptr, &types.Pointer{Base: origtyp})
return m.makePointee()
case *types.Struct:
values := valuelist
struct_value := c.builder.CreateMalloc(c.types.ToLLVM(typ), "")
if valuemap != nil {
for key, value := range valuemap {
fieldName := key.(ConstValue).Val.(string)
index := typ.FieldIndices[fieldName]
for len(values) <= int(index) {
values = append(values, nil)
}
values[index] = value
}
}
for i, value := range values {
elttype := c.ObjGetType(typ.Fields[i])
var llvm_value llvm.Value
if value == nil {
llvm_value = llvm.ConstNull(c.types.ToLLVM(elttype))
} else {
llvm_value = value.Convert(elttype).LLVMValue()
}
ptr := c.builder.CreateStructGEP(struct_value, i, "")
c.builder.CreateStore(llvm_value, ptr)
}
m := c.NewLLVMValue(struct_value, &types.Pointer{Base: origtyp})
return m.makePointee()
case *types.Map:
value := llvm.ConstNull(c.types.ToLLVM(typ))
// TODO initialise map
return c.NewLLVMValue(value, origtyp)
}
panic(fmt.Sprint("Unhandled type kind: ", typ))
}
// vim: set ft=go :