/fs/btrfs/tests/ |
H A D | extent-io-tests.c | 76 u64 found; local 115 found = find_lock_delalloc_range(inode, &tmp, locked_page, &start, 117 if (!found) { 118 test_msg("Should have found at least one delalloc\n"); 146 found = find_lock_delalloc_range(inode, &tmp, locked_page, &start, 148 if (!found) { 180 found = find_lock_delalloc_range(inode, &tmp, locked_page, &start, 182 if (found) { 201 found = find_lock_delalloc_range(inode, &tmp, locked_page, &start, 203 if (!found) { [all...] |
/fs/ |
H A D | dcookies.c | 67 struct dcookie_struct *found = NULL; local 77 found = dcs; 82 return found;
|
H A D | posix_acl.c | 315 int found = 0; local 332 found = 1; 339 found = 1; 347 if (found)
|
/fs/isofs/ |
H A D | namei.c | 32 * returns the inode number of the found entry, or 0 on error. 153 int found; local 163 found = isofs_find_entry(dir, dentry, 169 inode = found ? isofs_iget(dir->i_sb, block, offset) : NULL;
|
/fs/cifs/ |
H A D | smb2misc.c | 440 bool found; local 460 cifs_dbg(FYI, "found in the open list\n"); 476 found = false; 482 if (!found && ack_req) { 483 found = true; 490 cifs_dbg(FYI, "found in the pending open list\n"); 496 return found;
|
/fs/dlm/ |
H A D | plock.c | 262 /* cause the vfs unlock to return ENOENT if lock is not found */ 426 int found = 0, do_callback = 0; local 449 found = 1; 455 if (found) {
|
/fs/exportfs/ |
H A D | expfs.c | 145 dprintk("%s: found name: %s\n", __func__, nbuf); 233 char *name; /* name that was found. It already points to a 236 int found; /* inode matched? */ member in struct:getdents_callback 254 buf->found = 1; 318 if (buffer.found) {
|
/fs/ext4/ |
H A D | file.c | 288 int found = 0; local 317 found = 1; 328 found = 1; 342 found = 1; 366 found = 1; 369 found = 1; 371 if (found) { 391 found = 1; 402 return found;
|
H A D | extents_status.c | 208 * it can't be found, try to find next extent. 245 * @es: delayed extent that we found 736 * Return: 1 on found, 0 on not 745 int found = 0; local 760 found = 1; 773 found = 1; 780 if (found) { 792 trace_ext4_es_lookup_extent_exit(inode, es, found); 793 return found;
|
/fs/jffs2/ |
H A D | gc.c | 521 break; /* We've found them all */ 534 /* We found a datanode. Do the GC */ 879 int found = 0; local 978 found = 1; 984 if (!found) { 985 pr_warn("Deletion dirent \"%s\" not found in list for ino #%u\n",
|
/fs/nfs/blocklayout/ |
H A D | extent_tree.c | 337 bool found = false; local 341 found = __ext_tree_lookup(&bl->bl_ext_ro, isect, ret); 342 if (!found) 343 found = __ext_tree_lookup(&bl->bl_ext_rw, isect, ret); 346 return found; 565 dprintk("%s found %zu ranges\n", __func__, count);
|
/fs/ocfs2/dlm/ |
H A D | dlmunlock.c | 399 int found = 0, i; local 442 found = 0; 470 found = 1; 474 if (found) 480 if (!found) { 485 /* lock was found on queue */ 510 if (!found) 673 * lockres queues and cannot be found. */
|
/fs/sysv/ |
H A D | super.c | 306 char *found = flavour_names[sbi->s_type]; local 330 found, sb->s_blocksize, sb->s_id);
|
/fs/xfs/libxfs/ |
H A D | xfs_sb.c | 142 int found; local 146 found = radix_tree_gang_lookup_tag(&mp->m_perag_tree, 148 if (found <= 0) { 170 * Check the validity of the SB found.
|
/fs/f2fs/ |
H A D | xattr.c | 487 int found, newsize; local 510 found = IS_XATTR_LAST_ENTRY(here) ? 0 : 1; 512 if ((flags & XATTR_REPLACE) && !found) { 515 } else if ((flags & XATTR_CREATE) && found) { 534 if (found) 544 if (found) { 546 * If entry is found, remove old entry. 547 * If not found, remove operation is not needed.
|
/fs/gfs2/ |
H A D | recovery.c | 59 int found = 0; local 63 found = 1; 68 if (found) { 88 int found = 0; local 92 found = 1; 97 if (!found) 213 * jhead_scan - make sure we've found the head of the log
|
/fs/jfs/ |
H A D | xattr.c | 397 * I have found the disk blocks which were originally used to store 708 int found = 0; local 739 found = 1; 752 if (!found) { 780 if (found) {
|
/fs/nfsd/ |
H A D | nfscache.c | 364 * Must be called with cache_lock held. Returns the found entry or 399 * is found, we try to grab the oldest expired entry off the LRU list. If 407 struct svc_cacherep *rp, *found; local 441 found = nfsd_cache_search(b, rqstp, csum); 442 if (found) { 445 rp = found; 481 /* We found a matching entry which is either in progress or done. */
|
/fs/ocfs2/ |
H A D | reservations.c | 109 mlog(ML_NOTICE, "%d reservations found. LRU follows\n", i); 362 * If a window containing that goal is not found, we return the window 410 * Returns the length of allocation, 0 if no free bits are found. 423 int offset, start, found; local 428 found = best_start = best_len = 0; 438 /* we found a zero */ 439 found++; 444 found = 1; 447 if (found > best_len) { 448 best_len = found; [all...] |
H A D | quota_local.c | 935 int found = 0, len; local 941 found = 1; 945 if (!found) 956 found = ocfs2_find_next_zero_bit_unaligned(dchunk->dqc_bitmap, len, 0); 958 if (found == len) { 964 *offset = found;
|
/fs/ubifs/ |
H A D | lprops.c | 1068 int found = 0; local 1072 found = 1; 1076 if (!found) { 1128 int found, level = 0; local 1148 found = ubifs_tnc_has_node(c, &snod->key, level, lnum, 1150 if (found) { 1151 if (found < 0)
|
H A D | lpt_commit.c | 156 * an empty LEB is found it is returned in @lnum and the function returns %0. 340 * function starting from @lnum. If a LEB is found it is returned in @lnum and 889 * make_nnode_dirty - find a nnode and, if found, make it dirty. 938 * make_pnode_dirty - find a pnode and, if found, make it dirty. 1373 * @hght: height of tree where nnode found is returned here 1375 * This function returns a pointer to the nnode found or %NULL if no nnode is 1376 * found. This function is a helper to 'ubifs_lpt_free()'. 1381 int h, i, found; local 1388 found = 0; 1391 found 1416 int iip, h, i, found; local [all...] |
/fs/afs/ |
H A D | dir.c | 125 int found; member in struct:afs_lookup_cookie 302 /* found the next entry */ 415 cookie->found = 1; 417 _leave(" = -1 [found]"); 423 * - just returns the FID the dentry name maps to if found 446 if (!cookie.found) { 447 _leave(" = -ENOENT [not found]"); 572 * check that a dentry lookup hit has found a valid entry 659 _debug("%s: dirent not found", dentry->d_name.name);
|
/fs/xfs/ |
H A D | xfs_file.c | 997 * start of the region that was found. Otherwise this function will 1007 bool found = false; local 1024 found = true; 1027 found = true; 1030 if (found) { 1037 return found; 1049 * Return true if the desired type of offset was found, and the argument 1068 bool found = false; local 1095 /* Data search found nothing */ 1101 found [all...] |
/fs/btrfs/ |
H A D | qgroup.c | 295 /* default this to quota off, in case no status key is found */ 1481 * not have actually found our ref root when doing 1613 /* Ok now process the qgroups we found */ 1810 * jack this sequence up by the number of roots we found each time in order to 2524 struct btrfs_key found; local 2559 btrfs_item_key_to_cpu(path->nodes[0], &found, 2561 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1; 2570 btrfs_item_key_to_cpu(scratch_leaf, &found, slot); 2571 if (found.type != BTRFS_EXTENT_ITEM_KEY && 2572 found [all...] |