xfs_alloc.c (9938b04472d5c59f8bd8152a548533a8599596a2) | xfs_alloc.c (0d5a75e9e23ee39cd0d8a167393dcedb4f0f47b2) |
---|---|
1/* 2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. 3 * All Rights Reserved. 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License as 7 * published by the Free Software Foundation. 8 * --- 70 unchanged lines hidden (view full) --- 79 cur->bc_rec.a.ar_blockcount = len; 80 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); 81} 82 83/* 84 * Lookup the first record less than or equal to [bno, len] 85 * in the btree given by cur. 86 */ | 1/* 2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. 3 * All Rights Reserved. 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License as 7 * published by the Free Software Foundation. 8 * --- 70 unchanged lines hidden (view full) --- 79 cur->bc_rec.a.ar_blockcount = len; 80 return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); 81} 82 83/* 84 * Lookup the first record less than or equal to [bno, len] 85 * in the btree given by cur. 86 */ |
87int /* error */ | 87static int /* error */ |
88xfs_alloc_lookup_le( 89 struct xfs_btree_cur *cur, /* btree cursor */ 90 xfs_agblock_t bno, /* starting block of extent */ 91 xfs_extlen_t len, /* length of extent */ 92 int *stat) /* success/failure */ 93{ 94 cur->bc_rec.a.ar_startblock = bno; 95 cur->bc_rec.a.ar_blockcount = len; --- 2617 unchanged lines hidden --- | 88xfs_alloc_lookup_le( 89 struct xfs_btree_cur *cur, /* btree cursor */ 90 xfs_agblock_t bno, /* starting block of extent */ 91 xfs_extlen_t len, /* length of extent */ 92 int *stat) /* success/failure */ 93{ 94 cur->bc_rec.a.ar_startblock = bno; 95 cur->bc_rec.a.ar_blockcount = len; --- 2617 unchanged lines hidden --- |