Lines Matching defs:faults
1630 * faults[] array is split into two regions: faults_mem and faults_cpu.
1634 * more by CPU use than by memory faults.
1636 unsigned long faults[];
1664 * by the PTE scanner and NUMA hinting faults should be trapped based
1753 /* Shared or private faults. */
1803 return ng->faults[task_faults_idx(NUMA_MEM, nid, 0)] +
1804 ng->faults[task_faults_idx(NUMA_MEM, nid, 1)];
1809 return group->faults[task_faults_idx(NUMA_CPU, nid, 0)] +
1810 group->faults[task_faults_idx(NUMA_CPU, nid, 1)];
1815 unsigned long faults = 0;
1819 faults += ng->faults[task_faults_idx(NUMA_MEM, node, 1)];
1822 return faults;
1827 unsigned long faults = 0;
1831 faults += ng->faults[task_faults_idx(NUMA_MEM, node, 0)];
1834 return faults;
1838 * A node triggering more than 1/3 as many NUMA faults as the maximum is
1870 unsigned long faults;
1890 /* Add up the faults from nearby nodes. */
1892 faults = task_faults(p, node);
1894 faults = group_faults(p, node);
1901 * The further away a node is, the less the faults count.
1905 faults *= (max_dist - dist);
1906 faults /= (max_dist - LOCAL_DISTANCE);
1909 score += faults;
1924 unsigned long faults, total_faults;
1934 faults = task_faults(p, nid);
1935 faults += score_nearby_nodes(p, nid, dist, true);
1937 return 1000 * faults / total_faults;
1944 unsigned long faults, total_faults;
1954 faults = group_faults(p, nid);
1955 faults += score_nearby_nodes(p, nid, dist, false);
1957 return 1000 * faults / total_faults;
2125 * Allow first faults or private faults to migrate immediately early in
2143 * Our periodic faults will sample this probability and getting the
2155 /* Always allow migrate on private faults */
2812 * tracking the nodes from which NUMA hinting faults are triggered. This can
2818 unsigned long faults, max_faults = 0;
2822 faults = group_faults_cpu(numa_group, nid);
2823 if (faults > max_faults)
2824 max_faults = faults;
2828 faults = group_faults_cpu(numa_group, nid);
2829 if (faults * ACTIVE_NODE_FRACTION > max_faults)
2864 * If there were no record hinting faults then either the task is
2911 * Private memory faults exceed (SLOTS-THRESHOLD)/SLOTS,
2972 * scores nodes according to the number of NUMA hinting faults on
3011 unsigned long faults = 0;
3015 /* Sum group's NUMA faults; includes a==b case. */
3018 faults += group_faults(p, b);
3025 if (faults > max_faults) {
3026 max_faults = faults;
3077 /* Find the node with the highest number of faults */
3081 unsigned long faults = 0, group_faults = 0;
3092 /* Decay existing window, copy faults since last scan */
3100 * number of faults. Tasks with little runtime have
3102 * faults are less important.
3112 faults += p->numa_faults[mem_idx];
3122 ng->faults[mem_idx] += diff;
3123 ng->faults[cpu_idx] += f_diff;
3125 group_faults += ng->faults[mem_idx];
3130 if (faults > max_faults) {
3131 max_faults = faults;
3194 grp->faults[i] = p->numa_faults[i];
3252 my_grp->faults[i] -= p->numa_faults[i];
3253 grp->faults[i] += p->numa_faults[i];
3295 grp->faults[i] -= p->numa_faults[i];
3334 * NUMA faults statistics are unnecessary for the slow memory
3342 /* Allocate buffer to track faults on a per-node basis */
3557 * hinting faults in read-only file-backed mappings or the vDSO
3760 * Drive the periodic memory faults..
3807 * Allow resets if faults have been trapped before one scan
14250 gsf = ng->faults[task_faults_idx(NUMA_MEM, node, 0)];
14251 gpf = ng->faults[task_faults_idx(NUMA_MEM, node, 1)];