| /illumos-gate/usr/src/tools/smatch/src/gvpr/ |
| H A D | subg-fwd | 4 // Run with graph ... | return-paths | subg-fwd -a functionname
5 // or graph ... | subg-fwd
21 graph_t returns = graph("return-edges", ""); // Temporary graph to hold return edges
50 // Move unused return edges into a separate graph so they don't get followed
|
| H A D | return-paths | 5 // Run with graph ... | return-paths
|
| H A D | subg-rev | 4 // Run with graph ... | return-paths | subg-rev -a functionname
|
| /illumos-gate/usr/src/test/libc-tests/tests/wctype/ |
| H A D | wctype_test.c | 80 test_ctype_subset(upper, graph); in main()
81 test_ctype_subset(lower, graph); in main()
82 test_ctype_subset(digit, graph); in main()
83 test_ctype_subset(punct, graph); in main()
|
| /illumos-gate/usr/src/cmd/sgs/gprof/common/ |
| H A D | gprof.callg.blurb | 1 call graph profile:
7 index the index of the function in the call graph
30 index the index of the function in the call graph
57 index the index of this parent in the call graph
83 index the index of this child in the call graph listing,
|
| /illumos-gate/usr/src/uts/common/sys/ |
| H A D | flock_impl.h | 71 struct graph *l_graph; /* graph this belongs to */
95 struct graph { struct
103 typedef struct graph graph_t;
188 extern struct graph *lock_graph[HASH_SIZE];
|
| /illumos-gate/usr/src/cmd/mandoc/ |
| H A D | term.c | 259 int graph; /* Last character was non-blank. */ in term_fill() local
262 breakline = graph = 0; in term_fill()
289 if (graph) { in term_fill()
292 graph = 0; in term_fill()
302 graph = 1; in term_fill()
323 graph = 1; in term_fill()
338 if (graph && (vis <= vtarget || *nbr == 0)) { in term_fill()
|
| /illumos-gate/usr/src/tools/smatch/src/Documentation/ |
| H A D | data-structures.txt | 40 So basic blocks represent a node in the control flow graph.
41 The edges in that graph lead from one basic block to a basic block which can follow it in the execu…
45 So you have an entrypoint, which has a graph of basic blocks, each of which has a list of instructi…
|
| /illumos-gate/usr/src/lib/libc/port/locale/ |
| H A D | isdigit.c | 83 DEFN_ISTYPE(graph, _ISGRAPH)
|
| H A D | iswctype.c | 141 DEFN_ISWTYPE(graph, _CTYPE_G) in DEFN_ISWTYPE()
|
| /illumos-gate/usr/src/cmd/svc/startd/ |
| H A D | Makefile | 38 graph.o \
|
| /illumos-gate/usr/src/tools/smatch/src/ |
| H A D | Makefile | 79 PROGRAMS += graph
|
| /illumos-gate/usr/src/boot/include/xlocale/ |
| H A D | _ctype.h | 127 XLOCALE_ISCTYPE(graph, _CTYPE_G)
|
| /illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
| H A D | genunix.c | 1978 graph_t *graph; in lg_walk_step() local
1984 if (mdb_vread(&graph, sizeof (graph), wsp->walk_addr) == -1) { in lg_walk_step()
1989 wsp->walk_addr += sizeof (graph); in lg_walk_step()
1991 if (graph == NULL) in lg_walk_step()
1997 lw.startaddr = (uintptr_t)&(graph->active_locks); in lg_walk_step()
2003 lw.startaddr = (uintptr_t)&(graph->sleeping_locks); in lg_walk_step()
|
| /illumos-gate/usr/src/uts/common/io/usb/hcd/ |
| H A D | README | 380 It fetches the element and begins traversing the graph of linked schedule
|
| /illumos-gate/usr/src/data/locale/data/ |
| H A D | gu_IN.UTF-8.src | 205 graph <EXCLAMATION_MARK>;/
|
| H A D | pa_IN.UTF-8.src | 201 graph <EXCLAMATION_MARK>;/
|
| H A D | hy_AM.UTF-8.src | 217 graph <EXCLAMATION_MARK>;/
|
| H A D | kn_IN.UTF-8.src | 210 graph <EXCLAMATION_MARK>;/
|
| H A D | or_IN.UTF-8.src | 205 graph <EXCLAMATION_MARK>;/
|
| H A D | te_IN.UTF-8.src | 211 graph <EXCLAMATION_MARK>;/
|
| H A D | th_TH.UTF-8.src | 200 graph <EXCLAMATION_MARK>;/
|
| H A D | si_LK.UTF-8.src | 212 graph <EXCLAMATION_MARK>;/
|
| H A D | en_CA.ISO8859-1.src | 233 graph <EXCLAMATION_MARK>;/
|
| H A D | en_GB.ISO8859-1.src | 233 graph <EXCLAMATION_MARK>;/
|