forked from wundergraph/graphql-go-tools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
defer.go
154 lines (142 loc) · 3.96 KB
/
defer.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
package postprocess
import (
"github.com/jensneuse/graphql-go-tools/pkg/engine/plan"
"github.com/jensneuse/graphql-go-tools/pkg/engine/resolve"
"github.com/jensneuse/graphql-go-tools/pkg/lexer/literal"
)
type ProcessDefer struct {
objects []*resolve.Object
out *plan.StreamingResponsePlan
updated bool
}
func (p *ProcessDefer) Process(pre plan.Plan) plan.Plan {
p.out = nil
p.updated = false
p.objects = p.objects[:0]
switch in := pre.(type) {
case *plan.SynchronousResponsePlan:
return p.synchronousResponse(in)
case *plan.StreamingResponsePlan:
return p.processStreamingResponsePlan(in)
default:
return pre
}
}
func (p *ProcessDefer) processStreamingResponsePlan(in *plan.StreamingResponsePlan) plan.Plan {
p.out = in
for i := range p.out.Response.Patches {
p.traverseNode(p.out.Response.Patches[i].Value)
}
p.traverseNode(p.out.Response.InitialResponse.Data)
return p.out
}
func (p *ProcessDefer) synchronousResponse(pre *plan.SynchronousResponsePlan) plan.Plan {
p.out = &plan.StreamingResponsePlan{
FlushInterval: pre.FlushInterval,
Response: &resolve.GraphQLStreamingResponse{
InitialResponse: pre.Response,
FlushInterval: pre.FlushInterval,
},
}
p.traverseNode(p.out.Response.InitialResponse.Data)
if p.updated {
return p.out
}
return pre
}
func (p *ProcessDefer) traverseNode(node resolve.Node) {
switch n := node.(type) {
case *resolve.Object:
p.objects = append(p.objects, n)
for i := range n.Fields {
if n.Fields[i].Defer != nil {
p.updated = true
patchIndex, ok := p.createPatch(n, i)
if !ok {
continue
}
n.Fields[i].Defer = nil
n.Fields[i].Value = &resolve.Null{
Defer: resolve.Defer{
Enabled: true,
PatchIndex: patchIndex,
},
}
p.traverseNode(p.out.Response.Patches[patchIndex].Value)
} else {
p.traverseNode(n.Fields[i].Value)
}
}
p.objects = p.objects[:len(p.objects)-1]
case *resolve.Array:
p.traverseNode(n.Item)
}
}
func (p *ProcessDefer) createPatch(object *resolve.Object, field int) (int, bool) {
oldValue := object.Fields[field].Value
var patch *resolve.GraphQLResponsePatch
if object.Fields[field].HasBuffer && !p.bufferUsedOnNonDeferField(object, field, object.Fields[field].BufferID) {
patchFetch, ok := p.processFieldSetBuffer(object, field)
if !ok {
return 0, false
}
patch = &resolve.GraphQLResponsePatch{
Value: oldValue,
Fetch: &patchFetch,
Operation: literal.REPLACE,
}
object.Fields[field].HasBuffer = false
object.Fields[field].BufferID = 0
} else {
patch = &resolve.GraphQLResponsePatch{
Value: oldValue,
Operation: literal.REPLACE,
}
}
p.out.Response.Patches = append(p.out.Response.Patches, patch)
patchIndex := len(p.out.Response.Patches) - 1
return patchIndex, true
}
func (p *ProcessDefer) bufferUsedOnNonDeferField(object *resolve.Object, field, bufferID int) bool {
for i := range object.Fields {
if object.Fields[i].BufferID != bufferID {
continue
}
if i == field {
continue // skip currently evaluated field
}
if object.Fields[i].Defer == nil {
return true
}
}
return false
}
func (p *ProcessDefer) processFieldSetBuffer(object *resolve.Object, field int) (patchFetch resolve.SingleFetch, ok bool) {
id := object.Fields[field].BufferID
if p.objects[len(p.objects)-1].Fetch == nil {
return patchFetch, false
}
switch fetch := p.objects[len(p.objects)-1].Fetch.(type) {
case *resolve.SingleFetch:
if fetch.BufferId != id {
return patchFetch, false
}
patchFetch = *fetch
patchFetch.BufferId = 0
p.objects[len(p.objects)-1].Fetch = nil
return patchFetch, true
case *resolve.ParallelFetch:
for k := range fetch.Fetches {
if id == fetch.Fetches[k].BufferId {
patchFetch = *fetch.Fetches[k]
patchFetch.BufferId = 0
fetch.Fetches = append(fetch.Fetches[:k], fetch.Fetches[k+1:]...)
if len(fetch.Fetches) == 1 {
p.objects[len(p.objects)-1].Fetch = fetch.Fetches[0]
}
return patchFetch, true
}
}
}
return patchFetch, false
}