1*4887Schin /*********************************************************************** 2*4887Schin * * 3*4887Schin * This software is part of the ast package * 4*4887Schin * Copyright (c) 1985-2007 AT&T Knowledge Ventures * 5*4887Schin * and is licensed under the * 6*4887Schin * Common Public License, Version 1.0 * 7*4887Schin * by AT&T Knowledge Ventures * 8*4887Schin * * 9*4887Schin * A copy of the License is available at * 10*4887Schin * http://www.opensource.org/licenses/cpl1.0.txt * 11*4887Schin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12*4887Schin * * 13*4887Schin * Information and Software Systems Research * 14*4887Schin * AT&T Research * 15*4887Schin * Florham Park NJ * 16*4887Schin * * 17*4887Schin * Glenn Fowler <gsf@research.att.com> * 18*4887Schin * David Korn <dgk@research.att.com> * 19*4887Schin * Phong Vo <kpv@research.att.com> * 20*4887Schin * * 21*4887Schin ***********************************************************************/ 22*4887Schin #pragma prototyped 23*4887Schin /* 24*4887Schin * aux function for <ls.h> iblocks() macro 25*4887Schin * 26*4887Schin * return number of blocks, including indirect block count 27*4887Schin * given stat info 28*4887Schin * 29*4887Schin * mail gsf@research.att.com when you figure out the stat.st_blocks units 30*4887Schin * until then we assume LS_BLOCKSIZE (512) 31*4887Schin */ 32*4887Schin 33*4887Schin #include <ast.h> 34*4887Schin #if _AIX /* XXX */ 35*4887Schin #undef major 36*4887Schin #undef minor 37*4887Schin #undef makedev 38*4887Schin #endif 39*4887Schin #include <ast_param.h> 40*4887Schin #include <ls.h> 41*4887Schin 42*4887Schin #if !_mem_st_blocks_stat 43*4887Schin 44*4887Schin #ifndef B_DIRECT 45*4887Schin #define B_DIRECT 10 46*4887Schin #endif 47*4887Schin 48*4887Schin #ifdef BITFS 49*4887Schin 50*4887Schin #define B_SIZE BSIZE(st->st_dev) 51*4887Schin #define B_INDIRECT NINDIR(st->st_dev) 52*4887Schin 53*4887Schin #else 54*4887Schin 55*4887Schin #ifdef BSIZE 56*4887Schin #define B_SIZE BSIZE 57*4887Schin #else 58*4887Schin #define B_SIZE 1024 59*4887Schin #endif 60*4887Schin 61*4887Schin #ifdef NINDIR 62*4887Schin #define B_INDIRECT NINDIR 63*4887Schin #else 64*4887Schin #define B_INDIRECT 128 65*4887Schin #endif 66*4887Schin 67*4887Schin #endif 68*4887Schin 69*4887Schin #endif 70*4887Schin 71*4887Schin off_t 72*4887Schin _iblocks(register struct stat* st) 73*4887Schin { 74*4887Schin #if _mem_st_blocks_stat 75*4887Schin 76*4887Schin return (st->st_blocks <= 0 || st->st_size <= 0) ? 0 : st->st_blocks; 77*4887Schin 78*4887Schin #else 79*4887Schin unsigned long b; 80*4887Schin unsigned long t; 81*4887Schin 82*4887Schin t = b = (st->st_size + B_SIZE - 1) / B_SIZE; 83*4887Schin if ((b -= B_DIRECT) > 0) 84*4887Schin { 85*4887Schin t += (b - 1) / B_INDIRECT + 1; 86*4887Schin if ((b -= B_INDIRECT) > 0) 87*4887Schin { 88*4887Schin t += (b - 1) / (B_INDIRECT * B_INDIRECT) + 1; 89*4887Schin if (b > B_INDIRECT * B_INDIRECT) 90*4887Schin t++; 91*4887Schin } 92*4887Schin } 93*4887Schin return t * B_SIZE / LS_BLOCKSIZE; 94*4887Schin #endif 95*4887Schin } 96