desc.go 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184
  1. // Copyright 2016 The Prometheus Authors
  2. // Licensed under the Apache License, Version 2.0 (the "License");
  3. // you may not use this file except in compliance with the License.
  4. // You may obtain a copy of the License at
  5. //
  6. // http://www.apache.org/licenses/LICENSE-2.0
  7. //
  8. // Unless required by applicable law or agreed to in writing, software
  9. // distributed under the License is distributed on an "AS IS" BASIS,
  10. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  11. // See the License for the specific language governing permissions and
  12. // limitations under the License.
  13. package prometheus
  14. import (
  15. "errors"
  16. "fmt"
  17. "sort"
  18. "strings"
  19. "github.com/golang/protobuf/proto"
  20. "github.com/prometheus/common/model"
  21. dto "github.com/prometheus/client_model/go"
  22. )
  23. // Desc is the descriptor used by every Prometheus Metric. It is essentially
  24. // the immutable meta-data of a Metric. The normal Metric implementations
  25. // included in this package manage their Desc under the hood. Users only have to
  26. // deal with Desc if they use advanced features like the ExpvarCollector or
  27. // custom Collectors and Metrics.
  28. //
  29. // Descriptors registered with the same registry have to fulfill certain
  30. // consistency and uniqueness criteria if they share the same fully-qualified
  31. // name: They must have the same help string and the same label names (aka label
  32. // dimensions) in each, constLabels and variableLabels, but they must differ in
  33. // the values of the constLabels.
  34. //
  35. // Descriptors that share the same fully-qualified names and the same label
  36. // values of their constLabels are considered equal.
  37. //
  38. // Use NewDesc to create new Desc instances.
  39. type Desc struct {
  40. // fqName has been built from Namespace, Subsystem, and Name.
  41. fqName string
  42. // help provides some helpful information about this metric.
  43. help string
  44. // constLabelPairs contains precalculated DTO label pairs based on
  45. // the constant labels.
  46. constLabelPairs []*dto.LabelPair
  47. // VariableLabels contains names of labels for which the metric
  48. // maintains variable values.
  49. variableLabels []string
  50. // id is a hash of the values of the ConstLabels and fqName. This
  51. // must be unique among all registered descriptors and can therefore be
  52. // used as an identifier of the descriptor.
  53. id uint64
  54. // dimHash is a hash of the label names (preset and variable) and the
  55. // Help string. Each Desc with the same fqName must have the same
  56. // dimHash.
  57. dimHash uint64
  58. // err is an error that occurred during construction. It is reported on
  59. // registration time.
  60. err error
  61. }
  62. // NewDesc allocates and initializes a new Desc. Errors are recorded in the Desc
  63. // and will be reported on registration time. variableLabels and constLabels can
  64. // be nil if no such labels should be set. fqName must not be empty.
  65. //
  66. // variableLabels only contain the label names. Their label values are variable
  67. // and therefore not part of the Desc. (They are managed within the Metric.)
  68. //
  69. // For constLabels, the label values are constant. Therefore, they are fully
  70. // specified in the Desc. See the Collector example for a usage pattern.
  71. func NewDesc(fqName, help string, variableLabels []string, constLabels Labels) *Desc {
  72. d := &Desc{
  73. fqName: fqName,
  74. help: help,
  75. variableLabels: variableLabels,
  76. }
  77. if !model.IsValidMetricName(model.LabelValue(fqName)) {
  78. d.err = fmt.Errorf("%q is not a valid metric name", fqName)
  79. return d
  80. }
  81. // labelValues contains the label values of const labels (in order of
  82. // their sorted label names) plus the fqName (at position 0).
  83. labelValues := make([]string, 1, len(constLabels)+1)
  84. labelValues[0] = fqName
  85. labelNames := make([]string, 0, len(constLabels)+len(variableLabels))
  86. labelNameSet := map[string]struct{}{}
  87. // First add only the const label names and sort them...
  88. for labelName := range constLabels {
  89. if !checkLabelName(labelName) {
  90. d.err = fmt.Errorf("%q is not a valid label name for metric %q", labelName, fqName)
  91. return d
  92. }
  93. labelNames = append(labelNames, labelName)
  94. labelNameSet[labelName] = struct{}{}
  95. }
  96. sort.Strings(labelNames)
  97. // ... so that we can now add const label values in the order of their names.
  98. for _, labelName := range labelNames {
  99. labelValues = append(labelValues, constLabels[labelName])
  100. }
  101. // Validate the const label values. They can't have a wrong cardinality, so
  102. // use in len(labelValues) as expectedNumberOfValues.
  103. if err := validateLabelValues(labelValues, len(labelValues)); err != nil {
  104. d.err = err
  105. return d
  106. }
  107. // Now add the variable label names, but prefix them with something that
  108. // cannot be in a regular label name. That prevents matching the label
  109. // dimension with a different mix between preset and variable labels.
  110. for _, labelName := range variableLabels {
  111. if !checkLabelName(labelName) {
  112. d.err = fmt.Errorf("%q is not a valid label name for metric %q", labelName, fqName)
  113. return d
  114. }
  115. labelNames = append(labelNames, "$"+labelName)
  116. labelNameSet[labelName] = struct{}{}
  117. }
  118. if len(labelNames) != len(labelNameSet) {
  119. d.err = errors.New("duplicate label names")
  120. return d
  121. }
  122. vh := hashNew()
  123. for _, val := range labelValues {
  124. vh = hashAdd(vh, val)
  125. vh = hashAddByte(vh, separatorByte)
  126. }
  127. d.id = vh
  128. // Sort labelNames so that order doesn't matter for the hash.
  129. sort.Strings(labelNames)
  130. // Now hash together (in this order) the help string and the sorted
  131. // label names.
  132. lh := hashNew()
  133. lh = hashAdd(lh, help)
  134. lh = hashAddByte(lh, separatorByte)
  135. for _, labelName := range labelNames {
  136. lh = hashAdd(lh, labelName)
  137. lh = hashAddByte(lh, separatorByte)
  138. }
  139. d.dimHash = lh
  140. d.constLabelPairs = make([]*dto.LabelPair, 0, len(constLabels))
  141. for n, v := range constLabels {
  142. d.constLabelPairs = append(d.constLabelPairs, &dto.LabelPair{
  143. Name: proto.String(n),
  144. Value: proto.String(v),
  145. })
  146. }
  147. sort.Sort(labelPairSorter(d.constLabelPairs))
  148. return d
  149. }
  150. // NewInvalidDesc returns an invalid descriptor, i.e. a descriptor with the
  151. // provided error set. If a collector returning such a descriptor is registered,
  152. // registration will fail with the provided error. NewInvalidDesc can be used by
  153. // a Collector to signal inability to describe itself.
  154. func NewInvalidDesc(err error) *Desc {
  155. return &Desc{
  156. err: err,
  157. }
  158. }
  159. func (d *Desc) String() string {
  160. lpStrings := make([]string, 0, len(d.constLabelPairs))
  161. for _, lp := range d.constLabelPairs {
  162. lpStrings = append(
  163. lpStrings,
  164. fmt.Sprintf("%s=%q", lp.GetName(), lp.GetValue()),
  165. )
  166. }
  167. return fmt.Sprintf(
  168. "Desc{fqName: %q, help: %q, constLabels: {%s}, variableLabels: %v}",
  169. d.fqName,
  170. d.help,
  171. strings.Join(lpStrings, ","),
  172. d.variableLabels,
  173. )
  174. }