Lines Matching defs:nlink
80 int nlink;
230 if (mtx1->nlink == kMaxLink) {
235 for (; li < mtx1->nlink; li++) {
250 if (li == mtx1->nlink) {
252 Link *link = &mtx1->link[mtx1->nlink++];
264 if (!added || mtx->nlink == 0) {
353 mtx->nlink = 0;
371 for (int li = 0; li < mtx->nlink; li++)
387 if (mtx1->nlink == 0)
393 for (int li = 0; li < mtx1->nlink; li++) {
397 // FIXME(dvyukov): fast nlink != 0 check
