2 * Copyright © 2011 Intel Corporation
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:
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
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
24 #include "intel_resolve_map.h"
30 * \brief Set that the miptree slice at (level, layer) needs a resolve.
32 * If a map element already exists with the given key, then the value is
33 * changed to the given value of \c need.
36 intel_resolve_map_set(struct exec_list
*resolve_map
,
39 enum gen6_hiz_op need
)
41 foreach_list_typed(struct intel_resolve_map
, map
, link
, resolve_map
) {
42 if (map
->level
== level
&& map
->layer
== layer
) {
48 struct intel_resolve_map
*m
= malloc(sizeof(struct intel_resolve_map
));
49 exec_node_init(&m
->link
);
54 exec_list_push_tail(resolve_map
, &m
->link
);
58 * \brief Get an element from the map.
59 * \return null if element is not contained in map.
61 struct intel_resolve_map
*
62 intel_resolve_map_get(struct exec_list
*resolve_map
,
66 foreach_list_typed(struct intel_resolve_map
, map
, link
, resolve_map
) {
67 if (map
->level
== level
&& map
->layer
== layer
)
75 * \brief Remove and free an element from the map.
78 intel_resolve_map_remove(struct intel_resolve_map
*elem
)
80 exec_node_remove(&elem
->link
);
85 * \brief Remove and free all elements of the map.
88 intel_resolve_map_clear(struct exec_list
*resolve_map
)
90 foreach_in_list_safe(struct exec_node
, node
, resolve_map
) {
94 exec_list_make_empty(resolve_map
);