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
|
package http
import (
"net/http"
"os"
)
// MaxLevel defines maximum tree depth for incoming request data and files.
const MaxLevel = 127
type dataTree map[string]interface{}
type fileTree map[string]interface{}
// parseData parses incoming request body into data tree.
func parseData(r *http.Request) dataTree {
data := make(dataTree)
if r.PostForm != nil {
for k, v := range r.PostForm {
data.push(k, v)
}
}
if r.MultipartForm != nil {
for k, v := range r.MultipartForm.Value {
data.push(k, v)
}
}
return data
}
// pushes value into data tree.
func (d dataTree) push(k string, v []string) {
keys := fetchIndexes(k)
if len(keys) <= MaxLevel {
d.mount(keys, v)
}
}
// mount mounts data tree recursively.
func (d dataTree) mount(i []string, v []string) {
if len(i) == 1 {
// single value context
d[i[0]] = v[0]
return
}
if len(i) == 2 && i[1] == "" {
// non associated array of elements
d[i[0]] = v
return
}
if p, ok := d[i[0]]; ok {
p.(dataTree).mount(i[1:], v)
return
}
d[i[0]] = make(dataTree)
d[i[0]].(dataTree).mount(i[1:], v)
}
// parse incoming dataTree request into JSON (including contentMultipart form dataTree)
func parseUploads(r *http.Request, cfg *UploadsConfig) *Uploads {
u := &Uploads{
cfg: cfg,
tree: make(fileTree),
list: make([]*FileUpload, 0),
}
for k, v := range r.MultipartForm.File {
files := make([]*FileUpload, 0, len(v))
for _, f := range v {
files = append(files, NewUpload(f))
}
u.list = append(u.list, files...)
u.tree.push(k, files)
}
return u
}
// exists if file exists.
func exists(path string) bool {
_, err := os.Stat(path)
if err == nil {
return true
}
if os.IsNotExist(err) {
return false
}
return false
}
// pushes new file upload into it's proper place.
func (d fileTree) push(k string, v []*FileUpload) {
keys := fetchIndexes(k)
if len(keys) <= MaxLevel {
d.mount(keys, v)
}
}
// mount mounts data tree recursively.
func (d fileTree) mount(i []string, v []*FileUpload) {
if len(i) == 1 {
// single value context
d[i[0]] = v[0]
return
}
if len(i) == 2 && i[1] == "" {
// non associated array of elements
d[i[0]] = v
return
}
if p, ok := d[i[0]]; ok {
p.(fileTree).mount(i[1:], v)
return
}
d[i[0]] = make(fileTree)
d[i[0]].(fileTree).mount(i[1:], v)
}
// fetchIndexes parses input name and splits it into separate indexes list.
func fetchIndexes(s string) []string {
var (
pos int
ch string
keys = make([]string, 1)
)
for _, c := range s {
ch = string(c)
switch ch {
case " ":
// ignore all spaces
continue
case "[":
pos = 1
continue
case "]":
if pos == 1 {
keys = append(keys, "")
}
pos = 2
default:
if pos == 1 || pos == 2 {
keys = append(keys, "")
}
keys[len(keys)-1] += ch
pos = 0
}
}
return keys
}
|
