Mercurial > hg > xemacs-beta
view netinstall/diskfull.cc @ 831:5d09ddada9ae
[xemacs-hg @ 2002-05-09 07:15:20 by ben]
fix two bugs noted by Steve
doprnt.c: Use make_int() not make_char() when error about bad charval,
or abort will occur.
extents.c: Loop over children, not ourself -- avoid infinite loop.
lisp-disunion.h, lisp-union.h: Rename make_char() to make_char_1 for error-checking purposes.
lread.c: Syntax error if escape is outside of ISO-8859-1 range.
Remove hopelessly broken (and unworkable) FSF_KEYS code.
mule-coding.c, search.c: Spacing changes.
text.h: New make_char() -- verify that the char value is legal.
author | ben |
---|---|
date | Thu, 09 May 2002 07:16:38 +0000 |
parents | 3078fd1074e8 |
children |
line wrap: on
line source
/* * Copyright (c) 2000, Red Hat, Inc. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * A copy of the GNU General Public License can be found at * http://www.gnu.org/ * * Written by DJ Delorie <dj@cygnus.com> * */ /* The purpose of this file is to hide the mess needed just to figure out how full a given disk is. There is an old API that can't handle disks bigger than 2G, and a new API that isn't always available. */ #include "win32.h" #include "diskfull.h" typedef BOOL (WINAPI * GDFS)(LPCTSTR, PULARGE_INTEGER, PULARGE_INTEGER, PULARGE_INTEGER); int diskfull (char *path) { GDFS gdfs = 0; HINSTANCE k = LoadLibrary ("KERNEL32.DLL"); if (k) { gdfs = (GDFS) GetProcAddress (k, "GetDiskFreeSpaceExA"); if (gdfs) { ULARGE_INTEGER avail, total, free; if (gdfs (path, &avail, &total, &free)) { int perc = avail.QuadPart * 100 / total.QuadPart; return 100-perc; } } } char root[4]; if (path[1] != ':') return 0; root[0] = path[0]; root[1] = ':'; root[2] = '\\'; root[3] = 0; DWORD junk, free_clusters, total_clusters; if (GetDiskFreeSpace (root, &junk, &junk, &free_clusters, &total_clusters)) { int perc = free_clusters * 100 / total_clusters; return 100-perc; } return 0; }