Made the interpreter pass most of the mycology test suite
This commit is contained in:
parent
198efceb1f
commit
da7e7dae2b
13 changed files with 206 additions and 35 deletions
6
.gitmodules
vendored
Normal file
6
.gitmodules
vendored
Normal file
|
@ -0,0 +1,6 @@
|
||||||
|
[submodule "spec"]
|
||||||
|
path = spec
|
||||||
|
url = https://github.com/catseye/Funge-98
|
||||||
|
[submodule "mycology"]
|
||||||
|
path = mycology
|
||||||
|
url = https://github.com/Deewiant/Mycology
|
|
@ -37,7 +37,8 @@ func main() {
|
||||||
fmt.Printf("Failed to load file %s : %+v", *filename, err)
|
fmt.Printf("Failed to load file %s : %+v", *filename, err)
|
||||||
os.Exit(3)
|
os.Exit(3)
|
||||||
}
|
}
|
||||||
|
p := pointer.NewPointer()
|
||||||
v := interpreter.NewInterpreter(f, pointer.NewPointer()).Run()
|
p.Argv = []string{*filename}
|
||||||
|
v := interpreter.NewInterpreter(f, p).Run()
|
||||||
os.Exit(v)
|
os.Exit(v)
|
||||||
}
|
}
|
||||||
|
|
2
go.mod
2
go.mod
|
@ -6,8 +6,6 @@ require github.com/stretchr/testify v1.7.0
|
||||||
|
|
||||||
require (
|
require (
|
||||||
github.com/davecgh/go-spew v1.1.1 // indirect
|
github.com/davecgh/go-spew v1.1.1 // indirect
|
||||||
github.com/pkg/term v1.1.0 // indirect
|
|
||||||
github.com/pmezard/go-difflib v1.0.0 // indirect
|
github.com/pmezard/go-difflib v1.0.0 // indirect
|
||||||
golang.org/x/sys v0.0.0-20200909081042-eff7692f9009 // indirect
|
|
||||||
gopkg.in/yaml.v3 v3.0.0-20210107192922-496545a6307b // indirect
|
gopkg.in/yaml.v3 v3.0.0-20210107192922-496545a6307b // indirect
|
||||||
)
|
)
|
||||||
|
|
4
go.sum
4
go.sum
|
@ -1,15 +1,11 @@
|
||||||
github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
|
github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
|
||||||
github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
|
github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=
|
||||||
github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
|
github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=
|
||||||
github.com/pkg/term v1.1.0 h1:xIAAdCMh3QIAy+5FrE8Ad8XoDhEU4ufwbaSozViP9kk=
|
|
||||||
github.com/pkg/term v1.1.0/go.mod h1:E25nymQcrSllhX42Ok8MRm1+hyBdHY0dCeiKZ9jpNGw=
|
|
||||||
github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
|
github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=
|
||||||
github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
|
github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=
|
||||||
github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
|
github.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=
|
||||||
github.com/stretchr/testify v1.7.0 h1:nwc3DEeHmmLAfoZucVR881uASk0Mfjw8xYJ99tb5CcY=
|
github.com/stretchr/testify v1.7.0 h1:nwc3DEeHmmLAfoZucVR881uASk0Mfjw8xYJ99tb5CcY=
|
||||||
github.com/stretchr/testify v1.7.0/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
|
github.com/stretchr/testify v1.7.0/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=
|
||||||
golang.org/x/sys v0.0.0-20200909081042-eff7692f9009 h1:W0lCpv29Hv0UaM1LXb9QlBHLNP8UFfcKjblhVCWftOM=
|
|
||||||
golang.org/x/sys v0.0.0-20200909081042-eff7692f9009/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=
|
|
||||||
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
|
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=
|
||||||
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
|
gopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=
|
||||||
gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
|
gopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=
|
||||||
|
|
1
mycology
Submodule
1
mycology
Submodule
|
@ -0,0 +1 @@
|
||||||
|
Subproject commit 3787e42c3d4f0b735a09129a205e3e4df848558c
|
|
@ -96,3 +96,7 @@ func (f *Field) Set(x, y, v int) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func (f Field) Dump() (int, int, int, int) {
|
||||||
|
return f.x, f.y, f.lx, f.ly
|
||||||
|
}
|
||||||
|
|
|
@ -329,3 +329,9 @@ func TestGetAndSetOnEmptyLines(t *testing.T) {
|
||||||
field.Set(0, -1, 'c')
|
field.Set(0, -1, 'c')
|
||||||
require.Equal(t, &f, field)
|
require.Equal(t, &f, field)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestDump(t *testing.T) {
|
||||||
|
// nothing to test really
|
||||||
|
f := Field{}
|
||||||
|
f.Dump()
|
||||||
|
}
|
||||||
|
|
|
@ -2,6 +2,9 @@ package pointer
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"log"
|
"log"
|
||||||
|
"os"
|
||||||
|
"time"
|
||||||
|
"unsafe"
|
||||||
|
|
||||||
"git.adyxax.org/adyxax/gofunge/pkg/field"
|
"git.adyxax.org/adyxax/gofunge/pkg/field"
|
||||||
)
|
)
|
||||||
|
@ -41,27 +44,50 @@ func (p *Pointer) eval(c int, f *field.Field) (done bool, returnValue *int) {
|
||||||
switch c {
|
switch c {
|
||||||
case '@':
|
case '@':
|
||||||
return true, nil
|
return true, nil
|
||||||
|
case 'z':
|
||||||
case '#':
|
case '#':
|
||||||
p.Step(*f)
|
p.Step(*f)
|
||||||
case 'j':
|
case 'j':
|
||||||
n := p.ss.head.Pop()
|
n := p.ss.head.Pop()
|
||||||
|
if n > 0 {
|
||||||
for j := 0; j < n; j++ {
|
for j := 0; j < n; j++ {
|
||||||
p.Step(*f)
|
p.Step(*f)
|
||||||
}
|
}
|
||||||
|
} else {
|
||||||
|
p.Reverse()
|
||||||
|
for j := 0; j < -n; j++ {
|
||||||
|
p.Step(*f)
|
||||||
|
}
|
||||||
|
p.Reverse()
|
||||||
|
}
|
||||||
case 'q':
|
case 'q':
|
||||||
v := p.ss.head.Pop()
|
v := p.ss.head.Pop()
|
||||||
return true, &v
|
return true, &v
|
||||||
case 'k':
|
case 'k':
|
||||||
n := p.ss.head.Pop()
|
n := p.ss.head.Pop()
|
||||||
c = p.StepAndGet(*f)
|
c = p.StepAndGet(*f)
|
||||||
|
steps := 1
|
||||||
for jumpingMode := false; jumpingMode || c == ' ' || c == ';'; c = p.StepAndGet(*f) {
|
for jumpingMode := false; jumpingMode || c == ' ' || c == ';'; c = p.StepAndGet(*f) {
|
||||||
|
steps += 1
|
||||||
if c == ';' {
|
if c == ';' {
|
||||||
jumpingMode = !jumpingMode
|
jumpingMode = !jumpingMode
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
for j := 0; j < n; j++ {
|
if n > 0 {
|
||||||
|
// we need to reverse that step
|
||||||
|
p.Reverse()
|
||||||
|
for i := 0; i < steps; i++ {
|
||||||
|
p.Step(*f)
|
||||||
|
}
|
||||||
|
p.Reverse()
|
||||||
|
if c != ' ' && c != ';' {
|
||||||
|
if n > 0 {
|
||||||
|
for i := 0; i < n; i++ {
|
||||||
p.eval(c, f)
|
p.eval(c, f)
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
case '!':
|
case '!':
|
||||||
v := p.ss.head.Pop()
|
v := p.ss.head.Pop()
|
||||||
if v == 0 {
|
if v == 0 {
|
||||||
|
@ -140,9 +166,13 @@ func (p *Pointer) eval(c int, f *field.Field) (done bool, returnValue *int) {
|
||||||
case '{':
|
case '{':
|
||||||
p.ss.Begin(p)
|
p.ss.Begin(p)
|
||||||
case '}':
|
case '}':
|
||||||
p.ss.End(p)
|
if p.ss.End(p) {
|
||||||
|
p.Reverse()
|
||||||
|
}
|
||||||
case 'u':
|
case 'u':
|
||||||
p.ss.Under()
|
if p.ss.Under() {
|
||||||
|
p.Reverse()
|
||||||
|
}
|
||||||
case 'g':
|
case 'g':
|
||||||
y, x := p.ss.head.Pop(), p.ss.head.Pop()
|
y, x := p.ss.head.Pop(), p.ss.head.Pop()
|
||||||
p.ss.head.Push(f.Get(x+p.sox, y+p.soy))
|
p.ss.head.Push(f.Get(x+p.sox, y+p.soy))
|
||||||
|
@ -157,6 +187,123 @@ func (p *Pointer) eval(c int, f *field.Field) (done bool, returnValue *int) {
|
||||||
p.ss.head.Push(p.DecimalInput())
|
p.ss.head.Push(p.DecimalInput())
|
||||||
case '~':
|
case '~':
|
||||||
p.ss.head.Push(p.CharacterInput())
|
p.ss.head.Push(p.CharacterInput())
|
||||||
|
case 'y':
|
||||||
|
n := p.ss.head.Pop()
|
||||||
|
if n > 22+p.ss.height {
|
||||||
|
n = n - 20
|
||||||
|
if p.ss.head.height <= n {
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
} else {
|
||||||
|
p.ss.head.Push(p.ss.head.data[p.ss.head.height-n])
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
now := time.Now()
|
||||||
|
x, y, lx, ly := f.Dump()
|
||||||
|
const uintSize = 32 << (^uint(0) >> 32 & 1) // 32 or 64
|
||||||
|
heights := make([]int, p.ss.height)
|
||||||
|
s := p.ss.head
|
||||||
|
for i := p.ss.height - 1; i >= 0; i-- {
|
||||||
|
heights[i] = s.height
|
||||||
|
s = s.next
|
||||||
|
}
|
||||||
|
if n <= 0 {
|
||||||
|
for _, e := range os.Environ() {
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
for i := len(e) - 1; i >= 0; i-- {
|
||||||
|
p.ss.head.Push(int(e[i]))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if n <= 0 {
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
for i := len(p.Argv) - 1; i >= 0; i-- {
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
for j := len(p.Argv[i]) - 1; j >= 0; j-- {
|
||||||
|
p.ss.head.Push(int(p.Argv[i][j]))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (n > 22 && n <= 22+p.ss.height) || n <= 0 {
|
||||||
|
for i := 0; i < len(heights); i++ {
|
||||||
|
p.ss.head.Push(heights[i])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if n == 22 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.ss.height)
|
||||||
|
}
|
||||||
|
if n == 21 || n <= 0 {
|
||||||
|
p.ss.head.Push((now.Hour() * 256 * 256) + (now.Minute() * 256) + now.Second())
|
||||||
|
}
|
||||||
|
if n == 20 || n <= 0 {
|
||||||
|
p.ss.head.Push(((now.Year() - 1900) * 256 * 256) + (int(now.Month()) * 256) + now.Day())
|
||||||
|
}
|
||||||
|
if n == 19 || n <= 0 {
|
||||||
|
p.ss.head.Push(lx + x)
|
||||||
|
}
|
||||||
|
if n == 18 || n <= 0 {
|
||||||
|
p.ss.head.Push(ly + y)
|
||||||
|
}
|
||||||
|
if n == 17 || n <= 0 {
|
||||||
|
p.ss.head.Push(x)
|
||||||
|
}
|
||||||
|
if n == 16 || n <= 0 {
|
||||||
|
p.ss.head.Push(y)
|
||||||
|
}
|
||||||
|
if n == 15 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.sox)
|
||||||
|
}
|
||||||
|
if n == 14 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.soy)
|
||||||
|
}
|
||||||
|
if n == 13 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.dx)
|
||||||
|
}
|
||||||
|
if n == 12 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.dy)
|
||||||
|
}
|
||||||
|
if n == 11 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.x)
|
||||||
|
}
|
||||||
|
if n == 10 || n <= 0 {
|
||||||
|
p.ss.head.Push(p.y)
|
||||||
|
}
|
||||||
|
if n == 9 || n <= 0 {
|
||||||
|
p.ss.head.Push(0)
|
||||||
|
}
|
||||||
|
if n == 8 || n <= 0 {
|
||||||
|
p.ss.head.Push(*((*int)(unsafe.Pointer(p))))
|
||||||
|
}
|
||||||
|
if n == 7 || n <= 0 {
|
||||||
|
p.ss.head.Push(2)
|
||||||
|
}
|
||||||
|
if n == 6 || n <= 0 {
|
||||||
|
p.ss.head.Push('/')
|
||||||
|
}
|
||||||
|
if n == 5 || n <= 0 {
|
||||||
|
p.ss.head.Push(0) // TODO update when implementing =
|
||||||
|
}
|
||||||
|
if n == 4 || n <= 0 {
|
||||||
|
p.ss.head.Push(1)
|
||||||
|
}
|
||||||
|
if n == 3 || n <= 0 {
|
||||||
|
p.ss.head.Push(1048576)
|
||||||
|
}
|
||||||
|
if n == 2 || n <= 0 {
|
||||||
|
p.ss.head.Push(uintSize / 8)
|
||||||
|
}
|
||||||
|
if n == 1 || n <= 0 {
|
||||||
|
p.ss.head.Push(0b00000) // TODO update when implementing t, i, o and =
|
||||||
|
}
|
||||||
|
case 'i':
|
||||||
|
log.Fatalf("Non implemented instruction code %d : %c", c, c)
|
||||||
|
case 'o':
|
||||||
|
log.Fatalf("Non implemented instruction code %d : %c", c, c)
|
||||||
|
case '=':
|
||||||
|
log.Fatalf("Non implemented instruction code %d : %c", c, c)
|
||||||
|
case 't':
|
||||||
|
log.Fatalf("Non implemented instruction code %d : %c", c, c)
|
||||||
default:
|
default:
|
||||||
handled = false
|
handled = false
|
||||||
}
|
}
|
||||||
|
@ -168,7 +315,7 @@ func (p *Pointer) eval(c int, f *field.Field) (done bool, returnValue *int) {
|
||||||
case c >= 'a' && c <= 'f':
|
case c >= 'a' && c <= 'f':
|
||||||
p.ss.head.Push(c - 'a' + 10)
|
p.ss.head.Push(c - 'a' + 10)
|
||||||
default:
|
default:
|
||||||
log.Fatalf("Non implemented instruction code %d : %c", c, c)
|
p.Redirect('r')
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
return
|
return
|
||||||
|
|
|
@ -4,8 +4,6 @@ import (
|
||||||
"fmt"
|
"fmt"
|
||||||
"log"
|
"log"
|
||||||
"os"
|
"os"
|
||||||
|
|
||||||
"github.com/pkg/term"
|
|
||||||
)
|
)
|
||||||
|
|
||||||
var defaultInputLastChar *int = nil
|
var defaultInputLastChar *int = nil
|
||||||
|
@ -16,13 +14,6 @@ func DefaultCharacterInput() int {
|
||||||
defaultInputLastChar = nil
|
defaultInputLastChar = nil
|
||||||
return c
|
return c
|
||||||
}
|
}
|
||||||
t, err := term.Open("/dev/stdin")
|
|
||||||
if err != nil {
|
|
||||||
log.Fatalf("Could not open stdin: %+v", err)
|
|
||||||
}
|
|
||||||
defer t.Close()
|
|
||||||
defer t.Restore()
|
|
||||||
term.RawMode(t)
|
|
||||||
b := make([]byte, 1)
|
b := make([]byte, 1)
|
||||||
i, err := os.Stdin.Read(b)
|
i, err := os.Stdin.Read(b)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
|
|
|
@ -31,6 +31,8 @@ type Pointer struct {
|
||||||
DecimalInput InputFunction
|
DecimalInput InputFunction
|
||||||
CharacterOutput OutputFunction
|
CharacterOutput OutputFunction
|
||||||
DecimalOutput OutputFunction
|
DecimalOutput OutputFunction
|
||||||
|
// command line arguments
|
||||||
|
Argv []string
|
||||||
}
|
}
|
||||||
|
|
||||||
func NewPointer() *Pointer {
|
func NewPointer() *Pointer {
|
||||||
|
|
|
@ -22,17 +22,26 @@ func (ss *StackStack) Begin(p *Pointer) {
|
||||||
}
|
}
|
||||||
toss := &Stack{
|
toss := &Stack{
|
||||||
size: np,
|
size: np,
|
||||||
height: np,
|
|
||||||
data: make([]int, np),
|
data: make([]int, np),
|
||||||
next: soss,
|
next: soss,
|
||||||
}
|
}
|
||||||
ss.head = toss
|
ss.head = toss
|
||||||
max := n - soss.height
|
if n > 0 {
|
||||||
if max < 0 {
|
toss.height = n
|
||||||
max = 0
|
elts := soss.height - n
|
||||||
|
if elts < 0 {
|
||||||
|
elts = soss.height
|
||||||
|
} else {
|
||||||
|
elts = n
|
||||||
|
}
|
||||||
|
for i := 1; i <= elts; i++ {
|
||||||
|
toss.data[toss.height-i] = soss.data[soss.height-i]
|
||||||
|
}
|
||||||
|
soss.height -= elts
|
||||||
|
} else if n < 0 {
|
||||||
|
for i := 0; i < np; i++ {
|
||||||
|
soss.Push(0)
|
||||||
}
|
}
|
||||||
for i := n - 1; i >= max; i-- {
|
|
||||||
toss.data[i] = soss.data[soss.height-n+i]
|
|
||||||
}
|
}
|
||||||
x, y := p.GetStorageOffset()
|
x, y := p.GetStorageOffset()
|
||||||
soss.Push(x)
|
soss.Push(x)
|
||||||
|
@ -50,6 +59,12 @@ func (ss *StackStack) End(p *Pointer) (reflect bool) {
|
||||||
x := soss.Pop()
|
x := soss.Pop()
|
||||||
p.SetStorageOffset(x, y)
|
p.SetStorageOffset(x, y)
|
||||||
if n > 0 {
|
if n > 0 {
|
||||||
|
if n > ss.head.height {
|
||||||
|
for i := n; i > ss.head.height; i-- {
|
||||||
|
soss.Push(0)
|
||||||
|
}
|
||||||
|
n = ss.head.height
|
||||||
|
}
|
||||||
soss.height += n
|
soss.height += n
|
||||||
if soss.size < soss.height {
|
if soss.size < soss.height {
|
||||||
soss.data = append(soss.data, make([]int, soss.height-soss.size)...)
|
soss.data = append(soss.data, make([]int, soss.height-soss.size)...)
|
||||||
|
@ -58,7 +73,7 @@ func (ss *StackStack) End(p *Pointer) (reflect bool) {
|
||||||
for i := n; i > 0; i-- {
|
for i := n; i > 0; i-- {
|
||||||
soss.data[soss.height-i] = ss.head.data[ss.head.height-i]
|
soss.data[soss.height-i] = ss.head.data[ss.head.height-i]
|
||||||
}
|
}
|
||||||
} else {
|
} else if n < 0 {
|
||||||
soss.height += n
|
soss.height += n
|
||||||
if soss.height < 0 {
|
if soss.height < 0 {
|
||||||
soss.height = 0
|
soss.height = 0
|
||||||
|
|
|
@ -23,6 +23,9 @@ func (s *Stack) Clear() {
|
||||||
func (s *Stack) Duplicate() {
|
func (s *Stack) Duplicate() {
|
||||||
if s.height > 0 {
|
if s.height > 0 {
|
||||||
s.Push(s.data[s.height-1])
|
s.Push(s.data[s.height-1])
|
||||||
|
} else {
|
||||||
|
s.Push(0)
|
||||||
|
s.Push(0)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
1
spec
Submodule
1
spec
Submodule
|
@ -0,0 +1 @@
|
||||||
|
Subproject commit 7b4330df1a624c464f01c80090b60621ce5a330e
|
Loading…
Add table
Add a link
Reference in a new issue