(dAtA []byte)
| 2082 | return nil |
| 2083 | } |
| 2084 | func skipErrors(dAtA []byte) (n int, err error) { |
| 2085 | l := len(dAtA) |
| 2086 | iNdEx := 0 |
| 2087 | depth := 0 |
| 2088 | for iNdEx < l { |
| 2089 | var wire uint64 |
| 2090 | for shift := uint(0); ; shift += 7 { |
| 2091 | if shift >= 64 { |
| 2092 | return 0, ErrIntOverflowErrors |
| 2093 | } |
| 2094 | if iNdEx >= l { |
| 2095 | return 0, io.ErrUnexpectedEOF |
| 2096 | } |
| 2097 | b := dAtA[iNdEx] |
| 2098 | iNdEx++ |
| 2099 | wire |= (uint64(b) & 0x7F) << shift |
| 2100 | if b < 0x80 { |
| 2101 | break |
| 2102 | } |
| 2103 | } |
| 2104 | wireType := int(wire & 0x7) |
| 2105 | switch wireType { |
| 2106 | case 0: |
| 2107 | for shift := uint(0); ; shift += 7 { |
| 2108 | if shift >= 64 { |
| 2109 | return 0, ErrIntOverflowErrors |
| 2110 | } |
| 2111 | if iNdEx >= l { |
| 2112 | return 0, io.ErrUnexpectedEOF |
| 2113 | } |
| 2114 | iNdEx++ |
| 2115 | if dAtA[iNdEx-1] < 0x80 { |
| 2116 | break |
| 2117 | } |
| 2118 | } |
| 2119 | case 1: |
| 2120 | iNdEx += 8 |
| 2121 | case 2: |
| 2122 | var length int |
| 2123 | for shift := uint(0); ; shift += 7 { |
| 2124 | if shift >= 64 { |
| 2125 | return 0, ErrIntOverflowErrors |
| 2126 | } |
| 2127 | if iNdEx >= l { |
| 2128 | return 0, io.ErrUnexpectedEOF |
| 2129 | } |
| 2130 | b := dAtA[iNdEx] |
| 2131 | iNdEx++ |
| 2132 | length |= (int(b) & 0x7F) << shift |
| 2133 | if b < 0x80 { |
| 2134 | break |
| 2135 | } |
| 2136 | } |
| 2137 | if length < 0 { |
| 2138 | return 0, ErrInvalidLengthErrors |
| 2139 | } |
| 2140 | iNdEx += length |
| 2141 | case 3: |
no outgoing calls
no test coverage detected
searching dependent graphs…