Mercurial > hg > xemacs-beta
annotate netinstall/diskfull.cc @ 5066:545ec923b4eb
add documentation on keywords to cl*.el
-------------------- ChangeLog entries follow: --------------------
lisp/ChangeLog addition:
2010-02-22 Ben Wing <ben@xemacs.org>
* cl-seq.el:
* cl-seq.el (reduce):
* cl-seq.el (fill):
* cl-seq.el (replace):
* cl-seq.el (remove*):
* cl-seq.el (remove-if):
* cl-seq.el (remove-if-not):
* cl-seq.el (delete*):
* cl-seq.el (delete-if):
* cl-seq.el (delete-if-not):
* cl-seq.el (remove-duplicates):
* cl-seq.el (delete-duplicates):
* cl-seq.el (substitute):
* cl-seq.el (substitute-if):
* cl-seq.el (substitute-if-not):
* cl-seq.el (nsubstitute):
* cl-seq.el (nsubstitute-if):
* cl-seq.el (nsubstitute-if-not):
* cl-seq.el (find):
* cl-seq.el (find-if):
* cl-seq.el (find-if-not):
* cl-seq.el (position):
* cl-seq.el (position-if):
* cl-seq.el (position-if-not):
* cl-seq.el (count):
* cl-seq.el (count-if):
* cl-seq.el (count-if-not):
* cl-seq.el (mismatch):
* cl-seq.el (search):
* cl-seq.el (sort*):
* cl-seq.el (stable-sort):
* cl-seq.el (merge):
* cl-seq.el (member*):
* cl-seq.el (member-if):
* cl-seq.el (member-if-not):
* cl-seq.el (assoc*):
* cl-seq.el (assoc-if):
* cl-seq.el (assoc-if-not):
* cl-seq.el (rassoc*):
* cl-seq.el (rassoc-if):
* cl-seq.el (rassoc-if-not):
* cl-seq.el (union):
* cl-seq.el (nunion):
* cl-seq.el (intersection):
* cl-seq.el (nintersection):
* cl-seq.el (set-difference):
* cl-seq.el (nset-difference):
* cl-seq.el (set-exclusive-or):
* cl-seq.el (nset-exclusive-or):
* cl-seq.el (subsetp):
* cl-seq.el (subst-if):
* cl-seq.el (subst-if-not):
* cl-seq.el (nsubst):
* cl-seq.el (nsubst-if):
* cl-seq.el (nsubst-if-not):
* cl-seq.el (sublis):
* cl-seq.el (nsublis):
* cl-seq.el (tree-equal):
* cl-seq.el (cl-tree-equal-rec):
* cl.el:
* cl.el (pushnew):
* cl.el (adjoin):
* cl.el (subst):
Document the keywords to the various sequence/list functions.
author | Ben Wing <ben@xemacs.org> |
---|---|
date | Mon, 22 Feb 2010 21:17:47 -0600 |
parents | 3078fd1074e8 |
children |
rev | line source |
---|---|
448 | 1 /* |
2 * Copyright (c) 2000, Red Hat, Inc. | |
3 * | |
4 * This program is free software; you can redistribute it and/or modify | |
5 * it under the terms of the GNU General Public License as published by | |
6 * the Free Software Foundation; either version 2 of the License, or | |
7 * (at your option) any later version. | |
8 * | |
9 * A copy of the GNU General Public License can be found at | |
10 * http://www.gnu.org/ | |
11 * | |
12 * Written by DJ Delorie <dj@cygnus.com> | |
13 * | |
14 */ | |
15 | |
16 /* The purpose of this file is to hide the mess needed just to figure | |
17 out how full a given disk is. There is an old API that can't | |
18 handle disks bigger than 2G, and a new API that isn't always | |
19 available. */ | |
20 | |
21 #include "win32.h" | |
22 #include "diskfull.h" | |
23 | |
24 typedef BOOL (WINAPI * GDFS)(LPCTSTR, PULARGE_INTEGER, PULARGE_INTEGER, | |
25 PULARGE_INTEGER); | |
26 | |
27 int | |
28 diskfull (char *path) | |
29 { | |
30 GDFS gdfs = 0; | |
31 | |
32 HINSTANCE k = LoadLibrary ("KERNEL32.DLL"); | |
33 if (k) | |
34 { | |
35 gdfs = (GDFS) GetProcAddress (k, "GetDiskFreeSpaceExA"); | |
36 | |
37 if (gdfs) | |
38 { | |
39 ULARGE_INTEGER avail, total, free; | |
40 if (gdfs (path, &avail, &total, &free)) | |
41 { | |
42 int perc = avail.QuadPart * 100 / total.QuadPart; | |
43 return 100-perc; | |
44 } | |
45 } | |
46 } | |
47 | |
48 char root[4]; | |
49 if (path[1] != ':') | |
50 return 0; | |
51 | |
52 root[0] = path[0]; | |
53 root[1] = ':'; | |
54 root[2] = '\\'; | |
55 root[3] = 0; | |
56 | |
57 DWORD junk, free_clusters, total_clusters; | |
58 | |
59 if (GetDiskFreeSpace (root, &junk, &junk, &free_clusters, &total_clusters)) | |
60 { | |
61 int perc = free_clusters * 100 / total_clusters; | |
62 return 100-perc; | |
63 } | |
64 | |
65 return 0; | |
66 } |