11573Srgrimes/*- 21573Srgrimes * Copyright (c) 1991, 1993 31573Srgrimes * The Regents of the University of California. All rights reserved. 41573Srgrimes * 51573Srgrimes * Redistribution and use in source and binary forms, with or without 61573Srgrimes * modification, are permitted provided that the following conditions 71573Srgrimes * are met: 81573Srgrimes * 1. Redistributions of source code must retain the above copyright 91573Srgrimes * notice, this list of conditions and the following disclaimer. 101573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 111573Srgrimes * notice, this list of conditions and the following disclaimer in the 121573Srgrimes * documentation and/or other materials provided with the distribution. 131573Srgrimes * 4. Neither the name of the University nor the names of its contributors 141573Srgrimes * may be used to endorse or promote products derived from this software 151573Srgrimes * without specific prior written permission. 161573Srgrimes * 171573Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 181573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 191573Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 201573Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 211573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 221573Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 231573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 241573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 251573Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 261573Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 271573Srgrimes * SUCH DAMAGE. 281573Srgrimes */ 291573Srgrimes 3092986Sobrien#if defined(LIBC_SCCS) && !defined(lint) 311573Srgrimesstatic char sccsid[] = "@(#)getbsize.c 8.1 (Berkeley) 6/4/93"; 3292986Sobrien#endif /* LIBC_SCCS and not lint */ 3392986Sobrien#include <sys/cdefs.h> 3492986Sobrien__FBSDID("$FreeBSD: releng/10.3/lib/libc/gen/getbsize.c 181280 2008-08-04 06:53:13Z cperciva $"); 351573Srgrimes 361573Srgrimes#include <err.h> 371573Srgrimes#include <stdio.h> 381573Srgrimes#include <stdlib.h> 391573Srgrimes#include <string.h> 401573Srgrimes 411573Srgrimeschar * 421573Srgrimesgetbsize(headerlenp, blocksizep) 43108445Sobrien int *headerlenp; 441573Srgrimes long *blocksizep; 451573Srgrimes{ 461573Srgrimes static char header[20]; 471573Srgrimes long n, max, mul, blocksize; 48105797Smarkm char *ep, *p; 49105797Smarkm const char *form; 501573Srgrimes 511573Srgrimes#define KB (1024L) 521573Srgrimes#define MB (1024L * 1024L) 531573Srgrimes#define GB (1024L * 1024L * 1024L) 541573Srgrimes#define MAXB GB /* No tera, peta, nor exa. */ 551573Srgrimes form = ""; 561573Srgrimes if ((p = getenv("BLOCKSIZE")) != NULL && *p != '\0') { 571573Srgrimes if ((n = strtol(p, &ep, 10)) < 0) 581573Srgrimes goto underflow; 591573Srgrimes if (n == 0) 601573Srgrimes n = 1; 611573Srgrimes if (*ep && ep[1]) 621573Srgrimes goto fmterr; 631573Srgrimes switch (*ep) { 641573Srgrimes case 'G': case 'g': 651573Srgrimes form = "G"; 661573Srgrimes max = MAXB / GB; 671573Srgrimes mul = GB; 681573Srgrimes break; 691573Srgrimes case 'K': case 'k': 701573Srgrimes form = "K"; 711573Srgrimes max = MAXB / KB; 721573Srgrimes mul = KB; 731573Srgrimes break; 741573Srgrimes case 'M': case 'm': 751573Srgrimes form = "M"; 761573Srgrimes max = MAXB / MB; 771573Srgrimes mul = MB; 781573Srgrimes break; 791573Srgrimes case '\0': 801573Srgrimes max = MAXB; 811573Srgrimes mul = 1; 821573Srgrimes break; 831573Srgrimes default: 841573Srgrimesfmterr: warnx("%s: unknown blocksize", p); 851573Srgrimes n = 512; 86181280Scperciva max = MAXB; 871573Srgrimes mul = 1; 881573Srgrimes break; 891573Srgrimes } 901573Srgrimes if (n > max) { 9137301Sbde warnx("maximum blocksize is %ldG", MAXB / GB); 921573Srgrimes n = max; 931573Srgrimes } 941573Srgrimes if ((blocksize = n * mul) < 512) { 951573Srgrimesunderflow: warnx("minimum blocksize is 512"); 961573Srgrimes form = ""; 971573Srgrimes blocksize = n = 512; 981573Srgrimes } 991573Srgrimes } else 1001573Srgrimes blocksize = n = 512; 1011573Srgrimes 10238020Sbde (void)snprintf(header, sizeof(header), "%ld%s-blocks", n, form); 1031573Srgrimes *headerlenp = strlen(header); 1041573Srgrimes *blocksizep = blocksize; 1051573Srgrimes return (header); 1061573Srgrimes} 107