(data []byte)
| 3284 | return nil |
| 3285 | } |
| 3286 | func skipNode(data []byte) (n int, err error) { |
| 3287 | l := len(data) |
| 3288 | iNdEx := 0 |
| 3289 | for iNdEx < l { |
| 3290 | var wire uint64 |
| 3291 | for shift := uint(0); ; shift += 7 { |
| 3292 | if shift >= 64 { |
| 3293 | return 0, ErrIntOverflowNode |
| 3294 | } |
| 3295 | if iNdEx >= l { |
| 3296 | return 0, io.ErrUnexpectedEOF |
| 3297 | } |
| 3298 | b := data[iNdEx] |
| 3299 | iNdEx++ |
| 3300 | wire |= (uint64(b) & 0x7F) << shift |
| 3301 | if b < 0x80 { |
| 3302 | break |
| 3303 | } |
| 3304 | } |
| 3305 | wireType := int(wire & 0x7) |
| 3306 | switch wireType { |
| 3307 | case 0: |
| 3308 | for shift := uint(0); ; shift += 7 { |
| 3309 | if shift >= 64 { |
| 3310 | return 0, ErrIntOverflowNode |
| 3311 | } |
| 3312 | if iNdEx >= l { |
| 3313 | return 0, io.ErrUnexpectedEOF |
| 3314 | } |
| 3315 | iNdEx++ |
| 3316 | if data[iNdEx-1] < 0x80 { |
| 3317 | break |
| 3318 | } |
| 3319 | } |
| 3320 | return iNdEx, nil |
| 3321 | case 1: |
| 3322 | iNdEx += 8 |
| 3323 | return iNdEx, nil |
| 3324 | case 2: |
| 3325 | var length int |
| 3326 | for shift := uint(0); ; shift += 7 { |
| 3327 | if shift >= 64 { |
| 3328 | return 0, ErrIntOverflowNode |
| 3329 | } |
| 3330 | if iNdEx >= l { |
| 3331 | return 0, io.ErrUnexpectedEOF |
| 3332 | } |
| 3333 | b := data[iNdEx] |
| 3334 | iNdEx++ |
| 3335 | length |= (int(b) & 0x7F) << shift |
| 3336 | if b < 0x80 { |
| 3337 | break |
| 3338 | } |
| 3339 | } |
| 3340 | iNdEx += length |
| 3341 | if length < 0 { |
| 3342 | return 0, ErrInvalidLengthNode |
| 3343 | } |
no test coverage detected