-
Notifications
You must be signed in to change notification settings - Fork 74k
/
graph.go
528 lines (476 loc) · 14.4 KB
/
graph.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
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
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
/*
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package tensorflow
// #include "tensorflow/c/c_api.h"
//
// #include <stdlib.h>
// #include <string.h>
//
// void TF_SetAttrShapeList_Helper(TF_OperationDescription* desc,
// const char* attr_name,
// const int64_t* flat_dims,
// const int* num_dims,
// int num_shapes) {
// const int64_t** dims =
// (const int64_t**)malloc(sizeof(const int64_t*) * num_shapes);
// int i = 0;
// for (i = 0; i < num_shapes; i++) {
// dims[i] = flat_dims;
// if (num_dims[i] > 0) {
// // flat_dims will be NULL iff num_shapes is 0 or all elements in num_dims are <= 0.
// flat_dims += num_dims[i];
// }
// }
// TF_SetAttrShapeList(desc, attr_name, dims, num_dims, num_shapes);
// free(dims);
// }
import "C"
import (
"fmt"
"io"
"runtime"
"unsafe"
)
// Graph represents a computation graph. Graphs may be shared between sessions.
type Graph struct {
c *C.TF_Graph
}
// The GraphImportOptions struct holds parameters for the ImportWithOptions function.
type GraphImportOptions struct {
// Node prefix
Prefix string
// Execution device
Device string
// inputMapping defines a mapping between Outputs in the graph
// and Outputs they should be replaced with.
inputMapping map[struct {
Name string
Index int
}]Output
// TODO: extend this structure to support more options from TF_ImportGraphDefOptions
}
// AddInputMapping adds a mapping between an Output in the imported graph
// and an Output in the destination graph that it should be replaced with,
// where src:srcIndex is the name of the Operation and Output index to
// replace and dst is the output to replace it with.
func (o *GraphImportOptions) AddInputMapping(src string, srcIndex int, dst Output) {
if o.inputMapping == nil {
o.inputMapping = make(map[struct {
Name string
Index int
}]Output)
}
o.inputMapping[struct {
Name string
Index int
}{src, srcIndex}] = dst
}
// NewGraph returns a new Graph.
func NewGraph() *Graph {
g := &Graph{C.TF_NewGraph()}
runtime.SetFinalizer(g, (*Graph).finalizer)
return g
}
func (g *Graph) finalizer() {
C.TF_DeleteGraph(g.c)
}
// WriteTo writes out a serialized representation of g to w.
//
// Implements the io.WriterTo interface.
func (g *Graph) WriteTo(w io.Writer) (int64, error) {
buf := C.TF_NewBuffer()
defer C.TF_DeleteBuffer(buf)
status := newStatus()
C.TF_GraphToGraphDef(g.c, buf, status.c)
if err := status.Err(); err != nil {
return 0, err
}
if buf.length > (1 << 30) {
// For very large graphs, the writes can be chunked.
// Punt on that for now.
return 0, fmt.Errorf("Graph is too large to write out, Graph.WriteTo needs to be updated")
}
// A []byte slice backed by C memory.
// See: https://github.com/golang/go/wiki/cgo#turning-c-arrays-into-go-slices
length := int(buf.length)
var slice []byte
if unsafe.Sizeof(unsafe.Pointer(nil)) == 8 {
slice = (*[1<<50 - 1]byte)(unsafe.Pointer(buf.data))[:length:length]
} else {
slice = (*[1 << 30]byte)(unsafe.Pointer(buf.data))[:length:length]
}
n, err := w.Write(slice)
return int64(n), err
}
// ImportWithOptions imports the nodes and edges from a serialized representation of
// another Graph into g.
//
// Multiple options can be specified for the newly imported nodes.
func (g *Graph) ImportWithOptions(def []byte, options GraphImportOptions) error {
cprefix := C.CString(options.Prefix)
defer C.free(unsafe.Pointer(cprefix))
opts := C.TF_NewImportGraphDefOptions()
defer C.TF_DeleteImportGraphDefOptions(opts)
C.TF_ImportGraphDefOptionsSetPrefix(opts, cprefix)
if len(options.Device) != 0 {
cdev := C.CString(options.Device)
defer C.free(unsafe.Pointer(cdev))
C.TF_ImportGraphDefOptionsSetDefaultDevice(opts, cdev)
}
for src, dst := range options.inputMapping {
cSrcName := C.CString(src.Name)
C.TF_ImportGraphDefOptionsAddInputMapping(opts, cSrcName, C.int(src.Index), dst.c())
C.free(unsafe.Pointer(cSrcName))
}
buf := C.TF_NewBuffer()
defer C.TF_DeleteBuffer(buf)
buf.length = C.size_t(len(def))
buf.data = C.CBytes(def)
if buf.data == nil {
return fmt.Errorf("unable to allocate memory")
}
defer C.free(buf.data)
status := newStatus()
C.TF_GraphImportGraphDef(g.c, buf, opts, status.c)
if err := status.Err(); err != nil {
return err
}
return nil
}
// Import imports the nodes and edges from a serialized representation of
// another Graph into g.
//
// Names of imported nodes will be prefixed with prefix.
func (g *Graph) Import(def []byte, prefix string) error {
return g.ImportWithOptions(def, GraphImportOptions{Prefix: prefix})
}
// Operation returns the Operation named name in the Graph, or nil if no such
// operation is present.
func (g *Graph) Operation(name string) *Operation {
cname := C.CString(name)
defer C.free(unsafe.Pointer(cname))
cop := C.TF_GraphOperationByName(g.c, cname)
if cop == nil {
return nil
}
return &Operation{cop, g}
}
// Operations returns a list of all operations in the graph
func (g *Graph) Operations() []Operation {
var pos C.size_t
ops := []Operation{}
for {
cop := C.TF_GraphNextOperation(g.c, &pos)
if cop == nil {
break
}
ops = append(ops, Operation{cop, g})
}
return ops
}
// AddGradients adds operations to compute the partial derivatives of the sum of tensors in y
// with respect to tensors in x, i.e., d(y[0] + y[1] + ...) / d x[0], d(y[0] + y[1] + ... ) / d x[1] etc.
//
// prefix, if non-empty, is the name prefix used for all operations added to the graph to compute
// these gradients.
func (g *Graph) AddGradients(prefix string, y []Output, x []Output, dx []Output) ([]Output, error) {
var (
cprefix *C.char
cy = make([]C.TF_Output, len(y))
cx = make([]C.TF_Output, len(x))
cdx = make([]C.TF_Output, len(dx))
cdy = make([]C.TF_Output, len(x))
pcy *C.TF_Output
pcx *C.TF_Output
pcdx *C.TF_Output
pcdy *C.TF_Output
status = newStatus()
)
if len(y) > 0 {
pcy = &cy[0]
for i, o := range y {
cy[i] = o.c()
}
}
if len(x) > 0 {
pcx = &cx[0]
for i, o := range x {
cx[i] = o.c()
}
pcdy = &cdy[0]
}
if len(dx) > 0 {
pcdx = &cdx[0]
for i, o := range dx {
cdx[i] = o.c()
}
}
// If prefix is "", the C.TF_AddGradientsWithPrefix need cprefix to be nil but not ""
if len(prefix) != 0 {
cprefix = C.CString(prefix)
defer C.free(unsafe.Pointer(cprefix))
}
C.TF_AddGradientsWithPrefix(g.c, cprefix, pcy, C.int(len(y)), pcx, C.int(len(x)), pcdx, status.c, pcdy)
if err := status.Err(); err != nil {
return nil, err
}
dy := make([]Output, len(x))
for i, co := range cdy {
op := &Operation{co.oper, g}
dy[i] = Output{op, int(co.index)}
}
return dy, nil
}
// OpSpec is the specification of an Operation to be added to a Graph
// (using Graph.AddOperation).
type OpSpec struct {
// Type of the operation (e.g., "Add", "MatMul").
Type string
// Name by which the added operation will be referred to in the Graph.
// If omitted, defaults to Type.
Name string
// Inputs to this operation, which in turn must be outputs
// of other operations already added to the Graph.
//
// An operation may have multiple inputs with individual inputs being
// either a single tensor produced by another operation or a list of
// tensors produced by multiple operations. For example, the "Concat"
// operation takes two inputs: (1) the dimension along which to
// concatenate and (2) a list of tensors to concatenate. Thus, for
// Concat, len(Input) must be 2, with the first element being an Output
// and the second being an OutputList.
Input []Input
// Map from attribute name to its value that will be attached to this
// operation.
Attrs map[string]interface{}
// Operations that must be executed before executing the operation
// being added.
ControlDependencies []*Operation
// The device on which the operation should be executed.
// If omitted, an appropriate device will automatically be selected.
//
// For example, if set of "/device:GPU:0", then the operation will
// execute on GPU #0.
Device string
// Other possible fields: ColocateWith.
}
// AddOperation adds an operation to g.
func (g *Graph) AddOperation(args OpSpec) (*Operation, error) {
if args.Name == "" {
args.Name = args.Type
}
cname := C.CString(args.Name)
ctype := C.CString(args.Type)
cdesc := C.TF_NewOperation(g.c, ctype, cname)
C.free(unsafe.Pointer(cname))
C.free(unsafe.Pointer(ctype))
for _, in := range args.Input {
switch in := in.(type) {
case Output:
C.TF_AddInput(cdesc, in.c())
case OutputList:
size := len(in)
list := make([]C.TF_Output, size)
for i, v := range in {
list[i] = v.c()
}
if size > 0 {
C.TF_AddInputList(cdesc, &list[0], C.int(size))
} else {
C.TF_AddInputList(cdesc, nil, 0)
}
}
}
for _, in := range args.ControlDependencies {
C.TF_AddControlInput(cdesc, in.c)
}
status := newStatus()
for name, value := range args.Attrs {
if err := setAttr(cdesc, status, name, value); err != nil {
// Memory leak here as the TF_OperationDescription
// object will not be cleaned up. At the time of this
// writing, this was next to impossible since it
// required value to be a string tensor with
// incorrectly encoded strings. Given this rarity, live
// with the memory leak. If it becomes a real problem,
// consider adding a TF_DeleteOperationDescription
// function to the C API.
return nil, fmt.Errorf("%v (memory will be leaked)", err)
}
}
if len(args.Device) > 0 {
cdevice := C.CString(args.Device)
C.TF_SetDevice(cdesc, cdevice)
C.free(unsafe.Pointer(cdevice))
}
c := C.TF_FinishOperation(cdesc, status.c)
if err := status.Err(); err != nil {
return nil, err
}
return &Operation{c, g}, nil
}
func setAttr(cdesc *C.TF_OperationDescription, status *status, name string, value interface{}) error {
cAttrName := C.CString(name)
defer C.free(unsafe.Pointer(cAttrName))
switch value := value.(type) {
case string:
cstr := C.CString(value)
C.TF_SetAttrString(cdesc, cAttrName, unsafe.Pointer(cstr), C.size_t(len(value)))
C.free(unsafe.Pointer(cstr))
case []string:
size := len(value)
list := make([]unsafe.Pointer, size)
lens := make([]C.size_t, size)
for i, s := range value {
list[i] = unsafe.Pointer(C.CString(s))
lens[i] = C.size_t(len(s))
}
if size > 0 {
C.TF_SetAttrStringList(cdesc, cAttrName, &list[0], &lens[0], C.int(size))
} else {
C.TF_SetAttrStringList(cdesc, cAttrName, nil, nil, 0)
}
for _, s := range list {
C.free(s)
}
case int64:
C.TF_SetAttrInt(cdesc, cAttrName, C.int64_t(value))
case []int64:
size := len(value)
list := make([]C.int64_t, size)
for i, v := range value {
list[i] = C.int64_t(v)
}
if size > 0 {
C.TF_SetAttrIntList(cdesc, cAttrName, &list[0], C.int(size))
} else {
C.TF_SetAttrIntList(cdesc, cAttrName, nil, 0)
}
case float32:
C.TF_SetAttrFloat(cdesc, cAttrName, C.float(value))
case []float32:
size := len(value)
list := make([]C.float, size)
for i, v := range value {
list[i] = C.float(v)
}
if size > 0 {
C.TF_SetAttrFloatList(cdesc, cAttrName, &list[0], C.int(size))
} else {
C.TF_SetAttrFloatList(cdesc, cAttrName, nil, 0)
}
case bool:
v := C.uchar(0)
if value {
v = 1
}
C.TF_SetAttrBool(cdesc, cAttrName, v)
case []bool:
size := len(value)
list := make([]C.uchar, size)
for i, v := range value {
if v {
list[i] = 1
}
}
if size > 0 {
C.TF_SetAttrBoolList(cdesc, cAttrName, &list[0], C.int(size))
} else {
C.TF_SetAttrBoolList(cdesc, cAttrName, nil, 0)
}
case DataType:
C.TF_SetAttrType(cdesc, cAttrName, C.TF_DataType(value))
case []DataType:
var list *C.TF_DataType
if len(value) > 0 {
list = (*C.TF_DataType)(&value[0])
}
C.TF_SetAttrTypeList(cdesc, cAttrName, list, C.int(len(value)))
case *Tensor:
C.TF_SetAttrTensor(cdesc, cAttrName, value.c, status.c)
if err := status.Err(); err != nil {
return fmt.Errorf("bad value for attribute %q: %v", name, err)
}
case []*Tensor:
size := len(value)
list := make([]*C.TF_Tensor, size)
for i, v := range value {
list[i] = v.c
}
var plist **C.TF_Tensor
if size > 0 {
plist = &list[0]
}
C.TF_SetAttrTensorList(cdesc, cAttrName, plist, C.int(size), status.c)
if err := status.Err(); err != nil {
return fmt.Errorf("bad value for attribute %q: %v", name, err)
}
case Shape:
ndims := C.int(value.NumDimensions())
var dimsp *C.int64_t
if ndims > 0 {
dims := make([]C.int64_t, ndims)
for i, d := range value.dims {
dims[i] = C.int64_t(d)
}
dimsp = &dims[0]
}
C.TF_SetAttrShape(cdesc, cAttrName, dimsp, ndims)
case []Shape:
if len(value) == 0 {
C.TF_SetAttrShapeList(cdesc, cAttrName, nil, nil, 0)
} else {
var flatDims []C.int64_t
ndims := make([]C.int, len(value))
for i, s := range value {
nd := s.NumDimensions()
ndims[i] = C.int(nd)
for _, d := range s.dims {
flatDims = append(flatDims, C.int64_t(d))
}
}
var flatDimsp *C.int64_t
if len(flatDims) > 0 {
flatDimsp = &flatDims[0]
}
C.TF_SetAttrShapeList_Helper(cdesc, cAttrName, flatDimsp, &ndims[0], C.int(len(value)))
}
default:
return fmt.Errorf("attribute %q has a type (%T) which is not valid for operation attributes", name, value)
}
return nil
}
type LibraryHandler struct {
cptr *C.TF_Library
}
// Load library content into current context, useful to load ops implementation into non-monolithic TF build. Returns LibraryHandler or nil and error
func LoadLibrary(path string) (*LibraryHandler, error) {
status := newStatus()
cpath := C.CString(path)
defer C.free(unsafe.Pointer(cpath))
cptr := C.TF_LoadLibrary(cpath, status.c)
if cptr == nil || status.Code() != C.TF_OK {
return nil, fmt.Errorf("could not load library %s: code: %d, error: %s", path, status.Code(), status.String())
}
lh := &LibraryHandler{
cptr: cptr,
}
runtime.SetFinalizer(lh, (*LibraryHandler).free)
return lh, nil
}
func (lh *LibraryHandler) free() {
if lh == nil || lh.cptr == nil {
return
}
C.TF_DeleteLibraryHandle(lh.cptr)
}