1b8e80941Smrg/* 2b8e80941Smrg * Copyright © 2019 Broadcom 3b8e80941Smrg * 4b8e80941Smrg * Permission is hereby granted, free of charge, to any person obtaining a 5b8e80941Smrg * copy of this software and associated documentation files (the "Software"), 6b8e80941Smrg * to deal in the Software without restriction, including without limitation 7b8e80941Smrg * the rights to use, copy, modify, merge, publish, distribute, sublicense, 8b8e80941Smrg * and/or sell copies of the Software, and to permit persons to whom the 9b8e80941Smrg * Software is furnished to do so, subject to the following conditions: 10b8e80941Smrg * 11b8e80941Smrg * The above copyright notice and this permission notice (including the next 12b8e80941Smrg * paragraph) shall be included in all copies or substantial portions of the 13b8e80941Smrg * Software. 14b8e80941Smrg * 15b8e80941Smrg * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16b8e80941Smrg * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17b8e80941Smrg * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 18b8e80941Smrg * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19b8e80941Smrg * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 20b8e80941Smrg * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS 21b8e80941Smrg * IN THE SOFTWARE. 22b8e80941Smrg */ 23b8e80941Smrg 24b8e80941Smrg#ifndef DAG_H 25b8e80941Smrg#define DAG_H 26b8e80941Smrg 27b8e80941Smrg#include <stdint.h> 28b8e80941Smrg#include "util/list.h" 29b8e80941Smrg#include "util/u_dynarray.h" 30b8e80941Smrg 31b8e80941Smrg#ifdef __cplusplus 32b8e80941Smrgextern "C" { 33b8e80941Smrg#endif 34b8e80941Smrg 35b8e80941Smrgstruct dag_edge { 36b8e80941Smrg struct dag_node *child; 37b8e80941Smrg /* User-defined data associated with the edge. */ 38b8e80941Smrg void *data; 39b8e80941Smrg}; 40b8e80941Smrg 41b8e80941Smrgstruct dag_node { 42b8e80941Smrg /* Position in the DAG heads list (or a self-link) */ 43b8e80941Smrg struct list_head link; 44b8e80941Smrg /* Array struct edge to the children. */ 45b8e80941Smrg struct util_dynarray edges; 46b8e80941Smrg uint32_t parent_count; 47b8e80941Smrg}; 48b8e80941Smrg 49b8e80941Smrgstruct dag { 50b8e80941Smrg struct list_head heads; 51b8e80941Smrg}; 52b8e80941Smrg 53b8e80941Smrgstruct dag *dag_create(void *mem_ctx); 54b8e80941Smrgvoid dag_init_node(struct dag *dag, struct dag_node *node); 55b8e80941Smrgvoid dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data); 56b8e80941Smrgvoid dag_remove_edge(struct dag *dag, struct dag_edge *edge); 57b8e80941Smrgvoid dag_traverse_bottom_up(struct dag *dag, void (*cb)(struct dag_node *node, 58b8e80941Smrg void *data), void *data); 59b8e80941Smrgvoid dag_prune_head(struct dag *dag, struct dag_node *node); 60b8e80941Smrg 61b8e80941Smrg#ifdef __cplusplus 62b8e80941Smrg} 63b8e80941Smrg#endif 64b8e80941Smrg 65b8e80941Smrg#endif 66