Lines Matching refs:names
276 struct file_name names[MAX_FILE];
279 memset(names, 0, sizeof(names));
320 names[OLD_FILE].path = fetchname(s + 4,
321 &names[OLD_FILE].exists, strippath);
327 names[NEW_FILE].path = fetchname(s + off,
328 &names[NEW_FILE].exists, strippath);
335 names[OLD_FILE].path = fetchname(s + off,
336 &names[OLD_FILE].exists, strippath);
338 names[INDEX_FILE].path = fetchname(s + 6,
339 &names[INDEX_FILE].exists, strippath);
358 p4_fetchname(&names[NEW_FILE], t + 3);
359 p4_fetchname(&names[OLD_FILE], s + 5);
409 struct file_name tmp = names[OLD_FILE];
410 names[OLD_FILE] = names[NEW_FILE];
411 names[NEW_FILE] = tmp;
426 if (names[OLD_FILE].path != NULL)
427 source_file = xstrdup(names[OLD_FILE].path);
428 else if (names[OLD_FILE].exists)
433 filearg[0] = posix_name(names, ok_to_create_file);
436 if (names[OLD_FILE].path != NULL ||
437 names[NEW_FILE].path != NULL) {
438 free(names[INDEX_FILE].path);
439 names[INDEX_FILE].path = NULL;
441 filearg[0] = best_name(names, ok_to_create_file);
456 bestguess = posix_name(names, true);
458 bestguess = best_name(names, true);
460 free(names[OLD_FILE].path);
461 free(names[NEW_FILE].path);
462 free(names[INDEX_FILE].path);
1528 posix_name(const struct file_name *names, bool assume_exists)
1535 * of the old, new and index names (in that order) if
1539 if (names[i].path != NULL && names[i].exists) {
1540 path = names[i].path;
1550 names[NEW_FILE].path != NULL)
1551 path = names[NEW_FILE].path;
1558 compare_names(const struct file_name *names, bool assume_exists)
1574 path = names[i].path;
1575 if (path == NULL || (!names[i].exists && !assume_exists))
1602 best_name(const struct file_name *names, bool assume_exists)
1606 best = compare_names(names, assume_exists);
1610 best = names[NEW_FILE].path;