Mercurial > hg > xemacs-beta
annotate netinstall/diskfull.cc @ 5182:2e528066e2fc
Move #'sort*, #'fill, #'merge to C from cl-seq.el.
lisp/ChangeLog addition:
2010-04-01 Aidan Kehoe <kehoea@parhasard.net>
* cl-seq.el (fill, sort*, merge): Move these functions to fns.c.
(stable-sort): Make this docstring reflect the argument names used
in the #'sort* docstring.
* cl-macs.el (stable-sort): Make #'stable-sort exactly equivalent
to #'sort* in compiled code.
* bytecomp.el (byte-compile-maybe-add-*):
New macro, for functions like #'sort and #'mapcar that, to be
strictly compatible, should only take two args, but in our
implementation can take more, because they're aliases of #'sort*
and #'mapcar*.
(byte-compile-mapcar, byte-compile-sort, byte-compile-fillarray):
Use this new macro.
(map-into): Add a byte-compile method for #'map-into in passing.
* apropos.el (apropos-print): Use #'sort* with a :key argument,
now it's in C.
* compat.el (extent-at): Ditto.
* register.el (list-registers): Ditto.
* package-ui.el (pui-list-packages): Ditto.
* help.el (sorted-key-descriptions): Ditto.
src/ChangeLog addition:
2010-03-31 Aidan Kehoe <kehoea@parhasard.net>
* fns.c (STRING_DATA_TO_OBJECT_ARRAY)
(BIT_VECTOR_TO_OBJECT_ARRAY, c_merge_predicate_key)
(c_merge_predicate_nokey, list_merge, array_merge)
(list_array_merge_into_list, list_list_merge_into_array)
(list_array_merge_into_array, CHECK_KEY_ARGUMENT, Fmerge)
(list_sort, array_sort, FsortX):
Move #'sort*, #'fill, #'merge from cl-seq.el to C, extending the
implementations of Fsort, Ffillarray, and merge() to do so.
* keymap.c (keymap_submaps, map_keymap_sort_predicate)
(describe_map_sort_predicate):
Change the calling semantics of the C sort predicates to return a
non-nil Lisp object if the first argument is less than the second,
rather than C integers.
* fontcolor-msw.c (sort_font_list_function):
* fileio.c (build_annotations):
* dired.c (Fdirectory_files):
* abbrev.c (Finsert_abbrev_table_description):
Call list_sort instead of Fsort, list_merge instead of merge() in
these functions.
man/ChangeLog addition:
2010-04-01 Aidan Kehoe <kehoea@parhasard.net>
* lispref/lists.texi (Rearrangement):
Update the documentation of #'sort here, now that it accepts any
type of sequence and the KEY keyword argument. (Though this is
probably now the wrong place for this function, given that.)
author | Aidan Kehoe <kehoea@parhasard.net> |
---|---|
date | Thu, 01 Apr 2010 20:22:50 +0100 |
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 } |