Searched refs:GRAPH (Results 1 - 3 of 3) sorted by relevance
| /freebsd-12-stable/contrib/nvi/regex/ |
| H A D | cclass.h | 43 RCHAR_T GRAPH[] = {'g','r','a','p','h',0}; variable
65 { GRAPH, "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\
|
| /freebsd-12-stable/usr.bin/mklocale/ |
| H A D | lex.l | 99 GRAPH { yylval.i = _CTYPE_G|_CTYPE_R;
|
| /freebsd-12-stable/contrib/gcc/ |
| H A D | tree-outof-ssa.c | 311 /* Find all the nodes in GRAPH which are successors to NODE in the
315 #define FOR_EACH_ELIM_GRAPH_SUCC(GRAPH, NODE, VAR, CODE) \
319 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
321 y_ = VEC_index (int, (GRAPH)->edge_list, x_); \
324 (VAR) = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
331 GRAPH. VAR will hold the partition number found. CODE is the
334 #define FOR_EACH_ELIM_GRAPH_PRED(GRAPH, NODE, VAR, CODE) \
338 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \
340 y_ = VEC_index (int, (GRAPH)->edge_list, x_ + 1); \
343 (VAR) = VEC_index (int, (GRAPH)
[all...] |
Completed in 200 milliseconds