usr.bin/patch/pch.c

264 	struct file_name names[MAX_FILE];
266 	memset(names, 0, sizeof(names));
307 			names[OLD_FILE].path = fetchname(s + 4,
308 			    &names[OLD_FILE].exists, strippath);
310 			names[NEW_FILE].path = fetchname(s + 4,
311 			    &names[NEW_FILE].exists, strippath);
314 			names[OLD_FILE].path = fetchname(s + 4,
315 			    &names[OLD_FILE].exists, strippath);
317 			names[INDEX_FILE].path = fetchname(s + 6,
318 			    &names[INDEX_FILE].exists, strippath);
334 				p4_fetchname(&names[NEW_FILE], t + 3);
335 			p4_fetchname(&names[OLD_FILE], s + 5);
385 		struct file_name tmp = names[OLD_FILE];
386 		names[OLD_FILE] = names[NEW_FILE];
387 		names[NEW_FILE] = tmp;
391 			filearg[0] = posix_name(names, ok_to_create_file);
394 			if (names[OLD_FILE].path != NULL ||
395 			    names[NEW_FILE].path != NULL) {
396 				free(names[INDEX_FILE].path);
397 				names[INDEX_FILE].path = NULL;
399 			filearg[0] = best_name(names, ok_to_create_file);
414 			bestguess = posix_name(names, true);
416 			bestguess = best_name(names, true);
418 	free(names[OLD_FILE].path);
419 	free(names[NEW_FILE].path);
420 	free(names[INDEX_FILE].path);
1486 posix_name(const struct file_name *names, bool assume_exists)
1493 	 * of the old, new and index names (in that order) if
1497 		if (names[i].path != NULL && names[i].exists) {
1498 			path = names[i].path;
1508 			if (names[i].path != NULL &&
1509 			    (path = checked_in(names[i].path)) != NULL)
1517 		    names[NEW_FILE].path != NULL)
1518 			path = names[NEW_FILE].path;
1525 compare_names(const struct file_name *names, bool assume_exists, int phase)
1541 		path = names[i].path;
1543 		    (phase == 1 && !names[i].exists && !assume_exists) ||
1571 best_name(const struct file_name *names, bool assume_exists)
1575 	best = compare_names(names, assume_exists, 1);
1577 		best = compare_names(names, assume_exists, 2);
1583 		    names[NEW_FILE].path != NULL)
1584 			best = names[NEW_FILE].path;