From 351c932bb43a002fd7ee046c4b4284a28a5daf26 Mon Sep 17 00:00:00 2001 From: Matthias Braun Date: Fri, 12 Jan 2007 12:48:30 +0000 Subject: [PATCH] added some comments --- ir/be/bespillbelady.h | 20 +++++++++++++++++--- 1 file changed, 17 insertions(+), 3 deletions(-) diff --git a/ir/be/bespillbelady.h b/ir/be/bespillbelady.h index 5a7867c12..3bb4c0860 100644 --- a/ir/be/bespillbelady.h +++ b/ir/be/bespillbelady.h @@ -1,5 +1,5 @@ /** - * Author: Daniel Grund + * Author: Daniel Grund, Matthias Braun * Date: 20.09.2005 * Copyright: (c) Universitaet Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. @@ -14,8 +14,22 @@ #include "bearch.h" #include "bespill.h" +/** + * Do spilling for a register class on a graph using the belady heuristic. + * In the transformed graph, the register pressure never exceeds the number + * of available registers. + * + * @param birg The backend graph + * @param cls The register class to spill + */ void be_spill_belady(be_irg_t *birg, const arch_register_class_t *cls); -/// Same as be_spill_belady but reuses an existing spill environment -void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls, spill_env_t *spill_env); + +/** + * Same as be_spill_belady but reuses an existing spill environment. + * This is usefull for "pre-spillers" that create some spills+reloads + * but can't ensure that regpressure never exceeds the number of registers + */ +void be_spill_belady_spill_env(be_irg_t *birg, const arch_register_class_t *cls, + spill_env_t *spill_env); #endif /*BESPILLBELADY_H_*/ -- 2.20.1