cluster_helpers.go 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923
  1. package costmodel
  2. import (
  3. "strconv"
  4. "time"
  5. "github.com/opencost/opencost/pkg/cloud/models"
  6. "github.com/opencost/opencost/pkg/cloud/provider"
  7. "github.com/opencost/opencost/core/pkg/log"
  8. "github.com/opencost/opencost/core/pkg/opencost"
  9. "github.com/opencost/opencost/core/pkg/source"
  10. "github.com/opencost/opencost/core/pkg/util"
  11. "github.com/opencost/opencost/pkg/env"
  12. )
  13. // mergeTypeMaps takes two maps of (cluster name, node name) -> node type
  14. // and combines them into a single map, preferring the k/v pairs in
  15. // the first map.
  16. func mergeTypeMaps(clusterAndNameToType1, clusterAndNameToType2 map[nodeIdentifierNoProviderID]string) map[nodeIdentifierNoProviderID]string {
  17. merged := map[nodeIdentifierNoProviderID]string{}
  18. for k, v := range clusterAndNameToType2 {
  19. merged[k] = v
  20. }
  21. // This ordering ensures the mappings in the first arg are preferred.
  22. for k, v := range clusterAndNameToType1 {
  23. merged[k] = v
  24. }
  25. return merged
  26. }
  27. func buildCPUCostMap(
  28. resNodeCPUCost []*source.NodeCPUPricePerHrResult,
  29. cp models.Provider,
  30. preemptible map[NodeIdentifier]bool,
  31. ) (map[NodeIdentifier]float64, map[nodeIdentifierNoProviderID]string) {
  32. cpuCostMap := make(map[NodeIdentifier]float64)
  33. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  34. customPricingEnabled := provider.CustomPricesEnabled(cp)
  35. customPricingConfig, err := cp.GetConfig()
  36. if err != nil {
  37. log.Warnf("ClusterNodes: failed to load custom pricing: %s", err)
  38. }
  39. for _, result := range resNodeCPUCost {
  40. cluster := result.Cluster
  41. if cluster == "" {
  42. cluster = env.GetClusterID()
  43. }
  44. name := result.Node
  45. if name == "" {
  46. log.Warnf("ClusterNodes: CPU cost data missing node")
  47. continue
  48. }
  49. nodeType := result.InstanceType
  50. providerID := result.ProviderID
  51. key := NodeIdentifier{
  52. Cluster: cluster,
  53. Name: name,
  54. ProviderID: provider.ParseID(providerID),
  55. }
  56. keyNon := nodeIdentifierNoProviderID{
  57. Cluster: cluster,
  58. Name: name,
  59. }
  60. var cpuCost float64
  61. if customPricingEnabled && customPricingConfig != nil {
  62. var customCPUStr string
  63. if spot, ok := preemptible[key]; ok && spot {
  64. customCPUStr = customPricingConfig.SpotCPU
  65. } else {
  66. customCPUStr = customPricingConfig.CPU
  67. }
  68. customCPUCost, err := strconv.ParseFloat(customCPUStr, 64)
  69. if err != nil {
  70. log.Warnf("ClusterNodes: error parsing custom CPU price: %s", customCPUStr)
  71. }
  72. cpuCost = customCPUCost
  73. } else {
  74. cpuCost = result.Data[0].Value
  75. }
  76. clusterAndNameToType[keyNon] = nodeType
  77. cpuCostMap[key] = cpuCost
  78. }
  79. return cpuCostMap, clusterAndNameToType
  80. }
  81. func buildRAMCostMap(
  82. resNodeRAMCost []*source.NodeRAMPricePerGiBHrResult,
  83. cp models.Provider,
  84. preemptible map[NodeIdentifier]bool,
  85. ) (map[NodeIdentifier]float64, map[nodeIdentifierNoProviderID]string) {
  86. ramCostMap := make(map[NodeIdentifier]float64)
  87. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  88. customPricingEnabled := provider.CustomPricesEnabled(cp)
  89. customPricingConfig, err := cp.GetConfig()
  90. if err != nil {
  91. log.Warnf("ClusterNodes: failed to load custom pricing: %s", err)
  92. }
  93. for _, result := range resNodeRAMCost {
  94. cluster := result.Cluster
  95. if cluster == "" {
  96. cluster = env.GetClusterID()
  97. }
  98. name := result.Node
  99. if name == "" {
  100. log.Warnf("ClusterNodes: RAM cost data missing node")
  101. continue
  102. }
  103. nodeType := result.InstanceType
  104. providerID := result.ProviderID
  105. key := NodeIdentifier{
  106. Cluster: cluster,
  107. Name: name,
  108. ProviderID: provider.ParseID(providerID),
  109. }
  110. keyNon := nodeIdentifierNoProviderID{
  111. Cluster: cluster,
  112. Name: name,
  113. }
  114. var ramCost float64
  115. if customPricingEnabled && customPricingConfig != nil {
  116. var customRAMStr string
  117. if spot, ok := preemptible[key]; ok && spot {
  118. customRAMStr = customPricingConfig.SpotRAM
  119. } else {
  120. customRAMStr = customPricingConfig.RAM
  121. }
  122. customRAMCost, err := strconv.ParseFloat(customRAMStr, 64)
  123. if err != nil {
  124. log.Warnf("ClusterNodes: error parsing custom RAM price: %s", customRAMStr)
  125. }
  126. ramCost = customRAMCost
  127. } else {
  128. ramCost = result.Data[0].Value
  129. }
  130. clusterAndNameToType[keyNon] = nodeType
  131. // covert to price per byte/hr
  132. ramCostMap[key] = ramCost / 1024.0 / 1024.0 / 1024.0
  133. }
  134. return ramCostMap, clusterAndNameToType
  135. }
  136. func buildGPUCostMap(
  137. resNodeGPUCost []*source.NodeGPUPricePerHrResult,
  138. gpuCountMap map[NodeIdentifier]float64,
  139. cp models.Provider,
  140. preemptible map[NodeIdentifier]bool,
  141. ) (map[NodeIdentifier]float64, map[nodeIdentifierNoProviderID]string) {
  142. gpuCostMap := make(map[NodeIdentifier]float64)
  143. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  144. customPricingEnabled := provider.CustomPricesEnabled(cp)
  145. customPricingConfig, err := cp.GetConfig()
  146. if err != nil {
  147. log.Warnf("ClusterNodes: failed to load custom pricing: %s", err)
  148. }
  149. for _, result := range resNodeGPUCost {
  150. cluster := result.Cluster
  151. if cluster == "" {
  152. cluster = env.GetClusterID()
  153. }
  154. name := result.Node
  155. if name == "" {
  156. log.Warnf("ClusterNodes: GPU cost data missing node")
  157. continue
  158. }
  159. nodeType := result.InstanceType
  160. providerID := result.ProviderID
  161. key := NodeIdentifier{
  162. Cluster: cluster,
  163. Name: name,
  164. ProviderID: provider.ParseID(providerID),
  165. }
  166. keyNon := nodeIdentifierNoProviderID{
  167. Cluster: cluster,
  168. Name: name,
  169. }
  170. var gpuCost float64
  171. if customPricingEnabled && customPricingConfig != nil {
  172. var customGPUStr string
  173. if spot, ok := preemptible[key]; ok && spot {
  174. customGPUStr = customPricingConfig.SpotGPU
  175. } else {
  176. customGPUStr = customPricingConfig.GPU
  177. }
  178. customGPUCost, err := strconv.ParseFloat(customGPUStr, 64)
  179. if err != nil {
  180. log.Warnf("ClusterNodes: error parsing custom GPU price: %s", customGPUStr)
  181. }
  182. gpuCost = customGPUCost
  183. } else {
  184. gpuCost = result.Data[0].Value
  185. }
  186. clusterAndNameToType[keyNon] = nodeType
  187. // If gpu count is available use it to multiply gpu cost
  188. if value, ok := gpuCountMap[key]; ok {
  189. gpuCostMap[key] = gpuCost * value
  190. } else {
  191. gpuCostMap[key] = 0
  192. }
  193. }
  194. return gpuCostMap, clusterAndNameToType
  195. }
  196. func buildGPUCountMap(resNodeGPUCount []*source.NodeGPUCountResult) map[NodeIdentifier]float64 {
  197. gpuCountMap := make(map[NodeIdentifier]float64)
  198. for _, result := range resNodeGPUCount {
  199. cluster := result.Cluster
  200. if cluster == "" {
  201. cluster = env.GetClusterID()
  202. }
  203. name := result.Node
  204. if name == "" {
  205. log.Warnf("ClusterNodes: GPU count data missing node")
  206. continue
  207. }
  208. gpuCount := result.Data[0].Value
  209. providerID := result.ProviderID
  210. key := NodeIdentifier{
  211. Cluster: cluster,
  212. Name: name,
  213. ProviderID: provider.ParseID(providerID),
  214. }
  215. gpuCountMap[key] = gpuCount
  216. }
  217. return gpuCountMap
  218. }
  219. func buildCPUCoresMap(resNodeCPUCores []*source.NodeCPUCoresCapacityResult) map[nodeIdentifierNoProviderID]float64 {
  220. m := make(map[nodeIdentifierNoProviderID]float64)
  221. for _, result := range resNodeCPUCores {
  222. cluster := result.Cluster
  223. if cluster == "" {
  224. cluster = env.GetClusterID()
  225. }
  226. name := result.Node
  227. if name == "" {
  228. log.Warnf("ClusterNodes: CPU cores data missing node")
  229. continue
  230. }
  231. cpuCores := result.Data[0].Value
  232. key := nodeIdentifierNoProviderID{
  233. Cluster: cluster,
  234. Name: name,
  235. }
  236. m[key] = cpuCores
  237. }
  238. return m
  239. }
  240. func buildRAMBytesMap(resNodeRAMBytes []*source.NodeRAMBytesCapacityResult) map[nodeIdentifierNoProviderID]float64 {
  241. m := make(map[nodeIdentifierNoProviderID]float64)
  242. for _, result := range resNodeRAMBytes {
  243. cluster := result.Cluster
  244. if cluster == "" {
  245. cluster = env.GetClusterID()
  246. }
  247. name := result.Node
  248. if name == "" {
  249. log.Warnf("ClusterNodes: RAM bytes data missing node")
  250. continue
  251. }
  252. ramBytes := result.Data[0].Value
  253. key := nodeIdentifierNoProviderID{
  254. Cluster: cluster,
  255. Name: name,
  256. }
  257. m[key] = ramBytes
  258. }
  259. return m
  260. }
  261. // Mapping of cluster/node=cpu for computing resource efficiency
  262. func buildCPUBreakdownMap(resNodeCPUModeTotal []*source.NodeCPUModeTotalResult) map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown {
  263. cpuBreakdownMap := make(map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown)
  264. // Mapping of cluster/node=cpu for computing resource efficiency
  265. clusterNodeCPUTotal := map[nodeIdentifierNoProviderID]float64{}
  266. // Mapping of cluster/node:mode=cpu for computing resource efficiency
  267. clusterNodeModeCPUTotal := map[nodeIdentifierNoProviderID]map[string]float64{}
  268. // Build intermediate structures for CPU usage by (cluster, node) and by
  269. // (cluster, node, mode) for computing resouce efficiency
  270. for _, result := range resNodeCPUModeTotal {
  271. cluster := result.Cluster
  272. if cluster == "" {
  273. cluster = env.GetClusterID()
  274. }
  275. node := result.Node
  276. if node == "" {
  277. log.DedupedWarningf(5, "ClusterNodes: CPU mode data missing node")
  278. continue
  279. }
  280. mode := result.Mode
  281. if mode == "" {
  282. log.Warnf("ClusterNodes: unable to read CPU mode data.")
  283. mode = "other"
  284. }
  285. key := nodeIdentifierNoProviderID{
  286. Cluster: cluster,
  287. Name: node,
  288. }
  289. total := result.Data[0].Value
  290. // Increment total
  291. clusterNodeCPUTotal[key] += total
  292. // Increment mode
  293. if _, ok := clusterNodeModeCPUTotal[key]; !ok {
  294. clusterNodeModeCPUTotal[key] = map[string]float64{}
  295. }
  296. clusterNodeModeCPUTotal[key][mode] += total
  297. }
  298. // Compute resource efficiency from intermediate structures
  299. for key, total := range clusterNodeCPUTotal {
  300. if modeTotals, ok := clusterNodeModeCPUTotal[key]; ok {
  301. for mode, subtotal := range modeTotals {
  302. // Compute percentage for the current cluster, node, mode
  303. pct := 0.0
  304. if total > 0 {
  305. pct = subtotal / total
  306. }
  307. if _, ok := cpuBreakdownMap[key]; !ok {
  308. cpuBreakdownMap[key] = &ClusterCostsBreakdown{}
  309. }
  310. switch mode {
  311. case "idle":
  312. cpuBreakdownMap[key].Idle += pct
  313. case "system":
  314. cpuBreakdownMap[key].System += pct
  315. case "user":
  316. cpuBreakdownMap[key].User += pct
  317. default:
  318. cpuBreakdownMap[key].Other += pct
  319. }
  320. }
  321. }
  322. }
  323. return cpuBreakdownMap
  324. }
  325. func buildOverheadMap(capRam, allocRam, capCPU, allocCPU map[nodeIdentifierNoProviderID]float64) map[nodeIdentifierNoProviderID]*NodeOverhead {
  326. m := make(map[nodeIdentifierNoProviderID]*NodeOverhead, len(capRam))
  327. for identifier, ramCapacity := range capRam {
  328. allocatableRam, ok := allocRam[identifier]
  329. if !ok {
  330. log.Warnf("Could not find allocatable ram for node %s", identifier.Name)
  331. continue
  332. }
  333. overheadBytes := ramCapacity - allocatableRam
  334. m[identifier] = &NodeOverhead{
  335. RamOverheadFraction: overheadBytes / ramCapacity,
  336. }
  337. }
  338. for identifier, cpuCapacity := range capCPU {
  339. allocatableCPU, ok := allocCPU[identifier]
  340. if !ok {
  341. log.Warnf("Could not find allocatable cpu for node %s", identifier.Name)
  342. continue
  343. }
  344. overhead := cpuCapacity - allocatableCPU
  345. if _, found := m[identifier]; found {
  346. m[identifier].CpuOverheadFraction = overhead / cpuCapacity
  347. } else {
  348. m[identifier] = &NodeOverhead{
  349. CpuOverheadFraction: overhead / cpuCapacity,
  350. }
  351. }
  352. }
  353. return m
  354. }
  355. func buildRAMUserPctMap(resNodeRAMUserPct []*source.NodeRAMUserPercentResult) map[nodeIdentifierNoProviderID]float64 {
  356. m := make(map[nodeIdentifierNoProviderID]float64)
  357. for _, result := range resNodeRAMUserPct {
  358. cluster := result.Cluster
  359. if cluster == "" {
  360. cluster = env.GetClusterID()
  361. }
  362. name := result.Instance
  363. if name == "" {
  364. log.Warnf("ClusterNodes: RAM user percent missing node")
  365. continue
  366. }
  367. pct := result.Data[0].Value
  368. key := nodeIdentifierNoProviderID{
  369. Cluster: cluster,
  370. Name: name,
  371. }
  372. m[key] = pct
  373. }
  374. return m
  375. }
  376. func buildRAMSystemPctMap(resNodeRAMSystemPct []*source.NodeRAMSystemPercentResult) map[nodeIdentifierNoProviderID]float64 {
  377. m := make(map[nodeIdentifierNoProviderID]float64)
  378. for _, result := range resNodeRAMSystemPct {
  379. cluster := result.Cluster
  380. if cluster == "" {
  381. cluster = env.GetClusterID()
  382. }
  383. name := result.Instance
  384. if name == "" {
  385. log.Warnf("ClusterNodes: RAM system percent missing node")
  386. continue
  387. }
  388. pct := result.Data[0].Value
  389. key := nodeIdentifierNoProviderID{
  390. Cluster: cluster,
  391. Name: name,
  392. }
  393. m[key] = pct
  394. }
  395. return m
  396. }
  397. type activeData struct {
  398. start time.Time
  399. end time.Time
  400. minutes float64
  401. }
  402. // cluster management key gen
  403. func clusterManagementKeyGen(result *source.ClusterManagementDurationResult) (ClusterManagementIdentifier, bool) {
  404. cluster := result.Cluster
  405. if cluster == "" {
  406. cluster = env.GetClusterID()
  407. }
  408. provisionerName := result.Provisioner
  409. return ClusterManagementIdentifier{
  410. Cluster: cluster,
  411. Provisioner: provisionerName,
  412. }, true
  413. }
  414. func clusterManagementValues(result *source.ClusterManagementDurationResult) []*util.Vector {
  415. return result.Data
  416. }
  417. // node key gen
  418. func nodeKeyGen(result *source.NodeActiveMinutesResult) (NodeIdentifier, bool) {
  419. cluster := result.Cluster
  420. if cluster == "" {
  421. cluster = env.GetClusterID()
  422. }
  423. name := result.Node
  424. if name == "" {
  425. log.Warnf("ClusterNodes: active mins missing node")
  426. return NodeIdentifier{}, false
  427. }
  428. providerID := result.ProviderID
  429. return NodeIdentifier{
  430. Cluster: cluster,
  431. Name: name,
  432. ProviderID: provider.ParseID(providerID),
  433. }, true
  434. }
  435. func nodeValues(result *source.NodeActiveMinutesResult) []*util.Vector {
  436. return result.Data
  437. }
  438. func loadBalancerKeyGen(result *source.LBActiveMinutesResult) (LoadBalancerIdentifier, bool) {
  439. cluster := result.Cluster
  440. if cluster == "" {
  441. cluster = env.GetClusterID()
  442. }
  443. namespace := result.Namespace
  444. if namespace == "" {
  445. log.Warnf("ClusterLoadBalancers: LB cost data missing namespace")
  446. return LoadBalancerIdentifier{}, false
  447. }
  448. name := result.Service
  449. if name == "" {
  450. log.Warnf("ClusterLoadBalancers: LB cost data missing service_name")
  451. return LoadBalancerIdentifier{}, false
  452. }
  453. ingressIp := result.IngressIP
  454. if ingressIp == "" {
  455. log.DedupedWarningf(5, "ClusterLoadBalancers: LB cost data missing ingress_ip")
  456. // only update asset cost when an actual IP was returned
  457. return LoadBalancerIdentifier{}, false
  458. }
  459. return LoadBalancerIdentifier{
  460. Cluster: cluster,
  461. Namespace: namespace,
  462. Name: name,
  463. IngressIP: ingressIp,
  464. }, true
  465. }
  466. func lbValues(result *source.LBActiveMinutesResult) []*util.Vector {
  467. return result.Data
  468. }
  469. func buildActiveDataMap[T comparable, U any](results []*U, keyGen func(*U) (T, bool), valuesFunc func(*U) []*util.Vector, resolution time.Duration, window opencost.Window) map[T]activeData {
  470. m := make(map[T]activeData)
  471. for _, result := range results {
  472. key, ok := keyGen(result)
  473. values := valuesFunc(result)
  474. if !ok || len(values) == 0 {
  475. continue
  476. }
  477. s, e := calculateStartAndEnd(values, resolution, window)
  478. mins := e.Sub(s).Minutes()
  479. m[key] = activeData{
  480. start: s,
  481. end: e,
  482. minutes: mins,
  483. }
  484. }
  485. return m
  486. }
  487. // Determine preemptibility with node labels
  488. // node id -> is preemptible?
  489. func buildPreemptibleMap(
  490. resIsSpot []*source.NodeIsSpotResult,
  491. ) map[NodeIdentifier]bool {
  492. m := make(map[NodeIdentifier]bool)
  493. for _, result := range resIsSpot {
  494. cluster := result.Cluster
  495. if cluster == "" {
  496. cluster = env.GetClusterID()
  497. }
  498. name := result.Node
  499. if name == "" {
  500. log.Warnf("ClusterNodes: active mins missing node")
  501. continue
  502. }
  503. providerID := result.ProviderID
  504. key := NodeIdentifier{
  505. Cluster: cluster,
  506. Name: name,
  507. ProviderID: provider.ParseID(providerID),
  508. }
  509. // GCP preemptible label
  510. pre := result.Data[0].Value
  511. // TODO(michaelmdresser): check this condition at merge time?
  512. // if node, ok := nodeMap[key]; pre > 0.0 && ok {
  513. // node.Preemptible = true
  514. // }
  515. m[key] = pre > 0.0
  516. // TODO AWS preemptible
  517. // TODO Azure preemptible
  518. }
  519. return m
  520. }
  521. func buildAssetsPVCMap(resPVCInfo []*source.PVCInfoResult) map[DiskIdentifier]*Disk {
  522. diskMap := map[DiskIdentifier]*Disk{}
  523. for _, result := range resPVCInfo {
  524. cluster := result.Cluster
  525. if cluster == "" {
  526. cluster = env.GetClusterID()
  527. }
  528. volumeName := result.VolumeName
  529. if volumeName == "" {
  530. log.Debugf("ClusterDisks: pv claim data missing volumename")
  531. continue
  532. }
  533. claimName := result.PersistentVolumeClaim
  534. if claimName == "" {
  535. log.Debugf("ClusterDisks: pv claim data missing persistentvolumeclaim")
  536. continue
  537. }
  538. claimNamespace := result.Namespace
  539. if claimNamespace == "" {
  540. log.Debugf("ClusterDisks: pv claim data missing namespace")
  541. continue
  542. }
  543. key := DiskIdentifier{cluster, volumeName}
  544. if _, ok := diskMap[key]; !ok {
  545. diskMap[key] = &Disk{
  546. Cluster: cluster,
  547. Name: volumeName,
  548. Breakdown: &ClusterCostsBreakdown{},
  549. }
  550. }
  551. diskMap[key].VolumeName = volumeName
  552. diskMap[key].ClaimName = claimName
  553. diskMap[key].ClaimNamespace = claimNamespace
  554. }
  555. return diskMap
  556. }
  557. func buildLabelsMap(
  558. resLabels []*source.NodeLabelsResult,
  559. ) map[nodeIdentifierNoProviderID]map[string]string {
  560. m := make(map[nodeIdentifierNoProviderID]map[string]string)
  561. // Copy labels into node
  562. for _, result := range resLabels {
  563. cluster := result.Cluster
  564. if cluster == "" {
  565. cluster = env.GetClusterID()
  566. }
  567. node := result.Node
  568. if node == "" {
  569. log.DedupedWarningf(5, "ClusterNodes: label data missing node")
  570. continue
  571. }
  572. key := nodeIdentifierNoProviderID{
  573. Cluster: cluster,
  574. Name: node,
  575. }
  576. // The QueryResult.GetLabels function needs to be called to sanitize the
  577. // ingested label data. This removes the label_ prefix that prometheus
  578. // adds to emitted labels. It also keeps from ingesting prometheus labels
  579. // that aren't a part of the asset.
  580. if _, ok := m[key]; !ok {
  581. m[key] = map[string]string{}
  582. }
  583. for k, l := range result.Labels {
  584. m[key][k] = l
  585. }
  586. }
  587. return m
  588. }
  589. // checkForKeyAndInitIfMissing inits a key in the provided nodemap if
  590. // it does not exist. Intended to be called ONLY by buildNodeMap
  591. func checkForKeyAndInitIfMissing(
  592. nodeMap map[NodeIdentifier]*Node,
  593. key NodeIdentifier,
  594. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  595. ) {
  596. if _, ok := nodeMap[key]; !ok {
  597. // default nodeType in case we don't have the mapping
  598. var nodeType string
  599. if t, ok := clusterAndNameToType[nodeIdentifierNoProviderID{
  600. Cluster: key.Cluster,
  601. Name: key.Name,
  602. }]; ok {
  603. nodeType = t
  604. } else {
  605. log.Warnf("ClusterNodes: Type does not exist for node identifier %s", key)
  606. }
  607. nodeMap[key] = &Node{
  608. Cluster: key.Cluster,
  609. Name: key.Name,
  610. NodeType: nodeType,
  611. ProviderID: key.ProviderID,
  612. CPUBreakdown: &ClusterCostsBreakdown{},
  613. RAMBreakdown: &ClusterCostsBreakdown{},
  614. }
  615. }
  616. }
  617. // buildNodeMap creates the main set of node data for ClusterNodes from
  618. // the data maps built from Prometheus queries. Some of the Prometheus
  619. // data has access to the provider_id field and some does not. To get
  620. // around this problem, we use the data that includes provider_id
  621. // to build up the definitive set of nodes and then use the data
  622. // with less-specific identifiers (i.e. without provider_id) to fill
  623. // in the remaining fields.
  624. //
  625. // For example, let's say we have nodes identified like so:
  626. // cluster name/node name/provider_id. For the sake of the example,
  627. // we will also limit data to CPU cost, CPU cores, and preemptibility.
  628. //
  629. // We have CPU cost data that looks like this:
  630. // cluster1/node1/prov_node1_A: $10
  631. // cluster1/node1/prov_node1_B: $8
  632. // cluster1/node2/prov_node2: $15
  633. //
  634. // We have Preemptible data that looks like this:
  635. // cluster1/node1/prov_node1_A: true
  636. // cluster1/node1/prov_node1_B: false
  637. // cluster1/node2/prov_node2_B: false
  638. //
  639. // We have CPU cores data that looks like this:
  640. // cluster1/node1: 4
  641. // cluster1/node2: 6
  642. //
  643. // This function first combines the data that is fully identified,
  644. // creating the following:
  645. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true)
  646. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false)
  647. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false)
  648. //
  649. // It then uses the less-specific data to extend the specific data,
  650. // making the following:
  651. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true), Cores(4)
  652. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false), Cores(4)
  653. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false), Cores(6)
  654. //
  655. // In the situation where provider_id doesn't exist for any metrics,
  656. // that is the same as all provider_ids being empty strings. If
  657. // provider_id doesn't exist at all, then we (without having to do
  658. // extra work) easily fall back on identifying nodes only by cluster name
  659. // and node name because the provider_id part of the key will always
  660. // be the empty string.
  661. //
  662. // It is worth nothing that, in this approach, if a node is not present
  663. // in the more specific data but is present in the less-specific data,
  664. // that data is never processed into the final node map. For example,
  665. // let's say the CPU cores map has the following entry:
  666. // cluster1/node8: 6
  667. // But none of the maps with provider_id (CPU cost, RAM cost, etc.)
  668. // have an identifier for cluster1/node8 (regardless of provider_id).
  669. // In this situation, the final node map will not have a cluster1/node8
  670. // entry. This could be fixed by iterating over all of the less specific
  671. // identifiers and, inside that iteration, all of the identifiers in
  672. // the node map, but this would introduce a roughly quadratic time
  673. // complexity.
  674. func buildNodeMap(
  675. cpuCostMap, ramCostMap, gpuCostMap, gpuCountMap map[NodeIdentifier]float64,
  676. cpuCoresMap, ramBytesMap, ramUserPctMap,
  677. ramSystemPctMap map[nodeIdentifierNoProviderID]float64,
  678. cpuBreakdownMap map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown,
  679. activeDataMap map[NodeIdentifier]activeData,
  680. preemptibleMap map[NodeIdentifier]bool,
  681. labelsMap map[nodeIdentifierNoProviderID]map[string]string,
  682. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  683. overheadMap map[nodeIdentifierNoProviderID]*NodeOverhead,
  684. ) map[NodeIdentifier]*Node {
  685. nodeMap := make(map[NodeIdentifier]*Node)
  686. // Initialize the map with the most-specific data:
  687. for id, cost := range cpuCostMap {
  688. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  689. nodeMap[id].CPUCost = cost
  690. }
  691. for id, cost := range ramCostMap {
  692. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  693. nodeMap[id].RAMCost = cost
  694. }
  695. for id, cost := range gpuCostMap {
  696. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  697. nodeMap[id].GPUCost = cost
  698. }
  699. for id, count := range gpuCountMap {
  700. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  701. nodeMap[id].GPUCount = count
  702. }
  703. for id, preemptible := range preemptibleMap {
  704. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  705. nodeMap[id].Preemptible = preemptible
  706. }
  707. for id, activeData := range activeDataMap {
  708. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  709. nodeMap[id].Start = activeData.start
  710. nodeMap[id].End = activeData.end
  711. nodeMap[id].Minutes = nodeMap[id].End.Sub(nodeMap[id].Start).Minutes()
  712. }
  713. // We now merge in data that doesn't have a provider id by looping over
  714. // all keys already added and inserting data according to their
  715. // cluster name/node name combos.
  716. for id, nodePtr := range nodeMap {
  717. clusterAndNameID := nodeIdentifierNoProviderID{
  718. Cluster: id.Cluster,
  719. Name: id.Name,
  720. }
  721. if cores, ok := cpuCoresMap[clusterAndNameID]; ok {
  722. nodePtr.CPUCores = cores
  723. if v, ok := partialCPUMap[nodePtr.NodeType]; ok {
  724. if cores > 0 {
  725. nodePtr.CPUCores = v
  726. adjustmentFactor := v / cores
  727. nodePtr.CPUCost = nodePtr.CPUCost * adjustmentFactor
  728. }
  729. }
  730. }
  731. if ramBytes, ok := ramBytesMap[clusterAndNameID]; ok {
  732. nodePtr.RAMBytes = ramBytes
  733. }
  734. if ramUserPct, ok := ramUserPctMap[clusterAndNameID]; ok {
  735. nodePtr.RAMBreakdown.User = ramUserPct
  736. }
  737. if ramSystemPct, ok := ramSystemPctMap[clusterAndNameID]; ok {
  738. nodePtr.RAMBreakdown.System = ramSystemPct
  739. }
  740. if cpuBreakdown, ok := cpuBreakdownMap[clusterAndNameID]; ok {
  741. nodePtr.CPUBreakdown = cpuBreakdown
  742. }
  743. if labels, ok := labelsMap[clusterAndNameID]; ok {
  744. nodePtr.Labels = labels
  745. }
  746. if overhead, ok := overheadMap[clusterAndNameID]; ok {
  747. nodePtr.Overhead = overhead
  748. } else {
  749. // we were unable to compute overhead for this node
  750. // assume default case of no overhead
  751. nodePtr.Overhead = &NodeOverhead{}
  752. log.Warnf("unable to compute overhead for node %s - defaulting to no overhead", clusterAndNameID.Name)
  753. }
  754. }
  755. return nodeMap
  756. }