cluster_helpers.go 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703
  1. package costmodel
  2. import (
  3. "time"
  4. "github.com/kubecost/cost-model/pkg/env"
  5. "github.com/kubecost/cost-model/pkg/log"
  6. "github.com/kubecost/cost-model/pkg/prom"
  7. )
  8. // mergeTypeMaps takes two maps of (cluster name, node name) -> node type
  9. // and combines them into a single map, preferring the k/v pairs in
  10. // the first map.
  11. func mergeTypeMaps(clusterAndNameToType1, clusterAndNameToType2 map[nodeIdentifierNoProviderID]string) map[nodeIdentifierNoProviderID]string {
  12. merged := map[nodeIdentifierNoProviderID]string{}
  13. for k, v := range clusterAndNameToType2 {
  14. merged[k] = v
  15. }
  16. // This ordering ensures the mappings in the first arg are preferred.
  17. for k, v := range clusterAndNameToType1 {
  18. merged[k] = v
  19. }
  20. return merged
  21. }
  22. func buildCPUCostMap(
  23. resNodeCPUCost []*prom.QueryResult,
  24. providerIDParser func(string) string,
  25. ) (
  26. map[NodeIdentifier]float64,
  27. map[nodeIdentifierNoProviderID]string,
  28. ) {
  29. cpuCostMap := make(map[NodeIdentifier]float64)
  30. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  31. for _, result := range resNodeCPUCost {
  32. cluster, err := result.GetString("cluster_id")
  33. if err != nil {
  34. cluster = env.GetClusterID()
  35. }
  36. name, err := result.GetString("node")
  37. if err != nil {
  38. log.Warningf("ClusterNodes: CPU cost data missing node")
  39. continue
  40. }
  41. nodeType, _ := result.GetString("instance_type")
  42. providerID, _ := result.GetString("provider_id")
  43. cpuCost := result.Values[0].Value
  44. key := NodeIdentifier{
  45. Cluster: cluster,
  46. Name: name,
  47. ProviderID: providerIDParser(providerID),
  48. }
  49. keyNon := nodeIdentifierNoProviderID{
  50. Cluster: cluster,
  51. Name: name,
  52. }
  53. clusterAndNameToType[keyNon] = nodeType
  54. cpuCostMap[key] = cpuCost
  55. }
  56. return cpuCostMap, clusterAndNameToType
  57. }
  58. func buildRAMCostMap(
  59. resNodeRAMCost []*prom.QueryResult,
  60. providerIDParser func(string) string,
  61. ) (
  62. map[NodeIdentifier]float64,
  63. map[nodeIdentifierNoProviderID]string,
  64. ) {
  65. ramCostMap := make(map[NodeIdentifier]float64)
  66. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  67. for _, result := range resNodeRAMCost {
  68. cluster, err := result.GetString("cluster_id")
  69. if err != nil {
  70. cluster = env.GetClusterID()
  71. }
  72. name, err := result.GetString("node")
  73. if err != nil {
  74. log.Warningf("ClusterNodes: RAM cost data missing node")
  75. continue
  76. }
  77. nodeType, _ := result.GetString("instance_type")
  78. providerID, _ := result.GetString("provider_id")
  79. ramCost := result.Values[0].Value
  80. key := NodeIdentifier{
  81. Cluster: cluster,
  82. Name: name,
  83. ProviderID: providerIDParser(providerID),
  84. }
  85. keyNon := nodeIdentifierNoProviderID{
  86. Cluster: cluster,
  87. Name: name,
  88. }
  89. clusterAndNameToType[keyNon] = nodeType
  90. ramCostMap[key] = ramCost
  91. }
  92. return ramCostMap, clusterAndNameToType
  93. }
  94. func buildGPUCostMap(
  95. resNodeGPUCost []*prom.QueryResult,
  96. gpuCountMap map[NodeIdentifier]float64,
  97. providerIDParser func(string) string,
  98. ) (
  99. map[NodeIdentifier]float64,
  100. map[nodeIdentifierNoProviderID]string,
  101. ) {
  102. gpuCostMap := make(map[NodeIdentifier]float64)
  103. clusterAndNameToType := make(map[nodeIdentifierNoProviderID]string)
  104. for _, result := range resNodeGPUCost {
  105. cluster, err := result.GetString("cluster_id")
  106. if err != nil {
  107. cluster = env.GetClusterID()
  108. }
  109. name, err := result.GetString("node")
  110. if err != nil {
  111. log.Warningf("ClusterNodes: GPU cost data missing node")
  112. continue
  113. }
  114. nodeType, _ := result.GetString("instance_type")
  115. providerID, _ := result.GetString("provider_id")
  116. gpuCost := result.Values[0].Value
  117. key := NodeIdentifier{
  118. Cluster: cluster,
  119. Name: name,
  120. ProviderID: providerIDParser(providerID),
  121. }
  122. keyNon := nodeIdentifierNoProviderID{
  123. Cluster: cluster,
  124. Name: name,
  125. }
  126. clusterAndNameToType[keyNon] = nodeType
  127. // If gpu count is available use it to multiply gpu cost
  128. if value, ok := gpuCountMap[key]; ok && value != 0 {
  129. gpuCostMap[key] = gpuCost * value
  130. } else {
  131. gpuCostMap[key] = gpuCost
  132. }
  133. }
  134. return gpuCostMap, clusterAndNameToType
  135. }
  136. func buildGPUCountMap(
  137. resNodeGPUCount []*prom.QueryResult,
  138. providerIDParser func(string) string,
  139. ) map[NodeIdentifier]float64 {
  140. gpuCountMap := make(map[NodeIdentifier]float64)
  141. for _, result := range resNodeGPUCount {
  142. cluster, err := result.GetString("cluster_id")
  143. if err != nil {
  144. cluster = env.GetClusterID()
  145. }
  146. name, err := result.GetString("node")
  147. if err != nil {
  148. log.Warningf("ClusterNodes: GPU count data missing node")
  149. continue
  150. }
  151. gpuCount := result.Values[0].Value
  152. providerID, _ := result.GetString("provider_id")
  153. key := NodeIdentifier{
  154. Cluster: cluster,
  155. Name: name,
  156. ProviderID: providerIDParser(providerID),
  157. }
  158. gpuCountMap[key] = gpuCount
  159. }
  160. return gpuCountMap
  161. }
  162. func buildCPUCoresMap(
  163. resNodeCPUCores []*prom.QueryResult,
  164. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  165. ) map[nodeIdentifierNoProviderID]float64 {
  166. m := make(map[nodeIdentifierNoProviderID]float64)
  167. for _, result := range resNodeCPUCores {
  168. cluster, err := result.GetString("cluster_id")
  169. if err != nil {
  170. cluster = env.GetClusterID()
  171. }
  172. name, err := result.GetString("node")
  173. if err != nil {
  174. log.Warningf("ClusterNodes: CPU cores data missing node")
  175. continue
  176. }
  177. cpuCores := result.Values[0].Value
  178. key := nodeIdentifierNoProviderID{
  179. Cluster: cluster,
  180. Name: name,
  181. }
  182. m[key] = cpuCores
  183. }
  184. return m
  185. }
  186. func buildRAMBytesMap(resNodeRAMBytes []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  187. m := make(map[nodeIdentifierNoProviderID]float64)
  188. for _, result := range resNodeRAMBytes {
  189. cluster, err := result.GetString("cluster_id")
  190. if err != nil {
  191. cluster = env.GetClusterID()
  192. }
  193. name, err := result.GetString("node")
  194. if err != nil {
  195. log.Warningf("ClusterNodes: RAM bytes data missing node")
  196. continue
  197. }
  198. ramBytes := result.Values[0].Value
  199. key := nodeIdentifierNoProviderID{
  200. Cluster: cluster,
  201. Name: name,
  202. }
  203. m[key] = ramBytes
  204. }
  205. return m
  206. }
  207. // Mapping of cluster/node=cpu for computing resource efficiency
  208. func buildCPUBreakdownMap(resNodeCPUModeTotal []*prom.QueryResult) map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown {
  209. cpuBreakdownMap := make(map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown)
  210. // Mapping of cluster/node=cpu for computing resource efficiency
  211. clusterNodeCPUTotal := map[nodeIdentifierNoProviderID]float64{}
  212. // Mapping of cluster/node:mode=cpu for computing resource efficiency
  213. clusterNodeModeCPUTotal := map[nodeIdentifierNoProviderID]map[string]float64{}
  214. // Build intermediate structures for CPU usage by (cluster, node) and by
  215. // (cluster, node, mode) for computing resouce efficiency
  216. for _, result := range resNodeCPUModeTotal {
  217. cluster, err := result.GetString("cluster_id")
  218. if err != nil {
  219. cluster = env.GetClusterID()
  220. }
  221. node, err := result.GetString("kubernetes_node")
  222. if err != nil {
  223. log.DedupedWarningf(5, "ClusterNodes: CPU mode data missing node")
  224. continue
  225. }
  226. mode, err := result.GetString("mode")
  227. if err != nil {
  228. log.Warningf("ClusterNodes: unable to read CPU mode: %s", err)
  229. mode = "other"
  230. }
  231. key := nodeIdentifierNoProviderID{
  232. Cluster: cluster,
  233. Name: node,
  234. }
  235. total := result.Values[0].Value
  236. // Increment total
  237. clusterNodeCPUTotal[key] += total
  238. // Increment mode
  239. if _, ok := clusterNodeModeCPUTotal[key]; !ok {
  240. clusterNodeModeCPUTotal[key] = map[string]float64{}
  241. }
  242. clusterNodeModeCPUTotal[key][mode] += total
  243. }
  244. // Compute resource efficiency from intermediate structures
  245. for key, total := range clusterNodeCPUTotal {
  246. if modeTotals, ok := clusterNodeModeCPUTotal[key]; ok {
  247. for mode, subtotal := range modeTotals {
  248. // Compute percentage for the current cluster, node, mode
  249. pct := 0.0
  250. if total > 0 {
  251. pct = subtotal / total
  252. }
  253. if _, ok := cpuBreakdownMap[key]; !ok {
  254. cpuBreakdownMap[key] = &ClusterCostsBreakdown{}
  255. }
  256. switch mode {
  257. case "idle":
  258. cpuBreakdownMap[key].Idle += pct
  259. case "system":
  260. cpuBreakdownMap[key].System += pct
  261. case "user":
  262. cpuBreakdownMap[key].User += pct
  263. default:
  264. cpuBreakdownMap[key].Other += pct
  265. }
  266. }
  267. }
  268. }
  269. return cpuBreakdownMap
  270. }
  271. func buildRAMUserPctMap(resNodeRAMUserPct []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  272. m := make(map[nodeIdentifierNoProviderID]float64)
  273. for _, result := range resNodeRAMUserPct {
  274. cluster, err := result.GetString("cluster_id")
  275. if err != nil {
  276. cluster = env.GetClusterID()
  277. }
  278. name, err := result.GetString("instance")
  279. if err != nil {
  280. log.Warningf("ClusterNodes: RAM user percent missing node")
  281. continue
  282. }
  283. pct := result.Values[0].Value
  284. key := nodeIdentifierNoProviderID{
  285. Cluster: cluster,
  286. Name: name,
  287. }
  288. m[key] = pct
  289. }
  290. return m
  291. }
  292. func buildRAMSystemPctMap(resNodeRAMSystemPct []*prom.QueryResult) map[nodeIdentifierNoProviderID]float64 {
  293. m := make(map[nodeIdentifierNoProviderID]float64)
  294. for _, result := range resNodeRAMSystemPct {
  295. cluster, err := result.GetString("cluster_id")
  296. if err != nil {
  297. cluster = env.GetClusterID()
  298. }
  299. name, err := result.GetString("instance")
  300. if err != nil {
  301. log.Warningf("ClusterNodes: RAM system percent missing node")
  302. continue
  303. }
  304. pct := result.Values[0].Value
  305. key := nodeIdentifierNoProviderID{
  306. Cluster: cluster,
  307. Name: name,
  308. }
  309. m[key] = pct
  310. }
  311. return m
  312. }
  313. type activeData struct {
  314. start time.Time
  315. end time.Time
  316. minutes float64
  317. }
  318. func buildActiveDataMap(resActiveMins []*prom.QueryResult, resolution time.Duration, providerIDParser func(string) string) map[NodeIdentifier]activeData {
  319. m := make(map[NodeIdentifier]activeData)
  320. for _, result := range resActiveMins {
  321. cluster, err := result.GetString("cluster_id")
  322. if err != nil {
  323. cluster = env.GetClusterID()
  324. }
  325. name, err := result.GetString("node")
  326. if err != nil {
  327. log.Warningf("ClusterNodes: active mins missing node")
  328. continue
  329. }
  330. providerID, _ := result.GetString("provider_id")
  331. key := NodeIdentifier{
  332. Cluster: cluster,
  333. Name: name,
  334. ProviderID: providerIDParser(providerID),
  335. }
  336. if len(result.Values) == 0 {
  337. continue
  338. }
  339. s := time.Unix(int64(result.Values[0].Timestamp), 0)
  340. e := time.Unix(int64(result.Values[len(result.Values)-1].Timestamp), 0).Add(resolution)
  341. mins := e.Sub(s).Minutes()
  342. // TODO niko/assets if mins >= threshold, interpolate for missing data?
  343. m[key] = activeData{
  344. start: s,
  345. end: e,
  346. minutes: mins,
  347. }
  348. }
  349. return m
  350. }
  351. // Determine preemptibility with node labels
  352. // node id -> is preemptible?
  353. func buildPreemptibleMap(
  354. resIsSpot []*prom.QueryResult,
  355. providerIDParser func(string) string,
  356. ) map[NodeIdentifier]bool {
  357. m := make(map[NodeIdentifier]bool)
  358. for _, result := range resIsSpot {
  359. nodeName, err := result.GetString("node")
  360. if err != nil {
  361. continue
  362. }
  363. // GCP preemptible label
  364. pre := result.Values[0].Value
  365. cluster, err := result.GetString("cluster_id")
  366. if err != nil {
  367. cluster = env.GetClusterID()
  368. }
  369. providerID, _ := result.GetString("provider_id")
  370. key := NodeIdentifier{
  371. Cluster: cluster,
  372. Name: nodeName,
  373. ProviderID: providerIDParser(providerID),
  374. }
  375. // TODO(michaelmdresser): check this condition at merge time?
  376. // if node, ok := nodeMap[key]; pre > 0.0 && ok {
  377. // node.Preemptible = true
  378. // }
  379. m[key] = pre > 0.0
  380. // TODO AWS preemptible
  381. // TODO Azure preemptible
  382. }
  383. return m
  384. }
  385. func buildLabelsMap(
  386. resLabels []*prom.QueryResult,
  387. ) map[nodeIdentifierNoProviderID]map[string]string {
  388. m := make(map[nodeIdentifierNoProviderID]map[string]string)
  389. // Copy labels into node
  390. for _, result := range resLabels {
  391. cluster, err := result.GetString("cluster_id")
  392. if err != nil {
  393. cluster = env.GetClusterID()
  394. }
  395. node, err := result.GetString("kubernetes_node")
  396. if err != nil {
  397. log.DedupedWarningf(5, "ClusterNodes: label data missing node")
  398. continue
  399. }
  400. key := nodeIdentifierNoProviderID{
  401. Cluster: cluster,
  402. Name: node,
  403. }
  404. m[key] = make(map[string]string)
  405. for name, value := range result.Metric {
  406. if val, ok := value.(string); ok {
  407. m[key][name] = val
  408. }
  409. }
  410. }
  411. return m
  412. }
  413. // checkForKeyAndInitIfMissing inits a key in the provided nodemap if
  414. // it does not exist. Intended to be called ONLY by buildNodeMap
  415. func checkForKeyAndInitIfMissing(
  416. nodeMap map[NodeIdentifier]*Node,
  417. key NodeIdentifier,
  418. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  419. ) {
  420. if _, ok := nodeMap[key]; !ok {
  421. // default nodeType in case we don't have the mapping
  422. var nodeType string
  423. if t, ok := clusterAndNameToType[nodeIdentifierNoProviderID{
  424. Cluster: key.Cluster,
  425. Name: key.Name,
  426. }]; ok {
  427. nodeType = t
  428. } else {
  429. log.Warningf("ClusterNodes: Type does not exist for node identifier %s", key)
  430. }
  431. nodeMap[key] = &Node{
  432. Cluster: key.Cluster,
  433. Name: key.Name,
  434. NodeType: nodeType,
  435. ProviderID: key.ProviderID,
  436. CPUBreakdown: &ClusterCostsBreakdown{},
  437. RAMBreakdown: &ClusterCostsBreakdown{},
  438. }
  439. }
  440. }
  441. // buildNodeMap creates the main set of node data for ClusterNodes from
  442. // the data maps built from Prometheus queries. Some of the Prometheus
  443. // data has access to the provider_id field and some does not. To get
  444. // around this problem, we use the data that includes provider_id
  445. // to build up the definitive set of nodes and then use the data
  446. // with less-specific identifiers (i.e. without provider_id) to fill
  447. // in the remaining fields.
  448. //
  449. // For example, let's say we have nodes identified like so:
  450. // cluster name/node name/provider_id. For the sake of the example,
  451. // we will also limit data to CPU cost, CPU cores, and preemptibility.
  452. //
  453. // We have CPU cost data that looks like this:
  454. // cluster1/node1/prov_node1_A: $10
  455. // cluster1/node1/prov_node1_B: $8
  456. // cluster1/node2/prov_node2: $15
  457. //
  458. // We have Preemptible data that looks like this:
  459. // cluster1/node1/prov_node1_A: true
  460. // cluster1/node1/prov_node1_B: false
  461. // cluster1/node2/prov_node2_B: false
  462. //
  463. // We have CPU cores data that looks like this:
  464. // cluster1/node1: 4
  465. // cluster1/node2: 6
  466. //
  467. // This function first combines the data that is fully identified,
  468. // creating the following:
  469. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true)
  470. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false)
  471. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false)
  472. //
  473. // It then uses the less-specific data to extend the specific data,
  474. // making the following:
  475. // cluster1/node1/prov_node1_A: CPUCost($10), Preemptible(true), Cores(4)
  476. // cluster1/node1/prov_node1_B: CPUCost($8), Preemptible(false), Cores(4)
  477. // cluster1/node2/prov_node2: CPUCost($15), Preemptible(false), Cores(6)
  478. //
  479. // In the situation where provider_id doesn't exist for any metrics,
  480. // that is the same as all provider_ids being empty strings. If
  481. // provider_id doesn't exist at all, then we (without having to do
  482. // extra work) easily fall back on identifying nodes only by cluster name
  483. // and node name because the provider_id part of the key will always
  484. // be the empty string.
  485. //
  486. // It is worth nothing that, in this approach, if a node is not present
  487. // in the more specific data but is present in the less-specific data,
  488. // that data is never processed into the final node map. For example,
  489. // let's say the CPU cores map has the following entry:
  490. // cluster1/node8: 6
  491. // But none of the maps with provider_id (CPU cost, RAM cost, etc.)
  492. // have an identifier for cluster1/node8 (regardless of provider_id).
  493. // In this situation, the final node map will not have a cluster1/node8
  494. // entry. This could be fixed by iterating over all of the less specific
  495. // identifiers and, inside that iteration, all of the identifiers in
  496. // the node map, but this would introduce a roughly quadratic time
  497. // complexity.
  498. func buildNodeMap(
  499. cpuCostMap, ramCostMap, gpuCostMap, gpuCountMap map[NodeIdentifier]float64,
  500. cpuCoresMap, ramBytesMap, ramUserPctMap,
  501. ramSystemPctMap map[nodeIdentifierNoProviderID]float64,
  502. cpuBreakdownMap map[nodeIdentifierNoProviderID]*ClusterCostsBreakdown,
  503. activeDataMap map[NodeIdentifier]activeData,
  504. preemptibleMap map[NodeIdentifier]bool,
  505. labelsMap map[nodeIdentifierNoProviderID]map[string]string,
  506. clusterAndNameToType map[nodeIdentifierNoProviderID]string,
  507. ) map[NodeIdentifier]*Node {
  508. nodeMap := make(map[NodeIdentifier]*Node)
  509. // Initialize the map with the most-specific data:
  510. for id, cost := range cpuCostMap {
  511. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  512. nodeMap[id].CPUCost = cost
  513. }
  514. for id, cost := range ramCostMap {
  515. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  516. nodeMap[id].RAMCost = cost
  517. }
  518. for id, cost := range gpuCostMap {
  519. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  520. nodeMap[id].GPUCost = cost
  521. }
  522. for id, count := range gpuCountMap {
  523. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  524. nodeMap[id].GPUCount = count
  525. }
  526. for id, preemptible := range preemptibleMap {
  527. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  528. nodeMap[id].Preemptible = preemptible
  529. }
  530. for id, activeData := range activeDataMap {
  531. checkForKeyAndInitIfMissing(nodeMap, id, clusterAndNameToType)
  532. nodeMap[id].Start = activeData.start
  533. nodeMap[id].End = activeData.end
  534. nodeMap[id].Minutes = activeData.minutes
  535. }
  536. // We now merge in data that doesn't have a provider id by looping over
  537. // all keys already added and inserting data according to their
  538. // cluster name/node name combos.
  539. for id, nodePtr := range nodeMap {
  540. clusterAndNameID := nodeIdentifierNoProviderID{
  541. Cluster: id.Cluster,
  542. Name: id.Name,
  543. }
  544. if cores, ok := cpuCoresMap[clusterAndNameID]; ok {
  545. nodePtr.CPUCores = cores
  546. if v, ok := partialCPUMap[nodePtr.NodeType]; ok {
  547. if cores > 0 {
  548. nodePtr.CPUCores = v
  549. adjustmentFactor := v / cores
  550. nodePtr.CPUCost = nodePtr.CPUCost * adjustmentFactor
  551. }
  552. }
  553. }
  554. if ramBytes, ok := ramBytesMap[clusterAndNameID]; ok {
  555. nodePtr.RAMBytes = ramBytes
  556. }
  557. if ramUserPct, ok := ramUserPctMap[clusterAndNameID]; ok {
  558. nodePtr.RAMBreakdown.User = ramUserPct
  559. }
  560. if ramSystemPct, ok := ramSystemPctMap[clusterAndNameID]; ok {
  561. nodePtr.RAMBreakdown.System = ramSystemPct
  562. }
  563. if cpuBreakdown, ok := cpuBreakdownMap[clusterAndNameID]; ok {
  564. nodePtr.CPUBreakdown = cpuBreakdown
  565. }
  566. if labels, ok := labelsMap[clusterAndNameID]; ok {
  567. nodePtr.Labels = labels
  568. }
  569. }
  570. return nodeMap
  571. }