nsz Git - libfirm/blob - ir/be/becopyilp_t.h

   1 /*
   2  * This file is part of libFirm.
   3  * Copyright (C) 2012 University of Karlsruhe.
   4  */
   5
   6 /**
   7  * @file
   8  * @brief       Common stuff used by all ILP formulations.
   9  * @author      Daniel Grund
  10  * @date        28.02.2006
  11  */
  12 #ifndef FIRM_BE_BECOPYILP_T_H
  13 #define FIRM_BE_BECOPYILP_T_H
  14
  15 #include "firm_types.h"
  16 #include "becopyopt_t.h"
  17
  18 /******************************************************************************
  19     _____ _                        _            _   _
  20    / ____(_)                      | |          | | (_)
  21   | (___  _ _______   _ __ ___  __| |_   _  ___| |_ _  ___  _ __
  22    \___ \| |_  / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
  23    ____) | |/ /  __/ | | |  __/ (_| | |_| | (__| |_| | (_) | | | |
  24   |_____/|_/___\___| |_|  \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
  25
  26  *****************************************************************************/
  27
  28 typedef struct size_red_t {
  29         copy_opt_t    *co;
  30         ir_node      **col_suff;    /**< Coloring suffix. A PEO prefix. */
  31         ir_nodeset_t   all_removed; /**< All nodes removed during problem size reduction */
  32 } size_red_t;
  33
  34 /**
  35  * Checks if a node has already been removed
  36  */
  37 static inline bool sr_is_removed(size_red_t const *const sr, ir_node const *const irn)
  38 {
  39         return ir_nodeset_contains(&sr->all_removed, irn);
  40 }
  41
  42 /**
  43  * TODO: This search is necessary because during the construction of the
  44  *       units (ou's) args could be merged and weights are accumulated.
  45  *       Is this necessary?
  46  */
  47 static inline int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
  48         int i;
  49
  50         /* search optimization unit for phi */
  51         list_for_each_entry(unit_t, curr, &co->units, units)
  52                 if (curr->nodes[0] == root) {
  53
  54                         for (i = 1; i < curr->node_count; ++i)
  55                                 if (curr->nodes[i] == arg)
  56                                         return curr->costs[i];
  57
  58                                 assert(0 && "irn must occur in this ou");
  59                 }
  60
  61         assert(0 && "phi must be found in a ou");
  62         return 0;
  63 }
  64
  65 /******************************************************************************
  66     _____                      _        _____ _      _____
  67    / ____|                    (_)      |_   _| |    |  __ \
  68   | |  __  ___ _ __   ___ _ __ _  ___    | | | |    | |__) |
  69   | | |_ |/ _ \ '_ \ / _ \ '__| |/ __|   | | | |    |  ___/
  70   | |__| |  __/ | | |  __/ |  | | (__   _| |_| |____| |
  71    \_____|\___|_| |_|\___|_|  |_|\___| |_____|______|_|
  72
  73  *****************************************************************************/
  74
  75 #include "lpp.h"
  76 #include "lpp_net.h"
  77
  78 #define EPSILON 0.00001
  79
  80 typedef struct ilp_env_t ilp_env_t;
  81
  82 typedef void(*ilp_callback)(ilp_env_t*);
  83
  84 struct ilp_env_t {
  85         const copy_opt_t *co;   /**< the copy opt problem */
  86         size_red_t       *sr;   /**< problem size reduction. removes simple nodes */
  87         lpp_t            *lp;   /**< the linear programming problem */
  88         void             *env;
  89         ilp_callback     build;
  90         ilp_callback     apply;
  91 };
  92
  93 ilp_env_t *new_ilp_env(copy_opt_t *co, ilp_callback build, ilp_callback apply, void *env);
  94
  95 lpp_sol_state_t ilp_go(ilp_env_t *ienv);
  96
  97 void free_ilp_env(ilp_env_t *ienv);
  98
  99 #endif