-
Notifications
You must be signed in to change notification settings - Fork 91
/
rasp.go
225 lines (208 loc) · 3.86 KB
/
rasp.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
package main
func rinit(r *Rasp) {
r.nrunes = 0
r.sect = nil
}
func free(interface{}) {}
func rclear(r *Rasp) {
var ns *Section
for s := r.sect; s != nil; s = ns {
ns = s.next
free(s.text)
free(s)
}
r.sect = nil
}
func rsinsert(r *Rasp, s *Section) *Section {
t := new(Section)
if r.sect == s { /* includes empty list case: r->sect==s==0 */
r.sect = t
t.next = s
} else {
u := r.sect
if u == nil {
panic("rsinsert 1")
}
for {
if u.next == s {
t.next = s
u.next = t
goto Return
}
u = u.next
if u == nil {
break
}
}
panic("rsinsert 2")
}
Return:
return t
}
func rsdelete(r *Rasp, s *Section) {
if s == nil {
panic("rsdelete")
}
if r.sect == s {
r.sect = s.next
goto Free
}
for t := r.sect; t != nil; t = t.next {
if t.next == s {
t.next = s.next
goto Free
}
}
panic("rsdelete 2")
Free:
if s.text != nil {
free(s.text)
}
free(s)
}
func splitsect(r *Rasp, s *Section, n0 int) {
if s == nil {
panic("splitsect")
}
rsinsert(r, s.next)
if s.text == nil {
s.next.text = nil
} else {
s.next.text = make([]rune, TBLOCKSIZE)
copy(s.next.text, s.text[n0:s.nrunes])
}
s.next.nrunes = s.nrunes - n0
s.nrunes = n0
}
func findsect(r *Rasp, s *Section, p int, q int) *Section {
if s == nil && p != q {
panic("findsect")
}
for ; s != nil && p+s.nrunes <= q; s = s.next {
p += s.nrunes
}
if p != q {
splitsect(r, s, q-p)
s = s.next
}
return s
}
func rresize(r *Rasp, a int, old int, new int) {
s := findsect(r, r.sect, 0, a)
t := findsect(r, s, a, a+old)
var ns *Section
for ; s != t; s = ns {
ns = s.next
rsdelete(r, s)
}
/* now insert the new piece before t */
if new > 0 {
ns = rsinsert(r, t)
ns.nrunes = new
ns.text = nil
}
r.nrunes += new - old
}
func rdata(r *Rasp, p0 int, p1 int, cp []rune) {
s := findsect(r, r.sect, 0, p0)
t := findsect(r, s, p0, p1)
var ns *Section
for ; s != t; s = ns {
ns = s.next
if s.text != nil {
panic("rdata")
}
rsdelete(r, s)
}
p1 -= p0
s = rsinsert(r, t)
s.text = make([]rune, TBLOCKSIZE)
copy(s.text, cp[:p1])
s.nrunes = p1
}
func rclean(r *Rasp) {
for s := r.sect; s != nil; s = s.next {
for s.next != nil && (s.text != nil) == (s.next.text != nil) {
if s.text != nil {
if s.nrunes+s.next.nrunes > TBLOCKSIZE {
break
}
copy(s.text[s.nrunes:s.nrunes+s.next.nrunes], s.next.text[:s.next.nrunes])
}
s.nrunes += s.next.nrunes
rsdelete(r, s.next)
}
}
}
var raspbuf []rune
func rload(r *Rasp, p0 int, p1 int) []rune {
for cap(raspbuf) < p1-p0 {
raspbuf = append(raspbuf[:cap(raspbuf)], 0)
}
p := 0
s := r.sect
for ; s != nil && p+s.nrunes <= p0; s = s.next {
p += s.nrunes
}
nb := 0
for p < p1 && s != nil {
/*
* Subtle and important. If we are preparing to handle an 'rdata'
* call, it's because we have an 'rresize' hole here, so the
* screen doesn't have data for that space anyway (it got cut
* first). So pretend it isn't there.
*/
if s.text != nil {
n := s.nrunes - (p0 - p)
if n > p1-p0 { /* all in this section */
n = p1 - p0
}
copy(raspbuf[nb:nb+n], s.text[p0-p:])
nb += n
}
p += s.nrunes
p0 = p
s = s.next
}
return raspbuf[:nb]
}
func rmissing(r *Rasp, p0 int, p1 int) int {
p := 0
s := r.sect
for ; s != nil && p+s.nrunes <= p0; s = s.next {
p += s.nrunes
}
nm := 0
for p < p1 && s != nil {
if s.text == nil {
n := s.nrunes - (p0 - p)
if n > p1-p0 { /* all in this section */
n = p1 - p0
}
nm += n
}
p += s.nrunes
p0 = p
s = s.next
}
return nm
}
func rcontig(r *Rasp, p0 int, p1 int, text bool) int {
p := 0
s := r.sect
for ; s != nil && p+s.nrunes <= p0; s = s.next {
p += s.nrunes
}
np := 0
for p < p1 && s != nil && text == (s.text != nil) {
n := s.nrunes - (p0 - p)
if n > p1-p0 { /* all in this section */
n = p1 - p0
}
np += n
p += s.nrunes
p0 = p
s = s.next
}
return np
}