allocation.go 38 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726
  1. package costmodel
  2. import (
  3. "fmt"
  4. "time"
  5. "github.com/opencost/opencost/core/pkg/opencost"
  6. "github.com/opencost/opencost/core/pkg/util/timeutil"
  7. "github.com/opencost/opencost/core/pkg/log"
  8. "github.com/opencost/opencost/pkg/env"
  9. "github.com/opencost/opencost/pkg/prom"
  10. )
  11. const (
  12. // https://kubecost.atlassian.net/browse/BURNDOWN-234
  13. // upstream KSM has implementation change vs OC internal KSM - it sets metric to 0 when pod goes down
  14. // VS OC implementation which stops emitting it
  15. // by adding != 0 filter, we keep just the active times in the prom result
  16. queryFmtPods = `avg(kube_pod_container_status_running{%s} != 0) by (pod, namespace, %s)[%s:%s]`
  17. queryFmtPodsUID = `avg(kube_pod_container_status_running{%s} != 0) by (pod, namespace, uid, %s)[%s:%s]`
  18. queryFmtRAMBytesAllocated = `avg(avg_over_time(container_memory_allocation_bytes{container!="", container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s, provider_id)`
  19. queryFmtRAMRequests = `avg(avg_over_time(kube_pod_container_resource_requests{resource="memory", unit="byte", container!="", container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s)`
  20. queryFmtRAMUsageAvg = `avg(avg_over_time(container_memory_working_set_bytes{container!="", container_name!="POD", container!="POD", %s}[%s])) by (container_name, container, pod_name, pod, namespace, instance, %s)`
  21. queryFmtRAMUsageMax = `max(max_over_time(container_memory_working_set_bytes{container!="", container_name!="POD", container!="POD", %s}[%s])) by (container_name, container, pod_name, pod, namespace, instance, %s)`
  22. queryFmtCPUCoresAllocated = `avg(avg_over_time(container_cpu_allocation{container!="", container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s)`
  23. queryFmtCPURequests = `avg(avg_over_time(kube_pod_container_resource_requests{resource="cpu", unit="core", container!="", container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s)`
  24. queryFmtCPUUsageAvg = `avg(rate(container_cpu_usage_seconds_total{container!="", container_name!="POD", container!="POD", %s}[%s])) by (container_name, container, pod_name, pod, namespace, instance, %s)`
  25. queryFmtGPUsRequested = `avg(avg_over_time(kube_pod_container_resource_requests{resource="nvidia_com_gpu", container!="",container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s)`
  26. queryFmtGPUsUsageAvg = `avg(avg_over_time(DCGM_FI_PROF_GR_ENGINE_ACTIVE{container!=""}[%s])) by (container, pod, namespace, %s)`
  27. queryFmtGPUsAllocated = `avg(avg_over_time(container_gpu_allocation{container!="", container!="POD", node!="", %s}[%s])) by (container, pod, namespace, node, %s)`
  28. queryFmtNodeCostPerCPUHr = `avg(avg_over_time(node_cpu_hourly_cost{%s}[%s])) by (node, %s, instance_type, provider_id)`
  29. queryFmtNodeCostPerRAMGiBHr = `avg(avg_over_time(node_ram_hourly_cost{%s}[%s])) by (node, %s, instance_type, provider_id)`
  30. queryFmtNodeCostPerGPUHr = `avg(avg_over_time(node_gpu_hourly_cost{%s}[%s])) by (node, %s, instance_type, provider_id)`
  31. queryFmtNodeIsSpot = `avg_over_time(kubecost_node_is_spot{%s}[%s])`
  32. queryFmtPVCInfo = `avg(kube_persistentvolumeclaim_info{volumename != "", %s}) by (persistentvolumeclaim, storageclass, volumename, namespace, %s)[%s:%s]`
  33. queryFmtPodPVCAllocation = `avg(avg_over_time(pod_pvc_allocation{%s}[%s])) by (persistentvolume, persistentvolumeclaim, pod, namespace, %s)`
  34. queryFmtPVCBytesRequested = `avg(avg_over_time(kube_persistentvolumeclaim_resource_requests_storage_bytes{%s}[%s])) by (persistentvolumeclaim, namespace, %s)`
  35. queryFmtPVActiveMins = `count(kube_persistentvolume_capacity_bytes{%s}) by (persistentvolume, %s)[%s:%s]`
  36. queryFmtPVBytes = `avg(avg_over_time(kube_persistentvolume_capacity_bytes{%s}[%s])) by (persistentvolume, %s)`
  37. queryFmtPVCostPerGiBHour = `avg(avg_over_time(pv_hourly_cost{%s}[%s])) by (volumename, %s)`
  38. queryFmtPVMeta = `avg(avg_over_time(kubecost_pv_info{%s}[%s])) by (%s, persistentvolume, provider_id)`
  39. queryFmtNetZoneGiB = `sum(increase(kubecost_pod_network_egress_bytes_total{internet="false", same_zone="false", same_region="true", %s}[%s])) by (pod_name, namespace, %s) / 1024 / 1024 / 1024`
  40. queryFmtNetZoneCostPerGiB = `avg(avg_over_time(kubecost_network_zone_egress_cost{%s}[%s])) by (%s)`
  41. queryFmtNetRegionGiB = `sum(increase(kubecost_pod_network_egress_bytes_total{internet="false", same_zone="false", same_region="false", %s}[%s])) by (pod_name, namespace, %s) / 1024 / 1024 / 1024`
  42. queryFmtNetRegionCostPerGiB = `avg(avg_over_time(kubecost_network_region_egress_cost{%s}[%s])) by (%s)`
  43. queryFmtNetInternetGiB = `sum(increase(kubecost_pod_network_egress_bytes_total{internet="true", %s}[%s])) by (pod_name, namespace, %s) / 1024 / 1024 / 1024`
  44. queryFmtNetInternetCostPerGiB = `avg(avg_over_time(kubecost_network_internet_egress_cost{%s}[%s])) by (%s)`
  45. queryFmtNetReceiveBytes = `sum(increase(container_network_receive_bytes_total{pod!="", %s}[%s])) by (pod_name, pod, namespace, %s)`
  46. queryFmtNetTransferBytes = `sum(increase(container_network_transmit_bytes_total{pod!="", %s}[%s])) by (pod_name, pod, namespace, %s)`
  47. queryFmtNodeLabels = `avg_over_time(kube_node_labels{%s}[%s])`
  48. queryFmtNamespaceLabels = `avg_over_time(kube_namespace_labels{%s}[%s])`
  49. queryFmtNamespaceAnnotations = `avg_over_time(kube_namespace_annotations{%s}[%s])`
  50. queryFmtPodLabels = `avg_over_time(kube_pod_labels{%s}[%s])`
  51. queryFmtPodAnnotations = `avg_over_time(kube_pod_annotations{%s}[%s])`
  52. queryFmtServiceLabels = `avg_over_time(service_selector_labels{%s}[%s])`
  53. queryFmtDeploymentLabels = `avg_over_time(deployment_match_labels{%s}[%s])`
  54. queryFmtStatefulSetLabels = `avg_over_time(statefulSet_match_labels{%s}[%s])`
  55. queryFmtDaemonSetLabels = `sum(avg_over_time(kube_pod_owner{owner_kind="DaemonSet", %s}[%s])) by (pod, owner_name, namespace, %s)`
  56. queryFmtJobLabels = `sum(avg_over_time(kube_pod_owner{owner_kind="Job", %s}[%s])) by (pod, owner_name, namespace ,%s)`
  57. queryFmtPodsWithReplicaSetOwner = `sum(avg_over_time(kube_pod_owner{owner_kind="ReplicaSet", %s}[%s])) by (pod, owner_name, namespace ,%s)`
  58. queryFmtReplicaSetsWithoutOwners = `avg(avg_over_time(kube_replicaset_owner{owner_kind="<none>", owner_name="<none>", %s}[%s])) by (replicaset, namespace, %s)`
  59. queryFmtReplicaSetsWithRolloutOwner = `avg(avg_over_time(kube_replicaset_owner{owner_kind="Rollout", %s}[%s])) by (replicaset, namespace, owner_kind, owner_name, %s)`
  60. queryFmtLBCostPerHr = `avg(avg_over_time(kubecost_load_balancer_cost{%s}[%s])) by (namespace, service_name, ingress_ip, %s)`
  61. queryFmtLBActiveMins = `count(kubecost_load_balancer_cost{%s}) by (namespace, service_name, %s)[%s:%s]`
  62. queryFmtOldestSample = `min_over_time(timestamp(group(node_cpu_hourly_cost{%s}))[%s:%s])`
  63. queryFmtNewestSample = `max_over_time(timestamp(group(node_cpu_hourly_cost{%s}))[%s:%s])`
  64. // Because we use container_cpu_usage_seconds_total to calculate CPU usage
  65. // at any given "instant" of time, we need to use an irate or rate. To then
  66. // calculate a max (or any aggregation) we have to perform an aggregation
  67. // query on top of an instant-by-instant maximum. Prometheus supports this
  68. // type of query with a "subquery" [1], however it is reportedly expensive
  69. // to make such a query. By default, Kubecost's Prometheus config includes
  70. // a recording rule that keeps track of the instant-by-instant irate for CPU
  71. // usage. The metric in this query is created by that recording rule.
  72. //
  73. // [1] https://prometheus.io/blog/2019/01/28/subquery-support/
  74. //
  75. // If changing the name of the recording rule, make sure to update the
  76. // corresponding diagnostic query to avoid confusion.
  77. queryFmtCPUUsageMaxRecordingRule = `max(max_over_time(kubecost_container_cpu_usage_irate{%s}[%s])) by (container_name, container, pod_name, pod, namespace, instance, %s)`
  78. // This is the subquery equivalent of the above recording rule query. It is
  79. // more expensive, but does not require the recording rule. It should be
  80. // used as a fallback query if the recording rule data does not exist.
  81. //
  82. // The parameter after the colon [:<thisone>] in the subquery affects the
  83. // resolution of the subquery.
  84. // The parameter after the metric ...{}[<thisone>] should be set to 2x
  85. // the resolution, to make sure the irate always has two points to query
  86. // in case the Prom scrape duration has been reduced to be equal to the
  87. // ETL resolution.
  88. queryFmtCPUUsageMaxSubquery = `max(max_over_time(irate(container_cpu_usage_seconds_total{container!="POD", container!="", %s}[%s])[%s:%s])) by (container, pod_name, pod, namespace, instance, %s)`
  89. )
  90. // Constants for Network Cost Subtype
  91. const (
  92. networkCrossZoneCost = "NetworkCrossZoneCost"
  93. networkCrossRegionCost = "NetworkCrossRegionCost"
  94. networkInternetCost = "NetworkInternetCost"
  95. )
  96. // CanCompute should return true if CostModel can act as a valid source for the
  97. // given time range. In the case of CostModel we want to attempt to compute as
  98. // long as the range starts in the past. If the CostModel ends up not having
  99. // data to match, that's okay, and should be communicated with an error
  100. // response from ComputeAllocation.
  101. func (cm *CostModel) CanCompute(start, end time.Time) bool {
  102. return start.Before(time.Now())
  103. }
  104. // Name returns the name of the Source
  105. func (cm *CostModel) Name() string {
  106. return "CostModel"
  107. }
  108. // ComputeAllocation uses the CostModel instance to compute an AllocationSet
  109. // for the window defined by the given start and end times. The Allocations
  110. // returned are unaggregated (i.e. down to the container level).
  111. func (cm *CostModel) ComputeAllocation(start, end time.Time, resolution time.Duration) (*opencost.AllocationSet, error) {
  112. // If the duration is short enough, compute the AllocationSet directly
  113. if end.Sub(start) <= cm.MaxPrometheusQueryDuration {
  114. as, _, err := cm.computeAllocation(start, end, resolution)
  115. return as, err
  116. }
  117. // If the duration exceeds the configured MaxPrometheusQueryDuration, then
  118. // query for maximum-sized AllocationSets, collect them, and accumulate.
  119. // s and e track the coverage of the entire given window over multiple
  120. // internal queries.
  121. s, e := start, start
  122. // Collect AllocationSets in a range, then accumulate
  123. // TODO optimize by collecting consecutive AllocationSets, accumulating as we go
  124. asr := opencost.NewAllocationSetRange()
  125. for e.Before(end) {
  126. // By default, query for the full remaining duration. But do not let
  127. // any individual query duration exceed the configured max Prometheus
  128. // query duration.
  129. duration := end.Sub(e)
  130. if duration > cm.MaxPrometheusQueryDuration {
  131. duration = cm.MaxPrometheusQueryDuration
  132. }
  133. // Set start and end parameters (s, e) for next individual computation.
  134. e = s.Add(duration)
  135. // Compute the individual AllocationSet for just (s, e)
  136. as, _, err := cm.computeAllocation(s, e, resolution)
  137. if err != nil {
  138. return opencost.NewAllocationSet(start, end), fmt.Errorf("error computing allocation for %s: %s", opencost.NewClosedWindow(s, e), err)
  139. }
  140. // Append to the range
  141. asr.Append(as)
  142. // Set s equal to e to set up the next query, if one exists.
  143. s = e
  144. }
  145. // Populate annotations, labels, and services on each Allocation. This is
  146. // necessary because Properties.Intersection does not propagate any values
  147. // stored in maps or slices for performance reasons. In this case, however,
  148. // it is both acceptable and necessary to do so.
  149. allocationAnnotations := map[string]map[string]string{}
  150. allocationLabels := map[string]map[string]string{}
  151. allocationServices := map[string]map[string]bool{}
  152. // Also record errors and warnings, then append them to the results later.
  153. errors := []string{}
  154. warnings := []string{}
  155. for _, as := range asr.Allocations {
  156. for k, a := range as.Allocations {
  157. if len(a.Properties.Annotations) > 0 {
  158. if _, ok := allocationAnnotations[k]; !ok {
  159. allocationAnnotations[k] = map[string]string{}
  160. }
  161. for name, val := range a.Properties.Annotations {
  162. allocationAnnotations[k][name] = val
  163. }
  164. }
  165. if len(a.Properties.Labels) > 0 {
  166. if _, ok := allocationLabels[k]; !ok {
  167. allocationLabels[k] = map[string]string{}
  168. }
  169. for name, val := range a.Properties.Labels {
  170. allocationLabels[k][name] = val
  171. }
  172. }
  173. if len(a.Properties.Services) > 0 {
  174. if _, ok := allocationServices[k]; !ok {
  175. allocationServices[k] = map[string]bool{}
  176. }
  177. for _, val := range a.Properties.Services {
  178. allocationServices[k][val] = true
  179. }
  180. }
  181. }
  182. errors = append(errors, as.Errors...)
  183. warnings = append(warnings, as.Warnings...)
  184. }
  185. // Accumulate to yield the result AllocationSet. After this step, we will
  186. // be nearly complete, but without the raw allocation data, which must be
  187. // recomputed.
  188. resultASR, err := asr.Accumulate(opencost.AccumulateOptionAll)
  189. if err != nil {
  190. return opencost.NewAllocationSet(start, end), fmt.Errorf("error accumulating data for %s: %s", opencost.NewClosedWindow(s, e), err)
  191. }
  192. if resultASR != nil && len(resultASR.Allocations) == 0 {
  193. return opencost.NewAllocationSet(start, end), nil
  194. }
  195. if length := len(resultASR.Allocations); length != 1 {
  196. return opencost.NewAllocationSet(start, end), fmt.Errorf("expected 1 accumulated allocation set, found %d sets", length)
  197. }
  198. result := resultASR.Allocations[0]
  199. // Apply the annotations, labels, and services to the post-accumulation
  200. // results. (See above for why this is necessary.)
  201. for k, a := range result.Allocations {
  202. if annotations, ok := allocationAnnotations[k]; ok {
  203. a.Properties.Annotations = annotations
  204. }
  205. if labels, ok := allocationLabels[k]; ok {
  206. a.Properties.Labels = labels
  207. }
  208. if services, ok := allocationServices[k]; ok {
  209. a.Properties.Services = []string{}
  210. for s := range services {
  211. a.Properties.Services = append(a.Properties.Services, s)
  212. }
  213. }
  214. // Expand the Window of all Allocations within the AllocationSet
  215. // to match the Window of the AllocationSet, which gets expanded
  216. // at the end of this function.
  217. a.Window = a.Window.ExpandStart(start).ExpandEnd(end)
  218. }
  219. // Maintain RAM and CPU max usage values by iterating over the range,
  220. // computing maximums on a rolling basis, and setting on the result set.
  221. for _, as := range asr.Allocations {
  222. for key, alloc := range as.Allocations {
  223. resultAlloc := result.Get(key)
  224. if resultAlloc == nil {
  225. continue
  226. }
  227. if resultAlloc.RawAllocationOnly == nil {
  228. resultAlloc.RawAllocationOnly = &opencost.RawAllocationOnlyData{}
  229. }
  230. if alloc.RawAllocationOnly == nil {
  231. // This will happen inevitably for unmounted disks, but should
  232. // ideally not happen for any allocation with CPU and RAM data.
  233. if !alloc.IsUnmounted() {
  234. log.DedupedWarningf(10, "ComputeAllocation: raw allocation data missing for %s", key)
  235. }
  236. continue
  237. }
  238. if alloc.RawAllocationOnly.CPUCoreUsageMax > resultAlloc.RawAllocationOnly.CPUCoreUsageMax {
  239. resultAlloc.RawAllocationOnly.CPUCoreUsageMax = alloc.RawAllocationOnly.CPUCoreUsageMax
  240. }
  241. if alloc.RawAllocationOnly.RAMBytesUsageMax > resultAlloc.RawAllocationOnly.RAMBytesUsageMax {
  242. resultAlloc.RawAllocationOnly.RAMBytesUsageMax = alloc.RawAllocationOnly.RAMBytesUsageMax
  243. }
  244. }
  245. }
  246. // Expand the window to match the queried time range.
  247. result.Window = result.Window.ExpandStart(start).ExpandEnd(end)
  248. // Append errors and warnings
  249. result.Errors = errors
  250. result.Warnings = warnings
  251. // Convert any NaNs to 0 to avoid JSON marshaling issues and avoid cascading NaN appearances elsewhere
  252. result.SanitizeNaN()
  253. return result, nil
  254. }
  255. // DateRange checks the data (up to 90 days in the past), and returns the oldest and newest sample timestamp from opencost scraping metric
  256. // it supposed to be a good indicator of available allocation data
  257. func (cm *CostModel) DateRange() (time.Time, time.Time, error) {
  258. ctx := prom.NewNamedContext(cm.PrometheusClient, prom.AllocationContextName)
  259. exportCsvDaysFmt := fmt.Sprintf("%dd", env.GetExportCSVMaxDays())
  260. resOldest, _, err := ctx.QuerySync(fmt.Sprintf(queryFmtOldestSample, env.GetPromClusterFilter(), exportCsvDaysFmt, "1h"))
  261. if err != nil {
  262. return time.Time{}, time.Time{}, fmt.Errorf("querying oldest sample: %w", err)
  263. }
  264. if len(resOldest) == 0 || len(resOldest[0].Values) == 0 {
  265. return time.Time{}, time.Time{}, fmt.Errorf("querying oldest sample: no results")
  266. }
  267. oldest := time.Unix(int64(resOldest[0].Values[0].Value), 0)
  268. resNewest, _, err := ctx.QuerySync(fmt.Sprintf(queryFmtNewestSample, env.GetPromClusterFilter(), exportCsvDaysFmt, "1h"))
  269. if err != nil {
  270. return time.Time{}, time.Time{}, fmt.Errorf("querying newest sample: %w", err)
  271. }
  272. if len(resNewest) == 0 || len(resNewest[0].Values) == 0 {
  273. return time.Time{}, time.Time{}, fmt.Errorf("querying newest sample: no results")
  274. }
  275. newest := time.Unix(int64(resNewest[0].Values[0].Value), 0)
  276. return oldest, newest, nil
  277. }
  278. func (cm *CostModel) computeAllocation(start, end time.Time, resolution time.Duration) (*opencost.AllocationSet, map[nodeKey]*nodePricing, error) {
  279. // 1. Build out Pod map from resolution-tuned, batched Pod start/end query
  280. // 2. Run and apply the results of the remaining queries to
  281. // 3. Build out AllocationSet from completed Pod map
  282. // Create a window spanning the requested query
  283. window := opencost.NewWindow(&start, &end)
  284. // Create an empty AllocationSet. For safety, in the case of an error, we
  285. // should prefer to return this empty set with the error. (In the case of
  286. // no error, of course we populate the set and return it.)
  287. allocSet := opencost.NewAllocationSet(start, end)
  288. // (1) Build out Pod map
  289. // Build out a map of Allocations as a mapping from pod-to-container-to-
  290. // underlying-Allocation instance, starting with (start, end) so that we
  291. // begin with minutes, from which we compute resource allocation and cost
  292. // totals from measured rate data.
  293. podMap := map[podKey]*pod{}
  294. // clusterStarts and clusterEnds record the earliest start and latest end
  295. // times, respectively, on a cluster-basis. These are used for unmounted
  296. // PVs and other "virtual" Allocations so that minutes are maximally
  297. // accurate during start-up or spin-down of a cluster
  298. clusterStart := map[string]time.Time{}
  299. clusterEnd := map[string]time.Time{}
  300. // If ingesting pod UID, we query kube_pod_container_status_running avg
  301. // by uid as well as the default values, and all podKeys/pods have their
  302. // names changed to "<pod_name> <pod_uid>". Because other metrics need
  303. // to generate keys to match pods but don't have UIDs, podUIDKeyMap
  304. // stores values of format:
  305. // default podKey : []{edited podkey 1, edited podkey 2}
  306. // This is because ingesting UID allows us to catch uncontrolled pods
  307. // with the same names. However, this will lead to a many-to-one metric
  308. // to podKey relation, so this map allows us to map the metric's
  309. // "<pod_name>" key to the edited "<pod_name> <pod_uid>" keys in podMap.
  310. ingestPodUID := env.IsIngestingPodUID()
  311. podUIDKeyMap := make(map[podKey][]podKey)
  312. if ingestPodUID {
  313. log.Debugf("CostModel.ComputeAllocation: ingesting UID data from KSM metrics...")
  314. }
  315. // TODO:CLEANUP remove "max batch" idea and clusterStart/End
  316. err := cm.buildPodMap(window, resolution, env.GetETLMaxPrometheusQueryDuration(), podMap, clusterStart, clusterEnd, ingestPodUID, podUIDKeyMap)
  317. if err != nil {
  318. log.Errorf("CostModel.ComputeAllocation: failed to build pod map: %s", err.Error())
  319. }
  320. // (2) Run and apply remaining queries
  321. // Query for the duration between start and end
  322. durStr := timeutil.DurationString(end.Sub(start))
  323. if durStr == "" {
  324. return allocSet, nil, fmt.Errorf("illegal duration value for %s", opencost.NewClosedWindow(start, end))
  325. }
  326. // Convert resolution duration to a query-ready string
  327. resStr := timeutil.DurationString(resolution)
  328. ctx := prom.NewNamedContext(cm.PrometheusClient, prom.AllocationContextName)
  329. queryRAMBytesAllocated := fmt.Sprintf(queryFmtRAMBytesAllocated, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  330. resChRAMBytesAllocated := ctx.QueryAtTime(queryRAMBytesAllocated, end)
  331. queryRAMRequests := fmt.Sprintf(queryFmtRAMRequests, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  332. resChRAMRequests := ctx.QueryAtTime(queryRAMRequests, end)
  333. queryRAMUsageAvg := fmt.Sprintf(queryFmtRAMUsageAvg, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  334. resChRAMUsageAvg := ctx.QueryAtTime(queryRAMUsageAvg, end)
  335. queryRAMUsageMax := fmt.Sprintf(queryFmtRAMUsageMax, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  336. resChRAMUsageMax := ctx.QueryAtTime(queryRAMUsageMax, end)
  337. queryCPUCoresAllocated := fmt.Sprintf(queryFmtCPUCoresAllocated, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  338. resChCPUCoresAllocated := ctx.QueryAtTime(queryCPUCoresAllocated, end)
  339. queryCPURequests := fmt.Sprintf(queryFmtCPURequests, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  340. resChCPURequests := ctx.QueryAtTime(queryCPURequests, end)
  341. queryCPUUsageAvg := fmt.Sprintf(queryFmtCPUUsageAvg, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  342. resChCPUUsageAvg := ctx.QueryAtTime(queryCPUUsageAvg, end)
  343. queryCPUUsageMax := fmt.Sprintf(queryFmtCPUUsageMaxRecordingRule, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  344. resChCPUUsageMax := ctx.QueryAtTime(queryCPUUsageMax, end)
  345. resCPUUsageMax, _ := resChCPUUsageMax.Await()
  346. // If the recording rule has no data, try to fall back to the subquery.
  347. if len(resCPUUsageMax) == 0 {
  348. // The parameter after the metric ...{}[<thisone>] should be set to 2x
  349. // the resolution, to make sure the irate always has two points to query
  350. // in case the Prom scrape duration has been reduced to be equal to the
  351. // resolution.
  352. doubleResStr := timeutil.DurationString(2 * resolution)
  353. queryCPUUsageMax = fmt.Sprintf(queryFmtCPUUsageMaxSubquery, env.GetPromClusterFilter(), doubleResStr, durStr, resStr, env.GetPromClusterLabel())
  354. resChCPUUsageMax = ctx.QueryAtTime(queryCPUUsageMax, end)
  355. resCPUUsageMax, _ = resChCPUUsageMax.Await()
  356. // This avoids logspam if there is no data for either metric (e.g. if
  357. // the Prometheus didn't exist in the queried window of time).
  358. if len(resCPUUsageMax) > 0 {
  359. log.Debugf("CPU usage recording rule query returned an empty result when queried at %s over %s. Fell back to subquery. Consider setting up Kubecost CPU usage recording role to reduce query load on Prometheus; subqueries are expensive.", end.String(), durStr)
  360. }
  361. }
  362. queryGPUsRequested := fmt.Sprintf(queryFmtGPUsRequested, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  363. resChGPUsRequested := ctx.QueryAtTime(queryGPUsRequested, end)
  364. queryGPUsUsageAvg := fmt.Sprintf(queryFmtGPUsUsageAvg, durStr, env.GetPromClusterLabel())
  365. resChGPUsUsageAvg := ctx.Query(queryGPUsUsageAvg)
  366. queryGPUsAllocated := fmt.Sprintf(queryFmtGPUsAllocated, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  367. resChGPUsAllocated := ctx.QueryAtTime(queryGPUsAllocated, end)
  368. queryNodeCostPerCPUHr := fmt.Sprintf(queryFmtNodeCostPerCPUHr, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  369. resChNodeCostPerCPUHr := ctx.QueryAtTime(queryNodeCostPerCPUHr, end)
  370. queryNodeCostPerRAMGiBHr := fmt.Sprintf(queryFmtNodeCostPerRAMGiBHr, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  371. resChNodeCostPerRAMGiBHr := ctx.QueryAtTime(queryNodeCostPerRAMGiBHr, end)
  372. queryNodeCostPerGPUHr := fmt.Sprintf(queryFmtNodeCostPerGPUHr, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  373. resChNodeCostPerGPUHr := ctx.QueryAtTime(queryNodeCostPerGPUHr, end)
  374. queryNodeIsSpot := fmt.Sprintf(queryFmtNodeIsSpot, env.GetPromClusterFilter(), durStr)
  375. resChNodeIsSpot := ctx.QueryAtTime(queryNodeIsSpot, end)
  376. queryPVCInfo := fmt.Sprintf(queryFmtPVCInfo, env.GetPromClusterFilter(), env.GetPromClusterLabel(), durStr, resStr)
  377. resChPVCInfo := ctx.QueryAtTime(queryPVCInfo, end)
  378. queryPodPVCAllocation := fmt.Sprintf(queryFmtPodPVCAllocation, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  379. resChPodPVCAllocation := ctx.QueryAtTime(queryPodPVCAllocation, end)
  380. queryPVCBytesRequested := fmt.Sprintf(queryFmtPVCBytesRequested, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  381. resChPVCBytesRequested := ctx.QueryAtTime(queryPVCBytesRequested, end)
  382. queryPVActiveMins := fmt.Sprintf(queryFmtPVActiveMins, env.GetPromClusterFilter(), env.GetPromClusterLabel(), durStr, resStr)
  383. resChPVActiveMins := ctx.QueryAtTime(queryPVActiveMins, end)
  384. queryPVBytes := fmt.Sprintf(queryFmtPVBytes, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  385. resChPVBytes := ctx.QueryAtTime(queryPVBytes, end)
  386. queryPVCostPerGiBHour := fmt.Sprintf(queryFmtPVCostPerGiBHour, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  387. resChPVCostPerGiBHour := ctx.QueryAtTime(queryPVCostPerGiBHour, end)
  388. queryPVMeta := fmt.Sprintf(queryFmtPVMeta, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  389. resChPVMeta := ctx.QueryAtTime(queryPVMeta, end)
  390. queryNetTransferBytes := fmt.Sprintf(queryFmtNetTransferBytes, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  391. resChNetTransferBytes := ctx.QueryAtTime(queryNetTransferBytes, end)
  392. queryNetReceiveBytes := fmt.Sprintf(queryFmtNetReceiveBytes, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  393. resChNetReceiveBytes := ctx.QueryAtTime(queryNetReceiveBytes, end)
  394. queryNetZoneGiB := fmt.Sprintf(queryFmtNetZoneGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  395. resChNetZoneGiB := ctx.QueryAtTime(queryNetZoneGiB, end)
  396. queryNetZoneCostPerGiB := fmt.Sprintf(queryFmtNetZoneCostPerGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  397. resChNetZoneCostPerGiB := ctx.QueryAtTime(queryNetZoneCostPerGiB, end)
  398. queryNetRegionGiB := fmt.Sprintf(queryFmtNetRegionGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  399. resChNetRegionGiB := ctx.QueryAtTime(queryNetRegionGiB, end)
  400. queryNetRegionCostPerGiB := fmt.Sprintf(queryFmtNetRegionCostPerGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  401. resChNetRegionCostPerGiB := ctx.QueryAtTime(queryNetRegionCostPerGiB, end)
  402. queryNetInternetGiB := fmt.Sprintf(queryFmtNetInternetGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  403. resChNetInternetGiB := ctx.QueryAtTime(queryNetInternetGiB, end)
  404. queryNetInternetCostPerGiB := fmt.Sprintf(queryFmtNetInternetCostPerGiB, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  405. resChNetInternetCostPerGiB := ctx.QueryAtTime(queryNetInternetCostPerGiB, end)
  406. var resChNodeLabels prom.QueryResultsChan
  407. if env.GetAllocationNodeLabelsEnabled() {
  408. queryNodeLabels := fmt.Sprintf(queryFmtNodeLabels, env.GetPromClusterFilter(), durStr)
  409. resChNodeLabels = ctx.QueryAtTime(queryNodeLabels, end)
  410. }
  411. queryNamespaceLabels := fmt.Sprintf(queryFmtNamespaceLabels, env.GetPromClusterFilter(), durStr)
  412. resChNamespaceLabels := ctx.QueryAtTime(queryNamespaceLabels, end)
  413. queryNamespaceAnnotations := fmt.Sprintf(queryFmtNamespaceAnnotations, env.GetPromClusterFilter(), durStr)
  414. resChNamespaceAnnotations := ctx.QueryAtTime(queryNamespaceAnnotations, end)
  415. queryPodLabels := fmt.Sprintf(queryFmtPodLabels, env.GetPromClusterFilter(), durStr)
  416. resChPodLabels := ctx.QueryAtTime(queryPodLabels, end)
  417. queryPodAnnotations := fmt.Sprintf(queryFmtPodAnnotations, env.GetPromClusterFilter(), durStr)
  418. resChPodAnnotations := ctx.QueryAtTime(queryPodAnnotations, end)
  419. queryServiceLabels := fmt.Sprintf(queryFmtServiceLabels, env.GetPromClusterFilter(), durStr)
  420. resChServiceLabels := ctx.QueryAtTime(queryServiceLabels, end)
  421. queryDeploymentLabels := fmt.Sprintf(queryFmtDeploymentLabels, env.GetPromClusterFilter(), durStr)
  422. resChDeploymentLabels := ctx.QueryAtTime(queryDeploymentLabels, end)
  423. queryStatefulSetLabels := fmt.Sprintf(queryFmtStatefulSetLabels, env.GetPromClusterFilter(), durStr)
  424. resChStatefulSetLabels := ctx.QueryAtTime(queryStatefulSetLabels, end)
  425. queryDaemonSetLabels := fmt.Sprintf(queryFmtDaemonSetLabels, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  426. resChDaemonSetLabels := ctx.QueryAtTime(queryDaemonSetLabels, end)
  427. queryPodsWithReplicaSetOwner := fmt.Sprintf(queryFmtPodsWithReplicaSetOwner, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  428. resChPodsWithReplicaSetOwner := ctx.QueryAtTime(queryPodsWithReplicaSetOwner, end)
  429. queryReplicaSetsWithoutOwners := fmt.Sprintf(queryFmtReplicaSetsWithoutOwners, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  430. resChReplicaSetsWithoutOwners := ctx.QueryAtTime(queryReplicaSetsWithoutOwners, end)
  431. queryReplicaSetsWithRolloutOwner := fmt.Sprintf(queryFmtReplicaSetsWithRolloutOwner, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  432. resChReplicaSetsWithRolloutOwner := ctx.QueryAtTime(queryReplicaSetsWithRolloutOwner, end)
  433. queryJobLabels := fmt.Sprintf(queryFmtJobLabels, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  434. resChJobLabels := ctx.QueryAtTime(queryJobLabels, end)
  435. queryLBCostPerHr := fmt.Sprintf(queryFmtLBCostPerHr, env.GetPromClusterFilter(), durStr, env.GetPromClusterLabel())
  436. resChLBCostPerHr := ctx.QueryAtTime(queryLBCostPerHr, end)
  437. queryLBActiveMins := fmt.Sprintf(queryFmtLBActiveMins, env.GetPromClusterFilter(), env.GetPromClusterLabel(), durStr, resStr)
  438. resChLBActiveMins := ctx.QueryAtTime(queryLBActiveMins, end)
  439. resCPUCoresAllocated, _ := resChCPUCoresAllocated.Await()
  440. resCPURequests, _ := resChCPURequests.Await()
  441. resCPUUsageAvg, _ := resChCPUUsageAvg.Await()
  442. resRAMBytesAllocated, _ := resChRAMBytesAllocated.Await()
  443. resRAMRequests, _ := resChRAMRequests.Await()
  444. resRAMUsageAvg, _ := resChRAMUsageAvg.Await()
  445. resRAMUsageMax, _ := resChRAMUsageMax.Await()
  446. resGPUsRequested, _ := resChGPUsRequested.Await()
  447. resGPUsUsageAvg, _ := resChGPUsUsageAvg.Await()
  448. resGPUsAllocated, _ := resChGPUsAllocated.Await()
  449. resNodeCostPerCPUHr, _ := resChNodeCostPerCPUHr.Await()
  450. resNodeCostPerRAMGiBHr, _ := resChNodeCostPerRAMGiBHr.Await()
  451. resNodeCostPerGPUHr, _ := resChNodeCostPerGPUHr.Await()
  452. resNodeIsSpot, _ := resChNodeIsSpot.Await()
  453. nodeExtendedData, _ := queryExtendedNodeData(ctx, start, end, durStr, resStr)
  454. resPVActiveMins, _ := resChPVActiveMins.Await()
  455. resPVBytes, _ := resChPVBytes.Await()
  456. resPVCostPerGiBHour, _ := resChPVCostPerGiBHour.Await()
  457. resPVMeta, _ := resChPVMeta.Await()
  458. resPVCInfo, _ := resChPVCInfo.Await()
  459. resPVCBytesRequested, _ := resChPVCBytesRequested.Await()
  460. resPodPVCAllocation, _ := resChPodPVCAllocation.Await()
  461. resNetTransferBytes, _ := resChNetTransferBytes.Await()
  462. resNetReceiveBytes, _ := resChNetReceiveBytes.Await()
  463. resNetZoneGiB, _ := resChNetZoneGiB.Await()
  464. resNetZoneCostPerGiB, _ := resChNetZoneCostPerGiB.Await()
  465. resNetRegionGiB, _ := resChNetRegionGiB.Await()
  466. resNetRegionCostPerGiB, _ := resChNetRegionCostPerGiB.Await()
  467. resNetInternetGiB, _ := resChNetInternetGiB.Await()
  468. resNetInternetCostPerGiB, _ := resChNetInternetCostPerGiB.Await()
  469. var resNodeLabels []*prom.QueryResult
  470. if env.GetAllocationNodeLabelsEnabled() {
  471. if env.GetAllocationNodeLabelsEnabled() {
  472. resNodeLabels, _ = resChNodeLabels.Await()
  473. }
  474. }
  475. resNamespaceLabels, _ := resChNamespaceLabels.Await()
  476. resNamespaceAnnotations, _ := resChNamespaceAnnotations.Await()
  477. resPodLabels, _ := resChPodLabels.Await()
  478. resPodAnnotations, _ := resChPodAnnotations.Await()
  479. resServiceLabels, _ := resChServiceLabels.Await()
  480. resDeploymentLabels, _ := resChDeploymentLabels.Await()
  481. resStatefulSetLabels, _ := resChStatefulSetLabels.Await()
  482. resDaemonSetLabels, _ := resChDaemonSetLabels.Await()
  483. resPodsWithReplicaSetOwner, _ := resChPodsWithReplicaSetOwner.Await()
  484. resReplicaSetsWithoutOwners, _ := resChReplicaSetsWithoutOwners.Await()
  485. resReplicaSetsWithRolloutOwner, _ := resChReplicaSetsWithRolloutOwner.Await()
  486. resJobLabels, _ := resChJobLabels.Await()
  487. resLBCostPerHr, _ := resChLBCostPerHr.Await()
  488. resLBActiveMins, _ := resChLBActiveMins.Await()
  489. if ctx.HasErrors() {
  490. for _, err := range ctx.Errors() {
  491. log.Errorf("CostModel.ComputeAllocation: query context error %s", err)
  492. }
  493. return allocSet, nil, ctx.ErrorCollection()
  494. }
  495. // We choose to apply allocation before requests in the cases of RAM and
  496. // CPU so that we can assert that allocation should always be greater than
  497. // or equal to request.
  498. applyCPUCoresAllocated(podMap, resCPUCoresAllocated, podUIDKeyMap)
  499. applyCPUCoresRequested(podMap, resCPURequests, podUIDKeyMap)
  500. applyCPUCoresUsedAvg(podMap, resCPUUsageAvg, podUIDKeyMap)
  501. applyCPUCoresUsedMax(podMap, resCPUUsageMax, podUIDKeyMap)
  502. applyRAMBytesAllocated(podMap, resRAMBytesAllocated, podUIDKeyMap)
  503. applyRAMBytesRequested(podMap, resRAMRequests, podUIDKeyMap)
  504. applyRAMBytesUsedAvg(podMap, resRAMUsageAvg, podUIDKeyMap)
  505. applyRAMBytesUsedMax(podMap, resRAMUsageMax, podUIDKeyMap)
  506. applyGPUUsageAvg(podMap, resGPUsUsageAvg, podUIDKeyMap)
  507. applyGPUsAllocated(podMap, resGPUsRequested, resGPUsAllocated, podUIDKeyMap)
  508. applyNetworkTotals(podMap, resNetTransferBytes, resNetReceiveBytes, podUIDKeyMap)
  509. applyNetworkAllocation(podMap, resNetZoneGiB, resNetZoneCostPerGiB, podUIDKeyMap, networkCrossZoneCost)
  510. applyNetworkAllocation(podMap, resNetRegionGiB, resNetRegionCostPerGiB, podUIDKeyMap, networkCrossRegionCost)
  511. applyNetworkAllocation(podMap, resNetInternetGiB, resNetInternetCostPerGiB, podUIDKeyMap, networkInternetCost)
  512. // In the case that a two pods with the same name had different containers,
  513. // we will double-count the containers. There is no way to associate each
  514. // container with the proper pod from the usage metrics above. This will
  515. // show up as a pod having two Allocations running for the whole pod runtime.
  516. // Other than that case, Allocations should be associated with pods by the
  517. // above functions.
  518. // At this point, we expect "Node" to be set by one of the above functions
  519. // (e.g. applyCPUCoresAllocated, etc.) -- otherwise, node labels will fail
  520. // to correctly apply to the pods.
  521. var nodeLabels map[nodeKey]map[string]string
  522. if env.GetAllocationNodeLabelsEnabled() {
  523. nodeLabels = resToNodeLabels(resNodeLabels)
  524. }
  525. namespaceLabels := resToNamespaceLabels(resNamespaceLabels)
  526. podLabels := resToPodLabels(resPodLabels, podUIDKeyMap, ingestPodUID)
  527. namespaceAnnotations := resToNamespaceAnnotations(resNamespaceAnnotations)
  528. podAnnotations := resToPodAnnotations(resPodAnnotations, podUIDKeyMap, ingestPodUID)
  529. applyLabels(podMap, nodeLabels, namespaceLabels, podLabels)
  530. applyAnnotations(podMap, namespaceAnnotations, podAnnotations)
  531. podDeploymentMap := labelsToPodControllerMap(podLabels, resToDeploymentLabels(resDeploymentLabels))
  532. podStatefulSetMap := labelsToPodControllerMap(podLabels, resToStatefulSetLabels(resStatefulSetLabels))
  533. podDaemonSetMap := resToPodDaemonSetMap(resDaemonSetLabels, podUIDKeyMap, ingestPodUID)
  534. podJobMap := resToPodJobMap(resJobLabels, podUIDKeyMap, ingestPodUID)
  535. podReplicaSetMap := resToPodReplicaSetMap(resPodsWithReplicaSetOwner, resReplicaSetsWithoutOwners, resReplicaSetsWithRolloutOwner, podUIDKeyMap, ingestPodUID)
  536. applyControllersToPods(podMap, podDeploymentMap)
  537. applyControllersToPods(podMap, podStatefulSetMap)
  538. applyControllersToPods(podMap, podDaemonSetMap)
  539. applyControllersToPods(podMap, podJobMap)
  540. applyControllersToPods(podMap, podReplicaSetMap)
  541. serviceLabels := getServiceLabels(resServiceLabels)
  542. allocsByService := map[serviceKey][]*opencost.Allocation{}
  543. applyServicesToPods(podMap, podLabels, allocsByService, serviceLabels)
  544. // TODO breakdown network costs?
  545. // Build out the map of all PVs with class, size and cost-per-hour.
  546. // Note: this does not record time running, which we may want to
  547. // include later for increased PV precision. (As long as the PV has
  548. // a PVC, we get time running there, so this is only inaccurate
  549. // for short-lived, unmounted PVs.)
  550. pvMap := map[pvKey]*pv{}
  551. buildPVMap(resolution, pvMap, resPVCostPerGiBHour, resPVActiveMins, resPVMeta, window)
  552. applyPVBytes(pvMap, resPVBytes)
  553. // Build out the map of all PVCs with time running, bytes requested,
  554. // and connect to the correct PV from pvMap. (If no PV exists, that
  555. // is noted, but does not result in any allocation/cost.)
  556. pvcMap := map[pvcKey]*pvc{}
  557. buildPVCMap(resolution, pvcMap, pvMap, resPVCInfo, window)
  558. applyPVCBytesRequested(pvcMap, resPVCBytesRequested)
  559. // Build out the relationships of pods to their PVCs. This step
  560. // populates the pvc.Count field so that pvc allocation can be
  561. // split appropriately among each pod's container allocation.
  562. podPVCMap := map[podKey][]*pvc{}
  563. buildPodPVCMap(podPVCMap, pvMap, pvcMap, podMap, resPodPVCAllocation, podUIDKeyMap, ingestPodUID)
  564. applyPVCsToPods(window, podMap, podPVCMap, pvcMap)
  565. // Identify PVCs without pods and add pv costs to the unmounted Allocation for the pvc's cluster
  566. applyUnmountedPVCs(window, podMap, pvcMap)
  567. // Identify PVs without PVCs and add PV costs to the unmounted Allocation for the PV's cluster
  568. applyUnmountedPVs(window, podMap, pvMap, pvcMap)
  569. lbMap := make(map[serviceKey]*lbCost)
  570. getLoadBalancerCosts(lbMap, resLBCostPerHr, resLBActiveMins, resolution, window)
  571. applyLoadBalancersToPods(window, podMap, lbMap, allocsByService)
  572. // Build out a map of Nodes with resource costs, discounts, and node types
  573. // for converting resource allocation data to cumulative costs.
  574. nodeMap := map[nodeKey]*nodePricing{}
  575. applyNodeCostPerCPUHr(nodeMap, resNodeCostPerCPUHr)
  576. applyNodeCostPerRAMGiBHr(nodeMap, resNodeCostPerRAMGiBHr)
  577. applyNodeCostPerGPUHr(nodeMap, resNodeCostPerGPUHr)
  578. applyNodeSpot(nodeMap, resNodeIsSpot)
  579. applyNodeDiscount(nodeMap, cm)
  580. applyExtendedNodeData(nodeMap, nodeExtendedData)
  581. cm.applyNodesToPod(podMap, nodeMap)
  582. // (3) Build out AllocationSet from Pod map
  583. for _, pod := range podMap {
  584. for _, alloc := range pod.Allocations {
  585. cluster := alloc.Properties.Cluster
  586. nodeName := alloc.Properties.Node
  587. namespace := alloc.Properties.Namespace
  588. podName := alloc.Properties.Pod
  589. container := alloc.Properties.Container
  590. // Make sure that the name is correct (node may not be present at this
  591. // point due to it missing from queryMinutes) then insert.
  592. alloc.Name = fmt.Sprintf("%s/%s/%s/%s/%s", cluster, nodeName, namespace, podName, container)
  593. allocSet.Set(alloc)
  594. }
  595. }
  596. return allocSet, nodeMap, nil
  597. }