// Copyright 2020 The Prometheus Authors // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. package writev2 import ( "golang.org/x/exp/slices" ) func (m Sample) T() int64 { return m.Timestamp } func (m Sample) V() float64 { return m.Value } func (h Histogram) IsFloatHistogram() bool { _, ok := h.GetCount().(*Histogram_CountFloat) return ok } func (m *WriteRequest) OptimizedMarshal(dst []byte) ([]byte, error) { siz := m.Size() if cap(dst) < siz { dst = make([]byte, siz) } dst = dst[:siz] n, err := m.OptimizedMarshalToSizedBuffer(dst) if err != nil { return nil, err } return (dst)[:n], nil } // OptimizedMarshalToSizedBuffer is mostly a copy of the generated MarshalToSizedBuffer, // but calls OptimizedMarshalToSizedBuffer on the timeseries. func (m *WriteRequest) OptimizedMarshalToSizedBuffer(dAtA []byte) (int, error) { i := len(dAtA) _ = i var l int _ = l if m.XXX_unrecognized != nil { i -= len(m.XXX_unrecognized) copy(dAtA[i:], m.XXX_unrecognized) } if len(m.Timeseries) > 0 { for iNdEx := len(m.Timeseries) - 1; iNdEx >= 0; iNdEx-- { { size, err := m.Timeseries[iNdEx].OptimizedMarshalToSizedBuffer(dAtA[:i]) if err != nil { return 0, err } i -= size i = encodeVarintTypes(dAtA, i, uint64(size)) } i-- dAtA[i] = 0x12 } } if len(m.Symbols) > 0 { for iNdEx := len(m.Symbols) - 1; iNdEx >= 0; iNdEx-- { i -= len(m.Symbols[iNdEx]) copy(dAtA[i:], m.Symbols[iNdEx]) i = encodeVarintTypes(dAtA, i, uint64(len(m.Symbols[iNdEx]))) i-- dAtA[i] = 0xa } } return len(dAtA) - i, nil } // OptimizedMarshalToSizedBuffer is mostly a copy of the generated MarshalToSizedBuffer, // but marshals m.LabelsRefs in place without extra allocations. func (m *TimeSeries) OptimizedMarshalToSizedBuffer(dAtA []byte) (int, error) { i := len(dAtA) _ = i var l int _ = l if m.XXX_unrecognized != nil { i -= len(m.XXX_unrecognized) copy(dAtA[i:], m.XXX_unrecognized) } if m.CreatedTimestamp != 0 { i = encodeVarintTypes(dAtA, i, uint64(m.CreatedTimestamp)) i-- dAtA[i] = 0x30 } { size, err := m.Metadata.MarshalToSizedBuffer(dAtA[:i]) if err != nil { return 0, err } i -= size i = encodeVarintTypes(dAtA, i, uint64(size)) } i-- dAtA[i] = 0x2a if len(m.Histograms) > 0 { for iNdEx := len(m.Histograms) - 1; iNdEx >= 0; iNdEx-- { { size, err := m.Histograms[iNdEx].MarshalToSizedBuffer(dAtA[:i]) if err != nil { return 0, err } i -= size i = encodeVarintTypes(dAtA, i, uint64(size)) } i-- dAtA[i] = 0x22 } } if len(m.Exemplars) > 0 { for iNdEx := len(m.Exemplars) - 1; iNdEx >= 0; iNdEx-- { { size, err := m.Exemplars[iNdEx].MarshalToSizedBuffer(dAtA[:i]) if err != nil { return 0, err } i -= size i = encodeVarintTypes(dAtA, i, uint64(size)) } i-- dAtA[i] = 0x1a } } if len(m.Samples) > 0 { for iNdEx := len(m.Samples) - 1; iNdEx >= 0; iNdEx-- { { size, err := m.Samples[iNdEx].MarshalToSizedBuffer(dAtA[:i]) if err != nil { return 0, err } i -= size i = encodeVarintTypes(dAtA, i, uint64(size)) } i-- dAtA[i] = 0x12 } } if len(m.LabelsRefs) > 0 { // This is the trick: encode the varints in reverse order to make it easier // to do it in place. Then reverse the whole thing. var j10 int start := i for _, num := range m.LabelsRefs { for num >= 1<<7 { dAtA[i-1] = uint8(uint64(num)&0x7f | 0x80) num >>= 7 i-- j10++ } dAtA[i-1] = uint8(num) i-- j10++ } slices.Reverse(dAtA[i:start]) // --- end of trick i = encodeVarintTypes(dAtA, i, uint64(j10)) i-- dAtA[i] = 0xa } return len(dAtA) - i, nil }