irqbalance/placement.c

/* 
 * Copyright (C) 2006, Intel Corporation
 * 
 * This file is part of irqbalance
 *
 * This program file is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation; version 2 of the License.
 * 
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program in a file named COPYING; if not, write to the 
 * Free Software Foundation, Inc., 
 * 51 Franklin Street, Fifth Floor, 
 * Boston, MA 02110-1301 USA
 */
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdint.h>

#include "types.h"
#include "irqbalance.h"


int power_mode;

GList *rebalance_irq_list;

struct obj_placement {
		struct topo_obj *best;
		struct topo_obj *least_irqs;
		uint64_t best_cost;
		struct irq_info *info;
};

static void find_best_object(struct topo_obj *d, void *data)
{
	struct obj_placement *best = (struct obj_placement *)data;
	uint64_t newload;
	cpumask_t subset;

	/*
 	 * If the hint policy is subset, then we only want 
 	 * to consider objects that are within the irqs hint, but
 	 * only if that irq in fact has published a hint
 	 */
	if (hint_policy == HINT_POLICY_SUBSET) {
		if (!cpus_empty(best->info->affinity_hint)) {
			cpus_and(subset, best->info->affinity_hint, d->mask);
			if (cpus_empty(subset))
				return;
		}
	}

	newload = d->load;
	if (newload < best->best_cost) {
		best->best = d;
		best->best_cost = newload;
		best->least_irqs = NULL;
	}

	if (newload == best->best_cost) {
		if (g_list_length(d->interrupts) < g_list_length(best->best->interrupts))
			best->least_irqs = d;
	}
}

static void place_irq_in_cache_domain(struct irq_info *info, void *data)
{
	struct topo_obj *p = data;
	struct obj_placement place;
	struct topo_obj *asign;

	if (!info->moved)
		return;

	if (info->level <= BALANCE_PACKAGE)
		return;


	place.info = info;
	place.best = NULL;
	place.least_irqs = NULL;
	place.best_cost = INT_MAX;

	for_each_object(p->children, find_best_object, &place);

	asign = place.least_irqs ? place.least_irqs : place.best;

	if (asign) {
		migrate_irq(&p->interrupts, &asign->interrupts, info);
		info->assigned_obj = asign;
	}

}
	
static void place_cache_domain(struct topo_obj *d, void *data __attribute__((unused)))
{
	if (d->interrupts)
		for_each_irq(d->interrupts, place_irq_in_cache_domain, d);
}

static void place_core(struct irq_info *info, void *data)
{
	struct topo_obj *c = data;
	struct obj_placement place;
	struct topo_obj *asign;

	if (!info->moved)
		return;

	if ((info->level <= BALANCE_CACHE) &&
	    (!one_shot_mode))
		return;

	place.info = info;
	place.best = NULL;
	place.least_irqs = NULL;
	place.best_cost = INT_MAX;

	for_each_object(c->children, find_best_object, &place);

	asign = place.least_irqs ? place.least_irqs : place.best;

	if (asign) {
		migrate_irq(&c->interrupts, &asign->interrupts, info);
		info->assigned_obj = asign;
		asign->load += info->load;
	}

}

static void place_cores(struct topo_obj *d, void *data __attribute__((unused)))
{
	if (d->interrupts)
		for_each_irq(d->interrupts, place_core, d);
}

static void place_irq_in_package(struct irq_info *info, void *data)
{
	struct obj_placement place;
	struct topo_obj *n = data;
	struct topo_obj *asign;

	if (!info->moved)
		return;

	if (info->level == BALANCE_NONE)
		return;

	place.info = info;
	place.best = NULL;
	place.least_irqs = NULL;
	place.best_cost = INT_MAX;

	for_each_object(n->children, find_best_object, &place);

	asign = place.least_irqs ? place.least_irqs : place.best;

	if (asign) {
		migrate_irq(&n->interrupts, &asign->interrupts, info);
		info->assigned_obj = asign;
		asign->load += info->load;
	}
}

static void place_packages(struct topo_obj *d, void *data __attribute__((unused)))
{
	if (d->interrupts)
		for_each_irq(d->interrupts, place_irq_in_package, d);
}

static void place_irq_in_node(struct irq_info *info, void *data __attribute__((unused)))
{
	struct obj_placement place;
	struct topo_obj *asign;

	if( info->level == BALANCE_NONE)
		return;

	if (irq_numa_node(info)->number != -1) {
		/*
 		 * This irq belongs to a device with a preferred numa node
 		 * put it on that node
 		 */
		migrate_irq(&rebalance_irq_list, &irq_numa_node(info)->interrupts, info);
		info->assigned_obj = (struct topo_obj *)irq_numa_node(info);
		irq_numa_node(info)->load += info->load + 1;
		return;
	}

	place.best_cost = INT_MAX;
	place.best = NULL;
	place.least_irqs = NULL;
	place.info = info;

	for_each_object(numa_nodes, find_best_object, &place);

	asign = place.least_irqs ? place.least_irqs : place.best;

	if (asign) {
		migrate_irq(&rebalance_irq_list, &asign->interrupts, info);
		info->assigned_obj = asign;
		asign->load += info->load;
	}
}

static void validate_irq(struct irq_info *info, void *data)
{
	if (info->assigned_obj != data)
		printf("object validation error: irq %d is wrong, points to %p, should be %p\n",
			info->irq, info->assigned_obj, data);
}

static void validate_object(struct topo_obj *d, void *data __attribute__((unused)))
{
	if (d->interrupts)
		for_each_irq(d->interrupts, validate_irq, d);
}

static void validate_object_tree_placement()
{
	for_each_object(packages, validate_object, NULL);	
	for_each_object(cache_domains, validate_object, NULL);
	for_each_object(cpus, validate_object, NULL);
}

void calculate_placement(void)
{
	/* first clear old data */ 
	clear_work_stats();

	sort_irq_list(&rebalance_irq_list);

	for_each_irq(rebalance_irq_list, place_irq_in_node, NULL);
	for_each_object(numa_nodes, place_packages, NULL);
	for_each_object(packages, place_cache_domain, NULL);
	for_each_object(cache_domains, place_cores, NULL);

	if (debug_mode)
		validate_object_tree_placement();
}