Lines Matching +full:cycle +full:- +full:1
1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
10 * 1. Redistributions of source code must retain the above copyright
53 #define TRUE 1
58 * scaling and makes bucket:pc densities of more than 1/2 useless.
93 struct arcstruct *arc_parentlist; /* parents-of-this-child list */
94 struct arcstruct *arc_childlist; /* children-of-this-parent list */
95 struct arcstruct *arc_next; /* list of arcs on cycle */
127 int toporder; /* graph call chain top-sort order */
128 int cycleno; /* internal number of cycle on */
130 struct nl *cyclehead; /* pointer to head of cycle */
131 struct nl *cnext; /* pointer to next member of cycle */
141 #define HASCYCLEXIT 0x08 /* node has arc exiting from cycle */
142 #define CYCLEHEAD 0x10 /* node marked as head of a cycle */
143 #define VISITED 0x20 /* node visited during a cycle */
146 * The cycle list.
147 * for each subcycle within an identified cycle, we gather
151 int size; /* length of cycle */
153 arctype *list[1]; /* list of arcs in cycle */
158 EXTERN arctype *archead; /* the head of arcs in current cycle list */
167 #define DFN_BUSY -1
171 * namelist entries for cycle headers.
174 EXTERN nltype *cyclenl; /* cycle header namelist */
212 /* with -C, minimum cycle size to ignore */
220 EXTERN bool Cflag; /* find cut-set to eliminate cycles */
309 #define LESSTHAN -1
311 #define GREATERTHAN 1
313 #define DFNDEBUG 1