allocation.go 35 KB

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