birq/balance.c

/* balance.c
 * Balance IRQs.
 */

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <dirent.h>
#include <limits.h>
#include <ctype.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h> /* open, write */

#include "statistics.h"
#include "cpu.h"
#include "irq.h"
#include "balance.h"

/* Drop the dont_move flag on all IRQs for specified CPU */
static int dec_weight(cpu_t *cpu, int value)
{
	lub_list_node_t *iter;

	if (!cpu)
		return -1;
	if (value < 0)
		return -1;

	for (iter = lub_list_iterator_init(cpu->irqs); iter;
		iter = lub_list_iterator_next(iter)) {
		irq_t *irq;
		irq = (irq_t *)lub_list_node__get_data(iter);
		if (irq->weight >= value)
			irq->weight -= value;
	}

	return 0;
}

/* Remove IRQ from specified CPU */
int remove_irq_from_cpu(irq_t *irq, cpu_t *cpu)
{
	lub_list_node_t *node;

	if (!irq || !cpu)
		return -1;

	irq->cpu = NULL;
	node = lub_list_search(cpu->irqs, irq);
	if (!node)
		return 0;
	lub_list_del(cpu->irqs, node);
	lub_list_node_free(node);

	return 0;
}

/* Move IRQ to specified CPU. Remove IRQ from the IRQ list
 * of old CPU.
 */
int move_irq_to_cpu(irq_t *irq, cpu_t *cpu)
{
	if (!irq || !cpu)
		return -1;

	if (irq->cpu) {
		cpu_t *old_cpu = irq->cpu;
		remove_irq_from_cpu(irq, old_cpu);
		dec_weight(old_cpu, 1);
	}
	dec_weight(cpu, 1);
	irq->cpu = cpu;
	lub_list_add(cpu->irqs, irq);

	return 0;
}

/* Search for the best CPU. Best CPU is a CPU with minimal load.
   If several CPUs have the same load then the best CPU is a CPU
   with minimal number of assigned IRQs */
static cpu_t *choose_cpu(lub_list_t *cpus, cpumask_t *cpumask, float load_limit)
{
	lub_list_node_t *iter;
	lub_list_t * min_cpus = NULL;
	float min_load = 100.00;
	lub_list_node_t *node;
	cpu_t *cpu = NULL;

	for (iter = lub_list_iterator_init(cpus); iter;
		iter = lub_list_iterator_next(iter)) {
		cpu = (cpu_t *)lub_list_node__get_data(iter);
		if (!cpu_isset(cpu->id, *cpumask))
			continue;
		if (cpu->load >= load_limit)
			continue;
		if ((!min_cpus) || (cpu->load < min_load)) {
			min_load = cpu->load;
			if (!min_cpus)
				min_cpus = lub_list_new(cpu_list_compare_len);
			while ((node = lub_list__get_tail(min_cpus))) {
				lub_list_del(min_cpus, node);
				lub_list_node_free(node);
			}
			lub_list_add(min_cpus, cpu);
		}
		if (cpu->load == min_load)
			lub_list_add(min_cpus, cpu);
	}
	if (!min_cpus)
		return NULL;
	node = lub_list__get_head(min_cpus);
	cpu = (cpu_t *)lub_list_node__get_data(node);
	while ((node = lub_list__get_tail(min_cpus))) {
		lub_list_del(min_cpus, node);
		lub_list_node_free(node);
	}
	lub_list_free(min_cpus);

	return cpu;
}

static int irq_set_affinity(irq_t *irq, cpumask_t *cpumask)
{
	char path[PATH_MAX];
	char buf[NR_CPUS + 1];
	int f;

	if (!irq)
		return -1;

	snprintf(path, sizeof(path),
		"%s/%u/smp_affinity", PROC_IRQ, irq->irq);
	path[sizeof(path) - 1] = '\0';
	if ((f = open(path, O_WRONLY | O_SYNC)) < 0)
		return -1;
	cpumask_scnprintf(buf, sizeof(buf), *cpumask);
	buf[sizeof(buf) - 1] = '\0';
	if (write(f, buf, strlen(buf)) < 0) {
		/* The affinity for some IRQ can't be changed. So don't
		   consider such IRQs. The example is IRQ 0 - timer.
		   Blacklist this IRQ. Note fprintf() without fflush()
		   will not return I/O error due to buffers. */
		irq->blacklisted = 1;
		remove_irq_from_cpu(irq, irq->cpu);
		printf("Blacklist IRQ %u\n", irq->irq);
	}
	close(f);

	return 0;
}

/* Find best CPUs for IRQs need to be balanced. */
int balance(lub_list_t *cpus, lub_list_t *balance_irqs, float load_limit)
{
	lub_list_node_t *iter;

	for (iter = lub_list_iterator_init(balance_irqs); iter;
		iter = lub_list_iterator_next(iter)) {
		irq_t *irq;
		cpu_t *cpu;
		irq = (irq_t *)lub_list_node__get_data(iter);
		/* Try to find local CPU to move IRQ to.
		   The local CPU is CPU with native NUMA node. */
		cpu = choose_cpu(cpus, &(irq->local_cpus), load_limit);
		/* If local CPU is not found then try to use
		   CPU from another NUMA node. It's better then
		   overloaded CPUs. */
		/* Non-local CPUs were disabled. It seems there is
		   no advantages to use them. The all interactions will
		   be held by QPI-like interfaces through local CPUs. */
/*		if (!cpu) {
			cpumask_t complement;
			cpus_init(complement);
			cpus_complement(complement, irq->local_cpus);
			cpu = choose_cpu(cpus, &complement, load_limit);
			cpus_free(complement);
		}
*/
		if (cpu) {
			if (irq->cpu)
				printf("Move IRQ %u from CPU%u to CPU%u\n",
					irq->irq, irq->cpu->id, cpu->id);
			else
				printf("Move IRQ %u to CPU%u\n", irq->irq, cpu->id);
			move_irq_to_cpu(irq, cpu);
		}
	}

	return 0;
}

int apply_affinity(lub_list_t *balance_irqs)
{
	lub_list_node_t *iter;

	for (iter = lub_list_iterator_init(balance_irqs); iter;
		iter = lub_list_iterator_next(iter)) {
		irq_t *irq;
		irq = (irq_t *)lub_list_node__get_data(iter);
		if (!irq->cpu)
			continue;
		irq_set_affinity(irq, &(irq->cpu->cpumask));
	}
	return 0;
}


/* Count the number of intr-not-null IRQs and minimal IRQ weight */
static int irq_list_info(lub_list_t *irqs, int *min_weight,
	unsigned int *irq_num, unsigned int *candidates_num)
{
	lub_list_node_t *iter;

	if (!irqs)
		return -1;

	if (min_weight)
		*min_weight = -1;
	if (irq_num)
		*irq_num = 0;
	if (candidates_num)
		*candidates_num = 0;
	for (iter = lub_list_iterator_init(irqs); iter;
		iter = lub_list_iterator_next(iter)) {
		irq_t *irq = (irq_t *)lub_list_node__get_data(iter);
		if (irq->intr == 0)
			continue;
		if (min_weight) {
			if ((*min_weight < 0) || (irq->weight < *min_weight))
				*min_weight = irq->weight;
		}
		if (irq_num)
			*irq_num += 1;
		if (irq->weight)
			continue;
		if (candidates_num)
			*candidates_num += 1;
	}

	return 0;
}

/* Search for most overloaded CPU */
static cpu_t * most_overloaded_cpu(lub_list_t *cpus, float threshold)
{
	lub_list_node_t *iter;
	cpu_t *overloaded_cpu = NULL;
	float max_load = 0.0;

	/* Search for the most overloaded CPU.
	   The load must be greater than threshold. */
	for (iter = lub_list_iterator_init(cpus); iter;
		iter = lub_list_iterator_next(iter)) {
		cpu_t *cpu = (cpu_t *)lub_list_node__get_data(iter);
		int min_weight = -1;
		unsigned int irq_num = 0;

		if (cpu->load < threshold)
			continue;
		if (cpu->load <= max_load)
			continue;

		/* Don't move last IRQ */
		if (lub_list_len(cpu->irqs) <= 1)
			continue;

		irq_list_info(cpu->irqs, &min_weight, &irq_num, NULL);
		/* All IRQs has intr=0 */
		if (irq_num == 0)
			continue;
		if (min_weight > 0)
			dec_weight(cpu, min_weight);

		/* Ok, it's good CPU to try to free it */
		max_load = cpu->load;
		overloaded_cpu = cpu;
	}

	return overloaded_cpu;
}

/* Search for the overloaded CPUs and then choose best IRQ for moving to
   another CPU. The best IRQ is IRQ with maximum number of interrupts.
   The IRQs with small number of interrupts have very low load or very
   high load (in a case of NAPI). */
int choose_irqs_to_move(lub_list_t *cpus, lub_list_t *balance_irqs,
	float threshold, birq_choose_strategy_e strategy)
{
	lub_list_node_t *iter;
	cpu_t *overloaded_cpu = NULL;
	irq_t *irq_to_move = NULL;
	unsigned long long max_intr = 0;
	unsigned long long min_intr = (unsigned long long)(-1);
	unsigned int choose = 0;
	unsigned int current = 0;

	/* Search for overloaded CPUs */
	if (!(overloaded_cpu = most_overloaded_cpu(cpus, threshold)))
		return 0;

	if (strategy == BIRQ_CHOOSE_RND) {
		unsigned int candidates = 0;
		irq_list_info(overloaded_cpu->irqs, NULL, NULL, &candidates);
		if (candidates == 0)
			return 0;
		choose = rand() % candidates;
	}

	/* Search for the IRQ (owned by overloaded CPU) with
	   maximum/minimum number of interrupts. */
	for (iter = lub_list_iterator_init(overloaded_cpu->irqs); iter;
		iter = lub_list_iterator_next(iter)) {
		irq_t *irq = (irq_t *)lub_list_node__get_data(iter);
		/* Don't move any IRQs with intr=0. It can be unused IRQ. In
		   this case the moving is not needed. It can be overloaded
		   (by NAPI) IRQs. In this case it will be not moved anyway. */
		if (irq->intr == 0)
			continue;
		if (irq->weight)
			continue;
		if (strategy == BIRQ_CHOOSE_MAX) {
			/* Get IRQ with max intr */
			if (irq->intr > max_intr) {
				max_intr = irq->intr;
				irq_to_move = irq;
			}
		} else if (strategy == BIRQ_CHOOSE_MIN) {
			/* Get IRQ with min intr */
			if (irq->intr < min_intr) {
				min_intr = irq->intr;
				irq_to_move = irq;
			}
		} else if (strategy == BIRQ_CHOOSE_RND) {
			if (current == choose) {
				irq_to_move = irq;
				break;
			}
		}
		current++;
	}

	if (irq_to_move) {
		/* Don't move this IRQ while next iteration. */
		irq_to_move->weight = 1;
		lub_list_add(balance_irqs, irq_to_move);
	}

	return 0;
}