Lines Matching defs:path
249 name->path = fetchname(str, &name->exists, strippath);
307 names[OLD_FILE].path = fetchname(s + 4,
310 names[NEW_FILE].path = fetchname(s + 4,
314 names[OLD_FILE].path = fetchname(s + 4,
317 names[INDEX_FILE].path = fetchname(s + 6,
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;
418 free(names[OLD_FILE].path);
419 free(names[NEW_FILE].path);
420 free(names[INDEX_FILE].path);
1488 char *path = NULL;
1497 if (names[i].path != NULL && names[i].exists) {
1498 path = names[i].path;
1502 if (path == NULL && !assume_exists) {
1507 if (path == NULL && ok_to_create_file &&
1508 names[NEW_FILE].path != NULL)
1509 path = names[NEW_FILE].path;
1512 return path ? xstrdup(path) : NULL;
1520 char *path;
1524 * The "best" name is the one with the fewest number of path
1532 path = names[i].path;
1533 if (path == NULL || (!names[i].exists && !assume_exists))
1535 if ((tmp = num_components(path)) > min_components)
1539 best = path;
1541 if ((tmp = strlen(basename(path))) > min_baselen)
1545 best = path;
1547 if ((tmp = strlen(path)) > min_len)
1550 best = path;
1568 best = names[NEW_FILE].path;
1574 num_components(const char *path)
1579 for (n = 0, cp = path; (cp = strchr(cp, '/')) != NULL; n++, cp++) {