Subversion Repositories Kolibri OS

Rev

Go to most recent revision | Blame | Last modification | View Log | RSS feed

  1. /*
  2.  * Copyright © 2012 Intel Corporation
  3.  *
  4.  * Permission is hereby granted, free of charge, to any person obtaining a
  5.  * copy of this software and associated documentation files (the "Software"),
  6.  * to deal in the Software without restriction, including without limitation
  7.  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8.  * and/or sell copies of the Software, and to permit persons to whom the
  9.  * Software is furnished to do so, subject to the following conditions:
  10.  *
  11.  * The above copyright notice and this permission notice (including the next
  12.  * paragraph) shall be included in all copies or substantial portions of the
  13.  * Software.
  14.  *
  15.  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16.  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17.  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18.  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19.  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20.  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  21.  * IN THE SOFTWARE.
  22.  *
  23.  * Authors:
  24.  *    Eric Anholt <eric@anholt.net>
  25.  *
  26.  */
  27.  
  28. #include "brw_fs.h"
  29.  
  30. class bblock_link : public exec_node {
  31. public:
  32.    bblock_link(bblock_t *block)
  33.       : block(block)
  34.    {
  35.    }
  36.  
  37.    bblock_t *block;
  38. };
  39.  
  40. class bblock_t {
  41. public:
  42.    static void* operator new(size_t size, void *ctx)
  43.    {
  44.       void *node;
  45.  
  46.       node = rzalloc_size(ctx, size);
  47.       assert(node != NULL);
  48.  
  49.       return node;
  50.    }
  51.  
  52.    bblock_link *make_list(void *mem_ctx);
  53.  
  54.    bblock_t();
  55.  
  56.    void add_successor(void *mem_ctx, bblock_t *successor);
  57.  
  58.    backend_instruction *start;
  59.    backend_instruction *end;
  60.  
  61.    int start_ip;
  62.    int end_ip;
  63.  
  64.    exec_list parents;
  65.    exec_list children;
  66.    int block_num;
  67. };
  68.  
  69. class cfg_t {
  70. public:
  71.    static void* operator new(size_t size, void *ctx)
  72.    {
  73.       void *node;
  74.  
  75.       node = rzalloc_size(ctx, size);
  76.       assert(node != NULL);
  77.  
  78.       return node;
  79.    }
  80.  
  81.    cfg_t(backend_visitor *v);
  82.    cfg_t(void *mem_ctx, exec_list *instructions);
  83.    ~cfg_t();
  84.  
  85.    void create(void *mem_ctx, exec_list *instructions);
  86.  
  87.    bblock_t *new_block();
  88.    void set_next_block(bblock_t *block);
  89.    void make_block_array();
  90.  
  91.    /** @{
  92.     *
  93.     * Used while generating the block list.
  94.     */
  95.    bblock_t *cur;
  96.    int ip;
  97.    /** @} */
  98.  
  99.    void *mem_ctx;
  100.  
  101.    /** Ordered list (by ip) of basic blocks */
  102.    exec_list block_list;
  103.    bblock_t **blocks;
  104.    int num_blocks;
  105. };
  106.