/* $NetBSD: swaplist.c,v 1.8 1998/10/08 10:00:31 mrg Exp $ */ /* * Copyright (c) 1997 Matthew R. Green * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include #include #include #include #include #include #include #include #include #include #define dbtoqb(b) dbtob((int64_t)(b)) /* * NOTE: This file is separate from swapctl.c so that pstat can grab it. */ #include "swapctl.h" void list_swap(pri, kflag, pflag, tflag, dolong) int pri; int kflag; int pflag; int tflag; int dolong; { struct swapent *sep, *fsep; long blocksize; char *header; size_t l; int hlen, totalsize, size, totalinuse, inuse, ncounted, pathmax; int rnswap, nswap = swapctl(SWAP_NSWAP, 0, 0), i; if (nswap < 1) { puts("no swap devices configured"); exit(0); } fsep = sep = (struct swapent *)malloc(nswap * sizeof(*sep)); if (sep == NULL) err(1, "malloc"); rnswap = swapctl(SWAP_STATS, (void *)sep, nswap); if (rnswap < 0) err(1, "SWAP_STATS"); if (nswap != rnswap) warnx("SWAP_STATS different to SWAP_NSWAP (%d != %d)", rnswap, nswap); pathmax = 11; if (dolong && tflag == 0) { if (kflag) { header = "1K-blocks"; blocksize = 1024; hlen = strlen(header); } else header = getbsize(&hlen, &blocksize); for (i = rnswap; i-- > 0; sep++) if (pathmax < (l = strlen(sep->se_path))) pathmax = l; sep = fsep; (void)printf("%-*s %*s %8s %8s %8s %s\n", pathmax, "Device", hlen, header, "Used", "Avail", "Capacity", "Priority"); } totalsize = totalinuse = ncounted = 0; for (; rnswap-- > 0; sep++) { if (pflag && sep->se_priority != pri) continue; ncounted++; size = sep->se_nblks; inuse = sep->se_inuse; totalsize += size; totalinuse += inuse; if (dolong && tflag == 0) { (void)printf("%-*s %*ld ", pathmax, sep->se_path, hlen, (long)(dbtoqb(size) / blocksize)); (void)printf("%8ld %8ld %5.0f%% %d\n", (long)(dbtoqb(inuse) / blocksize), (long)(dbtoqb(size - inuse) / blocksize), (double)inuse / (double)size * 100.0, sep->se_priority); } } if (tflag) (void)printf("%dM/%dM swap space\n", (int)(dbtoqb(totalinuse) / (1024 * 1024)), (int)(dbtoqb(totalsize) / (1024 * 1024))); else if (dolong == 0) printf("total: %ldk bytes allocated = %ldk used, " "%ldk available\n", (long)(dbtoqb(totalsize) / 1024), (long)(dbtoqb(totalinuse) / 1024), (long)(dbtoqb(totalsize - totalinuse) / 1024)); else if (ncounted > 1) (void)printf("%-*s %*ld %8ld %8ld %5.0f%%\n", pathmax, "Total", hlen, (long)(dbtoqb(totalsize) / blocksize), (long)(dbtoqb(totalinuse) / blocksize), (long)(dbtoqb(totalsize - totalinuse) / blocksize), (double)(totalinuse) / (double)totalsize * 100.0); if (fsep) (void)free(fsep); }