This commit was manufactured by cvs2svn to create tag 'newlib-csl-newlib-csl-sourcerygxx-3_4_4-25

sourcerygxx-3_4_4-25'.

Sprout from master 2006-08-29 21:00:59 UTC Jeff Johnston <jjohnstn@redhat.com> ''
Cherrypick from cygnus 1999-05-03 07:29:06 UTC Richard Henderson <rth@redhat.com> '19990502 sourceware import':
    README
    config/mh-armpic
    config/mh-elfalphapic
    config/mh-m68kpic
    config/mh-papic
    config/mh-ppcpic
    config/mh-x86pic
    config/mt-d30v
    config/mt-netware
    config/mt-ospace
    etc/add-log.el
    etc/add-log.vi
    etc/configbuild.ein
    etc/configbuild.fig
    etc/configbuild.jin
    etc/configbuild.tin
    etc/configdev.ein
    etc/configdev.fig
    etc/configdev.jin
    etc/configdev.tin
    makefile.vms
Delete:
    compile
    djunpack.bat
    include/COPYING
    include/ChangeLog
    include/ChangeLog-9103
    include/MAINTAINERS
    include/alloca-conf.h
    include/ansidecl.h
    include/aout/ChangeLog
    include/aout/adobe.h
    include/aout/aout64.h
    include/aout/ar.h
    include/aout/dynix3.h
    include/aout/encap.h
    include/aout/host.h
    include/aout/hp.h
    include/aout/hp300hpux.h
    include/aout/hppa.h
    include/aout/ranlib.h
    include/aout/reloc.h
    include/aout/stab.def
    include/aout/stab_gnu.h
    include/aout/sun4.h
    include/bfdlink.h
    include/bin-bugs.h
    include/bout.h
    include/coff/ChangeLog
    include/coff/ChangeLog-9103
    include/coff/alpha.h
    include/coff/apollo.h
    include/coff/arm.h
    include/coff/aux-coff.h
    include/coff/ecoff.h
    include/coff/external.h
    include/coff/go32exe.h
    include/coff/h8300.h
    include/coff/h8500.h
    include/coff/i386.h
    include/coff/i860.h
    include/coff/i960.h
    include/coff/ia64.h
    include/coff/internal.h
    include/coff/m68k.h
    include/coff/m88k.h
    include/coff/maxq.h
    include/coff/mcore.h
    include/coff/mips.h
    include/coff/mipspe.h
    include/coff/or32.h
    include/coff/pe.h
    include/coff/powerpc.h
    include/coff/rs6000.h
    include/coff/rs6k64.h
    include/coff/sh.h
    include/coff/sparc.h
    include/coff/sym.h
    include/coff/symconst.h
    include/coff/ti.h
    include/coff/tic30.h
    include/coff/tic4x.h
    include/coff/tic54x.h
    include/coff/tic80.h
    include/coff/w65.h
    include/coff/we32k.h
    include/coff/xcoff.h
    include/coff/z80.h
    include/coff/z8k.h
    include/demangle.h
    include/dis-asm.h
    include/dyn-string.h
    include/elf/ChangeLog
    include/elf/ChangeLog-9103
    include/elf/alpha.h
    include/elf/arc.h
    include/elf/arm.h
    include/elf/avr.h
    include/elf/bfin.h
    include/elf/common.h
    include/elf/cr16c.h
    include/elf/cris.h
    include/elf/crx.h
    include/elf/d10v.h
    include/elf/d30v.h
    include/elf/dlx.h
    include/elf/dwarf.h
    include/elf/dwarf2.h
    include/elf/external.h
    include/elf/fr30.h
    include/elf/frv.h
    include/elf/h8.h
    include/elf/hppa.h
    include/elf/i370.h
    include/elf/i386.h
    include/elf/i860.h
    include/elf/i960.h
    include/elf/ia64.h
    include/elf/internal.h
    include/elf/ip2k.h
    include/elf/iq2000.h
    include/elf/m32c.h
    include/elf/m32r.h
    include/elf/m68hc11.h
    include/elf/m68k.h
    include/elf/mcore.h
    include/elf/mips.h
    include/elf/mmix.h
    include/elf/mn10200.h
    include/elf/mn10300.h
    include/elf/msp430.h
    include/elf/mt.h
    include/elf/openrisc.h
    include/elf/or32.h
    include/elf/pj.h
    include/elf/ppc.h
    include/elf/ppc64.h
    include/elf/reloc-macros.h
    include/elf/s390.h
    include/elf/sh.h
    include/elf/sparc.h
    include/elf/v850.h
    include/elf/vax.h
    include/elf/x86-64.h
    include/elf/xc16x.h
    include/elf/xstormy16.h
    include/elf/xtensa.h
    include/fibheap.h
    include/filenames.h
    include/floatformat.h
    include/fnmatch.h
    include/fopen-bin.h
    include/fopen-same.h
    include/fopen-vms.h
    include/gdb/ChangeLog
    include/gdb/callback.h
    include/gdb/fileio.h
    include/gdb/remote-sim.h
    include/gdb/signals.h
    include/gdb/sim-arm.h
    include/gdb/sim-d10v.h
    include/gdb/sim-frv.h
    include/gdb/sim-h8300.h
    include/gdb/sim-m32c.h
    include/gdb/sim-ppc.h
    include/gdb/sim-sh.h
    include/gdbm.h
    include/getopt.h
    include/hashtab.h
    include/hp-symtab.h
    include/ieee.h
    include/libiberty.h
    include/md5.h
    include/nlm/ChangeLog
    include/nlm/alpha-ext.h
    include/nlm/common.h
    include/nlm/external.h
    include/nlm/i386-ext.h
    include/nlm/internal.h
    include/nlm/ppc-ext.h
    include/nlm/sparc32-ext.h
    include/oasys.h
    include/objalloc.h
    include/obstack.h
    include/opcode/ChangeLog
    include/opcode/ChangeLog-9103
    include/opcode/alpha.h
    include/opcode/arc.h
    include/opcode/arm.h
    include/opcode/avr.h
    include/opcode/bfin.h
    include/opcode/cgen-bitset.h
    include/opcode/cgen.h
    include/opcode/convex.h
    include/opcode/cris.h
    include/opcode/crx.h
    include/opcode/d10v.h
    include/opcode/d30v.h
    include/opcode/dlx.h
    include/opcode/h8300.h
    include/opcode/hppa.h
    include/opcode/i370.h
    include/opcode/i386.h
    include/opcode/i860.h
    include/opcode/i960.h
    include/opcode/ia64.h
    include/opcode/m68hc11.h
    include/opcode/m68k.h
    include/opcode/m88k.h
    include/opcode/maxq.h
    include/opcode/mips.h
    include/opcode/mmix.h
    include/opcode/mn10200.h
    include/opcode/mn10300.h
    include/opcode/msp430.h
    include/opcode/np1.h
    include/opcode/ns32k.h
    include/opcode/or32.h
    include/opcode/pdp11.h
    include/opcode/pj.h
    include/opcode/pn.h
    include/opcode/ppc.h
    include/opcode/pyr.h
    include/opcode/s390.h
    include/opcode/sparc.h
    include/opcode/tahoe.h
    include/opcode/tic30.h
    include/opcode/tic4x.h
    include/opcode/tic54x.h
    include/opcode/tic80.h
    include/opcode/v850.h
    include/opcode/vax.h
    include/os9k.h
    include/partition.h
    include/progress.h
    include/safe-ctype.h
    include/sort.h
    include/splay-tree.h
    include/symcat.h
    include/ternary.h
    include/xregex.h
    include/xregex2.h
    include/xtensa-config.h
    include/xtensa-isa-internal.h
    include/xtensa-isa.h
    winsup/COPYING
    winsup/CYGWIN_LICENSE
    winsup/ChangeLog
    winsup/Makefile.common
    winsup/Makefile.in
    winsup/README
    winsup/acinclude.m4
    winsup/aclocal.m4
    winsup/configure
    winsup/configure.in
    winsup/cygserver/ChangeLog
    winsup/cygserver/Makefile.in
    winsup/cygserver/README
    winsup/cygserver/aclocal.m4
    winsup/cygserver/bsd_helper.cc
    winsup/cygserver/bsd_helper.h
    winsup/cygserver/bsd_log.cc
    winsup/cygserver/bsd_log.h
    winsup/cygserver/bsd_mutex.cc
    winsup/cygserver/bsd_mutex.h
    winsup/cygserver/client.cc
    winsup/cygserver/configure
    winsup/cygserver/configure.in
    winsup/cygserver/cygserver-config
    winsup/cygserver/cygserver.cc
    winsup/cygserver/cygserver.conf
    winsup/cygserver/msg.cc
    winsup/cygserver/process.cc
    winsup/cygserver/process.h
    winsup/cygserver/sem.cc
    winsup/cygserver/shm.cc
    winsup/cygserver/sysv_msg.cc
    winsup/cygserver/sysv_sem.cc
    winsup/cygserver/sysv_shm.cc
    winsup/cygserver/threaded_queue.cc
    winsup/cygserver/threaded_queue.h
    winsup/cygserver/transport.cc
    winsup/cygserver/transport.h
    winsup/cygserver/transport_pipes.cc
    winsup/cygserver/transport_pipes.h
    winsup/cygserver/transport_sockets.cc
    winsup/cygserver/transport_sockets.h
    winsup/cygserver/wincap.cc
    winsup/cygserver/wincap.h
    winsup/cygserver/woutsup.h
    winsup/cygwin/CYGWIN_LICENSE
    winsup/cygwin/ChangeLog
    winsup/cygwin/ChangeLog-1995
    winsup/cygwin/ChangeLog-1996
    winsup/cygwin/ChangeLog-1997
    winsup/cygwin/ChangeLog-1998
    winsup/cygwin/ChangeLog-1999
    winsup/cygwin/ChangeLog-2000
    winsup/cygwin/ChangeLog-2001
    winsup/cygwin/ChangeLog-2002
    winsup/cygwin/ChangeLog-2003
    winsup/cygwin/ChangeLog-2004
    winsup/cygwin/ChangeLog-2005
    winsup/cygwin/Makefile.in
    winsup/cygwin/ROADMAP
    winsup/cygwin/acconfig.h
    winsup/cygwin/aclocal.m4
    winsup/cygwin/analyze_sigfe
    winsup/cygwin/ansi.sgml
    winsup/cygwin/assert.cc
    winsup/cygwin/autoload.cc
    winsup/cygwin/automode.c
    winsup/cygwin/binmode.c
    winsup/cygwin/child_info.h
    winsup/cygwin/config.h.in
    winsup/cygwin/config/i386/profile.h
    winsup/cygwin/configure
    winsup/cygwin/configure.in
    winsup/cygwin/cpuid.h
    winsup/cygwin/crt0.c
    winsup/cygwin/ctype.cc
    winsup/cygwin/cxx.cc
    winsup/cygwin/cygerrno.h
    winsup/cygwin/cygheap.cc
    winsup/cygwin/cygheap.h
    winsup/cygwin/cygmagic
    winsup/cygwin/cygmalloc.h
    winsup/cygwin/cygserver.h
    winsup/cygwin/cygserver_ipc.h
    winsup/cygwin/cygserver_msg.h
    winsup/cygwin/cygserver_sem.h
    winsup/cygwin/cygserver_shm.h
    winsup/cygwin/cygthread.cc
    winsup/cygwin/cygthread.h
    winsup/cygwin/cygtls.cc
    winsup/cygwin/cygtls.h
    winsup/cygwin/cygwin-shilka
    winsup/cygwin/cygwin.din
    winsup/cygwin/cygwin.sc
    winsup/cygwin/cygwin_version.h
    winsup/cygwin/dcrt0.cc
    winsup/cygwin/debug.cc
    winsup/cygwin/debug.h
    winsup/cygwin/delqueue.cc
    winsup/cygwin/devices.cc
    winsup/cygwin/devices.h
    winsup/cygwin/devices.in
    winsup/cygwin/dir.cc
    winsup/cygwin/dlfcn.cc
    winsup/cygwin/dll_init.cc
    winsup/cygwin/dll_init.h
    winsup/cygwin/dll_init.sgml
    winsup/cygwin/dllfixdbg
    winsup/cygwin/dlmalloc.c
    winsup/cygwin/dlmalloc.h
    winsup/cygwin/dtable.cc
    winsup/cygwin/dtable.h
    winsup/cygwin/dtable.sgml
    winsup/cygwin/environ.cc
    winsup/cygwin/environ.h
    winsup/cygwin/errno.cc
    winsup/cygwin/exceptions.cc
    winsup/cygwin/exec.cc
    winsup/cygwin/external.cc
    winsup/cygwin/external.sgml
    winsup/cygwin/fcntl.cc
    winsup/cygwin/fhandler.cc
    winsup/cygwin/fhandler.h
    winsup/cygwin/fhandler_clipboard.cc
    winsup/cygwin/fhandler_console.cc
    winsup/cygwin/fhandler_disk_file.cc
    winsup/cygwin/fhandler_dsp.cc
    winsup/cygwin/fhandler_fifo.cc
    winsup/cygwin/fhandler_floppy.cc
    winsup/cygwin/fhandler_mailslot.cc
    winsup/cygwin/fhandler_mem.cc
    winsup/cygwin/fhandler_netdrive.cc
    winsup/cygwin/fhandler_nodevice.cc
    winsup/cygwin/fhandler_proc.cc
    winsup/cygwin/fhandler_process.cc
    winsup/cygwin/fhandler_random.cc
    winsup/cygwin/fhandler_raw.cc
    winsup/cygwin/fhandler_registry.cc
    winsup/cygwin/fhandler_serial.cc
    winsup/cygwin/fhandler_socket.cc
    winsup/cygwin/fhandler_tape.cc
    winsup/cygwin/fhandler_termios.cc
    winsup/cygwin/fhandler_tty.cc
    winsup/cygwin/fhandler_virtual.cc
    winsup/cygwin/fhandler_windows.cc
    winsup/cygwin/fhandler_zero.cc
    winsup/cygwin/flock.cc
    winsup/cygwin/fork.cc
    winsup/cygwin/gcrt0.c
    winsup/cygwin/gendef
    winsup/cygwin/gendevices
    winsup/cygwin/gentls_offsets
    winsup/cygwin/glob.c
    winsup/cygwin/gmon.c
    winsup/cygwin/gmon.h
    winsup/cygwin/grp.cc
    winsup/cygwin/heap.cc
    winsup/cygwin/heap.h
    winsup/cygwin/hires.h
    winsup/cygwin/hookapi.cc
    winsup/cygwin/how-autoload-works.txt
    winsup/cygwin/how-cygheap-works.txt
    winsup/cygwin/how-cygtls-works.txt
    winsup/cygwin/how-fhandlers-work.txt
    winsup/cygwin/how-signals-work.txt
    winsup/cygwin/how-spawn-works.txt
    winsup/cygwin/how-to-debug-cygwin.txt
    winsup/cygwin/how-vfork-works.txt
    winsup/cygwin/include/a.out.h
    winsup/cygwin/include/arpa/ftp.h
    winsup/cygwin/include/arpa/inet.h
    winsup/cygwin/include/arpa/telnet.h
    winsup/cygwin/include/asm/byteorder.h
    winsup/cygwin/include/asm/socket.h
    winsup/cygwin/include/asm/types.h
    winsup/cygwin/include/byteswap.h
    winsup/cygwin/include/ctype.h
    winsup/cygwin/include/cygwin/_types.h
    winsup/cygwin/include/cygwin/acl.h
    winsup/cygwin/include/cygwin/config.h
    winsup/cygwin/include/cygwin/core_dump.h
    winsup/cygwin/include/cygwin/cygwin_dll.h
    winsup/cygwin/include/cygwin/fs.h
    winsup/cygwin/include/cygwin/grp.h
    winsup/cygwin/include/cygwin/hdreg.h
    winsup/cygwin/include/cygwin/icmp.h
    winsup/cygwin/include/cygwin/if.h
    winsup/cygwin/include/cygwin/in.h
    winsup/cygwin/include/cygwin/in6.h
    winsup/cygwin/include/cygwin/in_systm.h
    winsup/cygwin/include/cygwin/ipc.h
    winsup/cygwin/include/cygwin/kd.h
    winsup/cygwin/include/cygwin/msg.h
    winsup/cygwin/include/cygwin/mtio.h
    winsup/cygwin/include/cygwin/rdevio.h
    winsup/cygwin/include/cygwin/sem.h
    winsup/cygwin/include/cygwin/shm.h
    winsup/cygwin/include/cygwin/signal.h
    winsup/cygwin/include/cygwin/socket.h
    winsup/cygwin/include/cygwin/sockios.h
    winsup/cygwin/include/cygwin/stat.h
    winsup/cygwin/include/cygwin/stdlib.h
    winsup/cygwin/include/cygwin/sys_time.h
    winsup/cygwin/include/cygwin/sysproto.h
    winsup/cygwin/include/cygwin/time.h
    winsup/cygwin/include/cygwin/types.h
    winsup/cygwin/include/cygwin/uio.h
    winsup/cygwin/include/cygwin/utmp.h
    winsup/cygwin/include/cygwin/version.h
    winsup/cygwin/include/cygwin/wait.h
    winsup/cygwin/include/dlfcn.h
    winsup/cygwin/include/elf.h
    winsup/cygwin/include/endian.h
    winsup/cygwin/include/err.h
    winsup/cygwin/include/exceptions.h
    winsup/cygwin/include/fcntl.h
    winsup/cygwin/include/features.h
    winsup/cygwin/include/fnmatch.h
    winsup/cygwin/include/fts.h
    winsup/cygwin/include/ftw.h
    winsup/cygwin/include/getopt.h
    winsup/cygwin/include/glob.h
    winsup/cygwin/include/icmp.h
    winsup/cygwin/include/inttypes.h
    winsup/cygwin/include/io.h
    winsup/cygwin/include/lastlog.h
    winsup/cygwin/include/libgen.h
    winsup/cygwin/include/limits.h
    winsup/cygwin/include/machine/stdlib.h
    winsup/cygwin/include/mapi.h
    winsup/cygwin/include/memory.h
    winsup/cygwin/include/mntent.h
    winsup/cygwin/include/net/if.h
    winsup/cygwin/include/netdb.h
    winsup/cygwin/include/netinet/in.h
    winsup/cygwin/include/netinet/in_systm.h
    winsup/cygwin/include/netinet/ip.h
    winsup/cygwin/include/netinet/ip_icmp.h
    winsup/cygwin/include/netinet/tcp.h
    winsup/cygwin/include/netinet/udp.h
    winsup/cygwin/include/paths.h
    winsup/cygwin/include/poll.h
    winsup/cygwin/include/pthread.h
    winsup/cygwin/include/pty.h
    winsup/cygwin/include/sched.h
    winsup/cygwin/include/search.h
    winsup/cygwin/include/semaphore.h
    winsup/cygwin/include/stdint.h
    winsup/cygwin/include/strings.h
    winsup/cygwin/include/sys/acl.h
    winsup/cygwin/include/sys/cdefs.h
    winsup/cygwin/include/sys/copying.dj
    winsup/cygwin/include/sys/cygwin.h
    winsup/cygwin/include/sys/dirent.h
    winsup/cygwin/include/sys/elf32.h
    winsup/cygwin/include/sys/elf64.h
    winsup/cygwin/include/sys/elf_common.h
    winsup/cygwin/include/sys/elf_generic.h
    winsup/cygwin/include/sys/file.h
    winsup/cygwin/include/sys/ioctl.h
    winsup/cygwin/include/sys/ipc.h
    winsup/cygwin/include/sys/kd.h
    winsup/cygwin/include/sys/lock.h
    winsup/cygwin/include/sys/mman.h
    winsup/cygwin/include/sys/mount.h
    winsup/cygwin/include/sys/msg.h
    winsup/cygwin/include/sys/mtio.h
    winsup/cygwin/include/sys/param.h
    winsup/cygwin/include/sys/poll.h
    winsup/cygwin/include/sys/procfs.h
    winsup/cygwin/include/sys/queue.h
    winsup/cygwin/include/sys/resource.h
    winsup/cygwin/include/sys/select.h
    winsup/cygwin/include/sys/sem.h
    winsup/cygwin/include/sys/shm.h
    winsup/cygwin/include/sys/smallprint.h
    winsup/cygwin/include/sys/socket.h
    winsup/cygwin/include/sys/soundcard.h
    winsup/cygwin/include/sys/statfs.h
    winsup/cygwin/include/sys/statvfs.h
    winsup/cygwin/include/sys/stdio.h
    winsup/cygwin/include/sys/strace.h
    winsup/cygwin/include/sys/syslog.h
    winsup/cygwin/include/sys/sysmacros.h
    winsup/cygwin/include/sys/sysproto.h
    winsup/cygwin/include/sys/termio.h
    winsup/cygwin/include/sys/termios.h
    winsup/cygwin/include/sys/ttychars.h
    winsup/cygwin/include/sys/uio.h
    winsup/cygwin/include/sys/un.h
    winsup/cygwin/include/sys/utime.h
    winsup/cygwin/include/sys/utmp.h
    winsup/cygwin/include/sys/utsname.h
    winsup/cygwin/include/sys/vfs.h
    winsup/cygwin/include/sys/wait.h
    winsup/cygwin/include/sysexits.h
    winsup/cygwin/include/syslog.h
    winsup/cygwin/include/termio.h
    winsup/cygwin/include/tzfile.h
    winsup/cygwin/include/utmpx.h
    winsup/cygwin/init.cc
    winsup/cygwin/ioctl.cc
    winsup/cygwin/ipc.cc
    winsup/cygwin/lib/_cygwin_crt0_common.cc
    winsup/cygwin/lib/crt0.h
    winsup/cygwin/lib/cygwin_attach_dll.c
    winsup/cygwin/lib/cygwin_crt0.c
    winsup/cygwin/lib/dll_entry.c
    winsup/cygwin/lib/dll_main.cc
    winsup/cygwin/lib/libcmain.c
    winsup/cygwin/lib/premain0.c
    winsup/cygwin/lib/premain1.c
    winsup/cygwin/lib/premain2.c
    winsup/cygwin/lib/premain3.c
    winsup/cygwin/lib/pseudo-reloc.c
    winsup/cygwin/libc/bsdlib.cc
    winsup/cygwin/libc/fnmatch.c
    winsup/cygwin/libc/fts.c
    winsup/cygwin/libc/ftw.c
    winsup/cygwin/libc/getopt.c
    winsup/cygwin/libc/inet_addr.c
    winsup/cygwin/libc/inet_network.c
    winsup/cygwin/libc/memmem.cc
    winsup/cygwin/libc/nftw.c
    winsup/cygwin/libc/rcmd.cc
    winsup/cygwin/libc/rexec.cc
    winsup/cygwin/libc/strptime.cc
    winsup/cygwin/libc/timelocal.cc
    winsup/cygwin/libc/timelocal.h
    winsup/cygwin/localtime.cc
    winsup/cygwin/lsearch.cc
    winsup/cygwin/malloc.cc
    winsup/cygwin/malloc_wrapper.cc
    winsup/cygwin/mcount.c
    winsup/cygwin/misc-std.sgml
    winsup/cygwin/miscfuncs.cc
    winsup/cygwin/mktemp.cc
    winsup/cygwin/mkvers.sh
    winsup/cygwin/mmap.cc
    winsup/cygwin/mmap_helper.h
    winsup/cygwin/msg.cc
    winsup/cygwin/mtinfo.h
    winsup/cygwin/net.cc
    winsup/cygwin/netdb.cc
    winsup/cygwin/newsym
    winsup/cygwin/ntdll.h
    winsup/cygwin/ntea.cc
    winsup/cygwin/passwd.cc
    winsup/cygwin/path.cc
    winsup/cygwin/path.h
    winsup/cygwin/path.sgml
    winsup/cygwin/perprocess.h
    winsup/cygwin/pinfo.cc
    winsup/cygwin/pinfo.h
    winsup/cygwin/pipe.cc
    winsup/cygwin/poll.cc
    winsup/cygwin/posix.sgml
    winsup/cygwin/profil.c
    winsup/cygwin/profil.h
    winsup/cygwin/pseudo-reloc.cc
    winsup/cygwin/pthread.cc
    winsup/cygwin/pwdgrp.h
    winsup/cygwin/regex/COPYRIGHT
    winsup/cygwin/regex/cclass.h
    winsup/cygwin/regex/cname.h
    winsup/cygwin/regex/engine.c
    winsup/cygwin/regex/engine.ih
    winsup/cygwin/regex/mkh
    winsup/cygwin/regex/regcomp.c
    winsup/cygwin/regex/regcomp.ih
    winsup/cygwin/regex/regerror.c
    winsup/cygwin/regex/regerror.ih
    winsup/cygwin/regex/regex.3
    winsup/cygwin/regex/regex.7
    winsup/cygwin/regex/regex.h
    winsup/cygwin/regex/regex2.h
    winsup/cygwin/regex/regexec.c
    winsup/cygwin/regex/regfree.c
    winsup/cygwin/regex/tests
    winsup/cygwin/regex/utils.h
    winsup/cygwin/regexp/COPYRIGHT
    winsup/cygwin/regexp/README
    winsup/cygwin/regexp/regexp.h
    winsup/cygwin/regexp/regmagic.h
    winsup/cygwin/regexp/v8_regerror.c
    winsup/cygwin/regexp/v8_regexp.c
    winsup/cygwin/regexp/v8_regsub.c
    winsup/cygwin/registry.cc
    winsup/cygwin/registry.h
    winsup/cygwin/resource.cc
    winsup/cygwin/rmsym
    winsup/cygwin/scandir.cc
    winsup/cygwin/sched.cc
    winsup/cygwin/sec_acl.cc
    winsup/cygwin/sec_helper.cc
    winsup/cygwin/security.cc
    winsup/cygwin/security.h
    winsup/cygwin/select.cc
    winsup/cygwin/sem.cc
    winsup/cygwin/shared.cc
    winsup/cygwin/shared.sgml
    winsup/cygwin/shared_info.h
    winsup/cygwin/shm.cc
    winsup/cygwin/signal.cc
    winsup/cygwin/sigproc.cc
    winsup/cygwin/sigproc.h
    winsup/cygwin/smallprint.c
    winsup/cygwin/sortdin
    winsup/cygwin/spawn.cc
    winsup/cygwin/speclib
    winsup/cygwin/stackdump.sgml
    winsup/cygwin/strace.cc
    winsup/cygwin/string.h
    winsup/cygwin/strsep.cc
    winsup/cygwin/strsig.cc
    winsup/cygwin/sync.cc
    winsup/cygwin/sync.h
    winsup/cygwin/syscalls.cc
    winsup/cygwin/sysconf.cc
    winsup/cygwin/syslog.cc
    winsup/cygwin/termios.cc
    winsup/cygwin/textmode.c
    winsup/cygwin/textreadmode.c
    winsup/cygwin/thread.cc
    winsup/cygwin/thread.h
    winsup/cygwin/timer.cc
    winsup/cygwin/times.cc
    winsup/cygwin/tlsoffsets.h
    winsup/cygwin/tty.cc
    winsup/cygwin/tty.h
    winsup/cygwin/tz_posixrules.h
    winsup/cygwin/uinfo.cc
    winsup/cygwin/uname.cc
    winsup/cygwin/wait.cc
    winsup/cygwin/winbase.h
    winsup/cygwin/wincap.cc
    winsup/cygwin/wincap.h
    winsup/cygwin/window.cc
    winsup/cygwin/winf.cc
    winsup/cygwin/winf.h
    winsup/cygwin/wininfo.h
    winsup/cygwin/winsup.h
    winsup/cygwin/winver.rc
    winsup/doc/ChangeLog
    winsup/doc/Makefile.in
    winsup/doc/README
    winsup/doc/aclocal.m4
    winsup/doc/configure
    winsup/doc/configure.in
    winsup/doc/cygserver.sgml
    winsup/doc/cygwin-api.in.sgml
    winsup/doc/cygwin-ug-net.in.sgml
    winsup/doc/cygwin-ug.in.sgml
    winsup/doc/cygwin.dsl
    winsup/doc/cygwinenv.sgml
    winsup/doc/dll.sgml
    winsup/doc/doctool.c
    winsup/doc/doctool.txt
    winsup/doc/effectively.sgml
    winsup/doc/faq-api.xml
    winsup/doc/faq-problems.xml
    winsup/doc/faq-programming.xml
    winsup/doc/faq-resources.xml
    winsup/doc/faq-sections.xml
    winsup/doc/faq-setup.xml
    winsup/doc/faq-using.xml
    winsup/doc/faq-what.xml
    winsup/doc/faq.xml
    winsup/doc/fhandler-tut.txt
    winsup/doc/filemodes.sgml
    winsup/doc/gcc.sgml
    winsup/doc/gdb.sgml
    winsup/doc/legal.sgml
    winsup/doc/ntsec.sgml
    winsup/doc/overview.sgml
    winsup/doc/overview2.sgml
    winsup/doc/pathnames.sgml
    winsup/doc/programming.sgml
    winsup/doc/setup-net.sgml
    winsup/doc/setup.sgml
    winsup/doc/setup2.sgml
    winsup/doc/textbinary.sgml
    winsup/doc/using.sgml
    winsup/doc/windres.sgml
    winsup/mingw/CONTRIBUTORS
    winsup/mingw/CRT_fp10.c
    winsup/mingw/CRT_fp8.c
    winsup/mingw/CRT_noglob.c
    winsup/mingw/CRTfmode.c
    winsup/mingw/CRTglob.c
    winsup/mingw/CRTinit.c
    winsup/mingw/ChangeLog
    winsup/mingw/DISCLAIMER
    winsup/mingw/Makefile.in
    winsup/mingw/README
    winsup/mingw/TODO
    winsup/mingw/aclocal.m4
    winsup/mingw/binmode.c
    winsup/mingw/config.guess
    winsup/mingw/config.sub
    winsup/mingw/configure
    winsup/mingw/configure.in
    winsup/mingw/cpu_features.c
    winsup/mingw/cpu_features.h
    winsup/mingw/crt1.c
    winsup/mingw/crtdll.def
    winsup/mingw/crtmt.c
    winsup/mingw/crtst.c
    winsup/mingw/dllcrt1.c
    winsup/mingw/dllmain.c
    winsup/mingw/gccmain.c
    winsup/mingw/include/_mingw.h
    winsup/mingw/include/assert.h
    winsup/mingw/include/complex.h
    winsup/mingw/include/conio.h
    winsup/mingw/include/ctype.h
    winsup/mingw/include/dir.h
    winsup/mingw/include/direct.h
    winsup/mingw/include/dirent.h
    winsup/mingw/include/dos.h
    winsup/mingw/include/errno.h
    winsup/mingw/include/excpt.h
    winsup/mingw/include/fcntl.h
    winsup/mingw/include/fenv.h
    winsup/mingw/include/float.h
    winsup/mingw/include/getopt.h
    winsup/mingw/include/inttypes.h
    winsup/mingw/include/io.h
    winsup/mingw/include/limits.h
    winsup/mingw/include/locale.h
    winsup/mingw/include/malloc.h
    winsup/mingw/include/math.h
    winsup/mingw/include/mbctype.h
    winsup/mingw/include/mbstring.h
    winsup/mingw/include/mem.h
    winsup/mingw/include/memory.h
    winsup/mingw/include/process.h
    winsup/mingw/include/search.h
    winsup/mingw/include/setjmp.h
    winsup/mingw/include/share.h
    winsup/mingw/include/signal.h
    winsup/mingw/include/stdint.h
    winsup/mingw/include/stdio.h
    winsup/mingw/include/stdlib.h
    winsup/mingw/include/string.h
    winsup/mingw/include/strings.h
    winsup/mingw/include/sys/fcntl.h
    winsup/mingw/include/sys/file.h
    winsup/mingw/include/sys/locking.h
    winsup/mingw/include/sys/param.h
    winsup/mingw/include/sys/stat.h
    winsup/mingw/include/sys/time.h
    winsup/mingw/include/sys/timeb.h
    winsup/mingw/include/sys/types.h
    winsup/mingw/include/sys/unistd.h
    winsup/mingw/include/sys/utime.h
    winsup/mingw/include/tchar.h
    winsup/mingw/include/time.h
    winsup/mingw/include/unistd.h
    winsup/mingw/include/utime.h
    winsup/mingw/include/values.h
    winsup/mingw/include/varargs.h
    winsup/mingw/include/wchar.h
    winsup/mingw/include/wctype.h
    winsup/mingw/init.c
    winsup/mingw/install-sh
    winsup/mingw/isascii.c
    winsup/mingw/iscsym.c
    winsup/mingw/iscsymf.c
    winsup/mingw/jamfile
    winsup/mingw/main.c
    winsup/mingw/mingwex/Makefile.in
    winsup/mingw/mingwex/_Exit.c
    winsup/mingw/mingwex/aclocal.m4
    winsup/mingw/mingwex/atoll.c
    winsup/mingw/mingwex/btowc.c
    winsup/mingw/mingwex/complex/cabs.c
    winsup/mingw/mingwex/complex/cabsf.c
    winsup/mingw/mingwex/complex/cabsl.c
    winsup/mingw/mingwex/complex/cacos.c
    winsup/mingw/mingwex/complex/cacosf.c
    winsup/mingw/mingwex/complex/cacosh.c
    winsup/mingw/mingwex/complex/cacoshf.c
    winsup/mingw/mingwex/complex/cacoshl.c
    winsup/mingw/mingwex/complex/cacosl.c
    winsup/mingw/mingwex/complex/carg.c
    winsup/mingw/mingwex/complex/cargf.c
    winsup/mingw/mingwex/complex/cargl.c
    winsup/mingw/mingwex/complex/casin.c
    winsup/mingw/mingwex/complex/casinf.c
    winsup/mingw/mingwex/complex/casinh.c
    winsup/mingw/mingwex/complex/casinhf.c
    winsup/mingw/mingwex/complex/casinhl.c
    winsup/mingw/mingwex/complex/casinl.c
    winsup/mingw/mingwex/complex/catan.c
    winsup/mingw/mingwex/complex/catanf.c
    winsup/mingw/mingwex/complex/catanh.c
    winsup/mingw/mingwex/complex/catanhf.c
    winsup/mingw/mingwex/complex/catanhl.c
    winsup/mingw/mingwex/complex/catanl.c
    winsup/mingw/mingwex/complex/ccos.c
    winsup/mingw/mingwex/complex/ccosf.c
    winsup/mingw/mingwex/complex/ccosh.c
    winsup/mingw/mingwex/complex/ccoshf.c
    winsup/mingw/mingwex/complex/ccoshl.c
    winsup/mingw/mingwex/complex/ccosl.c
    winsup/mingw/mingwex/complex/cexp.c
    winsup/mingw/mingwex/complex/cexpf.c
    winsup/mingw/mingwex/complex/cexpl.c
    winsup/mingw/mingwex/complex/cimag.c
    winsup/mingw/mingwex/complex/cimagf.c
    winsup/mingw/mingwex/complex/cimagl.c
    winsup/mingw/mingwex/complex/clog.c
    winsup/mingw/mingwex/complex/clogf.c
    winsup/mingw/mingwex/complex/clogl.c
    winsup/mingw/mingwex/complex/cpow.c
    winsup/mingw/mingwex/complex/cpowf.c
    winsup/mingw/mingwex/complex/cpowl.c
    winsup/mingw/mingwex/complex/cproj.c
    winsup/mingw/mingwex/complex/cprojf.c
    winsup/mingw/mingwex/complex/cprojl.c
    winsup/mingw/mingwex/complex/creal.c
    winsup/mingw/mingwex/complex/crealf.c
    winsup/mingw/mingwex/complex/creall.c
    winsup/mingw/mingwex/complex/csin.c
    winsup/mingw/mingwex/complex/csinf.c
    winsup/mingw/mingwex/complex/csinh.c
    winsup/mingw/mingwex/complex/csinhf.c
    winsup/mingw/mingwex/complex/csinhl.c
    winsup/mingw/mingwex/complex/csinl.c
    winsup/mingw/mingwex/complex/csqrt.c
    winsup/mingw/mingwex/complex/csqrtf.c
    winsup/mingw/mingwex/complex/csqrtl.c
    winsup/mingw/mingwex/complex/ctan.c
    winsup/mingw/mingwex/complex/ctanf.c
    winsup/mingw/mingwex/complex/ctanh.c
    winsup/mingw/mingwex/complex/ctanhf.c
    winsup/mingw/mingwex/complex/ctanhl.c
    winsup/mingw/mingwex/complex/ctanl.c
    winsup/mingw/mingwex/configure
    winsup/mingw/mingwex/configure.in
    winsup/mingw/mingwex/dirent.c
    winsup/mingw/mingwex/feclearexcept.c
    winsup/mingw/mingwex/fegetenv.c
    winsup/mingw/mingwex/fegetexceptflag.c
    winsup/mingw/mingwex/fegetround.c
    winsup/mingw/mingwex/feholdexcept.c
    winsup/mingw/mingwex/feraiseexcept.c
    winsup/mingw/mingwex/fesetenv.c
    winsup/mingw/mingwex/fesetexceptflag.c
    winsup/mingw/mingwex/fesetround.c
    winsup/mingw/mingwex/fetestexcept.c
    winsup/mingw/mingwex/feupdateenv.c
    winsup/mingw/mingwex/ftruncate.c
    winsup/mingw/mingwex/fwide.c
    winsup/mingw/mingwex/getopt.c
    winsup/mingw/mingwex/gettimeofday.c
    winsup/mingw/mingwex/imaxabs.c
    winsup/mingw/mingwex/imaxdiv.c
    winsup/mingw/mingwex/isblank.c
    winsup/mingw/mingwex/iswblank.c
    winsup/mingw/mingwex/ldtoa.c
    winsup/mingw/mingwex/lltoa.c
    winsup/mingw/mingwex/lltow.c
    winsup/mingw/mingwex/math/acosf.c
    winsup/mingw/mingwex/math/acosh.c
    winsup/mingw/mingwex/math/acoshf.c
    winsup/mingw/mingwex/math/acoshl.c
    winsup/mingw/mingwex/math/acosl.c
    winsup/mingw/mingwex/math/asinf.c
    winsup/mingw/mingwex/math/asinh.c
    winsup/mingw/mingwex/math/asinhf.c
    winsup/mingw/mingwex/math/asinhl.c
    winsup/mingw/mingwex/math/asinl.c
    winsup/mingw/mingwex/math/atan2f.c
    winsup/mingw/mingwex/math/atan2l.c
    winsup/mingw/mingwex/math/atanf.c
    winsup/mingw/mingwex/math/atanh.c
    winsup/mingw/mingwex/math/atanhf.c
    winsup/mingw/mingwex/math/atanhl.c
    winsup/mingw/mingwex/math/atanl.c
    winsup/mingw/mingwex/math/cbrt.c
    winsup/mingw/mingwex/math/cbrtf.c
    winsup/mingw/mingwex/math/cbrtl.c
    winsup/mingw/mingwex/math/ceilf.S
    winsup/mingw/mingwex/math/ceill.S
    winsup/mingw/mingwex/math/cephes_emath.c
    winsup/mingw/mingwex/math/cephes_emath.h
    winsup/mingw/mingwex/math/cephes_mconf.h
    winsup/mingw/mingwex/math/copysign.S
    winsup/mingw/mingwex/math/copysignf.S
    winsup/mingw/mingwex/math/copysignl.S
    winsup/mingw/mingwex/math/cosf.S
    winsup/mingw/mingwex/math/coshf.c
    winsup/mingw/mingwex/math/coshl.c
    winsup/mingw/mingwex/math/cosl.S
    winsup/mingw/mingwex/math/erfl.c
    winsup/mingw/mingwex/math/exp2.S
    winsup/mingw/mingwex/math/exp2f.S
    winsup/mingw/mingwex/math/exp2l.S
    winsup/mingw/mingwex/math/expf.c
    winsup/mingw/mingwex/math/expl.c
    winsup/mingw/mingwex/math/expm1.c
    winsup/mingw/mingwex/math/expm1f.c
    winsup/mingw/mingwex/math/expm1l.c
    winsup/mingw/mingwex/math/fabs.c
    winsup/mingw/mingwex/math/fabsf.c
    winsup/mingw/mingwex/math/fabsl.c
    winsup/mingw/mingwex/math/fastmath.h
    winsup/mingw/mingwex/math/fdim.c
    winsup/mingw/mingwex/math/fdimf.c
    winsup/mingw/mingwex/math/fdiml.c
    winsup/mingw/mingwex/math/floorf.S
    winsup/mingw/mingwex/math/floorl.S
    winsup/mingw/mingwex/math/fma.S
    winsup/mingw/mingwex/math/fmaf.S
    winsup/mingw/mingwex/math/fmal.c
    winsup/mingw/mingwex/math/fmax.c
    winsup/mingw/mingwex/math/fmaxf.c
    winsup/mingw/mingwex/math/fmaxl.c
    winsup/mingw/mingwex/math/fmin.c
    winsup/mingw/mingwex/math/fminf.c
    winsup/mingw/mingwex/math/fminl.c
    winsup/mingw/mingwex/math/fmodf.c
    winsup/mingw/mingwex/math/fmodl.c
    winsup/mingw/mingwex/math/fp_consts.c
    winsup/mingw/mingwex/math/fp_consts.h
    winsup/mingw/mingwex/math/fp_constsf.c
    winsup/mingw/mingwex/math/fp_constsl.c
    winsup/mingw/mingwex/math/fpclassify.c
    winsup/mingw/mingwex/math/fpclassifyf.c
    winsup/mingw/mingwex/math/fpclassifyl.c
    winsup/mingw/mingwex/math/frexpf.c
    winsup/mingw/mingwex/math/frexpl.S
    winsup/mingw/mingwex/math/fucom.c
    winsup/mingw/mingwex/math/hypotf.c
    winsup/mingw/mingwex/math/hypotl.c
    winsup/mingw/mingwex/math/ilogb.S
    winsup/mingw/mingwex/math/ilogbf.S
    winsup/mingw/mingwex/math/ilogbl.S
    winsup/mingw/mingwex/math/isnan.c
    winsup/mingw/mingwex/math/isnanf.c
    winsup/mingw/mingwex/math/isnanl.c
    winsup/mingw/mingwex/math/ldexpf.c
    winsup/mingw/mingwex/math/ldexpl.c
    winsup/mingw/mingwex/math/lgamma.c
    winsup/mingw/mingwex/math/lgammaf.c
    winsup/mingw/mingwex/math/lgammal.c
    winsup/mingw/mingwex/math/llrint.c
    winsup/mingw/mingwex/math/llrintf.c
    winsup/mingw/mingwex/math/llrintl.c
    winsup/mingw/mingwex/math/llround.c
    winsup/mingw/mingwex/math/llroundf.c
    winsup/mingw/mingwex/math/llroundl.c
    winsup/mingw/mingwex/math/log10f.S
    winsup/mingw/mingwex/math/log10l.S
    winsup/mingw/mingwex/math/log1p.S
    winsup/mingw/mingwex/math/log1pf.S
    winsup/mingw/mingwex/math/log1pl.S
    winsup/mingw/mingwex/math/log2.S
    winsup/mingw/mingwex/math/log2f.S
    winsup/mingw/mingwex/math/log2l.S
    winsup/mingw/mingwex/math/logb.c
    winsup/mingw/mingwex/math/logbf.c
    winsup/mingw/mingwex/math/logbl.c
    winsup/mingw/mingwex/math/logf.S
    winsup/mingw/mingwex/math/logl.S
    winsup/mingw/mingwex/math/lrint.c
    winsup/mingw/mingwex/math/lrintf.c
    winsup/mingw/mingwex/math/lrintl.c
    winsup/mingw/mingwex/math/lround.c
    winsup/mingw/mingwex/math/lroundf.c
    winsup/mingw/mingwex/math/lroundl.c
    winsup/mingw/mingwex/math/modff.c
    winsup/mingw/mingwex/math/modfl.c
    winsup/mingw/mingwex/math/nearbyint.S
    winsup/mingw/mingwex/math/nearbyintf.S
    winsup/mingw/mingwex/math/nearbyintl.S
    winsup/mingw/mingwex/math/nextafterf.c
    winsup/mingw/mingwex/math/nextafterl.c
    winsup/mingw/mingwex/math/nexttoward.c
    winsup/mingw/mingwex/math/nexttowardf.c
    winsup/mingw/mingwex/math/pow.c
    winsup/mingw/mingwex/math/powf.c
    winsup/mingw/mingwex/math/powi.c
    winsup/mingw/mingwex/math/powif.c
    winsup/mingw/mingwex/math/powil.c
    winsup/mingw/mingwex/math/powl.c
    winsup/mingw/mingwex/math/remainder.S
    winsup/mingw/mingwex/math/remainderf.S
    winsup/mingw/mingwex/math/remainderl.S
    winsup/mingw/mingwex/math/remquo.S
    winsup/mingw/mingwex/math/remquof.S
    winsup/mingw/mingwex/math/remquol.S
    winsup/mingw/mingwex/math/rint.c
    winsup/mingw/mingwex/math/rintf.c
    winsup/mingw/mingwex/math/rintl.c
    winsup/mingw/mingwex/math/round.c
    winsup/mingw/mingwex/math/roundf.c
    winsup/mingw/mingwex/math/roundl.c
    winsup/mingw/mingwex/math/s_erf.c
    winsup/mingw/mingwex/math/scalbn.S
    winsup/mingw/mingwex/math/scalbnf.S
    winsup/mingw/mingwex/math/scalbnl.S
    winsup/mingw/mingwex/math/sf_erf.c
    winsup/mingw/mingwex/math/signbit.c
    winsup/mingw/mingwex/math/signbitf.c
    winsup/mingw/mingwex/math/signbitl.c
    winsup/mingw/mingwex/math/sinf.S
    winsup/mingw/mingwex/math/sinhf.c
    winsup/mingw/mingwex/math/sinhl.c
    winsup/mingw/mingwex/math/sinl.S
    winsup/mingw/mingwex/math/sqrtf.c
    winsup/mingw/mingwex/math/sqrtl.c
    winsup/mingw/mingwex/math/tanf.S
    winsup/mingw/mingwex/math/tanhf.c
    winsup/mingw/mingwex/math/tanhl.c
    winsup/mingw/mingwex/math/tanl.S
    winsup/mingw/mingwex/math/tgamma.c
    winsup/mingw/mingwex/math/tgammaf.c
    winsup/mingw/mingwex/math/tgammal.c
    winsup/mingw/mingwex/math/trunc.c
    winsup/mingw/mingwex/math/truncf.c
    winsup/mingw/mingwex/math/truncl.c
    winsup/mingw/mingwex/mb_wc_common.h
    winsup/mingw/mingwex/mbrtowc.c
    winsup/mingw/mingwex/mbsinit.c
    winsup/mingw/mingwex/mingw-aligned-malloc.c
    winsup/mingw/mingwex/mingw-fseek.c
    winsup/mingw/mingwex/sitest.c
    winsup/mingw/mingwex/stdio/fopen64.c
    winsup/mingw/mingwex/stdio/fseeko64.c
    winsup/mingw/mingwex/stdio/ftello64.c
    winsup/mingw/mingwex/stdio/lseek64.c
    winsup/mingw/mingwex/stdio/snprintf.c
    winsup/mingw/mingwex/stdio/snwprintf.c
    winsup/mingw/mingwex/stdio/vfscanf.c
    winsup/mingw/mingwex/stdio/vfwscanf.c
    winsup/mingw/mingwex/stdio/vscanf.c
    winsup/mingw/mingwex/stdio/vsnprintf.c
    winsup/mingw/mingwex/stdio/vsnwprintf.c
    winsup/mingw/mingwex/stdio/vsscanf.c
    winsup/mingw/mingwex/stdio/vswscanf.c
    winsup/mingw/mingwex/stdio/vwscanf.c
    winsup/mingw/mingwex/strtof.c
    winsup/mingw/mingwex/strtoimax.c
    winsup/mingw/mingwex/strtold.c
    winsup/mingw/mingwex/strtoumax.c
    winsup/mingw/mingwex/testwmem.c
    winsup/mingw/mingwex/tst-aligned-malloc.c
    winsup/mingw/mingwex/ulltoa.c
    winsup/mingw/mingwex/ulltow.c
    winsup/mingw/mingwex/wcrtomb.c
    winsup/mingw/mingwex/wcstof.c
    winsup/mingw/mingwex/wcstoimax.c
    winsup/mingw/mingwex/wcstold.c
    winsup/mingw/mingwex/wcstoumax.c
    winsup/mingw/mingwex/wctob.c
    winsup/mingw/mingwex/wctrans.c
    winsup/mingw/mingwex/wctype.c
    winsup/mingw/mingwex/wdirent.c
    winsup/mingw/mingwex/wmemchr.c
    winsup/mingw/mingwex/wmemcmp.c
    winsup/mingw/mingwex/wmemcpy.c
    winsup/mingw/mingwex/wmemmove.c
    winsup/mingw/mingwex/wmemset.c
    winsup/mingw/mingwex/wtoll.c
    winsup/mingw/mkinstalldirs
    winsup/mingw/moldname.def.in
    winsup/mingw/msvcrt.def.in
    winsup/mingw/mthr.c
    winsup/mingw/mthr_init.c
    winsup/mingw/mthr_stub.c
    winsup/mingw/profile/COPYING
    winsup/mingw/profile/CYGWIN_LICENSE
    winsup/mingw/profile/Makefile.in
    winsup/mingw/profile/aclocal.m4
    winsup/mingw/profile/configure
    winsup/mingw/profile/configure.in
    winsup/mingw/profile/gcrt0.c
    winsup/mingw/profile/gmon.c
    winsup/mingw/profile/gmon.h
    winsup/mingw/profile/mcount.c
    winsup/mingw/profile/profil.c
    winsup/mingw/profile/profil.h
    winsup/mingw/profile/profile.h
    winsup/mingw/pseudo-reloc-list.c
    winsup/mingw/pseudo-reloc.c
    winsup/mingw/readme.txt
    winsup/mingw/samples/dirent/jamfile
    winsup/mingw/samples/dirent/test.c
    winsup/mingw/samples/dirent/wtest.c
    winsup/mingw/samples/dlltest/dll.c
    winsup/mingw/samples/dlltest/dll.def
    winsup/mingw/samples/dlltest/dll.h
    winsup/mingw/samples/dlltest/exe.c
    winsup/mingw/samples/dlltest/exe.exp
    winsup/mingw/samples/dlltest/expexe.c
    winsup/mingw/samples/dlltest/expexe.def
    winsup/mingw/samples/dlltest/jamfile
    winsup/mingw/samples/dlltest/loaddll.c
    winsup/mingw/samples/dlltest/loadexe.c
    winsup/mingw/samples/dlltest/readme.txt
    winsup/mingw/samples/dlltest/silly.cpp
    winsup/mingw/samples/dlltest/silly.def
    winsup/mingw/samples/dlltest/silly.exp
    winsup/mingw/samples/dlltest/silly.h
    winsup/mingw/samples/dlltest/sillydll.cpp
    winsup/mingw/samples/filehand/filehand.c
    winsup/mingw/samples/filehand/jamfile
    winsup/mingw/samples/filehand/junk.txt
    winsup/mingw/samples/fixargv/fixargv.c
    winsup/mingw/samples/fixargv/fixargv.h
    winsup/mingw/samples/fixargv/readme.txt
    winsup/mingw/samples/fmode/all.c
    winsup/mingw/samples/fmode/jamfile
    winsup/mingw/samples/fmode/readme.txt
    winsup/mingw/samples/fmode/test.c
    winsup/mingw/samples/fmode/test2.c
    winsup/mingw/samples/globbing/glob.c
    winsup/mingw/samples/globbing/jamfile
    winsup/mingw/samples/globbing/noglob.c
    winsup/mingw/samples/globbing/readme.txt
    winsup/mingw/samples/print/jamfile
    winsup/mingw/samples/print/prntest.c
    winsup/mingw/samples/seh/eh3.c
    winsup/mingw/samples/seh/exutil.c
    winsup/mingw/samples/seh/exutil.def
    winsup/mingw/samples/seh/exutil.h
    winsup/mingw/samples/seh/jamfile
    winsup/mingw/samples/seh/sehfix.c
    winsup/mingw/samples/seh/sehsub.c
    winsup/mingw/samples/seh/sehtest.c
    winsup/mingw/samples/simpledll/dll.c
    winsup/mingw/samples/simpledll/dll.cpp
    winsup/mingw/samples/simpledll/dll.def
    winsup/mingw/samples/simpledll/exe.c
    winsup/mingw/samples/simpledll/jamfile
    winsup/mingw/samples/simpledll/makedll.bat
    winsup/mingw/samples/test/jamfile
    winsup/mingw/samples/test/test.c
    winsup/mingw/samples/wintest/jamfile
    winsup/mingw/samples/wintest/test.c
    winsup/mingw/strcasecmp.c
    winsup/mingw/strncasecmp.c
    winsup/mingw/test_headers.c
    winsup/mingw/toascii.c
    winsup/mingw/txtmode.c
    winsup/mingw/wcscmpi.c
    winsup/subauth/ChangeLog
    winsup/subauth/Makefile.in
    winsup/subauth/aclocal.m4
    winsup/subauth/configure
    winsup/subauth/configure.in
    winsup/subauth/cygsuba.c
    winsup/subauth/cygsuba.din
    winsup/testsuite/ChangeLog
    winsup/testsuite/Makefile.in
    winsup/testsuite/README
    winsup/testsuite/aclocal.m4
    winsup/testsuite/config/default.exp
    winsup/testsuite/configure
    winsup/testsuite/configure.in
    winsup/testsuite/cygrun.c
    winsup/testsuite/libltp/include/dataascii.h
    winsup/testsuite/libltp/include/databin.h
    winsup/testsuite/libltp/include/file_lock.h
    winsup/testsuite/libltp/include/forker.h
    winsup/testsuite/libltp/include/open_flags.h
    winsup/testsuite/libltp/include/pattern.h
    winsup/testsuite/libltp/include/random_range.h
    winsup/testsuite/libltp/include/rmobj.h
    winsup/testsuite/libltp/include/search_path.h
    winsup/testsuite/libltp/include/str_to_bytes.h
    winsup/testsuite/libltp/include/string_to_tokens.h
    winsup/testsuite/libltp/include/test.h
    winsup/testsuite/libltp/include/tlibio.h
    winsup/testsuite/libltp/include/usctest.h
    winsup/testsuite/libltp/include/write_log.h
    winsup/testsuite/libltp/lib/dataascii.c
    winsup/testsuite/libltp/lib/databin.c
    winsup/testsuite/libltp/lib/datapid.c
    winsup/testsuite/libltp/lib/forker.c
    winsup/testsuite/libltp/lib/get_high_address.c
    winsup/testsuite/libltp/lib/libtestsuite.c
    winsup/testsuite/libltp/lib/open_flags.c
    winsup/testsuite/libltp/lib/parse_opts.c
    winsup/testsuite/libltp/lib/pattern.c
    winsup/testsuite/libltp/lib/rmobj.c
    winsup/testsuite/libltp/lib/search_path.c
    winsup/testsuite/libltp/lib/str_to_bytes.c
    winsup/testsuite/libltp/lib/string_to_tokens.c
    winsup/testsuite/libltp/lib/tst_res.c
    winsup/testsuite/libltp/lib/tst_sig.c
    winsup/testsuite/libltp/lib/tst_tmpdir.c
    winsup/testsuite/libltp/lib/write_log.c
    winsup/testsuite/winsup.api/checksignal.c
    winsup/testsuite/winsup.api/crlf.c
    winsup/testsuite/winsup.api/cygload.cc
    winsup/testsuite/winsup.api/cygload.exp
    winsup/testsuite/winsup.api/cygload.h
    winsup/testsuite/winsup.api/devdsp.c
    winsup/testsuite/winsup.api/devdsp_okay.h
    winsup/testsuite/winsup.api/devzero.c
    winsup/testsuite/winsup.api/iospeed.c
    winsup/testsuite/winsup.api/known_bugs.tcl
    winsup/testsuite/winsup.api/ltp/access01.c
    winsup/testsuite/winsup.api/ltp/access03.c
    winsup/testsuite/winsup.api/ltp/access04.c
    winsup/testsuite/winsup.api/ltp/access05.c
    winsup/testsuite/winsup.api/ltp/alarm01.c
    winsup/testsuite/winsup.api/ltp/alarm02.c
    winsup/testsuite/winsup.api/ltp/alarm03.c
    winsup/testsuite/winsup.api/ltp/alarm07.c
    winsup/testsuite/winsup.api/ltp/asyncio02.c
    winsup/testsuite/winsup.api/ltp/chdir02.c
    winsup/testsuite/winsup.api/ltp/chdir04.c
    winsup/testsuite/winsup.api/ltp/chmod01.c
    winsup/testsuite/winsup.api/ltp/chmod02.c
    winsup/testsuite/winsup.api/ltp/chown01.c
    winsup/testsuite/winsup.api/ltp/close01.c
    winsup/testsuite/winsup.api/ltp/close02.c
    winsup/testsuite/winsup.api/ltp/close08.c
    winsup/testsuite/winsup.api/ltp/creat01.c
    winsup/testsuite/winsup.api/ltp/creat03.c
    winsup/testsuite/winsup.api/ltp/creat09.c
    winsup/testsuite/winsup.api/ltp/dup01.c
    winsup/testsuite/winsup.api/ltp/dup02.c
    winsup/testsuite/winsup.api/ltp/dup03.c
    winsup/testsuite/winsup.api/ltp/dup04.c
    winsup/testsuite/winsup.api/ltp/dup05.c
    winsup/testsuite/winsup.api/ltp/execl01.c
    winsup/testsuite/winsup.api/ltp/execle01.c
    winsup/testsuite/winsup.api/ltp/execlp01.c
    winsup/testsuite/winsup.api/ltp/execv01.c
    winsup/testsuite/winsup.api/ltp/execve01.c
    winsup/testsuite/winsup.api/ltp/execvp01.c
    winsup/testsuite/winsup.api/ltp/exit01.c
    winsup/testsuite/winsup.api/ltp/exit02.c
    winsup/testsuite/winsup.api/ltp/fchdir01.c
    winsup/testsuite/winsup.api/ltp/fchdir02.c
    winsup/testsuite/winsup.api/ltp/fchmod01.c
    winsup/testsuite/winsup.api/ltp/fchown01.c
    winsup/testsuite/winsup.api/ltp/fcntl02.c
    winsup/testsuite/winsup.api/ltp/fcntl03.c
    winsup/testsuite/winsup.api/ltp/fcntl04.c
    winsup/testsuite/winsup.api/ltp/fcntl05.c
    winsup/testsuite/winsup.api/ltp/fcntl07.c
    winsup/testsuite/winsup.api/ltp/fcntl07B.c
    winsup/testsuite/winsup.api/ltp/fcntl08.c
    winsup/testsuite/winsup.api/ltp/fcntl09.c
    winsup/testsuite/winsup.api/ltp/fcntl10.c
    winsup/testsuite/winsup.api/ltp/fork01.c
    winsup/testsuite/winsup.api/ltp/fork02.c
    winsup/testsuite/winsup.api/ltp/fork03.c
    winsup/testsuite/winsup.api/ltp/fork04.c
    winsup/testsuite/winsup.api/ltp/fork06.c
    winsup/testsuite/winsup.api/ltp/fork07.c
    winsup/testsuite/winsup.api/ltp/fork09.c
    winsup/testsuite/winsup.api/ltp/fork10.c
    winsup/testsuite/winsup.api/ltp/fork11.c
    winsup/testsuite/winsup.api/ltp/fpathconf01.c
    winsup/testsuite/winsup.api/ltp/fstat01.c
    winsup/testsuite/winsup.api/ltp/fstat02.c
    winsup/testsuite/winsup.api/ltp/fstat03.c
    winsup/testsuite/winsup.api/ltp/fstat04.c
    winsup/testsuite/winsup.api/ltp/fsync01.c
    winsup/testsuite/winsup.api/ltp/ftruncate01.c
    winsup/testsuite/winsup.api/ltp/ftruncate02.c
    winsup/testsuite/winsup.api/ltp/ftruncate03.c
    winsup/testsuite/winsup.api/ltp/getegid01.c
    winsup/testsuite/winsup.api/ltp/geteuid01.c
    winsup/testsuite/winsup.api/ltp/getgid01.c
    winsup/testsuite/winsup.api/ltp/getgid02.c
    winsup/testsuite/winsup.api/ltp/getgid03.c
    winsup/testsuite/winsup.api/ltp/getgroups01.c
    winsup/testsuite/winsup.api/ltp/getgroups02.c
    winsup/testsuite/winsup.api/ltp/gethostid01.c
    winsup/testsuite/winsup.api/ltp/gethostname01.c
    winsup/testsuite/winsup.api/ltp/getpgid01.c
    winsup/testsuite/winsup.api/ltp/getpgid02.c
    winsup/testsuite/winsup.api/ltp/getpgrp01.c
    winsup/testsuite/winsup.api/ltp/getpid01.c
    winsup/testsuite/winsup.api/ltp/getpid02.c
    winsup/testsuite/winsup.api/ltp/getppid01.c
    winsup/testsuite/winsup.api/ltp/getppid02.c
    winsup/testsuite/winsup.api/ltp/getuid01.c
    winsup/testsuite/winsup.api/ltp/getuid02.c
    winsup/testsuite/winsup.api/ltp/getuid03.c
    winsup/testsuite/winsup.api/ltp/kill01.c
    winsup/testsuite/winsup.api/ltp/kill02.c
    winsup/testsuite/winsup.api/ltp/kill03.c
    winsup/testsuite/winsup.api/ltp/kill04.c
    winsup/testsuite/winsup.api/ltp/kill09.c
    winsup/testsuite/winsup.api/ltp/link02.c
    winsup/testsuite/winsup.api/ltp/link03.c
    winsup/testsuite/winsup.api/ltp/link04.c
    winsup/testsuite/winsup.api/ltp/link05.c
    winsup/testsuite/winsup.api/ltp/lseek01.c
    winsup/testsuite/winsup.api/ltp/lseek02.c
    winsup/testsuite/winsup.api/ltp/lseek03.c
    winsup/testsuite/winsup.api/ltp/lseek04.c
    winsup/testsuite/winsup.api/ltp/lseek05.c
    winsup/testsuite/winsup.api/ltp/lseek06.c
    winsup/testsuite/winsup.api/ltp/lseek07.c
    winsup/testsuite/winsup.api/ltp/lseek08.c
    winsup/testsuite/winsup.api/ltp/lseek09.c
    winsup/testsuite/winsup.api/ltp/lseek10.c
    winsup/testsuite/winsup.api/ltp/lstat02.c
    winsup/testsuite/winsup.api/ltp/mkdir01.c
    winsup/testsuite/winsup.api/ltp/mkdir08.c
    winsup/testsuite/winsup.api/ltp/mknod01.c
    winsup/testsuite/winsup.api/ltp/mmap001.c
    winsup/testsuite/winsup.api/ltp/mmap02.c
    winsup/testsuite/winsup.api/ltp/mmap03.c
    winsup/testsuite/winsup.api/ltp/mmap04.c
    winsup/testsuite/winsup.api/ltp/mmap05.c
    winsup/testsuite/winsup.api/ltp/mmap06.c
    winsup/testsuite/winsup.api/ltp/mmap07.c
    winsup/testsuite/winsup.api/ltp/mmap08.c
    winsup/testsuite/winsup.api/ltp/munmap01.c
    winsup/testsuite/winsup.api/ltp/munmap02.c
    winsup/testsuite/winsup.api/ltp/nice05.c
    winsup/testsuite/winsup.api/ltp/open02.c
    winsup/testsuite/winsup.api/ltp/open03.c
    winsup/testsuite/winsup.api/ltp/pathconf01.c
    winsup/testsuite/winsup.api/ltp/pause01.c
    winsup/testsuite/winsup.api/ltp/pipe01.c
    winsup/testsuite/winsup.api/ltp/pipe08.c
    winsup/testsuite/winsup.api/ltp/pipe09.c
    winsup/testsuite/winsup.api/ltp/pipe10.c
    winsup/testsuite/winsup.api/ltp/pipe11.c
    winsup/testsuite/winsup.api/ltp/poll01.c
    winsup/testsuite/winsup.api/ltp/read01.c
    winsup/testsuite/winsup.api/ltp/read04.c
    winsup/testsuite/winsup.api/ltp/readdir01.c
    winsup/testsuite/winsup.api/ltp/readlink01.c
    winsup/testsuite/winsup.api/ltp/readlink02.c
    winsup/testsuite/winsup.api/ltp/readlink03.c
    winsup/testsuite/winsup.api/ltp/rename01.c
    winsup/testsuite/winsup.api/ltp/rename02.c
    winsup/testsuite/winsup.api/ltp/rename08.c
    winsup/testsuite/winsup.api/ltp/rename10.c
    winsup/testsuite/winsup.api/ltp/rmdir01.c
    winsup/testsuite/winsup.api/ltp/rmdir04.c
    winsup/testsuite/winsup.api/ltp/rmdir05.c
    winsup/testsuite/winsup.api/ltp/sbrk01.c
    winsup/testsuite/winsup.api/ltp/select01.c
    winsup/testsuite/winsup.api/ltp/select02.c
    winsup/testsuite/winsup.api/ltp/select03.c
    winsup/testsuite/winsup.api/ltp/setgid01.c
    winsup/testsuite/winsup.api/ltp/setgroups01.c
    winsup/testsuite/winsup.api/ltp/setpgid01.c
    winsup/testsuite/winsup.api/ltp/setregid01.c
    winsup/testsuite/winsup.api/ltp/setreuid01.c
    winsup/testsuite/winsup.api/ltp/setuid01.c
    winsup/testsuite/winsup.api/ltp/setuid02.c
    winsup/testsuite/winsup.api/ltp/signal03.c
    winsup/testsuite/winsup.api/ltp/stat01.c
    winsup/testsuite/winsup.api/ltp/stat02.c
    winsup/testsuite/winsup.api/ltp/stat03.c
    winsup/testsuite/winsup.api/ltp/stat05.c
    winsup/testsuite/winsup.api/ltp/stat06.c
    winsup/testsuite/winsup.api/ltp/symlink01.c
    winsup/testsuite/winsup.api/ltp/symlink02.c
    winsup/testsuite/winsup.api/ltp/symlink03.c
    winsup/testsuite/winsup.api/ltp/symlink04.c
    winsup/testsuite/winsup.api/ltp/symlink05.c
    winsup/testsuite/winsup.api/ltp/sync01.c
    winsup/testsuite/winsup.api/ltp/sync02.c
    winsup/testsuite/winsup.api/ltp/time01.c
    winsup/testsuite/winsup.api/ltp/time02.c
    winsup/testsuite/winsup.api/ltp/times01.c
    winsup/testsuite/winsup.api/ltp/times02.c
    winsup/testsuite/winsup.api/ltp/times03.c
    winsup/testsuite/winsup.api/ltp/truncate01.c
    winsup/testsuite/winsup.api/ltp/truncate02.c
    winsup/testsuite/winsup.api/ltp/ulimit01.c
    winsup/testsuite/winsup.api/ltp/umask01.c
    winsup/testsuite/winsup.api/ltp/umask02.c
    winsup/testsuite/winsup.api/ltp/umask03.c
    winsup/testsuite/winsup.api/ltp/uname01.c
    winsup/testsuite/winsup.api/ltp/unlink05.c
    winsup/testsuite/winsup.api/ltp/unlink06.c
    winsup/testsuite/winsup.api/ltp/unlink07.c
    winsup/testsuite/winsup.api/ltp/unlink08.c
    winsup/testsuite/winsup.api/ltp/vfork01.c
    winsup/testsuite/winsup.api/ltp/wait02.c
    winsup/testsuite/winsup.api/ltp/wait401.c
    winsup/testsuite/winsup.api/ltp/wait402.c
    winsup/testsuite/winsup.api/ltp/write01.c
    winsup/testsuite/winsup.api/ltp/write02.c
    winsup/testsuite/winsup.api/ltp/write03.c
    winsup/testsuite/winsup.api/mmaptest01.c
    winsup/testsuite/winsup.api/mmaptest02.c
    winsup/testsuite/winsup.api/mmaptest03.c
    winsup/testsuite/winsup.api/mmaptest04.c
    winsup/testsuite/winsup.api/msgtest.c
    winsup/testsuite/winsup.api/nullgetcwd.c
    winsup/testsuite/winsup.api/pthread/cancel1.c
    winsup/testsuite/winsup.api/pthread/cancel10.c
    winsup/testsuite/winsup.api/pthread/cancel11.c
    winsup/testsuite/winsup.api/pthread/cancel12.c
    winsup/testsuite/winsup.api/pthread/cancel2.c
    winsup/testsuite/winsup.api/pthread/cancel3.c
    winsup/testsuite/winsup.api/pthread/cancel4.c
    winsup/testsuite/winsup.api/pthread/cancel5.c
    winsup/testsuite/winsup.api/pthread/cancel6.c
    winsup/testsuite/winsup.api/pthread/cancel7.c
    winsup/testsuite/winsup.api/pthread/cancel8.c
    winsup/testsuite/winsup.api/pthread/cancel9.c
    winsup/testsuite/winsup.api/pthread/cleanup2.c
    winsup/testsuite/winsup.api/pthread/cleanup3.c
    winsup/testsuite/winsup.api/pthread/condvar1.c
    winsup/testsuite/winsup.api/pthread/condvar2.c
    winsup/testsuite/winsup.api/pthread/condvar2_1.c
    winsup/testsuite/winsup.api/pthread/condvar3.c
    winsup/testsuite/winsup.api/pthread/condvar3_1.c
    winsup/testsuite/winsup.api/pthread/condvar3_2.c
    winsup/testsuite/winsup.api/pthread/condvar3_3.c
    winsup/testsuite/winsup.api/pthread/condvar4.c
    winsup/testsuite/winsup.api/pthread/condvar5.c
    winsup/testsuite/winsup.api/pthread/condvar6.c
    winsup/testsuite/winsup.api/pthread/condvar7.c
    winsup/testsuite/winsup.api/pthread/condvar8.c
    winsup/testsuite/winsup.api/pthread/condvar9.c
    winsup/testsuite/winsup.api/pthread/count1.c
    winsup/testsuite/winsup.api/pthread/create1.c
    winsup/testsuite/winsup.api/pthread/create2.c
    winsup/testsuite/winsup.api/pthread/equal1.c
    winsup/testsuite/winsup.api/pthread/exit1.c
    winsup/testsuite/winsup.api/pthread/exit2.c
    winsup/testsuite/winsup.api/pthread/exit3.c
    winsup/testsuite/winsup.api/pthread/inherit1.c
    winsup/testsuite/winsup.api/pthread/join0.c
    winsup/testsuite/winsup.api/pthread/join1.c
    winsup/testsuite/winsup.api/pthread/join2.c
    winsup/testsuite/winsup.api/pthread/mainthreadexits.c
    winsup/testsuite/winsup.api/pthread/mutex1.c
    winsup/testsuite/winsup.api/pthread/mutex1d.c
    winsup/testsuite/winsup.api/pthread/mutex1e.c
    winsup/testsuite/winsup.api/pthread/mutex1n.c
    winsup/testsuite/winsup.api/pthread/mutex1r.c
    winsup/testsuite/winsup.api/pthread/mutex2.c
    winsup/testsuite/winsup.api/pthread/mutex3.c
    winsup/testsuite/winsup.api/pthread/mutex4.c
    winsup/testsuite/winsup.api/pthread/mutex5.c
    winsup/testsuite/winsup.api/pthread/mutex6d.c
    winsup/testsuite/winsup.api/pthread/mutex6e.c
    winsup/testsuite/winsup.api/pthread/mutex6n.c
    winsup/testsuite/winsup.api/pthread/mutex6r.c
    winsup/testsuite/winsup.api/pthread/mutex7.c
    winsup/testsuite/winsup.api/pthread/mutex7d.c
    winsup/testsuite/winsup.api/pthread/mutex7e.c
    winsup/testsuite/winsup.api/pthread/mutex7n.c
    winsup/testsuite/winsup.api/pthread/mutex7r.c
    winsup/testsuite/winsup.api/pthread/mutex8e.c
    winsup/testsuite/winsup.api/pthread/mutex8n.c
    winsup/testsuite/winsup.api/pthread/mutex8r.c
    winsup/testsuite/winsup.api/pthread/once1.c
    winsup/testsuite/winsup.api/pthread/priority1.c
    winsup/testsuite/winsup.api/pthread/priority2.c
    winsup/testsuite/winsup.api/pthread/rwlock1.c
    winsup/testsuite/winsup.api/pthread/rwlock2.c
    winsup/testsuite/winsup.api/pthread/rwlock3.c
    winsup/testsuite/winsup.api/pthread/rwlock4.c
    winsup/testsuite/winsup.api/pthread/rwlock5.c
    winsup/testsuite/winsup.api/pthread/rwlock6.c
    winsup/testsuite/winsup.api/pthread/rwlock7.c
    winsup/testsuite/winsup.api/pthread/self1.c
    winsup/testsuite/winsup.api/pthread/self2.c
    winsup/testsuite/winsup.api/pthread/test.h
    winsup/testsuite/winsup.api/pthread/threadidafterfork.c
    winsup/testsuite/winsup.api/pthread/tsd1.c
    winsup/testsuite/winsup.api/resethand.c
    winsup/testsuite/winsup.api/samples/sample-fail.c
    winsup/testsuite/winsup.api/samples/sample-miscompile.c
    winsup/testsuite/winsup.api/samples/sample-pass.c
    winsup/testsuite/winsup.api/semtest.c
    winsup/testsuite/winsup.api/shmtest.c
    winsup/testsuite/winsup.api/sigchld.c
    winsup/testsuite/winsup.api/signal-into-win32-api.c
    winsup/testsuite/winsup.api/systemcall.c
    winsup/testsuite/winsup.api/user_malloc.c
    winsup/testsuite/winsup.api/waitpid.c
    winsup/testsuite/winsup.api/winsup.exp
    winsup/utils/ChangeLog
    winsup/utils/ChangeLog-2000
    winsup/utils/Makefile.in
    winsup/utils/aclocal.m4
    winsup/utils/configure
    winsup/utils/configure.in
    winsup/utils/cygcheck.cc
    winsup/utils/cygpath.cc
    winsup/utils/dump_setup.cc
    winsup/utils/dumper.cc
    winsup/utils/dumper.h
    winsup/utils/getfacl.c
    winsup/utils/ipcrm.c
    winsup/utils/ipcs.c
    winsup/utils/kill.cc
    winsup/utils/mkgroup.c
    winsup/utils/mkpasswd.c
    winsup/utils/module_info.cc
    winsup/utils/mount.cc
    winsup/utils/parse_pe.cc
    winsup/utils/passwd.c
    winsup/utils/path.cc
    winsup/utils/path.h
    winsup/utils/ps.cc
    winsup/utils/regtool.cc
    winsup/utils/setfacl.c
    winsup/utils/setmetamode.c
    winsup/utils/ssp.c
    winsup/utils/ssp.txt
    winsup/utils/strace.cc
    winsup/utils/umount.cc
    winsup/utils/utils.sgml
    winsup/w32api/CONTRIBUTIONS
    winsup/w32api/ChangeLog
    winsup/w32api/Makefile.in
    winsup/w32api/README.w32api
    winsup/w32api/TODO
    winsup/w32api/aclocal.m4
    winsup/w32api/config.guess
    winsup/w32api/config.sub
    winsup/w32api/configure
    winsup/w32api/configure.in
    winsup/w32api/include/GL/gl.h
    winsup/w32api/include/GL/glext.h
    winsup/w32api/include/GL/glu.h
    winsup/w32api/include/accctrl.h
    winsup/w32api/include/aclapi.h
    winsup/w32api/include/aclui.h
    winsup/w32api/include/adsprop.h
    winsup/w32api/include/afxres.h
    winsup/w32api/include/amaudio.h
    winsup/w32api/include/amvideo.h
    winsup/w32api/include/audevcod.h
    winsup/w32api/include/aviriff.h
    winsup/w32api/include/aygshell.h
    winsup/w32api/include/basetsd.h
    winsup/w32api/include/basetyps.h
    winsup/w32api/include/bdatypes.h
    winsup/w32api/include/cderr.h
    winsup/w32api/include/cguid.h
    winsup/w32api/include/cmnquery.h
    winsup/w32api/include/comcat.h
    winsup/w32api/include/commctrl.h
    winsup/w32api/include/commdlg.h
    winsup/w32api/include/control.h
    winsup/w32api/include/cpl.h
    winsup/w32api/include/cplext.h
    winsup/w32api/include/custcntl.h
    winsup/w32api/include/dbt.h
    winsup/w32api/include/dde.h
    winsup/w32api/include/ddeml.h
    winsup/w32api/include/ddk/atm.h
    winsup/w32api/include/ddk/batclass.h
    winsup/w32api/include/ddk/cfg.h
    winsup/w32api/include/ddk/cfgmgr32.h
    winsup/w32api/include/ddk/d4drvif.h
    winsup/w32api/include/ddk/d4iface.h
    winsup/w32api/include/ddk/ddkmapi.h
    winsup/w32api/include/ddk/hidclass.h
    winsup/w32api/include/ddk/hidpi.h
    winsup/w32api/include/ddk/hidsdi.h
    winsup/w32api/include/ddk/hidusage.h
    winsup/w32api/include/ddk/kbdmou.h
    winsup/w32api/include/ddk/mcd.h
    winsup/w32api/include/ddk/miniport.h
    winsup/w32api/include/ddk/minitape.h
    winsup/w32api/include/ddk/mountdev.h
    winsup/w32api/include/ddk/mountmgr.h
    winsup/w32api/include/ddk/ndis.h
    winsup/w32api/include/ddk/ndisguid.h
    winsup/w32api/include/ddk/ndistapi.h
    winsup/w32api/include/ddk/ndiswan.h
    winsup/w32api/include/ddk/netevent.h
    winsup/w32api/include/ddk/netpnp.h
    winsup/w32api/include/ddk/newdev.h
    winsup/w32api/include/ddk/ntapi.h
    winsup/w32api/include/ddk/ntdd8042.h
    winsup/w32api/include/ddk/ntddbeep.h
    winsup/w32api/include/ddk/ntddcdrm.h
    winsup/w32api/include/ddk/ntddcdvd.h
    winsup/w32api/include/ddk/ntddchgr.h
    winsup/w32api/include/ddk/ntdddisk.h
    winsup/w32api/include/ddk/ntddk.h
    winsup/w32api/include/ddk/ntddkbd.h
    winsup/w32api/include/ddk/ntddmou.h
    winsup/w32api/include/ddk/ntddndis.h
    winsup/w32api/include/ddk/ntddpar.h
    winsup/w32api/include/ddk/ntddpcm.h
    winsup/w32api/include/ddk/ntddscsi.h
    winsup/w32api/include/ddk/ntddser.h
    winsup/w32api/include/ddk/ntddstor.h
    winsup/w32api/include/ddk/ntddtape.h
    winsup/w32api/include/ddk/ntddtdi.h
    winsup/w32api/include/ddk/ntddvdeo.h
    winsup/w32api/include/ddk/ntddvol.h
    winsup/w32api/include/ddk/ntifs.h
    winsup/w32api/include/ddk/ntpoapi.h
    winsup/w32api/include/ddk/ntstatus.h
    winsup/w32api/include/ddk/parallel.h
    winsup/w32api/include/ddk/pfhook.h
    winsup/w32api/include/ddk/poclass.h
    winsup/w32api/include/ddk/scsi.h
    winsup/w32api/include/ddk/scsiscan.h
    winsup/w32api/include/ddk/scsiwmi.h
    winsup/w32api/include/ddk/smbus.h
    winsup/w32api/include/ddk/srb.h
    winsup/w32api/include/ddk/storport.h
    winsup/w32api/include/ddk/tdi.h
    winsup/w32api/include/ddk/tdiinfo.h
    winsup/w32api/include/ddk/tdikrnl.h
    winsup/w32api/include/ddk/tdistat.h
    winsup/w32api/include/ddk/tvout.h
    winsup/w32api/include/ddk/upssvc.h
    winsup/w32api/include/ddk/usb.h
    winsup/w32api/include/ddk/usb100.h
    winsup/w32api/include/ddk/usbcamdi.h
    winsup/w32api/include/ddk/usbdi.h
    winsup/w32api/include/ddk/usbioctl.h
    winsup/w32api/include/ddk/usbiodef.h
    winsup/w32api/include/ddk/usbscan.h
    winsup/w32api/include/ddk/usbuser.h
    winsup/w32api/include/ddk/video.h
    winsup/w32api/include/ddk/videoagp.h
    winsup/w32api/include/ddk/win2k.h
    winsup/w32api/include/ddk/winddi.h
    winsup/w32api/include/ddk/winddk.h
    winsup/w32api/include/ddk/winnt4.h
    winsup/w32api/include/ddk/winxp.h
    winsup/w32api/include/ddk/ws2san.h
    winsup/w32api/include/ddk/xfilter.h
    winsup/w32api/include/devguid.h
    winsup/w32api/include/dhcpcsdk.h
    winsup/w32api/include/directx/d3d9.h
    winsup/w32api/include/directx/d3d9caps.h
    winsup/w32api/include/directx/d3d9types.h
    winsup/w32api/include/directx/dxerr8.h
    winsup/w32api/include/directx/dxerr9.h
    winsup/w32api/include/dlgs.h
    winsup/w32api/include/docobj.h
    winsup/w32api/include/dsadmin.h
    winsup/w32api/include/dsclient.h
    winsup/w32api/include/dsgetdc.h
    winsup/w32api/include/dshow.h
    winsup/w32api/include/dsquery.h
    winsup/w32api/include/dsrole.h
    winsup/w32api/include/dvdevcod.h
    winsup/w32api/include/dvdmedia.h
    winsup/w32api/include/edevdefs.h
    winsup/w32api/include/errorrep.h
    winsup/w32api/include/errors.h
    winsup/w32api/include/evcode.h
    winsup/w32api/include/exdisp.h
    winsup/w32api/include/exdispid.h
    winsup/w32api/include/fltdefs.h
    winsup/w32api/include/httpext.h
    winsup/w32api/include/icm.h
    winsup/w32api/include/idispids.h
    winsup/w32api/include/il21dec.h
    winsup/w32api/include/imagehlp.h
    winsup/w32api/include/imm.h
    winsup/w32api/include/initguid.h
    winsup/w32api/include/intshcut.h
    winsup/w32api/include/ipexport.h
    winsup/w32api/include/iphlpapi.h
    winsup/w32api/include/ipifcons.h
    winsup/w32api/include/ipinfoid.h
    winsup/w32api/include/iprtrmib.h
    winsup/w32api/include/iptypes.h
    winsup/w32api/include/ipxconst.h
    winsup/w32api/include/ipxrtdef.h
    winsup/w32api/include/ipxtfflt.h
    winsup/w32api/include/isguids.h
    winsup/w32api/include/ks.h
    winsup/w32api/include/ksmedia.h
    winsup/w32api/include/largeint.h
    winsup/w32api/include/lm.h
    winsup/w32api/include/lmaccess.h
    winsup/w32api/include/lmalert.h
    winsup/w32api/include/lmapibuf.h
    winsup/w32api/include/lmat.h
    winsup/w32api/include/lmaudit.h
    winsup/w32api/include/lmbrowsr.h
    winsup/w32api/include/lmchdev.h
    winsup/w32api/include/lmconfig.h
    winsup/w32api/include/lmcons.h
    winsup/w32api/include/lmerr.h
    winsup/w32api/include/lmerrlog.h
    winsup/w32api/include/lmmsg.h
    winsup/w32api/include/lmremutl.h
    winsup/w32api/include/lmrepl.h
    winsup/w32api/include/lmserver.h
    winsup/w32api/include/lmshare.h
    winsup/w32api/include/lmsname.h
    winsup/w32api/include/lmstats.h
    winsup/w32api/include/lmsvc.h
    winsup/w32api/include/lmuse.h
    winsup/w32api/include/lmuseflg.h
    winsup/w32api/include/lmwksta.h
    winsup/w32api/include/lzexpand.h
    winsup/w32api/include/mapi.h
    winsup/w32api/include/mciavi.h
    winsup/w32api/include/mcx.h
    winsup/w32api/include/mgm.h
    winsup/w32api/include/mgmtapi.h
    winsup/w32api/include/mlang.h
    winsup/w32api/include/mmreg.h
    winsup/w32api/include/mmsystem.h
    winsup/w32api/include/mpegtype.h
    winsup/w32api/include/mprapi.h
    winsup/w32api/include/mq.h
    winsup/w32api/include/msacm.h
    winsup/w32api/include/mshtml.h
    winsup/w32api/include/mswsock.h
    winsup/w32api/include/nb30.h
    winsup/w32api/include/nddeapi.h
    winsup/w32api/include/nspapi.h
    winsup/w32api/include/ntdef.h
    winsup/w32api/include/ntdll.h
    winsup/w32api/include/ntdsapi.h
    winsup/w32api/include/ntdsbcli.h
    winsup/w32api/include/ntldap.h
    winsup/w32api/include/ntsecapi.h
    winsup/w32api/include/ntsecpkg.h
    winsup/w32api/include/oaidl.h
    winsup/w32api/include/objbase.h
    winsup/w32api/include/objfwd.h
    winsup/w32api/include/objidl.h
    winsup/w32api/include/objsafe.h
    winsup/w32api/include/objsel.h
    winsup/w32api/include/ocidl.h
    winsup/w32api/include/odbcinst.h
    winsup/w32api/include/ole.h
    winsup/w32api/include/ole2.h
    winsup/w32api/include/ole2ver.h
    winsup/w32api/include/oleacc.h
    winsup/w32api/include/oleauto.h
    winsup/w32api/include/olectl.h
    winsup/w32api/include/olectlid.h
    winsup/w32api/include/oledlg.h
    winsup/w32api/include/oleidl.h
    winsup/w32api/include/pbt.h
    winsup/w32api/include/poppack.h
    winsup/w32api/include/powrprof.h
    winsup/w32api/include/prsht.h
    winsup/w32api/include/psapi.h
    winsup/w32api/include/pshpack1.h
    winsup/w32api/include/pshpack2.h
    winsup/w32api/include/pshpack4.h
    winsup/w32api/include/pshpack8.h
    winsup/w32api/include/qedit.h
    winsup/w32api/include/rapi.h
    winsup/w32api/include/ras.h
    winsup/w32api/include/rasdlg.h
    winsup/w32api/include/raserror.h
    winsup/w32api/include/rassapi.h
    winsup/w32api/include/reason.h
    winsup/w32api/include/regstr.h
    winsup/w32api/include/richedit.h
    winsup/w32api/include/richole.h
    winsup/w32api/include/routprot.h
    winsup/w32api/include/rpc.h
    winsup/w32api/include/rpcdce.h
    winsup/w32api/include/rpcdce2.h
    winsup/w32api/include/rpcdcep.h
    winsup/w32api/include/rpcndr.h
    winsup/w32api/include/rpcnsi.h
    winsup/w32api/include/rpcnsip.h
    winsup/w32api/include/rpcnterr.h
    winsup/w32api/include/rpcproxy.h
    winsup/w32api/include/rtutils.h
    winsup/w32api/include/schannel.h
    winsup/w32api/include/schnlsp.h
    winsup/w32api/include/scrnsave.h
    winsup/w32api/include/sddl.h
    winsup/w32api/include/secext.h
    winsup/w32api/include/security.h
    winsup/w32api/include/servprov.h
    winsup/w32api/include/setupapi.h
    winsup/w32api/include/shellapi.h
    winsup/w32api/include/shldisp.h
    winsup/w32api/include/shlguid.h
    winsup/w32api/include/shlobj.h
    winsup/w32api/include/shlwapi.h
    winsup/w32api/include/snmp.h
    winsup/w32api/include/sql.h
    winsup/w32api/include/sqlext.h
    winsup/w32api/include/sqltypes.h
    winsup/w32api/include/sqlucode.h
    winsup/w32api/include/sspi.h
    winsup/w32api/include/stm.h
    winsup/w32api/include/strmif.h
    winsup/w32api/include/subauth.h
    winsup/w32api/include/svcguid.h
    winsup/w32api/include/tlhelp32.h
    winsup/w32api/include/tmschema.h
    winsup/w32api/include/unknwn.h
    winsup/w32api/include/userenv.h
    winsup/w32api/include/usp10.h
    winsup/w32api/include/uxtheme.h
    winsup/w32api/include/vfw.h
    winsup/w32api/include/vidcap.h
    winsup/w32api/include/vmr9.h
    winsup/w32api/include/vptype.h
    winsup/w32api/include/w32api.h
    winsup/w32api/include/winable.h
    winsup/w32api/include/winbase.h
    winsup/w32api/include/winber.h
    winsup/w32api/include/wincon.h
    winsup/w32api/include/wincrypt.h
    winsup/w32api/include/windef.h
    winsup/w32api/include/windns.h
    winsup/w32api/include/windows.h
    winsup/w32api/include/windowsx.h
    winsup/w32api/include/winerror.h
    winsup/w32api/include/wingdi.h
    winsup/w32api/include/wininet.h
    winsup/w32api/include/winioctl.h
    winsup/w32api/include/winldap.h
    winsup/w32api/include/winnetwk.h
    winsup/w32api/include/winnls.h
    winsup/w32api/include/winnt.h
    winsup/w32api/include/winperf.h
    winsup/w32api/include/winreg.h
    winsup/w32api/include/winresrc.h
    winsup/w32api/include/winsnmp.h
    winsup/w32api/include/winsock.h
    winsup/w32api/include/winsock2.h
    winsup/w32api/include/winspool.h
    winsup/w32api/include/winsvc.h
    winsup/w32api/include/winuser.h
    winsup/w32api/include/winver.h
    winsup/w32api/include/ws2spi.h
    winsup/w32api/include/ws2tcpip.h
    winsup/w32api/include/wsahelp.h
    winsup/w32api/include/wsipx.h
    winsup/w32api/include/wsnetbs.h
    winsup/w32api/include/wtypes.h
    winsup/w32api/include/xprtdefs.h
    winsup/w32api/include/zmouse.h
    winsup/w32api/install-sh
    winsup/w32api/lib/Makefile.in
    winsup/w32api/lib/aclui.def
    winsup/w32api/lib/advapi32.def
    winsup/w32api/lib/ativscp-uuid.c
    winsup/w32api/lib/avicap32.def
    winsup/w32api/lib/avifil32.def
    winsup/w32api/lib/cap.def
    winsup/w32api/lib/cguid-uuid.c
    winsup/w32api/lib/comcat-uuid.c
    winsup/w32api/lib/comctl32.def
    winsup/w32api/lib/comdlg32.def
    winsup/w32api/lib/crypt32.def
    winsup/w32api/lib/ctl3d32.def
    winsup/w32api/lib/ddk/Makefile.in
    winsup/w32api/lib/ddk/apcups.def
    winsup/w32api/lib/ddk/cfgmgr32.def
    winsup/w32api/lib/ddk/dxapi.def
    winsup/w32api/lib/ddk/hal.def
    winsup/w32api/lib/ddk/hid.def
    winsup/w32api/lib/ddk/hidparse.def
    winsup/w32api/lib/ddk/mcd.def
    winsup/w32api/lib/ddk/ndis.def
    winsup/w32api/lib/ddk/newdev.def
    winsup/w32api/lib/ddk/ntoskrnl.def
    winsup/w32api/lib/ddk/scsiport.def
    winsup/w32api/lib/ddk/tdi.def
    winsup/w32api/lib/ddk/usbcamd.def
    winsup/w32api/lib/ddk/usbcamd2.def
    winsup/w32api/lib/ddk/videoprt.def
    winsup/w32api/lib/ddk/win32k.def
    winsup/w32api/lib/devguid.c
    winsup/w32api/lib/dhcpcsvc.def
    winsup/w32api/lib/directx/Makefile.in
    winsup/w32api/lib/directx/d3d8.def
    winsup/w32api/lib/directx/d3d9.def
    winsup/w32api/lib/directx/d3dim.def
    winsup/w32api/lib/directx/d3drm.def
    winsup/w32api/lib/directx/d3dx8d.def
    winsup/w32api/lib/directx/d3dx9d.def
    winsup/w32api/lib/directx/d3dxof.def
    winsup/w32api/lib/directx/ddraw.def
    winsup/w32api/lib/directx/dinput.def
    winsup/w32api/lib/directx/dinput8.def
    winsup/w32api/lib/directx/dinput_joy.c
    winsup/w32api/lib/directx/dinput_joy2.c
    winsup/w32api/lib/directx/dinput_kbd.c
    winsup/w32api/lib/directx/dinput_mouse.c
    winsup/w32api/lib/directx/dinput_mouse2.c
    winsup/w32api/lib/directx/dinput_private.h
    winsup/w32api/lib/directx/dmoguids.c
    winsup/w32api/lib/directx/dplayx.def
    winsup/w32api/lib/directx/dpnaddr.def
    winsup/w32api/lib/directx/dpnet.def
    winsup/w32api/lib/directx/dpnlobby.def
    winsup/w32api/lib/directx/dpvoice.def
    winsup/w32api/lib/directx/dsetup.def
    winsup/w32api/lib/directx/dsound.def
    winsup/w32api/lib/directx/dxerr.c
    winsup/w32api/lib/directx/dxerr8.c
    winsup/w32api/lib/directx/dxerr8w.c
    winsup/w32api/lib/directx/dxerr9.c
    winsup/w32api/lib/directx/dxerr9w.c
    winsup/w32api/lib/directx/dxguid.c
    winsup/w32api/lib/directx/ksproxy.def
    winsup/w32api/lib/directx/ksuser.c
    winsup/w32api/lib/directx/ksuser.def
    winsup/w32api/lib/directx/msdmo.def
    winsup/w32api/lib/directx/strmiids.c
    winsup/w32api/lib/directx/test.c
    winsup/w32api/lib/dlcapi.def
    winsup/w32api/lib/dnsapi.def
    winsup/w32api/lib/docobj-uuid.c
    winsup/w32api/lib/exdisp-uuid.c
    winsup/w32api/lib/extras-uuid.c
    winsup/w32api/lib/faultrep.def
    winsup/w32api/lib/gdi32.def
    winsup/w32api/lib/glaux.def
    winsup/w32api/lib/glu32.def
    winsup/w32api/lib/glut.def
    winsup/w32api/lib/glut32.def
    winsup/w32api/lib/hlguids-uuid.c
    winsup/w32api/lib/hlink-uuid.c
    winsup/w32api/lib/icmui.def
    winsup/w32api/lib/igmpagnt.def
    winsup/w32api/lib/imagehlp.def
    winsup/w32api/lib/imm32.def
    winsup/w32api/lib/iphlpapi.def
    winsup/w32api/lib/kernel32.c
    winsup/w32api/lib/kernel32.def
    winsup/w32api/lib/largeint.c
    winsup/w32api/lib/lz32.def
    winsup/w32api/lib/mapi32.def
    winsup/w32api/lib/mfcuia32.def
    winsup/w32api/lib/mgmtapi.def
    winsup/w32api/lib/mlang-uuid.c
    winsup/w32api/lib/mpr.def
    winsup/w32api/lib/mprapi.def
    winsup/w32api/lib/mqrt.def
    winsup/w32api/lib/msacm32.def
    winsup/w32api/lib/mscms.def
    winsup/w32api/lib/mshtml-uuid.c
    winsup/w32api/lib/msimg32.def
    winsup/w32api/lib/msvcp60.def
    winsup/w32api/lib/msvfw32.def
    winsup/w32api/lib/mswsock.def
    winsup/w32api/lib/msxml-uuid.c
    winsup/w32api/lib/nddeapi.def
    winsup/w32api/lib/netapi32.def
    winsup/w32api/lib/ntdll.def
    winsup/w32api/lib/oaidl-uuid.c
    winsup/w32api/lib/objidl-uuid.c
    winsup/w32api/lib/objsafe-uuid.c
    winsup/w32api/lib/ocidl-uuid.c
    winsup/w32api/lib/odbc32.def
    winsup/w32api/lib/odbccp32.def
    winsup/w32api/lib/ole32.def
    winsup/w32api/lib/oleacc-uuid.c
    winsup/w32api/lib/oleacc.def
    winsup/w32api/lib/oleaut32.def
    winsup/w32api/lib/olecli32.def
    winsup/w32api/lib/olectlid-uuid.c
    winsup/w32api/lib/oledlg.def
    winsup/w32api/lib/oleidl-uuid.c
    winsup/w32api/lib/olepro32.def
    winsup/w32api/lib/olesvr32.def
    winsup/w32api/lib/opengl32.def
    winsup/w32api/lib/penwin32.def
    winsup/w32api/lib/pkpd32.def
    winsup/w32api/lib/powrprof.def
    winsup/w32api/lib/psapi.def
    winsup/w32api/lib/quartz.def
    winsup/w32api/lib/rapi.def
    winsup/w32api/lib/rasapi32.def
    winsup/w32api/lib/rasdlg.def
    winsup/w32api/lib/res.rc
    winsup/w32api/lib/rpcdce4.def
    winsup/w32api/lib/rpcns4.def
    winsup/w32api/lib/rpcrt4.def
    winsup/w32api/lib/rtm.def
    winsup/w32api/lib/rtutils.def
    winsup/w32api/lib/scrnsave.c
    winsup/w32api/lib/secur32.def
    winsup/w32api/lib/servprov-uuid.c
    winsup/w32api/lib/setupapi.def
    winsup/w32api/lib/shell32.c
    winsup/w32api/lib/shell32.def
    winsup/w32api/lib/shfolder.def
    winsup/w32api/lib/shlwapi.def
    winsup/w32api/lib/snmpapi.def
    winsup/w32api/lib/svrapi.def
    winsup/w32api/lib/tapi32.def
    winsup/w32api/lib/test.c
    winsup/w32api/lib/th32.def
    winsup/w32api/lib/thunk32.def
    winsup/w32api/lib/unknwn-uuid.c
    winsup/w32api/lib/url.def
    winsup/w32api/lib/urlmon-uuid.c
    winsup/w32api/lib/user32.def
    winsup/w32api/lib/userenv.def
    winsup/w32api/lib/usp10.def
    winsup/w32api/lib/uxtheme.def
    winsup/w32api/lib/vdmdbg.def
    winsup/w32api/lib/version.def
    winsup/w32api/lib/vfw32.mri
    winsup/w32api/lib/win32spl.def
    winsup/w32api/lib/wininet.def
    winsup/w32api/lib/winmm.def
    winsup/w32api/lib/winspool.def
    winsup/w32api/lib/winstrm.def
    winsup/w32api/lib/wldap32.def
    winsup/w32api/lib/wow32.def
    winsup/w32api/lib/ws2_32.c
    winsup/w32api/lib/ws2_32.def
    winsup/w32api/lib/wsnmp32.def
    winsup/w32api/lib/wsock32.def
    winsup/w32api/lib/wst.def
    winsup/w32api/lib/wtsapi32.def

1 files changed, 0 insertions, 3815 deletions

diff --git a/winsup/cygwin/dlmalloc.c b/winsup/cygwin/dlmalloc.c
deleted file mode 100644
index b64bed8eb..000000000
--- a/winsup/cygwin/dlmalloc.c
+++ /dev/null
@@ -1,3815 +0,0 @@
-/*
- * To do:
- *  - strdup?  maybe shouldn't bother yet, it seems difficult to get includes
- *    right using dlmalloc.h
- *  - add STD_C prototyping
- *  - adhere to comment conventions
- *  - maybe fix ALLOCFILL vs. MOATFILL in do_init_realloced_chunk()
- *  - keep a list of mmaped regions for checking in malloc_update_mallinfo()
- *  - I think memalign() is wrong: it aligns the chunk rather than the memory
- *    portion of the chunk.
- *  - "& -alignment" in memalign() is suspect: should use "& ~alignment"
- *    instead?
- *  - malloc.h doesn't need malloc_COPY or probably a bunch of other stuff
- *  - add mallopt options for e.g. fill?
- *  - come up with a non-BBC version of M_C
- *  - document necessity of checking chunk address in do_check_chunk prior to
- *    accessing any of its fields
- * Done:
- *  minor speedup due to extend check before mremap
- *  minor speedup due to returning malloc() result in memalign() if aligned
- *  made malloc_update_mallinfo() check alloced regions at start of sbrk area
- *  fixed bug: After discovering foreign sbrk, if old_top was MINSIZE, would
- *    reduce old_top_size to 0, thus making inuse(old_top) return 0; other
- *    functions would consequently attempt to access old_top->{fd,bk}, which
- *    were invalid.  This is in malloc_extend_top(), in the "double
- *    fencepost" section.
- * Documentation:
- *  malloc_usable_size(P) is equivalent to realloc(P, malloc_usable_size(P))
- *
- * $Log$
- * Revision 1.9  2004/05/12 16:21:18  cgf
- * remove keyword stuff
- *
- * Revision 1.1  1997/12/24 18:34:47  nsd
- * Initial revision
- *
- */
-/* ---------- To make a malloc.h, start cutting here ------------ */
-
-/*
-  A version of malloc/free/realloc written by Doug Lea and released to the
-  public domain.  Send questions/comments/complaints/performance data
-  to dl@cs.oswego.edu
-
-* VERSION 2.6.4  Thu Nov 28 07:54:55 1996  Doug Lea  (dl at gee)
-
-   Note: There may be an updated version of this malloc obtainable at
-	   ftp://g.oswego.edu/pub/misc/malloc.c
-	 Check before installing!
-
-* Why use this malloc?
-
-  This is not the fastest, most space-conserving, most portable, or
-  most tunable malloc ever written. However it is among the fastest
-  while also being among the most space-conserving, portable and tunable.
-  Consistent balance across these factors results in a good general-purpose
-  allocator. For a high-level description, see
-     http://g.oswego.edu/dl/html/malloc.html
-
-* Synopsis of public routines
-
-  (Much fuller descriptions are contained in the program documentation below.)
-
-  malloc(size_t n);
-     Return a pointer to a newly allocated chunk of at least n bytes, or null
-     if no space is available.
-  free(Void_t* p);
-     Release the chunk of memory pointed to by p, or no effect if p is null.
-  realloc(Void_t* p, size_t n);
-     Return a pointer to a chunk of size n that contains the same data
-     as does chunk p up to the minimum of (n, p's size) bytes, or null
-     if no space is available. The returned pointer may or may not be
-     the same as p. If p is null, equivalent to malloc.  Unless the
-     #define realloc_ZERO_BYTES_FREES below is set, realloc with a
-     size argument of zero (re)allocates a minimum-sized chunk.
-  memalign(size_t alignment, size_t n);
-     Return a pointer to a newly allocated chunk of n bytes, aligned
-     in accord with the alignment argument, which must be a power of
-     two.
-  valloc(size_t n);
-     Equivalent to memalign(pagesize, n), where pagesize is the page
-     size of the system (or as near to this as can be figured out from
-     all the includes/defines below.)
-  pvalloc(size_t n);
-     Equivalent to valloc(minimum-page-that-holds(n)), that is,
-     round up n to nearest pagesize.
-  calloc(size_t unit, size_t quantity);
-     Returns a pointer to quantity * unit bytes, with all locations
-     set to zero.
-  cfree(Void_t* p);
-     Equivalent to free(p).
-  malloc_trim(size_t pad);
-     Release all but pad bytes of freed top-most memory back
-     to the system. Return 1 if successful, else 0.
-  malloc_usable_size(Void_t* p);
-     Report the number usable allocated bytes associated with allocated
-     chunk p. This may or may not report more bytes than were requested,
-     due to alignment and minimum size constraints.
-  malloc_stats();
-     Prints brief summary statistics on stderr.
-  mallinfo()
-     Returns (by copy) a struct containing various summary statistics.
-  mallopt(int parameter_number, int parameter_value)
-     Changes one of the tunable parameters described below. Returns
-     1 if successful in changing the parameter, else 0.
-
-* Vital statistics:
-
-  Alignment:                            8-byte
-       8 byte alignment is currently hardwired into the design.  This
-       seems to suffice for all current machines and C compilers.
-
-  Assumed pointer representation:       4 or 8 bytes
-       Code for 8-byte pointers is untested by me but has worked
-       reliably by Wolfram Gloger, who contributed most of the
-       changes supporting this.
-
-  Assumed size_t  representation:       4 or 8 bytes
-       Note that size_t is allowed to be 4 bytes even if pointers are 8.
-
-  Minimum overhead per allocated chunk: 4 or 8 bytes
-       Each malloced chunk has a hidden overhead of 4 bytes holding size
-       and status information.
-
-  Minimum allocated size: 4-byte ptrs:  16 bytes    (including 4 overhead)
-			  8-byte ptrs:  24/32 bytes (including, 4/8 overhead)
-
-       When a chunk is freed, 12 (for 4byte ptrs) or 20 (for 8 byte
-       ptrs but 4 byte size) or 24 (for 8/8) additional bytes are
-       needed; 4 (8) for a trailing size field
-       and 8 (16) bytes for free list pointers. Thus, the minimum
-       allocatable size is 16/24/32 bytes.
-
-       Even a request for zero bytes (i.e., malloc(0)) returns a
-       pointer to something of the minimum allocatable size.
-
-  Maximum allocated size: 4-byte size_t: 2^31 -  8 bytes
-			  8-byte size_t: 2^63 - 16 bytes
-
-       It is assumed that (possibly signed) size_t bit values suffice to
-       represent chunk sizes. `Possibly signed' is due to the fact
-       that `size_t' may be defined on a system as either a signed or
-       an unsigned type. To be conservative, values that would appear
-       as negative numbers are avoided.
-       Requests for sizes with a negative sign bit will return a
-       minimum-sized chunk.
-
-  Maximum overhead wastage per allocated chunk: normally 15 bytes
-
-       Alignnment demands, plus the minimum allocatable size restriction
-       make the normal worst-case wastage 15 bytes (i.e., up to 15
-       more bytes will be allocated than were requested in malloc), with
-       two exceptions:
-	 1. Because requests for zero bytes allocate non-zero space,
-	    the worst case wastage for a request of zero bytes is 24 bytes.
-	 2. For requests >= mmap_threshold that are serviced via
-	    mmap(), the worst case wastage is 8 bytes plus the remainder
-	    from a system page (the minimal mmap unit); typically 4096 bytes.
-
-* Limitations
-
-    Here are some features that are NOT currently supported
-
-    * No user-definable hooks for callbacks and the like.
-    * No automated mechanism for fully checking that all accesses
-      to malloced memory stay within their bounds.
-    * No support for compaction.
-
-* Synopsis of compile-time options:
-
-    People have reported using previous versions of this malloc on all
-    versions of Unix, sometimes by tweaking some of the defines
-    below. It has been tested most extensively on Solaris and
-    Linux. It is also reported to work on WIN32 platforms.
-    People have also reported adapting this malloc for use in
-    stand-alone embedded systems.
-
-    The implementation is in straight, hand-tuned ANSI C.  Among other
-    consequences, it uses a lot of macros.  Because of this, to be at
-    all usable, this code should be compiled using an optimizing compiler
-    (for example gcc -O2) that can simplify expressions and control
-    paths.
-
-  __STD_C                  (default: derived from C compiler defines)
-     Nonzero if using ANSI-standard C compiler, a C++ compiler, or
-     a C compiler sufficiently close to ANSI to get away with it.
-  DEBUG                    (default: NOT defined)
-     Define to enable debugging. Adds fairly extensive assertion-based
-     checking to help track down memory errors, but noticeably slows down
-     execution.
-  realloc_ZERO_BYTES_FREES (default: NOT defined)
-     Define this if you think that realloc(p, 0) should be equivalent
-     to free(p). Otherwise, since malloc returns a unique pointer for
-     malloc(0), so does realloc(p, 0).
-  HAVE_memcpy               (default: defined)
-     Define if you are not otherwise using ANSI STD C, but still
-     have memcpy and memset in your C library and want to use them.
-     Otherwise, simple internal versions are supplied.
-  USE_memcpy               (default: 1 if HAVE_memcpy is defined, 0 otherwise)
-     Define as 1 if you want the C library versions of memset and
-     memcpy called in realloc and calloc (otherwise macro versions are used).
-     At least on some platforms, the simple macro versions usually
-     outperform libc versions.
-  HAVE_MMAP                 (default: defined as 1)
-     Define to non-zero to optionally make malloc() use mmap() to
-     allocate very large blocks.
-  HAVE_MREMAP                 (default: defined as 0 unless Linux libc set)
-     Define to non-zero to optionally make realloc() use mremap() to
-     reallocate very large blocks.
-  malloc_getpagesize        (default: derived from system #includes)
-     Either a constant or routine call returning the system page size.
-  HAVE_USR_INCLUDE_malloc_H (default: NOT defined)
-     Optionally define if you are on a system with a /usr/include/malloc.h
-     that declares struct mallinfo. It is not at all necessary to
-     define this even if you do, but will ensure consistency.
-  INTERNAL_SIZE_T           (default: size_t)
-     Define to a 32-bit type (probably `unsigned int') if you are on a
-     64-bit machine, yet do not want or need to allow malloc requests of
-     greater than 2^31 to be handled. This saves space, especially for
-     very small chunks.
-  INTERNAL_LINUX_C_LIB      (default: NOT defined)
-     Defined only when compiled as part of Linux libc.
-     Also note that there is some odd internal name-mangling via defines
-     (for example, internally, `malloc' is named `mALLOc') needed
-     when compiling in this case. These look funny but don't otherwise
-     affect anything.
-  WIN32                     (default: undefined)
-     Define this on MS win (95, nt) platforms to compile in sbrk emulation.
-  LACKS_UNISTD_H            (default: undefined)
-     Define this if your system does not have a <unistd.h>.
-  MORECORE                  (default: sbrk)
-     The name of the routine to call to obtain more memory from the system.
-  MORECORE_FAILURE          (default: -1)
-     The value returned upon failure of MORECORE.
-  MORECORE_CLEARS           (default 0)
-     True (1) if the routine mapped to MORECORE zeroes out memory (which
-     holds for sbrk).
-  DEFAULT_TRIM_THRESHOLD
-  DEFAULT_TOP_PAD
-  DEFAULT_MMAP_THRESHOLD
-  DEFAULT_MMAP_MAX
-     Default values of tunable parameters (described in detail below)
-     controlling interaction with host system routines (sbrk, mmap, etc).
-     These values may also be changed dynamically via mallopt(). The
-     preset defaults are those that give best performance for typical
-     programs/systems.
-
-
-*/
-
-
-
-
-/* Preliminaries */
-
-
-#ifndef __STD_C
-#ifdef __STDC__
-#define __STD_C     1
-#else
-#if __cplusplus
-#define __STD_C     1
-#else
-#define __STD_C     0
-#endif /*__cplusplus*/
-#endif /*__STDC__*/
-#endif /*__STD_C*/
-
-#ifndef Void_t
-#if __STD_C
-#define Void_t      void
-#else
-#define Void_t      char
-#endif
-#endif /*Void_t*/
-
-#define __MALLOC_H_INCLUDED
-
-#if __STD_C
-#include <stddef.h>   /* for size_t */
-#else
-#include <sys/types.h>
-#endif
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <sys/types.h>
-#include "cygmalloc.h"
-#define __INSIDE_CYGWIN__
-#include <stdio.h>    /* needed for malloc_stats */
-#include <string.h>
-
-/*
-  Compile-time options
-*/
-
-
-/*
-    Debugging:
-
-    Because freed chunks may be overwritten with link fields, this
-    malloc will often die when freed memory is overwritten by user
-    programs.  This can be very effective (albeit in an annoying way)
-    in helping track down dangling pointers.
-
-    If you compile with -DDEBUG, a number of assertion checks are
-    enabled that will catch more memory errors. You probably won't be
-    able to make much sense of the actual assertion errors, but they
-    should help you locate incorrectly overwritten memory.  The
-    checking is fairly extensive, and will slow down execution
-    noticeably. Calling malloc_stats or mallinfo with DEBUG set will
-    attempt to check every non-mmapped allocated and free chunk in the
-    course of computing the summmaries. (By nature, mmapped regions
-    cannot be checked very much automatically.)
-
-    Setting DEBUG may also be helpful if you are trying to modify
-    this code. The assertions in the check routines spell out in more
-    detail the assumptions and invariants underlying the algorithms.
-
-*/
-
-#ifdef MALLOC_DEBUG
-#define DEBUG	1
-#define DEBUG1	1
-#define DEBUG2	1
-#define DEBUG3	1
-#endif
-
-#if DEBUG
-#include <assert.h>
-#else
-#define assert(x) ((void)0)
-#endif
-
-/*
-  INTERNAL_SIZE_T is the word-size used for internal bookkeeping
-  of chunk sizes. On a 64-bit machine, you can reduce malloc
-  overhead by defining INTERNAL_SIZE_T to be a 32 bit `unsigned int'
-  at the expense of not being able to handle requests greater than
-  2^31. This limitation is hardly ever a concern; you are encouraged
-  to set this. However, the default version is the same as size_t.
-*/
-
-#ifndef INTERNAL_SIZE_T
-#define INTERNAL_SIZE_T size_t
-#endif
-
-/*
-  realloc_ZERO_BYTES_FREES should be set if a call to
-  realloc with zero bytes should be the same as a call to free.
-  Some people think it should. Otherwise, since this malloc
-  returns a unique pointer for malloc(0), so does realloc(p, 0).
-*/
-
-
-/*   #define realloc_ZERO_BYTES_FREES */
-
-
-/*
-  WIN32 causes an emulation of sbrk to be compiled in
-  mmap-based options are not currently supported in WIN32.
-*/
-
-/* #define WIN32 */
-#ifdef WIN32
-#define MORECORE wsbrk
-#define HAVE_MMAP 0
-#endif
-
-
-/*
-  HAVE_memcpy should be defined if you are not otherwise using
-  ANSI STD C, but still have memcpy and memset in your C library
-  and want to use them in calloc and realloc. Otherwise simple
-  macro versions are defined here.
-
-  USE_memcpy should be defined as 1 if you actually want to
-  have memset and memcpy called. People report that the macro
-  versions are often enough faster than libc versions on many
-  systems that it is better to use them.
-
-*/
-
-#define HAVE_memcpy
-
-#ifndef USE_memcpy
-#ifdef HAVE_memcpy
-#define USE_memcpy 1
-#else
-#define USE_memcpy 0
-#endif
-#endif
-
-#if (__STD_C || defined(HAVE_memcpy))
-
-#if __STD_C
-void* memset(void*, int, size_t);
-void* memcpy(void*, const void*, size_t);
-#else
-Void_t* memset();
-Void_t* memcpy();
-#endif
-#endif
-
-#ifndef DEBUG3
-
-#if USE_memcpy
-
-/* The following macros are only invoked with (2n+1)-multiples of
-   INTERNAL_SIZE_T units, with a positive integer n. This is exploited
-   for fast inline execution when n is small. */
-
-#define malloc_ZERO(charp, nbytes)                                            \
-do {                                                                          \
-  INTERNAL_SIZE_T mzsz = (nbytes);                                            \
-  if(mzsz <= 9*sizeof(mzsz)) {                                                \
-    INTERNAL_SIZE_T* mz = (INTERNAL_SIZE_T*) (charp);                         \
-    if(mzsz >= 5*sizeof(mzsz)) {     *mz++ = 0;                               \
-				     *mz++ = 0;                               \
-      if(mzsz >= 7*sizeof(mzsz)) {   *mz++ = 0;                               \
-				     *mz++ = 0;                               \
-	if(mzsz >= 9*sizeof(mzsz)) { *mz++ = 0;                               \
-				     *mz++ = 0; }}}                           \
-				     *mz++ = 0;                               \
-				     *mz++ = 0;                               \
-				     *mz   = 0;                               \
-  } else memset((charp), 0, mzsz);                                            \
-} while(0)
-
-#define malloc_COPY(dest,src,nbytes)                                          \
-do {                                                                          \
-  INTERNAL_SIZE_T mcsz = (nbytes);                                            \
-  if(mcsz <= 9*sizeof(mcsz)) {                                                \
-    INTERNAL_SIZE_T* mcsrc = (INTERNAL_SIZE_T*) (src);                        \
-    INTERNAL_SIZE_T* mcdst = (INTERNAL_SIZE_T*) (dest);                       \
-    if(mcsz >= 5*sizeof(mcsz)) {     *mcdst++ = *mcsrc++;                     \
-				     *mcdst++ = *mcsrc++;                     \
-      if(mcsz >= 7*sizeof(mcsz)) {   *mcdst++ = *mcsrc++;                     \
-				     *mcdst++ = *mcsrc++;                     \
-	if(mcsz >= 9*sizeof(mcsz)) { *mcdst++ = *mcsrc++;                     \
-				     *mcdst++ = *mcsrc++; }}}                 \
-				     *mcdst++ = *mcsrc++;                     \
-				     *mcdst++ = *mcsrc++;                     \
-				     *mcdst   = *mcsrc  ;                     \
-  } else memcpy(dest, src, mcsz);                                             \
-} while(0)
-
-#else /* !USE_memcpy */
-
-/* Use Duff's device for good zeroing/copying performance. */
-
-#define malloc_ZERO(charp, nbytes)                                            \
-do {                                                                          \
-  INTERNAL_SIZE_T* mzp = (INTERNAL_SIZE_T*)(charp);                           \
-  long mctmp = (nbytes)/sizeof(INTERNAL_SIZE_T), mcn;                         \
-  if (mctmp < 8) mcn = 0; else { mcn = (mctmp-1)/8; mctmp %= 8; }             \
-  switch (mctmp) {                                                            \
-    case 0: for(;;) { *mzp++ = 0;                                             \
-    case 7:           *mzp++ = 0;                                             \
-    case 6:           *mzp++ = 0;                                             \
-    case 5:           *mzp++ = 0;                                             \
-    case 4:           *mzp++ = 0;                                             \
-    case 3:           *mzp++ = 0;                                             \
-    case 2:           *mzp++ = 0;                                             \
-    case 1:           *mzp++ = 0; if(mcn <= 0) break; mcn--; }                \
-  }                                                                           \
-} while(0)
-
-#define malloc_COPY(dest,src,nbytes)                                          \
-do {                                                                          \
-  INTERNAL_SIZE_T* mcsrc = (INTERNAL_SIZE_T*) src;                            \
-  INTERNAL_SIZE_T* mcdst = (INTERNAL_SIZE_T*) dest;                           \
-  long mctmp = (nbytes)/sizeof(INTERNAL_SIZE_T), mcn;                         \
-  if (mctmp < 8) mcn = 0; else { mcn = (mctmp-1)/8; mctmp %= 8; }             \
-  switch (mctmp) {                                                            \
-    case 0: for(;;) { *mcdst++ = *mcsrc++;                                    \
-    case 7:           *mcdst++ = *mcsrc++;                                    \
-    case 6:           *mcdst++ = *mcsrc++;                                    \
-    case 5:           *mcdst++ = *mcsrc++;                                    \
-    case 4:           *mcdst++ = *mcsrc++;                                    \
-    case 3:           *mcdst++ = *mcsrc++;                                    \
-    case 2:           *mcdst++ = *mcsrc++;                                    \
-    case 1:           *mcdst++ = *mcsrc++; if(mcn <= 0) break; mcn--; }       \
-  }                                                                           \
-} while(0)
-
-#endif
-
-#else   /* DEBUG3 */
-
-/* The trailing moat invalidates the above prediction about the nbytes
-   parameter to malloc_ZERO and malloc_COPY. */
-
-#define malloc_ZERO(charp, nbytes)					      \
-do {									      \
-  char *mzp = (char *)(charp);						      \
-  long mzn = (nbytes);							      \
-  while (mzn--)								      \
-    *mzp++ = '\0';							      \
-} while(0)
-
-#define malloc_COPY(dest,src,nbytes)					      \
-do {									      \
-  char *mcsrc = (char *)(src);						      \
-  char *mcdst = (char *)(dest);						      \
-  long mcn = (nbytes);							      \
-  while (mcn--)								      \
-    *mcdst++ = *mcsrc++;						      \
-} while(0)
-
-#endif   /* DEBUG3 */
-
-/*
-  Define HAVE_MMAP to optionally make malloc() use mmap() to
-  allocate very large blocks.  These will be returned to the
-  operating system immediately after a free().
-*/
-
-#ifndef HAVE_MMAP
-#define HAVE_MMAP 1
-#endif
-
-/*
-  Define HAVE_MREMAP to make realloc() use mremap() to re-allocate
-  large blocks.  This is currently only possible on Linux with
-  kernel versions newer than 1.3.77.
-*/
-
-#ifndef HAVE_MREMAP
-#ifdef INTERNAL_LINUX_C_LIB
-#define HAVE_MREMAP 1
-#else
-#define HAVE_MREMAP 0
-#endif
-#endif
-
-#if HAVE_MMAP
-
-#include <unistd.h>
-#include <fcntl.h>
-#include <sys/mman.h>
-
-#if !defined(MAP_ANONYMOUS) && defined(MAP_ANON)
-#define MAP_ANONYMOUS MAP_ANON
-#endif
-
-#endif /* HAVE_MMAP */
-
-/*
-  Access to system page size. To the extent possible, this malloc
-  manages memory from the system in page-size units.
-
-  The following mechanics for getpagesize were adapted from
-  bsd/gnu getpagesize.h
-*/
-
-#ifndef LACKS_UNISTD_H
-#  include <unistd.h>
-#endif
-
-#ifndef malloc_getpagesize
-#  ifdef _SC_PAGESIZE         /* some SVR4 systems omit an underscore */
-#    ifndef _SC_PAGE_SIZE
-#      define _SC_PAGE_SIZE _SC_PAGESIZE
-#    endif
-#  endif
-#  ifdef _SC_PAGE_SIZE
-#    define malloc_getpagesize sysconf(_SC_PAGE_SIZE)
-#  else
-#    if defined(BSD) || defined(DGUX) || defined(HAVE_GETPAGESIZE)
-#      if __STD_C
-	 extern size_t getpagesize(void);
-#      else
-	 extern size_t getpagesize();
-#      endif
-#      define malloc_getpagesize getpagesize()
-#    else
-#      include <sys/param.h>
-#      ifdef EXEC_PAGESIZE
-#        define malloc_getpagesize EXEC_PAGESIZE
-#      else
-#        ifdef NBPG
-#          ifndef CLSIZE
-#            define malloc_getpagesize NBPG
-#          else
-#            define malloc_getpagesize (NBPG * CLSIZE)
-#          endif
-#        else
-#          ifdef NBPC
-#            define malloc_getpagesize NBPC
-#          else
-#            ifdef PAGESIZE
-#              define malloc_getpagesize PAGESIZE
-#            else
-#              define malloc_getpagesize (4096) /* just guess */
-#            endif
-#          endif
-#        endif
-#      endif
-#    endif
-#  endif
-#endif
-
-
-
-/*
-
-  This version of malloc supports the standard SVID/XPG mallinfo
-  routine that returns a struct containing the same kind of
-  information you can get from malloc_stats. It should work on
-  any SVID/XPG compliant system that has a /usr/include/malloc.h
-  defining struct mallinfo. (If you'd like to install such a thing
-  yourself, cut out the preliminary declarations as described above
-  and below and save them in a malloc.h file. But there's no
-  compelling reason to bother to do this.)
-
-  The main declaration needed is the mallinfo struct that is returned
-  (by-copy) by mallinfo().  The SVID/XPG malloinfo struct contains a
-  bunch of fields, most of which are not even meaningful in this
-  version of malloc. Some of these fields are are instead filled by
-  mallinfo() with other numbers that might possibly be of interest.
-
-  HAVE_USR_INCLUDE_malloc_H should be set if you have a
-  /usr/include/malloc.h file that includes a declaration of struct
-  mallinfo.  If so, it is included; else an SVID2/XPG2 compliant
-  version is declared below.  These must be precisely the same for
-  mallinfo() to work.
-
-*/
-
-/* #define HAVE_USR_INCLUDE_malloc_H */
-
-#if HAVE_USR_INCLUDE_malloc_H
-#include "/usr/include/malloc.h"
-#else
-
-/* SVID2/XPG mallinfo structure */
-
-struct mallinfo {
-  int arena;    /* total space allocated from system */
-  int ordblks;  /* number of non-inuse chunks */
-  int smblks;   /* unused -- always zero */
-  int hblks;    /* number of mmapped regions */
-  int hblkhd;   /* total space in mmapped regions */
-  int usmblks;  /* unused -- always zero */
-  int fsmblks;  /* unused -- always zero */
-  int uordblks; /* total allocated space */
-  int fordblks; /* total non-inuse space */
-  int keepcost; /* top-most, releasable (via malloc_trim) space */
-};
-
-/* SVID2/XPG mallopt options */
-
-#define M_MXFAST  1    /* UNUSED in this malloc */
-#define M_NLBLKS  2    /* UNUSED in this malloc */
-#define M_GRAIN   3    /* UNUSED in this malloc */
-#define M_KEEP    4    /* UNUSED in this malloc */
-
-#endif
-
-/* mallopt options that actually do something */
-
-#define M_TRIM_THRESHOLD    -1
-#define M_TOP_PAD           -2
-#define M_MMAP_THRESHOLD    -3
-#define M_MMAP_MAX          -4
-#define M_SCANHEAP	    -5
-#define M_FILL
-
-
-
-#ifndef DEFAULT_TRIM_THRESHOLD
-#define DEFAULT_TRIM_THRESHOLD (128 * 1024)
-#endif
-
-/*
-    M_TRIM_THRESHOLD is the maximum amount of unused top-most memory
-      to keep before releasing via malloc_trim in free().
-
-      Automatic trimming is mainly useful in long-lived programs.
-      Because trimming via sbrk can be slow on some systems, and can
-      sometimes be wasteful (in cases where programs immediately
-      afterward allocate more large chunks) the value should be high
-      enough so that your overall system performance would improve by
-      releasing.
-
-      The trim threshold and the mmap control parameters (see below)
-      can be traded off with one another. Trimming and mmapping are
-      two different ways of releasing unused memory back to the
-      system. Between these two, it is often possible to keep
-      system-level demands of a long-lived program down to a bare
-      minimum. For example, in one test suite of sessions measuring
-      the XF86 X server on Linux, using a trim threshold of 128K and a
-      mmap threshold of 192K led to near-minimal long term resource
-      consumption.
-
-      If you are using this malloc in a long-lived program, it should
-      pay to experiment with these values.  As a rough guide, you
-      might set to a value close to the average size of a process
-      (program) running on your system.  Releasing this much memory
-      would allow such a process to run in memory.  Generally, it's
-      worth it to tune for trimming rather tham memory mapping when a
-      program undergoes phases where several large chunks are
-      allocated and released in ways that can reuse each other's
-      storage, perhaps mixed with phases where there are no such
-      chunks at all.  And in well-behaved long-lived programs,
-      controlling release of large blocks via trimming versus mapping
-      is usually faster.
-
-      However, in most programs, these parameters serve mainly as
-      protection against the system-level effects of carrying around
-      massive amounts of unneeded memory. Since frequent calls to
-      sbrk, mmap, and munmap otherwise degrade performance, the default
-      parameters are set to relatively high values that serve only as
-      safeguards.
-
-      The default trim value is high enough to cause trimming only in
-      fairly extreme (by current memory consumption standards) cases.
-      It must be greater than page size to have any useful effect.  To
-      disable trimming completely, you can set to (unsigned long)(-1);
-
-
-*/
-
-
-#ifndef DEFAULT_TOP_PAD
-#define DEFAULT_TOP_PAD        (0)
-#endif
-
-/*
-    M_TOP_PAD is the amount of extra `padding' space to allocate or
-      retain whenever sbrk is called. It is used in two ways internally:
-
-      * When sbrk is called to extend the top of the arena to satisfy
-	a new malloc request, this much padding is added to the sbrk
-	request.
-
-      * When malloc_trim is called automatically from free(),
-	it is used as the `pad' argument.
-
-      In both cases, the actual amount of padding is rounded
-      so that the end of the arena is always a system page boundary.
-
-      The main reason for using padding is to avoid calling sbrk so
-      often. Having even a small pad greatly reduces the likelihood
-      that nearly every malloc request during program start-up (or
-      after trimming) will invoke sbrk, which needlessly wastes
-      time.
-
-      Automatic rounding-up to page-size units is normally sufficient
-      to avoid measurable overhead, so the default is 0.  However, in
-      systems where sbrk is relatively slow, it can pay to increase
-      this value, at the expense of carrying around more memory than
-      the program needs.
-
-*/
-
-
-#ifndef DEFAULT_MMAP_THRESHOLD
-#define DEFAULT_MMAP_THRESHOLD (128 * 1024)
-#endif
-
-/*
-
-    M_MMAP_THRESHOLD is the request size threshold for using mmap()
-      to service a request. Requests of at least this size that cannot
-      be allocated using already-existing space will be serviced via mmap.
-      (If enough normal freed space already exists it is used instead.)
-
-      Using mmap segregates relatively large chunks of memory so that
-      they can be individually obtained and released from the host
-      system. A request serviced through mmap is never reused by any
-      other request (at least not directly; the system may just so
-      happen to remap successive requests to the same locations).
-
-      Segregating space in this way has the benefit that mmapped space
-      can ALWAYS be individually released back to the system, which
-      helps keep the system level memory demands of a long-lived
-      program low. Mapped memory can never become `locked' between
-      other chunks, as can happen with normally allocated chunks, which
-      menas that even trimming via malloc_trim would not release them.
-
-      However, it has the disadvantages that:
-
-	 1. The space cannot be reclaimed, consolidated, and then
-	    used to service later requests, as happens with normal chunks.
-	 2. It can lead to more wastage because of mmap page alignment
-	    requirements
-	 3. It causes malloc performance to be more dependent on host
-	    system memory management support routines which may vary in
-	    implementation quality and may impose arbitrary
-	    limitations. Generally, servicing a request via normal
-	    malloc steps is faster than going through a system's mmap.
-
-      All together, these considerations should lead you to use mmap
-      only for relatively large requests.
-
-
-*/
-
-
-
-#ifndef DEFAULT_MMAP_MAX
-#if HAVE_MMAP
-#define DEFAULT_MMAP_MAX       (64)
-#else
-#define DEFAULT_MMAP_MAX       (0)
-#endif
-#endif
-
-/*
-    M_MMAP_MAX is the maximum number of requests to simultaneously
-      service using mmap. This parameter exists because:
-
-	 1. Some systems have a limited number of internal tables for
-	    use by mmap.
-	 2. In most systems, overreliance on mmap can degrade overall
-	    performance.
-	 3. If a program allocates many large regions, it is probably
-	    better off using normal sbrk-based allocation routines that
-	    can reclaim and reallocate normal heap memory. Using a
-	    small value allows transition into this mode after the
-	    first few allocations.
-
-      Setting to 0 disables all use of mmap.  If HAVE_MMAP is not set,
-      the default value is 0, and attempts to set it to non-zero values
-      in mallopt will fail.
-*/
-
-
-
-
-/*
-
-  Special defines for linux libc
-
-  Except when compiled using these special defines for Linux libc
-  using weak aliases, this malloc is NOT designed to work in
-  multithreaded applications.  No semaphores or other concurrency
-  control are provided to ensure that multiple malloc or free calls
-  don't run at the same time, which could be disasterous. A single
-  semaphore could be used across malloc, realloc, and free (which is
-  essentially the effect of the linux weak alias approach). It would
-  be hard to obtain finer granularity.
-
-*/
-
-
-#ifdef INTERNAL_LINUX_C_LIB
-
-#if __STD_C
-
-Void_t * __default_morecore_init (ptrdiff_t);
-Void_t *(*__morecore)(ptrdiff_t) = __default_morecore_init;
-
-#else
-
-Void_t * __default_morecore_init ();
-Void_t *(*__morecore)() = __default_morecore_init;
-
-#endif
-
-#define MORECORE (*__morecore)
-#define MORECORE_FAILURE 0
-#define MORECORE_CLEARS 1
-
-#else /* INTERNAL_LINUX_C_LIB */
-
-#if __STD_C
-/* extern Void_t*     sbrk(ptrdiff_t);*/
-#else
-extern Void_t*     sbrk();
-#endif
-
-#ifndef MORECORE
-#define MORECORE sbrk
-#endif
-
-#ifndef MORECORE_FAILURE
-#define MORECORE_FAILURE -1
-#endif
-
-#ifndef MORECORE_CLEARS
-#define MORECORE_CLEARS 0
-#endif
-
-#endif /* INTERNAL_LINUX_C_LIB */
-
-#if defined(INTERNAL_LINUX_C_LIB) && defined(__ELF__)
-
-#define cALLOc		__libc_calloc
-#define fREe		__libc_free
-#define mALLOc		__libc_malloc
-#define mEMALIGn	__libc_memalign
-#define rEALLOc		__libc_realloc
-#define vALLOc		__libc_valloc
-#define pvALLOc		__libc_pvalloc
-#define mALLINFo	__libc_mallinfo
-#define mALLOPt		__libc_mallopt
-
-#pragma weak calloc = __libc_calloc
-#pragma weak free = __libc_free
-#pragma weak cfree = __libc_free
-#pragma weak malloc = __libc_malloc
-#pragma weak memalign = __libc_memalign
-#pragma weak realloc = __libc_realloc
-#pragma weak valloc = __libc_valloc
-#pragma weak pvalloc = __libc_pvalloc
-#pragma weak mallinfo = __libc_mallinfo
-#pragma weak mallopt = __libc_mallopt
-
-#else
-
-#ifndef cALLOc
-#define cALLOc		dlcalloc
-#endif
-#ifndef fREe
-#define fREe		dlfree
-#endif
-#ifndef mALLOc
-#define mALLOc		dlmalloc
-#endif
-#ifndef mEMALIGn
-#define mEMALIGn	dlmemalign
-#endif
-#ifndef rEALLOc
-#define rEALLOc		dlrealloc
-#endif
-#ifndef vALLOc
-#define vALLOc		dlvalloc
-#endif
-#ifndef pvALLOc
-#define pvALLOc		dlpvalloc
-#endif
-#ifndef mALLINFo
-#define mALLINFo	dlmallinfo
-#endif
-#ifndef mALLOPt
-#define mALLOPt		dlmallopt
-#endif
-
-#endif
-
-/* Public routines */
-
-#ifdef DEBUG2
-#define malloc(size)		malloc_dbg(size, __FILE__, __LINE__)
-#define free(p)			free_dbg(p, __FILE__, __LINE__)
-#define realloc(p, size)	realloc_dbg(p, size, __FILE__, __LINE__)
-#define calloc(n, size)		calloc_dbg(n, size, __FILE__, __LINE__)
-#define memalign(align, size)	memalign_dbg(align, size, __FILE__, __LINE__)
-#define valloc(size)		valloc_dbg(size, __FILE__, __LINE__)
-#define pvalloc(size)		pvalloc_dbg(size, __FILE__, __LINE__)
-#define malloc_trim(pad)	malloc_trim_dbg(pad, __FILE__, __LINE__)
-#define malloc_usable_size(p)	malloc_usable_size_dbg(p, __FILE__, __LINE__)
-#define malloc_stats(void)	malloc_stats_dbg(__FILE__, __LINE__)
-#define mallopt(flag, val)	mallopt_dbg(flag, val, __FILE__, __LINE__)
-#define mallinfo(void)		mallinfo_dbg(__FILE__, __LINE__)
-
-#if __STD_C
-Void_t* malloc_dbg(size_t, const char *, int);
-void    free_dbg(Void_t*, const char *, int);
-Void_t* realloc_dbg(Void_t*, size_t, const char *, int);
-Void_t* calloc_dbg(size_t, size_t, const char *, int);
-Void_t* memalign_dbg(size_t, size_t, const char *, int);
-Void_t* valloc_dbg(size_t, const char *, int);
-Void_t* pvalloc_dbg(size_t, const char *, int);
-int     malloc_trim_dbg(size_t, const char *, int);
-size_t  malloc_usable_size_dbg(Void_t*, const char *, int);
-void    malloc_stats_dbg(const char *, int);
-int     mallopt_dbg(int, int, const char *, int);
-struct mallinfo mallinfo_dbg(const char *, int);
-#else
-Void_t* malloc_dbg();
-void    free_dbg();
-Void_t* realloc_dbg();
-Void_t* calloc_dbg();
-Void_t* memalign_dbg();
-Void_t* valloc_dbg();
-Void_t* pvalloc_dbg();
-int     malloc_trim_dbg();
-size_t  malloc_usable_size_dbg();
-void    malloc_stats_dbg();
-int     mallopt_dbg();
-struct mallinfo mallinfo_dbg();
-#endif   /* !__STD_C */
-
-#else   /* !DEBUG2 */
-
-#if __STD_C
-
-Void_t* mALLOc(size_t);
-void    fREe(Void_t*);
-Void_t* rEALLOc(Void_t*, size_t);
-Void_t* cALLOc(size_t, size_t);
-Void_t* mEMALIGn(size_t, size_t);
-Void_t* vALLOc(size_t);
-Void_t* pvALLOc(size_t);
-int     malloc_trim(size_t);
-size_t  malloc_usable_size(Void_t*);
-void    malloc_stats(void);
-int     mALLOPt(int, int);
-struct mallinfo mALLINFo(void);
-#else
-Void_t* mALLOc();
-void    fREe();
-Void_t* rEALLOc();
-Void_t* cALLOc();
-Void_t* mEMALIGn();
-Void_t* vALLOc();
-Void_t* pvALLOc();
-int     malloc_trim();
-size_t  malloc_usable_size();
-void    malloc_stats();
-int     mALLOPt();
-struct mallinfo mALLINFo();
-#endif
-#endif   /* !DEBUG2 */
-
-#ifdef __cplusplus
-};  /* end of extern "C" */
-#endif
-
-/* ---------- To make a malloc.h, end cutting here ------------ */
-
-#ifdef DEBUG2
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#undef malloc
-#undef free
-#undef realloc
-#undef calloc
-#undef memalign
-#undef valloc
-#undef pvalloc
-#undef malloc_trim
-#undef malloc_usable_size
-#undef malloc_stats
-#undef mallopt
-#undef mallinfo
-
-#if __STD_C
-Void_t* mALLOc(size_t);
-void    fREe(Void_t*);
-Void_t* rEALLOc(Void_t*, size_t);
-Void_t* cALLOc(size_t, size_t);
-Void_t* mEMALIGn(size_t, size_t);
-Void_t* vALLOc(size_t);
-Void_t* pvALLOc(size_t);
-int     malloc_trim(size_t);
-size_t  malloc_usable_size(Void_t*);
-void    malloc_stats(void);
-int     mALLOPt(int, int);
-struct mallinfo mALLINFo(void);
-#else
-Void_t* mALLOc();
-void    fREe();
-Void_t* rEALLOc();
-Void_t* cALLOc();
-Void_t* mEMALIGn();
-Void_t* vALLOc();
-Void_t* pvALLOc();
-int     malloc_trim();
-size_t  malloc_usable_size();
-void    malloc_stats();
-int     mALLOPt();
-struct mallinfo mALLINFo();
-#endif
-
-#include <ctype.h>			/* isprint() */
-#ifdef DEBUG3
-#include <stdlib.h>			/* atexit() */
-#endif
-
-#ifdef __cplusplus
-};  /* end of extern "C" */
-#endif
-
-#endif   /* DEBUG2 */
-
-/*
-  Emulation of sbrk for WIN32
-  All code within the ifdef WIN32 is untested by me.
-*/
-
-
-#ifdef WIN32
-
-#define AlignPage(add) (((add) + (malloc_getpagesize-1)) & \
-			~(malloc_getpagesize-1))
-
-/* resrve 64MB to insure large contiguous space */
-#define RESERVED_SIZE (1024*1024*64)
-#define NEXT_SIZE (2048*1024)
-#define TOP_MEMORY ((unsigned long)2*1024*1024*1024)
-
-struct GmListElement;
-typedef struct GmListElement GmListElement;
-
-struct GmListElement
-{
-	GmListElement* next;
-	void* base;
-};
-
-static GmListElement* head = 0;
-static unsigned int gNextAddress = 0;
-static unsigned int gAddressBase = 0;
-static unsigned int gAllocatedSize = 0;
-
-static
-GmListElement* makeGmListElement (void* bas)
-{
-	GmListElement* this;
-	this = (GmListElement*)(void*)LocalAlloc (0, sizeof (GmListElement));
-	ASSERT (this);
-	if (this)
-	{
-		this->base = bas;
-		this->next = head;
-		head = this;
-	}
-	return this;
-}
-
-void gcleanup ()
-{
-	BOOL rval;
-	ASSERT ( (head == NULL) || (head->base == (void*)gAddressBase));
-	if (gAddressBase && (gNextAddress - gAddressBase))
-	{
-		rval = VirtualFree ((void*)gAddressBase,
-							gNextAddress - gAddressBase,
-							MEM_DECOMMIT);
-	ASSERT (rval);
-	}
-	while (head)
-	{
-		GmListElement* next = head->next;
-		rval = VirtualFree (head->base, 0, MEM_RELEASE);
-		ASSERT (rval);
-		LocalFree (head);
-		head = next;
-	}
-}
-
-static
-void* findRegion (void* start_address, unsigned long size)
-{
-	MEMORY_BASIC_INFORMATION info;
-	while ((unsigned long)start_address < TOP_MEMORY)
-	{
-		VirtualQuery (start_address, &info, sizeof (info));
-		if (info.State != MEM_FREE)
-			start_address = (char*)info.BaseAddress + info.RegionSize;
-		else if (info.RegionSize >= size)
-			return start_address;
-		else
-			start_address = (char*)info.BaseAddress + info.RegionSize;
-	}
-	return NULL;
-
-}
-
-
-void* wsbrk (long size)
-{
-	void* tmp;
-	if (size > 0)
-	{
-		if (gAddressBase == 0)
-		{
-			gAllocatedSize = max (RESERVED_SIZE, AlignPage (size));
-			gNextAddress = gAddressBase =
-				(unsigned int)VirtualAlloc (NULL, gAllocatedSize,
-											MEM_RESERVE, PAGE_NOACCESS);
-		} else if (AlignPage (gNextAddress + size) > (gAddressBase +
-gAllocatedSize))
-		{
-			long new_size = max (NEXT_SIZE, AlignPage (size));
-			void* new_address = (void*)(gAddressBase+gAllocatedSize);
-			do
-			{
-				new_address = findRegion (new_address, new_size);
-
-				if (new_address == 0)
-					return (void*)-1;
-
-				gAddressBase = gNextAddress =
-					(unsigned int)VirtualAlloc (new_address, new_size,
-												MEM_RESERVE, PAGE_NOACCESS);
-				// repeat in case of race condition
-				// The region that we found has been snagged
-				// by another thread
-			}
-			while (gAddressBase == 0);
-
-			ASSERT (new_address == (void*)gAddressBase);
-
-			gAllocatedSize = new_size;
-
-			if (!makeGmListElement ((void*)gAddressBase))
-				return (void*)-1;
-		}
-		if ((size + gNextAddress) > AlignPage (gNextAddress))
-		{
-			void* res;
-			res = VirtualAlloc ((void*)AlignPage (gNextAddress),
-								(size + gNextAddress -
-								 AlignPage (gNextAddress)),
-								MEM_COMMIT, PAGE_READWRITE);
-			if (res == 0)
-				return (void*)-1;
-		}
-		tmp = (void*)gNextAddress;
-		gNextAddress = (unsigned int)tmp + size;
-		return tmp;
-	}
-	else if (size < 0)
-	{
-		unsigned int alignedGoal = AlignPage (gNextAddress + size);
-		/* Trim by releasing the virtual memory */
-		if (alignedGoal >= gAddressBase)
-		{
-			VirtualFree ((void*)alignedGoal, gNextAddress - alignedGoal,
-						 MEM_DECOMMIT);
-			gNextAddress = gNextAddress + size;
-			return (void*)gNextAddress;
-		}
-		else
-		{
-			VirtualFree ((void*)gAddressBase, gNextAddress - gAddressBase,
-						 MEM_DECOMMIT);
-			gNextAddress = gAddressBase;
-			return (void*)-1;
-		}
-	}
-	else
-	{
-		return (void*)gNextAddress;
-	}
-}
-
-#endif
-
-
-
-/*
-  Type declarations
-*/
-
-#ifdef DEBUG3
-# define MOATWIDTH	4	/* number of guard bytes at each end of
-				   allocated region */
-# define MOATFILL	5	/* moat fill character */
-# define ALLOCFILL	1	/* fill char for allocated */
-# define FREEFILL	2	/*  and freed regions */
-#endif
-
-typedef struct malloc_chunk
-{
-  INTERNAL_SIZE_T prev_size; /* Size of previous chunk (if free). */
-  INTERNAL_SIZE_T size;      /* Size in bytes, including overhead. */
-  struct malloc_chunk* fd;   /* double links -- used only if free. */
-  struct malloc_chunk* bk;
-#ifdef DEBUG3
-  const char *file;	     /* file and */
-  int line;		     /*  line number of [re]allocation */
-  size_t pad;		     /* nr pad bytes at mem end, excluding moat */
-  int alloced;		     /* whether the chunk is allocated -- less prone
-				to segv than inuse(chunk) */
-  char moat[MOATWIDTH];      /* actual leading moat is last MOATWIDTH bytes
-				of chunk header; those bytes may follow this
-				field due to header alignment padding */
-#endif
-} Chunk;
-
-typedef Chunk* mchunkptr;
-
-/*
-
-   malloc_chunk details:
-
-    (The following includes lightly edited explanations by Colin Plumb.)
-
-    Chunks of memory are maintained using a `boundary tag' method as
-    described in e.g., Knuth or Standish.  (See the paper by Paul
-    Wilson ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps for a
-    survey of such techniques.)  Sizes of free chunks are stored both
-    in the front of each chunk and at the end.  This makes
-    consolidating fragmented chunks into bigger chunks very fast.  The
-    size fields also hold bits representing whether chunks are free or
-    in use.
-
-    An allocated chunk looks like this:
-
-
-    chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Size of previous chunk, if allocated            | |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Size of chunk, in bytes                         |P|
-      mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             User data starts here...                          .
-	    .                                                               .
-	    .             (malloc_usable_space() bytes)                     .
-	    .                                                               |
-nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Size of chunk                                     |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-
-
-    Where "chunk" is the front of the chunk for the purpose of most of
-    the malloc code, but "mem" is the pointer that is returned to the
-    user.  "Nextchunk" is the beginning of the next contiguous chunk.
-
-    Chunks always begin on even word boundries, so the mem portion
-    (which is returned to the user) is also on an even word boundary, and
-    thus double-word aligned.
-
-    Free chunks are stored in circular doubly-linked lists, and look like this:
-
-    chunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Size of previous chunk                            |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-    `head:' |             Size of chunk, in bytes                         |P|
-      mem-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Forward pointer to next chunk in list             |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Back pointer to previous chunk in list            |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-	    |             Unused space (may be 0 bytes long)                .
-	    .                                                               .
-	    .                                                               |
-nextchunk-> +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-    `foot:' |             Size of chunk, in bytes                           |
-	    +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
-
-    The P (PREV_INUSE) bit, stored in the unused low-order bit of the
-    chunk size (which is always a multiple of two words), is an in-use
-    bit for the *previous* chunk.  If that bit is *clear*, then the
-    word before the current chunk size contains the previous chunk
-    size, and can be used to find the front of the previous chunk.
-    (The very first chunk allocated always has this bit set,
-    preventing access to non-existent (or non-owned) memory.)
-
-    Note that the `foot' of the current chunk is actually represented
-    as the prev_size of the NEXT chunk. (This makes it easier to
-    deal with alignments etc).
-
-    The two exceptions to all this are
-
-     1. The special chunk `top', which doesn't bother using the
-	trailing size field since there is no
-	next contiguous chunk that would have to index off it. (After
-	initialization, `top' is forced to always exist.  If it would
-	become less than MINSIZE bytes long, it is replenished via
-	malloc_extend_top.)
-
-     2. Chunks allocated via mmap, which have the second-lowest-order
-	bit (IS_MMAPPED) set in their size fields.  Because they are
-	never merged or traversed from any other chunk, they have no
-	foot size or inuse information.
-
-    Available chunks are kept in any of several places (all declared below):
-
-    * `av': An array of chunks serving as bin headers for consolidated
-       chunks. Each bin is doubly linked.  The bins are approximately
-       proportionally (log) spaced.  There are a lot of these bins
-       (128). This may look excessive, but works very well in
-       practice.  All procedures maintain the invariant that no
-       consolidated chunk physically borders another one. Chunks in
-       bins are kept in size order, with ties going to the
-       approximately least recently used chunk.
-
-       The chunks in each bin are maintained in decreasing sorted order by
-       size.  This is irrelevant for the small bins, which all contain
-       the same-sized chunks, but facilitates best-fit allocation for
-       larger chunks. (These lists are just sequential. Keeping them in
-       order almost never requires enough traversal to warrant using
-       fancier ordered data structures.)  Chunks of the same size are
-       linked with the most recently freed at the front, and allocations
-       are taken from the back.  This results in LRU or FIFO allocation
-       order, which tends to give each chunk an equal opportunity to be
-       consolidated with adjacent freed chunks, resulting in larger free
-       chunks and less fragmentation.
-
-    * `top': The top-most available chunk (i.e., the one bordering the
-       end of available memory) is treated specially. It is never
-       included in any bin, is used only if no other chunk is
-       available, and is released back to the system if it is very
-       large (see M_TRIM_THRESHOLD).
-
-    * `last_remainder': A bin holding only the remainder of the
-       most recently split (non-top) chunk. This bin is checked
-       before other non-fitting chunks, so as to provide better
-       locality for runs of sequentially allocated chunks.
-
-    *  Implicitly, through the host system's memory mapping tables.
-       If supported, requests greater than a threshold are usually
-       serviced via calls to mmap, and then later released via munmap.
-
-*/
-
-
-
-
-
-
-/*  sizes, alignments */
-
-#define SIZE_SZ			sizeof(INTERNAL_SIZE_T)
-#define ALIGNMENT		(SIZE_SZ + SIZE_SZ)
-#define ALIGN_MASK		(ALIGNMENT - 1)
-#ifndef DEBUG3
-# define MEMOFFSET		(2*SIZE_SZ)
-# define OVERHEAD		SIZE_SZ
-# define MMAP_EXTRA		SIZE_SZ		/* for correct alignment */
-# define MINSIZE		sizeof(Chunk)
-#else
-typedef union {
-  char strut[(sizeof(Chunk) - 1) / ALIGNMENT + 1][ALIGNMENT];
-  Chunk chunk;
-} PaddedChunk;
-# define MEMOFFSET		sizeof(PaddedChunk)
-# define OVERHEAD		(MEMOFFSET + MOATWIDTH)
-# define MMAP_EXTRA		0
-# define MINSIZE		((OVERHEAD + ALIGN_MASK) & ~ALIGN_MASK)
-#endif
-
-/* conversion from malloc headers to user pointers, and back */
-
-#define chunk2mem(p)   ((Void_t*)((char*)(p) + MEMOFFSET))
-#define mem2chunk(mem) ((mchunkptr)((char*)(mem) - MEMOFFSET))
-
-/* pad request bytes into a usable size, including overhead */
-
-#define request2size(req) \
- ((long)((req) + OVERHEAD) < (long)MINSIZE ? MINSIZE : \
-  ((req) + OVERHEAD + ALIGN_MASK) & ~ALIGN_MASK)
-
-/* Check if m has acceptable alignment */
-
-#define aligned_OK(m)    (((unsigned long)((m)) & ALIGN_MASK) == 0)
-
-
-
-
-/*
-  Physical chunk operations
-*/
-
-
-/* size field is or'ed with PREV_INUSE when previous adjacent chunk in use */
-
-#define PREV_INUSE 0x1
-
-/* size field is or'ed with IS_MMAPPED if the chunk was obtained with mmap() */
-
-#define IS_MMAPPED 0x2
-
-/* Bits to mask off when extracting size */
-
-#define SIZE_BITS (PREV_INUSE|IS_MMAPPED)
-
-
-/* Ptr to next physical malloc_chunk. */
-
-#define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->size & ~PREV_INUSE) ))
-
-/* Ptr to previous physical malloc_chunk */
-
-#define prev_chunk(p)\
-   ((mchunkptr)( ((char*)(p)) - ((p)->prev_size) ))
-
-
-/* Treat space at ptr + offset as a chunk */
-
-#define chunk_at_offset(p, s)  ((mchunkptr)(((char*)(p)) + (s)))
-
-
-
-
-/*
-  Dealing with use bits
-*/
-
-/* extract p's inuse bit */
-
-#define inuse(p)\
-((((mchunkptr)(((char*)(p))+((p)->size & ~PREV_INUSE)))->size) & PREV_INUSE)
-
-/* extract inuse bit of previous chunk */
-
-#define prev_inuse(p)  ((p)->size & PREV_INUSE)
-
-/* check for mmap()'ed chunk */
-
-#if HAVE_MMAP
-# define chunk_is_mmapped(p) ((p)->size & IS_MMAPPED)
-#else
-# define chunk_is_mmapped(p) 0
-#endif
-
-/* set/clear chunk as in use without otherwise disturbing */
-
-#define set_inuse(p)\
-((mchunkptr)(((char*)(p)) + ((p)->size & ~PREV_INUSE)))->size |= PREV_INUSE
-
-#define clear_inuse(p)\
-((mchunkptr)(((char*)(p)) + ((p)->size & ~PREV_INUSE)))->size &= ~(PREV_INUSE)
-
-/* check/set/clear inuse bits in known places */
-
-#define inuse_bit_at_offset(p, s)\
- (((mchunkptr)(((char*)(p)) + (s)))->size & PREV_INUSE)
-
-#define set_inuse_bit_at_offset(p, s)\
- (((mchunkptr)(((char*)(p)) + (s)))->size |= PREV_INUSE)
-
-#define clear_inuse_bit_at_offset(p, s)\
- (((mchunkptr)(((char*)(p)) + (s)))->size &= ~(PREV_INUSE))
-
-
-
-
-/*
-  Dealing with size fields
-*/
-
-/* Get size, ignoring use bits */
-
-#define chunksize(p)          ((p)->size & ~(SIZE_BITS))
-
-/* Set size at head, without disturbing its use bit */
-
-#define set_head_size(p, s)   ((p)->size = (((p)->size & PREV_INUSE) | (s)))
-
-/* Set size/use ignoring previous bits in header */
-
-#define set_head(p, s)        ((p)->size = (s))
-
-/* Set size at footer (only when chunk is not in use) */
-
-#define set_foot(p, s)   (((mchunkptr)((char*)(p) + (s)))->prev_size = (s))
-
-
-
-
-
-/*
-   Bins
-
-    The bins, `av_' are an array of pairs of pointers serving as the
-    heads of (initially empty) doubly-linked lists of chunks, laid out
-    in a way so that each pair can be treated as if it were in a
-    malloc_chunk. (This way, the fd/bk offsets for linking bin heads
-    and chunks are the same).
-
-    Bins for sizes < 512 bytes contain chunks of all the same size, spaced
-    8 bytes apart. Larger bins are approximately logarithmically
-    spaced. (See the table below.) The `av_' array is never mentioned
-    directly in the code, but instead via bin access macros.
-
-    Bin layout:
-
-    64 bins of size       8
-    32 bins of size      64
-    16 bins of size     512
-     8 bins of size    4096
-     4 bins of size   32768
-     2 bins of size  262144
-     1 bin  of size what's left
-
-    There is actually a little bit of slop in the numbers in bin_index
-    for the sake of speed. This makes no difference elsewhere.
-
-    The special chunks `top' and `last_remainder' get their own bins,
-    (this is implemented via yet more trickery with the av_ array),
-    although `top' is never properly linked to its bin since it is
-    always handled specially.
-
-*/
-
-#define NAV             128   /* number of bins */
-
-typedef Chunk* mbinptr;
-
-/* access macros */
-
-#define bin_at(i)      ((mbinptr)((char*)&(av_[2*(i) + 2]) - 2*SIZE_SZ))
-#define next_bin(b)    ((mbinptr)((char*)(b) + 2 * sizeof(mbinptr)))
-#define prev_bin(b)    ((mbinptr)((char*)(b) - 2 * sizeof(mbinptr)))
-
-/*
-   The first 2 bins are never indexed. The corresponding av_ cells are instead
-   used for bookkeeping. This is not to save space, but to simplify
-   indexing, maintain locality, and avoid some initialization tests.
-*/
-
-#define top            (bin_at(0)->fd)   /* The topmost chunk */
-#define last_remainder (bin_at(1))       /* remainder from last split */
-
-
-/*
-   Because top initially points to its own bin with initial
-   zero size, thus forcing extension on the first malloc request,
-   we avoid having any special code in malloc to check whether
-   it even exists yet. But we still need to in malloc_extend_top.
-*/
-
-#define initial_top    ((mchunkptr)(bin_at(0)))
-
-/* Helper macro to initialize bins */
-
-#define IAV(i)  bin_at(i), bin_at(i)
-
-static mbinptr av_[NAV * 2 + 2] = {
- 0, 0,
- IAV(0),   IAV(1),   IAV(2),   IAV(3),   IAV(4),   IAV(5),   IAV(6),   IAV(7),
- IAV(8),   IAV(9),   IAV(10),  IAV(11),  IAV(12),  IAV(13),  IAV(14),  IAV(15),
- IAV(16),  IAV(17),  IAV(18),  IAV(19),  IAV(20),  IAV(21),  IAV(22),  IAV(23),
- IAV(24),  IAV(25),  IAV(26),  IAV(27),  IAV(28),  IAV(29),  IAV(30),  IAV(31),
- IAV(32),  IAV(33),  IAV(34),  IAV(35),  IAV(36),  IAV(37),  IAV(38),  IAV(39),
- IAV(40),  IAV(41),  IAV(42),  IAV(43),  IAV(44),  IAV(45),  IAV(46),  IAV(47),
- IAV(48),  IAV(49),  IAV(50),  IAV(51),  IAV(52),  IAV(53),  IAV(54),  IAV(55),
- IAV(56),  IAV(57),  IAV(58),  IAV(59),  IAV(60),  IAV(61),  IAV(62),  IAV(63),
- IAV(64),  IAV(65),  IAV(66),  IAV(67),  IAV(68),  IAV(69),  IAV(70),  IAV(71),
- IAV(72),  IAV(73),  IAV(74),  IAV(75),  IAV(76),  IAV(77),  IAV(78),  IAV(79),
- IAV(80),  IAV(81),  IAV(82),  IAV(83),  IAV(84),  IAV(85),  IAV(86),  IAV(87),
- IAV(88),  IAV(89),  IAV(90),  IAV(91),  IAV(92),  IAV(93),  IAV(94),  IAV(95),
- IAV(96),  IAV(97),  IAV(98),  IAV(99),  IAV(100), IAV(101), IAV(102), IAV(103),
- IAV(104), IAV(105), IAV(106), IAV(107), IAV(108), IAV(109), IAV(110), IAV(111),
- IAV(112), IAV(113), IAV(114), IAV(115), IAV(116), IAV(117), IAV(118), IAV(119),
- IAV(120), IAV(121), IAV(122), IAV(123), IAV(124), IAV(125), IAV(126), IAV(127)
-};
-
-
-
-/* field-extraction macros */
-
-#define first(b) ((b)->fd)
-#define last(b)  ((b)->bk)
-
-/*
-  Indexing into bins
-*/
-
-#define bin_index(sz)                                                          \
-(((((unsigned long)(sz)) >> 9) ==    0) ?       (((unsigned long)(sz)) >>  3): \
- ((((unsigned long)(sz)) >> 9) <=    4) ?  56 + (((unsigned long)(sz)) >>  6): \
- ((((unsigned long)(sz)) >> 9) <=   20) ?  91 + (((unsigned long)(sz)) >>  9): \
- ((((unsigned long)(sz)) >> 9) <=   84) ? 110 + (((unsigned long)(sz)) >> 12): \
- ((((unsigned long)(sz)) >> 9) <=  340) ? 119 + (((unsigned long)(sz)) >> 15): \
- ((((unsigned long)(sz)) >> 9) <= 1364) ? 124 + (((unsigned long)(sz)) >> 18): \
-					  126)
-/*
-  bins for chunks < 512 are all spaced 8 bytes apart, and hold
-  identically sized chunks. This is exploited in malloc.
-*/
-
-#define MAX_SMALLBIN         63
-#define MAX_SMALLBIN_SIZE   512
-#define SMALLBIN_WIDTH        8
-
-#define smallbin_index(sz)  (((unsigned long)(sz)) >> 3)
-
-/*
-   Requests are `small' if both the corresponding and the next bin are small
-*/
-
-#define is_small_request(nb) (nb < MAX_SMALLBIN_SIZE - SMALLBIN_WIDTH)
-
-
-
-/*
-    To help compensate for the large number of bins, a one-level index
-    structure is used for bin-by-bin searching.  `binblocks' is a
-    one-word bitvector recording whether groups of BINBLOCKWIDTH bins
-    have any (possibly) non-empty bins, so they can be skipped over
-    all at once during during traversals. The bits are NOT always
-    cleared as soon as all bins in a block are empty, but instead only
-    when all are noticed to be empty during traversal in malloc.
-*/
-
-#define BINBLOCKWIDTH     4   /* bins per block */
-
-#define binblocks      (bin_at(0)->size) /* bitvector of nonempty blocks */
-
-/* bin<->block macros */
-
-#define idx2binblock(ix)    ((unsigned)1 << (ix / BINBLOCKWIDTH))
-#define mark_binblock(ii)   (binblocks |= idx2binblock(ii))
-#define clear_binblock(ii)  (binblocks &= ~(idx2binblock(ii)))
-
-
-
-
-
-/*  Other static bookkeeping data */
-
-/* variables holding tunable values */
-
-static unsigned long trim_threshold   = DEFAULT_TRIM_THRESHOLD;
-static unsigned long top_pad          = DEFAULT_TOP_PAD;
-static unsigned int  n_mmaps_max      = DEFAULT_MMAP_MAX;
-static unsigned long mmap_threshold   = DEFAULT_MMAP_THRESHOLD;
-#ifdef DEBUG2
-static int scanheap		      = 1;
-#endif
-
-/* The first value returned from sbrk */
-static char* sbrk_base = (char*)(-1);
-
-/* The maximum memory obtained from system via sbrk */
-static unsigned long max_sbrked_mem = 0;
-
-/* The maximum via either sbrk or mmap */
-static unsigned long max_total_mem = 0;
-
-/* internal working copy of mallinfo */
-static struct mallinfo current_mallinfo = {  0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
-
-/* The total memory obtained from system via sbrk */
-#define sbrked_mem  (current_mallinfo.arena)
-
-/* Tracking mmaps */
-
-static unsigned int n_mmaps = 0;
-static unsigned long mmapped_mem = 0;
-#if HAVE_MMAP
-static unsigned int max_n_mmaps = 0;
-static unsigned long max_mmapped_mem = 0;
-#endif
-
-
-
-/*
-  Debugging support
-*/
-
-#if DEBUG
-
-#ifndef DEBUG2
-#  define unless(cond, err, p)	assert(cond)
-#else
-#  define unless(cond, err, p)	do { if (!(cond)) malloc_err(err, p); } while (0)
-
-/*
- * When debug_file is non-null, it and debug_line respectively contain the
- * file and line number of the current invocation of malloc(), calloc(),
- * realloc(), or free().
- */
-static const char *debug_file = NULL;
-static int debug_line;
-
-/*
- * Avoid dereferencing invalid chunk.file pointers by tracking the range of
- * valid ones.  Could add an "unallocated" flag to init_freed_chunk() for
- * more protection, but that's probably not necessary.
- */
-static const char *debug_file_min = (char *)~0;
-static const char *debug_file_max = NULL;
-
-static char *itos(int n)
-{
-#define NDIGITS	(sizeof(int) * 3)
-  static char s[NDIGITS + 1];
-  int i = NDIGITS;
-  do {
-    s[--i] = '0' + n % 10;
-    n /= 10;
-  } while (n);
-  return s + i;
-#undef NDIGITS
-}
-
-static int recurs = 0;
-
-static void errprint(const char *file, int line, const char *err)
-{
-  if (recurs++) {
-    recurs--;
-    return;
-  }
-
-  if (file) {
-    write(2, file, strlen(file));
-    if (line) {
-      write(2, ":", 1);
-      write(2, itos(line), strlen(itos(line)));
-    }
-    write(2, ": ", 2);
-  }
-  write(2, err, strlen(err));
-  write(2, "\n", 1);
-  recurs--;
-}
-
-static void malloc_err(const char *err, mchunkptr p)
-{
-  /*
-   * Display ERR on stderr, accompanying it with the caller's file and line
-   * number if available.  If P is non-null, also attempt to display the file
-   * and line number at which P was most recently [re]allocated.
-   *
-   * This function's name begins with "malloc_" to make setting debugger
-   * breakpoints here more convenient.
-   */
-  errprint(debug_file, debug_line, err);
-
-# ifndef DEBUG3
-  p = 0;				/* avoid "unused param" warning */
-# else
-  if (p && p->file &&
-      /* avoid invalid pointers */
-      debug_file_min &&
-      p->file >= debug_file_min &&
-      p->file <= debug_file_max)
-    errprint(p->file, p->line, "in block allocated here");
-# endif
-}
-
-#undef malloc
-#undef free
-#undef realloc
-#undef memalign
-#undef valloc
-#undef pvalloc
-#undef calloc
-#undef malloc_trim
-#undef malloc_usable_size
-#undef malloc_stats
-#undef mallopt
-#undef mallinfo
-
-static void malloc_update_mallinfo(void);
-
-/*
- * Define front-end functions for all user-visible entry points that may
- * trigger error().
- */
-#define skel(retdecl, retassign, call, retstmt)				     \
-  retdecl								     \
-  debug_file = file;							     \
-  debug_line = line;							     \
-  if (debug_file < debug_file_min)					     \
-    debug_file_min = debug_file;					     \
-  if (debug_file > debug_file_max)					     \
-    debug_file_max = debug_file;					     \
-  if (scanheap)								     \
-    malloc_update_mallinfo();						     \
-  retassign call;							     \
-  if (scanheap)								     \
-    malloc_update_mallinfo();						     \
-  debug_file = NULL;							     \
-  retstmt
-
-/*
- * The final letter of the names of the following macros is either r or v,
- * indicating that the macro handles functions with or without a return value,
- * respectively.
- */
-# define skelr(rettype, call)						     \
-  skel(rettype ret;, ret = , call, return ret)
-/*
- * AIX's xlc compiler doesn't like empty macro args, so specify useless but
- * compilable retdecl, retassign, and retstmt args:
- */
-#define skelv(call)							     \
-  skel(line += 0;, if (1), call, return)
-
-#define dbgargs			const char *file, int line
-
-/*
- * Front-end function definitions:
- */
-Void_t* malloc_dbg(size_t bytes, dbgargs) {
-  skelr(Void_t*, malloc(bytes));
-}
-void free_dbg(Void_t *mem, dbgargs) {
-  skelv(free(mem));
-}
-Void_t* realloc_dbg(Void_t *oldmem, size_t bytes, dbgargs) {
-  skelr(Void_t*, realloc(oldmem, bytes));
-}
-Void_t* memalign_dbg(size_t alignment, size_t bytes, dbgargs) {
-  skelr(Void_t*, dlmemalign(alignment, bytes));
-}
-Void_t* valloc_dbg(size_t bytes, dbgargs) {
-  skelr(Void_t*, dlvalloc(bytes));
-}
-Void_t* pvalloc_dbg(size_t bytes, dbgargs) {
-  skelr(Void_t*, dlpvalloc(bytes));
-}
-Void_t* calloc_dbg(size_t n, size_t elem_size, dbgargs) {
-  skelr(Void_t*, calloc(n, elem_size));
-}
-int malloc_trim_dbg(size_t pad, dbgargs) {
-  skelr(int, malloc_trim(pad));
-}
-size_t malloc_usable_size_dbg(Void_t *mem, dbgargs) {
-  skelr(size_t, malloc_usable_size(mem));
-}
-void malloc_stats_dbg(dbgargs) {
-  skelv(malloc_stats());
-}
-int mallopt_dbg(int flag, int value, dbgargs) {
-  skelr(int, dlmallopt(flag, value));
-}
-struct mallinfo mallinfo_dbg(dbgargs) {
-  skelr(struct mallinfo, dlmallinfo());
-}
-
-#undef skel
-#undef skelr
-#undef skelv
-#undef dbgargs
-
-#endif   /* DEBUG2 */
-
-/*
-  These routines make a number of assertions about the states
-  of data structures that should be true at all times. If any
-  are not true, it's very likely that a user program has somehow
-  trashed memory. (It's also possible that there is a coding error
-  in malloc. In which case, please report it!)
-*/
-
-#ifdef DEBUG3
-static int memtest(void *s, int c, size_t n)
-{
-  /*
-   * Return whether the N-byte memory region starting at S consists
-   * entirely of bytes with value C.
-   */
-  unsigned char *p = (unsigned char *)s;
-  size_t i;
-  for (i = 0; i < n; i++)
-    if (p[i] != (unsigned char)c)
-      return 0;
-  return 1;
-}
-#endif   /* DEBUG3 */
-
-#ifndef DEBUG3
-#define check_moats(P)
-#else
-#define check_moats  do_check_moats
-static void do_check_moats(mchunkptr p)
-{
-  INTERNAL_SIZE_T sz = chunksize(p);
-  unless(memtest((char *)chunk2mem(p) - MOATWIDTH, MOATFILL,
-		 MOATWIDTH), "region underflow", p);
-  unless(memtest((char *)p + sz - MOATWIDTH - p->pad, MOATFILL,
-		 MOATWIDTH + p->pad), "region overflow", p);
-}
-#endif   /* DEBUG3 */
-
-#if __STD_C
-static void do_check_chunk(mchunkptr p)
-#else
-static void do_check_chunk(p) mchunkptr p;
-#endif
-{
-  /* Try to ensure legal addresses before accessing any chunk fields, in the
-   * hope of issuing an informative message rather than causing a segv.
-   *
-   * The following chunk_is_mmapped() call accesses p->size #if HAVE_MMAP.
-   * This is unavoidable without maintaining a record of mmapped regions.
-   */
-  if (!chunk_is_mmapped(p))
-  {
-    INTERNAL_SIZE_T sz;
-
-    unless((char*)p >= sbrk_base, "chunk precedes sbrk_base", p);
-    unless((char*)p + MINSIZE <= (char*)top + chunksize(top),
-	   "chunk past sbrk area", p);
-
-    sz = chunksize(p);
-    if (p != top)
-      unless((char*)p + sz <= (char*)top, "chunk extends beyond top", p);
-    else
-      unless((char*)p + sz <= sbrk_base + sbrked_mem,
-	     "chunk extends past sbrk area", p);
-  }
-  check_moats(p);
-}
-
-#if __STD_C
-static void do_check_free_chunk(mchunkptr p)
-#else
-static void do_check_free_chunk(p) mchunkptr p;
-#endif
-{
-  INTERNAL_SIZE_T sz = chunksize(p);
-  mchunkptr next = chunk_at_offset(p, sz);
-
-  do_check_chunk(p);
-
-  /* Check whether it claims to be free ... */
-  unless(!inuse(p), "free chunk marked inuse", p);
-
-  /* Unless a special marker, must have OK fields */
-  if ((long)sz >= (long)MINSIZE)
-  {
-    unless((sz & ALIGN_MASK) == 0, "freed size defies alignment", p);
-    unless(aligned_OK(chunk2mem(p)), "misaligned freed region", p);
-    /* ... matching footer field */
-    unless(next->prev_size == sz, "chunk size mismatch", p);
-    /* ... and is fully consolidated */
-    unless(prev_inuse(p), "free chunk not joined with prev", p);
-    unless(next == top || inuse(next), "free chunk not joined with next", p);
-
-    /* ... and has minimally sane links */
-    unless(p->fd->bk == p, "broken forward link", p);
-    unless(p->bk->fd == p, "broken backward link", p);
-  }
-  else /* markers are always of size SIZE_SZ */
-    unless(sz == SIZE_SZ, "invalid small chunk size", p);
-}
-
-#if __STD_C
-static void do_check_inuse_chunk(mchunkptr p)
-#else
-static void do_check_inuse_chunk(p) mchunkptr p;
-#endif
-{
-  mchunkptr next;
-  do_check_chunk(p);
-
-  if (chunk_is_mmapped(p))
-    return;
-
-  /* Check whether it claims to be in use ... */
-#ifdef DEBUG3
-  unless(p->alloced, "memory not allocated", p);
-#endif
-  unless(inuse(p), "memory not allocated", p);
-
-  /* ... and is surrounded by OK chunks.
-    Since more things can be checked with free chunks than inuse ones,
-    if an inuse chunk borders them and debug is on, it's worth doing them.
-  */
-  if (!prev_inuse(p))
-  {
-    mchunkptr prv = prev_chunk(p);
-    unless(next_chunk(prv) == p, "prev link scrambled", p);
-    do_check_free_chunk(prv);
-  }
-  next = next_chunk(p);
-  if (next == top)
-  {
-    unless(prev_inuse(next), "top chunk wrongly thinks prev is unused", p);
-    unless(chunksize(next) >= MINSIZE, "top chunk too small", p);
-  }
-  else if (!inuse(next))
-    do_check_free_chunk(next);
-}
-
-#if __STD_C
-static void do_check_malloced_chunk(mchunkptr p, INTERNAL_SIZE_T s)
-#else
-static void do_check_malloced_chunk(p, s) mchunkptr p; INTERNAL_SIZE_T s;
-#endif
-{
-  INTERNAL_SIZE_T sz = chunksize(p);
-  long room = sz - s;
-
-  do_check_inuse_chunk(p);
-
-  /* Legal size ... */
-  unless((long)sz >= (long)MINSIZE, "chunk size too small", p);
-  unless((sz & ALIGN_MASK) == 0, "malloced size defies alignment", p);
-  unless(room >= 0, "chunk size too small for contents", p);
-  unless(room < (long)MINSIZE, "chunk size leaves too much spare room", p);
-
-  /* ... and alignment */
-  unless(aligned_OK(chunk2mem(p)), "misaligned malloced region", p);
-
-
-  /* ... and was allocated at front of an available chunk */
-  unless(prev_inuse(p), "malloced from the middle of a free chunk", p);
-}
-
-#ifdef DEBUG3
-static void init_alloced_chunk(mchunkptr p, size_t bytes)
-{
-  Void_t* mem = chunk2mem(p);
-  p->file = debug_file;
-  p->line = debug_line;
-  p->pad = chunksize(p) - OVERHEAD - bytes;
-  p->alloced = 1;
-  memset((char *)mem + bytes, MOATFILL, p->pad + MOATWIDTH);
-}
-
-static void do_init_malloced_chunk(mchunkptr p, size_t bytes)
-{
-  Void_t* mem = chunk2mem(p);
-  init_alloced_chunk(p, bytes);
-  memset((char *)mem - MOATWIDTH, MOATFILL, MOATWIDTH);
-  memset(mem, ALLOCFILL, bytes);
-}
-
-static void do_init_realloced_chunk(mchunkptr p, size_t bytes,
-				    INTERNAL_SIZE_T oldsize)
-{
-  Void_t* mem = chunk2mem(p);
-  INTERNAL_SIZE_T newsize = chunksize(p);
-  init_alloced_chunk(p, bytes);
-  if (oldsize < newsize)
-    /* This incorrectly leaves the leading pad area of the old trailing moat
-     * set to MOATFILL rather than ALLOCFILL.  An alternative is to save the
-     * old p->pad in rEALLOc() below and pass it to this function.
-     */
-    memset((char *)mem + oldsize - OVERHEAD, ALLOCFILL,
-	   bytes - (oldsize - OVERHEAD));
-}
-
-static void do_check_freefill(mchunkptr p, long newsize,
-			      INTERNAL_SIZE_T oldsize)
-{
-  /* The first newsize bytes of oldsize-byte chunk p are about to be
-   * allocated.  Issue a warning if any freefill locations in p that are about
-   * to be overwritten do not contain the character FREEFILL.
-   */
-  size_t bytes, maxbytes;
-  if (newsize <= 0)
-    return;
-  bytes = newsize - MEMOFFSET		/* don't check p's header */
-    + MEMOFFSET;			/* header of split-off remainder */
-  maxbytes = oldsize - OVERHEAD;
-  if (bytes > maxbytes)
-    bytes = maxbytes;
-  unless(memtest(chunk2mem(p), FREEFILL, bytes),
-	 "detected write to freed region", p);
-}
-
-static void do_init_freed_chunk(mchunkptr p, INTERNAL_SIZE_T freehead,
-				INTERNAL_SIZE_T freetail)
-{
-  /* freehead and freetail are the number of bytes at the beginning of p and
-   * end of p respectively that should already be initialized as free regions.
-   */
-  Void_t* mem = chunk2mem(p);
-  size_t size = chunksize(p);
-  size_t bytes = size - OVERHEAD;
-  p->pad = 0;
-  p->alloced = 0;
-  memset((char *)mem - MOATWIDTH, MOATFILL, MOATWIDTH);
-  memset((char *)mem + bytes, MOATFILL, MOATWIDTH);
-
-  /* To avoid terrible O(n^2) performance when free() repeatedly grows a free
-   * chunk, it's important not to free-fill regions that are already
-   * free-filled.
-   */
-  if (freehead + freetail < size) {
-    Void_t* start = !freehead ? mem : (char *)p + freehead - MOATWIDTH;
-    size_t len = (char *)p + size - (char *)start -
-      (!freetail ? MOATWIDTH : freetail - OVERHEAD);
-    memset(start, FREEFILL, len);
-  }
-}
-
-static void do_init_freeable_chunk(mchunkptr p)
-{
-  /* Arrange for the subsequent fREe(p) not to generate any warnings. */
-  init_alloced_chunk(p, chunksize(p) - OVERHEAD);
-  memset((char *)chunk2mem(p) - MOATWIDTH, MOATFILL, MOATWIDTH);
-}
-
-static void do_maximize_chunk(mchunkptr p)
-{
-  if (p->pad) {
-    Void_t* mem = chunk2mem(p);
-    size_t bytes = chunksize(p) - OVERHEAD - p->pad;
-    memset((char *)mem + bytes, ALLOCFILL, p->pad);
-    p->pad = 0;
-  }
-}
-
-static int do_check_init(void)
-{
-  /* Called from the first invocation of malloc_extend_top(), as detected by
-   * sbrk_base == -1.  Return whether this function allocated any memory.
-   */
-  static int state = 0;		/* 1 => initializing, 2 => initialized */
-  if (state == 1)
-    return 0;
-  unless(state == 0, "multiple calls to check_init", NULL);
-  state++;
-  atexit(malloc_update_mallinfo);	/* calls malloc on WinNT */
-  return sbrk_base != (char *)-1;
-}
-#endif   /* DEBUG3 */
-
-static mchunkptr lowest_chunk;
-
-#define check_free_chunk(P)  do_check_free_chunk(P)
-#define check_inuse_chunk(P) do_check_inuse_chunk(P)
-#define check_chunk(P) do_check_chunk(P)
-#define check_malloced_chunk(P,N) do_check_malloced_chunk(P,N)
-#else   /* !DEBUG */
-#define check_free_chunk(P)
-#define check_inuse_chunk(P)
-#define check_chunk(P)
-#define check_malloced_chunk(P,N)
-#endif   /* !DEBUG */
-
-#ifdef DEBUG3
-#define check_init            do_check_init
-#define init_malloced_chunk   do_init_malloced_chunk
-#define init_realloced_chunk  do_init_realloced_chunk
-#define check_freefill        do_check_freefill
-#define init_freed_chunk      do_init_freed_chunk
-#define init_freeable_chunk   do_init_freeable_chunk
-#define maximize_chunk        do_maximize_chunk
-#else
-#define check_init()          0
-#define init_malloced_chunk(P,B)
-#define init_realloced_chunk(P,B,O)
-#define check_freefill(P,N,O)
-#define init_freed_chunk(P,H,T)
-#define init_freeable_chunk(P)
-#define maximize_chunk(P)
-#endif   /* !DEBUG3 */
-
-
-
-/*
-  Macro-based internal utilities
-*/
-
-
-/*
-  Linking chunks in bin lists.
-  Call these only with variables, not arbitrary expressions, as arguments.
-*/
-
-/*
-  Place chunk p of size s in its bin, in size order,
-  putting it ahead of others of same size.
-*/
-
-
-#define frontlink(P, S, IDX, BK, FD)                                          \
-{                                                                             \
-  if (S < MAX_SMALLBIN_SIZE)                                                  \
-  {                                                                           \
-    IDX = smallbin_index(S);                                                  \
-    mark_binblock(IDX);                                                       \
-    BK = bin_at(IDX);                                                         \
-    FD = BK->fd;                                                              \
-    P->bk = BK;                                                               \
-    P->fd = FD;                                                               \
-    FD->bk = BK->fd = P;                                                      \
-  }                                                                           \
-  else                                                                        \
-  {                                                                           \
-    IDX = bin_index(S);                                                       \
-    BK = bin_at(IDX);                                                         \
-    FD = BK->fd;                                                              \
-    if (FD == BK) mark_binblock(IDX);                                         \
-    else                                                                      \
-    {                                                                         \
-      while (FD != BK && S < chunksize(FD)) FD = FD->fd;                      \
-      BK = FD->bk;                                                            \
-    }                                                                         \
-    P->bk = BK;                                                               \
-    P->fd = FD;                                                               \
-    FD->bk = BK->fd = P;                                                      \
-  }                                                                           \
-}
-
-
-/* take a chunk off a list */
-
-#define unlink(P, BK, FD)                                                     \
-{                                                                             \
-  BK = P->bk;                                                                 \
-  FD = P->fd;                                                                 \
-  FD->bk = BK;                                                                \
-  BK->fd = FD;                                                                \
-}                                                                             \
-
-/* Place p as the last remainder */
-
-#define link_last_remainder(P)                                                \
-{                                                                             \
-  last_remainder->fd = last_remainder->bk =  P;                               \
-  P->fd = P->bk = last_remainder;                                             \
-}
-
-/* Clear the last_remainder bin */
-
-#define clear_last_remainder \
-  (last_remainder->fd = last_remainder->bk = last_remainder)
-
-
-
-
-
-
-/* Routines dealing with mmap(). */
-
-#if HAVE_MMAP
-
-#if __STD_C
-static mchunkptr mmap_chunk(size_t size)
-#else
-static mchunkptr mmap_chunk(size) size_t size;
-#endif
-{
-  size_t page_mask = malloc_getpagesize - 1;
-  mchunkptr p;
-
-#ifndef MAP_ANONYMOUS
-  static int fd = -1;
-#endif
-
-  if(n_mmaps >= n_mmaps_max) return 0; /* too many regions */
-
-  size = (size + MMAP_EXTRA + page_mask) & ~page_mask;
-
-#ifdef MAP_ANONYMOUS
-  p = (mchunkptr)mmap(0, size, PROT_READ|PROT_WRITE,
-		      MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
-#else /* !MAP_ANONYMOUS */
-  if (fd < 0)
-  {
-    fd = open("/dev/zero", O_RDWR);
-    if(fd < 0) return 0;
-  }
-  p = (mchunkptr)mmap(0, size, PROT_READ|PROT_WRITE, MAP_PRIVATE, fd, 0);
-#endif
-
-  if(p == (mchunkptr)-1) return 0;
-
-  n_mmaps++;
-  if (n_mmaps > max_n_mmaps) max_n_mmaps = n_mmaps;
-
-  /* We demand that eight bytes into a page must be 8-byte aligned. */
-  assert(aligned_OK(chunk2mem(p)));
-
-  /* The offset to the start of the mmapped region is stored
-   * in the prev_size field of the chunk; normally it is zero,
-   * but that can be changed in memalign().
-   */
-  p->prev_size = 0;
-  set_head(p, size|IS_MMAPPED);
-
-  mmapped_mem += size;
-  if ((unsigned long)mmapped_mem > (unsigned long)max_mmapped_mem)
-    max_mmapped_mem = mmapped_mem;
-  if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem)
-    max_total_mem = mmapped_mem + sbrked_mem;
-  return p;
-}
-
-#if __STD_C
-static void munmap_chunk(mchunkptr p)
-#else
-static void munmap_chunk(p) mchunkptr p;
-#endif
-{
-  INTERNAL_SIZE_T size = chunksize(p);
-  int ret;
-
-  assert (chunk_is_mmapped(p));
-  assert(! ((char*)p >= sbrk_base && (char*)p < sbrk_base + sbrked_mem));
-  assert((n_mmaps > 0));
-  assert(((p->prev_size + size) & (malloc_getpagesize-1)) == 0);
-
-  n_mmaps--;
-  mmapped_mem -= (size + p->prev_size);
-
-  ret = munmap((char *)p - p->prev_size, size + p->prev_size);
-
-  /* munmap returns non-zero on failure */
-  assert(ret == 0);
-}
-
-#if HAVE_MREMAP
-
-#if __STD_C
-static mchunkptr mremap_chunk(mchunkptr p, size_t new_size)
-#else
-static mchunkptr mremap_chunk(p, new_size) mchunkptr p; size_t new_size;
-#endif
-{
-  size_t page_mask = malloc_getpagesize - 1;
-  INTERNAL_SIZE_T offset = p->prev_size;
-  INTERNAL_SIZE_T size = chunksize(p);
-  char *cp;
-
-  assert (chunk_is_mmapped(p));
-  assert(! ((char*)p >= sbrk_base && (char*)p < sbrk_base + sbrked_mem));
-  assert((n_mmaps > 0));
-  assert(((size + offset) & (malloc_getpagesize-1)) == 0);
-
-  new_size = (new_size + offset + MMAP_EXTRA + page_mask) & ~page_mask;
-
-  cp = (char *)mremap((char *)p - offset, size + offset, new_size, 1);
-
-  if (cp == (char *)-1) return 0;
-
-  p = (mchunkptr)(cp + offset);
-
-  assert(aligned_OK(chunk2mem(p)));
-
-  assert(p->prev_size == offset);
-  set_head(p, (new_size - offset)|IS_MMAPPED);
-
-  mmapped_mem -= size + offset;
-  mmapped_mem += new_size;
-  if ((unsigned long)mmapped_mem > (unsigned long)max_mmapped_mem)
-    max_mmapped_mem = mmapped_mem;
-  if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem)
-    max_total_mem = mmapped_mem + sbrked_mem;
-  return p;
-}
-
-#endif /* HAVE_MREMAP */
-
-#endif /* HAVE_MMAP */
-
-
-
-
-/*
-  Extend the top-most chunk by obtaining memory from system.
-  Main interface to sbrk (but see also malloc_trim).
-*/
-
-#if __STD_C
-static void malloc_extend_top(INTERNAL_SIZE_T nb)
-#else
-static void malloc_extend_top(nb) INTERNAL_SIZE_T nb;
-#endif
-{
-  char*     lim;                  /* return value from sbrk */
-  INTERNAL_SIZE_T front_misalign; /* unusable bytes at front of sbrked space */
-  INTERNAL_SIZE_T correction;     /* bytes for 2nd sbrk call */
-  char*     new_lim;              /* return of 2nd sbrk call */
-  INTERNAL_SIZE_T top_size;       /* new size of top chunk */
-
-  mchunkptr old_top     = top;  /* Record state of old top */
-  INTERNAL_SIZE_T old_top_size = chunksize(old_top);
-  char*     old_end      = (char*)(chunk_at_offset(old_top, old_top_size));
-
-  /* Pad request with top_pad plus minimal overhead */
-
-  INTERNAL_SIZE_T    sbrk_size     = nb + top_pad + MINSIZE;
-  unsigned long pagesz    = malloc_getpagesize;
-
-  /* If not the first time through, round to preserve page boundary */
-  /* Otherwise, we need to correct to a page size below anyway. */
-  /* (We also correct below if an intervening foreign sbrk call.) */
-
-  if (sbrk_base != (char*)(-1))
-    sbrk_size = (sbrk_size + (pagesz - 1)) & ~(pagesz - 1);
-
-  else if (check_init()) {
-    if (chunksize(top) - nb < (long)MINSIZE)
-      malloc_extend_top(nb);
-    return;
-  }
-
-  lim = (char*)(MORECORE (sbrk_size));
-
-  /* Fail if sbrk failed or if a foreign sbrk call killed our space */
-  if (lim == (char*)(MORECORE_FAILURE) ||
-      (lim < old_end && old_top != initial_top))
-    return;
-
-  sbrked_mem += sbrk_size;
-
-  if (lim == old_end) /* can just add bytes to current top */
-  {
-    top_size = sbrk_size + old_top_size;
-    set_head(top, top_size | PREV_INUSE);
-  }
-  else
-  {
-#ifdef SBRKDBG
-    INTERNAL_SIZE_T padding = (char *)sbrk (0) - (lim + sbrk_size);
-    sbrk_size += padding;
-    sbrked_mem += padding;
-#endif
-
-    if (sbrk_base == (char*)(-1))  /* First time through. Record base */
-      sbrk_base = lim;
-    else  /* Someone else called sbrk().  Count those bytes as sbrked_mem. */
-      sbrked_mem += lim - (char*)old_end;
-
-    /* Guarantee alignment of first new chunk made from this space */
-    front_misalign = (unsigned long)chunk2mem(lim) & ALIGN_MASK;
-    if (front_misalign > 0)
-    {
-      correction = (ALIGNMENT) - front_misalign;
-      lim += correction;
-    }
-    else
-      correction = 0;
-
-    /* Guarantee the next brk will be at a page boundary */
-    correction += pagesz - ((unsigned long)(lim + sbrk_size) & (pagesz - 1));
-
-    /* Allocate correction */
-    new_lim = (char*)(MORECORE (correction));
-    if (new_lim == (char*)(MORECORE_FAILURE)) return;
-
-    sbrked_mem += correction;
-
-    top = (mchunkptr)lim;
-    top_size = new_lim - lim + correction;
-    set_head(top, top_size | PREV_INUSE);
-#if DEBUG
-    lowest_chunk = top;
-#endif
-
-#ifdef OTHER_SBRKS
-    if (old_top != initial_top)
-    {
-
-      /* There must have been an intervening foreign sbrk call. */
-      /* A double fencepost is necessary to prevent consolidation */
-
-      /* If not enough space to do this, then user did something very wrong */
-      if (old_top_size < MINSIZE)
-      {
-	set_head(top, PREV_INUSE); /* will force null return from malloc */
-	return;
-      }
-
-      old_top_size -= 2*SIZE_SZ;
-      chunk_at_offset(old_top, old_top_size          )->size =
-	SIZE_SZ|PREV_INUSE;
-      chunk_at_offset(old_top, old_top_size + SIZE_SZ)->size =
-	SIZE_SZ|PREV_INUSE;
-      set_head_size(old_top, old_top_size);
-      /* If possible, release the rest. */
-      if (old_top_size >= MINSIZE) {
-	init_freeable_chunk(old_top);
-	fREe(chunk2mem(old_top));
-      }
-    }
-#endif   /* OTHER_SBRKS */
-  }
-
-  init_freed_chunk(top, old_top == initial_top ? old_top_size : 0, 0);
-
-  if ((unsigned long)sbrked_mem > (unsigned long)max_sbrked_mem)
-    max_sbrked_mem = sbrked_mem;
-  if ((unsigned long)(mmapped_mem + sbrked_mem) > (unsigned long)max_total_mem)
-    max_total_mem = mmapped_mem + sbrked_mem;
-
-  /* We always land on a page boundary */
-  assert(((unsigned long)((char*)top + top_size) & (pagesz - 1)) == 0);
-}
-
-
-
-
-/* Main public routines */
-
-
-/*
-  Malloc Algorthim:
-
-    The requested size is first converted into a usable form, `nb'.
-    This currently means to add 4 bytes overhead plus possibly more to
-    obtain 8-byte alignment and/or to obtain a size of at least
-    MINSIZE (currently 16 bytes), the smallest allocatable size.
-    (All fits are considered `exact' if they are within MINSIZE bytes.)
-
-    From there, the first successful of the following steps is taken:
-
-      1. The bin corresponding to the request size is scanned, and if
-	 a chunk of exactly the right size is found, it is taken.
-
-      2. The most recently remaindered chunk is used if it is big
-	 enough.  This is a form of (roving) first fit, used only in
-	 the absence of exact fits. Runs of consecutive requests use
-	 the remainder of the chunk used for the previous such request
-	 whenever possible. This limited use of a first-fit style
-	 allocation strategy tends to give contiguous chunks
-	 coextensive lifetimes, which improves locality and can reduce
-	 fragmentation in the long run.
-
-      3. Other bins are scanned in increasing size order, using a
-	 chunk big enough to fulfill the request, and splitting off
-	 any remainder.  This search is strictly by best-fit; i.e.,
-	 the smallest (with ties going to approximately the least
-	 recently used) chunk that fits is selected.
-
-      4. If large enough, the chunk bordering the end of memory
-	 (`top') is split off. (This use of `top' is in accord with
-	 the best-fit search rule.  In effect, `top' is treated as
-	 larger (and thus less well fitting) than any other available
-	 chunk since it can be extended to be as large as necessary
-	 (up to system limitations).
-
-      5. If the request size meets the mmap threshold and the
-	 system supports mmap, and there are few enough currently
-	 allocated mmapped regions, and a call to mmap succeeds,
-	 the request is allocated via direct memory mapping.
-
-      6. Otherwise, the top of memory is extended by
-	 obtaining more space from the system (normally using sbrk,
-	 but definable to anything else via the MORECORE macro).
-	 Memory is gathered from the system (in system page-sized
-	 units) in a way that allows chunks obtained across different
-	 sbrk calls to be consolidated, but does not require
-	 contiguous memory. Thus, it should be safe to intersperse
-	 mallocs with other sbrk calls.
-
-
-      All allocations are made from the the `lowest' part of any found
-      chunk. (The implementation invariant is that prev_inuse is
-      always true of any allocated chunk; i.e., that each allocated
-      chunk borders either a previously allocated and still in-use chunk,
-      or the base of its memory arena.)
-
-*/
-
-#if __STD_C
-Void_t* mALLOc(size_t bytes)
-#else
-Void_t* mALLOc(bytes) size_t bytes;
-#endif
-{
-  mchunkptr victim;                  /* inspected/selected chunk */
-  INTERNAL_SIZE_T victim_size;       /* its size */
-  int       idx;                     /* index for bin traversal */
-  mbinptr   bin;                     /* associated bin */
-  mchunkptr remainder;               /* remainder from a split */
-  long      remainder_size;          /* its size */
-  int       remainder_index;         /* its bin index */
-  unsigned long block;               /* block traverser bit */
-  int       startidx;                /* first bin of a traversed block */
-  mchunkptr fwd;                     /* misc temp for linking */
-  mchunkptr bck;                     /* misc temp for linking */
-  mbinptr q;                         /* misc temp */
-
-  INTERNAL_SIZE_T nb  = request2size(bytes);  /* padded request size; */
-
-  /* Check for exact match in a bin */
-
-  if (is_small_request(nb))  /* Faster version for small requests */
-  {
-    idx = smallbin_index(nb);
-
-    /* No traversal or size check necessary for small bins.  */
-
-    q = bin_at(idx);
-    victim = last(q);
-
-    /* Also scan the next one, since it would have a remainder < MINSIZE */
-    if (victim == q)
-    {
-      q = next_bin(q);
-      victim = last(q);
-    }
-    if (victim != q)
-    {
-      victim_size = chunksize(victim);
-      unlink(victim, bck, fwd);
-      set_inuse_bit_at_offset(victim, victim_size);
-      check_freefill(victim, victim_size, victim_size);
-      init_malloced_chunk(victim, bytes);
-      check_malloced_chunk(victim, nb);
-
-      return chunk2mem(victim);
-    }
-
-    idx += 2; /* Set for bin scan below. We've already scanned 2 bins. */
-
-  }
-  else
-  {
-    idx = bin_index(nb);
-    bin = bin_at(idx);
-
-    for (victim = last(bin); victim != bin; victim = victim->bk)
-    {
-      victim_size = chunksize(victim);
-      remainder_size = victim_size - nb;
-
-      if (remainder_size >= (long)MINSIZE) /* too big */
-      {
-	--idx; /* adjust to rescan below after checking last remainder */
-	break;
-      }
-
-      else if (remainder_size >= 0) /* exact fit */
-      {
-	unlink(victim, bck, fwd);
-	set_inuse_bit_at_offset(victim, victim_size);
-	check_freefill(victim, victim_size, victim_size);
-	init_malloced_chunk(victim, bytes);
-	check_malloced_chunk(victim, nb);
-	return chunk2mem(victim);
-      }
-    }
-
-    ++idx;
-
-  }
-
-  /* Try to use the last split-off remainder */
-
-  if ( (victim = last_remainder->fd) != last_remainder)
-  {
-    victim_size = chunksize(victim);
-    remainder_size = victim_size - nb;
-
-    if (remainder_size >= (long)MINSIZE) /* re-split */
-    {
-      remainder = chunk_at_offset(victim, nb);
-      set_head(victim, nb | PREV_INUSE);
-      check_freefill(victim, nb, victim_size);
-      init_malloced_chunk(victim, bytes);
-      link_last_remainder(remainder);
-      set_head(remainder, remainder_size | PREV_INUSE);
-      set_foot(remainder, remainder_size);
-      init_freed_chunk(remainder, remainder_size, 0);
-      check_malloced_chunk(victim, nb);
-      return chunk2mem(victim);
-    }
-
-    clear_last_remainder;
-
-    if (remainder_size >= 0)  /* exhaust */
-    {
-      set_inuse_bit_at_offset(victim, victim_size);
-      check_freefill(victim, victim_size, victim_size);
-      init_malloced_chunk(victim, bytes);
-      check_malloced_chunk(victim, nb);
-      return chunk2mem(victim);
-    }
-
-    /* Else place in bin */
-
-    frontlink(victim, victim_size, remainder_index, bck, fwd);
-  }
-
-  /*
-     If there are any possibly nonempty big-enough blocks,
-     search for best fitting chunk by scanning bins in blockwidth units.
-  */
-
-  if ( (block = idx2binblock(idx)) <= binblocks)
-  {
-
-    /* Get to the first marked block */
-
-    if ( (block & binblocks) == 0)
-    {
-      /* force to an even block boundary */
-      idx = (idx & ~(BINBLOCKWIDTH - 1)) + BINBLOCKWIDTH;
-      block <<= 1;
-      while ((block & binblocks) == 0)
-      {
-	idx += BINBLOCKWIDTH;
-	block <<= 1;
-      }
-    }
-
-    /* For each possibly nonempty block ... */
-    for (;;)
-    {
-      startidx = idx;          /* (track incomplete blocks) */
-      q = bin = bin_at(idx);
-
-      /* For each bin in this block ... */
-      do
-      {
-	/* Find and use first big enough chunk ... */
-
-	for (victim = last(bin); victim != bin; victim = victim->bk)
-	{
-	  victim_size = chunksize(victim);
-	  remainder_size = victim_size - nb;
-
-	  if (remainder_size >= (long)MINSIZE) /* split */
-	  {
-	    remainder = chunk_at_offset(victim, nb);
-	    set_head(victim, nb | PREV_INUSE);
-	    check_freefill(victim, nb, victim_size);
-	    unlink(victim, bck, fwd);
-	    init_malloced_chunk(victim, bytes);
-	    link_last_remainder(remainder);
-	    set_head(remainder, remainder_size | PREV_INUSE);
-	    set_foot(remainder, remainder_size);
-	    init_freed_chunk(remainder, remainder_size, 0);
-	    check_malloced_chunk(victim, nb);
-	    return chunk2mem(victim);
-	  }
-
-	  else if (remainder_size >= 0)  /* take */
-	  {
-	    check_freefill(victim, victim_size, victim_size);
-	    set_inuse_bit_at_offset(victim, victim_size);
-	    unlink(victim, bck, fwd);
-	    init_malloced_chunk(victim, bytes);
-	    check_malloced_chunk(victim, nb);
-	    return chunk2mem(victim);
-	  }
-
-	}
-
-       bin = next_bin(bin);
-
-      } while ((++idx & (BINBLOCKWIDTH - 1)) != 0);
-
-      /* Clear out the block bit. */
-
-      do   /* Possibly backtrack to try to clear a partial block */
-      {
-	if ((startidx & (BINBLOCKWIDTH - 1)) == 0)
-	{
-	  binblocks &= ~block;
-	  break;
-	}
-	--startidx;
-       q = prev_bin(q);
-      } while (first(q) == q);
-
-      /* Get to the next possibly nonempty block */
-
-      if ( (block <<= 1) <= binblocks && (block != 0) )
-      {
-	while ((block & binblocks) == 0)
-	{
-	  idx += BINBLOCKWIDTH;
-	  block <<= 1;
-	}
-      }
-      else
-	break;
-    }
-  }
-
-
-  /* Try to use top chunk */
-
-  /* Require that there be a remainder, ensuring top always exists  */
-  if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
-  {
-
-#if HAVE_MMAP
-    /* If big and would otherwise need to extend, try to use mmap instead */
-    if ((unsigned long)nb >= (unsigned long)mmap_threshold &&
-	(victim = mmap_chunk(nb)) != 0) {
-      init_malloced_chunk(victim, bytes);
-      return chunk2mem(victim);
-    }
-#endif
-
-    /* Try to extend */
-    malloc_extend_top(nb);
-    if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
-      return 0; /* propagate failure */
-  }
-
-  victim = top;
-  set_head(victim, nb | PREV_INUSE);
-  check_freefill(victim, nb, nb + remainder_size);
-  init_malloced_chunk(victim, bytes);
-  top = chunk_at_offset(victim, nb);
-  set_head(top, remainder_size | PREV_INUSE);
-  init_freed_chunk(top, remainder_size, 0);
-  check_malloced_chunk(victim, nb);
-  return chunk2mem(victim);
-
-}
-
-
-
-
-/*
-
-  free() algorithm :
-
-    cases:
-
-       1. free(0) has no effect.
-
-       2. If the chunk was allocated via mmap, it is release via munmap().
-
-       3. If a returned chunk borders the current high end of memory,
-	  it is consolidated into the top, and if the total unused
-	  topmost memory exceeds the trim threshold, malloc_trim is
-	  called.
-
-       4. Other chunks are consolidated as they arrive, and
-	  placed in corresponding bins. (This includes the case of
-	  consolidating with the current `last_remainder').
-
-*/
-
-
-#if __STD_C
-void fREe(Void_t* mem)
-#else
-void fREe(mem) Void_t* mem;
-#endif
-{
-  mchunkptr p;         /* chunk corresponding to mem */
-  INTERNAL_SIZE_T hd;  /* its head field */
-  INTERNAL_SIZE_T sz;  /* its size */
-  int       idx;       /* its bin index */
-  mchunkptr next;      /* next contiguous chunk */
-  INTERNAL_SIZE_T nextsz; /* its size */
-  INTERNAL_SIZE_T prevsz; /* size of previous contiguous chunk */
-  mchunkptr bck;       /* misc temp for linking */
-  mchunkptr fwd;       /* misc temp for linking */
-  int       islr;      /* track whether merging with last_remainder */
-
-  if (mem == 0)                              /* free(0) has no effect */
-    return;
-
-  p = mem2chunk(mem);
-  check_inuse_chunk(p);
-
-  hd = p->size;
-
-#if HAVE_MMAP
-  if (hd & IS_MMAPPED)                       /* release mmapped memory. */
-  {
-    munmap_chunk(p);
-    return;
-  }
-#endif
-
-  sz = hd & ~PREV_INUSE;
-  next = chunk_at_offset(p, sz);
-  nextsz = chunksize(next);
-  prevsz = 0;                                 /* avoid compiler warnings */
-
-  if (next == top)                            /* merge with top */
-  {
-    sz += nextsz;
-
-    if (!(hd & PREV_INUSE))                    /* consolidate backward */
-    {
-      prevsz = p->prev_size;
-      p = chunk_at_offset(p, -(long)prevsz);
-      sz += prevsz;
-      unlink(p, bck, fwd);
-    }
-
-    set_head(p, sz | PREV_INUSE);
-    top = p;
-    init_freed_chunk(top, !(hd & PREV_INUSE) ? prevsz : 0, nextsz);
-    if ((unsigned long)(sz) >= trim_threshold)
-      malloc_trim(top_pad);
-    return;
-  }
-
-  set_head(next, nextsz);                    /* clear inuse bit */
-
-  islr = 0;
-
-  if (!(hd & PREV_INUSE))                    /* consolidate backward */
-  {
-    prevsz = p->prev_size;
-    p = chunk_at_offset(p, -(long)prevsz);
-    sz += prevsz;
-
-    if (p->fd == last_remainder)             /* keep as last_remainder */
-      islr = 1;
-    else
-      unlink(p, bck, fwd);
-  }
-
-  if (!(inuse_bit_at_offset(next, nextsz)))   /* consolidate forward */
-  {
-    sz += nextsz;
-
-    if (!islr && next->fd == last_remainder)  /* re-insert last_remainder */
-    {
-      islr = 1;
-      link_last_remainder(p);
-    }
-    else
-      unlink(next, bck, fwd);
-  }
-
-
-  set_head(p, sz | PREV_INUSE);
-  set_foot(p, sz);
-  if (!islr)
-    frontlink(p, sz, idx, bck, fwd);
-  init_freed_chunk(p, !(hd & PREV_INUSE) ? prevsz : 0,
-		   !inuse_bit_at_offset(next, nextsz) ? nextsz : 0);
-}
-
-
-
-
-
-/*
-
-  Realloc algorithm:
-
-    Chunks that were obtained via mmap cannot be extended or shrunk
-    unless HAVE_MREMAP is defined, in which case mremap is used.
-    Otherwise, if their reallocation is for additional space, they are
-    copied.  If for less, they are just left alone.
-
-    Otherwise, if the reallocation is for additional space, and the
-    chunk can be extended, it is, else a malloc-copy-free sequence is
-    taken.  There are several different ways that a chunk could be
-    extended. All are tried:
-
-       * Extending forward into following adjacent free chunk.
-       * Shifting backwards, joining preceding adjacent space
-       * Both shifting backwards and extending forward.
-       * Extending into newly sbrked space
-
-    Unless the #define realloc_ZERO_BYTES_FREES is set, realloc with a
-    size argument of zero (re)allocates a minimum-sized chunk.
-
-    If the reallocation is for less space, and the new request is for
-    a `small' (<512 bytes) size, then the newly unused space is lopped
-    off and freed.
-
-    The old unix realloc convention of allowing the last-free'd chunk
-    to be used as an argument to realloc is no longer supported.
-    I don't know of any programs still relying on this feature,
-    and allowing it would also allow too many other incorrect
-    usages of realloc to be sensible.
-
-
-*/
-
-
-#if __STD_C
-Void_t* rEALLOc(Void_t* oldmem, size_t bytes)
-#else
-Void_t* rEALLOc(oldmem, bytes) Void_t* oldmem; size_t bytes;
-#endif
-{
-  INTERNAL_SIZE_T    nb;      /* padded request size */
-
-  mchunkptr oldp;             /* chunk corresponding to oldmem */
-  INTERNAL_SIZE_T    oldsize; /* its size */
-
-  mchunkptr newp;             /* chunk to return */
-  INTERNAL_SIZE_T    newsize; /* its size */
-  Void_t*   newmem;           /* corresponding user mem */
-
-  mchunkptr next;             /* next contiguous chunk after oldp */
-  INTERNAL_SIZE_T  nextsize;  /* its size */
-
-  mchunkptr prev;             /* previous contiguous chunk before oldp */
-  INTERNAL_SIZE_T  prevsize;  /* its size */
-
-  mchunkptr remainder;        /* holds split off extra space from newp */
-  INTERNAL_SIZE_T  remainder_size;   /* its size */
-
-  mchunkptr bck;              /* misc temp for linking */
-  mchunkptr fwd;              /* misc temp for linking */
-
-#ifdef realloc_ZERO_BYTES_FREES
-  if (bytes == 0) { fREe(oldmem); return 0; }
-#endif
-
-
-  /* realloc of null is supposed to be same as malloc */
-  if (oldmem == 0) return mALLOc(bytes);
-
-  newp    = oldp    = mem2chunk(oldmem);
-  newsize = oldsize = chunksize(oldp);
-
-
-  nb = request2size(bytes);
-
-  check_inuse_chunk(oldp);
-
-#if HAVE_MMAP
-  if (chunk_is_mmapped(oldp))
-  {
-    if (oldsize - MMAP_EXTRA >= nb) {
-      init_realloced_chunk(oldp, bytes, oldsize);
-      return oldmem; /* do nothing */
-    }
-#if HAVE_MREMAP
-    newp = mremap_chunk(oldp, nb);
-    if (newp) {
-      init_realloced_chunk(newp, bytes, oldsize);
-      return chunk2mem(newp);
-    }
-#endif
-    /* Must alloc, copy, free. */
-    newmem = mALLOc(bytes);
-    if (newmem == 0) return 0; /* propagate failure */
-    malloc_COPY(newmem, oldmem, oldsize - OVERHEAD - MMAP_EXTRA);
-    munmap_chunk(oldp);
-    return newmem;
-  }
-#endif
-
-  if (oldsize < nb)
-  {
-
-    /* Try expanding forward */
-
-    next = chunk_at_offset(oldp, oldsize);
-    if (next == top || !inuse(next))
-    {
-      nextsize = chunksize(next);
-
-      /* Forward into top only if a remainder */
-      if (next == top)
-      {
-	if ((long)(nextsize + newsize) >= (long)(nb + MINSIZE))
-	{
-	  check_freefill(next, nb - oldsize, nextsize);
-	  newsize += nextsize;
-	  top = chunk_at_offset(oldp, nb);
-	  set_head(top, (newsize - nb) | PREV_INUSE);
-	  init_freed_chunk(top, newsize - nb, 0);
-	  set_head_size(oldp, nb);
-	  init_realloced_chunk(oldp, bytes, oldsize);
-	  return chunk2mem(oldp);
-	}
-      }
-
-      /* Forward into next chunk */
-      else if (((long)(nextsize + newsize) >= (long)nb))
-      {
-	check_freefill(next, nb - oldsize, nextsize);
-	unlink(next, bck, fwd);
-	newsize  += nextsize;
-	goto split;
-      }
-    }
-    else
-    {
-      next = 0;
-      nextsize = 0;
-    }
-
-    /* Try shifting backwards. */
-
-    if (!prev_inuse(oldp))
-    {
-      prev = prev_chunk(oldp);
-      prevsize = chunksize(prev);
-
-      /* try forward + backward first to save a later consolidation */
-
-      if (next != 0)
-      {
-	/* into top */
-	if (next == top)
-	{
-	  if ((long)(nextsize + prevsize + newsize) >= (long)(nb + MINSIZE))
-	  {
-	    check_freefill(prev, nb, prevsize);
-	    check_freefill(next, nb - (prevsize + newsize), nextsize);
-	    unlink(prev, bck, fwd);
-	    newp = prev;
-	    newsize += prevsize + nextsize;
-	    newmem = chunk2mem(newp);
-	    malloc_COPY(newmem, oldmem, oldsize - OVERHEAD);
-	    top = chunk_at_offset(newp, nb);
-	    set_head(top, (newsize - nb) | PREV_INUSE);
-	    init_freed_chunk(top, newsize - nb, 0);
-	    set_head_size(newp, nb);
-	    init_realloced_chunk(newp, bytes, oldsize);
-	    return newmem;
-	  }
-	}
-
-	/* into next chunk */
-	else if (((long)(nextsize + prevsize + newsize) >= (long)(nb)))
-	{
-	  check_freefill(prev, nb, prevsize);
-	  check_freefill(next, nb - (prevsize + newsize), nextsize);
-	  unlink(next, bck, fwd);
-	  unlink(prev, bck, fwd);
-	  newp = prev;
-	  newsize += nextsize + prevsize;
-	  newmem = chunk2mem(newp);
-	  malloc_COPY(newmem, oldmem, oldsize - OVERHEAD);
-	  goto split;
-	}
-      }
-
-      /* backward only */
-      if (prev != 0 && (long)(prevsize + newsize) >= (long)nb)
-      {
-	check_freefill(prev, nb, prevsize);
-	unlink(prev, bck, fwd);
-	newp = prev;
-	newsize += prevsize;
-	newmem = chunk2mem(newp);
-	malloc_COPY(newmem, oldmem, oldsize - OVERHEAD);
-	goto split;
-      }
-    }
-
-    /* Must allocate */
-
-    newmem = mALLOc (bytes);
-
-    if (newmem == 0)  /* propagate failure */
-      return 0;
-
-    /* Avoid copy if newp is next chunk after oldp. */
-    /* (This can only happen when new chunk is sbrk'ed.) */
-
-    if ( (newp = mem2chunk(newmem)) == next_chunk(oldp))
-    {
-      newsize += chunksize(newp);
-      newp = oldp;
-      goto split;
-    }
-
-    /* Otherwise copy, free, and exit */
-    malloc_COPY(newmem, oldmem, oldsize - OVERHEAD);
-    fREe(oldmem);
-    return newmem;
-  }
-
-
- split:  /* split off extra room in old or expanded chunk */
-
-  if (newsize - nb >= MINSIZE) /* split off remainder */
-  {
-    remainder = chunk_at_offset(newp, nb);
-    remainder_size = newsize - nb;
-    set_head_size(newp, nb);
-    set_head(remainder, remainder_size | PREV_INUSE);
-    set_inuse_bit_at_offset(remainder, remainder_size);
-    init_malloced_chunk(remainder, remainder_size - OVERHEAD);
-    fREe(chunk2mem(remainder)); /* let free() deal with it */
-  }
-  else
-  {
-    set_head_size(newp, newsize);
-    set_inuse_bit_at_offset(newp, newsize);
-  }
-
-  init_realloced_chunk(newp, bytes, oldsize);
-  check_inuse_chunk(newp);
-  return chunk2mem(newp);
-}
-
-
-
-
-/*
-
-  memalign algorithm:
-
-    memalign requests more than enough space from malloc, finds a spot
-    within that chunk that meets the alignment request, and then
-    possibly frees the leading and trailing space.
-
-    The alignment argument must be a power of two. This property is not
-    checked by memalign, so misuse may result in random runtime errors.
-
-    8-byte alignment is guaranteed by normal malloc calls, so don't
-    bother calling memalign with an argument of 8 or less.
-
-    Overreliance on memalign is a sure way to fragment space.
-
-*/
-
-
-#if __STD_C
-Void_t* mEMALIGn(size_t alignment, size_t bytes)
-#else
-Void_t* mEMALIGn(alignment, bytes) size_t alignment; size_t bytes;
-#endif
-{
-  INTERNAL_SIZE_T    nb;      /* padded  request size */
-  char*     m;                /* memory returned by malloc call */
-  mchunkptr p;                /* corresponding chunk */
-  char*     lim;              /* alignment point within p */
-  mchunkptr newp;             /* chunk to return */
-  INTERNAL_SIZE_T  newsize;   /* its size */
-  INTERNAL_SIZE_T  leadsize;  /* leading space befor alignment point */
-  mchunkptr remainder;        /* spare room at end to split off */
-  long      remainder_size;   /* its size */
-
-  /* If need less alignment than we give anyway, just relay to malloc */
-
-  if (alignment <= ALIGNMENT) return mALLOc(bytes);
-
-  /* Otherwise, ensure that it is at least a minimum chunk size */
-
-  if (alignment <  MINSIZE) alignment = MINSIZE;
-
-  /* Call malloc with worst case padding to hit alignment. */
-
-  nb = request2size(bytes);
-  m  = (char*)mALLOc(nb + alignment + MINSIZE);
-
-  if (m == 0) return 0; /* propagate failure */
-
-  p = mem2chunk(m);
-
-  if ((((unsigned long)(m)) % alignment) == 0) /* aligned */
-  {
-    init_realloced_chunk(p, bytes, chunksize(p));
-    return chunk2mem(p); /* nothing more to do */
-  }
-  else /* misaligned */
-  {
-    /*
-      Find an aligned spot inside chunk.
-      Since we need to give back leading space in a chunk of at
-      least MINSIZE, if the first calculation places us at
-      a spot with less than MINSIZE leader, we can move to the
-      next aligned spot -- we've allocated enough total room so that
-      this is always possible.
-    */
-
-    lim = (char*)mem2chunk(((unsigned long)(m + alignment - 1)) &
-			   ~(alignment - 1));
-    if ((lim - (char*)p) < (long)MINSIZE) lim = lim + alignment;
-
-    newp = (mchunkptr)lim;
-    leadsize = lim - (char*)p;
-    newsize = chunksize(p) - leadsize;
-
-#if HAVE_MMAP
-    if(chunk_is_mmapped(p))
-    {
-      newp->prev_size = p->prev_size + leadsize;
-      set_head(newp, newsize|IS_MMAPPED);
-      init_malloced_chunk(newp, bytes);
-      return chunk2mem(newp);
-    }
-#endif
-
-    /* give back leader, use the rest */
-
-    set_head(newp, newsize | PREV_INUSE);
-    set_inuse_bit_at_offset(newp, newsize);
-    set_head_size(p, leadsize);
-    init_freeable_chunk(p);
-    fREe(chunk2mem(p));
-    p = newp;
-
-    assert (newsize >= nb && (((unsigned long)(chunk2mem(p))) % alignment) == 0);
-  }
-
-  /* Also give back spare room at the end */
-
-  remainder_size = chunksize(p) - nb;
-
-  if (remainder_size >= (long)MINSIZE)
-  {
-    remainder = chunk_at_offset(p, nb);
-    set_head(remainder, remainder_size | PREV_INUSE);
-    set_head_size(p, nb);
-    init_freeable_chunk(remainder);
-    fREe(chunk2mem(remainder));
-  }
-
-  init_malloced_chunk(p, bytes);
-  check_inuse_chunk(p);
-  return chunk2mem(p);
-
-}
-
-
-
-
-/*
-    valloc just invokes memalign with alignment argument equal
-    to the page size of the system (or as near to this as can
-    be figured out from all the includes/defines above.)
-*/
-
-#if __STD_C
-Void_t* vALLOc(size_t bytes)
-#else
-Void_t* vALLOc(bytes) size_t bytes;
-#endif
-{
-  return mEMALIGn (malloc_getpagesize, bytes);
-}
-
-/*
-  pvalloc just invokes valloc for the nearest pagesize
-  that will accommodate request
-*/
-
-
-#if __STD_C
-Void_t* pvALLOc(size_t bytes)
-#else
-Void_t* pvALLOc(bytes) size_t bytes;
-#endif
-{
-  size_t pagesize = malloc_getpagesize;
-  return mEMALIGn (pagesize, (bytes + pagesize - 1) & ~(pagesize - 1));
-}
-
-/*
-
-  calloc calls malloc, then zeroes out the allocated chunk.
-
-*/
-
-#if __STD_C
-Void_t* cALLOc(size_t n, size_t elem_size)
-#else
-Void_t* cALLOc(n, elem_size) size_t n; size_t elem_size;
-#endif
-{
-  mchunkptr p;
-  INTERNAL_SIZE_T csz;
-
-  INTERNAL_SIZE_T sz = n * elem_size;
-
-  /* check if expand_top called, in which case don't need to clear */
-#if MORECORE_CLEARS
-  mchunkptr oldtop = top;
-  INTERNAL_SIZE_T oldtopsize = chunksize(top);
-#endif
-  Void_t* mem = mALLOc (sz);
-
-  if (mem == 0)
-    return 0;
-  else
-  {
-    p = mem2chunk(mem);
-
-    /* Two optional cases in which clearing not necessary */
-
-
-#if HAVE_MMAP
-    if (chunk_is_mmapped(p)) return mem;
-#endif
-
-    csz = chunksize(p);
-
-#if MORECORE_CLEARS
-    if (p == oldtop && csz > oldtopsize)
-    {
-      /* clear only the bytes from non-freshly-sbrked memory */
-      csz = oldtopsize;
-    }
-#endif
-
-    malloc_ZERO(mem, csz - OVERHEAD);
-    /* reinstate moat fill in pad region */
-    init_realloced_chunk(p, sz, chunksize(p));
-    return mem;
-  }
-}
-
-
-
-/*
-
-    Malloc_trim gives memory back to the system (via negative
-    arguments to sbrk) if there is unused memory at the `high' end of
-    the malloc pool. You can call this after freeing large blocks of
-    memory to potentially reduce the system-level memory requirements
-    of a program. However, it cannot guarantee to reduce memory. Under
-    some allocation patterns, some large free blocks of memory will be
-    locked between two used chunks, so they cannot be given back to
-    the system.
-
-    The `pad' argument to malloc_trim represents the amount of free
-    trailing space to leave untrimmed. If this argument is zero,
-    only the minimum amount of memory to maintain internal data
-    structures will be left (one page or less). Non-zero arguments
-    can be supplied to maintain enough trailing space to service
-    future expected allocations without having to re-obtain memory
-    from the system.
-
-    Malloc_trim returns 1 if it actually released any memory, else 0.
-
-*/
-
-#if __STD_C
-int dlmalloc_trim(size_t pad)
-#else
-int malloc_trim(pad) size_t pad;
-#endif
-{
-  long  top_size;        /* Amount of top-most memory */
-  long  extra;           /* Amount to release */
-  char* current_lim;     /* address returned by pre-check sbrk call */
-  char* new_lim;         /* address returned by negative sbrk call */
-
-  unsigned long pagesz = malloc_getpagesize;
-
-  top_size = chunksize(top);
-  extra = ((top_size - pad - MINSIZE + (pagesz-1)) / pagesz - 1) * pagesz;
-
-  if (extra < (long)pagesz)  /* Not enough memory to release */
-    return 0;
-
-  else
-  {
-#ifdef OTHER_SBRKS
-    /* Test to make sure no one else called sbrk */
-    current_lim = (char*)(MORECORE (0));
-    if (current_lim != (char*)(top) + top_size)
-      return 0;     /* Apparently we don't own memory; must fail */
-
-    else
-#endif
-    {
-      new_lim = (char*)(MORECORE (-extra));
-
-      if (new_lim == (char*)(MORECORE_FAILURE)) /* sbrk failed? */
-      {
-	/* Try to figure out what we have */
-	current_lim = (char*)(MORECORE (0));
-	top_size = current_lim - (char*)top;
-	if (top_size >= (long)MINSIZE) /* if not, we are very very dead! */
-	{
-	  sbrked_mem = current_lim - sbrk_base;
-	  set_head(top, top_size | PREV_INUSE);
-	  init_freed_chunk(top, top_size, 0);
-	}
-	check_chunk(top);
-	return 0;
-      }
-
-      else
-      {
-	/* Success. Adjust top accordingly. */
-	set_head(top, (top_size - extra) | PREV_INUSE);
-	sbrked_mem -= extra;
-	init_freed_chunk(top, top_size - extra, 0);
-	check_chunk(top);
-	return 1;
-      }
-    }
-  }
-}
-
-
-
-/*
-  malloc_usable_size:
-
-    This routine tells you how many bytes you can actually use in an
-    allocated chunk, which may be more than you requested (although
-    often not). You can use this many bytes without worrying about
-    overwriting other allocated objects. Not a particularly great
-    programming practice, but still sometimes useful.
-
-*/
-
-#if __STD_C
-size_t dlmalloc_usable_size(Void_t* mem)
-#else
-size_t malloc_usable_size(mem) Void_t* mem;
-#endif
-{
-  mchunkptr p;
-  if (mem == 0)
-    return 0;
-  else
-  {
-    p = mem2chunk(mem);
-    check_inuse_chunk(p);
-    maximize_chunk(p);
-    if(!chunk_is_mmapped(p))
-    {
-      if (!inuse(p)) return 0;
-      return chunksize(p) - OVERHEAD;
-    }
-    return chunksize(p) - OVERHEAD - MMAP_EXTRA;
-  }
-}
-
-
-
-
-/* Utility to update current_mallinfo for malloc_stats and mallinfo() */
-
-static void malloc_update_mallinfo(void)
-{
-  int i;
-  mbinptr b;
-  mchunkptr p;
-#if DEBUG
-  mchunkptr q;
-#endif
-
-  INTERNAL_SIZE_T avail = chunksize(top);
-  int   navail = avail >= MINSIZE ? 1 : 0;
-  check_freefill(top, avail, avail);
-
-#if DEBUG
-  if (lowest_chunk)
-    for (p = lowest_chunk;
-	 p < top && inuse(p) && chunksize(p) >= MINSIZE;
-	 p = next_chunk(p))
-      check_inuse_chunk(p);
-#endif
-
-  for (i = 1; i < NAV; ++i)
-  {
-    b = bin_at(i);
-    for (p = last(b); p != b; p = p->bk)
-    {
-#if DEBUG
-      check_free_chunk(p);
-      check_freefill(p, chunksize(p), chunksize(p));
-      for (q = next_chunk(p);
-	   q < top && inuse(q) && chunksize(q) >= MINSIZE;
-	   q = next_chunk(q))
-	check_inuse_chunk(q);
-#endif
-      avail += chunksize(p);
-      navail++;
-    }
-  }
-
-  current_mallinfo.ordblks = navail;
-  current_mallinfo.uordblks = sbrked_mem - avail;
-  current_mallinfo.fordblks = avail;
-  current_mallinfo.hblks = n_mmaps;
-  current_mallinfo.hblkhd = mmapped_mem;
-  current_mallinfo.keepcost = chunksize(top);
-
-}
-
-
-
-/*
-
-  malloc_stats:
-
-    Prints on stderr the amount of space obtain from the system (both
-    via sbrk and mmap), the maximum amount (which may be more than
-    current if malloc_trim and/or munmap got called), the maximum
-    number of simultaneous mmap regions used, and the current number
-    of bytes allocated via malloc (or realloc, etc) but not yet
-    freed. (Note that this is the number of bytes allocated, not the
-    number requested. It will be larger than the number requested
-    because of alignment and bookkeeping overhead.)
-
-*/
-
-void dlmalloc_stats(void)
-{
-  malloc_update_mallinfo();
-  fprintf(stderr, "max system bytes = %10u\n",
-	  (unsigned int)(max_total_mem));
-  fprintf(stderr, "system bytes     = %10u\n",
-	  (unsigned int)(sbrked_mem + mmapped_mem));
-  fprintf(stderr, "in use bytes     = %10u\n",
-	  (unsigned int)(current_mallinfo.uordblks + mmapped_mem));
-#if HAVE_MMAP
-  fprintf(stderr, "max mmap regions = %10u\n",
-	  (unsigned int)max_n_mmaps);
-#endif
-}
-
-/*
-  mallinfo returns a copy of updated current mallinfo.
-*/
-
-struct mallinfo mALLINFo(void)
-{
-  malloc_update_mallinfo();
-  return current_mallinfo;
-}
-
-
-
-
-/*
-  mallopt:
-
-    mallopt is the general SVID/XPG interface to tunable parameters.
-    The format is to provide a (parameter-number, parameter-value) pair.
-    mallopt then sets the corresponding parameter to the argument
-    value if it can (i.e., so long as the value is meaningful),
-    and returns 1 if successful else 0.
-
-    See descriptions of tunable parameters above.
-
-*/
-
-#if __STD_C
-int mALLOPt(int param_number, int value)
-#else
-int mALLOPt(param_number, value) int param_number; int value;
-#endif
-{
-  switch(param_number)
-  {
-    case M_TRIM_THRESHOLD:
-      trim_threshold = value; return 1;
-    case M_TOP_PAD:
-      top_pad = value; return 1;
-    case M_MMAP_THRESHOLD:
-      mmap_threshold = value; return 1;
-    case M_MMAP_MAX:
-#if HAVE_MMAP
-      n_mmaps_max = value; return 1;
-#else
-      if (value != 0) return 0; else  n_mmaps_max = value; return 1;
-#endif
-    case M_SCANHEAP:
-#ifdef DEBUG2
-      scanheap = value;
-#endif
-      return 1;
-
-    default:
-      return 0;
-  }
-}
-
-/*
-
-History:
-
-    V2.6.3 Sun May 19 08:17:58 1996  Doug Lea  (dl at gee)
-      * Added pvalloc, as recommended by H.J. Liu
-      * Added 64bit pointer support mainly from Wolfram Gloger
-      * Added anonymously donated WIN32 sbrk emulation
-      * Malloc, calloc, getpagesize: add optimizations from Raymond Nijssen
-      * malloc_extend_top: fix mask error that caused wastage after
-	foreign sbrks
-      * Add linux mremap support code from HJ Liu
-
-    V2.6.2 Tue Dec  5 06:52:55 1995  Doug Lea  (dl at gee)
-      * Integrated most documentation with the code.
-      * Add support for mmap, with help from
-	Wolfram Gloger (Gloger@lrz.uni-muenchen.de).
-      * Use last_remainder in more cases.
-      * Pack bins using idea from  colin@nyx10.cs.du.edu
-      * Use ordered bins instead of best-fit threshhold
-      * Eliminate block-local decls to simplify tracing and debugging.
-      * Support another case of realloc via move into top
-      * Fix error occuring when initial sbrk_base not word-aligned.
-      * Rely on page size for units instead of SBRK_UNIT to
-	avoid surprises about sbrk alignment conventions.
-      * Add mallinfo, mallopt. Thanks to Raymond Nijssen
-	(raymond@es.ele.tue.nl) for the suggestion.
-      * Add `pad' argument to malloc_trim and top_pad mallopt parameter.
-      * More precautions for cases where other routines call sbrk,
-	courtesy of Wolfram Gloger (Gloger@lrz.uni-muenchen.de).
-      * Added macros etc., allowing use in linux libc from
-	H.J. Lu (hjl@gnu.ai.mit.edu)
-      * Inverted this history list
-
-    V2.6.1 Sat Dec  2 14:10:57 1995  Doug Lea  (dl at gee)
-      * Re-tuned and fixed to behave more nicely with V2.6.0 changes.
-      * Removed all preallocation code since under current scheme
-	the work required to undo bad preallocations exceeds
-	the work saved in good cases for most test programs.
-      * No longer use return list or unconsolidated bins since
-	no scheme using them consistently outperforms those that don't
-	given above changes.
-      * Use best fit for very large chunks to prevent some worst-cases.
-      * Added some support for debugging
-
-    V2.6.0 Sat Nov  4 07:05:23 1995  Doug Lea  (dl at gee)
-      * Removed footers when chunks are in use. Thanks to
-	Paul Wilson (wilson@cs.texas.edu) for the suggestion.
-
-    V2.5.4 Wed Nov  1 07:54:51 1995  Doug Lea  (dl at gee)
-      * Added malloc_trim, with help from Wolfram Gloger
-	(wmglo@Dent.MED.Uni-Muenchen.DE).
-
-    V2.5.3 Tue Apr 26 10:16:01 1994  Doug Lea  (dl at g)
-
-    V2.5.2 Tue Apr  5 16:20:40 1994  Doug Lea  (dl at g)
-      * realloc: try to expand in both directions
-      * malloc: swap order of clean-bin strategy;
-      * realloc: only conditionally expand backwards
-      * Try not to scavenge used bins
-      * Use bin counts as a guide to preallocation
-      * Occasionally bin return list chunks in first scan
-      * Add a few optimizations from colin@nyx10.cs.du.edu
-
-    V2.5.1 Sat Aug 14 15:40:43 1993  Doug Lea  (dl at g)
-      * faster bin computation & slightly different binning
-      * merged all consolidations to one part of malloc proper
-	 (eliminating old malloc_find_space & malloc_clean_bin)
-      * Scan 2 returns chunks (not just 1)
-      * Propagate failure in realloc if malloc returns 0
-      * Add stuff to allow compilation on non-ANSI compilers
-	  from kpv@research.att.com
-
-    V2.5 Sat Aug  7 07:41:59 1993  Doug Lea  (dl at g.oswego.edu)
-      * removed potential for odd address access in prev_chunk
-      * removed dependency on getpagesize.h
-      * misc cosmetics and a bit more internal documentation
-      * anticosmetics: mangled names in macros to evade debugger strangeness
-      * tested on sparc, hp-700, dec-mips, rs6000
-	  with gcc & native cc (hp, dec only) allowing
-	  Detlefs & Zorn comparison study (in SIGPLAN Notices.)
-
-    Trial version Fri Aug 28 13:14:29 1992  Doug Lea  (dl at g.oswego.edu)
-      * Based loosely on libg++-1.2X malloc. (It retains some of the overall
-	 structure of old version,  but most details differ.)
-
-*/