github.com/mtsmfm/go/src@v0.0.0-20221020090648-44bdcb9f8fde/net/parse.go (about) 1 // Copyright 2009 The Go Authors. All rights reserved. 2 // Use of this source code is governed by a BSD-style 3 // license that can be found in the LICENSE file. 4 5 // Simple file i/o and string manipulation, to avoid 6 // depending on strconv and bufio and strings. 7 8 package net 9 10 import ( 11 "internal/bytealg" 12 "io" 13 "os" 14 "time" 15 ) 16 17 type file struct { 18 file *os.File 19 data []byte 20 atEOF bool 21 } 22 23 func (f *file) close() { f.file.Close() } 24 25 func (f *file) getLineFromData() (s string, ok bool) { 26 data := f.data 27 i := 0 28 for i = 0; i < len(data); i++ { 29 if data[i] == '\n' { 30 s = string(data[0:i]) 31 ok = true 32 // move data 33 i++ 34 n := len(data) - i 35 copy(data[0:], data[i:]) 36 f.data = data[0:n] 37 return 38 } 39 } 40 if f.atEOF && len(f.data) > 0 { 41 // EOF, return all we have 42 s = string(data) 43 f.data = f.data[0:0] 44 ok = true 45 } 46 return 47 } 48 49 func (f *file) readLine() (s string, ok bool) { 50 if s, ok = f.getLineFromData(); ok { 51 return 52 } 53 if len(f.data) < cap(f.data) { 54 ln := len(f.data) 55 n, err := io.ReadFull(f.file, f.data[ln:cap(f.data)]) 56 if n >= 0 { 57 f.data = f.data[0 : ln+n] 58 } 59 if err == io.EOF || err == io.ErrUnexpectedEOF { 60 f.atEOF = true 61 } 62 } 63 s, ok = f.getLineFromData() 64 return 65 } 66 67 func open(name string) (*file, error) { 68 fd, err := os.Open(name) 69 if err != nil { 70 return nil, err 71 } 72 return &file{fd, make([]byte, 0, 64*1024), false}, nil 73 } 74 75 func stat(name string) (mtime time.Time, size int64, err error) { 76 st, err := os.Stat(name) 77 if err != nil { 78 return time.Time{}, 0, err 79 } 80 return st.ModTime(), st.Size(), nil 81 } 82 83 // Count occurrences in s of any bytes in t. 84 func countAnyByte(s string, t string) int { 85 n := 0 86 for i := 0; i < len(s); i++ { 87 if bytealg.IndexByteString(t, s[i]) >= 0 { 88 n++ 89 } 90 } 91 return n 92 } 93 94 // Split s at any bytes in t. 95 func splitAtBytes(s string, t string) []string { 96 a := make([]string, 1+countAnyByte(s, t)) 97 n := 0 98 last := 0 99 for i := 0; i < len(s); i++ { 100 if bytealg.IndexByteString(t, s[i]) >= 0 { 101 if last < i { 102 a[n] = s[last:i] 103 n++ 104 } 105 last = i + 1 106 } 107 } 108 if last < len(s) { 109 a[n] = s[last:] 110 n++ 111 } 112 return a[0:n] 113 } 114 115 func getFields(s string) []string { return splitAtBytes(s, " \r\t\n") } 116 117 // Bigger than we need, not too big to worry about overflow 118 const big = 0xFFFFFF 119 120 // Decimal to integer. 121 // Returns number, characters consumed, success. 122 func dtoi(s string) (n int, i int, ok bool) { 123 n = 0 124 for i = 0; i < len(s) && '0' <= s[i] && s[i] <= '9'; i++ { 125 n = n*10 + int(s[i]-'0') 126 if n >= big { 127 return big, i, false 128 } 129 } 130 if i == 0 { 131 return 0, 0, false 132 } 133 return n, i, true 134 } 135 136 // Hexadecimal to integer. 137 // Returns number, characters consumed, success. 138 func xtoi(s string) (n int, i int, ok bool) { 139 n = 0 140 for i = 0; i < len(s); i++ { 141 if '0' <= s[i] && s[i] <= '9' { 142 n *= 16 143 n += int(s[i] - '0') 144 } else if 'a' <= s[i] && s[i] <= 'f' { 145 n *= 16 146 n += int(s[i]-'a') + 10 147 } else if 'A' <= s[i] && s[i] <= 'F' { 148 n *= 16 149 n += int(s[i]-'A') + 10 150 } else { 151 break 152 } 153 if n >= big { 154 return 0, i, false 155 } 156 } 157 if i == 0 { 158 return 0, i, false 159 } 160 return n, i, true 161 } 162 163 // xtoi2 converts the next two hex digits of s into a byte. 164 // If s is longer than 2 bytes then the third byte must be e. 165 // If the first two bytes of s are not hex digits or the third byte 166 // does not match e, false is returned. 167 func xtoi2(s string, e byte) (byte, bool) { 168 if len(s) > 2 && s[2] != e { 169 return 0, false 170 } 171 n, ei, ok := xtoi(s[:2]) 172 return byte(n), ok && ei == 2 173 } 174 175 // Convert i to a hexadecimal string. Leading zeros are not printed. 176 func appendHex(dst []byte, i uint32) []byte { 177 if i == 0 { 178 return append(dst, '0') 179 } 180 for j := 7; j >= 0; j-- { 181 v := i >> uint(j*4) 182 if v > 0 { 183 dst = append(dst, hexDigit[v&0xf]) 184 } 185 } 186 return dst 187 } 188 189 // Number of occurrences of b in s. 190 func count(s string, b byte) int { 191 n := 0 192 for i := 0; i < len(s); i++ { 193 if s[i] == b { 194 n++ 195 } 196 } 197 return n 198 } 199 200 // Index of rightmost occurrence of b in s. 201 func last(s string, b byte) int { 202 i := len(s) 203 for i--; i >= 0; i-- { 204 if s[i] == b { 205 break 206 } 207 } 208 return i 209 } 210 211 // hasUpperCase tells whether the given string contains at least one upper-case. 212 func hasUpperCase(s string) bool { 213 for i := range s { 214 if 'A' <= s[i] && s[i] <= 'Z' { 215 return true 216 } 217 } 218 return false 219 } 220 221 // lowerASCIIBytes makes x ASCII lowercase in-place. 222 func lowerASCIIBytes(x []byte) { 223 for i, b := range x { 224 if 'A' <= b && b <= 'Z' { 225 x[i] += 'a' - 'A' 226 } 227 } 228 } 229 230 // lowerASCII returns the ASCII lowercase version of b. 231 func lowerASCII(b byte) byte { 232 if 'A' <= b && b <= 'Z' { 233 return b + ('a' - 'A') 234 } 235 return b 236 } 237 238 // trimSpace returns x without any leading or trailing ASCII whitespace. 239 func trimSpace(x []byte) []byte { 240 for len(x) > 0 && isSpace(x[0]) { 241 x = x[1:] 242 } 243 for len(x) > 0 && isSpace(x[len(x)-1]) { 244 x = x[:len(x)-1] 245 } 246 return x 247 } 248 249 // isSpace reports whether b is an ASCII space character. 250 func isSpace(b byte) bool { 251 return b == ' ' || b == '\t' || b == '\n' || b == '\r' 252 } 253 254 // removeComment returns line, removing any '#' byte and any following 255 // bytes. 256 func removeComment(line []byte) []byte { 257 if i := bytealg.IndexByte(line, '#'); i != -1 { 258 return line[:i] 259 } 260 return line 261 } 262 263 // foreachLine runs fn on each line of x. 264 // Each line (except for possibly the last) ends in '\n'. 265 // It returns the first non-nil error returned by fn. 266 func foreachLine(x []byte, fn func(line []byte) error) error { 267 for len(x) > 0 { 268 nl := bytealg.IndexByte(x, '\n') 269 if nl == -1 { 270 return fn(x) 271 } 272 line := x[:nl+1] 273 x = x[nl+1:] 274 if err := fn(line); err != nil { 275 return err 276 } 277 } 278 return nil 279 } 280 281 // foreachField runs fn on each non-empty run of non-space bytes in x. 282 // It returns the first non-nil error returned by fn. 283 func foreachField(x []byte, fn func(field []byte) error) error { 284 x = trimSpace(x) 285 for len(x) > 0 { 286 sp := bytealg.IndexByte(x, ' ') 287 if sp == -1 { 288 return fn(x) 289 } 290 if field := trimSpace(x[:sp]); len(field) > 0 { 291 if err := fn(field); err != nil { 292 return err 293 } 294 } 295 x = trimSpace(x[sp+1:]) 296 } 297 return nil 298 } 299 300 // stringsHasSuffix is strings.HasSuffix. It reports whether s ends in 301 // suffix. 302 func stringsHasSuffix(s, suffix string) bool { 303 return len(s) >= len(suffix) && s[len(s)-len(suffix):] == suffix 304 } 305 306 // stringsHasSuffixFold reports whether s ends in suffix, 307 // ASCII-case-insensitively. 308 func stringsHasSuffixFold(s, suffix string) bool { 309 return len(s) >= len(suffix) && stringsEqualFold(s[len(s)-len(suffix):], suffix) 310 } 311 312 // stringsHasPrefix is strings.HasPrefix. It reports whether s begins with prefix. 313 func stringsHasPrefix(s, prefix string) bool { 314 return len(s) >= len(prefix) && s[:len(prefix)] == prefix 315 } 316 317 // stringsEqualFold is strings.EqualFold, ASCII only. It reports whether s and t 318 // are equal, ASCII-case-insensitively. 319 func stringsEqualFold(s, t string) bool { 320 if len(s) != len(t) { 321 return false 322 } 323 for i := 0; i < len(s); i++ { 324 if lowerASCII(s[i]) != lowerASCII(t[i]) { 325 return false 326 } 327 } 328 return true 329 } 330 331 func readFull(r io.Reader) (all []byte, err error) { 332 buf := make([]byte, 1024) 333 for { 334 n, err := r.Read(buf) 335 all = append(all, buf[:n]...) 336 if err == io.EOF { 337 return all, nil 338 } 339 if err != nil { 340 return nil, err 341 } 342 } 343 }