/freebsd-9.3-release/lib/libc/gen/ |
H A D | fts-compat.c | 647 int cderrno, descend, len, level, maxlen, nlinks, oflag, saved_errno, local 680 nlinks = 0; 685 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2); 687 nlinks = -1; 690 nlinks = -1; 695 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink); 715 if (nlinks || type == BREAD) { 717 if (nlinks && type == BREAD) 811 if (nlinks) { [all...] |
H A D | fts.c | 645 long nlinks; /* has to be signed because -1 is a magic value */ local 677 nlinks = 0; 682 nlinks = cur->fts_nlink - (ISSET(FTS_SEEDOT) ? 0 : 2); 684 nlinks = -1; 687 nlinks = -1; 692 (void)printf("nlinks == %d (cur: %d)\n", nlinks, cur->fts_nlink); 712 if (nlinks || type == BREAD) { 714 if (nlinks && type == BREAD) 793 if (nlinks) { [all...] |
/freebsd-9.3-release/contrib/libarchive/cpio/test/ |
H A D | test.h | 102 /* Cygwin-1.7.x is lazy about populating nlinks, so don't 181 #define assertFileNLinks(pathname, nlinks) \ 182 assertion_file_nlinks(__FILE__, __LINE__, pathname, nlinks)
|
H A D | main.c | 1077 const char *pathname, int nlinks) 1085 if (r != 0 && bhfi.nNumberOfLinks == (DWORD)nlinks) 1088 pathname, bhfi.nNumberOfLinks, nlinks); 1097 if (r == 0 && st.st_nlink == nlinks) 1100 pathname, st.st_nlink, nlinks); 1076 assertion_file_nlinks(const char *file, int line, const char *pathname, int nlinks) argument
|
/freebsd-9.3-release/contrib/libarchive/libarchive/test/ |
H A D | test.h | 105 /* Cygwin-1.7.x is lazy about populating nlinks, so don't 185 #define assertFileNLinks(pathname, nlinks) \ 186 assertion_file_nlinks(__FILE__, __LINE__, pathname, nlinks)
|
H A D | main.c | 1067 const char *pathname, int nlinks) 1075 if (r != 0 && bhfi.nNumberOfLinks == (DWORD)nlinks) 1078 pathname, bhfi.nNumberOfLinks, nlinks); 1087 if (r == 0 && st.st_nlink == nlinks) 1090 pathname, st.st_nlink, nlinks); 1066 assertion_file_nlinks(const char *file, int line, const char *pathname, int nlinks) argument
|
/freebsd-9.3-release/contrib/libarchive/tar/test/ |
H A D | test.h | 102 /* Cygwin-1.7.x is lazy about populating nlinks, so don't 181 #define assertFileNLinks(pathname, nlinks) \ 182 assertion_file_nlinks(__FILE__, __LINE__, pathname, nlinks)
|
H A D | main.c | 1173 const char *pathname, int nlinks) 1181 if (r != 0 && bhfi.nNumberOfLinks == (DWORD)nlinks) 1184 pathname, bhfi.nNumberOfLinks, nlinks); 1193 if (r == 0 && st.st_nlink == nlinks) 1196 pathname, st.st_nlink, nlinks); 1172 assertion_file_nlinks(const char *file, int line, const char *pathname, int nlinks) argument
|
/freebsd-9.3-release/usr.sbin/ppp/ |
H A D | mp.c | 671 int thislink, nlinks, nopenlinks, sendasip; local 676 thislink = nlinks = nopenlinks = 0; 685 nlinks++; 698 for (dl = fdl; nlinks > 0; dl = dl->next, nlinks--, thislink++) { 787 nlinks--;
|
H A D | bundle.c | 455 int result, nlinks; local 462 for (nlinks = 0, dl = bundle->links; dl; dl = dl->next) 463 nlinks++; 465 if (nlinks) { 472 ifqueue = nlinks > bundle->cfg.ifqueue ? nlinks : bundle->cfg.ifqueue;
|
/freebsd-9.3-release/lib/libstand/ |
H A D | ufs.c | 505 int nlinks = 0; local 625 ++nlinks > MAXSYMLINKS) {
|
H A D | nfs.c | 456 int nlinks = 0; local 579 || ++nlinks > MAXSYMLINKS) { 1100 int nlinks = 0; local 1229 || ++nlinks > MAXSYMLINKS) {
|
H A D | ext2fs.c | 340 int nlinks = 0; local 487 ++nlinks > MAXSYMLINKS) {
|
/freebsd-9.3-release/usr.bin/find/ |
H A D | function.c | 1060 char *nlinks; local 1063 nlinks = nextarg(option, argvp); 1067 new->l_data = (nlink_t)find_parsenum(new, option->name, nlinks, NULL);
|
/freebsd-9.3-release/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_iso9660.c | 286 int nlinks; member in struct:file_info 1152 archive_entry_set_nlink(entry, file->nlinks); 1237 /* Overwrite nlinks by proper link number which is 1787 file->nlinks = 1;/* Reset nlink. we'll calculate it later. */ 2002 * 8 bytes for nlinks, 2012 file->nlinks 2714 * so much so that each nlinks of files in cache_file 2719 file->nlinks = count;
|
/freebsd-9.3-release/contrib/tzcode/zic/ |
H A D | zic.c | 277 static int nlinks; variable 596 for (i = 0; i < nlinks; ++i) { 600 for (j = 0; j < nlinks; ++j) 1229 (int) ((nlinks + 1) * sizeof *links)); 1230 links[nlinks++] = l;
|