1*f14fb602SLionel Sambuc /* $NetBSD: getbsize.c,v 1.17 2012/06/25 22:32:43 abs Exp $ */
22fe8fb19SBen Gras
32fe8fb19SBen Gras /*-
42fe8fb19SBen Gras * Copyright (c) 1991, 1993
52fe8fb19SBen Gras * The Regents of the University of California. All rights reserved.
62fe8fb19SBen Gras *
72fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
82fe8fb19SBen Gras * modification, are permitted provided that the following conditions
92fe8fb19SBen Gras * are met:
102fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
112fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
122fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
132fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
142fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
152fe8fb19SBen Gras * 3. Neither the name of the University nor the names of its contributors
162fe8fb19SBen Gras * may be used to endorse or promote products derived from this software
172fe8fb19SBen Gras * without specific prior written permission.
182fe8fb19SBen Gras *
192fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
202fe8fb19SBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
212fe8fb19SBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
222fe8fb19SBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
232fe8fb19SBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
242fe8fb19SBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
252fe8fb19SBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
262fe8fb19SBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
272fe8fb19SBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
282fe8fb19SBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
292fe8fb19SBen Gras * SUCH DAMAGE.
302fe8fb19SBen Gras */
312fe8fb19SBen Gras
322fe8fb19SBen Gras #include <sys/cdefs.h>
332fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
342fe8fb19SBen Gras #if 0
352fe8fb19SBen Gras static char sccsid[] = "@(#)getbsize.c 8.1 (Berkeley) 6/4/93";
362fe8fb19SBen Gras #else
37*f14fb602SLionel Sambuc __RCSID("$NetBSD: getbsize.c,v 1.17 2012/06/25 22:32:43 abs Exp $");
382fe8fb19SBen Gras #endif
392fe8fb19SBen Gras #endif /* not lint */
402fe8fb19SBen Gras
412fe8fb19SBen Gras #include "namespace.h"
422fe8fb19SBen Gras
432fe8fb19SBen Gras #include <assert.h>
442fe8fb19SBen Gras #include <err.h>
452fe8fb19SBen Gras #include <stdio.h>
462fe8fb19SBen Gras #include <stdlib.h>
472fe8fb19SBen Gras #include <string.h>
482fe8fb19SBen Gras
492fe8fb19SBen Gras #ifdef __weak_alias
__weak_alias(getbsize,_getbsize)502fe8fb19SBen Gras __weak_alias(getbsize,_getbsize)
512fe8fb19SBen Gras #endif
522fe8fb19SBen Gras
532fe8fb19SBen Gras char *
54*f14fb602SLionel Sambuc getbsize(int *headerlenp, long *blocksizep)
552fe8fb19SBen Gras {
562fe8fb19SBen Gras static char header[20];
572fe8fb19SBen Gras long n, max, mul, blocksize;
582fe8fb19SBen Gras char *ep, *p;
592fe8fb19SBen Gras const char *form;
602fe8fb19SBen Gras
612fe8fb19SBen Gras #define KB (1024L)
622fe8fb19SBen Gras #define MB (1024L * 1024L)
632fe8fb19SBen Gras #define GB (1024L * 1024L * 1024L)
642fe8fb19SBen Gras #define MAXB GB /* No tera, peta, nor exa. */
652fe8fb19SBen Gras form = "";
662fe8fb19SBen Gras if ((p = getenv("BLOCKSIZE")) != NULL && *p != '\0') {
672fe8fb19SBen Gras if ((n = strtol(p, &ep, 10)) < 0)
682fe8fb19SBen Gras goto underflow;
692fe8fb19SBen Gras if (n == 0)
702fe8fb19SBen Gras n = 1;
712fe8fb19SBen Gras if (*ep && ep[1])
722fe8fb19SBen Gras goto fmterr;
732fe8fb19SBen Gras switch (*ep) {
742fe8fb19SBen Gras case 'G': case 'g':
752fe8fb19SBen Gras form = "G";
762fe8fb19SBen Gras max = MAXB / GB;
772fe8fb19SBen Gras mul = GB;
782fe8fb19SBen Gras break;
792fe8fb19SBen Gras case 'K': case 'k':
802fe8fb19SBen Gras form = "K";
812fe8fb19SBen Gras max = MAXB / KB;
822fe8fb19SBen Gras mul = KB;
832fe8fb19SBen Gras break;
842fe8fb19SBen Gras case 'M': case 'm':
852fe8fb19SBen Gras form = "M";
862fe8fb19SBen Gras max = MAXB / MB;
872fe8fb19SBen Gras mul = MB;
882fe8fb19SBen Gras break;
892fe8fb19SBen Gras case '\0':
902fe8fb19SBen Gras max = MAXB;
912fe8fb19SBen Gras mul = 1;
922fe8fb19SBen Gras break;
932fe8fb19SBen Gras default:
942fe8fb19SBen Gras fmterr: warnx("%s: unknown blocksize", p);
952fe8fb19SBen Gras n = 512;
962fe8fb19SBen Gras mul = 1;
972fe8fb19SBen Gras max = 0;
982fe8fb19SBen Gras break;
992fe8fb19SBen Gras }
1002fe8fb19SBen Gras if (n > max) {
1012fe8fb19SBen Gras warnx("maximum blocksize is %ldG", MAXB / GB);
1022fe8fb19SBen Gras n = max;
1032fe8fb19SBen Gras }
1042fe8fb19SBen Gras if ((blocksize = n * mul) < 512) {
1052fe8fb19SBen Gras underflow: warnx("%s: minimum blocksize is 512", p);
1062fe8fb19SBen Gras form = "";
1072fe8fb19SBen Gras blocksize = n = 512;
1082fe8fb19SBen Gras }
1092fe8fb19SBen Gras } else
1102fe8fb19SBen Gras blocksize = n = 512;
1112fe8fb19SBen Gras
1122fe8fb19SBen Gras if (headerlenp)
1132fe8fb19SBen Gras *headerlenp =
1142fe8fb19SBen Gras snprintf(header, sizeof(header), "%ld%s-blocks", n, form);
1152fe8fb19SBen Gras if (blocksizep)
1162fe8fb19SBen Gras *blocksizep = blocksize;
1172fe8fb19SBen Gras return (header);
1182fe8fb19SBen Gras }
119