(dAtA []byte)
| 202 | return nil |
| 203 | } |
| 204 | func skipExtGrpc(dAtA []byte) (n int, err error) { |
| 205 | l := len(dAtA) |
| 206 | iNdEx := 0 |
| 207 | depth := 0 |
| 208 | for iNdEx < l { |
| 209 | var wire uint64 |
| 210 | for shift := uint(0); ; shift += 7 { |
| 211 | if shift >= 64 { |
| 212 | return 0, ErrIntOverflowExtGrpc |
| 213 | } |
| 214 | if iNdEx >= l { |
| 215 | return 0, io.ErrUnexpectedEOF |
| 216 | } |
| 217 | b := dAtA[iNdEx] |
| 218 | iNdEx++ |
| 219 | wire |= (uint64(b) & 0x7F) << shift |
| 220 | if b < 0x80 { |
| 221 | break |
| 222 | } |
| 223 | } |
| 224 | wireType := int(wire & 0x7) |
| 225 | switch wireType { |
| 226 | case 0: |
| 227 | for shift := uint(0); ; shift += 7 { |
| 228 | if shift >= 64 { |
| 229 | return 0, ErrIntOverflowExtGrpc |
| 230 | } |
| 231 | if iNdEx >= l { |
| 232 | return 0, io.ErrUnexpectedEOF |
| 233 | } |
| 234 | iNdEx++ |
| 235 | if dAtA[iNdEx-1] < 0x80 { |
| 236 | break |
| 237 | } |
| 238 | } |
| 239 | case 1: |
| 240 | iNdEx += 8 |
| 241 | case 2: |
| 242 | var length int |
| 243 | for shift := uint(0); ; shift += 7 { |
| 244 | if shift >= 64 { |
| 245 | return 0, ErrIntOverflowExtGrpc |
| 246 | } |
| 247 | if iNdEx >= l { |
| 248 | return 0, io.ErrUnexpectedEOF |
| 249 | } |
| 250 | b := dAtA[iNdEx] |
| 251 | iNdEx++ |
| 252 | length |= (int(b) & 0x7F) << shift |
| 253 | if b < 0x80 { |
| 254 | break |
| 255 | } |
| 256 | } |
| 257 | if length < 0 { |
| 258 | return 0, ErrInvalidLengthExtGrpc |
| 259 | } |
| 260 | iNdEx += length |
| 261 | case 3: |
no outgoing calls
no test coverage detected
searching dependent graphs…