Home Explore Help
Register Sign In
wareck
/
u-boot_mod
1
0
Fork 0
Files Issues 0 Pull Requests 0 Wiki
Tree: ec3cf7e62e
Branches Tags
u-boot_mod
/
toolchain
/
lib
/
gcc
/
mips-openwrt-linux-musl
/
5.3.0
/
plugin
/
include
/
graphds.h

graphds.h 2.1 KB
History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566 
  1. /* Graph representation.
    2. 

  2.    Copyright (C) 2007-2015 Free Software Foundation, Inc.
    3. 

  3. 

  4. This file is part of GCC.
    5. 

  5. 

  6. GCC is free software; you can redistribute it and/or modify it under
    7. 

  7. the terms of the GNU General Public License as published by the Free
    8. 

  8. Software Foundation; either version 3, or (at your option) any later
    9. 

  9. version.
    10. 

  10. 

  11. GCC is distributed in the hope that it will be useful, but WITHOUT ANY
    12. 

  12. WARRANTY; without even the implied warranty of MERCHANTABILITY or
    13. 

  13. FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    14. 

  14. for more details.
    15. 

  15. 

  16. You should have received a copy of the GNU General Public License
    17. 

  17. along with GCC; see the file COPYING3.  If not see
    18. 

  18. <http://www.gnu.org/licenses/>.  */
    19. 

  19. 

  20. #ifndef GCC_GRAPHDS_H
    21. 

  21. #define GCC_GRAPHDS_H
    22. 

  22. 

  23. /* Structure representing edge of a graph.  */
    24. 

  24. 

  25. struct graph_edge
    26. 

  26. {
    27. 

  27.   int src, dest;	/* Source and destination.  */
    28. 

  28.   struct graph_edge *pred_next, *succ_next;
    29. 

  29. 			/* Next edge in predecessor and successor lists.  */
    30. 

  30.   void *data;		/* Data attached to the edge.  */
    31. 

  31. };
    32. 

  32. 

  33. /* Structure representing vertex of a graph.  */
    34. 

  34. 

  35. struct vertex
    36. 

  36. {
    37. 

  37.   struct graph_edge *pred, *succ;
    38. 

  38. 			/* Lists of predecessors and successors.  */
    39. 

  39.   int component;	/* Number of dfs restarts before reaching the
    40. 

  40. 			   vertex.  */
    41. 

  41.   int post;		/* Postorder number.  */
    42. 

  42.   void *data;		/* Data attached to the vertex.  */
    43. 

  43. };
    44. 

  44. 

  45. /* Structure representing a graph.  */
    46. 

  46. 

  47. struct graph
    48. 

  48. {
    49. 

  49.   int n_vertices;	   /* Number of vertices.  */
    50. 

  50.   struct vertex *vertices; /* The vertices.  */
    51. 

  51.   struct obstack ob;	   /* Obstack for vertex and edge allocation.  */
    52. 

  52. };
    53. 

  53. 

  54. struct graph *new_graph (int);
    55. 

  55. void dump_graph (FILE *, struct graph *);
    56. 

  56. struct graph_edge *add_edge (struct graph *, int, int);
    57. 

  57. void identify_vertices (struct graph *, int, int);
    58. 

  58. int graphds_dfs (struct graph *, int *, int,
    59. 

  59. 		 vec<int> *, bool, bitmap);
    60. 

  60. int graphds_scc (struct graph *, bitmap);
    61. 

  61. void graphds_domtree (struct graph *, int, int *, int *, int *);
    62. 

  62. typedef void (*graphds_edge_callback) (struct graph *, struct graph_edge *);
    63. 

  63. void for_each_edge (struct graph *, graphds_edge_callback);
    64. 

  64. void free_graph (struct graph *g);
    65. 

  65. 

  66. #endif /* GCC_GRAPHDS_H */
    67.