Home
last modified time | relevance | path

Searched refs:dfs_fst_edge (Results 1 – 25 of 37) sorted by relevance

12

/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
H A DChangeLog-201728471 (foll_in_subgraph, dfs_fst_edge, dfs_next_edge): New function
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dgraphds.c164 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph) in dfs_fst_edge() function
222 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
252 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
H A DChangeLog-201728471 (foll_in_subgraph, dfs_fst_edge, dfs_next_edge): New function
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dgraphds.c163 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph) in dfs_fst_edge() function
221 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
251 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
H A DChangeLog-201728471 (foll_in_subgraph, dfs_fst_edge, dfs_next_edge): New function
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
H A DChangeLog-201728471 (foll_in_subgraph, dfs_fst_edge, dfs_next_edge): New function
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dgraphds.c162 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph) in dfs_fst_edge() function
220 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
250 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dgraphds.c173 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph, in dfs_fst_edge() function
238 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
268 e = dfs_fst_edge (g, v, forward, subgraph, skip_edge_p); in graphds_dfs()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dgraphds.c163 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph) in dfs_fst_edge() function
221 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
251 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dgraphds.c162 dfs_fst_edge (struct graph *g, int v, bool forward, bitmap subgraph) in dfs_fst_edge() function
220 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()
250 e = dfs_fst_edge (g, v, forward, subgraph); in graphds_dfs()

12