Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\page_alloc.c Create Date:2022-07-28 15:07:01
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:d_next_best_node - find the next node that should appear in a given node's fallback list*@node: node whose fallback list we're appending*@used_node_mask: nodemask_t of already used nodes* We use a number of factors to determine which is the next node that

Proto:static int find_next_best_node(int node, nodemask_t *used_node_mask)

Type:int

Parameter:

TypeParameterName
intnode
nodemask_t *used_node_mask
5517  min_val = INT_MAX
5518  best_node = NUMA_NO_NODE
5519  tmp = Returns a pointer to the cpumask of CPUs on Node 'node'.
5522  If Not No static inline type checking - see Subtlety (1) above. (node, * used_node_mask) Then
5523  The inline keyword gives the compiler room to decide to inline, or* not inline a function as it sees best(node, * used_node_mask)
5524  Return node
5527  for_each_node_state(n, N_MEMORY)
5530  If No static inline type checking - see Subtlety (1) above. (n, * used_node_mask) Then Continue
5534  val = node_distance(node, n)
5537  val += n < node
5540  tmp = Returns a pointer to the cpumask of CPUs on Node 'node'.
5541  If Not pumask_empty - *srcp == 0*@srcp: the cpumask to that all cpus < nr_cpu_ids are clear. Then val += PENALTY_FOR_NODE_WITH_CPUS
5545  val *= MAX_NODE_LOAD * MAX_NUMNODES
5546  val += node_load[n]
5548  If val < min_val Then
5549  min_val = val
5550  best_node = n
5554  If best_node >= 0 Then The inline keyword gives the compiler room to decide to inline, or* not inline a function as it sees best(best_node, * used_node_mask)
5557  Return best_node
Caller
NameDescribe
build_zonelistsBuild zonelists ordered by zone and nodes within zones.* This results in conserving DMA zone[s] until all Normal memory is* exhausted, but results in overflowing to remote node while memory* may still exist in local DMA zone.