An error has occurred during metrics collection:


collected metric weblog_time label:<name:"appID" value:"" > label:<name:"cma" value:"" > label:name:"code" value:"" > 1abel:<name:"event" value:"custom" > label :<name:"httpStatus" value:"" > label:name:"httpStatus" value:"" > label:<name:"ifFirst" value:"" > label:name:"message" value:"pageLoad" >  label:<name:"msg" value:"" > label<name:"num" value:"" >label:<name:"pageID" value:".*mall. *productDetail" > label:<name:"source" value:"" > label:<name:"timeName" value:"resource_cost_ms" > label:<name:"ua" value:"" > histogram:<sanple_count:243372 sanple_sum:4.762622828805921e+09 bucket:<cumulative_count:58815 upper_bound:0.005 > bucket:<cumulative_count:106019 upper_bound:0.01 > bucket:<cumulative_count:160479 upper_bound:0.025 > bucket:<cumulative_count:197994 upper_bound:0.05 > bucket:<cumulative_count:222643 upper_bound:0.1, bucket:<cumulative_count:233694 upper_bound:0.25 > bucket:<cumulative_count:239032 upper_bound:0.5 > bucket:<cumulativ_count:241622 upper_bound:1 > bucket:<cumulative_count:242917 upper_bound:2.5 > bucket:<cumulative_count:243219 upper_bpund:5 > bucket:<cunmulative_ count:243322 upper_bound:10 > > has label dimensions inconsistent with previously collected metrics in the same metric family


复制

func init() {  
    var labelTime = []string{"cmd","appID", "pageID", "event", "elementID", "message", "ua", "ifFirst",  "httpStatus", "code", "msg", "source", "num", "timeName"}   
    configHistogram = prometheus.NewHistogramVec(  
        prometheus.HistogramOpts{  
            Name:    "weblog_time",  
            Help:    "config配置的耗时指标",  
            Buckets: prometheus.DefBuckets,  
        }, labelTime,  
    )  
    prometheus.MustRegister(configHistogram)  
}  
func ReportTime(t float64, labelsTimeValue map[string]string) {  
     if t != 0 {  
        configHistogram.With(labelsTimeValue).Observe(t)  
    }  
}  
复制

label dimensions inconsistent with previously collected metrics in the same metric family
复制

  - if dimHash, ok := dimHashes[metricFamily.GetName()]; ok {  
  -   if dimHash != dh {  
  -       return fmt.Errorf(  
  -           "collected metric %s %s has label dimensions inconsistent with previously collected metrics in the same metric family",  
  -           metricFamily.GetName(), dtoMetric,  
  -       )  
  -   }  
复制

func (r *Registry) Gather() ([]*dto.MetricFamily, error) {  
    for _, collector := range r.collectorsByID {  
        // A Metric models a single sample value with its meta data being exported to Prometheus.  
        collector.Collect(metricChan)  
    }  
          
    for metric := range metricChan {  
        dtoMetric := &dto.Metric{}  
        metric.Write(dtoMetric)  
        checkMetricConsistency(metricFamily, dtoMetric, metricHashes, dimHashes)  
     }  
}  
func checkMetricConsistency(metricFamily *dto.MetricFamily,dtoMetric *dto.Metric) {  
// Make sure label pairs are sorted. We depend on it for the consistency check.  
   sort.Sort(LabelPairSorter(dtoMetric.Label))  
      dh := hashNew()  
      for _, lp := range dtoMetric.Label {  
          dh = hashAdd(dh, lp.GetName())  
      }  
      if dh!=dimHashes[metricFamily.GetName()] {  
          return fmt.Errorf("collected metric %s %s has label dimensions inconsistent with previously collected metrics in the same metric family")  
      }  
} 
复制

func Sort(data Interface) {  
    n := data.Len()  
    quickSort(data, 0, n, maxDepth(n))  
}  
func quickSort(data Interface, a, b, maxDepth int) {  
    for b-a > 12 { // Use ShellSort for slices <= 12 elements  
        if maxDepth == 0 {  
            heapSort(data, a, b)   
            return  
         }  
         maxDepth--
         mlo, mhi := doPivot(data, a, b) 
         // Avoiding recursion on the larger subproblem guarantees a stack depth of at most lg(b-a).  
         if mlo-a < b-mhi {  
             quickSort(data, a, mlo, maxDepth)  
             a = mhi // i.e., quickSort(data, mhi, b)  
         } else {  
             quickSort(data, mhi, b, maxDepth)  
             b = mlo // i.e., quickSort(data, a, mlo)  
         }  
     }  
     if b-a > 1 {  
        // Do ShellSort pass with gap 6  
        // It could be written in this simplified form cause b-a <= 12  
        for i := a + 6; i < b; i++ {  
            if data.Less(i, i-6) {  
                data.Swap(i, i-6)  
            }  
        }  
        insertionSort(data, a, b)  
    }  
}
复制