Home
last modified time | relevance | path

Searched refs:digraph (Results 1 – 25 of 124) sorted by relevance

12345

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Ddigraph.h80 class digraph
88 digraph () {} in digraph() function
89 virtual ~digraph () {} in ~digraph()
146 digraph<GraphTraits>::dump_dot_to_pp (pretty_printer *pp, in dump_dot_to_pp()
197 digraph<GraphTraits>::dump_dot_to_file (FILE *fp, in dump_dot_to_file()
215 digraph<GraphTraits>::dump_dot (const char *path, in dump_dot()
228 digraph<GraphTraits>::add_node (node_t *node) in add_node()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
H A Ddigraph.cc74 struct test_graph : public digraph<test_graph_traits>
H A DONEWS393 The following digraph tokens are supported:
401 stringizing, digraph interpretation doesn't change the meaning of
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Ddigraph.h80 class digraph
88 digraph () {} in digraph() function
89 virtual ~digraph () {} in ~digraph()
146 digraph<GraphTraits>::dump_dot_to_pp (pretty_printer *pp, in dump_dot_to_pp()
197 digraph<GraphTraits>::dump_dot_to_file (FILE *fp, in dump_dot_to_file()
215 digraph<GraphTraits>::dump_dot (const char *path, in dump_dot()
228 digraph<GraphTraits>::add_node (node_t *node) in add_node()
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge()
H A Ddigraph.cc74 struct test_graph : public digraph<test_graph_traits>
H A DONEWS393 The following digraph tokens are supported:
401 stringizing, digraph interpretation doesn't change the meaning of
/netbsd-src/external/bsd/file/dist/magic/magdir/
H A Dgraphviz11 #0 regex/100l [\r\n\t\ ]*digraph[\r\n\t\ ]+.*\\{ graphviz digraph text
/netbsd-src/crypto/external/bsd/openssl/dist/doc/life-cycles/
H A Dcipher.dot1 digraph cipher {
46 digraph cipher {
H A Dkdf.dot1 strict digraph kdf {
H A Drand.dot1 strict digraph rand {
H A Dmac.dot1 digraph mac {
H A Ddigest.dot1 digraph digest {
H A Dpkey.dot1 strict digraph pkey {
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dfeasible-graph.cc176 digraph<fg_traits>::add_node (fnode); in add_node()
191 digraph<fg_traits>::add_node (dst_fnode); in add_feasibility_problem()
H A Dtrimmed-graph.h90 class trimmed_graph : public digraph <tg_traits>
H A Dfeasible-graph.h185 class feasible_graph : public digraph <fg_traits>
H A Dsm-malloc.dot23 digraph "malloc" {
H A Dsupergraph.h101 class supergraph : public digraph<supergraph_traits>
H A Dexploded-graph.h791 class exploded_graph : public digraph<eg_traits>
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/doc/xml/images/
H A Dconfdeps.dot2 digraph v3conf {
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/doc/xml/images/
H A Dconfdeps.dot2 digraph v3conf {
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dsm-malloc.dot23 digraph "malloc" {
H A Dsupergraph.h89 class supergraph : public digraph<supergraph_traits>
H A Dexploded-graph.h719 class exploded_graph : public digraph<eg_traits>
H A Dengine.cc2067 digraph<eg_traits>::add_edge (e); in add_edge()
3649 class viz_callgraph : public digraph<viz_callgraph_traits>

12345