Home | History | Annotate | Download | only in i965 
      1 /*
      2  * Copyright  2011 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 
     24 #include "intel_resolve_map.h"
     25 
     26 #include <stdlib.h>
     27 
     28 /**
     29  * \brief Set that the miptree slice at (level, layer) needs a resolve.
     30  *
     31  * If a map element already exists with the given key, then the value is
     32  * changed to the given value of \c need.
     33  */
     34 void
     35 intel_resolve_map_set(struct exec_list *resolve_map,
     36                       uint32_t level,
     37                       uint32_t layer,
     38                       unsigned need)
     39 {
     40    foreach_list_typed(struct intel_resolve_map, map, link, resolve_map) {
     41       if (map->level == level && map->layer == layer) {
     42          map->need = need;
     43 	 return;
     44       }
     45    }
     46 
     47    struct intel_resolve_map *m = malloc(sizeof(struct intel_resolve_map));
     48    exec_node_init(&m->link);
     49    m->level = level;
     50    m->layer = layer;
     51    m->need = need;
     52 
     53    exec_list_push_tail(resolve_map, &m->link);
     54 }
     55 
     56 /**
     57  * \brief Get an element from the map.
     58  * \return null if element is not contained in map.
     59  */
     60 const struct intel_resolve_map *
     61 intel_resolve_map_find_any(const struct exec_list *resolve_map,
     62                            uint32_t start_level, uint32_t num_levels,
     63                            uint32_t start_layer, uint32_t num_layers)
     64 {
     65    foreach_list_typed(struct intel_resolve_map, map, link, resolve_map) {
     66       if (map->level >= start_level &&
     67           map->level < (start_level + num_levels) &&
     68           map->layer >= start_layer &&
     69           map->layer < (start_layer + num_layers))
     70          return map;
     71    }
     72 
     73    return NULL;
     74 }
     75 
     76 /**
     77  * \brief Remove and free an element from the map.
     78  */
     79 void
     80 intel_resolve_map_remove(struct intel_resolve_map *elem)
     81 {
     82    exec_node_remove(&elem->link);
     83    free(elem);
     84 }
     85 
     86 /**
     87  * \brief Remove and free all elements of the map.
     88  */
     89 void
     90 intel_resolve_map_clear(struct exec_list *resolve_map)
     91 {
     92    foreach_in_list_safe(struct exec_node, node, resolve_map) {
     93       free(node);
     94    }
     95 
     96    exec_list_make_empty(resolve_map);
     97 }
     98