github.com/m3db/m3@v1.5.1-0.20231129193456-75a402aa583b/src/metrics/rules/convert.go (about)

     1  // Copyright (c) 2018 Uber Technologies, Inc.
     2  //
     3  // Permission is hereby granted, free of charge, to any person obtaining a copy
     4  // of this software and associated documentation files (the "Software"), to deal
     5  // in the Software without restriction, including without limitation the rights
     6  // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
     7  // copies of the Software, and to permit persons to whom the Software is
     8  // furnished to do so, subject to the following conditions:
     9  //
    10  // The above copyright notice and this permission notice shall be included in
    11  // all copies or substantial portions of the Software.
    12  //
    13  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    14  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    15  // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
    16  // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    17  // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
    18  // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
    19  // THE SOFTWARE.
    20  
    21  package rules
    22  
    23  import (
    24  	"errors"
    25  	"fmt"
    26  	"sort"
    27  
    28  	"github.com/m3db/m3/src/metrics/aggregation"
    29  	"github.com/m3db/m3/src/metrics/generated/proto/policypb"
    30  	"github.com/m3db/m3/src/metrics/policy"
    31  )
    32  
    33  var (
    34  	errNilPolicyProto = errors.New("nil policy proto")
    35  )
    36  
    37  // toAggregationIDAndStoragePolicies converts a list of policies to a single
    38  // aggregation ID and a list of storage policies. This is needed for the purpose
    39  // of transparently evolving v1 mapping rule protos and rollup target protos into
    40  // v2 protos and associated data structures.
    41  func toAggregationIDAndStoragePolicies(
    42  	pbPolicies []*policypb.Policy,
    43  ) (aggregation.ID, policy.StoragePolicies, error) {
    44  	var (
    45  		aggregationID      aggregation.ID
    46  		firstTime          = true
    47  		storagePoliciesSet = make(map[policy.StoragePolicy]struct{}, len(pbPolicies))
    48  	)
    49  	for _, pbPolicy := range pbPolicies {
    50  		if pbPolicy == nil {
    51  			return aggregation.DefaultID, nil, errNilPolicyProto
    52  		}
    53  		sp, err := policy.NewStoragePolicyFromProto(pbPolicy.StoragePolicy)
    54  		if err != nil {
    55  			return aggregation.DefaultID, nil, err
    56  		}
    57  		newAggID, err := aggregation.NewIDFromProto(pbPolicy.AggregationTypes)
    58  		if err != nil {
    59  			return aggregation.DefaultID, nil, err
    60  		}
    61  		if firstTime {
    62  			aggregationID = newAggID
    63  			firstTime = false
    64  		} else if !aggregationID.Equal(newAggID) {
    65  			return aggregation.DefaultID, nil, fmt.Errorf("more than one aggregation ID in legacy policies list proto: ID1=%v, ID2=%v", aggregationID, newAggID)
    66  		}
    67  		storagePoliciesSet[sp] = struct{}{}
    68  	}
    69  	storagePolicies := make([]policy.StoragePolicy, 0, len(storagePoliciesSet))
    70  	for sp := range storagePoliciesSet {
    71  		storagePolicies = append(storagePolicies, sp)
    72  	}
    73  	// NB: for deterministic ordering.
    74  	sort.Sort(policy.ByResolutionAscRetentionDesc(storagePolicies))
    75  	return aggregationID, storagePolicies, nil
    76  }