parents
uint16_t parents[3];
uint32_t idx = clk->parents[mux];
if (parent >= nitems(clk->parents))
parent = clk->parents[parent];
for (i = 0; i < nitems(clk->parents); i++) {
if (clk->parents[i] == 0)
parent = clk->parents[best_mux];
uint16_t parents[8];
uint32_t idx = clk->parents[mux];
uint32_t idx = clk->parents[mux];
if (clk->parents[mux] == 0) {
idx = clk->parents[mux];
if (clk->parents[mux] == 0) {
parent = clk->parents[mux];
parent = clk->parents[mux];
for (i = 0; i < nitems(clk->parents); i++) {
if (clk->parents[i] == 0)
parent = clk->parents[i];
for (i = 0; i < nitems(clk->parents); i++) {
if (clk->parents[i] == 0)
for (mux = 0; mux < nitems(clk->parents); mux++) {
if (clk->parents[mux] == parent)
if (mux == nitems(clk->parents) || parent == 0) {
uint32_t *clocks, *parents, *rates;
parent = parents = NULL;
parent = parents = malloc(plen, M_TEMP, M_WAITOK);
OF_getpropintarray(node, "assigned-clock-parents", parents, plen);
if (parent && parent < parents + (plen / sizeof(uint32_t)))
free(parents, M_TEMP, plen);
cyclenlp -> parents = 0; /* list of caller arcs */
for ( arcp=memberp->parents ; arcp ; arcp=arcp->arc_parentlist ) {
for ( arcp = nlp -> parents; arcp; arcp = arcp -> arc_parentlist ) {
arcp -> arc_parentlist = childp -> parents;
childp -> parents = arcp;
for (arcp = childp -> parents ; arcp ; arcp = arcp -> arc_parentlist) {
for (arcp = memp->parents ; arcp ; arcp = arcp->arc_parentlist) {
arctype *parents; /* list of caller arcs */
if ( childp -> parents == 0 ) {
for ( arcp = childp -> parents ; arcp ; arcp = arcp -> arc_parentlist ) {
for (arcp = childp->parents; arcp; arcp = detachedp) {
childp -> parents = sorted.arc_parentlist;
for (ln = Lst_First(&gn->parents); ln != NULL; ln = Lst_Adv(ln)) {
if (!Lst_IsEmpty(&gn->parents)) {
Lst_Every(&gn->parents, TargPrintName);
for (ln = Lst_First(&gn->parents); ln != NULL; ln = Lst_Adv(ln)) {
Lst_AtEnd(&gn->parents, pgn);
Lst_ForEach(&gn->parents, MakeTimeStamp, gn);
Lst_AtEnd(&cgn->parents, pgn);
LIST parents; /* Nodes that depend on this one */
for (ln = Lst_First(&cgn->parents); ln != NULL; ln = Lst_Adv(ln)) {
Lst_AtEnd(&cgn->parents, pgn);
for (ln = Lst_First(&gn->parents); ln != NULL;
suff = find_suffix_as_suffix(&ms->parents, gn->name, eoarch);
LIST parents; /* List of Suff we have a transformation to */
if (!Lst_IsEmpty(&s->parents)) {
Lst_Every(&s->parents, SuffPrintName);
Lst_Init(&s->parents);
SuffInsert(&s->parents, s2);
if (Lst_Member(&suff->parents, targ->suff) == NULL)
Lst_Init(&gn->parents);
Lst_AtEnd(&cgn->parents, gn);
extern struct parents parents;
struct parents parents;
int pv_size = %d;\n", parents.used) < 0)
short pv[%d] = {", parents.used) < 0)
for (i = 0; i < parents.used; i++)
if (fprintf(fp, "%s%d,", SEP(i, 16), parents.vec[i]) < 0)
parents.vec = ereallocarray(NULL, pvecspace, sizeof(*parents.vec));
parents.used = 0;
samepv, parents.used)) < 0)
for (p = &parents.vec[off], q = (short *)ptr; --len >= 0;)
ret = parents.used;
if ((parents.used = ret + len) > pvecspace)
for (p = &parents.vec[ret]; --len > 0;)
firstend = parents.used - 1;