summaryrefslogtreecommitdiff
path: root/llm/run.go
blob: 227a3658b7f0a2139d1eeefc0597d75a779723e1 (plain)
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
package llm

import (
	"fmt"
	"sync"
	"time"

	"go.jknobloc.com/x/dataset"
	"go.jknobloc.com/x/tui"
)

func (e *Evaluator[R]) Run(title string, data dataset.Reader, window, stride int) error {
	devices := make([]int, len(e.models))

	for i := range len(devices) {
		devices[i] = i
	}

	devicePool := newPool(devices...)

	var wg sync.WaitGroup

	for range e.numWorkers {
		wg.Add(1)

		go func() {
			defer wg.Done()

			for b := range e.jobs {
				device := devicePool.Acquire()

				func() {
					defer devicePool.Release(device)

					defer func() {
						if r := recover(); r != nil {
							fmt.Println("HOUSTON") // TODO handle
						}
					}()

					e.execute(&b, device)
				}()

				e.completed.Add(int64(b.Size()))
			}
		}()
	}

	pb := tui.NewProgressBar(title, 20, 0, time.Now())

	pb.Start(1*time.Second, func() int {
		return int(e.completed.Load())
	})

	s := 0 // skipped
	n := 0 // total

	defer func() {
		fmt.Printf("skipped %d of %d texts\n", s, n)
	}()

	defer pb.Close()

	for d := range data.Texts("text") {
		tokens := toInt64(e.tokenizer.Tokenize(d))

		if len(tokens) == 0 {
			n++
			s++

			continue
		}

		e.schedule(n, tokens, window, stride, e.batchSize)

		pb.SetTotal(pb.Total() + e.estimateJobs(tokens, window, stride))

		n++
	}

	close(e.jobs)

	wg.Wait()

	close(e.results)

	return nil
}

func (e *Evaluator[R]) estimateJobs(tokens []int64, window, stride int) int {
	if len(tokens) < window {
		return 0
	}

	windows := ((len(tokens) - window) / stride) + 1
	// jobs := (windows + batchSize - 1) / e.batchSize

	return windows
}

func (e *Evaluator[R]) schedule(uid int, tokens []int64, contextSize, stride, batchSize int) {
	b := newBatch(batchSize)

	seen := 1 // first token as context
	n := 0

	// for i := 0; i+contextSize <= len(tokens); i += stride {
	for i := 0; i < len(tokens); i += stride {
		if b.Size() == batchSize {
			e.jobs <- *b

			b = newBatch(batchSize)
		}

		j := min(i+contextSize, len(tokens))

		if j-i < contextSize {
			break // don't add jobs with partial windows
		}

		// if j < seen {
		// 	break // don't add jobs with no new tokens
		// }

		b.AddJob(Job{
			Document: uid,
			Position: n,
			Tokens:   tokens[i:j],
			Seen:     seen - i,
		})

		seen = i + contextSize

		n++
	}

	if b.Size() > 0 {
		e.jobs <- *b
	}

	e.scheduled.Add(int64(n))
}

func (e *Evaluator[R]) execute(j *batch, device int) {
	if j.Size() != 1 {
		panic("unimplemented")
	}

	job := j.jobs[0]

	if job.Seen < 1 {
		panic("empty context")
	}

	m := e.models[device]

	logits := make([][]float32, 0, len(job.Tokens))

	if _, err := m.Generate(job.Tokens, 0, &logits); err != nil {
		panic(err) // TODO handle
	}

	l := logits[job.Seen-1 : len(logits)-1]
	t := toInt(job.Tokens[job.Seen:])

	r := e.callback(job, l, t)

	e.results <- r

	return
}