From 1a079d7b86bc49f095877e28164b5282568d6b26 Mon Sep 17 00:00:00 2001 From: Shivanshu Raj Shrivastava Date: Thu, 28 Oct 2021 15:15:43 +0530 Subject: [PATCH] migrated comparer.go, dumper.go, node_tree.go to structured logging --- pkg/scheduler/internal/cache/debugger/comparer.go | 8 ++++---- pkg/scheduler/internal/cache/debugger/dumper.go | 2 +- pkg/scheduler/internal/cache/node_tree.go | 8 ++++---- 3 files changed, 9 insertions(+), 9 deletions(-) diff --git a/pkg/scheduler/internal/cache/debugger/comparer.go b/pkg/scheduler/internal/cache/debugger/comparer.go index 12df79aae6f..f348977b4f9 100644 --- a/pkg/scheduler/internal/cache/debugger/comparer.go +++ b/pkg/scheduler/internal/cache/debugger/comparer.go @@ -39,8 +39,8 @@ type CacheComparer struct { // Compare compares the nodes and pods of NodeLister with Cache.Snapshot. func (c *CacheComparer) Compare() error { - klog.V(3).Info("cache comparer started") - defer klog.V(3).Info("cache comparer finished") + klog.V(3).InfoS("Cache comparer started") + defer klog.V(3).InfoS("Cache comparer finished") nodes, err := c.NodeLister.List(labels.Everything()) if err != nil { @@ -57,11 +57,11 @@ func (c *CacheComparer) Compare() error { pendingPods := c.PodQueue.PendingPods() if missed, redundant := c.CompareNodes(nodes, dump.Nodes); len(missed)+len(redundant) != 0 { - klog.InfoS("cache mismatch", "missed nodes", missed, "redundant nodes", redundant) + klog.InfoS("Cache mismatch", "missedNodes", missed, "redundantNodes", redundant) } if missed, redundant := c.ComparePods(pods, pendingPods, dump.Nodes); len(missed)+len(redundant) != 0 { - klog.InfoS("cache mismatch", "missed pods", missed, "redundant pods", redundant) + klog.InfoS("Cache mismatch", "missedPods", missed, "redundantPods", redundant) } return nil diff --git a/pkg/scheduler/internal/cache/debugger/dumper.go b/pkg/scheduler/internal/cache/debugger/dumper.go index 6e694b67ce0..0d808c595e6 100644 --- a/pkg/scheduler/internal/cache/debugger/dumper.go +++ b/pkg/scheduler/internal/cache/debugger/dumper.go @@ -44,7 +44,7 @@ func (d *CacheDumper) DumpAll() { // dumpNodes writes NodeInfo to the scheduler logs. func (d *CacheDumper) dumpNodes() { dump := d.cache.Dump() - klog.Info("Dump of cached NodeInfo") + klog.InfoS("Dump of cached NodeInfo") for name, nodeInfo := range dump.Nodes { klog.Info(d.printNodeInfo(name, nodeInfo)) } diff --git a/pkg/scheduler/internal/cache/node_tree.go b/pkg/scheduler/internal/cache/node_tree.go index 31bd4496519..a0005ddeed5 100644 --- a/pkg/scheduler/internal/cache/node_tree.go +++ b/pkg/scheduler/internal/cache/node_tree.go @@ -53,7 +53,7 @@ func (nt *nodeTree) addNode(n *v1.Node) { if na, ok := nt.tree[zone]; ok { for _, nodeName := range na { if nodeName == n.Name { - klog.Warningf("node %q already exist in the NodeTree", n.Name) + klog.InfoS("Node already exists in the NodeTree", "node", klog.KObj(n)) return } } @@ -62,7 +62,7 @@ func (nt *nodeTree) addNode(n *v1.Node) { nt.zones = append(nt.zones, zone) nt.tree[zone] = []string{n.Name} } - klog.V(2).Infof("Added node %q in group %q to NodeTree", n.Name, zone) + klog.V(2).InfoS("Added node in listed group to NodeTree", "node", klog.KObj(n), "zone", zone) nt.numNodes++ } @@ -76,13 +76,13 @@ func (nt *nodeTree) removeNode(n *v1.Node) error { if len(nt.tree[zone]) == 0 { nt.removeZone(zone) } - klog.V(2).Infof("Removed node %q in group %q from NodeTree", n.Name, zone) + klog.V(2).InfoS("Removed node in listed group from NodeTree", "node", klog.KObj(n), "zone", zone) nt.numNodes-- return nil } } } - klog.Errorf("Node %q in group %q was not found", n.Name, zone) + klog.ErrorS(nil, "Node in listed group was not found", "node", klog.KObj(n), "zone", zone) return fmt.Errorf("node %q in group %q was not found", n.Name, zone) }