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@xxxxxxxxx>
---
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 2144b6ceb119..7a6435cffdb7 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 = {.bits = {0}};
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
