[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20200327220121.27823-2-richard.weiyang@gmail.com>
Date: Fri, 27 Mar 2020 22:01:21 +0000
From: Wei Yang <richard.weiyang@...il.com>
To: akpm@...ux-foundation.org
Cc: linux-mm@...ck.org, linux-kernel@...r.kernel.org, jgg@...pe.ca,
david@...hat.com, Wei Yang <richard.weiyang@...il.com>
Subject: [Patch v2 2/2] mm/page_alloc.c: define node_order with all zero
Since we always clear node_order before getting it, we can leverage
compiler to do this instead of at run time.
Signed-off-by: Wei Yang <richard.weiyang@...il.com>
---
mm/page_alloc.c | 3 +--
1 file changed, 1 insertion(+), 2 deletions(-)
diff --git a/mm/page_alloc.c b/mm/page_alloc.c
index dfcf2682ed40..49dd1f25c000 100644
--- a/mm/page_alloc.c
+++ b/mm/page_alloc.c
@@ -5585,7 +5585,7 @@ static void build_thisnode_zonelists(pg_data_t *pgdat)
static void build_zonelists(pg_data_t *pgdat)
{
- static int node_order[MAX_NUMNODES];
+ static int node_order[MAX_NUMNODES] = {0};
int node, load, nr_nodes = 0;
nodemask_t used_mask = NODE_MASK_NONE;
int local_node, prev_node;
@@ -5595,7 +5595,6 @@ static void build_zonelists(pg_data_t *pgdat)
load = nr_online_nodes;
prev_node = local_node;
- memset(node_order, 0, sizeof(node_order));
while ((node = find_next_best_node(local_node, &used_mask)) >= 0) {
/*
* We don't want to pressure a particular node.
--
2.23.0
Powered by blists - more mailing lists