/
evaluator.ex
453 lines (362 loc) · 14.3 KB
/
evaluator.ex
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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
defmodule Nx.Defn.Evaluator do
@moduledoc """
The default implementation of a `Nx.Defn.Compiler`
that evaluates the expression tree against the
tensor backend.
"""
@behaviour Nx.Defn.Compiler
alias Nx.Defn.{Composite, Expr, Tree}
@creation_ops [:eye, :iota, :from_binary]
@random_ops [:random_uniform, :random_normal]
@list_ops [:concatenate]
@indices_ops [:slice, :put_slice]
@impl true
def __stream__(_key, input, acc, vars, fun, [args], opts) do
count = Nx.Defn.Composite.count(input) + Nx.Defn.Composite.count(acc)
rest_params = Enum.drop(args, count)
hooks = Keyword.get(opts, :hooks, %{})
gc? = Keyword.get(opts, :garbage_collect, true)
{expr, cache} = precompile(fun, vars, hooks)
[
Nx.Defn.Stream.start_link(input, acc, fn input_params, acc ->
acc_params = [acc] |> Nx.Defn.Composite.flatten_list() |> Enum.map(&fn -> &1 end)
params = input_params ++ acc_params ++ rest_params
expr
|> composite_eval(%{params: params, gc: gc?}, [cache])
|> elem(0)
end)
]
end
@impl true
def __jit__(key, vars, fun, args_list, opts) do
__compile__(key, vars, fun, opts).(args_list)
end
@impl true
def __compile__(_key, vars, fun, opts) do
hooks = Keyword.get(opts, :hooks, %{})
gc? = Keyword.get(opts, :garbage_collect, true)
{expr, cache} = precompile(fun, vars, hooks)
fn [params] ->
[
expr
|> composite_eval(%{params: params, gc: gc?}, [cache])
|> elem(0)
]
end
end
defp precompile(fun, vars, hooks) do
expr = fun.(vars)
state = %{hooks: hooks, parent_ids: nil, current_ids: nil}
cache = init_compute_cache(expr, state)
{expr, cache}
end
defp init_compute_cache(expr, state) do
state = %{state | parent_ids: %{}, current_ids: Tree.scope_ids(expr, %{})}
composite_compute_cache(expr, state, %{})
end
defp composite_compute_cache(expr, state, cache) do
Composite.reduce(expr, cache, &compute_cache(&1, state, &2))
end
defp compute_cache(%Nx.Tensor{data: %Expr{op: :constant}}, _state, cache) do
cache
end
defp compute_cache(%Nx.Tensor{data: %Expr{op: :metadata, args: [expr, _meta]}}, state, cache) do
compute_cache(expr, state, cache)
end
defp compute_cache(%Nx.Tensor{data: %Expr{id: id, op: op}} = tensor, state, cache) do
case state.parent_ids do
# If the id exists in the parent, the parent will compute it.
%{^id => _} ->
Map.put_new(cache, id, tensor)
%{} ->
case cache do
%{^id => counter} -> %{cache | id => counter + 1}
%{} -> compute_cache(op, tensor, state, Map.put(cache, id, 1))
end
end
end
defp compute_cache(:fun, %{data: %Expr{id: id, args: args}}, state, cache) do
[_args, expr, _mfa] = args
fun_cache = init_compute_cache(expr, state)
Map.put(cache, [:fun | id], fun_cache)
end
defp compute_cache(:while, %{data: %Expr{args: args, id: id}}, state, cache) do
[initial, _arg, pred, block] = args
cache = composite_compute_cache(initial, state, cache)
while_cache = init_compute_cache({pred, block}, state)
Map.put(cache, [:while | id], while_cache)
end
defp compute_cache(:optional, %{data: %Expr{args: args, id: id}}, state, cache) do
[call, expr] = args
%{data: %{args: call_args, op: call_name}} = call
cache = Enum.reduce(call.data.args, cache, &compute_cache(&1, state, &2))
key = computation_key(call_name, call_args)
{optional_expr_cache, cache} =
case cache do
%{^key => optional_expr_cache} ->
{optional_expr_cache, cache}
%{} ->
optional_expr_cache = {expr, init_compute_cache(expr, state)}
{optional_expr_cache, Map.put(cache, key, optional_expr_cache)}
end
Map.put(cache, [:optional | id], optional_expr_cache)
end
defp compute_cache(:cond, %{data: %Expr{args: [clauses, last], id: id}}, state, cache) do
%{parent_ids: parent_ids, current_ids: current_ids} = state
clause_caches =
Enum.map([last | clauses], fn clause ->
state = %{
state
| parent_ids: current_ids,
current_ids: Tree.scope_ids(clause, current_ids)
}
composite_compute_cache(clause, state, %{})
end)
# Now, for each cache, split the IDs from parents from the actual cond IDs
{[last_cache | clauses_cache], {all_ids, cache}} =
Enum.map_reduce(clause_caches, {%{}, cache}, fn clause_cache, seen_ids_cache ->
{clause_cache, seen_ids_cache} =
Enum.flat_map_reduce(clause_cache, seen_ids_cache, fn
{id, %_{} = tensor}, {seen_ids, cache} ->
case seen_ids do
# We have already processed this id for the whole cond
%{^id => _} ->
{[], {seen_ids, cache}}
# The ID belongs to our own parents
%{} when is_map_key(parent_ids, id) ->
{[], {seen_ids, Map.put_new(cache, id, tensor)}}
# The ID belongs to us
%{} ->
cache = composite_compute_cache(tensor, state, cache)
{[], {Map.put(seen_ids, id, true), cache}}
end
{id, counter}, seen_ids_cache ->
{[{id, counter}], seen_ids_cache}
end)
{Map.new(clause_cache), seen_ids_cache}
end)
Map.put(cache, [:cond | id], {clauses_cache, last_cache, Map.keys(all_ids)})
end
defp compute_cache(:token, %{data: %Expr{args: [token], id: id}}, state, cache) do
hooks = state.hooks
{hooks, cache} =
Enum.map_reduce(token.hooks, cache, fn
%{callback: callback, expr: expr, name: name}, cache ->
hook_fun = hooks[name] || callback
cond do
hook_fun -> {hook_fun, composite_compute_cache(expr, state, cache)}
Tree.has_hooks?(expr, hooks) -> {true, composite_compute_cache(expr, state, cache)}
true -> {false, cache}
end
end)
Map.put(cache, [:token | id], hooks)
end
defp compute_cache(_op, tensor, state, cache) do
{_, acc} = Tree.apply_args(tensor, cache, &{&1, compute_cache(&1, state, &2)})
acc
end
defp computation_key(op, args) do
keys =
Enum.map(args, fn
%Nx.Tensor{shape: shape, names: names, type: type} -> {type, shape, names}
opts -> opts
end)
{op, keys}
end
## Evaluation
defp eval(%Nx.Tensor{data: %Expr{op: :tensor, args: [t]}}, _state, caches) do
{t, caches}
end
defp eval(%Nx.Tensor{data: %Expr{op: :constant, args: [constant]}} = ans, _state, caches) do
{backend, backend_options} = Nx.default_backend()
{backend.constant(ans, constant, backend_options), caches}
end
defp eval(%Nx.Tensor{data: %Expr{op: :metadata, args: [expr, _meta]}}, state, caches) do
eval(expr, state, caches)
end
defp eval(%Nx.Tensor{data: %Expr{op: op, id: id}} = ans, state, [cache | caches]) do
case cache do
%{^id => count} when is_integer(count) ->
{res, [cache | caches]} = eval_apply(op, ans, state, [cache | caches])
state.gc && :erlang.garbage_collect(self())
{res, [decrement_cache(cache, id, count, res) | caches]}
%{^id => {count, res}} ->
{res, [decrement_cache(cache, id, count, res) | caches]}
%{} ->
# If we don't find the tensor in the current scope,
# it may be in a parent scope, so look up. If we find
# it in the parent, we don't decrement it, as that will
# be done at the end of processing the current scope.
eval_parent(caches, id, op, ans, state, [cache])
end
end
defp eval(other, _state, [_ | _] = caches) do
{other, caches}
end
defp decrement_cache(cache, id, 1, _res), do: Map.delete(cache, id)
defp decrement_cache(cache, id, counter, res), do: %{cache | id => {counter - 1, res}}
defp eval_parent([cache | caches], id, op, ans, state, acc) do
case cache do
%{^id => {_count, res}} ->
{res, Enum.reverse(acc, [cache | caches])}
%{^id => count} when is_integer(count) ->
{res, [cache | caches]} = eval_apply(op, ans, state, [cache | caches])
state.gc && :erlang.garbage_collect(self())
{res, Enum.reverse(acc, [Map.put(cache, id, {count, res}) | caches])}
%{} ->
eval_parent(caches, id, op, ans, state, [cache | acc])
end
end
defp eval_parent([], _id, _op, ans, _state, _acc) do
raise "trying to read evaluator cache that has expired during expression:\n\n#{inspect(ans)}\n\n" <>
"Please report this bug with the relevant code that triggers it: https://github.com/elixir-nx/nx"
end
defp decrement_parents([cache | caches], id) do
case cache do
%{^id => {count, value}} -> [decrement_cache(cache, id, count, value) | caches]
%{^id => count} -> [%{cache | id => count - 1} | caches]
%{} -> [cache | decrement_parents(caches, id)]
end
end
defp eval_apply(:parameter, %{data: %Expr{args: [i]}}, state, caches) do
case Enum.fetch!(state.params, i).() do
%Nx.Tensor{data: %Nx.Defn.Expr{}} = tensor ->
raise ArgumentError,
"cannot pass a tensor expression as argument to defn, got: #{inspect(tensor)}"
%Nx.Tensor{} = tensor ->
{tensor, caches}
end
end
defp eval_apply(:elem, %Nx.Tensor{data: %Expr{args: [tuple, i]}}, state, caches) do
{tuple, caches} = composite_eval(tuple, state, caches)
{elem(tuple, i), caches}
end
defp eval_apply(:attach_token, %Nx.Tensor{data: %Expr{args: [token, expr]}}, state, caches) do
{_, caches} = eval(token, state, caches)
eval(expr, state, caches)
end
defp eval_apply(:fun, %{data: %Expr{args: [args, expr, _mfa], id: id}}, state, caches) do
{fun_cache, caches} = pop_cache!(caches, [:fun | id])
fun =
case length(args) do
1 ->
fn arg1 ->
params = [fn -> Nx.to_tensor(arg1) end]
{result, _} = composite_eval(expr, %{state | params: params}, [fun_cache])
result
end
2 ->
fn arg1, arg2 ->
params = [fn -> Nx.to_tensor(arg1) end, fn -> Nx.to_tensor(arg2) end]
{result, _} = composite_eval(expr, %{state | params: params}, [fun_cache])
result
end
end
{fun, caches}
end
defp eval_apply(:cond, %{data: %Expr{args: [clauses, last], id: id}}, state, caches) do
{{clauses_cache, last_cache, parent_ids}, caches} = pop_cache!(caches, [:cond | id])
{chosen, chosen_cache} =
clauses
|> Enum.zip(clauses_cache)
|> cond_clause(last, last_cache, state, caches)
{res, [_ | caches]} = composite_eval(chosen, state, chosen_cache)
caches = Enum.reduce(parent_ids, caches, &decrement_parents(&2, &1))
{res, caches}
end
defp eval_apply(:while, %{data: %Expr{args: args, id: id}}, state, caches) do
[initial, _arg, condition, block] = args
{initial, caches} = composite_eval(initial, state, caches)
{while_cache, caches} = pop_cache!(caches, [:while | id])
{while(initial, condition, block, state, [while_cache]), caches}
end
defp eval_apply(:token, %{data: %Expr{args: [token], id: id}}, state, caches) do
{hooks, caches} = pop_cache!(caches, [:token | id])
caches =
token.hooks
|> Enum.zip(hooks)
|> List.foldr(caches, fn
{%{expr: expr}, true}, caches ->
{_expr, caches} = composite_eval(expr, state, caches)
caches
{%{}, false}, caches ->
caches
{%{expr: expr}, hook_fun}, caches ->
{res, caches} = composite_eval(expr, state, caches)
hook_fun.(res)
caches
end)
{{}, caches}
end
defp eval_apply(:optional, %{data: %Expr{args: [call, _], id: id}}, state, caches) do
{args, caches} = Tree.apply_args(call, caches, &eval(&1, state, &2))
backend = Nx.Shared.list_impl!(args)
if function_exported?(backend, call.data.op, length(args) + 1) do
{apply(backend, call.data.op, [call | args]), caches}
else
params = Enum.map(args, &fn -> &1 end)
{{expr, optional_cache}, caches} = pop_cache!(caches, [:optional | id])
{res, _} = eval(expr, %{state | params: params}, [optional_cache])
{res, caches}
end
end
defp eval_apply(op, ans, state, caches) do
{args, caches} = Tree.apply_args(ans, caches, &eval(&1, state, &2))
{mod, args} =
cond do
op in @creation_ops ->
{backend, backend_options} = Nx.default_backend()
{backend, [ans | args] ++ [backend_options]}
op in @random_ops ->
{_backend, backend_options} = Nx.default_backend()
{Nx.Shared.list_impl!(args), [ans | args] ++ [backend_options]}
op in @list_ops ->
{Nx.Shared.list_impl!(hd(args)), [ans | args]}
op in @indices_ops ->
[tensor, indices | _] = args
{Nx.Shared.list_impl!([tensor | indices]), [ans | args]}
match?({:tuple, _}, ans.type) ->
{Nx.Shared.list_impl!(args), args}
true ->
{Nx.Shared.list_impl!(args), [ans | args]}
end
{apply(mod, op, args), caches}
end
defp pop_cache!([cache | caches], key) do
{value, cache} = Map.pop!(cache, key)
{value, [cache | caches]}
end
## Control flow helpers
defp while(acc, condition, block, state, caches) do
state = %{state | params: composite_to_params(acc)}
{pred, temp} = eval(condition, state, caches)
if Nx.to_number(pred) != 0 do
{acc, _} = composite_eval(block, state, temp)
while(acc, condition, block, state, caches)
else
acc
end
end
defp cond_clause([{{pred, body}, cache} | clauses], last, last_cache, state, caches) do
{pred, pred_caches} = eval(pred, state, [cache | caches])
if Nx.to_number(pred) != 0,
do: {body, pred_caches},
else: cond_clause(clauses, last, last_cache, state, caches)
end
defp cond_clause([], last, last_cache, _state, caches) do
{last, [last_cache | caches]}
end
## Composite
defp composite_eval(composite, state, caches) do
Composite.traverse(composite, caches, &eval(&1, state, &2))
end
defp composite_to_params(composite) do
composite |> composite_to_params([]) |> Enum.reverse()
end
defp composite_to_params(tuple, acc) when is_tuple(tuple) do
Enum.reduce(Tuple.to_list(tuple), acc, &composite_to_params/2)
end
defp composite_to_params(other, acc) do
[fn -> other end | acc]
end
end