函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:mm\page_alloc.c Create Date:2022-07-27 16:37:11
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：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

函数原型：static int find_next_best_node(int node, nodemask_t *used_node_mask)

返回类型：int

参数：

类型参数名称
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  如果非No static inline type checking - see Subtlety (1) above. (node, * used_node_mask)则
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  返回:node
5527  for_each_node_state(n, N_MEMORY)
5530  如果No static inline type checking - see Subtlety (1) above. (n, * used_node_mask)则继续下一循环
5534  val等于node_distance(node, n)
5537  val加等于n小于node
5540  tmp等于Returns a pointer to the cpumask of CPUs on Node 'node'.
5541  如果非pumask_empty - *srcp == 0*@srcp: the cpumask to that all cpus < nr_cpu_ids are clear.则val加等于PENALTY_FOR_NODE_WITH_CPUS
5545  val乘等于MAX_NODE_LOAD乘MAX_NUMNODES
5546  val加等于node_load[n]
5548  如果val小于min_val则
5549  min_val等于val
5550  best_node等于n
5554  如果best_node大于等于0则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  返回:best_node
调用者
名称描述
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.