contrib/bmake/suff.c

327 	SuffixListNode *ln;
329 	for (ln = sufflist.first; ln != NULL; ln = ln->next) {
330 		Suffix *suff = ln->datum;
347 	GNodeListNode *ln;
349 	for (ln = transforms.first; ln != NULL; ln = ln->next) {
350 		GNode *gn = ln->datum;
360 	SuffixListNode *ln = Lst_FindDatum(list, suff);
361 	if (ln != NULL) {
362 		Lst_Remove(list, ln);
412 	SuffixListNode *ln;
415 	for (ln = list->first; ln != NULL; ln = ln->next) {
416 		listSuff = ln->datum;
421 	if (ln == NULL) {
428 		Lst_InsertBefore(list, ln, Suffix_Ref(suff));
497 	SuffixListNode *ln;
506 	for (ln = sufflist.first; ln != NULL; ln = ln->next) {
507 		Suffix *src = ln->datum;
794 	GNodeListNode *ln;
796 	for (ln = Targ_List()->first; ln != NULL; ln = ln->next) {
797 		GNode *gn = ln->datum;
807 	GNodeListNode *ln;
823 	for (ln = transforms.first; ln != NULL; ln = ln->next)
824 		RebuildGraph(ln->datum, suff);
851 	SuffixListNode *ln;
856 	for (ln = sufflist.first; ln != NULL; ln = ln->next) {
857 		Suffix *suff = ln->datum;
952 	CandidateListNode *ln;
954 	for (ln = list->first; ln != NULL; ln = ln->next) {
955 		Candidate *cand = ln->datum;
1007 	SuffixListNode *ln;
1008 	for (ln = cand->suff->children.first; ln != NULL; ln = ln->next) {
1009 		Suffix *suff = ln->datum;
1033 	CandidateListNode *ln;
1040 	for (ln = srcs->first; ln != NULL; ln = ln->next) {
1041 		Candidate *src = ln->datum;
1063 			Lst_Remove(srcs, ln);
1393 	GNodeListNode *ln, *nln;
1395 	for (ln = gn->children.first; ln != NULL; ln = nln) {
1396 		nln = ln->next;
1397 		ExpandChildren(ln, gn);
1415 		SuffixListNode *ln;
1416 		for (ln = sufflist.first; ln != NULL; ln = ln->next)
1417 			if (Suffix_IsSuffix(ln->datum, nameLen, name + nameLen))
1421 		if (ln != NULL)
1422 			suff = ln->datum;
1452 	GNodeListNode *ln;
1474 	ln = tgn->children.last;
1480 	ln = ln != NULL ? ln->next : NULL;
1481 	while (ln != NULL) {
1482 		GNodeListNode *nln = ln->next;
1483 		ExpandChildren(ln, tgn);
1484 		ln = nln;
1506 	SuffixListNode *ln;
1510 	for (ln = memSuff->parents.first; ln != NULL; ln = ln->next)
1511 		if (Suffix_IsSuffix(ln->datum, nameLen, eoarch))
1514 	if (ln != NULL) {
1515 		Suffix *suff = ln->datum;
1655 	SuffixListNode *ln;
1659 	for (ln = sufflist.first; ln != NULL; ln = ln->next) {
1660 		Suffix *suff = ln->datum;
1846 		GNodeListNode *ln, *nln;
1847 		for (ln = gn->children.first; ln != NULL; ln = nln) {
1848 			nln = ln->next;
1849 			ExpandChildren(ln, gn);
2049 	SuffixListNode *ln;
2051 	for (ln = sufflist.first; ln != NULL; ln = ln->next)
2052 		Suffix_Free(ln->datum);
2054 	for (ln = suffClean.first; ln != NULL; ln = ln->next)
2055 		Suffix_Free(ln->datum);
2067 	SuffixListNode *ln;
2070 	for (ln = suffs->first; ln != NULL; ln = ln->next) {
2071 		const Suffix *suff = ln->datum;
2118 		SuffixListNode *ln;
2119 		for (ln = sufflist.first; ln != NULL; ln = ln->next)
2120 			Suffix_Print(ln->datum);
2125 		GNodeListNode *ln;
2126 		for (ln = transforms.first; ln != NULL; ln = ln->next)
2127 			PrintTransformation(ln->datum);
2135 	SuffixListNode *ln;
2139 	for (ln = sufflist.first; ln != NULL; ln = ln->next) {
2140 		suff = ln->datum;
2141 		if (ln != sufflist.first)