sources
int killed, sources, dests;
killed = sources = dests = 0;
sources++;
"destinations\n", killed, sources, dests);
int killed, sources, dests;
killed = sources = dests = 0;
sources++;
"destinations\n", killed, sources, dests);
source = sources[ms->ms_source];
static const char *sources[] = {
const unsigned int source_max = __arraycount(sources);
static const char * const sources[32] = {
strlcpy(buf, sources[irq], len);
static const char * const sources[64] = {
strlcpy(buf, sources[pic->pic_irqbase + irq], len);
strlcpy(buf, sources[pic->pic_irqbase + irq], len);
static const char * const sources[64] = {
strlcpy(buf, sources[pic->pic_irqbase + irq], len);
static const char * const sources[64] = {
strlcpy(buf, sources[irq], len);
static const char * const sources[] = {
strlcpy(buf, sources[pic->pic_irqbase + irq], len);
static const char * const sources[64] = {
static const struct ac97_source_info sources[6] = {
ac97_add_port(as, &sources[0]);
ac97_add_port(as, &sources[1]);
ac97_add_port(as, &sources[2]);
ac97_add_port(as, &sources[3]);
ac97_add_port(as, &sources[4]);
ac97_add_port(as, &sources[5]);
static const struct ac97_source_info sources[3] = {
ac97_add_port(as, &sources[0]);
ac97_add_port(as, &sources[1]);
ac97_add_port(as, &sources[2]);
LIST_INSERT_HEAD(&E->sources, rs, list);
LIST_HEAD(,krndsource) sources; /* list of entropy sources */
LIST_FOREACH(rs, &E->sources, list) {
.sources = LIST_HEAD_INITIALIZER(entropy_global.sources),
LIST_FOREACH(rs, &E->sources, list) {
LIST_FOREACH(rs, &E->sources, list) {
LIST_FOREACH(rs, &E->sources, list) {
LIST_FOREACH(rs, &E->sources, list) {
LIST_FOREACH(rs, &E->sources, list) {
LIST_FOREACH(rs, &E->sources, list)
GNodeList sources = LST_INIT;
if (!Arch_ParseArchive(&start, &sources,
while (!Lst_IsEmpty(&sources)) {
GNode *gn = Lst_Dequeue(&sources);
Lst_Done(&sources);
RemoveCandidate(CandidateList *sources)
debug_printf("cleaning list %p:", sources);
CandidateList_PrintAddrs(sources);
for (ln = sources->first; ln != NULL; ln = ln->next) {
sources, src, src->file, src->numChildren);
Lst_Remove(sources, ln);
sources, src, src->file, src->numChildren);
FindThem(CandidateList *sources, CandidateSearcher *cs)
while (!Lst_IsEmpty(sources)) {
Candidate *src = Lst_Dequeue(sources);
sources, src, src->file);
CandidateList_AddCandidatesFor(sources, src);
CandidateList *sources, CandidateList *targets)
CandidateList_AddCandidatesFor(sources, targ);
CandidateList *sources, CandidateList *targets)
CandidateList_AddCandidatesFor(sources, targ);
CandidateList sources = LST_INIT;
FindDepsRegularKnown(name, nameLen, gn, &sources, &targets);
FindDepsRegularUnknown(gn, name, &sources, &targets);
bottom = FindThem(&sources, cs);
while (RemoveCandidate(&sources) || RemoveCandidate(&targets))
CandidateSearcher_MoveAll(cs, &sources);
enum sources source[EDQUOTA_NUMOBJTYPES];
source_is_real(enum sources source)