[xemacs-hg @ 2003-02-14 12:05:06 by ben] speedups to build process autoload.el: Factor out common code in generate-{c-,}file-autoloads-1 into new function generate-autoload-ish-1. \(I was originally going to use this for custom as well but ended up thinking better of it.) cus-dep.el: Cache the old computed values in custom-load.el and reuse them as necessary, to speed up running cus-dep (which would take 25-30 seconds to do all files in lisp/*, lisp/*/* on my Pentium III 700). Use `message' not `princ' to get correct newline behavior. Output messages showing each file we do actually process. update-elc-2.el: Rewrite algorithm to be much faster -- cache calls to directory-files and don't make needless calls to file-exists-p, file-directory-p because they're way way slow. Autoload early and only when update-elc has told us to. update-elc.el: If no files need byte compilation, signal to update-elc-2 to do any necessary autoload updating (using the file REBUILD_AUTOLOADS) rather than doing it ourselves, which would be way slow. Ignore updates to custom-load.el and auto-autoloads.el when checking to see whether autoloads need updating. Optimize out many unnecessary calls to file-exists-p to speed it up somewhat. (#### The remaining time is 50% or more in locate-file; this is presumably because, even though it has a cache, it's still statting each file to determine it's actually there. By calling directory-files ourselves, building a tree, and then looking in that tree, we could drastically shorten the time needed to do the locate operation.)

/*
 * 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;
}