Attachment 155473 Details for Bug 241402 – preprocessor source

preprocessor source

ccr6JELD.out (text/plain), 434.43 KB, created by Quanah Gibson-Mount on 2007-05-25 18:36:45 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Quanah Gibson-Mount

Created: 2007-05-25 18:36:45 UTC

Size: 434.43 KB

patch

obsolete

>// /usr/libexec/gcc/i386-redhat-linux/4.0.2/cc1plus -quiet -I/usr/include/nptl -I. -Iheaplayers -Iheaplayers/util -D_GNU_SOURCE -DNDEBUG -D_REENTRANT=1 libhoard.cpp -quiet -dumpbase libhoard.cpp -malign-double -march=pentium4 -auxbase libhoard -O3 -finline-limit=20000 -fomit-frame-pointer -finline-functions -o - -frandom-seed=0
># 1 "libhoard.cpp"
># 1 "<built-in>"
># 1 "<command line>"
># 1 "libhoard.cpp"
># 33 "libhoard.cpp"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/new" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/new" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstddef" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstddef" 3
>       
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstddef" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 152 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 3 4
>typedef int ptrdiff_t;
># 214 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 3 4
>typedef unsigned int size_t;
># 49 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstddef" 2 3
>
>namespace std
>{
>  using ::ptrdiff_t;
>  using ::size_t;
>}
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/new" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception" 1 3
># 40 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception" 3
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
># 54 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception" 3
>  class exception
>  {
>  public:
>    exception() throw() { }
>    virtual ~exception() throw();
>
>
>    virtual const char* what() const throw();
>  };
>
>
>
>  class bad_exception : public exception
>  {
>  public:
>    bad_exception() throw() { }
>
>
>    virtual ~bad_exception() throw();
>  };
>
>
>  typedef void (*terminate_handler) ();
>
>  typedef void (*unexpected_handler) ();
>
>
>  terminate_handler set_terminate(terminate_handler) throw();
>
>
>  void terminate() __attribute__ ((__noreturn__));
>
>
>  unexpected_handler set_unexpected(unexpected_handler) throw();
>
>
>  void unexpected() __attribute__ ((__noreturn__));
># 102 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception" 3
>  bool uncaught_exception() throw();
>}
>
>namespace __gnu_cxx
>{
># 117 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception" 3
>  void __verbose_terminate_handler ();
>}
>
>}
>
>#pragma GCC visibility pop
># 43 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/new" 2 3
>
>#pragma GCC visibility push(default)
>
>extern "C++" {
>
>namespace std
>{
>
>
>
>
>
>  class bad_alloc : public exception
>  {
>  public:
>    bad_alloc() throw() { }
>
>
>    virtual ~bad_alloc() throw();
>  };
>
>  struct nothrow_t { };
>  extern const nothrow_t nothrow;
>
>
>  typedef void (*new_handler)();
>
>  new_handler set_new_handler(new_handler) throw();
>}
># 84 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/new" 3
>void* operator new(std::size_t) throw (std::bad_alloc);
>void* operator new[](std::size_t) throw (std::bad_alloc);
>void operator delete(void*) throw();
>void operator delete[](void*) throw();
>void* operator new(std::size_t, const std::nothrow_t&) throw();
>void* operator new[](std::size_t, const std::nothrow_t&) throw();
>void operator delete(void*, const std::nothrow_t&) throw();
>void operator delete[](void*, const std::nothrow_t&) throw();
>
>
>inline void* operator new(std::size_t, void* __p) throw() { return __p; }
>inline void* operator new[](std::size_t, void* __p) throw() { return __p; }
>
>
>inline void operator delete (void*, void*) throw() { }
>inline void operator delete[](void*, void*) throw() { }
>
>}
>
>#pragma GCC visibility pop
># 34 "libhoard.cpp" 2
># 57 "libhoard.cpp"
>volatile int anyThreadCreated = 0;
>
>
>namespace Hoard {
>
>
>  enum { MAX_MEMORY_PER_TLAB = 256 * 1024 };
>
>
>  enum { MaxThreads = 1024 };
>
>
>  enum { NumHeaps = 128 };
>
>
>
>  enum { LargestSmallObject = 256 };
># 90 "libhoard.cpp"
>}
>
># 1 "heaplayers/util/cpuinfo.h" 1
># 36 "heaplayers/util/cpuinfo.h"
># 1 "/usr/include/unistd.h" 1 3 4
># 26 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/features.h" 1 3 4
># 319 "/usr/include/features.h" 3 4
># 1 "/usr/include/sys/cdefs.h" 1 3 4
># 320 "/usr/include/features.h" 2 3 4
># 342 "/usr/include/features.h" 3 4
># 1 "/usr/include/gnu/stubs.h" 1 3 4
>
>
>
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 5 "/usr/include/gnu/stubs.h" 2 3 4
>
>
># 1 "/usr/include/gnu/stubs-32.h" 1 3 4
># 8 "/usr/include/gnu/stubs.h" 2 3 4
># 343 "/usr/include/features.h" 2 3 4
># 27 "/usr/include/unistd.h" 2 3 4
>
>extern "C" {
># 171 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/posix_opt.h" 1 3 4
># 172 "/usr/include/unistd.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/environments.h" 1 3 4
># 176 "/usr/include/unistd.h" 2 3 4
># 186 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/bits/types.h" 1 3 4
># 28 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/bits/types.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 32 "/usr/include/bits/types.h" 2 3 4
>
>
>typedef unsigned char __u_char;
>typedef unsigned short int __u_short;
>typedef unsigned int __u_int;
>typedef unsigned long int __u_long;
>
>
>typedef signed char __int8_t;
>typedef unsigned char __uint8_t;
>typedef signed short int __int16_t;
>typedef unsigned short int __uint16_t;
>typedef signed int __int32_t;
>typedef unsigned int __uint32_t;
>
>
>
>
>__extension__ typedef signed long long int __int64_t;
>__extension__ typedef unsigned long long int __uint64_t;
>
>
>
>
>
>
>
>__extension__ typedef long long int __quad_t;
>__extension__ typedef unsigned long long int __u_quad_t;
># 134 "/usr/include/bits/types.h" 3 4
># 1 "/usr/include/bits/typesizes.h" 1 3 4
># 135 "/usr/include/bits/types.h" 2 3 4
>
>
>__extension__ typedef __u_quad_t __dev_t;
>__extension__ typedef unsigned int __uid_t;
>__extension__ typedef unsigned int __gid_t;
>__extension__ typedef unsigned long int __ino_t;
>__extension__ typedef __u_quad_t __ino64_t;
>__extension__ typedef unsigned int __mode_t;
>__extension__ typedef unsigned int __nlink_t;
>__extension__ typedef long int __off_t;
>__extension__ typedef __quad_t __off64_t;
>__extension__ typedef int __pid_t;
>__extension__ typedef struct { int __val[2]; } __fsid_t;
>__extension__ typedef long int __clock_t;
>__extension__ typedef unsigned long int __rlim_t;
>__extension__ typedef __u_quad_t __rlim64_t;
>__extension__ typedef unsigned int __id_t;
>__extension__ typedef long int __time_t;
>__extension__ typedef unsigned int __useconds_t;
>__extension__ typedef long int __suseconds_t;
>
>__extension__ typedef int __daddr_t;
>__extension__ typedef long int __swblk_t;
>__extension__ typedef int __key_t;
>
>
>__extension__ typedef int __clockid_t;
>
>
>__extension__ typedef void * __timer_t;
>
>
>__extension__ typedef long int __blksize_t;
>
>
>
>
>__extension__ typedef long int __blkcnt_t;
>__extension__ typedef __quad_t __blkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsblkcnt_t;
>__extension__ typedef __u_quad_t __fsblkcnt64_t;
>
>
>__extension__ typedef unsigned long int __fsfilcnt_t;
>__extension__ typedef __u_quad_t __fsfilcnt64_t;
>
>__extension__ typedef int __ssize_t;
>
>
>
>typedef __off64_t __loff_t;
>typedef __quad_t *__qaddr_t;
>typedef char *__caddr_t;
>
>
>__extension__ typedef int __intptr_t;
>
>
>__extension__ typedef unsigned int __socklen_t;
># 187 "/usr/include/unistd.h" 2 3 4
>
>
>typedef __ssize_t ssize_t;
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 196 "/usr/include/unistd.h" 2 3 4
>
>
>
>
>
>typedef __gid_t gid_t;
>
>
>
>
>typedef __uid_t uid_t;
>
>
>
>
>
>typedef __off_t off_t;
>
>
>
>
>
>
>typedef __off64_t off64_t;
>
>
>
>
>typedef __useconds_t useconds_t;
>
>
>
>
>typedef __pid_t pid_t;
>
>
>
>
>
>
>typedef __intptr_t intptr_t;
>
>
>
>
>
>
>typedef __socklen_t socklen_t;
># 256 "/usr/include/unistd.h" 3 4
>extern int access (__const char *__name, int __type) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int euidaccess (__const char *__name, int __type)
>     throw () __attribute__ ((__nonnull__ (1)));
># 287 "/usr/include/unistd.h" 3 4
>extern __off_t lseek (int __fd, __off_t __offset, int __whence) throw ();
># 298 "/usr/include/unistd.h" 3 4
>extern __off64_t lseek64 (int __fd, __off64_t __offset, int __whence)
>     throw ();
>
>
>
>
>
>
>extern int close (int __fd);
>
>
>
>
>
>
>extern ssize_t read (int __fd, void *__buf, size_t __nbytes) ;
>
>
>
>
>
>extern ssize_t write (int __fd, __const void *__buf, size_t __n) ;
># 329 "/usr/include/unistd.h" 3 4
>extern ssize_t pread (int __fd, void *__buf, size_t __nbytes,
>        __off_t __offset) ;
>
>
>
>
>
>
>extern ssize_t pwrite (int __fd, __const void *__buf, size_t __n,
>         __off_t __offset) ;
># 357 "/usr/include/unistd.h" 3 4
>extern ssize_t pread64 (int __fd, void *__buf, size_t __nbytes,
>   __off64_t __offset) ;
>
>
>extern ssize_t pwrite64 (int __fd, __const void *__buf, size_t __n,
>    __off64_t __offset) ;
>
>
>
>
>
>
>
>extern int pipe (int __pipedes[2]) throw () ;
># 379 "/usr/include/unistd.h" 3 4
>extern unsigned int alarm (unsigned int __seconds) throw ();
># 391 "/usr/include/unistd.h" 3 4
>extern unsigned int sleep (unsigned int __seconds);
>
>
>
>
>
>
>extern __useconds_t ualarm (__useconds_t __value, __useconds_t __interval)
>     throw ();
>
>
>
>
>
>
>extern int usleep (__useconds_t __useconds);
># 415 "/usr/include/unistd.h" 3 4
>extern int pause (void);
>
>
>
>extern int chown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchown (int __fd, __uid_t __owner, __gid_t __group) throw () ;
>
>
>
>
>extern int lchown (__const char *__file, __uid_t __owner, __gid_t __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern int chdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int fchdir (int __fd) throw () ;
># 449 "/usr/include/unistd.h" 3 4
>extern char *getcwd (char *__buf, size_t __size) throw () ;
>
>
>
>
>
>extern char *get_current_dir_name (void) throw ();
>
>
>
>
>
>
>extern char *getwd (char *__buf)
>     throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)) ;
>
>
>
>
>extern int dup (int __fd) throw () ;
>
>
>extern int dup2 (int __fd, int __fd2) throw ();
>
>
>extern char **__environ;
>
>extern char **environ;
>
>
>
>
>
>extern int execve (__const char *__path, char *__const __argv[],
>     char *__const __envp[]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int fexecve (int __fd, char *__const __argv[], char *__const __envp[])
>     throw ();
>
>
>
>
>extern int execv (__const char *__path, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execle (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execl (__const char *__path, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int execvp (__const char *__file, char *__const __argv[])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int execlp (__const char *__file, __const char *__arg, ...)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int nice (int __inc) throw () ;
>
>
>
>
>extern void _exit (int __status) __attribute__ ((__noreturn__));
>
>
>
>
>
># 1 "/usr/include/bits/confname.h" 1 3 4
># 26 "/usr/include/bits/confname.h" 3 4
>enum
>  {
>    _PC_LINK_MAX,
>
>    _PC_MAX_CANON,
>
>    _PC_MAX_INPUT,
>
>    _PC_NAME_MAX,
>
>    _PC_PATH_MAX,
>
>    _PC_PIPE_BUF,
>
>    _PC_CHOWN_RESTRICTED,
>
>    _PC_NO_TRUNC,
>
>    _PC_VDISABLE,
>
>    _PC_SYNC_IO,
>
>    _PC_ASYNC_IO,
>
>    _PC_PRIO_IO,
>
>    _PC_SOCK_MAXBUF,
>
>    _PC_FILESIZEBITS,
>
>    _PC_REC_INCR_XFER_SIZE,
>
>    _PC_REC_MAX_XFER_SIZE,
>
>    _PC_REC_MIN_XFER_SIZE,
>
>    _PC_REC_XFER_ALIGN,
>
>    _PC_ALLOC_SIZE_MIN,
>
>    _PC_SYMLINK_MAX,
>
>    _PC_2_SYMLINKS
>
>  };
>
>
>enum
>  {
>    _SC_ARG_MAX,
>
>    _SC_CHILD_MAX,
>
>    _SC_CLK_TCK,
>
>    _SC_NGROUPS_MAX,
>
>    _SC_OPEN_MAX,
>
>    _SC_STREAM_MAX,
>
>    _SC_TZNAME_MAX,
>
>    _SC_JOB_CONTROL,
>
>    _SC_SAVED_IDS,
>
>    _SC_REALTIME_SIGNALS,
>
>    _SC_PRIORITY_SCHEDULING,
>
>    _SC_TIMERS,
>
>    _SC_ASYNCHRONOUS_IO,
>
>    _SC_PRIORITIZED_IO,
>
>    _SC_SYNCHRONIZED_IO,
>
>    _SC_FSYNC,
>
>    _SC_MAPPED_FILES,
>
>    _SC_MEMLOCK,
>
>    _SC_MEMLOCK_RANGE,
>
>    _SC_MEMORY_PROTECTION,
>
>    _SC_MESSAGE_PASSING,
>
>    _SC_SEMAPHORES,
>
>    _SC_SHARED_MEMORY_OBJECTS,
>
>    _SC_AIO_LISTIO_MAX,
>
>    _SC_AIO_MAX,
>
>    _SC_AIO_PRIO_DELTA_MAX,
>
>    _SC_DELAYTIMER_MAX,
>
>    _SC_MQ_OPEN_MAX,
>
>    _SC_MQ_PRIO_MAX,
>
>    _SC_VERSION,
>
>    _SC_PAGESIZE,
>
>
>    _SC_RTSIG_MAX,
>
>    _SC_SEM_NSEMS_MAX,
>
>    _SC_SEM_VALUE_MAX,
>
>    _SC_SIGQUEUE_MAX,
>
>    _SC_TIMER_MAX,
>
>
>
>
>    _SC_BC_BASE_MAX,
>
>    _SC_BC_DIM_MAX,
>
>    _SC_BC_SCALE_MAX,
>
>    _SC_BC_STRING_MAX,
>
>    _SC_COLL_WEIGHTS_MAX,
>
>    _SC_EQUIV_CLASS_MAX,
>
>    _SC_EXPR_NEST_MAX,
>
>    _SC_LINE_MAX,
>
>    _SC_RE_DUP_MAX,
>
>    _SC_CHARCLASS_NAME_MAX,
>
>
>    _SC_2_VERSION,
>
>    _SC_2_C_BIND,
>
>    _SC_2_C_DEV,
>
>    _SC_2_FORT_DEV,
>
>    _SC_2_FORT_RUN,
>
>    _SC_2_SW_DEV,
>
>    _SC_2_LOCALEDEF,
>
>
>    _SC_PII,
>
>    _SC_PII_XTI,
>
>    _SC_PII_SOCKET,
>
>    _SC_PII_INTERNET,
>
>    _SC_PII_OSI,
>
>    _SC_POLL,
>
>    _SC_SELECT,
>
>    _SC_UIO_MAXIOV,
>
>    _SC_IOV_MAX = _SC_UIO_MAXIOV,
>
>    _SC_PII_INTERNET_STREAM,
>
>    _SC_PII_INTERNET_DGRAM,
>
>    _SC_PII_OSI_COTS,
>
>    _SC_PII_OSI_CLTS,
>
>    _SC_PII_OSI_M,
>
>    _SC_T_IOV_MAX,
>
>
>
>    _SC_THREADS,
>
>    _SC_THREAD_SAFE_FUNCTIONS,
>
>    _SC_GETGR_R_SIZE_MAX,
>
>    _SC_GETPW_R_SIZE_MAX,
>
>    _SC_LOGIN_NAME_MAX,
>
>    _SC_TTY_NAME_MAX,
>
>    _SC_THREAD_DESTRUCTOR_ITERATIONS,
>
>    _SC_THREAD_KEYS_MAX,
>
>    _SC_THREAD_STACK_MIN,
>
>    _SC_THREAD_THREADS_MAX,
>
>    _SC_THREAD_ATTR_STACKADDR,
>
>    _SC_THREAD_ATTR_STACKSIZE,
>
>    _SC_THREAD_PRIORITY_SCHEDULING,
>
>    _SC_THREAD_PRIO_INHERIT,
>
>    _SC_THREAD_PRIO_PROTECT,
>
>    _SC_THREAD_PROCESS_SHARED,
>
>
>    _SC_NPROCESSORS_CONF,
>
>    _SC_NPROCESSORS_ONLN,
>
>    _SC_PHYS_PAGES,
>
>    _SC_AVPHYS_PAGES,
>
>    _SC_ATEXIT_MAX,
>
>    _SC_PASS_MAX,
>
>
>    _SC_XOPEN_VERSION,
>
>    _SC_XOPEN_XCU_VERSION,
>
>    _SC_XOPEN_UNIX,
>
>    _SC_XOPEN_CRYPT,
>
>    _SC_XOPEN_ENH_I18N,
>
>    _SC_XOPEN_SHM,
>
>
>    _SC_2_CHAR_TERM,
>
>    _SC_2_C_VERSION,
>
>    _SC_2_UPE,
>
>
>    _SC_XOPEN_XPG2,
>
>    _SC_XOPEN_XPG3,
>
>    _SC_XOPEN_XPG4,
>
>
>    _SC_CHAR_BIT,
>
>    _SC_CHAR_MAX,
>
>    _SC_CHAR_MIN,
>
>    _SC_INT_MAX,
>
>    _SC_INT_MIN,
>
>    _SC_LONG_BIT,
>
>    _SC_WORD_BIT,
>
>    _SC_MB_LEN_MAX,
>
>    _SC_NZERO,
>
>    _SC_SSIZE_MAX,
>
>    _SC_SCHAR_MAX,
>
>    _SC_SCHAR_MIN,
>
>    _SC_SHRT_MAX,
>
>    _SC_SHRT_MIN,
>
>    _SC_UCHAR_MAX,
>
>    _SC_UINT_MAX,
>
>    _SC_ULONG_MAX,
>
>    _SC_USHRT_MAX,
>
>
>    _SC_NL_ARGMAX,
>
>    _SC_NL_LANGMAX,
>
>    _SC_NL_MSGMAX,
>
>    _SC_NL_NMAX,
>
>    _SC_NL_SETMAX,
>
>    _SC_NL_TEXTMAX,
>
>
>    _SC_XBS5_ILP32_OFF32,
>
>    _SC_XBS5_ILP32_OFFBIG,
>
>    _SC_XBS5_LP64_OFF64,
>
>    _SC_XBS5_LPBIG_OFFBIG,
>
>
>    _SC_XOPEN_LEGACY,
>
>    _SC_XOPEN_REALTIME,
>
>    _SC_XOPEN_REALTIME_THREADS,
>
>
>    _SC_ADVISORY_INFO,
>
>    _SC_BARRIERS,
>
>    _SC_BASE,
>
>    _SC_C_LANG_SUPPORT,
>
>    _SC_C_LANG_SUPPORT_R,
>
>    _SC_CLOCK_SELECTION,
>
>    _SC_CPUTIME,
>
>    _SC_THREAD_CPUTIME,
>
>    _SC_DEVICE_IO,
>
>    _SC_DEVICE_SPECIFIC,
>
>    _SC_DEVICE_SPECIFIC_R,
>
>    _SC_FD_MGMT,
>
>    _SC_FIFO,
>
>    _SC_PIPE,
>
>    _SC_FILE_ATTRIBUTES,
>
>    _SC_FILE_LOCKING,
>
>    _SC_FILE_SYSTEM,
>
>    _SC_MONOTONIC_CLOCK,
>
>    _SC_MULTI_PROCESS,
>
>    _SC_SINGLE_PROCESS,
>
>    _SC_NETWORKING,
>
>    _SC_READER_WRITER_LOCKS,
>
>    _SC_SPIN_LOCKS,
>
>    _SC_REGEXP,
>
>    _SC_REGEX_VERSION,
>
>    _SC_SHELL,
>
>    _SC_SIGNALS,
>
>    _SC_SPAWN,
>
>    _SC_SPORADIC_SERVER,
>
>    _SC_THREAD_SPORADIC_SERVER,
>
>    _SC_SYSTEM_DATABASE,
>
>    _SC_SYSTEM_DATABASE_R,
>
>    _SC_TIMEOUTS,
>
>    _SC_TYPED_MEMORY_OBJECTS,
>
>    _SC_USER_GROUPS,
>
>    _SC_USER_GROUPS_R,
>
>    _SC_2_PBS,
>
>    _SC_2_PBS_ACCOUNTING,
>
>    _SC_2_PBS_LOCATE,
>
>    _SC_2_PBS_MESSAGE,
>
>    _SC_2_PBS_TRACK,
>
>    _SC_SYMLOOP_MAX,
>
>    _SC_STREAMS,
>
>    _SC_2_PBS_CHECKPOINT,
>
>
>    _SC_V6_ILP32_OFF32,
>
>    _SC_V6_ILP32_OFFBIG,
>
>    _SC_V6_LP64_OFF64,
>
>    _SC_V6_LPBIG_OFFBIG,
>
>
>    _SC_HOST_NAME_MAX,
>
>    _SC_TRACE,
>
>    _SC_TRACE_EVENT_FILTER,
>
>    _SC_TRACE_INHERIT,
>
>    _SC_TRACE_LOG,
>
>
>    _SC_LEVEL1_ICACHE_SIZE,
>
>    _SC_LEVEL1_ICACHE_ASSOC,
>
>    _SC_LEVEL1_ICACHE_LINESIZE,
>
>    _SC_LEVEL1_DCACHE_SIZE,
>
>    _SC_LEVEL1_DCACHE_ASSOC,
>
>    _SC_LEVEL1_DCACHE_LINESIZE,
>
>    _SC_LEVEL2_CACHE_SIZE,
>
>    _SC_LEVEL2_CACHE_ASSOC,
>
>    _SC_LEVEL2_CACHE_LINESIZE,
>
>    _SC_LEVEL3_CACHE_SIZE,
>
>    _SC_LEVEL3_CACHE_ASSOC,
>
>    _SC_LEVEL3_CACHE_LINESIZE,
>
>    _SC_LEVEL4_CACHE_SIZE,
>
>    _SC_LEVEL4_CACHE_ASSOC,
>
>    _SC_LEVEL4_CACHE_LINESIZE,
>
>
>
>    _SC_IPV6 = _SC_LEVEL1_ICACHE_SIZE + 50,
>
>    _SC_RAW_SOCKETS
>
>  };
>
>
>enum
>  {
>    _CS_PATH,
>
>
>    _CS_V6_WIDTH_RESTRICTED_ENVS,
>
>
>    _CS_GNU_LIBC_VERSION,
>
>    _CS_GNU_LIBPTHREAD_VERSION,
>
>
>    _CS_LFS_CFLAGS = 1000,
>
>    _CS_LFS_LDFLAGS,
>
>    _CS_LFS_LIBS,
>
>    _CS_LFS_LINTFLAGS,
>
>    _CS_LFS64_CFLAGS,
>
>    _CS_LFS64_LDFLAGS,
>
>    _CS_LFS64_LIBS,
>
>    _CS_LFS64_LINTFLAGS,
>
>
>    _CS_XBS5_ILP32_OFF32_CFLAGS = 1100,
>
>    _CS_XBS5_ILP32_OFF32_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFF32_LIBS,
>
>    _CS_XBS5_ILP32_OFF32_LINTFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_CFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_ILP32_OFFBIG_LIBS,
>
>    _CS_XBS5_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_XBS5_LP64_OFF64_CFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LDFLAGS,
>
>    _CS_XBS5_LP64_OFF64_LIBS,
>
>    _CS_XBS5_LP64_OFF64_LINTFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LIBS,
>
>    _CS_XBS5_LPBIG_OFFBIG_LINTFLAGS,
>
>
>    _CS_POSIX_V6_ILP32_OFF32_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFF32_LINTFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_ILP32_OFFBIG_LINTFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_CFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LDFLAGS,
>
>    _CS_POSIX_V6_LP64_OFF64_LIBS,
>
>    _CS_POSIX_V6_LP64_OFF64_LINTFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LIBS,
>
>    _CS_POSIX_V6_LPBIG_OFFBIG_LINTFLAGS
>
>  };
># 533 "/usr/include/unistd.h" 2 3 4
>
>
>extern long int pathconf (__const char *__path, int __name)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int fpathconf (int __fd, int __name) throw ();
>
>
>extern long int sysconf (int __name) throw () __attribute__ ((__const__));
>
>
>
>extern size_t confstr (int __name, char *__buf, size_t __len) throw ();
>
>
>
>
>extern __pid_t getpid (void) throw ();
>
>
>extern __pid_t getppid (void) throw ();
>
>
>
>
>extern __pid_t getpgrp (void) throw ();
># 569 "/usr/include/unistd.h" 3 4
>extern __pid_t __getpgid (__pid_t __pid) throw ();
>
>extern __pid_t getpgid (__pid_t __pid) throw ();
>
>
>
>
>
>
>extern int setpgid (__pid_t __pid, __pid_t __pgid) throw ();
># 595 "/usr/include/unistd.h" 3 4
>extern int setpgrp (void) throw ();
># 612 "/usr/include/unistd.h" 3 4
>extern __pid_t setsid (void) throw ();
>
>
>
>extern __pid_t getsid (__pid_t __pid) throw ();
>
>
>
>extern __uid_t getuid (void) throw ();
>
>
>extern __uid_t geteuid (void) throw ();
>
>
>extern __gid_t getgid (void) throw ();
>
>
>extern __gid_t getegid (void) throw ();
>
>
>
>
>extern int getgroups (int __size, __gid_t __list[]) throw () ;
>
>
>
>extern int group_member (__gid_t __gid) throw ();
>
>
>
>
>
>
>extern int setuid (__uid_t __uid) throw ();
>
>
>
>
>extern int setreuid (__uid_t __ruid, __uid_t __euid) throw ();
>
>
>
>
>extern int seteuid (__uid_t __uid) throw ();
>
>
>
>
>
>
>extern int setgid (__gid_t __gid) throw ();
>
>
>
>
>extern int setregid (__gid_t __rgid, __gid_t __egid) throw ();
>
>
>
>
>extern int setegid (__gid_t __gid) throw ();
>
>
>
>
>
>extern int getresuid (__uid_t *__euid, __uid_t *__ruid, __uid_t *__suid)
>     throw ();
>
>
>
>extern int getresgid (__gid_t *__egid, __gid_t *__rgid, __gid_t *__sgid)
>     throw ();
>
>
>
>extern int setresuid (__uid_t __euid, __uid_t __ruid, __uid_t __suid)
>     throw ();
>
>
>
>extern int setresgid (__gid_t __egid, __gid_t __rgid, __gid_t __sgid)
>     throw ();
>
>
>
>
>
>
>extern __pid_t fork (void) throw ();
>
>
>
>
>
>
>extern __pid_t vfork (void) throw ();
>
>
>
>
>
>extern char *ttyname (int __fd) throw ();
>
>
>
>extern int ttyname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2))) ;
>
>
>
>extern int isatty (int __fd) throw ();
>
>
>
>
>
>extern int ttyslot (void) throw ();
>
>
>
>
>extern int link (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>extern int symlink (__const char *__from, __const char *__to)
>     throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>
>extern int readlink (__const char *__restrict __path, char *__restrict __buf,
>       size_t __len) throw () __attribute__ ((__nonnull__ (1, 2))) ;
>
>
>
>extern int unlink (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int rmdir (__const char *__path) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern __pid_t tcgetpgrp (int __fd) throw ();
>
>
>extern int tcsetpgrp (int __fd, __pid_t __pgrp_id) throw ();
>
>
>
>
>
>
>extern char *getlogin (void);
>
>
>
>
>
>
>
>extern int getlogin_r (char *__name, size_t __name_len) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int setlogin (__const char *__name) throw () __attribute__ ((__nonnull__ (1)));
># 789 "/usr/include/unistd.h" 3 4
># 1 "/usr/include/getopt.h" 1 3 4
># 50 "/usr/include/getopt.h" 3 4
>extern "C" {
># 59 "/usr/include/getopt.h" 3 4
>extern char *optarg;
># 73 "/usr/include/getopt.h" 3 4
>extern int optind;
>
>
>
>
>extern int opterr;
>
>
>
>extern int optopt;
># 152 "/usr/include/getopt.h" 3 4
>extern int getopt (int ___argc, char *const *___argv, const char *__shortopts)
>       throw ();
># 171 "/usr/include/getopt.h" 3 4
>}
># 790 "/usr/include/unistd.h" 2 3 4
>
>
>
>
>
>
>
>extern int gethostname (char *__name, size_t __len) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern int sethostname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern int sethostid (long int __id) throw () ;
>
>
>
>
>
>extern int getdomainname (char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern int setdomainname (__const char *__name, size_t __len)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int vhangup (void) throw ();
>
>
>extern int revoke (__const char *__file) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>extern int profil (unsigned short int *__sample_buffer, size_t __size,
>     size_t __offset, unsigned int __scale)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int acct (__const char *__name) throw ();
>
>
>
>extern char *getusershell (void) throw ();
>extern void endusershell (void) throw ();
>extern void setusershell (void) throw ();
>
>
>
>
>
>extern int daemon (int __nochdir, int __noclose) throw () ;
>
>
>
>
>
>
>extern int chroot (__const char *__path) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern char *getpass (__const char *__prompt) __attribute__ ((__nonnull__ (1)));
># 875 "/usr/include/unistd.h" 3 4
>extern int fsync (int __fd);
>
>
>
>
>
>
>extern long int gethostid (void);
>
>
>extern void sync (void) throw ();
>
>
>
>
>extern int getpagesize (void) throw () __attribute__ ((__const__));
>
>
>
>
>extern int getdtablesize (void) throw ();
>
>
>
>
>extern int truncate (__const char *__file, __off_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 912 "/usr/include/unistd.h" 3 4
>extern int truncate64 (__const char *__file, __off64_t __length)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 922 "/usr/include/unistd.h" 3 4
>extern int ftruncate (int __fd, __off_t __length) throw () ;
># 932 "/usr/include/unistd.h" 3 4
>extern int ftruncate64 (int __fd, __off64_t __length) throw () ;
># 942 "/usr/include/unistd.h" 3 4
>extern int brk (void *__addr) throw () ;
>
>
>
>
>
>extern void *sbrk (intptr_t __delta) throw ();
># 963 "/usr/include/unistd.h" 3 4
>extern long int syscall (long int __sysno, ...) throw ();
># 986 "/usr/include/unistd.h" 3 4
>extern int lockf (int __fd, int __cmd, __off_t __len) ;
># 996 "/usr/include/unistd.h" 3 4
>extern int lockf64 (int __fd, int __cmd, __off64_t __len) ;
># 1017 "/usr/include/unistd.h" 3 4
>extern int fdatasync (int __fildes) throw ();
>
>
>
>
>
>
>
>extern char *crypt (__const char *__key, __const char *__salt)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern void encrypt (char *__block, int __edflag) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void swab (__const void *__restrict __from, void *__restrict __to,
>    ssize_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
># 1055 "/usr/include/unistd.h" 3 4
>}
># 37 "heaplayers/util/cpuinfo.h" 2
>
>
>
>
># 1 "/usr/include/pthread.h" 1 3 4
># 23 "/usr/include/pthread.h" 3 4
># 1 "/usr/include/sched.h" 1 3 4
># 29 "/usr/include/sched.h" 3 4
># 1 "/usr/include/time.h" 1 3 4
># 118 "/usr/include/time.h" 3 4
>struct timespec
>  {
>    __time_t tv_sec;
>    long int tv_nsec;
>  };
># 30 "/usr/include/sched.h" 2 3 4
>
>
># 1 "/usr/include/bits/sched.h" 1 3 4
># 62 "/usr/include/bits/sched.h" 3 4
>struct sched_param
>  {
>    int __sched_priority;
>  };
>
>extern "C" {
>
>
>
>extern int clone (int (*__fn) (void *__arg), void *__child_stack,
>    int __flags, void *__arg, ...) throw ();
>
>
>}
>
>
>
>
>
>
>
>struct __sched_param
>  {
>    int __sched_priority;
>  };
># 98 "/usr/include/bits/sched.h" 3 4
>typedef unsigned long int __cpu_mask;
>
>
>
>
>
>
>typedef struct
>{
>  __cpu_mask __bits[1024 / (8 * sizeof (__cpu_mask))];
>} cpu_set_t;
># 33 "/usr/include/sched.h" 2 3 4
>
>
>
>
>extern "C" {
>
>
>extern int sched_setparam (__pid_t __pid, __const struct sched_param *__param)
>     throw ();
>
>
>extern int sched_getparam (__pid_t __pid, struct sched_param *__param) throw ();
>
>
>extern int sched_setscheduler (__pid_t __pid, int __policy,
>          __const struct sched_param *__param) throw ();
>
>
>extern int sched_getscheduler (__pid_t __pid) throw ();
>
>
>extern int sched_yield (void) throw ();
>
>
>extern int sched_get_priority_max (int __algorithm) throw ();
>
>
>extern int sched_get_priority_min (int __algorithm) throw ();
>
>
>extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw ();
># 76 "/usr/include/sched.h" 3 4
>extern int sched_setaffinity (__pid_t __pid, size_t __cpusetsize,
>         __const cpu_set_t *__cpuset) throw ();
>
>
>extern int sched_getaffinity (__pid_t __pid, size_t __cpusetsize,
>         cpu_set_t *__cpuset) throw ();
>
>
>}
># 24 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/time.h" 1 3 4
># 30 "/usr/include/time.h" 3 4
>extern "C" {
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 39 "/usr/include/time.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/time.h" 1 3 4
># 43 "/usr/include/time.h" 2 3 4
># 58 "/usr/include/time.h" 3 4
>
>
>typedef __clock_t clock_t;
>
>
>
># 74 "/usr/include/time.h" 3 4
>
>
>typedef __time_t time_t;
>
>
>
># 92 "/usr/include/time.h" 3 4
>typedef __clockid_t clockid_t;
># 104 "/usr/include/time.h" 3 4
>typedef __timer_t timer_t;
># 129 "/usr/include/time.h" 3 4
>
>
>struct tm
>{
>  int tm_sec;
>  int tm_min;
>  int tm_hour;
>  int tm_mday;
>  int tm_mon;
>  int tm_year;
>  int tm_wday;
>  int tm_yday;
>  int tm_isdst;
>
>
>  long int tm_gmtoff;
>  __const char *tm_zone;
>
>
>
>
>};
>
>
>
>
>
>
>
>
>struct itimerspec
>  {
>    struct timespec it_interval;
>    struct timespec it_value;
>  };
>
>
>struct sigevent;
># 178 "/usr/include/time.h" 3 4
>
>
>
>extern clock_t clock (void) throw ();
>
>
>extern time_t time (time_t *__timer) throw ();
>
>
>extern double difftime (time_t __time1, time_t __time0)
>     throw () __attribute__ ((__const__));
>
>
>extern time_t mktime (struct tm *__tp) throw ();
>
>
>
>
>
>extern size_t strftime (char *__restrict __s, size_t __maxsize,
>   __const char *__restrict __format,
>   __const struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *strptime (__const char *__restrict __s,
>         __const char *__restrict __fmt, struct tm *__tp)
>     throw ();
>
>
>
>
>
># 1 "/usr/include/xlocale.h" 1 3 4
># 28 "/usr/include/xlocale.h" 3 4
>typedef struct __locale_struct
>{
>
>  struct locale_data *__locales[13];
>
>
>  const unsigned short int *__ctype_b;
>  const int *__ctype_tolower;
>  const int *__ctype_toupper;
>
>
>  const char *__names[13];
>} *__locale_t;
># 214 "/usr/include/time.h" 2 3 4
>
>extern size_t strftime_l (char *__restrict __s, size_t __maxsize,
>     __const char *__restrict __format,
>     __const struct tm *__restrict __tp,
>     __locale_t __loc) throw ();
>
>extern char *strptime_l (__const char *__restrict __s,
>    __const char *__restrict __fmt, struct tm *__tp,
>    __locale_t __loc) throw ();
>
>
>
>
>
>
>extern struct tm *gmtime (__const time_t *__timer) throw ();
>
>
>
>extern struct tm *localtime (__const time_t *__timer) throw ();
>
>
>
>
>
>extern struct tm *gmtime_r (__const time_t *__restrict __timer,
>       struct tm *__restrict __tp) throw ();
>
>
>
>extern struct tm *localtime_r (__const time_t *__restrict __timer,
>          struct tm *__restrict __tp) throw ();
>
>
>
>
>
>extern char *asctime (__const struct tm *__tp) throw ();
>
>
>extern char *ctime (__const time_t *__timer) throw ();
>
>
>
>
>
>
>
>extern char *asctime_r (__const struct tm *__restrict __tp,
>   char *__restrict __buf) throw ();
>
>
>extern char *ctime_r (__const time_t *__restrict __timer,
>        char *__restrict __buf) throw ();
>
>
>
>
>extern char *__tzname[2];
>extern int __daylight;
>extern long int __timezone;
>
>
>
>
>extern char *tzname[2];
>
>
>
>extern void tzset (void) throw ();
>
>
>
>extern int daylight;
>extern long int timezone;
>
>
>
>
>
>extern int stime (__const time_t *__when) throw ();
># 309 "/usr/include/time.h" 3 4
>extern time_t timegm (struct tm *__tp) throw ();
>
>
>extern time_t timelocal (struct tm *__tp) throw ();
>
>
>extern int dysize (int __year) throw () __attribute__ ((__const__));
># 324 "/usr/include/time.h" 3 4
>extern int nanosleep (__const struct timespec *__requested_time,
>        struct timespec *__remaining);
>
>
>
>extern int clock_getres (clockid_t __clock_id, struct timespec *__res) throw ();
>
>
>extern int clock_gettime (clockid_t __clock_id, struct timespec *__tp) throw ();
>
>
>extern int clock_settime (clockid_t __clock_id, __const struct timespec *__tp)
>     throw ();
>
>
>
>
>
>
>extern int clock_nanosleep (clockid_t __clock_id, int __flags,
>       __const struct timespec *__req,
>       struct timespec *__rem);
>
>
>extern int clock_getcpuclockid (pid_t __pid, clockid_t *__clock_id) throw ();
>
>
>
>
>extern int timer_create (clockid_t __clock_id,
>    struct sigevent *__restrict __evp,
>    timer_t *__restrict __timerid) throw ();
>
>
>extern int timer_delete (timer_t __timerid) throw ();
>
>
>extern int timer_settime (timer_t __timerid, int __flags,
>     __const struct itimerspec *__restrict __value,
>     struct itimerspec *__restrict __ovalue) throw ();
>
>
>extern int timer_gettime (timer_t __timerid, struct itimerspec *__value)
>     throw ();
>
>
>extern int timer_getoverrun (timer_t __timerid) throw ();
># 386 "/usr/include/time.h" 3 4
>extern int getdate_err;
># 395 "/usr/include/time.h" 3 4
>extern struct tm *getdate (__const char *__string);
># 409 "/usr/include/time.h" 3 4
>extern int getdate_r (__const char *__restrict __string,
>        struct tm *__restrict __resbufp);
>
>
>}
># 25 "/usr/include/pthread.h" 2 3 4
>
>
># 1 "/usr/include/signal.h" 1 3 4
># 31 "/usr/include/signal.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 23 "/usr/include/bits/sigset.h" 3 4
>typedef int __sig_atomic_t;
>
>
>
>
>typedef struct
>  {
>    unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))];
>  } __sigset_t;
># 34 "/usr/include/signal.h" 2 3 4
># 50 "/usr/include/signal.h" 3 4
>typedef __sigset_t sigset_t;
># 400 "/usr/include/signal.h" 3 4
>}
># 28 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/pthreadtypes.h" 1 3 4
># 36 "/usr/include/bits/pthreadtypes.h" 3 4
>typedef unsigned long int pthread_t;
>
>
>typedef union
>{
>  char __size[36];
>  long int __align;
>} pthread_attr_t;
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __count;
>    int __owner;
>
>
>    int __kind;
>    unsigned int __nusers;
>    int __spins;
>  } __data;
>  char __size[24];
>  long int __align;
>} pthread_mutex_t;
>
>typedef union
>{
>  char __size[4];
>  long int __align;
>} pthread_mutexattr_t;
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __futex;
>    __extension__ unsigned long long int __total_seq;
>    __extension__ unsigned long long int __wakeup_seq;
>    __extension__ unsigned long long int __woken_seq;
>    void *__mutex;
>    unsigned int __nwaiters;
>    unsigned int __broadcast_seq;
>  } __data;
>  char __size[48];
>  __extension__ long long int __align;
>} pthread_cond_t;
>
>typedef union
>{
>  char __size[4];
>  long int __align;
>} pthread_condattr_t;
>
>
>
>typedef unsigned int pthread_key_t;
>
>
>
>typedef int pthread_once_t;
>
>
>
>
>
>typedef union
>{
>  struct
>  {
>    int __lock;
>    unsigned int __nr_readers;
>    unsigned int __readers_wakeup;
>    unsigned int __writer_wakeup;
>    unsigned int __nr_readers_queued;
>    unsigned int __nr_writers_queued;
>
>
>    unsigned int __flags;
>    int __writer;
>  } __data;
>  char __size[32];
>  long int __align;
>} pthread_rwlock_t;
>
>typedef union
>{
>  char __size[8];
>  long int __align;
>} pthread_rwlockattr_t;
>
>
>
>
>
>typedef volatile int pthread_spinlock_t;
>
>
>
>
>typedef union
>{
>  char __size[20];
>  long int __align;
>} pthread_barrier_t;
>
>typedef union
>{
>  char __size[4];
>  int __align;
>} pthread_barrierattr_t;
># 29 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/setjmp.h" 1 3 4
># 38 "/usr/include/bits/setjmp.h" 3 4
>typedef int __jmp_buf[6];
># 30 "/usr/include/pthread.h" 2 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 31 "/usr/include/pthread.h" 2 3 4
>
>
>
>enum
>{
>  PTHREAD_CREATE_JOINABLE,
>
>  PTHREAD_CREATE_DETACHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_ADAPTIVE_NP
>
>  ,
>  PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_TIMED_NP,
>  PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP,
>  PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP,
>  PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL
>
>
>
>  , PTHREAD_MUTEX_FAST_NP = PTHREAD_MUTEX_TIMED_NP
>
>};
># 87 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_RWLOCK_PREFER_READER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NP,
>  PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP,
>  PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_READER_NP
>};
># 117 "/usr/include/pthread.h" 3 4
>enum
>{
>  PTHREAD_INHERIT_SCHED,
>
>  PTHREAD_EXPLICIT_SCHED
>
>};
>
>
>
>enum
>{
>  PTHREAD_SCOPE_SYSTEM,
>
>  PTHREAD_SCOPE_PROCESS
>
>};
>
>
>
>enum
>{
>  PTHREAD_PROCESS_PRIVATE,
>
>  PTHREAD_PROCESS_SHARED
>
>};
># 152 "/usr/include/pthread.h" 3 4
>struct _pthread_cleanup_buffer
>{
>  void (*__routine) (void *);
>  void *__arg;
>  int __canceltype;
>  struct _pthread_cleanup_buffer *__prev;
>};
>
>
>enum
>{
>  PTHREAD_CANCEL_ENABLE,
>
>  PTHREAD_CANCEL_DISABLE
>
>};
>enum
>{
>  PTHREAD_CANCEL_DEFERRED,
>
>  PTHREAD_CANCEL_ASYNCHRONOUS
>
>};
># 190 "/usr/include/pthread.h" 3 4
>extern "C" {
>
>
>
>
>extern int pthread_create (pthread_t *__restrict __newthread,
>      __const pthread_attr_t *__restrict __attr,
>      void *(*__start_routine) (void *),
>      void *__restrict __arg) throw ();
>
>
>
>
>
>extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__));
>
>
>
>
>
>
>
>extern int pthread_join (pthread_t __th, void **__thread_return);
>
>
>
>
>extern int pthread_tryjoin_np (pthread_t __th, void **__thread_return) throw ();
>
>
>
>
>
>
>
>extern int pthread_timedjoin_np (pthread_t __th, void **__thread_return,
>     __const struct timespec *__abstime);
>
>
>
>
>
>
>extern int pthread_detach (pthread_t __th) throw ();
>
>
>
>extern pthread_t pthread_self (void) throw () __attribute__ ((__const__));
>
>
>extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw ();
>
>
>
>
>
>
>
>extern int pthread_attr_init (pthread_attr_t *__attr) throw ();
>
>
>extern int pthread_attr_destroy (pthread_attr_t *__attr) throw ();
>
>
>extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr,
>     int *__detachstate) throw ();
>
>
>extern int pthread_attr_setdetachstate (pthread_attr_t *__attr,
>     int __detachstate) throw ();
>
>
>
>extern int pthread_attr_getguardsize (__const pthread_attr_t *__attr,
>          size_t *__guardsize) throw ();
>
>
>extern int pthread_attr_setguardsize (pthread_attr_t *__attr,
>          size_t __guardsize) throw ();
>
>
>
>extern int pthread_attr_getschedparam (__const pthread_attr_t *__restrict
>           __attr,
>           struct sched_param *__restrict __param)
>     throw ();
>
>
>extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr,
>           __const struct sched_param *__restrict
>           __param) throw ();
>
>
>extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__restrict
>     __attr, int *__restrict __policy)
>     throw ();
>
>
>extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy)
>     throw ();
>
>
>extern int pthread_attr_getinheritsched (__const pthread_attr_t *__restrict
>      __attr, int *__restrict __inherit)
>     throw ();
>
>
>extern int pthread_attr_setinheritsched (pthread_attr_t *__attr,
>      int __inherit) throw ();
>
>
>
>extern int pthread_attr_getscope (__const pthread_attr_t *__restrict __attr,
>      int *__restrict __scope) throw ();
>
>
>extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope)
>     throw ();
>
>
>extern int pthread_attr_getstackaddr (__const pthread_attr_t *__restrict
>          __attr, void **__restrict __stackaddr)
>     throw () __attribute__ ((__deprecated__));
>
>
>
>
>
>extern int pthread_attr_setstackaddr (pthread_attr_t *__attr,
>          void *__stackaddr)
>     throw () __attribute__ ((__deprecated__));
>
>
>extern int pthread_attr_getstacksize (__const pthread_attr_t *__restrict
>          __attr, size_t *__restrict __stacksize)
>     throw ();
>
>
>
>
>extern int pthread_attr_setstacksize (pthread_attr_t *__attr,
>          size_t __stacksize) throw ();
>
>
>
>extern int pthread_attr_getstack (__const pthread_attr_t *__restrict __attr,
>      void **__restrict __stackaddr,
>      size_t *__restrict __stacksize) throw ();
>
>
>
>
>extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr,
>      size_t __stacksize) throw ();
>
>
>
>
>
>extern int pthread_attr_setaffinity_np (pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     __const cpu_set_t *__cpuset) throw ();
>
>
>
>extern int pthread_attr_getaffinity_np (__const pthread_attr_t *__attr,
>     size_t __cpusetsize,
>     cpu_set_t *__cpuset) throw ();
>
>
>
>
>
>extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr) throw ();
>
>
>
>
>
>
>
>extern int pthread_setschedparam (pthread_t __target_thread, int __policy,
>      __const struct sched_param *__param)
>     throw ();
>
>
>extern int pthread_getschedparam (pthread_t __target_thread,
>      int *__restrict __policy,
>      struct sched_param *__restrict __param)
>     throw ();
>
>
>extern int pthread_setschedprio (pthread_t __target_thread, int __prio)
>     throw ();
>
>
>
>
>extern int pthread_getconcurrency (void) throw ();
>
>
>extern int pthread_setconcurrency (int __level) throw ();
>
>
>
>
>
>
>
>extern int pthread_yield (void) throw ();
>
>
>
>
>extern int pthread_setaffinity_np (pthread_t __th, size_t __cpusetsize,
>       __const cpu_set_t *__cpuset) throw ();
>
>
>extern int pthread_getaffinity_np (pthread_t __th, size_t __cpusetsize,
>       cpu_set_t *__cpuset) throw ();
># 422 "/usr/include/pthread.h" 3 4
>extern int pthread_once (pthread_once_t *__once_control,
>    void (*__init_routine) (void));
># 434 "/usr/include/pthread.h" 3 4
>extern int pthread_setcancelstate (int __state, int *__oldstate);
>
>
>
>extern int pthread_setcanceltype (int __type, int *__oldtype);
>
>
>extern int pthread_cancel (pthread_t __th);
>
>
>
>
>extern void pthread_testcancel (void);
>
>
>
>
>typedef struct
>{
>  struct
>  {
>    __jmp_buf __cancel_jmp_buf;
>    int __mask_was_saved;
>  } __cancel_jmp_buf[1];
>  void *__pad[4];
>} __pthread_unwind_buf_t __attribute__ ((__aligned__));
># 468 "/usr/include/pthread.h" 3 4
>struct __pthread_cleanup_frame
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>};
>
>
>
>
>class __pthread_cleanup_class
>{
>  void (*__cancel_routine) (void *);
>  void *__cancel_arg;
>  int __do_it;
>  int __cancel_type;
>
> public:
>  __pthread_cleanup_class (void (*__fct) (void *), void *__arg)
>    : __cancel_routine (__fct), __cancel_arg (__arg), __do_it (1) { }
>  ~__pthread_cleanup_class () { if (__do_it) __cancel_routine (__cancel_arg); }
>  void __setdoit (int __newval) { __do_it = __newval; }
>  void __defer () { pthread_setcanceltype (PTHREAD_CANCEL_DEFERRED,
>        &__cancel_type); }
>  void __restore () const { pthread_setcanceltype (__cancel_type, 0); }
>};
># 668 "/usr/include/pthread.h" 3 4
>struct __jmp_buf_tag;
>extern int __sigsetjmp (struct __jmp_buf_tag *__env, int __savemask) throw ();
>
>
>
>
>
>extern int pthread_mutex_init (pthread_mutex_t *__mutex,
>          __const pthread_mutexattr_t *__mutexattr)
>     throw ();
>
>
>extern int pthread_mutex_destroy (pthread_mutex_t *__mutex) throw ();
>
>
>extern int pthread_mutex_trylock (pthread_mutex_t *_mutex) throw ();
>
>
>extern int pthread_mutex_lock (pthread_mutex_t *__mutex) throw ();
>
>
>
>extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex,
>                                    __const struct timespec *__restrict
>                                    __abstime) throw ();
>
>
>
>extern int pthread_mutex_unlock (pthread_mutex_t *__mutex) throw ();
>
>
>
>
>
>
>extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr) throw ();
>
>
>extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) throw ();
>
>
>extern int pthread_mutexattr_getpshared (__const pthread_mutexattr_t *
>      __restrict __attr,
>      int *__restrict __pshared) throw ();
>
>
>extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr,
>      int __pshared) throw ();
>
>
>
>extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__restrict
>          __attr, int *__restrict __kind) throw ();
>
>
>
>
>extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind)
>     throw ();
># 735 "/usr/include/pthread.h" 3 4
>extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock,
>    __const pthread_rwlockattr_t *__restrict
>    __attr) throw ();
>
>
>extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw ();
>
>
>
>extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock,
>           __const struct timespec *__restrict
>           __abstime) throw ();
>
>
>
>extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock) throw ();
>
>
>
>
>
>extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr) throw ();
>
>
>extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr) throw ();
>
>
>extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pshared) throw ();
>
>
>extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr,
>       int __pshared) throw ();
>
>
>extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t *
>       __restrict __attr,
>       int *__restrict __pref) throw ();
>
>
>extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr,
>       int __pref) throw ();
>
>
>
>
>
>
>
>extern int pthread_cond_init (pthread_cond_t *__restrict __cond,
>         __const pthread_condattr_t *__restrict
>         __cond_attr) throw ();
>
>
>extern int pthread_cond_destroy (pthread_cond_t *__cond) throw ();
>
>
>extern int pthread_cond_signal (pthread_cond_t *__cond) throw ();
>
>
>extern int pthread_cond_broadcast (pthread_cond_t *__cond) throw ();
>
>
>
>
>
>
>extern int pthread_cond_wait (pthread_cond_t *__restrict __cond,
>         pthread_mutex_t *__restrict __mutex);
># 832 "/usr/include/pthread.h" 3 4
>extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond,
>       pthread_mutex_t *__restrict __mutex,
>       __const struct timespec *__restrict
>       __abstime);
>
>
>
>
>extern int pthread_condattr_init (pthread_condattr_t *__attr) throw ();
>
>
>extern int pthread_condattr_destroy (pthread_condattr_t *__attr) throw ();
>
>
>extern int pthread_condattr_getpshared (__const pthread_condattr_t *
>                                        __restrict __attr,
>                                        int *__restrict __pshared) throw ();
>
>
>extern int pthread_condattr_setpshared (pthread_condattr_t *__attr,
>                                        int __pshared) throw ();
>
>
>
>extern int pthread_condattr_getclock (__const pthread_condattr_t *
>          __restrict __attr,
>          __clockid_t *__restrict __clock_id)
>     throw ();
>
>
>extern int pthread_condattr_setclock (pthread_condattr_t *__attr,
>          __clockid_t __clock_id) throw ();
># 873 "/usr/include/pthread.h" 3 4
>extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared)
>     throw ();
>
>
>extern int pthread_spin_destroy (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_lock (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_trylock (pthread_spinlock_t *__lock) throw ();
>
>
>extern int pthread_spin_unlock (pthread_spinlock_t *__lock) throw ();
>
>
>
>
>
>
>extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier,
>     __const pthread_barrierattr_t *__restrict
>     __attr, unsigned int __count) throw ();
>
>
>extern int pthread_barrier_destroy (pthread_barrier_t *__barrier) throw ();
>
>
>extern int pthread_barrier_wait (pthread_barrier_t *__barrier) throw ();
>
>
>
>extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr) throw ();
>
>
>extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr) throw ();
>
>
>extern int pthread_barrierattr_getpshared (__const pthread_barrierattr_t *
>        __restrict __attr,
>        int *__restrict __pshared) throw ();
>
>
>extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr,
>                                           int __pshared) throw ();
># 929 "/usr/include/pthread.h" 3 4
>extern int pthread_key_create (pthread_key_t *__key,
>          void (*__destr_function) (void *)) throw ();
>
>
>extern int pthread_key_delete (pthread_key_t __key) throw ();
>
>
>extern void *pthread_getspecific (pthread_key_t __key) throw ();
>
>
>extern int pthread_setspecific (pthread_key_t __key,
>    __const void *__pointer) throw ();
>
>
>
>
>extern int pthread_getcpuclockid (pthread_t __thread_id,
>      __clockid_t *__clock_id) throw ();
># 961 "/usr/include/pthread.h" 3 4
>extern int pthread_atfork (void (*__prepare) (void),
>      void (*__parent) (void),
>      void (*__child) (void)) throw ();
>
>}
># 42 "heaplayers/util/cpuinfo.h" 2
># 52 "heaplayers/util/cpuinfo.h"
># 1 "/usr/include/sys/types.h" 1 3 4
># 29 "/usr/include/sys/types.h" 3 4
>extern "C" {
>
>
>
>
>
>typedef __u_char u_char;
>typedef __u_short u_short;
>typedef __u_int u_int;
>typedef __u_long u_long;
>typedef __quad_t quad_t;
>typedef __u_quad_t u_quad_t;
>typedef __fsid_t fsid_t;
>
>
>
>
>typedef __loff_t loff_t;
>
>
>
>typedef __ino_t ino_t;
>
>
>
>
>
>
>typedef __ino64_t ino64_t;
>
>
>
>
>typedef __dev_t dev_t;
># 72 "/usr/include/sys/types.h" 3 4
>typedef __mode_t mode_t;
>
>
>
>
>typedef __nlink_t nlink_t;
># 105 "/usr/include/sys/types.h" 3 4
>typedef __id_t id_t;
># 116 "/usr/include/sys/types.h" 3 4
>typedef __daddr_t daddr_t;
>typedef __caddr_t caddr_t;
>
>
>
>
>
>typedef __key_t key_t;
># 141 "/usr/include/sys/types.h" 3 4
>typedef __suseconds_t suseconds_t;
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 148 "/usr/include/sys/types.h" 2 3 4
>
>
>
>typedef unsigned long int ulong;
>typedef unsigned short int ushort;
>typedef unsigned int uint;
># 191 "/usr/include/sys/types.h" 3 4
>typedef int int8_t __attribute__ ((__mode__ (__QI__)));
>typedef int int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int int32_t __attribute__ ((__mode__ (__SI__)));
>typedef int int64_t __attribute__ ((__mode__ (__DI__)));
>
>
>typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__)));
>typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__)));
>
>typedef int register_t __attribute__ ((__mode__ (__word__)));
># 213 "/usr/include/sys/types.h" 3 4
># 1 "/usr/include/endian.h" 1 3 4
># 37 "/usr/include/endian.h" 3 4
># 1 "/usr/include/bits/endian.h" 1 3 4
># 38 "/usr/include/endian.h" 2 3 4
># 214 "/usr/include/sys/types.h" 2 3 4
>
>
># 1 "/usr/include/sys/select.h" 1 3 4
># 31 "/usr/include/sys/select.h" 3 4
># 1 "/usr/include/bits/select.h" 1 3 4
># 32 "/usr/include/sys/select.h" 2 3 4
>
>
># 1 "/usr/include/bits/sigset.h" 1 3 4
># 35 "/usr/include/sys/select.h" 2 3 4
># 46 "/usr/include/sys/select.h" 3 4
># 1 "/usr/include/bits/time.h" 1 3 4
># 69 "/usr/include/bits/time.h" 3 4
>struct timeval
>  {
>    __time_t tv_sec;
>    __suseconds_t tv_usec;
>  };
># 47 "/usr/include/sys/select.h" 2 3 4
># 55 "/usr/include/sys/select.h" 3 4
>typedef long int __fd_mask;
># 67 "/usr/include/sys/select.h" 3 4
>typedef struct
>  {
>
>
>
>    __fd_mask fds_bits[1024 / (8 * sizeof (__fd_mask))];
>
>
>
>
>
>  } fd_set;
>
>
>
>
>
>
>typedef __fd_mask fd_mask;
># 99 "/usr/include/sys/select.h" 3 4
>extern "C" {
># 109 "/usr/include/sys/select.h" 3 4
>extern int select (int __nfds, fd_set *__restrict __readfds,
>     fd_set *__restrict __writefds,
>     fd_set *__restrict __exceptfds,
>     struct timeval *__restrict __timeout);
># 121 "/usr/include/sys/select.h" 3 4
>extern int pselect (int __nfds, fd_set *__restrict __readfds,
>      fd_set *__restrict __writefds,
>      fd_set *__restrict __exceptfds,
>      const struct timespec *__restrict __timeout,
>      const __sigset_t *__restrict __sigmask);
>
>
>}
># 217 "/usr/include/sys/types.h" 2 3 4
>
>
># 1 "/usr/include/sys/sysmacros.h" 1 3 4
># 29 "/usr/include/sys/sysmacros.h" 3 4
>__extension__
>extern __inline unsigned int gnu_dev_major (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned int gnu_dev_minor (unsigned long long int __dev)
>     throw ();
>__extension__
>extern __inline unsigned long long int gnu_dev_makedev (unsigned int __major,
>       unsigned int __minor)
>     throw ();
>
>
>__extension__ extern __inline unsigned int
>gnu_dev_major (unsigned long long int __dev) throw ()
>{
>  return ((__dev >> 8) & 0xfff) | ((unsigned int) (__dev >> 32) & ~0xfff);
>}
>
>__extension__ extern __inline unsigned int
>gnu_dev_minor (unsigned long long int __dev) throw ()
>{
>  return (__dev & 0xff) | ((unsigned int) (__dev >> 12) & ~0xff);
>}
>
>__extension__ extern __inline unsigned long long int
>gnu_dev_makedev (unsigned int __major, unsigned int __minor) throw ()
>{
>  return ((__minor & 0xff) | ((__major & 0xfff) << 8)
>   | (((unsigned long long int) (__minor & ~0xff)) << 12)
>   | (((unsigned long long int) (__major & ~0xfff)) << 32));
>}
># 220 "/usr/include/sys/types.h" 2 3 4
>
>
>
>
>typedef __blksize_t blksize_t;
>
>
>
>
>
>
>typedef __blkcnt_t blkcnt_t;
>
>
>
>typedef __fsblkcnt_t fsblkcnt_t;
>
>
>
>typedef __fsfilcnt_t fsfilcnt_t;
># 258 "/usr/include/sys/types.h" 3 4
>typedef __blkcnt64_t blkcnt64_t;
>typedef __fsblkcnt64_t fsblkcnt64_t;
>typedef __fsfilcnt64_t fsfilcnt64_t;
># 269 "/usr/include/sys/types.h" 3 4
>}
># 53 "heaplayers/util/cpuinfo.h" 2
># 1 "/usr/include/sys/stat.h" 1 3 4
># 103 "/usr/include/sys/stat.h" 3 4
>extern "C" {
>
># 1 "/usr/include/bits/stat.h" 1 3 4
># 36 "/usr/include/bits/stat.h" 3 4
>struct stat
>  {
>    __dev_t st_dev;
>    unsigned short int __pad1;
>
>    __ino_t st_ino;
>
>
>
>    __mode_t st_mode;
>    __nlink_t st_nlink;
>    __uid_t st_uid;
>    __gid_t st_gid;
>    __dev_t st_rdev;
>    unsigned short int __pad2;
>
>    __off_t st_size;
>
>
>
>    __blksize_t st_blksize;
>
>
>    __blkcnt_t st_blocks;
># 70 "/usr/include/bits/stat.h" 3 4
>    struct timespec st_atim;
>    struct timespec st_mtim;
>    struct timespec st_ctim;
># 85 "/usr/include/bits/stat.h" 3 4
>    unsigned long int __unused4;
>    unsigned long int __unused5;
>
>
>
>  };
>
>
>struct stat64
>  {
>    __dev_t st_dev;
>    unsigned int __pad1;
>
>    __ino_t __st_ino;
>    __mode_t st_mode;
>    __nlink_t st_nlink;
>    __uid_t st_uid;
>    __gid_t st_gid;
>    __dev_t st_rdev;
>    unsigned int __pad2;
>    __off64_t st_size;
>    __blksize_t st_blksize;
>
>    __blkcnt64_t st_blocks;
>
>
>
>
>
>
>
>    struct timespec st_atim;
>    struct timespec st_mtim;
>    struct timespec st_ctim;
># 127 "/usr/include/bits/stat.h" 3 4
>    __ino64_t st_ino;
>  };
># 106 "/usr/include/sys/stat.h" 2 3 4
># 207 "/usr/include/sys/stat.h" 3 4
>extern int stat (__const char *__restrict __file,
>   struct stat *__restrict __buf) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern int fstat (int __fd, struct stat *__buf) throw () __attribute__ ((__nonnull__ (2)));
># 226 "/usr/include/sys/stat.h" 3 4
>extern int stat64 (__const char *__restrict __file,
>     struct stat64 *__restrict __buf) throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int fstat64 (int __fd, struct stat64 *__buf) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>
>extern int lstat (__const char *__restrict __file,
>    struct stat *__restrict __buf) throw () __attribute__ ((__nonnull__ (1, 2)));
># 248 "/usr/include/sys/stat.h" 3 4
>extern int lstat64 (__const char *__restrict __file,
>      struct stat64 *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern int chmod (__const char *__file, __mode_t __mode)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int lchmod (__const char *__file, __mode_t __mode)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int fchmod (int __fd, __mode_t __mode) throw ();
>
>
>
>
>
>extern __mode_t umask (__mode_t __mask) throw ();
>
>
>
>
>extern __mode_t getumask (void) throw ();
>
>
>
>extern int mkdir (__const char *__path, __mode_t __mode)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int mknod (__const char *__path, __mode_t __mode, __dev_t __dev)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>extern int mkfifo (__const char *__path, __mode_t __mode)
>     throw () __attribute__ ((__nonnull__ (1)));
># 324 "/usr/include/sys/stat.h" 3 4
>extern int __fxstat (int __ver, int __fildes, struct stat *__stat_buf)
>     throw () __attribute__ ((__nonnull__ (3)));
>extern int __xstat (int __ver, __const char *__filename,
>      struct stat *__stat_buf) throw () __attribute__ ((__nonnull__ (2, 3)));
>extern int __lxstat (int __ver, __const char *__filename,
>       struct stat *__stat_buf) throw () __attribute__ ((__nonnull__ (2, 3)));
># 350 "/usr/include/sys/stat.h" 3 4
>extern int __fxstat64 (int __ver, int __fildes, struct stat64 *__stat_buf)
>     throw () __attribute__ ((__nonnull__ (3)));
>extern int __xstat64 (int __ver, __const char *__filename,
>        struct stat64 *__stat_buf) throw () __attribute__ ((__nonnull__ (2, 3)));
>extern int __lxstat64 (int __ver, __const char *__filename,
>         struct stat64 *__stat_buf) throw () __attribute__ ((__nonnull__ (2, 3)));
>
>extern int __xmknod (int __ver, __const char *__path, __mode_t __mode,
>       __dev_t *__dev) throw () __attribute__ ((__nonnull__ (2, 4)));
>
>
>
>
>extern __inline__ int
>stat (__const char *__path, struct stat *__statbuf) throw ()
>{
>  return __xstat (3, __path, __statbuf);
>}
>
>
>extern __inline__ int
>lstat (__const char *__path, struct stat *__statbuf) throw ()
>{
>  return __lxstat (3, __path, __statbuf);
>}
>
>
>extern __inline__ int
>fstat (int __fd, struct stat *__statbuf) throw ()
>{
>  return __fxstat (3, __fd, __statbuf);
>}
>
>
>extern __inline__ int
>mknod (__const char *__path, __mode_t __mode, __dev_t __dev) throw ()
>{
>  return __xmknod (1, __path, __mode, &__dev);
>}
>
>
>
>
>
>extern __inline__ int
>stat64 (__const char *__path, struct stat64 *__statbuf) throw ()
>{
>  return __xstat64 (3, __path, __statbuf);
>}
>
>
>extern __inline__ int
>lstat64 (__const char *__path, struct stat64 *__statbuf) throw ()
>{
>  return __lxstat64 (3, __path, __statbuf);
>}
>
>
>extern __inline__ int
>fstat64 (int __fd, struct stat64 *__statbuf) throw ()
>{
>  return __fxstat64 (3, __fd, __statbuf);
>}
>
>
>
>
>}
># 54 "heaplayers/util/cpuinfo.h" 2
># 1 "/usr/include/fcntl.h" 1 3 4
># 29 "/usr/include/fcntl.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/fcntl.h" 1 3 4
># 138 "/usr/include/bits/fcntl.h" 3 4
>struct flock
>  {
>    short int l_type;
>    short int l_whence;
>
>    __off_t l_start;
>    __off_t l_len;
>
>
>
>
>    __pid_t l_pid;
>  };
>
>
>struct flock64
>  {
>    short int l_type;
>    short int l_whence;
>    __off64_t l_start;
>    __off64_t l_len;
>    __pid_t l_pid;
>  };
># 183 "/usr/include/bits/fcntl.h" 3 4
>extern "C" {
>
>
>extern ssize_t readahead (int __fd, __off64_t __offset, size_t __count)
>    throw ();
>
>}
># 34 "/usr/include/fcntl.h" 2 3 4
># 63 "/usr/include/fcntl.h" 3 4
>extern int fcntl (int __fd, int __cmd, ...);
># 72 "/usr/include/fcntl.h" 3 4
>extern int open (__const char *__file, int __oflag, ...) __attribute__ ((__nonnull__ (1)));
># 82 "/usr/include/fcntl.h" 3 4
>extern int open64 (__const char *__file, int __oflag, ...) __attribute__ ((__nonnull__ (1)));
># 91 "/usr/include/fcntl.h" 3 4
>extern int creat (__const char *__file, __mode_t __mode) __attribute__ ((__nonnull__ (1)));
># 101 "/usr/include/fcntl.h" 3 4
>extern int creat64 (__const char *__file, __mode_t __mode) __attribute__ ((__nonnull__ (1)));
># 137 "/usr/include/fcntl.h" 3 4
>extern int posix_fadvise (int __fd, __off_t __offset, __off_t __len,
>     int __advise) throw ();
># 149 "/usr/include/fcntl.h" 3 4
>extern int posix_fadvise64 (int __fd, __off64_t __offset, __off64_t __len,
>       int __advise) throw ();
># 159 "/usr/include/fcntl.h" 3 4
>extern int posix_fallocate (int __fd, __off_t __offset, __off_t __len);
># 170 "/usr/include/fcntl.h" 3 4
>extern int posix_fallocate64 (int __fd, __off64_t __offset, __off64_t __len);
>
>
>
>}
># 55 "heaplayers/util/cpuinfo.h" 2
># 1 "/usr/include/string.h" 1 3 4
># 28 "/usr/include/string.h" 3 4
>extern "C" {
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 34 "/usr/include/string.h" 2 3 4
>
>
>
>
>extern void *memcpy (void *__restrict __dest,
>       __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memmove (void *__dest, __const void *__src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern void *memccpy (void *__restrict __dest, __const void *__restrict __src,
>        int __c, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern void *memset (void *__s, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int memcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void *memchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern void *rawmemchr (__const void *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memrchr (__const void *__s, int __c, size_t __n)
>      throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strcat (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strncat (char *__restrict __dest, __const char *__restrict __src,
>        size_t __n) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern int strncmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strcoll (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern size_t strxfrm (char *__restrict __dest,
>         __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (2)));
>
># 121 "/usr/include/string.h" 3 4
>extern int strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern size_t strxfrm_l (char *__dest, __const char *__src, size_t __n,
>    __locale_t __l) throw () __attribute__ ((__nonnull__ (2, 4)));
>
>
>
>
>extern char *strdup (__const char *__s)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *strndup (__const char *__string, size_t __n)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1)));
># 165 "/usr/include/string.h" 3 4
>
>
>extern char *strchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>extern char *strrchr (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strchrnul (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strcspn (__const char *__s, __const char *__reject)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern size_t strspn (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strpbrk (__const char *__s, __const char *__accept)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>extern char *strstr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern char *strtok (char *__restrict __s, __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>extern char *__strtok_r (char *__restrict __s,
>    __const char *__restrict __delim,
>    char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim,
>         char **__restrict __save_ptr)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>
>
>extern char *strcasestr (__const char *__haystack, __const char *__needle)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern void *memmem (__const void *__haystack, size_t __haystacklen,
>       __const void *__needle, size_t __needlelen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 3)));
>
>
>
>extern void *__mempcpy (void *__restrict __dest,
>   __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern void *mempcpy (void *__restrict __dest,
>        __const void *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern size_t strlen (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern size_t strnlen (__const char *__string, size_t __maxlen)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern char *strerror (int __errnum) throw ();
>
># 281 "/usr/include/string.h" 3 4
>extern char *strerror_r (int __errnum, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>
>extern void __bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern void bcopy (__const void *__src, void *__dest, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern void bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int bcmp (__const void *__s1, __const void *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *index (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>extern char *rindex (__const char *__s, int __c)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1)));
>
>
>
>extern int ffs (int __i) throw () __attribute__ ((__const__));
>
>
>
>
>extern int ffsl (long int __l) throw () __attribute__ ((__const__));
>
>__extension__ extern int ffsll (long long int __ll)
>     throw () __attribute__ ((__const__));
>
>
>
>
>extern int strcasecmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>extern int strcasecmp_l (__const char *__s1, __const char *__s2,
>    __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3)));
>
>extern int strncasecmp_l (__const char *__s1, __const char *__s2,
>     size_t __n, __locale_t __loc)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 4)));
>
>
>
>
>
>extern char *strsep (char **__restrict __stringp,
>       __const char *__restrict __delim)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>extern int strverscmp (__const char *__s1, __const char *__s2)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strsignal (int __sig) throw ();
>
>
>extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>extern char *__stpncpy (char *__restrict __dest,
>   __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern char *stpncpy (char *__restrict __dest,
>        __const char *__restrict __src, size_t __n)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern char *basename (__const char *__filename) throw () __attribute__ ((__nonnull__ (1)));
># 426 "/usr/include/string.h" 3 4
>}
># 56 "heaplayers/util/cpuinfo.h" 2
># 77 "heaplayers/util/cpuinfo.h"
>namespace HL {
># 86 "heaplayers/util/cpuinfo.h"
>class CPUInfo {
>public:
>  CPUInfo (void)
>  {}
>
>  inline static int getNumProcessors (void) {
>    static int _numProcessors = computeNumProcessors();
>    return _numProcessors;
>  }
>
>  static inline int getThreadId (void);
>  inline static int computeNumProcessors (void);
>
>};
>
>
>int CPUInfo::computeNumProcessors (void)
>{
>  static int np = 0;
>  if (!np) {
># 114 "heaplayers/util/cpuinfo.h"
>  enum { MAX_PROCFILE_SIZE = 32768 };
>  char line[MAX_PROCFILE_SIZE];
>  int fd = open ("/proc/cpuinfo", 00);
>  if (!fd) {
>    return 1;
>  } else {
>    read (fd, line, MAX_PROCFILE_SIZE);
>    char * str = line;
>    np = 0;
>    while (str) {
>      str = strstr(str, "processor");
>      if (str) {
> np++;
> str++;
>      }
>    }
>    close (fd);
>    return np;
>  }
># 155 "heaplayers/util/cpuinfo.h"
>  } else {
>    return np;
>  }
>}
># 173 "heaplayers/util/cpuinfo.h"
>int CPUInfo::getThreadId (void) {
># 203 "heaplayers/util/cpuinfo.h"
>  return (int) pthread_self() >> 10;
># 215 "heaplayers/util/cpuinfo.h"
>}
>
>}
># 93 "libhoard.cpp" 2
># 1 "hoard.h" 1
># 30 "hoard.h"
># 1 "heaplayers/hldefines.h" 1
># 31 "hoard.h" 2
># 39 "hoard.h"
># 1 "check.h" 1
>
>
>
>
>
>template <class TYPE, class CHECK>
>class Check {
>public:
>  Check (TYPE * t)
>
>
>
>  {
>
>
>
>  }
>
>  ~Check (void) {
>
>
>
>  }
>
>private:
>  Check (const Check&);
>  Check& operator=(const Check&);
>
>
>
>
>
>};
># 40 "hoard.h" 2
># 1 "fixedrequestheap.h" 1
># 9 "fixedrequestheap.h"
>namespace Hoard {
>
>template <size_t RequestSize,
>   class SuperHeap>
>class FixedRequestHeap : public SuperHeap {
>public:
>  inline void * malloc (size_t) {
>    return SuperHeap::malloc (RequestSize);
>  }
>  inline static size_t getSize (void *) {
>    return RequestSize;
>  }
>};
>
>}
># 41 "hoard.h" 2
># 1 "hoardmanager.h" 1
># 30 "hoardmanager.h"
># 1 "/usr/include/stdlib.h" 1 3 4
># 33 "/usr/include/stdlib.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 34 "/usr/include/stdlib.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>
># 1 "/usr/include/bits/waitflags.h" 1 3 4
># 43 "/usr/include/stdlib.h" 2 3 4
># 1 "/usr/include/bits/waitstatus.h" 1 3 4
># 67 "/usr/include/bits/waitstatus.h" 3 4
>union wait
>  {
>    int w_status;
>    struct
>      {
>
> unsigned int __w_termsig:7;
> unsigned int __w_coredump:1;
> unsigned int __w_retcode:8;
> unsigned int:16;
>
>
>
>
>
>
>
>      } __wait_terminated;
>    struct
>      {
>
> unsigned int __w_stopval:8;
> unsigned int __w_stopsig:8;
> unsigned int:16;
>
>
>
>
>
>
>      } __wait_stopped;
>  };
># 44 "/usr/include/stdlib.h" 2 3 4
># 96 "/usr/include/stdlib.h" 3 4
>
>
>typedef struct
>  {
>    int quot;
>    int rem;
>  } div_t;
>
>
>
>typedef struct
>  {
>    long int quot;
>    long int rem;
>  } ldiv_t;
>
>
>
>
>
>
>
>__extension__ typedef struct
>  {
>    long long int quot;
>    long long int rem;
>  } lldiv_t;
>
>
># 140 "/usr/include/stdlib.h" 3 4
>extern size_t __ctype_get_mb_cur_max (void) throw () ;
>
>
>
>
>extern double atof (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern int atoi (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>extern long int atol (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__ extern long long int atoll (__const char *__nptr)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern double strtod (__const char *__restrict __nptr,
>        char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern float strtof (__const char *__restrict __nptr,
>       char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long double strtold (__const char *__restrict __nptr,
>       char **__restrict __endptr)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern long int strtol (__const char *__restrict __nptr,
>   char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern unsigned long int strtoul (__const char *__restrict __nptr,
>      char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int strtoq (__const char *__restrict __nptr,
>        char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtouq (__const char *__restrict __nptr,
>           char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>__extension__
>extern long long int strtoll (__const char *__restrict __nptr,
>         char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>__extension__
>extern unsigned long long int strtoull (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
># 240 "/usr/include/stdlib.h" 3 4
>extern long int strtol_l (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __base,
>     __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern unsigned long int strtoul_l (__const char *__restrict __nptr,
>        char **__restrict __endptr,
>        int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern long long int strtoll_l (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __base,
>    __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>__extension__
>extern unsigned long long int strtoull_l (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 4))) ;
>
>extern double strtod_l (__const char *__restrict __nptr,
>   char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern float strtof_l (__const char *__restrict __nptr,
>         char **__restrict __endptr, __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>extern long double strtold_l (__const char *__restrict __nptr,
>         char **__restrict __endptr,
>         __locale_t __loc)
>     throw () __attribute__ ((__nonnull__ (1, 3))) ;
>
>
>
>
>
>
>extern double __strtod_internal (__const char *__restrict __nptr,
>     char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern float __strtof_internal (__const char *__restrict __nptr,
>    char **__restrict __endptr, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>extern long double __strtold_internal (__const char *__restrict __nptr,
>           char **__restrict __endptr,
>           int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>extern long int __strtol_internal (__const char *__restrict __nptr,
>       char **__restrict __endptr,
>       int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>extern unsigned long int __strtoul_internal (__const char *__restrict __nptr,
>          char **__restrict __endptr,
>          int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>__extension__
>extern long long int __strtoll_internal (__const char *__restrict __nptr,
>      char **__restrict __endptr,
>      int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>__extension__
>extern unsigned long long int __strtoull_internal (__const char *
>         __restrict __nptr,
>         char **__restrict __endptr,
>         int __base, int __group)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>
>extern __inline double
>strtod (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtod_internal (__nptr, __endptr, 0);
>}
>extern __inline long int
>strtol (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtol_internal (__nptr, __endptr, __base, 0);
>}
>extern __inline unsigned long int
>strtoul (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoul_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>extern __inline float
>strtof (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtof_internal (__nptr, __endptr, 0);
>}
>extern __inline long double
>strtold (__const char *__restrict __nptr, char **__restrict __endptr) throw ()
>{
>  return __strtold_internal (__nptr, __endptr, 0);
>}
>
>
>
>
>__extension__ extern __inline long long int
>strtoq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoll_internal (__nptr, __endptr, __base, 0);
>}
>__extension__ extern __inline unsigned long long int
>strtouq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoull_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>__extension__ extern __inline long long int
>strtoll (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoll_internal (__nptr, __endptr, __base, 0);
>}
>__extension__ extern __inline unsigned long long int
>strtoull (__const char * __restrict __nptr, char **__restrict __endptr, int __base) throw ()
>
>{
>  return __strtoull_internal (__nptr, __endptr, __base, 0);
>}
>
>
>
>
>extern __inline double
>atof (__const char *__nptr) throw ()
>{
>  return strtod (__nptr, (char **) __null);
>}
>extern __inline int
>atoi (__const char *__nptr) throw ()
>{
>  return (int) strtol (__nptr, (char **) __null, 10);
>}
>extern __inline long int
>atol (__const char *__nptr) throw ()
>{
>  return strtol (__nptr, (char **) __null, 10);
>}
>
>
>
>
>__extension__ extern __inline long long int
>atoll (__const char *__nptr) throw ()
>{
>  return strtoll (__nptr, (char **) __null, 10);
>}
>
># 427 "/usr/include/stdlib.h" 3 4
>extern char *l64a (long int __n) throw () ;
>
>
>extern long int a64l (__const char *__s)
>     throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
># 443 "/usr/include/stdlib.h" 3 4
>extern long int random (void) throw ();
>
>
>extern void srandom (unsigned int __seed) throw ();
>
>
>
>
>
>extern char *initstate (unsigned int __seed, char *__statebuf,
>   size_t __statelen) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>struct random_data
>  {
>    int32_t *fptr;
>    int32_t *rptr;
>    int32_t *state;
>    int rand_type;
>    int rand_deg;
>    int rand_sep;
>    int32_t *end_ptr;
>  };
>
>extern int random_r (struct random_data *__restrict __buf,
>       int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int srandom_r (unsigned int __seed, struct random_data *__buf)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
>   size_t __statelen,
>   struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (2, 4)));
>
>extern int setstate_r (char *__restrict __statebuf,
>         struct random_data *__restrict __buf)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>extern int rand (void) throw ();
>
>extern void srand (unsigned int __seed) throw ();
>
>
>
>
>extern int rand_r (unsigned int *__seed) throw ();
>
>
>
>
>
>
>
>extern double drand48 (void) throw ();
>extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int lrand48 (void) throw ();
>extern long int nrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern long int mrand48 (void) throw ();
>extern long int jrand48 (unsigned short int __xsubi[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern void srand48 (long int __seedval) throw ();
>extern unsigned short int *seed48 (unsigned short int __seed16v[3])
>     throw () __attribute__ ((__nonnull__ (1)));
>extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>struct drand48_data
>  {
>    unsigned short int __x[3];
>    unsigned short int __old_x[3];
>    unsigned short int __c;
>    unsigned short int __init;
>    unsigned long long int __a;
>  };
>
>
>extern int drand48_r (struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int erand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int lrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int nrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int mrand48_r (struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>extern int jrand48_r (unsigned short int __xsubi[3],
>        struct drand48_data *__restrict __buffer,
>        long int *__restrict __result)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>extern int seed48_r (unsigned short int __seed16v[3],
>       struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2)));
>
>extern int lcong48_r (unsigned short int __param[7],
>        struct drand48_data *__buffer)
>     throw () __attribute__ ((__nonnull__ (1, 2)));
>
>
>
>
>
>
>
>
>
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>extern void *calloc (size_t __nmemb, size_t __size)
>     throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>
>
>
>extern void *realloc (void *__ptr, size_t __size)
>     throw () __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
>
>extern void free (void *__ptr) throw ();
>
>
>
>
>extern void cfree (void *__ptr) throw ();
>
>
>
># 1 "/usr/include/alloca.h" 1 3 4
># 25 "/usr/include/alloca.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 26 "/usr/include/alloca.h" 2 3 4
>
>extern "C" {
>
>
>
>
>
>extern void *alloca (size_t __size) throw ();
>
>
>
>
>
>}
># 611 "/usr/include/stdlib.h" 2 3 4
>
>
>
>
>extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>
>
>
>extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern void abort (void) throw () __attribute__ ((__noreturn__));
>
>
>
>extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>extern void exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern void _Exit (int __status) throw () __attribute__ ((__noreturn__));
>
>
>
>
>
>
>extern char *getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>extern char *__secure_getenv (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>extern int setenv (__const char *__name, __const char *__value, int __replace)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int unsetenv (__const char *__name) throw ();
>
>
>
>
>
>
>extern int clearenv (void) throw ();
># 696 "/usr/include/stdlib.h" 3 4
>extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
># 707 "/usr/include/stdlib.h" 3 4
>extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 717 "/usr/include/stdlib.h" 3 4
>extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ;
># 727 "/usr/include/stdlib.h" 3 4
>extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ;
>
>
>
>
>
>
>
>
>extern int system (__const char *__command) ;
>
>
>
>
>
>
>
>extern char *canonicalize_file_name (__const char *__name)
>     throw () __attribute__ ((__nonnull__ (1))) ;
># 755 "/usr/include/stdlib.h" 3 4
>extern char *realpath (__const char *__restrict __name,
>         char *__restrict __resolved) throw () ;
>
>
>
>
>
>
>typedef int (*__compar_fn_t) (__const void *, __const void *);
>
>
>typedef __compar_fn_t comparison_fn_t;
>
>
>
>
>
>
>extern void *bsearch (__const void *__key, __const void *__base,
>        size_t __nmemb, size_t __size, __compar_fn_t __compar)
>     __attribute__ ((__nonnull__ (1, 2, 5))) ;
>
>
>
>extern void qsort (void *__base, size_t __nmemb, size_t __size,
>     __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
>
>
>
>extern int abs (int __x) throw () __attribute__ ((__const__)) ;
>extern long int labs (long int __x) throw () __attribute__ ((__const__)) ;
>
>
>
>__extension__ extern long long int llabs (long long int __x)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>
>
>
>extern div_t div (int __numer, int __denom)
>     throw () __attribute__ ((__const__)) ;
>extern ldiv_t ldiv (long int __numer, long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
>
>
>
>__extension__ extern lldiv_t lldiv (long long int __numer,
>        long long int __denom)
>     throw () __attribute__ ((__const__)) ;
>
># 820 "/usr/include/stdlib.h" 3 4
>extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ;
>
>
>
>
>extern char *gcvt (double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern char *qecvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qfcvt (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign)
>     throw () __attribute__ ((__nonnull__ (3, 4))) ;
>extern char *qgcvt (long double __value, int __ndigit, char *__buf)
>     throw () __attribute__ ((__nonnull__ (3))) ;
>
>
>
>
>extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt,
>     int *__restrict __sign, char *__restrict __buf,
>     size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>extern int qecvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>extern int qfcvt_r (long double __value, int __ndigit,
>      int *__restrict __decpt, int *__restrict __sign,
>      char *__restrict __buf, size_t __len)
>     throw () __attribute__ ((__nonnull__ (3, 4, 5)));
>
>
>
>
>
>
>
>extern int mblen (__const char *__s, size_t __n) throw () ;
>
>
>extern int mbtowc (wchar_t *__restrict __pwc,
>     __const char *__restrict __s, size_t __n) throw () ;
>
>
>extern int wctomb (char *__s, wchar_t __wchar) throw () ;
>
>
>
>extern size_t mbstowcs (wchar_t *__restrict __pwcs,
>   __const char *__restrict __s, size_t __n) throw ();
>
>extern size_t wcstombs (char *__restrict __s,
>   __const wchar_t *__restrict __pwcs, size_t __n)
>     throw ();
>
>
>
>
>
>
>
>
>extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) ;
># 908 "/usr/include/stdlib.h" 3 4
>extern int getsubopt (char **__restrict __optionp,
>        char *__const *__restrict __tokens,
>        char **__restrict __valuep)
>     throw () __attribute__ ((__nonnull__ (1, 2, 3))) ;
>
>
>
>
>
>extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>
>
>extern int posix_openpt (int __oflag) ;
>
>
>
>
>
>
>
>extern int grantpt (int __fd) throw ();
>
>
>
>extern int unlockpt (int __fd) throw ();
>
>
>
>
>extern char *ptsname (int __fd) throw () ;
>
>
>
>
>
>
>extern int ptsname_r (int __fd, char *__buf, size_t __buflen)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int getpt (void);
>
>
>
>
>
>
>extern int getloadavg (double __loadavg[], int __nelem)
>     throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>
>
>}
># 31 "hoardmanager.h" 2
>
>
>
># 1 "heaplayers/util/sassert.h" 1
># 18 "heaplayers/util/sassert.h"
>namespace HL {
>
>  template <int assertion>
>    class sassert;
>
>  template<> class sassert<1> {
>  public:
>    enum { VALUE = 1 };
>  };
>
>}
># 35 "hoardmanager.h" 2
># 1 "statistics.h" 1
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 5 "statistics.h" 2
>
>namespace Hoard {
>
>class Statistics {
>public:
>  Statistics (void)
>    : _inUse (0),
>      _allocated (0)
>  {}
>
>  inline int getInUse (void) const { (static_cast<void> (0)); return _inUse; }
>  inline int getAllocated (void) const { (static_cast<void> (0)); return _allocated; }
>  inline void setInUse (int u) { (static_cast<void> (0)); (static_cast<void> (0)); _inUse = u; }
>  inline void setAllocated (int a) { (static_cast<void> (0)); (static_cast<void> (0)); _allocated = a; }
>
>private:
>
>
>  int _inUse;
>
>
>  int _allocated;
>};
>
>}
># 36 "hoardmanager.h" 2
># 1 "emptyclass.h" 1
>
>
>
>
>
># 1 "/usr/include/stdio.h" 1 3 4
># 30 "/usr/include/stdio.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 35 "/usr/include/stdio.h" 2 3 4
># 44 "/usr/include/stdio.h" 3 4
>
>
>typedef struct _IO_FILE FILE;
>
>
>
>
>
># 62 "/usr/include/stdio.h" 3 4
>typedef struct _IO_FILE __FILE;
># 72 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/libio.h" 1 3 4
># 32 "/usr/include/libio.h" 3 4
># 1 "/usr/include/_G_config.h" 1 3 4
># 14 "/usr/include/_G_config.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 355 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 3 4
>typedef unsigned int wint_t;
># 15 "/usr/include/_G_config.h" 2 3 4
># 24 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
>
># 1 "/usr/include/bits/wchar.h" 1 3 4
># 51 "/usr/include/wchar.h" 2 3 4
># 76 "/usr/include/wchar.h" 3 4
>typedef struct
>{
>  int __count;
>  union
>  {
>    wint_t __wch;
>    char __wchb[4];
>  } __value;
>} __mbstate_t;
># 25 "/usr/include/_G_config.h" 2 3 4
>
>typedef struct
>{
>  __off_t __pos;
>  __mbstate_t __state;
>} _G_fpos_t;
>typedef struct
>{
>  __off64_t __pos;
>  __mbstate_t __state;
>} _G_fpos64_t;
># 44 "/usr/include/_G_config.h" 3 4
># 1 "/usr/include/gconv.h" 1 3 4
># 28 "/usr/include/gconv.h" 3 4
># 1 "/usr/include/wchar.h" 1 3 4
># 48 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 29 "/usr/include/gconv.h" 2 3 4
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 32 "/usr/include/gconv.h" 2 3 4
>
>
>
>
>
>enum
>{
>  __GCONV_OK = 0,
>  __GCONV_NOCONV,
>  __GCONV_NODB,
>  __GCONV_NOMEM,
>
>  __GCONV_EMPTY_INPUT,
>  __GCONV_FULL_OUTPUT,
>  __GCONV_ILLEGAL_INPUT,
>  __GCONV_INCOMPLETE_INPUT,
>
>  __GCONV_ILLEGAL_DESCRIPTOR,
>  __GCONV_INTERNAL_ERROR
>};
>
>
>
>enum
>{
>  __GCONV_IS_LAST = 0x0001,
>  __GCONV_IGNORE_ERRORS = 0x0002
>};
>
>
>
>struct __gconv_step;
>struct __gconv_step_data;
>struct __gconv_loaded_object;
>struct __gconv_trans_data;
>
>
>
>typedef int (*__gconv_fct) (struct __gconv_step *, struct __gconv_step_data *,
>       __const unsigned char **, __const unsigned char *,
>       unsigned char **, size_t *, int, int);
>
>
>typedef wint_t (*__gconv_btowc_fct) (struct __gconv_step *, unsigned char);
>
>
>typedef int (*__gconv_init_fct) (struct __gconv_step *);
>typedef void (*__gconv_end_fct) (struct __gconv_step *);
>
>
>
>typedef int (*__gconv_trans_fct) (struct __gconv_step *,
>      struct __gconv_step_data *, void *,
>      __const unsigned char *,
>      __const unsigned char **,
>      __const unsigned char *, unsigned char **,
>      size_t *);
>
>
>typedef int (*__gconv_trans_context_fct) (void *, __const unsigned char *,
>       __const unsigned char *,
>       unsigned char *, unsigned char *);
>
>
>typedef int (*__gconv_trans_query_fct) (__const char *, __const char ***,
>     size_t *);
>
>
>typedef int (*__gconv_trans_init_fct) (void **, const char *);
>typedef void (*__gconv_trans_end_fct) (void *);
>
>struct __gconv_trans_data
>{
>
>  __gconv_trans_fct __trans_fct;
>  __gconv_trans_context_fct __trans_context_fct;
>  __gconv_trans_end_fct __trans_end_fct;
>  void *__data;
>  struct __gconv_trans_data *__next;
>};
>
>
>
>struct __gconv_step
>{
>  struct __gconv_loaded_object *__shlib_handle;
>  __const char *__modname;
>
>  int __counter;
>
>  char *__from_name;
>  char *__to_name;
>
>  __gconv_fct __fct;
>  __gconv_btowc_fct __btowc_fct;
>  __gconv_init_fct __init_fct;
>  __gconv_end_fct __end_fct;
>
>
>
>  int __min_needed_from;
>  int __max_needed_from;
>  int __min_needed_to;
>  int __max_needed_to;
>
>
>  int __stateful;
>
>  void *__data;
>};
>
>
>
>struct __gconv_step_data
>{
>  unsigned char *__outbuf;
>  unsigned char *__outbufend;
>
>
>
>  int __flags;
>
>
>
>  int __invocation_counter;
>
>
>
>  int __internal_use;
>
>  __mbstate_t *__statep;
>  __mbstate_t __state;
>
>
>
>  struct __gconv_trans_data *__trans;
>};
>
>
>
>typedef struct __gconv_info
>{
>  size_t __nsteps;
>  struct __gconv_step *__steps;
>  __extension__ struct __gconv_step_data __data [];
>} *__gconv_t;
># 45 "/usr/include/_G_config.h" 2 3 4
>typedef union
>{
>  struct __gconv_info __cd;
>  struct
>  {
>    struct __gconv_info __cd;
>    struct __gconv_step_data __data;
>  } __combined;
>} _G_iconv_t;
>
>typedef int _G_int16_t __attribute__ ((__mode__ (__HI__)));
>typedef int _G_int32_t __attribute__ ((__mode__ (__SI__)));
>typedef unsigned int _G_uint16_t __attribute__ ((__mode__ (__HI__)));
>typedef unsigned int _G_uint32_t __attribute__ ((__mode__ (__SI__)));
># 33 "/usr/include/libio.h" 2 3 4
># 53 "/usr/include/libio.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stdarg.h" 1 3 4
># 43 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stdarg.h" 3 4
>typedef __builtin_va_list __gnuc_va_list;
># 54 "/usr/include/libio.h" 2 3 4
># 166 "/usr/include/libio.h" 3 4
>struct _IO_jump_t; struct _IO_FILE;
># 176 "/usr/include/libio.h" 3 4
>typedef void _IO_lock_t;
>
>
>
>
>
>struct _IO_marker {
>  struct _IO_marker *_next;
>  struct _IO_FILE *_sbuf;
>
>
>
>  int _pos;
># 199 "/usr/include/libio.h" 3 4
>};
>
>
>enum __codecvt_result
>{
>  __codecvt_ok,
>  __codecvt_partial,
>  __codecvt_error,
>  __codecvt_noconv
>};
># 267 "/usr/include/libio.h" 3 4
>struct _IO_FILE {
>  int _flags;
>
>
>
>
>  char* _IO_read_ptr;
>  char* _IO_read_end;
>  char* _IO_read_base;
>  char* _IO_write_base;
>  char* _IO_write_ptr;
>  char* _IO_write_end;
>  char* _IO_buf_base;
>  char* _IO_buf_end;
>
>  char *_IO_save_base;
>  char *_IO_backup_base;
>  char *_IO_save_end;
>
>  struct _IO_marker *_markers;
>
>  struct _IO_FILE *_chain;
>
>  int _fileno;
>
>
>
>  int _flags2;
>
>  __off_t _old_offset;
>
>
>
>  unsigned short _cur_column;
>  signed char _vtable_offset;
>  char _shortbuf[1];
>
>
>
>  _IO_lock_t *_lock;
># 315 "/usr/include/libio.h" 3 4
>  __off64_t _offset;
># 324 "/usr/include/libio.h" 3 4
>  void *__pad1;
>  void *__pad2;
>  void *__pad3;
>  void *__pad4;
>  size_t __pad5;
>
>  int _mode;
>
>  char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
>
>};
>
>
>
>
>
>struct _IO_FILE_plus;
>
>extern struct _IO_FILE_plus _IO_2_1_stdin_;
>extern struct _IO_FILE_plus _IO_2_1_stdout_;
>extern struct _IO_FILE_plus _IO_2_1_stderr_;
># 360 "/usr/include/libio.h" 3 4
>typedef __ssize_t __io_read_fn (void *__cookie, char *__buf, size_t __nbytes);
>
>
>
>
>
>
>
>typedef __ssize_t __io_write_fn (void *__cookie, __const char *__buf,
>     size_t __n);
>
>
>
>
>
>
>
>typedef int __io_seek_fn (void *__cookie, __off64_t *__pos, int __w);
>
>
>typedef int __io_close_fn (void *__cookie);
>
>
>
>
>typedef __io_read_fn cookie_read_function_t;
>typedef __io_write_fn cookie_write_function_t;
>typedef __io_seek_fn cookie_seek_function_t;
>typedef __io_close_fn cookie_close_function_t;
>
>
>typedef struct
>{
>  __io_read_fn *read;
>  __io_write_fn *write;
>  __io_seek_fn *seek;
>  __io_close_fn *close;
>} _IO_cookie_io_functions_t;
>typedef _IO_cookie_io_functions_t cookie_io_functions_t;
>
>struct _IO_cookie_file;
>
>
>extern void _IO_cookie_init (struct _IO_cookie_file *__cfile, int __read_write,
>        void *__cookie, _IO_cookie_io_functions_t __fns);
>
>
>
>
>extern "C" {
>
>
>extern int __underflow (_IO_FILE *) throw ();
>extern int __uflow (_IO_FILE *) throw ();
>extern int __overflow (_IO_FILE *, int) throw ();
>extern wint_t __wunderflow (_IO_FILE *) throw ();
>extern wint_t __wuflow (_IO_FILE *) throw ();
>extern wint_t __woverflow (_IO_FILE *, wint_t) throw ();
># 450 "/usr/include/libio.h" 3 4
>extern int _IO_getc (_IO_FILE *__fp) throw ();
>extern int _IO_putc (int __c, _IO_FILE *__fp) throw ();
>extern int _IO_feof (_IO_FILE *__fp) throw ();
>extern int _IO_ferror (_IO_FILE *__fp) throw ();
>
>extern int _IO_peekc_locked (_IO_FILE *__fp) throw ();
>
>
>
>
>
>extern void _IO_flockfile (_IO_FILE *) throw ();
>extern void _IO_funlockfile (_IO_FILE *) throw ();
>extern int _IO_ftrylockfile (_IO_FILE *) throw ();
># 480 "/usr/include/libio.h" 3 4
>extern int _IO_vfscanf (_IO_FILE * __restrict, const char * __restrict,
>   __gnuc_va_list, int *__restrict);
>extern int _IO_vfprintf (_IO_FILE *__restrict, const char *__restrict,
>    __gnuc_va_list);
>extern __ssize_t _IO_padn (_IO_FILE *, int, __ssize_t) throw ();
>extern size_t _IO_sgetn (_IO_FILE *, void *, size_t) throw ();
>
>extern __off64_t _IO_seekoff (_IO_FILE *, __off64_t, int, int) throw ();
>extern __off64_t _IO_seekpos (_IO_FILE *, __off64_t, int) throw ();
>
>extern void _IO_free_backup_area (_IO_FILE *) throw ();
># 538 "/usr/include/libio.h" 3 4
>}
># 73 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>typedef __gnuc_va_list va_list;
># 86 "/usr/include/stdio.h" 3 4
>
>
>typedef _G_fpos_t fpos_t;
>
>
>
>
>
>typedef _G_fpos64_t fpos64_t;
># 138 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 139 "/usr/include/stdio.h" 2 3 4
>
>
>
>extern struct _IO_FILE *stdin;
>extern struct _IO_FILE *stdout;
>extern struct _IO_FILE *stderr;
>
>
>
>
>
>
>
>
>
>extern int remove (__const char *__filename) throw ();
>
>extern int rename (__const char *__old, __const char *__new) throw ();
>
>
>
>
>
>
>
>
>
>extern FILE *tmpfile (void);
># 176 "/usr/include/stdio.h" 3 4
>extern FILE *tmpfile64 (void);
>
>
>
>extern char *tmpnam (char *__s) throw ();
>
>
>
>
>
>extern char *tmpnam_r (char *__s) throw ();
># 198 "/usr/include/stdio.h" 3 4
>extern char *tempnam (__const char *__dir, __const char *__pfx)
>     throw () __attribute__ ((__malloc__));
>
>
>
>
>
>
>
>
>extern int fclose (FILE *__stream);
>
>
>
>
>extern int fflush (FILE *__stream);
>
># 223 "/usr/include/stdio.h" 3 4
>extern int fflush_unlocked (FILE *__stream);
># 233 "/usr/include/stdio.h" 3 4
>extern int fcloseall (void);
>
>
>
>
>
>
>
>
>
>extern FILE *fopen (__const char *__restrict __filename,
>      __const char *__restrict __modes);
>
>
>
>
>extern FILE *freopen (__const char *__restrict __filename,
>        __const char *__restrict __modes,
>        FILE *__restrict __stream);
># 264 "/usr/include/stdio.h" 3 4
>
>
>extern FILE *fopen64 (__const char *__restrict __filename,
>        __const char *__restrict __modes);
>extern FILE *freopen64 (__const char *__restrict __filename,
>   __const char *__restrict __modes,
>   FILE *__restrict __stream);
>
>
>
>
>extern FILE *fdopen (int __fd, __const char *__modes) throw ();
>
>
>
>
>
>extern FILE *fopencookie (void *__restrict __magic_cookie,
>     __const char *__restrict __modes,
>     _IO_cookie_io_functions_t __io_funcs) throw ();
>
>
>extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes) throw ();
>
>
>
>
>extern FILE *open_memstream (char **__restrict __bufloc,
>        size_t *__restrict __sizeloc) throw ();
>
>
>
>
>
>
>extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) throw ();
>
>
>
>extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
>      int __modes, size_t __n) throw ();
>
>
>
>
>
>extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
>         size_t __size) throw ();
>
>
>extern void setlinebuf (FILE *__stream) throw ();
>
>
>
>
>
>
>
>
>extern int fprintf (FILE *__restrict __stream,
>      __const char *__restrict __format, ...);
>
>
>
>
>extern int printf (__const char *__restrict __format, ...);
>
>extern int sprintf (char *__restrict __s,
>      __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>extern int vfprintf (FILE *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg);
>
>
>
>
>extern int vprintf (__const char *__restrict __format, __gnuc_va_list __arg);
>
>extern int vsprintf (char *__restrict __s, __const char *__restrict __format,
>       __gnuc_va_list __arg) throw ();
>
>
>
>
>
>extern int snprintf (char *__restrict __s, size_t __maxlen,
>       __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 3, 4)));
>
>extern int vsnprintf (char *__restrict __s, size_t __maxlen,
>        __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 3, 0)));
>
>
>
>
>
>
>extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f,
>        __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int __asprintf (char **__restrict __ptr,
>         __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>extern int asprintf (char **__restrict __ptr,
>       __const char *__restrict __fmt, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>
>
>
>extern int vdprintf (int __fd, __const char *__restrict __fmt,
>       __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__printf__, 2, 0)));
>extern int dprintf (int __fd, __const char *__restrict __fmt, ...)
>     __attribute__ ((__format__ (__printf__, 2, 3)));
>
>
>
>
>
>
>
>
>extern int fscanf (FILE *__restrict __stream,
>     __const char *__restrict __format, ...) ;
>
>
>
>
>extern int scanf (__const char *__restrict __format, ...) ;
>
>extern int sscanf (__const char *__restrict __s,
>     __const char *__restrict __format, ...) throw ();
>
>
>
>
>
>
>
>
>extern int vfscanf (FILE *__restrict __s, __const char *__restrict __format,
>      __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 2, 0))) ;
>
>
>
>
>
>extern int vscanf (__const char *__restrict __format, __gnuc_va_list __arg)
>     __attribute__ ((__format__ (__scanf__, 1, 0))) ;
>
>
>extern int vsscanf (__const char *__restrict __s,
>      __const char *__restrict __format, __gnuc_va_list __arg)
>     throw () __attribute__ ((__format__ (__scanf__, 2, 0)));
>
>
>
>
>
>
>
>
>
>extern int fgetc (FILE *__stream);
>extern int getc (FILE *__stream);
>
>
>
>
>
>extern int getchar (void);
>
># 456 "/usr/include/stdio.h" 3 4
>extern int getc_unlocked (FILE *__stream);
>extern int getchar_unlocked (void);
># 467 "/usr/include/stdio.h" 3 4
>extern int fgetc_unlocked (FILE *__stream);
>
>
>
>
>
>
>
>
>
>
>
>extern int fputc (int __c, FILE *__stream);
>extern int putc (int __c, FILE *__stream);
>
>
>
>
>
>extern int putchar (int __c);
>
># 500 "/usr/include/stdio.h" 3 4
>extern int fputc_unlocked (int __c, FILE *__stream);
>
>
>
>
>
>
>
>extern int putc_unlocked (int __c, FILE *__stream);
>extern int putchar_unlocked (int __c);
>
>
>
>
>
>
>extern int getw (FILE *__stream);
>
>
>extern int putw (int __w, FILE *__stream);
>
>
>
>
>
>
>
>
>extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
>     ;
>
>
>
>
>
>
>extern char *gets (char *__s) ;
>
># 546 "/usr/include/stdio.h" 3 4
>extern char *fgets_unlocked (char *__restrict __s, int __n,
>        FILE *__restrict __stream) ;
># 562 "/usr/include/stdio.h" 3 4
>extern __ssize_t __getdelim (char **__restrict __lineptr,
>          size_t *__restrict __n, int __delimiter,
>          FILE *__restrict __stream) ;
>extern __ssize_t getdelim (char **__restrict __lineptr,
>        size_t *__restrict __n, int __delimiter,
>        FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>extern __ssize_t getline (char **__restrict __lineptr,
>       size_t *__restrict __n,
>       FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>extern int fputs (__const char *__restrict __s, FILE *__restrict __stream);
>
>
>
>
>
>extern int puts (__const char *__s);
>
>
>
>
>
>
>extern int ungetc (int __c, FILE *__stream);
>
>
>
>
>
>
>extern size_t fread (void *__restrict __ptr, size_t __size,
>       size_t __n, FILE *__restrict __stream) ;
>
>
>
>
>extern size_t fwrite (__const void *__restrict __ptr, size_t __size,
>        size_t __n, FILE *__restrict __s) ;
>
># 623 "/usr/include/stdio.h" 3 4
>extern int fputs_unlocked (__const char *__restrict __s,
>      FILE *__restrict __stream);
># 634 "/usr/include/stdio.h" 3 4
>extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
>         size_t __n, FILE *__restrict __stream) ;
>extern size_t fwrite_unlocked (__const void *__restrict __ptr, size_t __size,
>          size_t __n, FILE *__restrict __stream) ;
>
>
>
>
>
>
>
>
>extern int fseek (FILE *__stream, long int __off, int __whence);
>
>
>
>
>extern long int ftell (FILE *__stream) ;
>
>
>
>
>extern void rewind (FILE *__stream);
>
># 670 "/usr/include/stdio.h" 3 4
>extern int fseeko (FILE *__stream, __off_t __off, int __whence);
>
>
>
>
>extern __off_t ftello (FILE *__stream) ;
># 689 "/usr/include/stdio.h" 3 4
>
>
>
>
>
>
>extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos);
>
>
>
>
>extern int fsetpos (FILE *__stream, __const fpos_t *__pos);
># 712 "/usr/include/stdio.h" 3 4
>
>
>
>extern int fseeko64 (FILE *__stream, __off64_t __off, int __whence);
>extern __off64_t ftello64 (FILE *__stream) ;
>extern int fgetpos64 (FILE *__restrict __stream, fpos64_t *__restrict __pos);
>extern int fsetpos64 (FILE *__stream, __const fpos64_t *__pos);
>
>
>
>
>extern void clearerr (FILE *__stream) throw ();
>
>extern int feof (FILE *__stream) throw () ;
>
>extern int ferror (FILE *__stream) throw () ;
>
>
>
>
>extern void clearerr_unlocked (FILE *__stream) throw ();
>extern int feof_unlocked (FILE *__stream) throw () ;
>extern int ferror_unlocked (FILE *__stream) throw () ;
>
>
>
>
>
>
>
>
>extern void perror (__const char *__s);
>
>
>
>
>
>
># 1 "/usr/include/bits/sys_errlist.h" 1 3 4
># 27 "/usr/include/bits/sys_errlist.h" 3 4
>extern int sys_nerr;
>extern __const char *__const sys_errlist[];
>
>
>extern int _sys_nerr;
>extern __const char *__const _sys_errlist[];
># 751 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>extern int fileno (FILE *__stream) throw () ;
>
>
>
>
>extern int fileno_unlocked (FILE *__stream) throw () ;
># 770 "/usr/include/stdio.h" 3 4
>extern FILE *popen (__const char *__command, __const char *__modes) ;
>
>
>
>
>
>extern int pclose (FILE *__stream);
>
>
>
>
>
>extern char *ctermid (char *__s) throw ();
>
>
>
>
>
>extern char *cuserid (char *__s);
>
>
>
>
>struct obstack;
>
>
>extern int obstack_printf (struct obstack *__restrict __obstack,
>      __const char *__restrict __format, ...)
>     throw () __attribute__ ((__format__ (__printf__, 2, 3)));
>extern int obstack_vprintf (struct obstack *__restrict __obstack,
>       __const char *__restrict __format,
>       __gnuc_va_list __args)
>     throw () __attribute__ ((__format__ (__printf__, 2, 0)));
>
>
>
>
>
>
>
>extern void flockfile (FILE *__stream) throw ();
>
>
>
>extern int ftrylockfile (FILE *__stream) throw () ;
>
>
>extern void funlockfile (FILE *__stream) throw ();
># 831 "/usr/include/stdio.h" 3 4
># 1 "/usr/include/bits/stdio.h" 1 3 4
># 33 "/usr/include/bits/stdio.h" 3 4
>inline int
>vprintf (__const char *__restrict __fmt, __gnuc_va_list __arg)
>{
>  return vfprintf (stdout, __fmt, __arg);
>}
>
>
>inline int
>getchar (void)
>{
>  return _IO_getc (stdin);
>}
>
>
>
>
>inline int
>getc_unlocked (FILE *__fp)
>{
>  return (__builtin_expect (((__fp)->_IO_read_ptr >= (__fp)->_IO_read_end), 0) ? __uflow (__fp) : *(unsigned char *) (__fp)->_IO_read_ptr++);
>}
>
>
>inline int
>getchar_unlocked (void)
>{
>  return (__builtin_expect (((stdin)->_IO_read_ptr >= (stdin)->_IO_read_end), 0) ? __uflow (stdin) : *(unsigned char *) (stdin)->_IO_read_ptr++);
>}
>
>
>
>
>inline int
>putchar (int __c)
>{
>  return _IO_putc (__c, stdout);
>}
>
>
>
>
>inline int
>fputc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>inline int
>putc_unlocked (int __c, FILE *__stream)
>{
>  return (__builtin_expect (((__stream)->_IO_write_ptr >= (__stream)->_IO_write_end), 0) ? __overflow (__stream, (unsigned char) (__c)) : (unsigned char) (*(__stream)->_IO_write_ptr++ = (__c)));
>}
>
>
>inline int
>putchar_unlocked (int __c)
>{
>  return (__builtin_expect (((stdout)->_IO_write_ptr >= (stdout)->_IO_write_end), 0) ? __overflow (stdout, (unsigned char) (__c)) : (unsigned char) (*(stdout)->_IO_write_ptr++ = (__c)));
>}
>
>
>
>
>
>inline __ssize_t
>getline (char **__lineptr, size_t *__n, FILE *__stream)
>{
>  return __getdelim (__lineptr, __n, '\n', __stream);
>}
>
>
>
>
>
>inline int
>feof_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x10) != 0);
>}
>
>
>inline int
>ferror_unlocked (FILE *__stream) throw ()
>{
>  return (((__stream)->_flags & 0x20) != 0);
>}
># 832 "/usr/include/stdio.h" 2 3 4
>
>
>
>
>
>}
># 7 "emptyclass.h" 2
>
># 1 "array.h" 1
># 30 "array.h"
># 1 "/usr/include/assert.h" 1 3 4
># 31 "array.h" 2
>
>namespace Hoard {
>
>template <int N, typename T>
>class Array {
>public:
>
>  inline T& operator()(int index) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return _item[index];
>  }
>
>  inline const T& operator()(int index) const {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return _item[index];
>  }
>
>private:
>
>  T _item[N];
>
>};
>
>}
># 9 "emptyclass.h" 2
>
>
>
>
>
>
>
>namespace Hoard {
>
>template <class SuperblockType_,
>   int EmptinessClasses>
>class EmptyClass {
>
>  enum { SuperblockSize = sizeof(SuperblockType_) };
>
>public:
>
>  typedef SuperblockType_ SuperblockType;
>
>  EmptyClass (void)
>  {
>    for (int i = 0; i <= EmptinessClasses + 1; i++) {
>      _available(i) = 0;
>    }
>  }
>
>  void dumpStats (void) {
>    for (int i = 0; i <= EmptinessClasses + 1; i++) {
>      SuperblockType * s = _available(i);
>      if (s) {
> fprintf (stderr, "EmptyClass: emptiness class = %d\n", i);
> while (s) {
>   s->dumpStats();
>   s = s->getNext();
> }
>      }
>    }
>  }
>
>
>  SuperblockType * getEmpty (void) {
>    Check<EmptyClass, MyChecker> check (this);
>    SuperblockType * s = _available(0);
>    if (s &&
> (s->getObjectsFree() == s->getTotalObjects())) {
>
>      _available(0) = s->getNext();
>      if (_available(0)) {
> _available(0)->setPrev (0);
>      }
>      s->setPrev (0);
>      s->setNext (0);
>      return s;
>    }
>    return 0;
>  }
>
>  SuperblockType * get (void) {
>    Check<EmptyClass, MyChecker> check (this);
>
>
>    for (int n = 0; n < EmptinessClasses + 1; n++) {
>      SuperblockType * s = _available(n);
>      while (s) {
> (static_cast<void> (0));
>
> _available(n) = s->getNext();
> if (_available(n)) {
>   _available(n)->setPrev (0);
> }
> s->setPrev (0);
> s->setNext (0);
># 95 "emptyclass.h"
> int cl = getFullness (s);
> if (cl > n) {
>   put (s);
>   SuperblockType * sNew = _available(n);
>   (static_cast<void> (0));
>   s = sNew;
> } else {
>   return s;
> }
>      }
>    }
>    return 0;
>  }
>
>  void put (SuperblockType * s) {
>    Check<EmptyClass, MyChecker> check (this);
># 124 "emptyclass.h"
>    int cl = getFullness (s);
>
>
>    s->setPrev (0);
>    s->setNext (_available(cl));
>    if (_available(cl)) {
>      _available(cl)->setPrev (s);
>    }
>    _available(cl) = s;
>  }
>
>  inline __attribute__((malloc)) void * malloc (size_t sz) {
>
>    for (int i = EmptinessClasses; i >= 0; i--) {
>      SuperblockType * s = _available(i);
>
>      if (s) {
> int oldCl = getFullness (s);
> void * ptr = s->malloc (sz);
> int newCl = getFullness (s);
> if (ptr) {
>   if (oldCl != newCl) {
>     transfer (s, oldCl, newCl);
>   }
>   return ptr;
> }
>      }
>    }
>    return __null;
>  }
>
>  inline void free (void * ptr) {
>    Check<EmptyClass, MyChecker> check (this);
>    SuperblockType * s = getSuperblock (ptr);
>    int oldCl = getFullness (s);
>    s->free (ptr);
>    int newCl = getFullness (s);
>
>    if (oldCl != newCl) {
>
>      transfer (s, oldCl, newCl);
>    }
>  }
>
>
>  static inline SuperblockType * getSuperblock (void * ptr) {
>    return SuperblockType::getSuperblock (ptr);
>  }
>
>private:
>
>  void transfer (SuperblockType * s, int oldCl, int newCl)
>  {
>    SuperblockType * prev = s->getPrev();
>    SuperblockType * next = s->getNext();
>    if (prev) { prev->setNext (next); }
>    if (next) { next->setPrev (prev); }
>    if (s == _available(oldCl)) {
>      (static_cast<void> (0));
>      _available(oldCl) = next;
>    }
>    s->setNext (_available(newCl));
>    s->setPrev (0);
>    if (_available(newCl)) { _available(newCl)->setPrev (s); }
>    _available(newCl) = s;
>  }
>
>  static inline int getFullness (SuperblockType * s) {
>
>
>    int total = s->getTotalObjects();
>    int free = s->getObjectsFree();
>    if (total == free) {
>      return 0;
>    } else {
>      return 1 + (EmptinessClasses * (total - free)) / total;
>    }
>  }
>
>
>
>  class MyChecker;
>  friend class MyChecker;
>
>
>  class MyChecker {
>  public:
># 219 "emptyclass.h"
>    static void precondition (EmptyClass *) {}
>    static void postcondition (EmptyClass *) {}
>
>  };
>
>  void sanityCheckPre (void) { sanityCheck(); }
>
>  void sanityCheck (void) {
>    for (int i = 0; i <= EmptinessClasses + 1; i++) {
>      SuperblockType * s = _available(i);
>      while (s) {
> (static_cast<void> (0));
> s = s->getNext();
>      }
>    }
>  }
>
>
>
>  Array<EmptinessClasses + 2, SuperblockType *> _available;
>
>};
>
>}
># 37 "hoardmanager.h" 2
>
># 1 "manageonesuperblock.h" 1
># 18 "manageonesuperblock.h"
>namespace Hoard {
>
>template <class SuperHeap>
>class ManageOneSuperblock : public SuperHeap {
>public:
>
>  typedef typename SuperHeap::SuperblockType SuperblockType;
>
>
>  inline void * malloc (size_t sz) {
>    if (_current) {
>      void * ptr = _current->malloc (sz);
>      if (ptr) {
> (static_cast<void> (0));
> return ptr;
>      }
>    }
>    return slowMallocPath (sz);
>  }
>
>
>  inline void free (void * ptr) {
>    SuperblockType * s = SuperHeap::getSuperblock (ptr);
>    if (s == _current) {
>      _current->free (ptr);
>    } else {
>      SuperHeap::free (ptr);
>    }
>  }
>
>
>  SuperblockType * get (void) {
>    if (_current) {
>      SuperblockType * s = _current;
>      _current = __null;
>      return s;
>    } else {
>
>      return SuperHeap::get();
>    }
>  }
>
>
>  inline void put (SuperblockType * s) {
>    if (!s || (s == _current) || (!s->isValidSuperblock())) {
>
>
>      return;
>    }
>    if (_current) {
>
>      SuperHeap::put (_current);
>    }
>    _current = s;
>  }
>
>private:
>
>
>  void * slowMallocPath (size_t sz) {
>    void * ptr = __null;
>    while (!ptr) {
>      if (_current) {
> ptr = _current->malloc (sz);
> if (ptr) {
>   return ptr;
> } else {
>   SuperHeap::put (_current);
> }
>      }
>      _current = SuperHeap::get();
>      if (!_current) {
> return __null;
>      }
>      ptr = _current->malloc (sz);
>    }
>    return ptr;
>  }
>
>
>  SuperblockType * _current;
>
>};
>
>}
># 39 "hoardmanager.h" 2
>
>
>
># 1 "heaplayers/bins.h" 1
>
>
>
>namespace HL {
>
>  template <class Header, int Size>
>    class bins;
>
>}
># 43 "hoardmanager.h" 2
># 1 "basehoardmanager.h" 1
># 14 "basehoardmanager.h"
>template <class SuperblockType_>
>class BaseHoardManager {
>public:
>
>  BaseHoardManager (void)
>    : _magic (0xedded00d)
>  {}
>
>  virtual ~BaseHoardManager (void)
>  {}
>
>  inline int isValid (void) const {
>    return (_magic == 0xedded00d);
>  }
>
>
>  typedef SuperblockType_ SuperblockType;
>
>
>  inline virtual void free (void *) {}
>
>
>  inline virtual void lock (void) {}
>
>
>  inline virtual void unlock (void) {};
>
>
>  static inline size_t getSize (void * ptr) {
>    SuperblockType * s = getSuperblock (ptr);
>    (static_cast<void> (0));
>    return s->getSize (ptr);
>  }
>
>
>
>
>  static inline SuperblockType * getSuperblock (void * ptr) {
>    return SuperblockType::getSuperblock (ptr);
>  }
>
>private:
>
>  enum { SuperblockSize = sizeof(SuperblockType) };
>
>  HL::sassert<((SuperblockSize & (SuperblockSize - 1)) == 0)> EnsureSuperblockSizeIsPowerOfTwo;
>
>  const unsigned long _magic;
>
>};
># 44 "hoardmanager.h" 2
># 1 "emptyhoardmanager.h" 1
>
>
>
>
>
>
>template <class SuperblockType_>
>class EmptyHoardManager : public BaseHoardManager<SuperblockType_> {
>public:
>
>  EmptyHoardManager (void)
>    : _magic (0x1d2d3d40)
>    {}
>
>  int isValid (void) const {
>    return (_magic == 0x1d2d3d40);
>  }
>
>  typedef SuperblockType_ SuperblockType;
>
>  void free (void *) { abort(); }
>  void lock (void) {}
>  void unlock (void) {}
>
>  SuperblockType * get (size_t, EmptyHoardManager *) { abort(); return __null; }
>  void put (SuperblockType *, size_t) { abort(); }
>
>
>
>
>
>private:
>
>  unsigned long _magic;
>
>};
># 45 "hoardmanager.h" 2
># 1 "heaplayers/util/guard.h" 1
>
>
>
>
>
>namespace HL {
>
>  template <class LockType>
>  class Guard {
>  public:
>    inline Guard (LockType& l)
>      : _lock (l)
>      {
> _lock.lock();
>      }
>
>    inline ~Guard (void) {
>      _lock.unlock();
>    }
>  private:
>    LockType& _lock;
>  };
>
>}
># 46 "hoardmanager.h" 2
>
>
>using namespace HL;
># 58 "hoardmanager.h"
>namespace Hoard {
>
>template <class SourceHeap,
>   class ParentHeap,
>   class SuperblockType_,
>   int EmptinessClasses,
>   class LockType,
>          class thresholdFunctionClass,
>          class HeapType>
>class HoardManager : public BaseHoardManager<SuperblockType_>,
>                     public thresholdFunctionClass
>{
>public:
>
>  HoardManager (void)
>    : _magic (MAGIC_NUMBER)
>  {}
>
>  virtual ~HoardManager (void) {}
>
>  typedef SuperblockType_ SuperblockType;
>
>
>  enum { Alignment = sizeof(double) };
>
>
>  __attribute__((malloc)) inline void * malloc (size_t sz)
>  {
>    Check<HoardManager, sanityCheck> check (this);
>    const int binIndex = binType::getSizeClass(sz);
>    size_t realSize = binType::getClassSize (binIndex);
>    (static_cast<void> (0));
>
>
>    void * ptr = getObject (binIndex, realSize);
>    if (ptr) {
>      return ptr;
>    } else {
>      return slowPathMalloc (realSize);
>    }
>  }
>
>
>
>  __attribute__ ((noinline)) void put (SuperblockType * s, size_t sz) {
>    HL::Guard<LockType> l (_theLock);
>
>    (static_cast<void> (0));
>    Check<HoardManager, sanityCheck> check (this);
>
>    const int binIndex = binType::getSizeClass(sz);
>
>
>    Statistics& stats = _stats(binIndex);
>    int a = stats.getAllocated() + s->getTotalObjects();
>    int u = stats.getInUse() + (s->getTotalObjects() - s->getObjectsFree());
>
>    if (thresholdFunctionClass::function (u, a, sz)) {
>
>
>      _ph.put (reinterpret_cast<typename ParentHeap::SuperblockType *>(s), sz);
>    } else {
>      unlocked_put (s, sz);
>    }
>  }
>
>
>
>  __attribute__ ((noinline)) SuperblockType * get (size_t sz, HeapType * dest) {
>    HL::Guard<LockType> l (_theLock);
>    Check<HoardManager, sanityCheck> check (this);
>    const int binIndex = binType::getSizeClass (sz);
>    SuperblockType * s = _otherBins(binIndex).get();
>    if (s) {
>      (static_cast<void> (0));
>
>
>      decStatsSuperblock (s, binIndex);
>      s->setOwner (dest);
>    }
>
>    return s;
>  }
>
>
>  inline void free (void * ptr) {
>    Check<HoardManager, sanityCheck> check (this);
>
>
>    SuperblockType * s = SuperHeap::getSuperblock (ptr);
>
>    (static_cast<void> (0));
>
>
>    const size_t sz = s->getSize (ptr);
>    const int binIndex = binType::getSizeClass (sz);
>
>
>    _otherBins(binIndex).free (ptr);
>
>
>
>    Statistics& stats = _stats(binIndex);
>    int u = stats.getInUse();
>    const int a = stats.getAllocated();
>
>    if (u > 0)
>      u--;
>    stats.setInUse (u);
>
>
>
>    if (thresholdFunctionClass::function (u, a, sz)) {
>
>      slowPathFree (binIndex, u, a);
>
>    }
>  }
>
>  inline void lock (void) {
>    _theLock.lock();
>  }
>
>  inline void unlock (void) {
>    _theLock.unlock();
>  }
>
>private:
>
>  typedef BaseHoardManager<SuperblockType_> SuperHeap;
>
>  enum { SuperblockSize = sizeof(SuperblockType_) };
>
>
>  HL::sassert<((SuperblockSize & (SuperblockSize-1)) == 0)> verifyPowerOfTwo;
>
>  enum { MAGIC_NUMBER = 0xfeeddadd };
>
>
>  const unsigned long _magic;
>
>  inline int isValid (void) const {
>    return (_magic == MAGIC_NUMBER);
>  }
>
>  sassert<sizeof(typename SuperblockType::Header) % sizeof(double) == 0>
>    verifyHeaderRightSize;
>
>
>
>  typedef HL::bins<typename SuperblockType::Header, SuperblockSize> binType;
>
>
>  enum { NumBins = binType::NUM_BINS };
>
>  __attribute__ ((noinline)) void slowPathFree (int binIndex, int u, int a) {
>
>
>    Check<HoardManager, sanityCheck> check (this);
>
>
>
>    SuperblockType * sb = _otherBins(binIndex).get ();
>
>
>    (static_cast<void> (0));
>    if (sb) {
>
>      const size_t sz = binType::getClassSize (binIndex);
>      Statistics& stats = _stats(binIndex);
>      int totalObjects = sb->getTotalObjects();
>      stats.setInUse (u - (totalObjects - sb->getObjectsFree()));
>      stats.setAllocated (a - totalObjects);
>
>
>
>
>      _ph.put (reinterpret_cast<typename ParentHeap::SuperblockType *>(sb), sz);
>      (static_cast<void> (0));
>
>    }
>  }
>
>
>  __attribute__ ((noinline)) void unlocked_put (SuperblockType * s, size_t sz) {
>    if (!s || !s->isValidSuperblock()) {
>      return;
>    }
>
>    Check<HoardManager, sanityCheck> check (this);
>
>    const int binIndex = binType::getSizeClass(sz);
>
>
>    s->setOwner (reinterpret_cast<HeapType *>(this));
>    _otherBins(binIndex).put (s);
>
>
>
>
>    addStatsSuperblock (s, binIndex);
>    (static_cast<void> (0));
>
>  }
>
>  void addStatsSuperblock (SuperblockType * s, int binIndex) {
>    Statistics& stats = _stats(binIndex);
>
>    int a = stats.getAllocated();
>    int u = stats.getInUse();
>    int totalObjects = s->getTotalObjects();
>    stats.setInUse (u + (totalObjects - s->getObjectsFree()));
>    stats.setAllocated (a + totalObjects);
>  }
>
>
>  void decStatsSuperblock (SuperblockType * s, int binIndex) {
>    Statistics& stats = _stats(binIndex);
>
>    int a = stats.getAllocated();
>    int u = stats.getInUse();
>    int totalObjects = s->getTotalObjects();
>    stats.setInUse (u - (totalObjects - s->getObjectsFree()));
>    stats.setAllocated (a - totalObjects);
>  }
>
>  __attribute__((malloc)) __attribute__ ((noinline)) void * slowPathMalloc (size_t sz) {
>    const int binIndex = binType::getSizeClass (sz);
>    size_t realSize = binType::getClassSize (binIndex);
>    (static_cast<void> (0));
>    for (;;) {
>      Check<HoardManager, sanityCheck> check (this);
>      void * ptr = getObject (binIndex, realSize);
>      if (ptr) {
> return ptr;
>      } else {
> Check<HoardManager, sanityCheck> check (this);
>
> if (!getAnotherSuperblock (realSize)) {
>
>   return 0;
> }
>      }
>    }
>  }
>
>
>  __attribute__((malloc)) inline void * getObject (int binIndex, size_t sz) {
>    Check<HoardManager, sanityCheck> check (this);
>    void * ptr = _otherBins(binIndex).malloc (sz);
>    if (ptr) {
>
>      int u = _stats(binIndex).getInUse();
>      _stats(binIndex).setInUse (u+1);
>    }
>    return ptr;
>  }
>
>  friend class sanityCheck;
>
>  class sanityCheck {
>  public:
>    inline static void precondition (HoardManager * h) {
>      checkInvariant(h);
>    }
>    inline static void postcondition (HoardManager * h) {
>      checkInvariant(h);
>    }
>  private:
>    inline static void checkInvariant (HoardManager * h) {
>      (static_cast<void> (0));
>    }
>  };
>
>public:
>
>  __attribute__ ((noinline)) void * getAnotherSuperblock (size_t sz) {
>
>
>
>    SuperblockType * sb = __null;
>
>
>
>    sb = reinterpret_cast<SuperblockType *>(_ph.get (sz, reinterpret_cast<ParentHeap *>(this)));
>
>    if (sb) {
>      if (!sb->isValidSuperblock()) {
>
> sb = __null;
>      }
>
>    } else {
>
>      void * ptr = _sourceHeap.malloc (SuperblockSize);
>      if (!ptr) {
> return 0;
>      }
>      sb = new (ptr) SuperblockType (sz);
>    }
>
>
>    if (sb) {
>      unlocked_put (sb, sz);
>    }
>    return sb;
>  }
>
>private:
>
>  LockType _theLock;
>
>
>  Array<NumBins, Statistics> _stats;
>
>  typedef SuperblockType * SuperblockTypePointer;
>
>  typedef EmptyClass<SuperblockType, EmptinessClasses> OrganizedByEmptiness;
>
>  typedef ManageOneSuperblock<OrganizedByEmptiness> BinManager;
>
>
>  Array<NumBins, BinManager> _otherBins;
>
>
>  ParentHeap _ph;
>
>
>  SourceHeap _sourceHeap;
>
>};
>
>}
># 42 "hoard.h" 2
># 1 "addheaderheap.h" 1
># 9 "addheaderheap.h"
>namespace Hoard {
>
>
>
>
>
>template <class SuperblockType,
>   size_t SuperblockSize,
>   class SuperHeap>
>class AddHeaderHeap {
>private:
>
>  HL::sassert<(((int) SuperHeap::Alignment) % SuperblockSize == 0)> verifySize1;
>  HL::sassert<(((int) SuperHeap::Alignment) >= SuperblockSize)> verifySize2;
>
>  SuperHeap theHeap;
>
>public:
>
>  enum { Alignment = 0 };
>
>  __attribute__((malloc)) inline void * malloc (size_t sz) {
>
>
>
>    const size_t headerSize = sizeof(typename SuperblockType::Header);
>    void * ptr = theHeap.malloc (sz + headerSize);
>    if (ptr == __null) {
>      fprintf (stderr, "AddHeaderHeap::malloc - no memory.\n");
>      return __null;
>    }
>    typename SuperblockType::Header * p
>      = new (ptr) typename SuperblockType::Header (sz, sz);
>    (static_cast<void> (0));
>    return reinterpret_cast<void *>(p + 1);
>  }
>
>  inline static size_t getSize (void * ptr) {
>
>
>    typename SuperblockType::Header * p;
>    p = reinterpret_cast<typename SuperblockType::Header *>(ptr);
>    return (p - 1)->getSize (ptr);
>  }
>
>  inline void free (void * ptr) {
>
>    typename SuperblockType::Header * p;
>    p = reinterpret_cast<typename SuperblockType::Header *>(ptr);
>    theHeap.free (reinterpret_cast<void *>(p - 1));
>  }
>};
>
>};
># 43 "hoard.h" 2
># 1 "threadpoolheap.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "threadpoolheap.h" 2
>
>
>
>
>extern volatile int anyThreadCreated;
>
>namespace Hoard {
>
>  template <int NumThreads,
>     int NumHeaps,
>     class PerThreadHeap_>
>  class ThreadPoolHeap : public PerThreadHeap_ {
>  public:
>
>    typedef PerThreadHeap_ PerThreadHeap;
>
>    enum { MaxThreads = NumThreads };
>    enum { NumThreadsMask = NumThreads - 1};
>    enum { NumHeapsMask = NumHeaps - 1};
>
>    HL::sassert<((NumHeaps & NumHeapsMask) == 0)> verifyPowerOfTwoHeaps;
>    HL::sassert<((NumThreads & NumThreadsMask) == 0)> verifyPowerOfTwoThreads;
>
>    enum { MaxHeaps = NumHeaps };
>
>    ThreadPoolHeap (void)
>    {
>
>      int j = 0;
>      for (int i = 0; i < NumThreads; i++) {
> setTidMap(i, j % NumHeaps);
> j++;
>      }
>    }
>
>    inline PerThreadHeap& getHeap (void) {
>      int tid;
>      if (anyThreadCreated) {
> tid = HL::CPUInfo::getThreadId();
>      } else {
> tid = 0;
>      }
>      int heapno = _tidMap(tid & NumThreadsMask);
>      return _heap(heapno);
>    }
>
>    inline void * malloc (size_t sz) {
>      return getHeap().malloc (sz);
>    }
>
>    inline void free (void * ptr) {
>      getHeap().free (ptr);
>    }
>
>    inline void clear (void) {
>      getHeap().clear();
>    }
>
>    inline size_t getSize (void * ptr) {
>      return PerThreadHeap::getSize (ptr);
>    }
>
>    void setTidMap (int index, int value) {
>      (static_cast<void> (0));
>      _tidMap(index) = value;
>    }
>
>    int getTidMap (int index) const {
>      return _tidMap(index);
>    }
>
>    void setInusemap (int index, int value) {
>      _inUseMap(index) = value;
>    }
>
>    int getInusemap (int index) const {
>      return _inUseMap(index);
>    }
>
>
>  private:
>
>
>    Array<MaxThreads, int> _tidMap;
>
>
>    Array<MaxHeaps, int> _inUseMap;
>
>
>    Array<MaxHeaps, PerThreadHeap> _heap;
>
>  };
>
>}
># 44 "hoard.h" 2
># 1 "redirectfree.h" 1
># 30 "redirectfree.h"
># 1 "heaplayers/util/fred.h" 1
># 27 "heaplayers/util/fred.h"
>namespace HL {
>
>class Fred {
>public:
>
>  Fred (void) {
>
>    pthread_attr_init (&attr);
>
>  }
>
>  ~Fred (void) {
>
>    pthread_attr_destroy (&attr);
>
>  }
>
>  void create (void * (*function) (void *), void * arg) {
>
>
>
>    pthread_create (&t, &attr, function, arg);
>
>  }
>
>  void join (void) {
>
>
>
>    pthread_join (t, __null);
>
>  }
>
>  static void yield (void) {
>
>
>
>
>
>    sched_yield();
>
>  }
>
>
>  static void setConcurrency (int n) {
>
>
>
>
>    pthread_setconcurrency (n);
>
>  }
>
>
>private:
>
>
>
>  typedef pthread_t FredType;
>  pthread_attr_t attr;
>
>
>  FredType t;
>};
>
>}
># 31 "redirectfree.h" 2
>
>
>namespace Hoard {
>
>
>
>
>
>
>
>template <class Heap,
>   typename SuperblockType_>
>class RedirectFree {
>public:
>
>  enum { Alignment = (int) Heap::Alignment };
>
>  typedef SuperblockType_ SuperblockType;
>
>  inline void * malloc (size_t sz) {
>    return _theHeap.malloc (sz);
>  }
>
>  size_t getSize (void * ptr) {
>    return Heap::getSize (ptr);
>  }
>
>  SuperblockType * getSuperblock (void * ptr) {
>    return Heap::getSuperblock (ptr);
>  }
>
>
>  static inline void free (void * ptr) {
>
>    SuperblockType * s = reinterpret_cast<SuperblockType *>(Heap::getSuperblock (ptr));
>
>    (static_cast<void> (0));
>
>
>
>    typedef BaseHoardManager<SuperblockType> * baseHeapType;
>    baseHeapType owner;
>
>    s->lock();
>
>
>
>
>
>
>
>    for (;;) {
>      owner = reinterpret_cast<baseHeapType>(s->getOwner());
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>
>
>      owner->lock();
>      if (owner == reinterpret_cast<baseHeapType>(s->getOwner())) {
> owner->free (ptr);
> owner->unlock();
> s->unlock();
> return;
>      }
>      owner->unlock();
>
>
>      HL::Fred::yield();
>    }
>  }
>
>private:
>
>  Heap _theHeap;
>
>};
>
>}
># 45 "hoard.h" 2
># 1 "ignoreinvalidfree.h" 1
>
>
>
>
>
>
>
>namespace Hoard {
>
>
>
>
>
>
>
>template <class S>
>class IgnoreInvalidFree : public S {
>public:
>  inline void free (void * ptr) {
>    typename S::SuperblockType * s = S::getSuperblock (ptr);
>    if (!s || (!s->isValidSuperblock())) {
>
>      return;
>    }
>    S::free (ptr);
>  }
>
>  inline size_t getSize (void * ptr) {
>    typename S::SuperblockType * s = S::getSuperblock (ptr);
>    if (!s || (!s->isValidSuperblock())) {
>      return 0;
>    }
>    return S::getSize (ptr);
>  }
>
>private:
>
>
>  enum { ALREADY_FREED_VALUE = 0xDeadBeef };
>
>};
>
>};
># 46 "hoard.h" 2
># 1 "conformantheap.h" 1
>
>
>
>namespace Hoard {
>
>
>
>template <class Parent>
>class ConformantHeap : public Parent {
>public:
>  typedef Parent SuperHeap;
>};
>
>}
># 47 "hoard.h" 2
># 1 "hoardsuperblock.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "hoardsuperblock.h" 2
>
>
>
># 1 "heaplayers/freesllist.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "heaplayers/freesllist.h" 2
># 17 "heaplayers/freesllist.h"
>class FreeSLList {
>public:
>
>  inline void clear (void) {
>    head.next = __null;
>  }
>
>  class Entry;
>
>
>  inline Entry * get (void) {
>    const Entry * e = head.next;
>    if (e == __null) {
>      return __null;
>    }
>    head.next = e->next;
>    return const_cast<Entry *>(e);
>  }
>
>  inline Entry * remove (void) {
>    const Entry * e = head.next;
>    if (e == __null) {
>      return __null;
>    }
>    head.next = e->next;
>    return const_cast<Entry *>(e);
>  }
>
>  inline void insert (void * e) {
>    Entry * entry = reinterpret_cast<Entry *>(e);
>    entry->next = head.next;
>    head.next = entry;
>  }
>
>  class Entry {
>  public:
>    Entry (void)
>      : next (__null)
>    {}
>    Entry * next;
>
>  private:
>    Entry (const Entry&);
>    Entry& operator=(const Entry&);
>
>  };
>
>private:
>  Entry head;
>};
># 11 "hoardsuperblock.h" 2
># 1 "hoardsuperblockheader.h" 1
>
>
>
>
>
>
>
>namespace Hoard {
>
>template <class LockType,
>   int SuperblockSize,
>   typename HeapType>
>class HoardSuperblock;
>
>template <class LockType,
>   int SuperblockSize,
>   typename HeapType>
>class HoardSuperblockHeader {
>public:
>
>  HoardSuperblockHeader (size_t sz, size_t bufferSize)
>    : magicNumber (MAGIC_NUMBER),
>      objectSize (sz),
>      totalObjects (bufferSize / sz),
>      reapableObjects (bufferSize / sz),
>      owner (__null),
>      prev (__null),
>      next (__null),
>      objectsFree (bufferSize / sz),
>      start ((char *) (this + 1)),
>      position (start)
>  {
>  }
>
>  inline void * malloc (void) {
>    (static_cast<void> (0));
>    void * ptr = reapAlloc();
>    if (!ptr) {
>      ptr = freeListAlloc();
>    }
>    (static_cast<void> (0));
>    return ptr;
>  }
>
>  inline void free (void * ptr) {
>    (static_cast<void> (0));
>
>    void * normalizedPtr = normalize (ptr);
>    freeList.insert (reinterpret_cast<FreeSLList::Entry *>(normalizedPtr));
>    objectsFree++;
>    if (objectsFree == totalObjects) {
>      clear();
>    }
>  }
>
>  void clear (void) {
>    (static_cast<void> (0));
>
>    freeList.clear();
>
>    objectsFree = totalObjects;
>    reapableObjects = totalObjects;
>    position = start;
>  }
>
>  inline void * normalize (void * ptr) const {
>    (static_cast<void> (0));
>    size_t offset = (size_t) ptr - (size_t) start;
>    void * p;
>    p = (void *) ((size_t) ptr - (offset % objectSize));
>    return p;
>  }
>
>  size_t getSize (void * ptr) const {
>    (static_cast<void> (0));
>    size_t offset = (size_t) ptr - (size_t) start;
>    size_t newSize;
>    newSize = objectSize - (offset % objectSize);
>    return newSize;
>  }
>
>  size_t getObjectSize (void) const {
>    return objectSize;
>  }
>
>  int getTotalObjects (void) const {
>    return totalObjects;
>  }
>
>  int getObjectsFree (void) const {
>    return objectsFree;
>  }
>
>  HeapType * getOwner (void) const {
>    return owner;
>  }
>
>  void setOwner (HeapType * o) {
>    owner = o;
>  }
>
>  bool isValid (void) const {
>    return (magicNumber == MAGIC_NUMBER);
>  }
>
>  HoardSuperblock<LockType, SuperblockSize, HeapType> * getNext (void) const {
>    return next;
>  }
>
>  HoardSuperblock<LockType, SuperblockSize, HeapType> * getPrev (void) const {
>    return prev;
>  }
>
>  void setNext (HoardSuperblock<LockType, SuperblockSize, HeapType> * n) {
>    next = n;
>  }
>
>  void setPrev (HoardSuperblock<LockType, SuperblockSize, HeapType> * p) {
>    prev = p;
>  }
>
>  void lock (void) {
>    theLock.lock();
>  }
>
>  void unlock (void) {
>    theLock.unlock();
>  }
>
>private:
>
>  __attribute__((malloc)) inline void * reapAlloc (void) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>
>    if (reapableObjects > 0) {
>      char * ptr = position;
>      position = ptr + objectSize;
>      reapableObjects--;
>      objectsFree--;
>      return ptr;
>    } else {
>      return __null;
>    }
>  }
>
>  __attribute__((malloc)) inline void * freeListAlloc (void) {
>    (static_cast<void> (0));
>
>    char * ptr = reinterpret_cast<char *>(freeList.get());
>    if (ptr) {
>      (static_cast<void> (0));
>      objectsFree--;
>    }
>    return ptr;
>  }
>
>  enum { MAGIC_NUMBER = 0xcafed00d };
>
>  const size_t magicNumber;
>
>
>  const size_t objectSize;
>
>
>  const int totalObjects;
>
>
>  LockType theLock;
>
>
>  HeapType * owner;
>
>
>  HoardSuperblock<LockType, SuperblockSize, HeapType> * prev;
>
>
>  HoardSuperblock<LockType, SuperblockSize, HeapType> * next;
>
>
>  int reapableObjects;
>
>
>  int objectsFree;
>
>
>  char * start;
>
>
>  FreeSLList freeList;
>
>  union {
>
>    char * position;
>    double dummy;
>  };
>
>};
>
>};
># 12 "hoardsuperblock.h" 2
>
>namespace Hoard {
>
>  template <class LockType,
>     int SuperblockSize,
>     typename HeapType>
>  class HoardSuperblock {
>  public:
>
>    HoardSuperblock (size_t sz)
>      : _header (sz, BufferSize)
>    {
>      (static_cast<void> (0));
>    }
>
>
>
>    static inline HoardSuperblock * getSuperblock (void * ptr) {
>      return (HoardSuperblock *)
> (((size_t) ptr) & -((size_t) SuperblockSize-1));
>    }
>
>    inline size_t getSize (void * ptr) const {
>      (static_cast<void> (0));
>      if (inRange (ptr)) {
> return _header.getSize (ptr);
>      } else {
> return 0;
>      }
>    }
>
>    __attribute__((malloc)) inline void * malloc (size_t sz) {
>      (static_cast<void> (0));
>      void * ptr = _header.malloc();
>      if (ptr) {
> (static_cast<void> (0));
>      }
>      return ptr;
>    }
>
>    inline void free (void * ptr) {
>      (static_cast<void> (0));
>      if (inRange (ptr)) {
>
> _header.free (ptr);
>      } else {
>
>      }
>    }
>
>    void clear (void) {
>      _header.clear();
>    }
>
>
>
>    inline bool isValidSuperblock (void) const {
>      (static_cast<void> (0));
>      bool b = _header.isValid();
>      return b;
>    }
>
>    inline int getTotalObjects (void) const {
>      (static_cast<void> (0));
>      return _header.getTotalObjects();
>    }
>
>
>    inline int getObjectsFree (void) const {
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      return _header.getObjectsFree();
>    }
>
>    inline void lock (void) {
>      (static_cast<void> (0));
>      _header.lock();
>    }
>
>    inline void unlock (void) {
>      (static_cast<void> (0));
>      _header.unlock();
>    }
>
>    inline HeapType * getOwner (void) const {
>      (static_cast<void> (0));
>      return _header.getOwner();
>    }
>
>    inline void setOwner (HeapType * o) {
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      _header.setOwner (o);
>    }
>
>    inline HoardSuperblock * getNext (void) const {
>      (static_cast<void> (0));
>      return _header.getNext();
>    }
>
>    inline HoardSuperblock * getPrev (void) const {
>      (static_cast<void> (0));
>      return _header.getPrev();
>    }
>
>    inline void setNext (HoardSuperblock * f) {
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      _header.setNext (f);
>    }
>
>    inline void setPrev (HoardSuperblock * f) {
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      _header.setPrev (f);
>    }
>
>    inline bool inRange (void * ptr) const {
>
>      const size_t ptrValue = (size_t) ptr;
>      return ((ptrValue >= (size_t) _buf) &&
>       (ptrValue <= (size_t) &_buf[BufferSize]));
>    }
>
>    inline void * normalize (void * ptr) const {
>      void * ptr2 = _header.normalize (ptr);
>      (static_cast<void> (0));
>      (static_cast<void> (0));
>      return ptr2;
>    }
>
>    typedef Hoard::HoardSuperblockHeader<LockType, SuperblockSize, HeapType> Header;
>
>  private:
>
>
>
>
>    HoardSuperblock (const HoardSuperblock&);
>    HoardSuperblock& operator=(const HoardSuperblock&);
>
>    enum { BufferSize = SuperblockSize - sizeof(Header) };
>
>
>    Header _header;
>
>
>    char _buf[BufferSize];
>
>  };
>
>};
># 48 "hoard.h" 2
># 1 "lockmallocheap.h" 1
># 11 "lockmallocheap.h"
>namespace Hoard {
>
>template <typename Heap>
>class LockMallocHeap : public Heap {
>public:
>  __attribute__((malloc)) inline void * malloc (size_t sz) {
>    HL::Guard<Heap> l (*this);
>    return Heap::malloc (sz);
>  }
>};
>
>}
># 49 "hoard.h" 2
># 1 "alignedsuperblockheap.h" 1
>
>
>
>
>
># 1 "heaplayers/mmapheap.h" 1
># 38 "heaplayers/mmapheap.h"
># 1 "/usr/include/sys/mman.h" 1 3 4
># 26 "/usr/include/sys/mman.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 27 "/usr/include/sys/mman.h" 2 3 4
># 42 "/usr/include/sys/mman.h" 3 4
># 1 "/usr/include/bits/mman.h" 1 3 4
># 43 "/usr/include/sys/mman.h" 2 3 4
>
>
>
>
>extern "C" {
># 58 "/usr/include/sys/mman.h" 3 4
>extern void *mmap (void *__addr, size_t __len, int __prot,
>     int __flags, int __fd, __off_t __offset) throw ();
># 71 "/usr/include/sys/mman.h" 3 4
>extern void *mmap64 (void *__addr, size_t __len, int __prot,
>       int __flags, int __fd, __off64_t __offset) throw ();
>
>
>
>
>extern int munmap (void *__addr, size_t __len) throw ();
>
>
>
>
>extern int mprotect (void *__addr, size_t __len, int __prot) throw ();
>
>
>
>
>
>
>
>extern int msync (void *__addr, size_t __len, int __flags);
>
>
>
>
>extern int madvise (void *__addr, size_t __len, int __advice) throw ();
>
>
>
>extern int posix_madvise (void *__addr, size_t __len, int __advice) throw ();
>
>
>
>
>extern int mlock (__const void *__addr, size_t __len) throw ();
>
>
>extern int munlock (__const void *__addr, size_t __len) throw ();
>
>
>
>
>extern int mlockall (int __flags) throw ();
>
>
>
>extern int munlockall (void) throw ();
>
>
>
>
>
>
>
>extern void *mremap (void *__addr, size_t __old_len, size_t __new_len,
>       int __flags, ...) throw ();
>
>
>
>
>
>
>extern int mincore (void *__start, size_t __len, unsigned char *__vec)
>     throw ();
>
>
>
>extern int remap_file_pages (void *__start, size_t __size, int __prot,
>        size_t __pgoff, int __flags) throw ();
>
>
>
>
>extern int shm_open (__const char *__name, int __oflag, mode_t __mode);
>
>
>extern int shm_unlink (__const char *__name);
>
>}
># 39 "heaplayers/mmapheap.h" 2
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 1 3
># 63 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 3
>       
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++config.h" 1 3
># 35 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++config.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/os_defines.h" 1 3
># 36 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++config.h" 2 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++config.h" 3
>namespace __gnu_debug_def { }
>
>namespace __gnu_debug
>{
>  using namespace __gnu_debug_def;
>}
># 65 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstring" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstring" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstring" 3
># 77 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstring" 3
>namespace std
>{
>  using ::memcpy;
>  using ::memmove;
>  using ::strcpy;
>  using ::strncpy;
>  using ::strcat;
>  using ::strncat;
>  using ::memcmp;
>  using ::strcmp;
>  using ::strcoll;
>  using ::strncmp;
>  using ::strxfrm;
>  using ::strcspn;
>  using ::strspn;
>  using ::strtok;
>  using ::memset;
>  using ::strerror;
>  using ::strlen;
>
>  using ::memchr;
>
>  inline void*
>  memchr(void* __p, int __c, size_t __n)
>  { return memchr(const_cast<const void*>(__p), __c, __n); }
>
>  using ::strchr;
>
>  inline char*
>  strchr(char* __s1, int __n)
>  { return __builtin_strchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strpbrk;
>
>  inline char*
>  strpbrk(char* __s1, const char* __s2)
>  { return __builtin_strpbrk(const_cast<const char*>(__s1), __s2); }
>
>  using ::strrchr;
>
>  inline char*
>  strrchr(char* __s1, int __n)
>  { return __builtin_strrchr(const_cast<const char*>(__s1), __n); }
>
>  using ::strstr;
>
>  inline char*
>  strstr(char* __s1, const char* __s2)
>  { return __builtin_strstr(const_cast<const char*>(__s1), __s2); }
>}
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/climits" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/climits" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/climits" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 1 3 4
># 11 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/syslimits.h" 1 3 4
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 1 3 4
># 122 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 3 4
># 1 "/usr/include/limits.h" 1 3 4
># 144 "/usr/include/limits.h" 3 4
># 1 "/usr/include/bits/posix1_lim.h" 1 3 4
># 153 "/usr/include/bits/posix1_lim.h" 3 4
># 1 "/usr/include/bits/local_lim.h" 1 3 4
># 36 "/usr/include/bits/local_lim.h" 3 4
># 1 "/usr/include/linux/limits.h" 1 3 4
># 37 "/usr/include/bits/local_lim.h" 2 3 4
># 154 "/usr/include/bits/posix1_lim.h" 2 3 4
># 145 "/usr/include/limits.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/posix2_lim.h" 1 3 4
># 149 "/usr/include/limits.h" 2 3 4
>
>
>
># 1 "/usr/include/bits/xopen_lim.h" 1 3 4
># 34 "/usr/include/bits/xopen_lim.h" 3 4
># 1 "/usr/include/bits/stdio_lim.h" 1 3 4
># 35 "/usr/include/bits/xopen_lim.h" 2 3 4
># 153 "/usr/include/limits.h" 2 3 4
># 123 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 2 3 4
># 8 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/syslimits.h" 2 3 4
># 12 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 2 3 4
># 50 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/climits" 2 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
># 90 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
>namespace std
>{
>
>  using ::div_t;
>  using ::ldiv_t;
>
>  using ::abort;
>  using ::abs;
>  using ::atexit;
>  using ::atof;
>  using ::atoi;
>  using ::atol;
>  using ::bsearch;
>  using ::calloc;
>  using ::div;
>  using ::exit;
>  using ::free;
>  using ::getenv;
>  using ::labs;
>  using ::ldiv;
>  using ::malloc;
>
>  using ::mblen;
>  using ::mbstowcs;
>  using ::mbtowc;
>
>  using ::qsort;
>  using ::rand;
>  using ::realloc;
>  using ::srand;
>  using ::strtod;
>  using ::strtol;
>  using ::strtoul;
>  using ::system;
>
>  using ::wcstombs;
>  using ::wctomb;
>
>
>  inline long
>  abs(long __i) { return labs(__i); }
>
>  inline ldiv_t
>  div(long __i, long __j) { return ldiv(__i, __j); }
># 143 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
>}
># 156 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
>namespace __gnu_cxx
>{
>
>  using ::lldiv_t;
>
>
>
>
>
>  using ::_Exit;
>
>
>  inline long long
>  abs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>  inline long long
>  llabs(long long __x) { return __x >= 0 ? __x : -__x; }
>
>
>  inline lldiv_t
>  div(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
>
>  inline lldiv_t
>  lldiv(long long __n, long long __d)
>  { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; }
># 192 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdlib" 3
>  using ::atoll;
>  using ::strtoll;
>  using ::strtoull;
>
>  using ::strtof;
>  using ::strtold;
>}
>
>namespace std
>{
>
>  using __gnu_cxx::lldiv_t;
>
>  using __gnu_cxx::_Exit;
>  using __gnu_cxx::abs;
>  using __gnu_cxx::llabs;
>
>  using __gnu_cxx::div;
>  using __gnu_cxx::lldiv;
>
>  using __gnu_cxx::atoll;
>  using __gnu_cxx::strtof;
>  using __gnu_cxx::strtoll;
>  using __gnu_cxx::strtoull;
>  using __gnu_cxx::strtold;
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 1 3
># 39 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 3
>       
># 40 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 3
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 3
># 97 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 3
>namespace std
>{
>  using ::FILE;
>  using ::fpos_t;
>
>  using ::clearerr;
>  using ::fclose;
>  using ::feof;
>  using ::ferror;
>  using ::fflush;
>  using ::fgetc;
>  using ::fgetpos;
>  using ::fgets;
>  using ::fopen;
>  using ::fprintf;
>  using ::fputc;
>  using ::fputs;
>  using ::fread;
>  using ::freopen;
>  using ::fscanf;
>  using ::fseek;
>  using ::fsetpos;
>  using ::ftell;
>  using ::fwrite;
>  using ::getc;
>  using ::getchar;
>  using ::gets;
>  using ::perror;
>  using ::printf;
>  using ::putc;
>  using ::putchar;
>  using ::puts;
>  using ::remove;
>  using ::rename;
>  using ::rewind;
>  using ::scanf;
>  using ::setbuf;
>  using ::setvbuf;
>  using ::sprintf;
>  using ::sscanf;
>  using ::tmpfile;
>  using ::tmpnam;
>  using ::ungetc;
>  using ::vfprintf;
>  using ::vprintf;
>  using ::vsprintf;
>}
># 153 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 3
>namespace __gnu_cxx
>{
># 167 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cstdio" 3
>  using ::snprintf;
>  using ::vfscanf;
>  using ::vscanf;
>  using ::vsnprintf;
>  using ::vsscanf;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::snprintf;
>  using __gnu_cxx::vfscanf;
>  using __gnu_cxx::vscanf;
>  using __gnu_cxx::vsnprintf;
>  using __gnu_cxx::vsscanf;
>}
># 43 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/clocale" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/clocale" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/clocale" 3
>
># 1 "/usr/include/locale.h" 1 3 4
># 29 "/usr/include/locale.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 30 "/usr/include/locale.h" 2 3 4
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/bits/locale.h" 3 4
>enum
>{
>  __LC_CTYPE = 0,
>  __LC_NUMERIC = 1,
>  __LC_TIME = 2,
>  __LC_COLLATE = 3,
>  __LC_MONETARY = 4,
>  __LC_MESSAGES = 5,
>  __LC_ALL = 6,
>  __LC_PAPER = 7,
>  __LC_NAME = 8,
>  __LC_ADDRESS = 9,
>  __LC_TELEPHONE = 10,
>  __LC_MEASUREMENT = 11,
>  __LC_IDENTIFICATION = 12
>};
># 31 "/usr/include/locale.h" 2 3 4
>
>extern "C" {
># 52 "/usr/include/locale.h" 3 4
>struct lconv
>{
>
>
>  char *decimal_point;
>  char *thousands_sep;
>
>
>
>
>
>  char *grouping;
>
>
>
>
>
>  char *int_curr_symbol;
>  char *currency_symbol;
>  char *mon_decimal_point;
>  char *mon_thousands_sep;
>  char *mon_grouping;
>  char *positive_sign;
>  char *negative_sign;
>  char int_frac_digits;
>  char frac_digits;
>
>  char p_cs_precedes;
>
>  char p_sep_by_space;
>
>  char n_cs_precedes;
>
>  char n_sep_by_space;
>
>
>
>
>
>
>  char p_sign_posn;
>  char n_sign_posn;
>
>
>  char int_p_cs_precedes;
>
>  char int_p_sep_by_space;
>
>  char int_n_cs_precedes;
>
>  char int_n_sep_by_space;
>
>
>
>
>
>
>  char int_p_sign_posn;
>  char int_n_sign_posn;
># 119 "/usr/include/locale.h" 3 4
>};
>
>
>
>
>
>extern char *setlocale (int __category, __const char *__locale) throw ();
>
>
>extern struct lconv *localeconv (void) throw ();
>
>
># 148 "/usr/include/locale.h" 3 4
>typedef __locale_t locale_t;
>
>
>
>
>
>extern __locale_t newlocale (int __category_mask, __const char *__locale,
>        __locale_t __base) throw ();
># 189 "/usr/include/locale.h" 3 4
>extern __locale_t duplocale (__locale_t __dataset) throw ();
>
>
>
>extern void freelocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>extern __locale_t uselocale (__locale_t __dataset) throw ();
>
>
>
>
>
>
>
>}
># 50 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/clocale" 2 3
>
>
>
>
>
>namespace std
>{
>  using ::lconv;
>  using ::setlocale;
>  using ::localeconv;
>}
># 44 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/langinfo.h" 1 3 4
># 24 "/usr/include/langinfo.h" 3 4
># 1 "/usr/include/nl_types.h" 1 3 4
># 31 "/usr/include/nl_types.h" 3 4
>extern "C" {
>
>
>typedef void *nl_catd;
>
>
>typedef int nl_item;
>
>
>
>
>
>extern nl_catd catopen (__const char *__cat_name, int __flag) __attribute__ ((__nonnull__ (1)));
>
>
>
>extern char *catgets (nl_catd __catalog, int __set, int __number,
>        __const char *__string) throw () __attribute__ ((__nonnull__ (1)));
>
>
>extern int catclose (nl_catd __catalog) throw () __attribute__ ((__nonnull__ (1)));
>
>}
># 25 "/usr/include/langinfo.h" 2 3 4
>
># 1 "/usr/include/bits/locale.h" 1 3 4
># 27 "/usr/include/langinfo.h" 2 3 4
>
>
>extern "C" {
># 42 "/usr/include/langinfo.h" 3 4
>enum
>{
>
>
>
>  ABDAY_1 = (((__LC_TIME) << 16) | (0)),
>
>  ABDAY_2,
>
>  ABDAY_3,
>
>  ABDAY_4,
>
>  ABDAY_5,
>
>  ABDAY_6,
>
>  ABDAY_7,
>
>
>
>  DAY_1,
>
>  DAY_2,
>
>  DAY_3,
>
>  DAY_4,
>
>  DAY_5,
>
>  DAY_6,
>
>  DAY_7,
>
>
>
>  ABMON_1,
>
>  ABMON_2,
>
>  ABMON_3,
>
>  ABMON_4,
>
>  ABMON_5,
>
>  ABMON_6,
>
>  ABMON_7,
>
>  ABMON_8,
>
>  ABMON_9,
>
>  ABMON_10,
>
>  ABMON_11,
>
>  ABMON_12,
>
>
>
>  MON_1,
>
>  MON_2,
>
>  MON_3,
>
>  MON_4,
>
>  MON_5,
>
>  MON_6,
>
>  MON_7,
>
>  MON_8,
>
>  MON_9,
>
>  MON_10,
>
>  MON_11,
>
>  MON_12,
>
>
>  AM_STR,
>
>  PM_STR,
>
>
>  D_T_FMT,
>
>  D_FMT,
>
>  T_FMT,
>
>  T_FMT_AMPM,
>
>
>  ERA,
>
>  __ERA_YEAR,
>
>
>
>  ERA_D_FMT,
>
>  ALT_DIGITS,
>
>  ERA_D_T_FMT,
>
>  ERA_T_FMT,
>
>
>  _NL_TIME_ERA_NUM_ENTRIES,
>  _NL_TIME_ERA_ENTRIES,
>
>  _NL_WABDAY_1,
>  _NL_WABDAY_2,
>  _NL_WABDAY_3,
>  _NL_WABDAY_4,
>  _NL_WABDAY_5,
>  _NL_WABDAY_6,
>  _NL_WABDAY_7,
>
>
>  _NL_WDAY_1,
>  _NL_WDAY_2,
>  _NL_WDAY_3,
>  _NL_WDAY_4,
>  _NL_WDAY_5,
>  _NL_WDAY_6,
>  _NL_WDAY_7,
>
>
>  _NL_WABMON_1,
>  _NL_WABMON_2,
>  _NL_WABMON_3,
>  _NL_WABMON_4,
>  _NL_WABMON_5,
>  _NL_WABMON_6,
>  _NL_WABMON_7,
>  _NL_WABMON_8,
>  _NL_WABMON_9,
>  _NL_WABMON_10,
>  _NL_WABMON_11,
>  _NL_WABMON_12,
>
>
>  _NL_WMON_1,
>  _NL_WMON_2,
>  _NL_WMON_3,
>  _NL_WMON_4,
>  _NL_WMON_5,
>  _NL_WMON_6,
>  _NL_WMON_7,
>  _NL_WMON_8,
>  _NL_WMON_9,
>  _NL_WMON_10,
>  _NL_WMON_11,
>  _NL_WMON_12,
>
>  _NL_WAM_STR,
>  _NL_WPM_STR,
>
>  _NL_WD_T_FMT,
>  _NL_WD_FMT,
>  _NL_WT_FMT,
>  _NL_WT_FMT_AMPM,
>
>  _NL_WERA_YEAR,
>  _NL_WERA_D_FMT,
>  _NL_WALT_DIGITS,
>  _NL_WERA_D_T_FMT,
>  _NL_WERA_T_FMT,
>
>  _NL_TIME_WEEK_NDAYS,
>  _NL_TIME_WEEK_1STDAY,
>  _NL_TIME_WEEK_1STWEEK,
>  _NL_TIME_FIRST_WEEKDAY,
>  _NL_TIME_FIRST_WORKDAY,
>  _NL_TIME_CAL_DIRECTION,
>  _NL_TIME_TIMEZONE,
>
>  _DATE_FMT,
>
>  _NL_W_DATE_FMT,
>
>  _NL_TIME_CODESET,
>
>  _NL_NUM_LC_TIME,
>
>
>
>
>  _NL_COLLATE_NRULES = (((__LC_COLLATE) << 16) | (0)),
>  _NL_COLLATE_RULESETS,
>  _NL_COLLATE_TABLEMB,
>  _NL_COLLATE_WEIGHTMB,
>  _NL_COLLATE_EXTRAMB,
>  _NL_COLLATE_INDIRECTMB,
>  _NL_COLLATE_GAP1,
>  _NL_COLLATE_GAP2,
>  _NL_COLLATE_GAP3,
>  _NL_COLLATE_TABLEWC,
>  _NL_COLLATE_WEIGHTWC,
>  _NL_COLLATE_EXTRAWC,
>  _NL_COLLATE_INDIRECTWC,
>  _NL_COLLATE_SYMB_HASH_SIZEMB,
>  _NL_COLLATE_SYMB_TABLEMB,
>  _NL_COLLATE_SYMB_EXTRAMB,
>  _NL_COLLATE_COLLSEQMB,
>  _NL_COLLATE_COLLSEQWC,
>  _NL_COLLATE_CODESET,
>  _NL_NUM_LC_COLLATE,
>
>
>
>
>  _NL_CTYPE_CLASS = (((__LC_CTYPE) << 16) | (0)),
>  _NL_CTYPE_TOUPPER,
>  _NL_CTYPE_GAP1,
>  _NL_CTYPE_TOLOWER,
>  _NL_CTYPE_GAP2,
>  _NL_CTYPE_CLASS32,
>  _NL_CTYPE_GAP3,
>  _NL_CTYPE_GAP4,
>  _NL_CTYPE_GAP5,
>  _NL_CTYPE_GAP6,
>  _NL_CTYPE_CLASS_NAMES,
>  _NL_CTYPE_MAP_NAMES,
>  _NL_CTYPE_WIDTH,
>  _NL_CTYPE_MB_CUR_MAX,
>  _NL_CTYPE_CODESET_NAME,
>  CODESET = _NL_CTYPE_CODESET_NAME,
>
>  _NL_CTYPE_TOUPPER32,
>  _NL_CTYPE_TOLOWER32,
>  _NL_CTYPE_CLASS_OFFSET,
>  _NL_CTYPE_MAP_OFFSET,
>  _NL_CTYPE_INDIGITS_MB_LEN,
>  _NL_CTYPE_INDIGITS0_MB,
>  _NL_CTYPE_INDIGITS1_MB,
>  _NL_CTYPE_INDIGITS2_MB,
>  _NL_CTYPE_INDIGITS3_MB,
>  _NL_CTYPE_INDIGITS4_MB,
>  _NL_CTYPE_INDIGITS5_MB,
>  _NL_CTYPE_INDIGITS6_MB,
>  _NL_CTYPE_INDIGITS7_MB,
>  _NL_CTYPE_INDIGITS8_MB,
>  _NL_CTYPE_INDIGITS9_MB,
>  _NL_CTYPE_INDIGITS_WC_LEN,
>  _NL_CTYPE_INDIGITS0_WC,
>  _NL_CTYPE_INDIGITS1_WC,
>  _NL_CTYPE_INDIGITS2_WC,
>  _NL_CTYPE_INDIGITS3_WC,
>  _NL_CTYPE_INDIGITS4_WC,
>  _NL_CTYPE_INDIGITS5_WC,
>  _NL_CTYPE_INDIGITS6_WC,
>  _NL_CTYPE_INDIGITS7_WC,
>  _NL_CTYPE_INDIGITS8_WC,
>  _NL_CTYPE_INDIGITS9_WC,
>  _NL_CTYPE_OUTDIGIT0_MB,
>  _NL_CTYPE_OUTDIGIT1_MB,
>  _NL_CTYPE_OUTDIGIT2_MB,
>  _NL_CTYPE_OUTDIGIT3_MB,
>  _NL_CTYPE_OUTDIGIT4_MB,
>  _NL_CTYPE_OUTDIGIT5_MB,
>  _NL_CTYPE_OUTDIGIT6_MB,
>  _NL_CTYPE_OUTDIGIT7_MB,
>  _NL_CTYPE_OUTDIGIT8_MB,
>  _NL_CTYPE_OUTDIGIT9_MB,
>  _NL_CTYPE_OUTDIGIT0_WC,
>  _NL_CTYPE_OUTDIGIT1_WC,
>  _NL_CTYPE_OUTDIGIT2_WC,
>  _NL_CTYPE_OUTDIGIT3_WC,
>  _NL_CTYPE_OUTDIGIT4_WC,
>  _NL_CTYPE_OUTDIGIT5_WC,
>  _NL_CTYPE_OUTDIGIT6_WC,
>  _NL_CTYPE_OUTDIGIT7_WC,
>  _NL_CTYPE_OUTDIGIT8_WC,
>  _NL_CTYPE_OUTDIGIT9_WC,
>  _NL_CTYPE_TRANSLIT_TAB_SIZE,
>  _NL_CTYPE_TRANSLIT_FROM_IDX,
>  _NL_CTYPE_TRANSLIT_FROM_TBL,
>  _NL_CTYPE_TRANSLIT_TO_IDX,
>  _NL_CTYPE_TRANSLIT_TO_TBL,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING_LEN,
>  _NL_CTYPE_TRANSLIT_DEFAULT_MISSING,
>  _NL_CTYPE_TRANSLIT_IGNORE_LEN,
>  _NL_CTYPE_TRANSLIT_IGNORE,
>  _NL_CTYPE_MAP_TO_NONASCII,
>  _NL_CTYPE_EXTRA_MAP_1,
>  _NL_CTYPE_EXTRA_MAP_2,
>  _NL_CTYPE_EXTRA_MAP_3,
>  _NL_CTYPE_EXTRA_MAP_4,
>  _NL_CTYPE_EXTRA_MAP_5,
>  _NL_CTYPE_EXTRA_MAP_6,
>  _NL_CTYPE_EXTRA_MAP_7,
>  _NL_CTYPE_EXTRA_MAP_8,
>  _NL_CTYPE_EXTRA_MAP_9,
>  _NL_CTYPE_EXTRA_MAP_10,
>  _NL_CTYPE_EXTRA_MAP_11,
>  _NL_CTYPE_EXTRA_MAP_12,
>  _NL_CTYPE_EXTRA_MAP_13,
>  _NL_CTYPE_EXTRA_MAP_14,
>  _NL_NUM_LC_CTYPE,
>
>
>
>
>  __INT_CURR_SYMBOL = (((__LC_MONETARY) << 16) | (0)),
>
>
>
>  __CURRENCY_SYMBOL,
>
>
>
>  __MON_DECIMAL_POINT,
>
>
>
>  __MON_THOUSANDS_SEP,
>
>
>
>  __MON_GROUPING,
>
>
>
>  __POSITIVE_SIGN,
>
>
>
>  __NEGATIVE_SIGN,
>
>
>
>  __INT_FRAC_DIGITS,
>
>
>
>  __FRAC_DIGITS,
>
>
>
>  __P_CS_PRECEDES,
>
>
>
>  __P_SEP_BY_SPACE,
>
>
>
>  __N_CS_PRECEDES,
>
>
>
>  __N_SEP_BY_SPACE,
>
>
>
>  __P_SIGN_POSN,
>
>
>
>  __N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_CRNCYSTR,
>
>  __INT_P_CS_PRECEDES,
>
>
>
>  __INT_P_SEP_BY_SPACE,
>
>
>
>  __INT_N_CS_PRECEDES,
>
>
>
>  __INT_N_SEP_BY_SPACE,
>
>
>
>  __INT_P_SIGN_POSN,
>
>
>
>  __INT_N_SIGN_POSN,
>
>
>
>  _NL_MONETARY_DUO_INT_CURR_SYMBOL,
>  _NL_MONETARY_DUO_CURRENCY_SYMBOL,
>  _NL_MONETARY_DUO_INT_FRAC_DIGITS,
>  _NL_MONETARY_DUO_FRAC_DIGITS,
>  _NL_MONETARY_DUO_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_P_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_P_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_INT_N_CS_PRECEDES,
>  _NL_MONETARY_DUO_INT_N_SEP_BY_SPACE,
>  _NL_MONETARY_DUO_P_SIGN_POSN,
>  _NL_MONETARY_DUO_N_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_P_SIGN_POSN,
>  _NL_MONETARY_DUO_INT_N_SIGN_POSN,
>  _NL_MONETARY_UNO_VALID_FROM,
>  _NL_MONETARY_UNO_VALID_TO,
>  _NL_MONETARY_DUO_VALID_FROM,
>  _NL_MONETARY_DUO_VALID_TO,
>  _NL_MONETARY_CONVERSION_RATE,
>  _NL_MONETARY_DECIMAL_POINT_WC,
>  _NL_MONETARY_THOUSANDS_SEP_WC,
>  _NL_MONETARY_CODESET,
>  _NL_NUM_LC_MONETARY,
>
>
>
>  __DECIMAL_POINT = (((__LC_NUMERIC) << 16) | (0)),
>
>
>
>  RADIXCHAR = __DECIMAL_POINT,
>
>  __THOUSANDS_SEP,
>
>
>
>  THOUSEP = __THOUSANDS_SEP,
>
>  __GROUPING,
>
>
>
>  _NL_NUMERIC_DECIMAL_POINT_WC,
>  _NL_NUMERIC_THOUSANDS_SEP_WC,
>  _NL_NUMERIC_CODESET,
>  _NL_NUM_LC_NUMERIC,
>
>  __YESEXPR = (((__LC_MESSAGES) << 16) | (0)),
>
>  __NOEXPR,
>
>  __YESSTR,
>
>
>
>  __NOSTR,
>
>
>
>  _NL_MESSAGES_CODESET,
>  _NL_NUM_LC_MESSAGES,
>
>  _NL_PAPER_HEIGHT = (((__LC_PAPER) << 16) | (0)),
>  _NL_PAPER_WIDTH,
>  _NL_PAPER_CODESET,
>  _NL_NUM_LC_PAPER,
>
>  _NL_NAME_NAME_FMT = (((__LC_NAME) << 16) | (0)),
>  _NL_NAME_NAME_GEN,
>  _NL_NAME_NAME_MR,
>  _NL_NAME_NAME_MRS,
>  _NL_NAME_NAME_MISS,
>  _NL_NAME_NAME_MS,
>  _NL_NAME_CODESET,
>  _NL_NUM_LC_NAME,
>
>  _NL_ADDRESS_POSTAL_FMT = (((__LC_ADDRESS) << 16) | (0)),
>  _NL_ADDRESS_COUNTRY_NAME,
>  _NL_ADDRESS_COUNTRY_POST,
>  _NL_ADDRESS_COUNTRY_AB2,
>  _NL_ADDRESS_COUNTRY_AB3,
>  _NL_ADDRESS_COUNTRY_CAR,
>  _NL_ADDRESS_COUNTRY_NUM,
>  _NL_ADDRESS_COUNTRY_ISBN,
>  _NL_ADDRESS_LANG_NAME,
>  _NL_ADDRESS_LANG_AB,
>  _NL_ADDRESS_LANG_TERM,
>  _NL_ADDRESS_LANG_LIB,
>  _NL_ADDRESS_CODESET,
>  _NL_NUM_LC_ADDRESS,
>
>  _NL_TELEPHONE_TEL_INT_FMT = (((__LC_TELEPHONE) << 16) | (0)),
>  _NL_TELEPHONE_TEL_DOM_FMT,
>  _NL_TELEPHONE_INT_SELECT,
>  _NL_TELEPHONE_INT_PREFIX,
>  _NL_TELEPHONE_CODESET,
>  _NL_NUM_LC_TELEPHONE,
>
>  _NL_MEASUREMENT_MEASUREMENT = (((__LC_MEASUREMENT) << 16) | (0)),
>  _NL_MEASUREMENT_CODESET,
>  _NL_NUM_LC_MEASUREMENT,
>
>  _NL_IDENTIFICATION_TITLE = (((__LC_IDENTIFICATION) << 16) | (0)),
>  _NL_IDENTIFICATION_SOURCE,
>  _NL_IDENTIFICATION_ADDRESS,
>  _NL_IDENTIFICATION_CONTACT,
>  _NL_IDENTIFICATION_EMAIL,
>  _NL_IDENTIFICATION_TEL,
>  _NL_IDENTIFICATION_FAX,
>  _NL_IDENTIFICATION_LANGUAGE,
>  _NL_IDENTIFICATION_TERRITORY,
>  _NL_IDENTIFICATION_AUDIENCE,
>  _NL_IDENTIFICATION_APPLICATION,
>  _NL_IDENTIFICATION_ABBREVIATION,
>  _NL_IDENTIFICATION_REVISION,
>  _NL_IDENTIFICATION_DATE,
>  _NL_IDENTIFICATION_CATEGORY,
>  _NL_IDENTIFICATION_CODESET,
>  _NL_NUM_LC_IDENTIFICATION,
>
>
>  _NL_NUM
>};
># 582 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo (nl_item __item) throw ();
># 593 "/usr/include/langinfo.h" 3 4
>extern char *nl_langinfo_l (nl_item __item, __locale_t l);
>
>
>}
># 45 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/iconv.h" 1 3 4
># 24 "/usr/include/iconv.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 25 "/usr/include/iconv.h" 2 3 4
>
>
>extern "C" {
>
>
>typedef void *iconv_t;
>
>
>
>
>
>
>
>extern iconv_t iconv_open (__const char *__tocode, __const char *__fromcode);
>
>
>
>
>extern size_t iconv (iconv_t __cd, char **__restrict __inbuf,
>       size_t *__restrict __inbytesleft,
>       char **__restrict __outbuf,
>       size_t *__restrict __outbytesleft);
>
>
>
>
>
>extern int iconv_close (iconv_t __cd);
>
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 2 3
># 1 "/usr/include/libintl.h" 1 3 4
># 35 "/usr/include/libintl.h" 3 4
>extern "C" {
>
>
>
>
>extern char *gettext (__const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (1)));
>
>
>
>extern char *dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dgettext (__const char *__domainname, __const char *__msgid)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dcgettext (__const char *__domainname,
>   __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>extern char *__dcgettext (__const char *__domainname,
>     __const char *__msgid, int __category)
>     throw () __attribute__ ((__format_arg__ (2)));
>
>
>
>
>extern char *ngettext (__const char *__msgid1, __const char *__msgid2,
>         unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (1))) __attribute__ ((__format_arg__ (2)));
>
>
>
>extern char *dngettext (__const char *__domainname, __const char *__msgid1,
>   __const char *__msgid2, unsigned long int __n)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>extern char *dcngettext (__const char *__domainname, __const char *__msgid1,
>    __const char *__msgid2, unsigned long int __n,
>    int __category)
>     throw () __attribute__ ((__format_arg__ (2))) __attribute__ ((__format_arg__ (3)));
>
>
>
>
>
>extern char *textdomain (__const char *__domainname) throw ();
>
>
>
>extern char *bindtextdomain (__const char *__domainname,
>        __const char *__dirname) throw ();
>
>
>
>extern char *bind_textdomain_codeset (__const char *__domainname,
>          __const char *__codeset) throw ();
># 122 "/usr/include/libintl.h" 3 4
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 2 3
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>  extern "C" __typeof(uselocale) __uselocale;
>}
>
>
>namespace std
>{
>  typedef __locale_t __c_locale;
>
>
>
>
>
>  template<typename _Tv>
>    int
>    __convert_from_v(char* __out, const int __size, const char* __fmt,
>
>       _Tv __v, const __c_locale& __cloc, int __prec)
>    {
>      __c_locale __old = __gnu_cxx::__uselocale(__cloc);
># 84 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++locale.h" 3
>      const int __ret = std::snprintf(__out, __size, __fmt, __prec, __v);
>
>
>
>
>
>      __gnu_cxx::__uselocale(__old);
>
>
>
>
>      return __ret;
>    }
>}
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++io.h" 1 3
># 37 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++io.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr.h" 3
>#pragma GCC visibility push(default)
># 114 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 3
>typedef pthread_key_t __gthread_key_t;
>typedef pthread_once_t __gthread_once_t;
>typedef pthread_mutex_t __gthread_mutex_t;
>typedef pthread_mutex_t __gthread_recursive_mutex_t;
># 72 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 3
>extern __typeof(pthread_once) __gthrw_pthread_once __asm ("" "pthread_once");
>extern __typeof(pthread_key_create) __gthrw_pthread_key_create __asm ("" "pthread_key_create");
>extern __typeof(pthread_key_delete) __gthrw_pthread_key_delete __asm ("" "pthread_key_delete");
>extern __typeof(pthread_getspecific) __gthrw_pthread_getspecific __asm ("" "pthread_getspecific");
>extern __typeof(pthread_setspecific) __gthrw_pthread_setspecific __asm ("" "pthread_setspecific");
>extern __typeof(pthread_create) __gthrw_pthread_create __asm ("" "pthread_create");
>extern __typeof(pthread_cancel) __gthrw_pthread_cancel __asm ("" "pthread_cancel");
>
>extern __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __asm ("" "pthread_mutex_lock");
>extern __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __asm ("" "pthread_mutex_trylock");
>extern __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __asm ("" "pthread_mutex_unlock");
>extern __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __asm ("" "pthread_mutexattr_init");
>extern __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __asm ("" "pthread_mutexattr_settype");
>extern __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __asm ("" "pthread_mutexattr_destroy");
>
>extern __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __asm ("" "pthread_mutex_init");
># 127 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_active_p (void)
>{
>  return 1;
>}
># 484 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_once (__gthread_once_t *once, void (*func) (void))
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_once (once, func);
>  else
>    return -1;
>}
>
>static inline int
>__gthread_key_create (__gthread_key_t *key, void (*dtor) (void *))
>{
>  return __gthrw_pthread_key_create (key, dtor);
>}
>
>static inline int
>__gthread_key_delete (__gthread_key_t key)
>{
>  return __gthrw_pthread_key_delete (key);
>}
>
>static inline void *
>__gthread_getspecific (__gthread_key_t key)
>{
>  return __gthrw_pthread_getspecific (key);
>}
>
>static inline int
>__gthread_setspecific (__gthread_key_t key, const void *ptr)
>{
>  return __gthrw_pthread_setspecific (key, ptr);
>}
>
>static inline int
>__gthread_mutex_lock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_lock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_trylock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_trylock (mutex);
>  else
>    return 0;
>}
>
>static inline int
>__gthread_mutex_unlock (__gthread_mutex_t *mutex)
>{
>  if (__gthread_active_p ())
>    return __gthrw_pthread_mutex_unlock (mutex);
>  else
>    return 0;
>}
># 566 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr-default.h" 3
>static inline int
>__gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_lock (mutex);
>}
>
>static inline int
>__gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_trylock (mutex);
>}
>
>static inline int
>__gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *mutex)
>{
>  return __gthread_mutex_unlock (mutex);
>}
># 115 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/gthr.h" 2 3
>
>
>
>
>
>
>
>#pragma GCC visibility pop
># 38 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++io.h" 2 3
>
>namespace std
>{
>  typedef __gthread_mutex_t __c_lock;
>
>
>  typedef FILE __c_file;
>
>
>
>  struct __ios_flags
>  {
>    typedef short __int_type;
>
>    static const __int_type _S_boolalpha = 0x0001;
>    static const __int_type _S_dec = 0x0002;
>    static const __int_type _S_fixed = 0x0004;
>    static const __int_type _S_hex = 0x0008;
>    static const __int_type _S_internal = 0x0010;
>    static const __int_type _S_left = 0x0020;
>    static const __int_type _S_oct = 0x0040;
>    static const __int_type _S_right = 0x0080;
>    static const __int_type _S_scientific = 0x0100;
>    static const __int_type _S_showbase = 0x0200;
>    static const __int_type _S_showpoint = 0x0400;
>    static const __int_type _S_showpos = 0x0800;
>    static const __int_type _S_skipws = 0x1000;
>    static const __int_type _S_unitbuf = 0x2000;
>    static const __int_type _S_uppercase = 0x4000;
>    static const __int_type _S_adjustfield = 0x0020 | 0x0080 | 0x0010;
>    static const __int_type _S_basefield = 0x0002 | 0x0040 | 0x0008;
>    static const __int_type _S_floatfield = 0x0100 | 0x0004;
>
>
>    static const __int_type _S_badbit = 0x01;
>    static const __int_type _S_eofbit = 0x02;
>    static const __int_type _S_failbit = 0x04;
>
>
>    static const __int_type _S_app = 0x01;
>    static const __int_type _S_ate = 0x02;
>    static const __int_type _S_bin = 0x04;
>    static const __int_type _S_in = 0x08;
>    static const __int_type _S_out = 0x10;
>    static const __int_type _S_trunc = 0x20;
>  };
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cctype" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cctype" 3
>       
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cctype" 3
>
>
># 1 "/usr/include/ctype.h" 1 3 4
># 30 "/usr/include/ctype.h" 3 4
>extern "C" {
># 48 "/usr/include/ctype.h" 3 4
>enum
>{
>  _ISupper = ((0) < 8 ? ((1 << (0)) << 8) : ((1 << (0)) >> 8)),
>  _ISlower = ((1) < 8 ? ((1 << (1)) << 8) : ((1 << (1)) >> 8)),
>  _ISalpha = ((2) < 8 ? ((1 << (2)) << 8) : ((1 << (2)) >> 8)),
>  _ISdigit = ((3) < 8 ? ((1 << (3)) << 8) : ((1 << (3)) >> 8)),
>  _ISxdigit = ((4) < 8 ? ((1 << (4)) << 8) : ((1 << (4)) >> 8)),
>  _ISspace = ((5) < 8 ? ((1 << (5)) << 8) : ((1 << (5)) >> 8)),
>  _ISprint = ((6) < 8 ? ((1 << (6)) << 8) : ((1 << (6)) >> 8)),
>  _ISgraph = ((7) < 8 ? ((1 << (7)) << 8) : ((1 << (7)) >> 8)),
>  _ISblank = ((8) < 8 ? ((1 << (8)) << 8) : ((1 << (8)) >> 8)),
>  _IScntrl = ((9) < 8 ? ((1 << (9)) << 8) : ((1 << (9)) >> 8)),
>  _ISpunct = ((10) < 8 ? ((1 << (10)) << 8) : ((1 << (10)) >> 8)),
>  _ISalnum = ((11) < 8 ? ((1 << (11)) << 8) : ((1 << (11)) >> 8))
>};
># 81 "/usr/include/ctype.h" 3 4
>extern __const unsigned short int **__ctype_b_loc (void)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_tolower_loc (void)
>     __attribute__ ((__const));
>extern __const __int32_t **__ctype_toupper_loc (void)
>     __attribute__ ((__const));
># 96 "/usr/include/ctype.h" 3 4
>
>
>
>
>
>
>extern int isalnum (int) throw ();
>extern int isalpha (int) throw ();
>extern int iscntrl (int) throw ();
>extern int isdigit (int) throw ();
>extern int islower (int) throw ();
>extern int isgraph (int) throw ();
>extern int isprint (int) throw ();
>extern int ispunct (int) throw ();
>extern int isspace (int) throw ();
>extern int isupper (int) throw ();
>extern int isxdigit (int) throw ();
>
>
>
>extern int tolower (int __c) throw ();
>
>
>extern int toupper (int __c) throw ();
>
>
>
>
>
>
>
>
>extern int isblank (int) throw ();
>
>
>
>
>
>
>extern int isctype (int __c, int __mask) throw ();
>
>
>
>
>
>
>extern int isascii (int __c) throw ();
>
>
>
>extern int toascii (int __c) throw ();
>
>
>
>extern int _toupper (int) throw ();
>extern int _tolower (int) throw ();
># 247 "/usr/include/ctype.h" 3 4
>extern int isalnum_l (int, __locale_t) throw ();
>extern int isalpha_l (int, __locale_t) throw ();
>extern int iscntrl_l (int, __locale_t) throw ();
>extern int isdigit_l (int, __locale_t) throw ();
>extern int islower_l (int, __locale_t) throw ();
>extern int isgraph_l (int, __locale_t) throw ();
>extern int isprint_l (int, __locale_t) throw ();
>extern int ispunct_l (int, __locale_t) throw ();
>extern int isspace_l (int, __locale_t) throw ();
>extern int isupper_l (int, __locale_t) throw ();
>extern int isxdigit_l (int, __locale_t) throw ();
>
>extern int isblank_l (int, __locale_t) throw ();
>
>
>
>extern int __tolower_l (int __c, __locale_t __l) throw ();
>extern int tolower_l (int __c, __locale_t __l) throw ();
>
>
>extern int __toupper_l (int __c, __locale_t __l) throw ();
>extern int toupper_l (int __c, __locale_t __l) throw ();
># 323 "/usr/include/ctype.h" 3 4
>}
># 50 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cctype" 2 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cctype" 3
>namespace std
>{
>  using ::isalnum;
>  using ::isalpha;
>  using ::iscntrl;
>  using ::isdigit;
>  using ::isgraph;
>  using ::islower;
>  using ::isprint;
>  using ::ispunct;
>  using ::isspace;
>  using ::isupper;
>  using ::isxdigit;
>  using ::tolower;
>  using ::toupper;
>}
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stringfwd.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stringfwd.h" 3
>       
># 43 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stringfwd.h" 3
>
>
>
>namespace std
>{
>  template<typename _Alloc>
>    class allocator;
>
>  template<class _CharT>
>    struct char_traits;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>           typename _Alloc = allocator<_CharT> >
>    class basic_string;
>
>  template<> struct char_traits<char>;
>
>  typedef basic_string<char> string;
>
>
>  template<> struct char_traits<wchar_t>;
>
>  typedef basic_string<wchar_t> wstring;
>
>}
># 49 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 1 3
># 44 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 3
>       
># 45 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 3
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ctime" 1 3
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ctime" 3
>       
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ctime" 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ctime" 3
>namespace std
>{
>  using ::clock_t;
>  using ::time_t;
>  using ::tm;
>
>  using ::clock;
>  using ::difftime;
>  using ::mktime;
>  using ::time;
>  using ::asctime;
>  using ::ctime;
>  using ::gmtime;
>  using ::localtime;
>  using ::strftime;
>}
># 52 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 2 3
>
>
># 1 "/usr/include/wchar.h" 1 3 4
># 40 "/usr/include/wchar.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stdarg.h" 1 3 4
># 41 "/usr/include/wchar.h" 2 3 4
>
>
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 49 "/usr/include/wchar.h" 2 3 4
># 93 "/usr/include/wchar.h" 3 4
>
>
>typedef __mbstate_t mbstate_t;
>
>
>
># 118 "/usr/include/wchar.h" 3 4
>extern "C" {
>
>
>
>
>struct tm;
>
>
>
>
>
>
>
>
>
>extern wchar_t *wcscpy (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncpy (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern wchar_t *wcscat (wchar_t *__restrict __dest,
>   __const wchar_t *__restrict __src) throw ();
>
>extern wchar_t *wcsncat (wchar_t *__restrict __dest,
>    __const wchar_t *__restrict __src, size_t __n)
>     throw ();
>
>
>extern int wcscmp (__const wchar_t *__s1, __const wchar_t *__s2)
>     throw () __attribute__ ((__pure__));
>
>extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern int wcscasecmp (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>extern int wcsncasecmp (__const wchar_t *__s1, __const wchar_t *__s2,
>   size_t __n) throw ();
>
>
>
>
>
>extern int wcscasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>    __locale_t __loc) throw ();
>
>extern int wcsncasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2,
>     size_t __n, __locale_t __loc) throw ();
>
>
>
>
>
>extern int wcscoll (__const wchar_t *__s1, __const wchar_t *__s2) throw ();
>
>
>
>extern size_t wcsxfrm (wchar_t *__restrict __s1,
>         __const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>
>
>
>
>
>extern int wcscoll_l (__const wchar_t *__s1, __const wchar_t *__s2,
>        __locale_t __loc) throw ();
>
>
>
>
>extern size_t wcsxfrm_l (wchar_t *__s1, __const wchar_t *__s2,
>    size_t __n, __locale_t __loc) throw ();
>
>
>extern wchar_t *wcsdup (__const wchar_t *__s) throw () __attribute__ ((__malloc__));
>
>
>
>
>extern wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wcschrnul (__const wchar_t *__s, wchar_t __wc)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject)
>     throw () __attribute__ ((__pure__));
>
>
>extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcspbrk (__const wchar_t *__wcs, __const wchar_t *__accept)
>     throw () __attribute__ ((__pure__));
>
>extern wchar_t *wcsstr (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __attribute__ ((__pure__));
>
>
>extern wchar_t *wcstok (wchar_t *__restrict __s,
>   __const wchar_t *__restrict __delim,
>   wchar_t **__restrict __ptr) throw ();
>
>
>extern size_t wcslen (__const wchar_t *__s) throw () __attribute__ ((__pure__));
>
>
>
>
>extern wchar_t *wcswcs (__const wchar_t *__haystack, __const wchar_t *__needle)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen)
>     throw () __attribute__ ((__pure__));
>
>
>
>
>
>extern wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>extern int wmemcmp (__const wchar_t *__restrict __s1,
>      __const wchar_t *__restrict __s2, size_t __n)
>     throw () __attribute__ ((__pure__));
>
>
>extern wchar_t *wmemcpy (wchar_t *__restrict __s1,
>    __const wchar_t *__restrict __s2, size_t __n) throw ();
>
>
>
>extern wchar_t *wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n)
>     throw ();
>
>
>extern wchar_t *wmemset (wchar_t *__s, wchar_t __c, size_t __n) throw ();
>
>
>
>
>
>extern wchar_t *wmempcpy (wchar_t *__restrict __s1,
>     __const wchar_t *__restrict __s2, size_t __n)
>     throw ();
>
>
>
>
>
>
>extern wint_t btowc (int __c) throw ();
>
>
>
>extern int wctob (wint_t __c) throw ();
>
>
>
>extern int mbsinit (__const mbstate_t *__ps) throw () __attribute__ ((__pure__));
>
>
>
>extern size_t mbrtowc (wchar_t *__restrict __pwc,
>         __const char *__restrict __s, size_t __n,
>         mbstate_t *__p) throw ();
>
>
>extern size_t wcrtomb (char *__restrict __s, wchar_t __wc,
>         mbstate_t *__restrict __ps) throw ();
>
>
>extern size_t __mbrlen (__const char *__restrict __s, size_t __n,
>   mbstate_t *__restrict __ps) throw ();
>extern size_t mbrlen (__const char *__restrict __s, size_t __n,
>        mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>
>
>extern wint_t __btowc_alias (int __c) __asm ("btowc");
>extern __inline wint_t
>btowc (int __c) throw ()
>{ return (__builtin_constant_p (__c) && __c >= '\0' && __c <= '\x7f'
>   ? (wint_t) __c : __btowc_alias (__c)); }
>
>extern int __wctob_alias (wint_t __c) __asm ("wctob");
>extern __inline int
>wctob (wint_t __wc) throw ()
>{ return (__builtin_constant_p (__wc) && __wc >= L'\0' && __wc <= L'\x7f'
>   ? (int) __wc : __wctob_alias (__wc)); }
>
>extern __inline size_t
>mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw ()
>
>{ return (__ps != __null
>   ? mbrtowc (__null, __s, __n, __ps) : __mbrlen (__s, __n, __null)); }
>
>
>
>
>
>extern size_t mbsrtowcs (wchar_t *__restrict __dst,
>    __const char **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsrtombs (char *__restrict __dst,
>    __const wchar_t **__restrict __src, size_t __len,
>    mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern size_t mbsnrtowcs (wchar_t *__restrict __dst,
>     __const char **__restrict __src, size_t __nmc,
>     size_t __len, mbstate_t *__restrict __ps) throw ();
>
>
>
>extern size_t wcsnrtombs (char *__restrict __dst,
>     __const wchar_t **__restrict __src,
>     size_t __nwc, size_t __len,
>     mbstate_t *__restrict __ps) throw ();
>
>
>
>
>
>
>extern int wcwidth (wchar_t __c) throw ();
>
>
>
>extern int wcswidth (__const wchar_t *__s, size_t __n) throw ();
>
>
>
>
>
>
>extern double wcstod (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr) throw ();
>
>
>
>extern float wcstof (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>extern long double wcstold (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr) throw ();
>
>
>
>
>
>extern long int wcstol (__const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, int __base) throw ();
>
>
>
>extern unsigned long int wcstoul (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>
>__extension__
>extern long long int wcstoll (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstoull (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr,
>     int __base) throw ();
>
>
>
>
>
>
>__extension__
>extern long long int wcstoq (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr, int __base)
>     throw ();
>
>
>
>__extension__
>extern unsigned long long int wcstouq (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __base) throw ();
># 465 "/usr/include/wchar.h" 3 4
>extern long int wcstol_l (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __base,
>     __locale_t __loc) throw ();
>
>extern unsigned long int wcstoul_l (__const wchar_t *__restrict __nptr,
>        wchar_t **__restrict __endptr,
>        int __base, __locale_t __loc) throw ();
>
>__extension__
>extern long long int wcstoll_l (__const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr,
>    int __base, __locale_t __loc) throw ();
>
>__extension__
>extern unsigned long long int wcstoull_l (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, __locale_t __loc)
>     throw ();
>
>extern double wcstod_l (__const wchar_t *__restrict __nptr,
>   wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern float wcstof_l (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr, __locale_t __loc)
>     throw ();
>
>extern long double wcstold_l (__const wchar_t *__restrict __nptr,
>         wchar_t **__restrict __endptr,
>         __locale_t __loc) throw ();
>
>
>
>
>
>extern double __wcstod_internal (__const wchar_t *__restrict __nptr,
>     wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern float __wcstof_internal (__const wchar_t *__restrict __nptr,
>    wchar_t **__restrict __endptr, int __group)
>     throw ();
>extern long double __wcstold_internal (__const wchar_t *__restrict __nptr,
>           wchar_t **__restrict __endptr,
>           int __group) throw ();
>
>
>extern long int __wcstol_internal (__const wchar_t *__restrict __nptr,
>       wchar_t **__restrict __endptr,
>       int __base, int __group) throw ();
>
>
>
>extern unsigned long int __wcstoul_internal (__const wchar_t *__restrict __npt,
>          wchar_t **__restrict __endptr,
>          int __base, int __group) throw ();
>
>
>
>__extension__
>extern long long int __wcstoll_internal (__const wchar_t *__restrict __nptr,
>      wchar_t **__restrict __endptr,
>      int __base, int __group) throw ();
>
>
>
>__extension__
>extern unsigned long long int __wcstoull_internal (__const wchar_t *
>         __restrict __nptr,
>         wchar_t **
>         __restrict __endptr,
>         int __base,
>         int __group) throw ();
>
>
>
>
>
>
>
>
>extern __inline double
>wcstod (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstod_internal (__nptr, __endptr, 0); }
>extern __inline long int
>wcstol (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstol_internal (__nptr, __endptr, __base, 0); }
>extern __inline unsigned long int
>wcstoul (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoul_internal (__nptr, __endptr, __base, 0); }
>
>
>
>extern __inline float
>wcstof (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstof_internal (__nptr, __endptr, 0); }
>extern __inline long double
>wcstold (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw ()
>
>{ return __wcstold_internal (__nptr, __endptr, 0); }
>
>
>__extension__
>extern __inline long long int
>wcstoq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoll_internal (__nptr, __endptr, __base, 0); }
>__extension__
>extern __inline unsigned long long int
>wcstouq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw ()
>
>{ return __wcstoull_internal (__nptr, __endptr, __base, 0); }
>
>
>
>
>
>
>
>extern wchar_t *wcpcpy (wchar_t *__dest, __const wchar_t *__src) throw ();
>
>
>
>extern wchar_t *wcpncpy (wchar_t *__dest, __const wchar_t *__src, size_t __n)
>     throw ();
>
>
>
>
>
>
>
>
>extern int fwide (__FILE *__fp, int __mode) throw ();
>
>
>
>
>
>
>extern int fwprintf (__FILE *__restrict __stream,
>       __const wchar_t *__restrict __format, ...)
>                                                           ;
>
>
>
>
>extern int wprintf (__const wchar_t *__restrict __format, ...)
>                                                           ;
>
>extern int swprintf (wchar_t *__restrict __s, size_t __n,
>       __const wchar_t *__restrict __format, ...)
>     throw () ;
>
>
>
>
>
>extern int vfwprintf (__FILE *__restrict __s,
>        __const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>                                                           ;
>
>
>
>
>extern int vwprintf (__const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                           ;
>
>
>extern int vswprintf (wchar_t *__restrict __s, size_t __n,
>        __const wchar_t *__restrict __format,
>        __gnuc_va_list __arg)
>     throw () ;
>
>
>
>
>
>
>extern int fwscanf (__FILE *__restrict __stream,
>      __const wchar_t *__restrict __format, ...)
>                                                          ;
>
>
>
>
>extern int wscanf (__const wchar_t *__restrict __format, ...)
>                                                          ;
>
>extern int swscanf (__const wchar_t *__restrict __s,
>      __const wchar_t *__restrict __format, ...)
>     throw () ;
>
>
>
>
>
>
>
>
>
>
>
>extern int vfwscanf (__FILE *__restrict __s,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>                                                          ;
>
>
>
>
>extern int vwscanf (__const wchar_t *__restrict __format,
>      __gnuc_va_list __arg)
>                                                          ;
>
>extern int vswscanf (__const wchar_t *__restrict __s,
>       __const wchar_t *__restrict __format,
>       __gnuc_va_list __arg)
>     throw () ;
>
>
>
>
>
>
>
>
>
>
>extern wint_t fgetwc (__FILE *__stream);
>extern wint_t getwc (__FILE *__stream);
>
>
>
>
>
>extern wint_t getwchar (void);
>
>
>
>
>
>
>extern wint_t fputwc (wchar_t __wc, __FILE *__stream);
>extern wint_t putwc (wchar_t __wc, __FILE *__stream);
>
>
>
>
>
>extern wint_t putwchar (wchar_t __wc);
>
>
>
>
>
>
>
>extern wchar_t *fgetws (wchar_t *__restrict __ws, int __n,
>   __FILE *__restrict __stream);
>
>
>
>
>
>extern int fputws (__const wchar_t *__restrict __ws,
>     __FILE *__restrict __stream);
>
>
>
>
>
>
>extern wint_t ungetwc (wint_t __wc, __FILE *__stream);
>
># 755 "/usr/include/wchar.h" 3 4
>extern wint_t getwc_unlocked (__FILE *__stream);
>extern wint_t getwchar_unlocked (void);
>
>
>
>
>
>
>
>extern wint_t fgetwc_unlocked (__FILE *__stream);
>
>
>
>
>
>
>
>extern wint_t fputwc_unlocked (wchar_t __wc, __FILE *__stream);
># 781 "/usr/include/wchar.h" 3 4
>extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream);
>extern wint_t putwchar_unlocked (wchar_t __wc);
># 791 "/usr/include/wchar.h" 3 4
>extern wchar_t *fgetws_unlocked (wchar_t *__restrict __ws, int __n,
>     __FILE *__restrict __stream);
>
>
>
>
>
>
>
>extern int fputws_unlocked (__const wchar_t *__restrict __ws,
>       __FILE *__restrict __stream);
>
>
>
>
>
>
>
>extern size_t wcsftime (wchar_t *__restrict __s, size_t __maxsize,
>   __const wchar_t *__restrict __format,
>   __const struct tm *__restrict __tp) throw ();
>
>
>
>
>
>
>
>extern size_t wcsftime_l (wchar_t *__restrict __s, size_t __maxsize,
>     __const wchar_t *__restrict __format,
>     __const struct tm *__restrict __tp,
>     __locale_t __loc) throw ();
># 836 "/usr/include/wchar.h" 3 4
>}
># 55 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 2 3
># 69 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 3
>namespace std
>{
>  using ::mbstate_t;
>}
># 141 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 3
>namespace std
>{
>  using ::wint_t;
>
>  using ::btowc;
>  using ::fgetwc;
>  using ::fgetws;
>  using ::fputwc;
>  using ::fputws;
>  using ::fwide;
>  using ::fwprintf;
>  using ::fwscanf;
>  using ::getwc;
>  using ::getwchar;
>  using ::mbrlen;
>  using ::mbrtowc;
>  using ::mbsinit;
>  using ::mbsrtowcs;
>  using ::putwc;
>  using ::putwchar;
>  using ::swprintf;
>  using ::swscanf;
>  using ::ungetwc;
>  using ::vfwprintf;
>
>  using ::vfwscanf;
>
>  using ::vswprintf;
>
>  using ::vswscanf;
>
>  using ::vwprintf;
>
>  using ::vwscanf;
>
>  using ::wcrtomb;
>  using ::wcscat;
>  using ::wcscmp;
>  using ::wcscoll;
>  using ::wcscpy;
>  using ::wcscspn;
>  using ::wcsftime;
>  using ::wcslen;
>  using ::wcsncat;
>  using ::wcsncmp;
>  using ::wcsncpy;
>  using ::wcsrtombs;
>  using ::wcsspn;
>  using ::wcstod;
>
>  using ::wcstof;
>
>  using ::wcstok;
>  using ::wcstol;
>  using ::wcstoul;
>  using ::wcsxfrm;
>  using ::wctob;
>  using ::wmemcmp;
>  using ::wmemcpy;
>  using ::wmemmove;
>  using ::wmemset;
>  using ::wprintf;
>  using ::wscanf;
>
>  using ::wcschr;
>
>  inline wchar_t*
>  wcschr(wchar_t* __p, wchar_t __c)
>  { return wcschr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcspbrk;
>
>  inline wchar_t*
>  wcspbrk(wchar_t* __s1, const wchar_t* __s2)
>  { return wcspbrk(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wcsrchr;
>
>  inline wchar_t*
>  wcsrchr(wchar_t* __p, wchar_t __c)
>  { return wcsrchr(const_cast<const wchar_t*>(__p), __c); }
>
>  using ::wcsstr;
>
>  inline wchar_t*
>  wcsstr(wchar_t* __s1, const wchar_t* __s2)
>  { return wcsstr(const_cast<const wchar_t*>(__s1), __s2); }
>
>  using ::wmemchr;
>
>  inline wchar_t*
>  wmemchr(wchar_t* __p, wchar_t __c, size_t __n)
>  { return wmemchr(const_cast<const wchar_t*>(__p), __c, __n); }
>}
>
>
>
>
>
>
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>  using ::wcstold;
># 258 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cwchar" 3
>  using ::wcstoll;
>  using ::wcstoull;
>
>}
>
>namespace std
>{
>  using __gnu_cxx::wcstold;
>  using __gnu_cxx::wcstoll;
>  using __gnu_cxx::wcstoull;
>}
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 2 3
>
>
># 1 "/usr/include/stdint.h" 1 3 4
># 28 "/usr/include/stdint.h" 3 4
># 1 "/usr/include/bits/wordsize.h" 1 3 4
># 29 "/usr/include/stdint.h" 2 3 4
># 49 "/usr/include/stdint.h" 3 4
>typedef unsigned char uint8_t;
>typedef unsigned short int uint16_t;
>
>typedef unsigned int uint32_t;
>
>
>
>
>
>__extension__
>typedef unsigned long long int uint64_t;
>
>
>
>
>
>
>typedef signed char int_least8_t;
>typedef short int int_least16_t;
>typedef int int_least32_t;
>
>
>
>__extension__
>typedef long long int int_least64_t;
>
>
>
>typedef unsigned char uint_least8_t;
>typedef unsigned short int uint_least16_t;
>typedef unsigned int uint_least32_t;
>
>
>
>__extension__
>typedef unsigned long long int uint_least64_t;
>
>
>
>
>
>
>typedef signed char int_fast8_t;
>
>
>
>
>
>typedef int int_fast16_t;
>typedef int int_fast32_t;
>__extension__
>typedef long long int int_fast64_t;
>
>
>
>typedef unsigned char uint_fast8_t;
>
>
>
>
>
>typedef unsigned int uint_fast16_t;
>typedef unsigned int uint_fast32_t;
>__extension__
>typedef unsigned long long int uint_fast64_t;
># 129 "/usr/include/stdint.h" 3 4
>typedef unsigned int uintptr_t;
># 138 "/usr/include/stdint.h" 3 4
>__extension__
>typedef long long int intmax_t;
>__extension__
>typedef unsigned long long int uintmax_t;
># 50 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 2 3
>
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 3
>  typedef int64_t streamoff;
>
>
>
>
>
>  typedef ptrdiff_t streamsize;
>
>  template<typename _StateT>
>    class fpos;
># 94 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 3
>  template<typename _StateT>
>    class fpos
>    {
>    private:
>      streamoff _M_off;
>      _StateT _M_state;
>
>    public:
>
>
>
>
>      fpos()
>      : _M_off(0), _M_state() { }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/postypes.h" 3
>      fpos(streamoff __off)
>      : _M_off(__off), _M_state() { }
>
>
>      operator streamoff() const { return _M_off; }
>
>
>      void
>      state(_StateT __st)
>      { _M_state = __st; }
>
>
>      _StateT
>      state() const
>      { return _M_state; }
>
>
>
>
>
>
>      bool
>      operator==(const fpos& __other) const
>      { return _M_off == __other._M_off; }
>
>
>      bool
>      operator!=(const fpos& __other) const
>      { return _M_off != __other._M_off; }
>
>
>
>
>
>      fpos&
>      operator+=(streamoff __off)
>      {
> _M_off += __off;
> return *this;
>      }
>
>
>
>
>
>      fpos&
>      operator-=(streamoff __off)
>      {
> _M_off -= __off;
> return *this;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator+(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos += __off;
> return __pos;
>      }
>
>
>
>
>
>
>
>      fpos
>      operator-(streamoff __off) const
>      {
> fpos __pos(*this);
> __pos -= __off;
> return __pos;
>      }
>
>
>
>
>
>
>      streamoff
>      operator-(const fpos& __other) const
>      { return _M_off - __other._M_off; }
>    };
>
>
>
>
>
>  typedef fpos<mbstate_t> streampos;
>
>  typedef fpos<mbstate_t> wstreampos;
>}
># 50 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/functexcept.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/functexcept.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/exception_defines.h" 1 3
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/functexcept.h" 2 3
>
>namespace std
>{
>
>  void
>  __throw_bad_exception(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_alloc(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_bad_cast(void) __attribute__((__noreturn__));
>
>  void
>  __throw_bad_typeid(void) __attribute__((__noreturn__));
>
>
>  void
>  __throw_logic_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_domain_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_invalid_argument(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_length_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_out_of_range(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_runtime_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_range_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_overflow_error(const char* __s) __attribute__((__noreturn__));
>
>  void
>  __throw_underflow_error(const char* __s) __attribute__((__noreturn__));
>
>
>  void
>  __throw_ios_failure(const char* __s) __attribute__((__noreturn__));
>}
># 51 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 2 3
>
>namespace std
>{
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ios;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_streambuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_istream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_iostream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>     typename _Alloc = allocator<_CharT> >
>    class basic_stringbuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_istringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_ostringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT>,
>    typename _Alloc = allocator<_CharT> >
>    class basic_stringstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_filebuf;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ifstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_ofstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class basic_fstream;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class istreambuf_iterator;
>
>  template<typename _CharT, typename _Traits = char_traits<_CharT> >
>    class ostreambuf_iterator;
>
>
>
>  class ios_base;
># 135 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/iosfwd" 3
>  typedef basic_ios<char> ios;
>  typedef basic_streambuf<char> streambuf;
>  typedef basic_istream<char> istream;
>  typedef basic_ostream<char> ostream;
>  typedef basic_iostream<char> iostream;
>  typedef basic_stringbuf<char> stringbuf;
>  typedef basic_istringstream<char> istringstream;
>  typedef basic_ostringstream<char> ostringstream;
>  typedef basic_stringstream<char> stringstream;
>  typedef basic_filebuf<char> filebuf;
>  typedef basic_ifstream<char> ifstream;
>  typedef basic_ofstream<char> ofstream;
>  typedef basic_fstream<char> fstream;
>
>
>  typedef basic_ios<wchar_t> wios;
>  typedef basic_streambuf<wchar_t> wstreambuf;
>  typedef basic_istream<wchar_t> wistream;
>  typedef basic_ostream<wchar_t> wostream;
>  typedef basic_iostream<wchar_t> wiostream;
>  typedef basic_stringbuf<wchar_t> wstringbuf;
>  typedef basic_istringstream<wchar_t> wistringstream;
>  typedef basic_ostringstream<wchar_t> wostringstream;
>  typedef basic_stringstream<wchar_t> wstringstream;
>  typedef basic_filebuf<wchar_t> wfilebuf;
>  typedef basic_ifstream<wchar_t> wifstream;
>  typedef basic_ofstream<wchar_t> wofstream;
>  typedef basic_fstream<wchar_t> wfstream;
>
>
>}
># 70 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_pair.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_pair.h" 3
>namespace std
>{
>
>  template<class _T1, class _T2>
>    struct pair
>    {
>      typedef _T1 first_type;
>      typedef _T2 second_type;
>
>      _T1 first;
>      _T2 second;
>
>
>
>
>
>      pair()
>      : first(), second() { }
>
>
>      pair(const _T1& __a, const _T2& __b)
>      : first(__a), second(__b) { }
>
>
>      template<class _U1, class _U2>
>        pair(const pair<_U1, _U2>& __p)
> : first(__p.first), second(__p.second) { }
>    };
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first == __y.first && __x.second == __y.second; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __x.first < __y.first
>      || (!(__y.first < __x.first) && __x.second < __y.second); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x == __y); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return __y < __x; }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__y < __x); }
>
>
>  template<class _T1, class _T2>
>    inline bool
>    operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
>    { return !(__x < __y); }
># 142 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_pair.h" 3
>  template<class _T1, class _T2>
>    inline pair<_T1, _T2>
>    make_pair(_T1 __x, _T2 __y)
>    { return pair<_T1, _T2>(__x, __y); }
>}
># 71 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/cpp_type_traits.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/cpp_type_traits.h" 3
>       
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/cpp_type_traits.h" 3
># 75 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/cpp_type_traits.h" 3
>namespace __gnu_internal
>{
>  typedef char __one;
>  typedef char __two[2];
>
>  template<typename _Tp>
>  __one __test_type(int _Tp::*);
>  template<typename _Tp>
>  __two& __test_type(...);
>}
>
>
>namespace __gnu_cxx
>{
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator;
>}
>
>struct __true_type { };
>struct __false_type { };
>
>namespace std
>{
>  template<bool>
>    struct __truth_type
>    { typedef __false_type __type; };
>
>  template<>
>    struct __truth_type<true>
>    { typedef __true_type __type; };
>
>
>
>  template<class _Sp, class _Tp>
>    struct __traitor
>    {
>      enum { __value = bool(_Sp::__value) || bool(_Tp::__value) };
>      typedef typename __truth_type<__value>::__type __type;
>    };
>
>
>  template<typename, typename>
>    struct __are_same
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __are_same<_Tp, _Tp>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<typename, bool>
>    struct __enable_if
>    {
>    };
>
>  template<typename _Tp>
>    struct __enable_if<_Tp, true>
>    {
>      typedef _Tp __type;
>    };
>
>
>  template<typename _Tp>
>    struct __is_void
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<>
>    struct __is_void<void>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_integer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>
>
>  template<>
>    struct __is_integer<bool>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<signed char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned char>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_integer<wchar_t>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>  template<>
>    struct __is_integer<short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned short>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned int>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_integer<unsigned long long>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_floating
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>
>  template<>
>    struct __is_floating<float>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>  template<>
>    struct __is_floating<long double>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_pointer
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Tp>
>    struct __is_pointer<_Tp*>
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_normal_iterator
>    {
>      enum { __value = 0 };
>      typedef __false_type __type;
>    };
>
>  template<typename _Iterator, typename _Container>
>    struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator,
>             _Container> >
>    {
>      enum { __value = 1 };
>      typedef __true_type __type;
>    };
>
>
>
>
>  template<typename _Tp>
>    struct __is_arithmetic
>    : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_fundamental
>    : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_scalar
>    : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> >
>    { };
>
>
>
>
>  template<typename _Tp>
>    struct __is_pod
>    {
>      enum
> {
>   __value = (sizeof(__gnu_internal::__test_type<_Tp>(0))
>       != sizeof(__gnu_internal::__one))
> };
>    };
>
>}
># 72 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_types.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>
>namespace std
>{
># 80 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>  struct input_iterator_tag {};
>
>  struct output_iterator_tag {};
>
>  struct forward_iterator_tag : public input_iterator_tag {};
>
>
>  struct bidirectional_iterator_tag : public forward_iterator_tag {};
>
>
>  struct random_access_iterator_tag : public bidirectional_iterator_tag {};
># 104 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_types.h" 3
>  template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t,
>           typename _Pointer = _Tp*, typename _Reference = _Tp&>
>    struct iterator
>    {
>
>      typedef _Category iterator_category;
>
>      typedef _Tp value_type;
>
>      typedef _Distance difference_type;
>
>      typedef _Pointer pointer;
>
>      typedef _Reference reference;
>    };
>
>
>
>
>
>
>
>  template<typename _Iterator>
>    struct iterator_traits
>    {
>      typedef typename _Iterator::iterator_category iterator_category;
>      typedef typename _Iterator::value_type value_type;
>      typedef typename _Iterator::difference_type difference_type;
>      typedef typename _Iterator::pointer pointer;
>      typedef typename _Iterator::reference reference;
>    };
>
>  template<typename _Tp>
>    struct iterator_traits<_Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef _Tp& reference;
>    };
>
>  template<typename _Tp>
>    struct iterator_traits<const _Tp*>
>    {
>      typedef random_access_iterator_tag iterator_category;
>      typedef _Tp value_type;
>      typedef ptrdiff_t difference_type;
>      typedef const _Tp* pointer;
>      typedef const _Tp& reference;
>    };
>
>
>
>
>
>
>
>  template<typename _Iter>
>    inline typename iterator_traits<_Iter>::iterator_category
>    __iterator_category(const _Iter&)
>    { return typename iterator_traits<_Iter>::iterator_category(); }
>
>}
># 73 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
>       
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/concept_check.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/concept_check.h" 3
>       
># 39 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/concept_check.h" 3
># 69 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 2 3
>
>namespace std
>{
>  template<typename _InputIterator>
>    inline typename iterator_traits<_InputIterator>::difference_type
>    __distance(_InputIterator __first, _InputIterator __last,
>               input_iterator_tag)
>    {
>
>     
>
>      typename iterator_traits<_InputIterator>::difference_type __n = 0;
>      while (__first != __last)
> {
>   ++__first;
>   ++__n;
> }
>      return __n;
>    }
>
>  template<typename _RandomAccessIterator>
>    inline typename iterator_traits<_RandomAccessIterator>::difference_type
>    __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
>               random_access_iterator_tag)
>    {
>
>     
>
>      return __last - __first;
>    }
># 112 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator>
>    inline typename iterator_traits<_InputIterator>::difference_type
>    distance(_InputIterator __first, _InputIterator __last)
>    {
>
>      return std::__distance(__first, __last,
>        std::__iterator_category(__first));
>    }
>
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
>    {
>
>     
>      while (__n--)
> ++__i;
>    }
>
>  template<typename _BidirectionalIterator, typename _Distance>
>    inline void
>    __advance(_BidirectionalIterator& __i, _Distance __n,
>              bidirectional_iterator_tag)
>    {
>
>     
>
>      if (__n > 0)
>        while (__n--)
>   ++__i;
>      else
>        while (__n++)
>   --__i;
>    }
>
>  template<typename _RandomAccessIterator, typename _Distance>
>    inline void
>    __advance(_RandomAccessIterator& __i, _Distance __n,
>              random_access_iterator_tag)
>    {
>
>     
>
>      __i += __n;
>    }
># 170 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator_base_funcs.h" 3
>  template<typename _InputIterator, typename _Distance>
>    inline void
>    advance(_InputIterator& __i, _Distance __n)
>    {
>
>      std::__advance(__i, __n, std::__iterator_category(__i));
>    }
>}
># 74 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 1 3
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>namespace std
>{
># 89 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    class reverse_iterator
>    : public iterator<typename iterator_traits<_Iterator>::iterator_category,
>        typename iterator_traits<_Iterator>::value_type,
>        typename iterator_traits<_Iterator>::difference_type,
>        typename iterator_traits<_Iterator>::pointer,
>                      typename iterator_traits<_Iterator>::reference>
>    {
>    protected:
>      _Iterator current;
>
>    public:
>      typedef _Iterator iterator_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>              difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::pointer pointer;
>
>    public:
>
>
>
>
>
>
>      reverse_iterator() : current() { }
>
>
>
>
>      explicit
>      reverse_iterator(iterator_type __x) : current(__x) { }
>
>
>
>
>      reverse_iterator(const reverse_iterator& __x)
>      : current(__x.current) { }
>
>
>
>
>
>      template<typename _Iter>
>        reverse_iterator(const reverse_iterator<_Iter>& __x)
> : current(__x.base()) { }
>
>
>
>
>      iterator_type
>      base() const
>      { return current; }
>
>
>
>
>
>
>      reference
>      operator*() const
>      {
> _Iterator __tmp = current;
> return *--__tmp;
>      }
>
>
>
>
>
>
>      pointer
>      operator->() const
>      { return &(operator*()); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator++()
>      {
> --current;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator++(int)
>      {
> reverse_iterator __tmp = *this;
> --current;
> return __tmp;
>      }
>
>
>
>
>
>
>      reverse_iterator&
>      operator--()
>      {
> ++current;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator operator--(int)
>      {
> reverse_iterator __tmp = *this;
> ++current;
> return __tmp;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator+(difference_type __n) const
>      { return reverse_iterator(current - __n); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator+=(difference_type __n)
>      {
> current -= __n;
> return *this;
>      }
>
>
>
>
>
>
>      reverse_iterator
>      operator-(difference_type __n) const
>      { return reverse_iterator(current + __n); }
>
>
>
>
>
>
>      reverse_iterator&
>      operator-=(difference_type __n)
>      {
> current += __n;
> return *this;
>      }
>
>
>
>
>
>
>      reference
>      operator[](difference_type __n) const
>      { return *(*this + __n); }
>    };
># 275 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Iterator>
>    inline bool
>    operator==(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return __x.base() == __y.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator<(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() < __x.base(); }
>
>  template<typename _Iterator>
>    inline bool
>    operator!=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y < __x; }
>
>  template<typename _Iterator>
>    inline bool
>    operator<=(const reverse_iterator<_Iterator>& __x,
>  const reverse_iterator<_Iterator>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Iterator>
>    inline bool
>    operator>=(const reverse_iterator<_Iterator>& __x,
>        const reverse_iterator<_Iterator>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Iterator>
>    inline typename reverse_iterator<_Iterator>::difference_type
>    operator-(const reverse_iterator<_Iterator>& __x,
>       const reverse_iterator<_Iterator>& __y)
>    { return __y.base() - __x.base(); }
>
>  template<typename _Iterator>
>    inline reverse_iterator<_Iterator>
>    operator+(typename reverse_iterator<_Iterator>::difference_type __n,
>       const reverse_iterator<_Iterator>& __x)
>    { return reverse_iterator<_Iterator>(__x.base() - __n); }
># 335 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class back_insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>
>    public:
>
>      typedef _Container container_type;
>
>
>      explicit
>      back_insert_iterator(_Container& __x) : container(&__x) { }
># 361 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>      back_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_back(__value);
> return *this;
>      }
>
>
>      back_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      back_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      back_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 395 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline back_insert_iterator<_Container>
>    back_inserter(_Container& __x)
>    { return back_insert_iterator<_Container>(__x); }
># 410 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class front_insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>
>    public:
>
>      typedef _Container container_type;
>
>
>      explicit front_insert_iterator(_Container& __x) : container(&__x) { }
># 435 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>      front_insert_iterator&
>      operator=(typename _Container::const_reference __value)
>      {
> container->push_front(__value);
> return *this;
>      }
>
>
>      front_insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      front_insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      front_insert_iterator
>      operator++(int)
>      { return *this; }
>    };
># 469 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    inline front_insert_iterator<_Container>
>    front_inserter(_Container& __x)
>    { return front_insert_iterator<_Container>(__x); }
># 488 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container>
>    class insert_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _Container* container;
>      typename _Container::iterator iter;
>
>    public:
>
>      typedef _Container container_type;
>
>
>
>
>
>      insert_iterator(_Container& __x, typename _Container::iterator __i)
>      : container(&__x), iter(__i) {}
># 530 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>      insert_iterator&
>      operator=(const typename _Container::const_reference __value)
>      {
> iter = container->insert(iter, __value);
> ++iter;
> return *this;
>      }
>
>
>      insert_iterator&
>      operator*()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++()
>      { return *this; }
>
>
>      insert_iterator&
>      operator++(int)
>      { return *this; }
>    };
># 565 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _Container, typename _Iterator>
>    inline insert_iterator<_Container>
>    inserter(_Container& __x, _Iterator __i)
>    {
>      return insert_iterator<_Container>(__x,
>      typename _Container::iterator(__i));
>    }
>}
>
>namespace __gnu_cxx
>{
>
>
>
>
>
>
>
>  using std::iterator_traits;
>  using std::iterator;
>  template<typename _Iterator, typename _Container>
>    class __normal_iterator
>    {
>    protected:
>      _Iterator _M_current;
>
>    public:
>      typedef typename iterator_traits<_Iterator>::iterator_category
>                                                             iterator_category;
>      typedef typename iterator_traits<_Iterator>::value_type value_type;
>      typedef typename iterator_traits<_Iterator>::difference_type
>                                                             difference_type;
>      typedef typename iterator_traits<_Iterator>::reference reference;
>      typedef typename iterator_traits<_Iterator>::pointer pointer;
>
>      __normal_iterator() : _M_current(_Iterator()) { }
>
>      explicit
>      __normal_iterator(const _Iterator& __i) : _M_current(__i) { }
>
>
>      template<typename _Iter>
>        inline __normal_iterator(const __normal_iterator<_Iter,
>     _Container>& __i)
> : _M_current(__i.base()) { }
>
>
>      reference
>      operator*() const
>      { return *_M_current; }
>
>      pointer
>      operator->() const
>      { return _M_current; }
>
>      __normal_iterator&
>      operator++()
>      {
> ++_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator++(int)
>      { return __normal_iterator(_M_current++); }
>
>
>      __normal_iterator&
>      operator--()
>      {
> --_M_current;
> return *this;
>      }
>
>      __normal_iterator
>      operator--(int)
>      { return __normal_iterator(_M_current--); }
>
>
>      reference
>      operator[](const difference_type& __n) const
>      { return _M_current[__n]; }
>
>      __normal_iterator&
>      operator+=(const difference_type& __n)
>      { _M_current += __n; return *this; }
>
>      __normal_iterator
>      operator+(const difference_type& __n) const
>      { return __normal_iterator(_M_current + __n); }
>
>      __normal_iterator&
>      operator-=(const difference_type& __n)
>      { _M_current -= __n; return *this; }
>
>      __normal_iterator
>      operator-(const difference_type& __n) const
>      { return __normal_iterator(_M_current - __n); }
>
>      const _Iterator&
>      base() const
>      { return _M_current; }
>    };
># 678 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_iterator.h" 3
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator==(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() == __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() != __rhs.base(); }
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() < __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>(const __normal_iterator<_Iterator, _Container>& __lhs,
>       const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() > __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() <= __rhs.base(); }
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
>        const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline bool
>    operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,
>        const __normal_iterator<_Iterator, _Container>& __rhs)
>    { return __lhs.base() >= __rhs.base(); }
>
>
>
>
>
>  template<typename _IteratorL, typename _IteratorR, typename _Container>
>    inline typename __normal_iterator<_IteratorL, _Container>::difference_type
>    operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
>       const __normal_iterator<_IteratorR, _Container>& __rhs)
>    { return __lhs.base() - __rhs.base(); }
>
>  template<typename _Iterator, typename _Container>
>    inline __normal_iterator<_Iterator, _Container>
>    operator+(typename __normal_iterator<_Iterator, _Container>::difference_type
>       __n, const __normal_iterator<_Iterator, _Container>& __i)
>    { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }
>}
># 75 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/debug/debug.h" 1 3
># 272 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/debug/debug.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cassert" 1 3
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cassert" 3
>       
># 47 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cassert" 3
>
># 1 "/usr/include/assert.h" 1 3 4
># 48 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/cassert" 2 3
># 273 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/debug/debug.h" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 275 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/debug/debug.h" 2 3
>
>
>
>namespace __gnu_debug
>{
>  template<typename _Iterator, typename _Sequence>
>    class _Safe_iterator;
>
>
>  inline bool
>  __check_singular_aux(const void*) { return false; }
>
>
>
>  template<typename _Iterator>
>    inline bool
>    __check_singular(_Iterator& __x)
>    { return __gnu_debug::__check_singular_aux(&__x); }
>
>
>  template<typename _Tp>
>    inline bool
>    __check_singular(const _Tp* __ptr)
>    { return __ptr == 0; }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __check_singular(const _Safe_iterator<_Iterator, _Sequence>& __x)
>    { return __x._M_singular(); }
>
>
>
>  template<typename _Iterator>
>    inline bool
>    __check_dereferenceable(_Iterator&)
>    { return true; }
>
>
>  template<typename _Tp>
>    inline bool
>    __check_dereferenceable(const _Tp* __ptr)
>    { return __ptr; }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __check_dereferenceable(const _Safe_iterator<_Iterator, _Sequence>& __x)
>    { return __x._M_dereferenceable(); }
>
>
>
>
>  template<typename _RandomAccessIterator>
>    inline bool
>    __valid_range_aux2(const _RandomAccessIterator& __first,
>         const _RandomAccessIterator& __last,
>         std::random_access_iterator_tag)
>    { return __last - __first >= 0; }
>
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range_aux2(const _InputIterator&, const _InputIterator&,
>         std::input_iterator_tag)
>    { return true; }
>
>
>
>
>
>  template<typename _Integral>
>    inline bool
>    __valid_range_aux(const _Integral&, const _Integral&, __true_type)
>    { return true; }
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range_aux(const _InputIterator& __first,
>        const _InputIterator& __last, __false_type)
>  {
>    typedef typename std::iterator_traits<_InputIterator>::iterator_category
>      _Category;
>    return __gnu_debug::__valid_range_aux2(__first, __last, _Category());
>  }
>
>
>
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __valid_range(const _InputIterator& __first, const _InputIterator& __last)
>    {
>      typedef typename std::__is_integer<_InputIterator>::__type _Integral;
>      return __gnu_debug::__valid_range_aux(__first, __last, _Integral());
>    }
>
>
>  template<typename _Iterator, typename _Sequence>
>    inline bool
>    __valid_range(const _Safe_iterator<_Iterator, _Sequence>& __first,
>    const _Safe_iterator<_Iterator, _Sequence>& __last)
>    { return __first._M_valid_range(__last); }
>
>
>
>
>
>  template<typename _InputIterator>
>    inline _InputIterator
>    __check_valid_range(const _InputIterator& __first,
>   const _InputIterator& __last)
>    {
>      ;
>      return __first;
>    }
>
>
>  template<typename _CharT, typename _Integer>
>    inline const _CharT*
>    __check_string(const _CharT* __s, const _Integer& __n)
>    {
>
>
>
>      return __s;
>    }
>
>
>  template<typename _CharT>
>    inline const _CharT*
>    __check_string(const _CharT* __s)
>    {
>
>
>
>      return __s;
>    }
>
>
>
>  template<typename _InputIterator>
>    inline bool
>    __check_sorted_aux(const _InputIterator&, const _InputIterator&,
>                       std::input_iterator_tag)
>    { return true; }
>
>
>
>  template<typename _ForwardIterator>
>    inline bool
>    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
>                       std::forward_iterator_tag)
>    {
>      if (__first == __last)
>        return true;
>
>      _ForwardIterator __next = __first;
>      for (++__next; __next != __last; __first = __next, ++__next) {
>        if (*__next < *__first)
>          return false;
>      }
>
>      return true;
>    }
>
>
>
>  template<typename _InputIterator, typename _Predicate>
>    inline bool
>    __check_sorted_aux(const _InputIterator&, const _InputIterator&,
>                       _Predicate, std::input_iterator_tag)
>    { return true; }
>
>
>
>  template<typename _ForwardIterator, typename _Predicate>
>    inline bool
>    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
>                       _Predicate __pred, std::forward_iterator_tag)
>    {
>      if (__first == __last)
>        return true;
>
>      _ForwardIterator __next = __first;
>      for (++__next; __next != __last; __first = __next, ++__next) {
>        if (__pred(*__next, *__first))
>          return false;
>      }
>
>      return true;
>    }
>
>
>  template<typename _InputIterator>
>    inline bool
>    __check_sorted(const _InputIterator& __first, const _InputIterator& __last)
>    {
>      typedef typename std::iterator_traits<_InputIterator>::iterator_category
>        _Category;
>      return __gnu_debug::__check_sorted_aux(__first, __last, _Category());
>    }
>
>  template<typename _InputIterator, typename _Predicate>
>    inline bool
>    __check_sorted(const _InputIterator& __first, const _InputIterator& __last,
>                   _Predicate __pred)
>    {
>      typedef typename std::iterator_traits<_InputIterator>::iterator_category
>        _Category;
>      return __gnu_debug::__check_sorted_aux(__first, __last, __pred,
>          _Category());
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline bool
>    __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
>   const _Tp& __value)
>    {
>      while (__first != __last && *__first < __value)
> ++__first;
>      while (__first != __last && !(*__first < __value))
> ++__first;
>      return __first == __last;
>    }
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _Pred>
>    inline bool
>    __check_partitioned(_ForwardIterator __first, _ForwardIterator __last,
>   const _Tp& __value, _Pred __pred)
>    {
>      while (__first != __last && __pred(*__first, __value))
> ++__first;
>      while (__first != __last && !__pred(*__first, __value))
> ++__first;
>      return __first == __last;
>    }
>}
># 77 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 2 3
>
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline void
>    swap(_Tp& __a, _Tp& __b)
>    {
>
>     
>
>      _Tp __tmp = __a;
>      __a = __b;
>      __b = __tmp;
>    }
>
>
>
>
>  template<bool _BoolType>
>    struct __iter_swap
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          typedef typename iterator_traits<_ForwardIterator1>::value_type
>            _ValueType1;
>          _ValueType1 __tmp = *__a;
>          *__a = *__b;
>          *__b = __tmp;
> }
>    };
>
>  template<>
>    struct __iter_swap<true>
>    {
>      template<typename _ForwardIterator1, typename _ForwardIterator2>
>        static void
>        iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>        {
>          swap(*__a, *__b);
>        }
>    };
># 140 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator1, typename _ForwardIterator2>
>    inline void
>    iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
>    {
>      typedef typename iterator_traits<_ForwardIterator1>::value_type
> _ValueType1;
>      typedef typename iterator_traits<_ForwardIterator2>::value_type
> _ValueType2;
>
>
>     
>
>     
>
>     
>
>     
>
>
>      typedef typename iterator_traits<_ForwardIterator1>::reference
> _ReferenceType1;
>      typedef typename iterator_traits<_ForwardIterator2>::reference
> _ReferenceType2;
>      std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value &&
> __are_same<_ValueType1 &, _ReferenceType1>::__value &&
> __are_same<_ValueType2 &, _ReferenceType2>::__value>::
> iter_swap(__a, __b);
>    }
># 182 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    min(const _Tp& __a, const _Tp& __b)
>    {
>
>     
>
>      if (__b < __a)
> return __b;
>      return __a;
>    }
># 204 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _Tp>
>    inline const _Tp&
>    max(const _Tp& __a, const _Tp& __b)
>    {
>
>     
>
>      if (__a < __b)
> return __b;
>      return __a;
>    }
># 226 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    min(const _Tp& __a, const _Tp& __b, _Compare __comp)
>    {
>
>      if (__comp(__b, __a))
> return __b;
>      return __a;
>    }
># 246 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _Tp, typename _Compare>
>    inline const _Tp&
>    max(const _Tp& __a, const _Tp& __b, _Compare __comp)
>    {
>
>      if (__comp(__a, __b))
> return __b;
>      return __a;
>    }
>
>
>
>
>
>
>
>  template<bool, typename>
>    struct __copy
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_II __first, _II __last, _OI __result)
>        {
>   for (; __first != __last; ++__result, ++__first)
>     *__result = *__first;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy(_II __first, _II __last, _OI __result)
>        {
>   typedef typename iterator_traits<_II>::difference_type _Distance;
>   for(_Distance __n = __last - __first; __n > 0; --__n)
>     {
>       *__result = *__first;
>       ++__first;
>       ++__result;
>     }
>   return __result;
> }
>    };
>
>  template<>
>    struct __copy<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   std::memmove(__result, __first, sizeof(_Tp) * (__last - __first));
>   return __result + (__last - __first);
> }
>    };
>
>  template<typename _II, typename _OI>
>    inline _OI
>    __copy_aux(_II __first, _II __last, _OI __result)
>    {
>      typedef typename iterator_traits<_II>::value_type _ValueTypeI;
>      typedef typename iterator_traits<_OI>::value_type _ValueTypeO;
>      typedef typename iterator_traits<_II>::iterator_category _Category;
>      const bool __simple = (__is_scalar<_ValueTypeI>::__value
>                      && __is_pointer<_II>::__value
>                      && __is_pointer<_OI>::__value
>        && __are_same<_ValueTypeI, _ValueTypeO>::__value);
>
>      return std::__copy<__simple, _Category>::copy(__first, __last, __result);
>    }
>
>  template<bool, bool>
>    struct __copy_normal
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_normal<true, false>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return std::__copy_aux(__first.base(), __last.base(), __result); }
>    };
>
>  template<>
>    struct __copy_normal<false, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first, __last, __result.base())); }
>    };
>
>  template<>
>    struct __copy_normal<true, true>
>    {
>      template<typename _II, typename _OI>
>        static _OI
>        copy_n(_II __first, _II __last, _OI __result)
>        { return _OI(std::__copy_aux(__first.base(), __last.base(),
>         __result.base())); }
>    };
># 373 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator, typename _OutputIterator>
>    inline _OutputIterator
>    copy(_InputIterator __first, _InputIterator __last,
>  _OutputIterator __result)
>    {
>
>     
>     
>
>      ;
>
>       const bool __in = __is_normal_iterator<_InputIterator>::__value;
>       const bool __out = __is_normal_iterator<_OutputIterator>::__value;
>       return std::__copy_normal<__in, __out>::copy_n(__first, __last,
>            __result);
>    }
>
>  template<bool, typename>
>    struct __copy_backward
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   while (__first != __last)
>     *--__result = *--__last;
>   return __result;
> }
>    };
>
>  template<bool _BoolType>
>    struct __copy_backward<_BoolType, random_access_iterator_tag>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b(_BI1 __first, _BI1 __last, _BI2 __result)
>        {
>   typename iterator_traits<_BI1>::difference_type __n;
>   for (__n = __last - __first; __n > 0; --__n)
>     *--__result = *--__last;
>   return __result;
> }
>    };
>
>  template<>
>    struct __copy_backward<true, random_access_iterator_tag>
>    {
>      template<typename _Tp>
>        static _Tp*
>        copy_b(const _Tp* __first, const _Tp* __last, _Tp* __result)
>        {
>   const ptrdiff_t _Num = __last - __first;
>   std::memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
>   return __result - _Num;
> }
>    };
>
>  template<typename _BI1, typename _BI2>
>    inline _BI2
>    __copy_backward_aux(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>      typedef typename iterator_traits<_BI1>::value_type _ValueType1;
>      typedef typename iterator_traits<_BI2>::value_type _ValueType2;
>      typedef typename iterator_traits<_BI1>::iterator_category _Category;
>      const bool __simple = (__is_scalar<_ValueType1>::__value
>                      && __is_pointer<_BI1>::__value
>                      && __is_pointer<_BI2>::__value
>        && __are_same<_ValueType1, _ValueType2>::__value);
>
>      return std::__copy_backward<__simple, _Category>::copy_b(__first, __last,
>              __result);
>    }
>
>  template<bool, bool>
>    struct __copy_backward_normal
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first, __last, __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, false>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return std::__copy_backward_aux(__first.base(), __last.base(),
>       __result); }
>    };
>
>  template<>
>    struct __copy_backward_normal<false, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first, __last,
>            __result.base())); }
>    };
>
>  template<>
>    struct __copy_backward_normal<true, true>
>    {
>      template<typename _BI1, typename _BI2>
>        static _BI2
>        copy_b_n(_BI1 __first, _BI1 __last, _BI2 __result)
>        { return _BI2(std::__copy_backward_aux(__first.base(), __last.base(),
>            __result.base())); }
>    };
># 502 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template <typename _BI1, typename _BI2>
>    inline _BI2
>    copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      const bool __bi1 = __is_normal_iterator<_BI1>::__value;
>      const bool __bi2 = __is_normal_iterator<_BI2>::__value;
>      return std::__copy_backward_normal<__bi1, __bi2>::copy_b_n(__first, __last,
>         __result);
>    }
>
>  template<bool>
>    struct __fill
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   for (; __first != __last; ++__first)
>     *__first = __value;
> }
>    };
>
>  template<>
>    struct __fill<true>
>    {
>      template<typename _ForwardIterator, typename _Tp>
>        static void
>        fill(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __first != __last; ++__first)
>     *__first = __tmp;
> }
>    };
># 558 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
>    {
>
>     
>
>      ;
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      std::__fill<__scalar>::fill(__first, __last, __value);
>    }
>
>
>  inline void
>  fill(unsigned char* __first, unsigned char* __last, const unsigned char& __c)
>  {
>    ;
>    const unsigned char __tmp = __c;
>    std::memset(__first, __tmp, __last - __first);
>  }
>
>  inline void
>  fill(signed char* __first, signed char* __last, const signed char& __c)
>  {
>    ;
>    const signed char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  inline void
>  fill(char* __first, char* __last, const char& __c)
>  {
>    ;
>    const char __tmp = __c;
>    std::memset(__first, static_cast<unsigned char>(__tmp), __last - __first);
>  }
>
>  template<bool>
>    struct __fill_n
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   for (; __n > 0; --__n, ++__first)
>     *__first = __value;
>   return __first;
> }
>    };
>
>  template<>
>    struct __fill_n<true>
>    {
>      template<typename _OutputIterator, typename _Size, typename _Tp>
>        static _OutputIterator
>        fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>        {
>   const _Tp __tmp = __value;
>   for (; __n > 0; --__n, ++__first)
>     *__first = __tmp;
>   return __first;
> }
>    };
># 634 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _OutputIterator, typename _Size, typename _Tp>
>    _OutputIterator
>    fill_n(_OutputIterator __first, _Size __n, const _Tp& __value)
>    {
>
>     
>
>      const bool __scalar = __is_scalar<_Tp>::__value;
>      return std::__fill_n<__scalar>::fill_n(__first, __n, __value);
>    }
>
>  template<typename _Size>
>    inline unsigned char*
>    fill_n(unsigned char* __first, _Size __n, const unsigned char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline signed char*
>    fill_n(char* __first, _Size __n, const signed char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
>
>  template<typename _Size>
>    inline char*
>    fill_n(char* __first, _Size __n, const char& __c)
>    {
>      std::fill(__first, __first + __n, __c);
>      return __first + __n;
>    }
># 681 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    pair<_InputIterator1, _InputIterator2>
>    mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      while (__first1 != __last1 && *__first1 == *__first2)
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
># 716 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    pair<_InputIterator1, _InputIterator2>
>    mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
>      _InputIterator2 __first2, _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      while (__first1 != __last1 && __binary_pred(*__first1, *__first2))
>        {
>   ++__first1;
>   ++__first2;
>        }
>      return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
>    }
># 746 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2)
>    {
>
>     
>     
>     
>
>
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!(*__first1 == *__first2))
>   return false;
>      return true;
>    }
># 778 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _BinaryPredicate>
>    inline bool
>    equal(_InputIterator1 __first1, _InputIterator1 __last1,
>   _InputIterator2 __first2,
>   _BinaryPredicate __binary_pred)
>    {
>
>     
>     
>      ;
>
>      for (; __first1 != __last1; ++__first1, ++__first2)
> if (!__binary_pred(*__first1, *__first2))
>   return false;
>      return true;
>    }
># 810 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2)
>    {
>
>     
>     
>     
>
>
>     
>
>
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (*__first1 < *__first2)
>     return true;
>   if (*__first2 < *__first1)
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
># 850 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_algobase.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _Compare>
>    bool
>    lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1,
>       _InputIterator2 __first2, _InputIterator2 __last2,
>       _Compare __comp)
>    {
>
>     
>     
>      ;
>      ;
>
>      for (; __first1 != __last1 && __first2 != __last2;
>    ++__first1, ++__first2)
> {
>   if (__comp(*__first1, *__first2))
>     return true;
>   if (__comp(*__first2, *__first1))
>     return false;
> }
>      return __first1 == __last1 && __first2 != __last2;
>    }
>
>  inline bool
>  lexicographical_compare(const unsigned char* __first1,
>     const unsigned char* __last1,
>     const unsigned char* __first2,
>     const unsigned char* __last2)
>  {
>    ;
>    ;
>
>    const size_t __len1 = __last1 - __first1;
>    const size_t __len2 = __last2 - __first2;
>    const int __result = std::memcmp(__first1, __first2,
>         std::min(__len1, __len2));
>    return __result != 0 ? __result < 0 : __len1 < __len2;
>  }
>
>  inline bool
>  lexicographical_compare(const char* __first1, const char* __last1,
>     const char* __first2, const char* __last2)
>  {
>    ;
>    ;
>
>
>    return std::lexicographical_compare((const signed char*) __first1,
>     (const signed char*) __last1,
>     (const signed char*) __first2,
>     (const signed char*) __last2);
>
>
>
>
>
>
>  }
>
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/allocator.h" 1 3
># 52 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++allocator.h" 1 3
># 34 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ext/mt_allocator.h" 1 3
># 41 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ext/mt_allocator.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/atomicity.h" 1 3
># 38 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/atomicity.h" 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/atomic_word.h" 1 3
># 33 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/atomic_word.h" 3
>typedef int _Atomic_word;
># 39 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/atomicity.h" 2 3
>
>namespace __gnu_cxx
>{
>  _Atomic_word
>  __attribute__ ((__unused__))
>  __exchange_and_add(volatile _Atomic_word* __mem, int __val);
>
>  void
>  __attribute__ ((__unused__))
>  __atomic_add(volatile _Atomic_word* __mem, int __val);
>}
># 42 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ext/mt_allocator.h" 2 3
>
>namespace __gnu_cxx
>{
>  typedef void (*__destroy_handler)(void*);
>
>
>  struct __pool_base
>  {
>
>
>    typedef unsigned short int _Binmap_type;
>
>
>
>    struct _Tune
>     {
>
>      enum { _S_align = 8 };
>      enum { _S_max_bytes = 128 };
>      enum { _S_min_bin = 8 };
>      enum { _S_chunk_size = 4096 - 4 * sizeof(void*) };
>      enum { _S_max_threads = 4096 };
>      enum { _S_freelist_headroom = 10 };
>
>
>
>
>      size_t _M_align;
>
>
>
>
>      size_t _M_max_bytes;
>
>
>
>      size_t _M_min_bin;
>
>
>
>
>
>
>      size_t _M_chunk_size;
>
>
>
>
>
>
>
>      size_t _M_max_threads;
>
>
>
>
>
>
>
>      size_t _M_freelist_headroom;
>
>
>      bool _M_force_new;
>
>      explicit
>      _Tune()
>      : _M_align(_S_align), _M_max_bytes(_S_max_bytes), _M_min_bin(_S_min_bin),
>      _M_chunk_size(_S_chunk_size), _M_max_threads(_S_max_threads),
>      _M_freelist_headroom(_S_freelist_headroom),
>      _M_force_new(getenv("GLIBCXX_FORCE_NEW") ? true : false)
>      { }
>
>      explicit
>      _Tune(size_t __align, size_t __maxb, size_t __minbin, size_t __chunk,
>     size_t __maxthreads, size_t __headroom, bool __force)
>      : _M_align(__align), _M_max_bytes(__maxb), _M_min_bin(__minbin),
>      _M_chunk_size(__chunk), _M_max_threads(__maxthreads),
>      _M_freelist_headroom(__headroom), _M_force_new(__force)
>      { }
>    };
>
>    struct _Block_address
>    {
>      void* _M_initial;
>      _Block_address* _M_next;
>    };
>
>    const _Tune&
>    _M_get_options() const
>    { return _M_options; }
>
>    void
>    _M_set_options(_Tune __t)
>    {
>      if (!_M_init)
> _M_options = __t;
>    }
>
>    bool
>    _M_check_threshold(size_t __bytes)
>    { return __bytes > _M_options._M_max_bytes || _M_options._M_force_new; }
>
>    size_t
>    _M_get_binmap(size_t __bytes)
>    { return _M_binmap[__bytes]; }
>
>    const size_t
>    _M_get_align()
>    { return _M_options._M_align; }
>
>    explicit
>    __pool_base()
>    : _M_options(_Tune()), _M_binmap(__null), _M_init(false) { }
>
>    explicit
>    __pool_base(const _Tune& __options)
>    : _M_options(__options), _M_binmap(__null), _M_init(false) { }
>
>  private:
>    explicit
>    __pool_base(const __pool_base&);
>
>    __pool_base&
>    operator=(const __pool_base&);
>
>  protected:
>
>    _Tune _M_options;
>
>    _Binmap_type* _M_binmap;
>
>
>
>
>    bool _M_init;
>  };
>
>
>
>
>
>
>  template<bool _Thread>
>    class __pool;
>
>
>  template<>
>    class __pool<false> : public __pool_base
>    {
>    public:
>      union _Block_record
>      {
>
> _Block_record* volatile _M_next;
>      };
>
>      struct _Bin_record
>      {
>
> _Block_record** volatile _M_first;
>
>
> _Block_address* _M_address;
>      };
>
>      void
>      _M_initialize_once()
>      {
> if (__builtin_expect(_M_init == false, false))
>   _M_initialize();
>      }
>
>      void
>      _M_destroy() throw();
>
>      char*
>      _M_reserve_block(size_t __bytes, const size_t __thread_id);
>
>      void
>      _M_reclaim_block(char* __p, size_t __bytes);
>
>      size_t
>      _M_get_thread_id() { return 0; }
>
>      const _Bin_record&
>      _M_get_bin(size_t __which)
>      { return _M_bin[__which]; }
>
>      void
>      _M_adjust_freelist(const _Bin_record&, _Block_record*, size_t)
>      { }
>
>      explicit __pool()
>      : _M_bin(__null), _M_bin_size(1) { }
>
>      explicit __pool(const __pool_base::_Tune& __tune)
>      : __pool_base(__tune), _M_bin(__null), _M_bin_size(1) { }
>
>    private:
>
>
>
>      _Bin_record* volatile _M_bin;
>
>
>      size_t _M_bin_size;
>
>      void
>      _M_initialize();
>  };
>
>
>
>  template<>
>    class __pool<true> : public __pool_base
>    {
>    public:
># 268 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ext/mt_allocator.h" 3
>      struct _Thread_record
>      {
>
> _Thread_record* volatile _M_next;
>
>
> size_t _M_id;
>      };
>
>      union _Block_record
>      {
>
> _Block_record* volatile _M_next;
>
>
> size_t _M_thread_id;
>      };
>
>      struct _Bin_record
>      {
>
>
>
> _Block_record** volatile _M_first;
>
>
> _Block_address* _M_address;
>
>
>
>
>
> size_t* volatile _M_free;
> size_t* volatile _M_used;
>
>
>
>
> __gthread_mutex_t* _M_mutex;
>      };
>
>
>      void
>      _M_initialize(__destroy_handler);
>
>      void
>      _M_initialize_once()
>      {
> if (__builtin_expect(_M_init == false, false))
>   _M_initialize();
>      }
>
>      void
>      _M_destroy() throw();
>
>      char*
>      _M_reserve_block(size_t __bytes, const size_t __thread_id);
>
>      void
>      _M_reclaim_block(char* __p, size_t __bytes);
>
>      const _Bin_record&
>      _M_get_bin(size_t __which)
>      { return _M_bin[__which]; }
>
>      void
>      _M_adjust_freelist(const _Bin_record& __bin, _Block_record* __block,
>    size_t __thread_id)
>      {
> if (__gthread_active_p())
>   {
>     __block->_M_thread_id = __thread_id;
>     --__bin._M_free[__thread_id];
>     ++__bin._M_used[__thread_id];
>   }
>      }
>
>
>      void
>      _M_destroy_thread_key(void*);
>
>      size_t
>      _M_get_thread_id();
>
>      explicit __pool()
>      : _M_bin(__null), _M_bin_size(1), _M_thread_freelist(__null)
>      { }
>
>      explicit __pool(const __pool_base::_Tune& __tune)
>      : __pool_base(__tune), _M_bin(__null), _M_bin_size(1),
>      _M_thread_freelist(__null)
>      { }
>
>    private:
>
>
>
>      _Bin_record* volatile _M_bin;
>
>
>      size_t _M_bin_size;
>
>      _Thread_record* _M_thread_freelist;
>      void* _M_thread_freelist_initial;
>
>      void
>      _M_initialize();
>    };
>
>
>  template<template <bool> class _PoolTp, bool _Thread>
>    struct __common_pool
>    {
>      typedef _PoolTp<_Thread> pool_type;
>
>      static pool_type&
>      _S_get_pool()
>      {
> static pool_type _S_pool;
> return _S_pool;
>      }
>    };
>
>  template<template <bool> class _PoolTp, bool _Thread>
>    struct __common_pool_base;
>
>  template<template <bool> class _PoolTp>
>    struct __common_pool_base<_PoolTp, false>
>    : public __common_pool<_PoolTp, false>
>    {
>      using __common_pool<_PoolTp, false>::_S_get_pool;
>
>      static void
>      _S_initialize_once()
>      {
> static bool __init;
> if (__builtin_expect(__init == false, false))
>   {
>     _S_get_pool()._M_initialize_once();
>     __init = true;
>   }
>      }
>    };
>
>
>  template<template <bool> class _PoolTp>
>    struct __common_pool_base<_PoolTp, true>
>    : public __common_pool<_PoolTp, true>
>    {
>      using __common_pool<_PoolTp, true>::_S_get_pool;
>
>      static void
>      _S_initialize()
>      { _S_get_pool()._M_initialize_once(); }
>
>      static void
>      _S_initialize_once()
>      {
> static bool __init;
> if (__builtin_expect(__init == false, false))
>   {
>     if (__gthread_active_p())
>       {
>
>  static __gthread_once_t __once = 0;
>  __gthread_once(&__once, _S_initialize);
>       }
>
>
>
>
>     _S_get_pool()._M_initialize_once();
>     __init = true;
>   }
>      }
>    };
>
>
>
>  template<template <bool> class _PoolTp, bool _Thread>
>    struct __common_pool_policy : public __common_pool_base<_PoolTp, _Thread>
>    {
>      template<typename _Tp1, template <bool> class _PoolTp1 = _PoolTp,
>        bool _Thread1 = _Thread>
>        struct _M_rebind
>        { typedef __common_pool_policy<_PoolTp1, _Thread1> other; };
>
>      using __common_pool_base<_PoolTp, _Thread>::_S_get_pool;
>      using __common_pool_base<_PoolTp, _Thread>::_S_initialize_once;
>  };
>
>
>  template<typename _Tp, template <bool> class _PoolTp, bool _Thread>
>    struct __per_type_pool
>    {
>      typedef _Tp value_type;
>      typedef _PoolTp<_Thread> pool_type;
>
>      static pool_type&
>      _S_get_pool()
>      {
>
> typedef typename pool_type::_Block_record _Block_record;
> const static size_t __a = (__alignof__(_Tp) >= sizeof(_Block_record)
>       ? __alignof__(_Tp) : sizeof(_Block_record));
>
> typedef typename __pool_base::_Tune _Tune;
> static _Tune _S_tune(__a, sizeof(_Tp) * 64,
>        sizeof(_Tp) * 2 >= __a ? sizeof(_Tp) * 2 : __a,
>        sizeof(_Tp) * size_t(_Tune::_S_chunk_size),
>        _Tune::_S_max_threads,
>        _Tune::_S_freelist_headroom,
>        getenv("GLIBCXX_FORCE_NEW") ? true : false);
> static pool_type _S_pool(_S_tune);
> return _S_pool;
>      }
>    };
>
>  template<typename _Tp, template <bool> class _PoolTp, bool _Thread>
>    struct __per_type_pool_base;
>
>  template<typename _Tp, template <bool> class _PoolTp>
>    struct __per_type_pool_base<_Tp, _PoolTp, false>
>    : public __per_type_pool<_Tp, _PoolTp, false>
>    {
>      using __per_type_pool<_Tp, _PoolTp, false>::_S_get_pool;
>
>      static void
>      _S_initialize_once()
>      {
> static bool __init;
> if (__builtin_expect(__init == false, false))
>   {
>     _S_get_pool()._M_initialize_once();
>     __init = true;
>   }
>      }
>    };
>
>
> template<typename _Tp, template <bool> class _PoolTp>
>    struct __per_type_pool_base<_Tp, _PoolTp, true>
>    : public __per_type_pool<_Tp, _PoolTp, true>
>    {
>      using __per_type_pool<_Tp, _PoolTp, true>::_S_get_pool;
>
>      static void
>      _S_initialize()
>      { _S_get_pool()._M_initialize_once(); }
>
>      static void
>      _S_initialize_once()
>      {
> static bool __init;
> if (__builtin_expect(__init == false, false))
>   {
>     if (__gthread_active_p())
>       {
>
>  static __gthread_once_t __once = 0;
>  __gthread_once(&__once, _S_initialize);
>       }
>
>
>
>
>     _S_get_pool()._M_initialize_once();
>     __init = true;
>   }
>      }
>    };
>
>
>
>  template<typename _Tp, template <bool> class _PoolTp, bool _Thread>
>    struct __per_type_pool_policy
>    : public __per_type_pool_base<_Tp, _PoolTp, _Thread>
>    {
>      template<typename _Tp1, template <bool> class _PoolTp1 = _PoolTp,
>        bool _Thread1 = _Thread>
>        struct _M_rebind
>        { typedef __per_type_pool_policy<_Tp1, _PoolTp1, _Thread1> other; };
>
>      using __per_type_pool_base<_Tp, _PoolTp, _Thread>::_S_get_pool;
>      using __per_type_pool_base<_Tp, _PoolTp, _Thread>::_S_initialize_once;
>  };
>
>
>
>  template<typename _Tp>
>    class __mt_alloc_base
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      pointer
>      address(reference __x) const
>      { return &__x; }
>
>      const_pointer
>      address(const_reference __x) const
>      { return &__x; }
>
>      size_type
>      max_size() const throw()
>      { return size_t(-1) / sizeof(_Tp); }
>
>
>
>      void
>      construct(pointer __p, const _Tp& __val)
>      { ::new(__p) _Tp(__val); }
>
>      void
>      destroy(pointer __p) { __p->~_Tp(); }
>    };
># 607 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/ext/mt_allocator.h" 3
>  template<typename _Tp,
>    typename _Poolp = __common_pool_policy<__pool, true> >
>    class __mt_alloc : public __mt_alloc_base<_Tp>
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>      typedef _Poolp __policy_type;
>      typedef typename _Poolp::pool_type __pool_type;
>
>      template<typename _Tp1, typename _Poolp1 = _Poolp>
>        struct rebind
>        {
>   typedef typename _Poolp1::template _M_rebind<_Tp1>::other pol_type;
>   typedef __mt_alloc<_Tp1, pol_type> other;
> };
>
>      __mt_alloc() throw() { }
>
>      __mt_alloc(const __mt_alloc&) throw() { }
>
>      template<typename _Tp1, typename _Poolp1>
>        __mt_alloc(const __mt_alloc<_Tp1, _Poolp1>& obj) throw() { }
>
>      ~__mt_alloc() throw() { }
>
>      pointer
>      allocate(size_type __n, const void* = 0);
>
>      void
>      deallocate(pointer __p, size_type __n);
>
>      const __pool_base::_Tune
>      _M_get_options()
>      {
>
> return __policy_type::_S_get_pool()._M_get_options();
>      }
>
>      void
>      _M_set_options(__pool_base::_Tune __t)
>      { __policy_type::_S_get_pool()._M_set_options(__t); }
>    };
>
>  template<typename _Tp, typename _Poolp>
>    typename __mt_alloc<_Tp, _Poolp>::pointer
>    __mt_alloc<_Tp, _Poolp>::
>    allocate(size_type __n, const void*)
>    {
>      if (__builtin_expect(__n > this->max_size(), false))
> std::__throw_bad_alloc();
>
>      __policy_type::_S_initialize_once();
>
>
>
>      __pool_type& __pool = __policy_type::_S_get_pool();
>      const size_t __bytes = __n * sizeof(_Tp);
>      if (__pool._M_check_threshold(__bytes))
> {
>   void* __ret = ::operator new(__bytes);
>   return static_cast<_Tp*>(__ret);
> }
>
>
>      const size_t __which = __pool._M_get_binmap(__bytes);
>      const size_t __thread_id = __pool._M_get_thread_id();
>
>
>
>      char* __c;
>      typedef typename __pool_type::_Bin_record _Bin_record;
>      const _Bin_record& __bin = __pool._M_get_bin(__which);
>      if (__bin._M_first[__thread_id])
> {
>
>   typedef typename __pool_type::_Block_record _Block_record;
>   _Block_record* __block = __bin._M_first[__thread_id];
>   __bin._M_first[__thread_id] = __block->_M_next;
>
>   __pool._M_adjust_freelist(__bin, __block, __thread_id);
>   __c = reinterpret_cast<char*>(__block) + __pool._M_get_align();
> }
>      else
> {
>
>   __c = __pool._M_reserve_block(__bytes, __thread_id);
> }
>      return static_cast<_Tp*>(static_cast<void*>(__c));
>    }
>
>  template<typename _Tp, typename _Poolp>
>    void
>    __mt_alloc<_Tp, _Poolp>::
>    deallocate(pointer __p, size_type __n)
>    {
>      if (__builtin_expect(__p != 0, true))
> {
>
>
>   __pool_type& __pool = __policy_type::_S_get_pool();
>   const size_t __bytes = __n * sizeof(_Tp);
>   if (__pool._M_check_threshold(__bytes))
>     ::operator delete(__p);
>   else
>     __pool._M_reclaim_block(reinterpret_cast<char*>(__p), __bytes);
> }
>    }
>
>  template<typename _Tp, typename _Poolp>
>    inline bool
>    operator==(const __mt_alloc<_Tp, _Poolp>&, const __mt_alloc<_Tp, _Poolp>&)
>    { return true; }
>
>  template<typename _Tp, typename _Poolp>
>    inline bool
>    operator!=(const __mt_alloc<_Tp, _Poolp>&, const __mt_alloc<_Tp, _Poolp>&)
>    { return false; }
>
>
>}
># 35 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/i386-redhat-linux/bits/c++allocator.h" 2 3
># 53 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/allocator.h" 2 3
>
>namespace std
>{
>  template<typename _Tp>
>    class allocator;
>
>
>  template<>
>    class allocator<void>
>    {
>    public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef void* pointer;
>      typedef const void* const_pointer;
>      typedef void value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>    };
>
>
>
>
>
>
>
>  template<typename _Tp>
>    class allocator: public __gnu_cxx::__mt_alloc<_Tp>
>    {
>   public:
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Tp* pointer;
>      typedef const _Tp* const_pointer;
>      typedef _Tp& reference;
>      typedef const _Tp& const_reference;
>      typedef _Tp value_type;
>
>      template<typename _Tp1>
>        struct rebind
>        { typedef allocator<_Tp1> other; };
>
>      allocator() throw() { }
>
>      allocator(const allocator& __a) throw()
>      : __gnu_cxx::__mt_alloc<_Tp>(__a) { }
>
>      template<typename _Tp1>
>        allocator(const allocator<_Tp1>&) throw() { }
>
>      ~allocator() throw() { }
>
>
>    };
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator==(const allocator<_T1>&, const allocator<_T2>&)
>    { return true; }
>
>  template<typename _T1, typename _T2>
>    inline bool
>    operator!=(const allocator<_T1>&, const allocator<_T2>&)
>    { return false; }
>
>
>
>
>
>  extern template class allocator<char>;
>  extern template class allocator<wchar_t>;
>
>
>
>
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 1 3
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 3
>namespace std
>{
>
>
>
>
>
>
>  template<typename _T1, typename _T2>
>    inline void
>    _Construct(_T1* __p, const _T2& __value)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1(__value);
>    }
>
>
>
>
>
>
>
>  template<typename _T1>
>    inline void
>    _Construct(_T1* __p)
>    {
>
>
>      ::new(static_cast<void*>(__p)) _T1();
>    }
>
>
>
>
>
>
>  template<typename _Tp>
>    inline void
>    _Destroy(_Tp* __pointer)
>    { __pointer->~_Tp(); }
># 116 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator __first, _ForwardIterator __last,
>    __false_type)
>    {
>      for (; __first != __last; ++__first)
> std::_Destroy(&*__first);
>    }
># 134 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    __destroy_aux(_ForwardIterator, _ForwardIterator, __true_type)
>    { }
># 146 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 3
>  template<typename _ForwardIterator>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type
>                       _Value_type;
>      typedef typename std::__is_scalar<_Value_type>::__type
>                _Has_trivial_destructor;
>
>      std::__destroy_aux(__first, __last, _Has_trivial_destructor());
>    }
># 166 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_construct.h" 3
>  template <typename _Tp> class allocator;
>
>  template<typename _ForwardIterator, typename _Allocator>
>    void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      _Allocator __alloc)
>    {
>      for (; __first != __last; ++__first)
> __alloc.destroy(&*__first);
>    }
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
>      allocator<_Tp>)
>    {
>      _Destroy(__first, __last);
>    }
>
>
>}
># 69 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>namespace std
>{
># 101 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Arg, class _Result>
>    struct unary_function
>    {
>      typedef _Arg argument_type;
>
>
>      typedef _Result result_type;
>    };
>
>
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    struct binary_function
>    {
>      typedef _Arg1 first_argument_type;
>
>
>      typedef _Arg2 second_argument_type;
>      typedef _Result result_type;
>    };
># 133 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct plus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x + __y; }
>    };
>
>
>  template <class _Tp>
>    struct minus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x - __y; }
>    };
>
>
>  template <class _Tp>
>    struct multiplies : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x * __y; }
>    };
>
>
>  template <class _Tp>
>    struct divides : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x / __y; }
>    };
>
>
>  template <class _Tp>
>    struct modulus : public binary_function<_Tp, _Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x % __y; }
>    };
>
>
>  template <class _Tp>
>    struct negate : public unary_function<_Tp, _Tp>
>    {
>      _Tp
>      operator()(const _Tp& __x) const
>      { return -__x; }
>    };
># 195 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x == __y; }
>    };
>
>
>  template <class _Tp>
>    struct not_equal_to : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x != __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x > __y; }
>    };
>
>
>  template <class _Tp>
>    struct less : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x < __y; }
>    };
>
>
>  template <class _Tp>
>    struct greater_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x >= __y; }
>    };
>
>
>  template <class _Tp>
>    struct less_equal : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x <= __y; }
>    };
># 256 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Tp>
>    struct logical_and : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x && __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_or : public binary_function<_Tp, _Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x, const _Tp& __y) const
>      { return __x || __y; }
>    };
>
>
>  template <class _Tp>
>    struct logical_not : public unary_function<_Tp, bool>
>    {
>      bool
>      operator()(const _Tp& __x) const
>      { return !__x; }
>    };
># 311 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Predicate>
>    class unary_negate
>    : public unary_function<typename _Predicate::argument_type, bool>
>    {
>    protected:
>      _Predicate _M_pred;
>    public:
>      explicit
>      unary_negate(const _Predicate& __x) : _M_pred(__x) {}
>
>      bool
>      operator()(const typename _Predicate::argument_type& __x) const
>      { return !_M_pred(__x); }
>    };
>
>
>  template <class _Predicate>
>    inline unary_negate<_Predicate>
>    not1(const _Predicate& __pred)
>    { return unary_negate<_Predicate>(__pred); }
>
>
>  template <class _Predicate>
>    class binary_negate
>    : public binary_function<typename _Predicate::first_argument_type,
>        typename _Predicate::second_argument_type,
>        bool>
>    {
>    protected:
>      _Predicate _M_pred;
>    public:
>      explicit
>      binary_negate(const _Predicate& __x)
>      : _M_pred(__x) { }
>
>      bool
>      operator()(const typename _Predicate::first_argument_type& __x,
>   const typename _Predicate::second_argument_type& __y) const
>      { return !_M_pred(__x, __y); }
>    };
>
>
>  template <class _Predicate>
>    inline binary_negate<_Predicate>
>    not2(const _Predicate& __pred)
>    { return binary_negate<_Predicate>(__pred); }
># 391 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Operation>
>    class binder1st
>    : public unary_function<typename _Operation::second_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::first_argument_type value;
>    public:
>      binder1st(const _Operation& __x,
>  const typename _Operation::first_argument_type& __y)
>      : op(__x), value(__y) {}
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::second_argument_type& __x) const
>      { return op(value, __x); }
>    };
>
>
>  template <class _Operation, class _Tp>
>    inline binder1st<_Operation>
>    bind1st(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::first_argument_type _Arg1_type;
>      return binder1st<_Operation>(__fn, _Arg1_type(__x));
>    }
>
>
>  template <class _Operation>
>    class binder2nd
>    : public unary_function<typename _Operation::first_argument_type,
>       typename _Operation::result_type>
>    {
>    protected:
>      _Operation op;
>      typename _Operation::second_argument_type value;
>    public:
>      binder2nd(const _Operation& __x,
>  const typename _Operation::second_argument_type& __y)
>      : op(__x), value(__y) {}
>
>      typename _Operation::result_type
>      operator()(const typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>
>
>
>      typename _Operation::result_type
>      operator()(typename _Operation::first_argument_type& __x) const
>      { return op(__x, value); }
>    };
>
>
>  template <class _Operation, class _Tp>
>    inline binder2nd<_Operation>
>    bind2nd(const _Operation& __fn, const _Tp& __x)
>    {
>      typedef typename _Operation::second_argument_type _Arg2_type;
>      return binder2nd<_Operation>(__fn, _Arg2_type(__x));
>    }
># 480 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Arg, class _Result>
>    class pointer_to_unary_function : public unary_function<_Arg, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg);
>    public:
>      pointer_to_unary_function() {}
>
>      explicit
>      pointer_to_unary_function(_Result (*__x)(_Arg))
>      : _M_ptr(__x) {}
>
>      _Result
>      operator()(_Arg __x) const
>      { return _M_ptr(__x); }
>    };
>
>
>  template <class _Arg, class _Result>
>    inline pointer_to_unary_function<_Arg, _Result>
>    ptr_fun(_Result (*__x)(_Arg))
>    { return pointer_to_unary_function<_Arg, _Result>(__x); }
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    class pointer_to_binary_function
>    : public binary_function<_Arg1, _Arg2, _Result>
>    {
>    protected:
>      _Result (*_M_ptr)(_Arg1, _Arg2);
>    public:
>      pointer_to_binary_function() {}
>
>      explicit
>      pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
>      : _M_ptr(__x) {}
>
>      _Result
>      operator()(_Arg1 __x, _Arg2 __y) const
>      { return _M_ptr(__x, __y); }
>    };
>
>
>  template <class _Arg1, class _Arg2, class _Result>
>    inline pointer_to_binary_function<_Arg1, _Arg2, _Result>
>    ptr_fun(_Result (*__x)(_Arg1, _Arg2))
>    { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); }
>
>
>  template <class _Tp>
>    struct _Identity : public unary_function<_Tp,_Tp>
>    {
>      _Tp&
>      operator()(_Tp& __x) const
>      { return __x; }
>
>      const _Tp&
>      operator()(const _Tp& __x) const
>      { return __x; }
>    };
>
>  template <class _Pair>
>    struct _Select1st : public unary_function<_Pair,
>           typename _Pair::first_type>
>    {
>      typename _Pair::first_type&
>      operator()(_Pair& __x) const
>      { return __x.first; }
>
>      const typename _Pair::first_type&
>      operator()(const _Pair& __x) const
>      { return __x.first; }
>    };
>
>  template <class _Pair>
>    struct _Select2nd : public unary_function<_Pair,
>           typename _Pair::second_type>
>    {
>      typename _Pair::second_type&
>      operator()(_Pair& __x) const
>      { return __x.second; }
>
>      const typename _Pair::second_type&
>      operator()(const _Pair& __x) const
>      { return __x.second; }
>    };
># 590 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_function.h" 3
>  template <class _Ret, class _Tp>
>    class mem_fun_t : public unary_function<_Tp*, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp* __p) const
>      { return (__p->*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)();
>    };
>
>
>  template <class _Ret, class _Tp>
>    class const_mem_fun_t : public unary_function<const _Tp*, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp* __p) const
>      { return (__p->*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Ret, class _Tp>
>    class mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      mem_fun_ref_t(_Ret (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp& __r) const
>      { return (__r.*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)();
>  };
>
>
>  template <class _Ret, class _Tp>
>    class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp& __r) const
>      { return (__r.*_M_f)(); }
>    private:
>      _Ret (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp* __p, _Arg __x) const
>      { return (__p->*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(_Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Ret, class _Tp, class _Arg>
>    class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
>    {
>    public:
>      explicit
>      const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      _Ret
>      operator()(const _Tp& __r, _Arg __x) const
>      { return (__r.*_M_f)(__x); }
>    private:
>      _Ret (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>  template <class _Tp>
>    class mem_fun_t<void, _Tp> : public unary_function<_Tp*, void>
>    {
>    public:
>      explicit
>      mem_fun_t(void (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp* __p) const
>      { (__p->*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)();
>    };
>
>
>  template <class _Tp>
>    class const_mem_fun_t<void, _Tp> : public unary_function<const _Tp*, void>
>    {
>    public:
>      explicit
>      const_mem_fun_t(void (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp* __p) const
>      { (__p->*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Tp>
>    class mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
>    {
>    public:
>      explicit
>      mem_fun_ref_t(void (_Tp::*__pf)())
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp& __r) const
>      { (__r.*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)();
>    };
>
>
>  template <class _Tp>
>    class const_mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
>    {
>    public:
>      explicit
>      const_mem_fun_ref_t(void (_Tp::*__pf)() const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp& __r) const
>      { (__r.*_M_f)(); }
>    private:
>      void (_Tp::*_M_f)() const;
>    };
>
>
>  template <class _Tp, class _Arg>
>    class mem_fun1_t<void, _Tp, _Arg> : public binary_function<_Tp*, _Arg, void>
>    {
>    public:
>      explicit
>      mem_fun1_t(void (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp* __p, _Arg __x) const
>      { (__p->*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Tp, class _Arg>
>    class const_mem_fun1_t<void, _Tp, _Arg>
>    : public binary_function<const _Tp*, _Arg, void>
>    {
>    public:
>      explicit
>      const_mem_fun1_t(void (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp* __p, _Arg __x) const
>      { (__p->*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>  template <class _Tp, class _Arg>
>    class mem_fun1_ref_t<void, _Tp, _Arg>
>    : public binary_function<_Tp, _Arg, void>
>    {
>    public:
>      explicit
>      mem_fun1_ref_t(void (_Tp::*__pf)(_Arg))
>      : _M_f(__pf) {}
>
>      void
>      operator()(_Tp& __r, _Arg __x) const
>      { (__r.*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg);
>    };
>
>
>  template <class _Tp, class _Arg>
>    class const_mem_fun1_ref_t<void, _Tp, _Arg>
>    : public binary_function<_Tp, _Arg, void>
>    {
>    public:
>      explicit
>      const_mem_fun1_ref_t(void (_Tp::*__pf)(_Arg) const)
>      : _M_f(__pf) {}
>
>      void
>      operator()(const _Tp& __r, _Arg __x) const
>      { (__r.*_M_f)(__x); }
>    private:
>      void (_Tp::*_M_f)(_Arg) const;
>    };
>
>
>
>  template <class _Ret, class _Tp>
>    inline mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)())
>    { return mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline const_mem_fun_t<_Ret, _Tp>
>    mem_fun(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)())
>    { return mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp>
>    inline const_mem_fun_ref_t<_Ret, _Tp>
>    mem_fun_ref(_Ret (_Tp::*__f)() const)
>    { return const_mem_fun_ref_t<_Ret, _Tp>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline const_mem_fun1_t<_Ret, _Tp, _Arg>
>    mem_fun(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg))
>    { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>  template <class _Ret, class _Tp, class _Arg>
>    inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg>
>    mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const)
>    { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); }
>
>
>
>}
># 70 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 2 3
>
>
>namespace std
>{
># 90 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_tree.h" 3
>  enum _Rb_tree_color { _S_red = false, _S_black = true };
>
>  struct _Rb_tree_node_base
>  {
>    typedef _Rb_tree_node_base* _Base_ptr;
>    typedef const _Rb_tree_node_base* _Const_Base_ptr;
>
>    _Rb_tree_color _M_color;
>    _Base_ptr _M_parent;
>    _Base_ptr _M_left;
>    _Base_ptr _M_right;
>
>    static _Base_ptr
>    _S_minimum(_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_minimum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_left != 0) __x = __x->_M_left;
>      return __x;
>    }
>
>    static _Base_ptr
>    _S_maximum(_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>
>    static _Const_Base_ptr
>    _S_maximum(_Const_Base_ptr __x)
>    {
>      while (__x->_M_right != 0) __x = __x->_M_right;
>      return __x;
>    }
>  };
>
>  template<typename _Val>
>    struct _Rb_tree_node : public _Rb_tree_node_base
>    {
>      typedef _Rb_tree_node<_Val>* _Link_type;
>      _Val _M_value_field;
>    };
>
>  _Rb_tree_node_base*
>  _Rb_tree_increment(_Rb_tree_node_base* __x);
>
>  const _Rb_tree_node_base*
>  _Rb_tree_increment(const _Rb_tree_node_base* __x);
>
>  _Rb_tree_node_base*
>  _Rb_tree_decrement(_Rb_tree_node_base* __x);
>
>  const _Rb_tree_node_base*
>  _Rb_tree_decrement(const _Rb_tree_node_base* __x);
>
>  template<typename _Tp>
>    struct _Rb_tree_iterator
>    {
>      typedef _Tp value_type;
>      typedef _Tp& reference;
>      typedef _Tp* pointer;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
>      typedef _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_iterator()
>      : _M_node() { }
>
>      _Rb_tree_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> return __tmp;
>      }
>
>      bool
>      operator==(const _Self& __x) const
>      { return _M_node == __x._M_node; }
>
>      bool
>      operator!=(const _Self& __x) const
>      { return _M_node != __x._M_node; }
>
>      _Base_ptr _M_node;
>  };
>
>  template<typename _Tp>
>    struct _Rb_tree_const_iterator
>    {
>      typedef _Tp value_type;
>      typedef const _Tp& reference;
>      typedef const _Tp* pointer;
>
>      typedef _Rb_tree_iterator<_Tp> iterator;
>
>      typedef bidirectional_iterator_tag iterator_category;
>      typedef ptrdiff_t difference_type;
>
>      typedef _Rb_tree_const_iterator<_Tp> _Self;
>      typedef _Rb_tree_node_base::_Const_Base_ptr _Base_ptr;
>      typedef const _Rb_tree_node<_Tp>* _Link_type;
>
>      _Rb_tree_const_iterator()
>      : _M_node() { }
>
>      _Rb_tree_const_iterator(_Link_type __x)
>      : _M_node(__x) { }
>
>      _Rb_tree_const_iterator(const iterator& __it)
>      : _M_node(__it._M_node) { }
>
>      reference
>      operator*() const
>      { return static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      pointer
>      operator->() const
>      { return &static_cast<_Link_type>(_M_node)->_M_value_field; }
>
>      _Self&
>      operator++()
>      {
> _M_node = _Rb_tree_increment(_M_node);
> return *this;
>      }
>
>      _Self
>      operator++(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_increment(_M_node);
> return __tmp;
>      }
>
>      _Self&
>      operator--()
>      {
> _M_node = _Rb_tree_decrement(_M_node);
> return *this;
>      }
>
>      _Self
>      operator--(int)
>      {
> _Self __tmp = *this;
> _M_node = _Rb_tree_decrement(_M_node);
> return __tmp;
>      }
>
>      bool
>      operator==(const _Self& __x) const
>      { return _M_node == __x._M_node; }
>
>      bool
>      operator!=(const _Self& __x) const
>      { return _M_node != __x._M_node; }
>
>      _Base_ptr _M_node;
>    };
>
>  template<typename _Val>
>    inline bool
>    operator==(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node == __y._M_node; }
>
>  template<typename _Val>
>    inline bool
>    operator!=(const _Rb_tree_iterator<_Val>& __x,
>               const _Rb_tree_const_iterator<_Val>& __y)
>    { return __x._M_node != __y._M_node; }
>
>  void
>  _Rb_tree_rotate_left(_Rb_tree_node_base* const __x,
>                       _Rb_tree_node_base*& __root);
>
>  void
>  _Rb_tree_rotate_right(_Rb_tree_node_base* const __x,
>                        _Rb_tree_node_base*& __root);
>
>  void
>  _Rb_tree_insert_and_rebalance(const bool __insert_left,
>                                _Rb_tree_node_base* __x,
>                                _Rb_tree_node_base* __p,
>                                _Rb_tree_node_base& __header);
>
>  _Rb_tree_node_base*
>  _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
>          _Rb_tree_node_base& __header);
>
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc = allocator<_Val> >
>    class _Rb_tree
>    {
>      typedef typename _Alloc::template rebind<_Rb_tree_node<_Val> >::other
>              _Node_allocator;
>
>    protected:
>      typedef _Rb_tree_node_base* _Base_ptr;
>      typedef const _Rb_tree_node_base* _Const_Base_ptr;
>      typedef _Rb_tree_node<_Val> _Rb_tree_node;
>
>    public:
>      typedef _Key key_type;
>      typedef _Val value_type;
>      typedef value_type* pointer;
>      typedef const value_type* const_pointer;
>      typedef value_type& reference;
>      typedef const value_type& const_reference;
>      typedef _Rb_tree_node* _Link_type;
>      typedef const _Rb_tree_node* _Const_Link_type;
>      typedef size_t size_type;
>      typedef ptrdiff_t difference_type;
>      typedef _Alloc allocator_type;
>
>      allocator_type
>      get_allocator() const
>      { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
>
>    protected:
>      _Rb_tree_node*
>      _M_get_node()
>      { return _M_impl._Node_allocator::allocate(1); }
>
>      void
>      _M_put_node(_Rb_tree_node* __p)
>      { _M_impl._Node_allocator::deallocate(__p, 1); }
>
>      _Link_type
>      _M_create_node(const value_type& __x)
>      {
> _Link_type __tmp = _M_get_node();
> try
>   { get_allocator().construct(&__tmp->_M_value_field, __x); }
> catch(...)
>   {
>     _M_put_node(__tmp);
>     throw;
>   }
> return __tmp;
>      }
>
>      _Link_type
>      _M_clone_node(_Const_Link_type __x)
>      {
> _Link_type __tmp = _M_create_node(__x->_M_value_field);
> __tmp->_M_color = __x->_M_color;
> __tmp->_M_left = 0;
> __tmp->_M_right = 0;
> return __tmp;
>      }
>
>      void
>      destroy_node(_Link_type __p)
>      {
> get_allocator().destroy(&__p->_M_value_field);
> _M_put_node(__p);
>      }
>
>    protected:
>      template<typename _Key_compare,
>        bool _Is_pod_comparator = std::__is_pod<_Key_compare>::__value>
>        struct _Rb_tree_impl : public _Node_allocator
>        {
>   _Key_compare _M_key_compare;
>   _Rb_tree_node_base _M_header;
>   size_type _M_node_count;
>
>   _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),
>   const _Key_compare& __comp = _Key_compare())
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
>     _M_node_count(0)
>   {
>     this->_M_header._M_color = _S_red;
>     this->_M_header._M_parent = 0;
>     this->_M_header._M_left = &this->_M_header;
>     this->_M_header._M_right = &this->_M_header;
>   }
> };
>
>
>
>      template<typename _Key_compare>
>        struct _Rb_tree_impl<_Key_compare, true> : public _Node_allocator
> {
>   _Key_compare _M_key_compare;
>   _Rb_tree_node_base _M_header;
>   size_type _M_node_count;
>
>   _Rb_tree_impl(const _Node_allocator& __a = _Node_allocator(),
>   const _Key_compare& __comp = _Key_compare())
>   : _Node_allocator(__a), _M_key_compare(__comp), _M_node_count(0)
>   {
>     this->_M_header._M_color = _S_red;
>     this->_M_header._M_parent = 0;
>     this->_M_header._M_left = &this->_M_header;
>     this->_M_header._M_right = &this->_M_header;
>   }
> };
>
>      _Rb_tree_impl<_Compare> _M_impl;
>
>    protected:
>      _Base_ptr&
>      _M_root()
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Const_Base_ptr
>      _M_root() const
>      { return this->_M_impl._M_header._M_parent; }
>
>      _Base_ptr&
>      _M_leftmost()
>      { return this->_M_impl._M_header._M_left; }
>
>      _Const_Base_ptr
>      _M_leftmost() const
>      { return this->_M_impl._M_header._M_left; }
>
>      _Base_ptr&
>      _M_rightmost()
>      { return this->_M_impl._M_header._M_right; }
>
>      _Const_Base_ptr
>      _M_rightmost() const
>      { return this->_M_impl._M_header._M_right; }
>
>      _Link_type
>      _M_begin()
>      { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
>
>      _Const_Link_type
>      _M_begin() const
>      {
> return static_cast<_Const_Link_type>
>   (this->_M_impl._M_header._M_parent);
>      }
>
>      _Link_type
>      _M_end()
>      { return static_cast<_Link_type>(&this->_M_impl._M_header); }
>
>      _Const_Link_type
>      _M_end() const
>      { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
>
>      static const_reference
>      _S_value(_Const_Link_type __x)
>      { return __x->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Link_type __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Link_type
>      _S_left(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_left); }
>
>      static _Const_Link_type
>      _S_left(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_left); }
>
>      static _Link_type
>      _S_right(_Base_ptr __x)
>      { return static_cast<_Link_type>(__x->_M_right); }
>
>      static _Const_Link_type
>      _S_right(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x->_M_right); }
>
>      static const_reference
>      _S_value(_Const_Base_ptr __x)
>      { return static_cast<_Const_Link_type>(__x)->_M_value_field; }
>
>      static const _Key&
>      _S_key(_Const_Base_ptr __x)
>      { return _KeyOfValue()(_S_value(__x)); }
>
>      static _Base_ptr
>      _S_minimum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Const_Base_ptr
>      _S_minimum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_minimum(__x); }
>
>      static _Base_ptr
>      _S_maximum(_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>      static _Const_Base_ptr
>      _S_maximum(_Const_Base_ptr __x)
>      { return _Rb_tree_node_base::_S_maximum(__x); }
>
>    public:
>      typedef _Rb_tree_iterator<value_type> iterator;
>      typedef _Rb_tree_const_iterator<value_type> const_iterator;
>
>      typedef std::reverse_iterator<iterator> reverse_iterator;
>      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
>
>    private:
>      iterator
>      _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
>
>      _Link_type
>      _M_copy(_Const_Link_type __x, _Link_type __p);
>
>      void
>      _M_erase(_Link_type __x);
>
>    public:
>
>      _Rb_tree()
>      { }
>
>      _Rb_tree(const _Compare& __comp)
>      : _M_impl(allocator_type(), __comp)
>      { }
>
>      _Rb_tree(const _Compare& __comp, const allocator_type& __a)
>      : _M_impl(__a, __comp)
>      { }
>
>      _Rb_tree(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
>      : _M_impl(__x.get_allocator(), __x._M_impl._M_key_compare)
>      {
> if (__x._M_root() != 0)
>   {
>     _M_root() = _M_copy(__x._M_begin(), _M_end());
>     _M_leftmost() = _S_minimum(_M_root());
>     _M_rightmost() = _S_maximum(_M_root());
>     _M_impl._M_node_count = __x._M_impl._M_node_count;
>   }
>      }
>
>      ~_Rb_tree()
>      { _M_erase(_M_begin()); }
>
>      _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
>      operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x);
>
>
>      _Compare
>      key_comp() const
>      { return _M_impl._M_key_compare; }
>
>      iterator
>      begin()
>      { return static_cast<_Link_type>(this->_M_impl._M_header._M_left); }
>
>      const_iterator
>      begin() const
>      {
> return static_cast<_Const_Link_type>
>   (this->_M_impl._M_header._M_left);
>      }
>
>      iterator
>      end()
>      { return static_cast<_Link_type>(&this->_M_impl._M_header); }
>
>      const_iterator
>      end() const
>      { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
>
>      reverse_iterator
>      rbegin()
>      { return reverse_iterator(end()); }
>
>      const_reverse_iterator
>      rbegin() const
>      { return const_reverse_iterator(end()); }
>
>      reverse_iterator
>      rend()
>      { return reverse_iterator(begin()); }
>
>      const_reverse_iterator
>      rend() const
>      { return const_reverse_iterator(begin()); }
>
>      bool
>      empty() const
>      { return _M_impl._M_node_count == 0; }
>
>      size_type
>      size() const
>      { return _M_impl._M_node_count; }
>
>      size_type
>      max_size() const
>      { return size_type(-1); }
>
>      void
>      swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t);
>
>
>      pair<iterator,bool>
>      insert_unique(const value_type& __x);
>
>      iterator
>      insert_equal(const value_type& __x);
>
>      iterator
>      insert_unique(iterator __position, const value_type& __x);
>
>      iterator
>      insert_equal(iterator __position, const value_type& __x);
>
>      template<typename _InputIterator>
>      void
>      insert_unique(_InputIterator __first, _InputIterator __last);
>
>      template<typename _InputIterator>
>      void
>      insert_equal(_InputIterator __first, _InputIterator __last);
>
>      void
>      erase(iterator __position);
>
>      size_type
>      erase(const key_type& __x);
>
>      void
>      erase(iterator __first, iterator __last);
>
>      void
>      erase(const key_type* __first, const key_type* __last);
>
>      void
>      clear()
>      {
>        _M_erase(_M_begin());
>        _M_leftmost() = _M_end();
>        _M_root() = 0;
>        _M_rightmost() = _M_end();
>        _M_impl._M_node_count = 0;
>      }
>
>
>      iterator
>      find(const key_type& __x);
>
>      const_iterator
>      find(const key_type& __x) const;
>
>      size_type
>      count(const key_type& __x) const;
>
>      iterator
>      lower_bound(const key_type& __x);
>
>      const_iterator
>      lower_bound(const key_type& __x) const;
>
>      iterator
>      upper_bound(const key_type& __x);
>
>      const_iterator
>      upper_bound(const key_type& __x) const;
>
>      pair<iterator,iterator>
>      equal_range(const key_type& __x);
>
>      pair<const_iterator, const_iterator>
>      equal_range(const key_type& __x) const;
>
>
>      bool
>      __rb_verify() const;
>    };
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return __x.size() == __y.size()
>      && std::equal(__x.begin(), __x.end(), __y.begin());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    {
>      return std::lexicographical_compare(__x.begin(), __x.end(),
>       __y.begin(), __y.end());
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x == __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>       const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return __y < __x; }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__y < __x); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>        const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { return !(__x < __y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x,
>  _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __y)
>    { __x.swap(__y); }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    operator=(const _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __x)
>    {
>      if (this != &__x)
> {
>
>   clear();
>   _M_impl._M_key_compare = __x._M_impl._M_key_compare;
>   if (__x._M_root() != 0)
>     {
>       _M_root() = _M_copy(__x._M_begin(), _M_end());
>       _M_leftmost() = _S_minimum(_M_root());
>       _M_rightmost() = _S_maximum(_M_root());
>       _M_impl._M_node_count = __x._M_impl._M_node_count;
>     }
> }
>      return *this;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_insert(_Base_ptr __x, _Base_ptr __p, const _Val& __v)
>    {
>      bool __insert_left = (__x != 0 || __p == _M_end()
>       || _M_impl._M_key_compare(_KeyOfValue()(__v),
>            _S_key(__p)));
>
>      _Link_type __z = _M_create_node(__v);
>
>      _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
>        this->_M_impl._M_header);
>      ++_M_impl._M_node_count;
>      return iterator(__z);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    insert_equal(const _Val& __v)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      while (__x != 0)
> {
>   __y = __x;
>   __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
>         _S_left(__x) : _S_right(__x);
> }
>      return _M_insert(__x, __y, __v);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    swap(_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>& __t)
>    {
>      if (_M_root() == 0)
>      {
> if (__t._M_root() != 0)
> {
>   _M_root() = __t._M_root();
>   _M_leftmost() = __t._M_leftmost();
>   _M_rightmost() = __t._M_rightmost();
>          _M_root()->_M_parent = _M_end();
>
>   __t._M_root() = 0;
>   __t._M_leftmost() = __t._M_end();
>   __t._M_rightmost() = __t._M_end();
> }
>      }
>      else if (__t._M_root() == 0)
>      {
> __t._M_root() = _M_root();
> __t._M_leftmost() = _M_leftmost();
> __t._M_rightmost() = _M_rightmost();
>        __t._M_root()->_M_parent = __t._M_end();
>
> _M_root() = 0;
> _M_leftmost() = _M_end();
> _M_rightmost() = _M_end();
>      }
>      else
>      {
> std::swap(_M_root(),__t._M_root());
> std::swap(_M_leftmost(),__t._M_leftmost());
> std::swap(_M_rightmost(),__t._M_rightmost());
>
> _M_root()->_M_parent = _M_end();
> __t._M_root()->_M_parent = __t._M_end();
>      }
>
>      std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
>      std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator, bool>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    insert_unique(const _Val& __v)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>      bool __comp = true;
>      while (__x != 0)
> {
>   __y = __x;
>   __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
>   __x = __comp ? _S_left(__x) : _S_right(__x);
> }
>      iterator __j = iterator(__y);
>      if (__comp)
> if (__j == begin())
>   return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
> else
>   --__j;
>      if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
> return pair<iterator, bool>(_M_insert(__x, __y, __v), true);
>      return pair<iterator, bool>(__j, false);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    insert_unique(iterator __position, const _Val& __v)
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && _M_impl._M_key_compare(_S_key(_M_rightmost()),
>     _KeyOfValue()(__v)))
>     return _M_insert(0, _M_rightmost(), __v);
>   else
>     return insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>          _S_key(__position._M_node)))
> {
>
>   iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert(_M_leftmost(), _M_leftmost(), __v);
>   else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
>       _KeyOfValue()(__v)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert(0, __before._M_node, __v);
>       else
>  return _M_insert(__position._M_node,
>     __position._M_node, __v);
>     }
>   else
>     return insert_unique(__v).first;
> }
>      else if (_M_impl._M_key_compare(_S_key(__position._M_node),
>          _KeyOfValue()(__v)))
> {
>
>   iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert(0, _M_rightmost(), __v);
>   else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
>       _S_key((++__after)._M_node)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert(0, __position._M_node, __v);
>       else
>  return _M_insert(__after._M_node, __after._M_node, __v);
>     }
>   else
>     return insert_unique(__v).first;
> }
>      else
> return __position;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    insert_equal(iterator __position, const _Val& __v)
>    {
>
>      if (__position._M_node == _M_end())
> {
>   if (size() > 0
>       && !_M_impl._M_key_compare(_KeyOfValue()(__v),
>      _S_key(_M_rightmost())))
>     return _M_insert(0, _M_rightmost(), __v);
>   else
>     return insert_equal(__v);
> }
>      else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
>           _KeyOfValue()(__v)))
> {
>
>   iterator __before = __position;
>   if (__position._M_node == _M_leftmost())
>     return _M_insert(_M_leftmost(), _M_leftmost(), __v);
>   else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
>        _S_key((--__before)._M_node)))
>     {
>       if (_S_right(__before._M_node) == 0)
>  return _M_insert(0, __before._M_node, __v);
>       else
>  return _M_insert(__position._M_node,
>     __position._M_node, __v);
>     }
>   else
>     return insert_equal(__v);
> }
>      else
> {
>
>   iterator __after = __position;
>   if (__position._M_node == _M_rightmost())
>     return _M_insert(0, _M_rightmost(), __v);
>   else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
>        _KeyOfValue()(__v)))
>     {
>       if (_S_right(__position._M_node) == 0)
>  return _M_insert(0, __position._M_node, __v);
>       else
>  return _M_insert(__after._M_node, __after._M_node, __v);
>     }
>   else
>     return insert_equal(__v);
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>      void
>      _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>      insert_equal(_II __first, _II __last)
>      {
> for (; __first != __last; ++__first)
>   insert_equal(end(), *__first);
>      }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Cmp, typename _Alloc>
>    template<class _II>
>    void
>    _Rb_tree<_Key, _Val, _KoV, _Cmp, _Alloc>::
>    insert_unique(_II __first, _II __last)
>    {
>      for (; __first != __last; ++__first)
> insert_unique(end(), *__first);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(iterator __position)
>    {
>      _Link_type __y =
> static_cast<_Link_type>(_Rb_tree_rebalance_for_erase
>    (__position._M_node,
>     this->_M_impl._M_header));
>      destroy_node(__y);
>      --_M_impl._M_node_count;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const _Key& __x)
>    {
>      pair<iterator,iterator> __p = equal_range(__x);
>      size_type __n = std::distance(__p.first, __p.second);
>      erase(__p.first, __p.second);
>      return __n;
>    }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::_Link_type
>    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
>    _M_copy(_Const_Link_type __x, _Link_type __p)
>    {
>
>      _Link_type __top = _M_clone_node(__x);
>      __top->_M_parent = __p;
>
>      try
> {
>   if (__x->_M_right)
>     __top->_M_right = _M_copy(_S_right(__x), __top);
>   __p = __top;
>   __x = _S_left(__x);
>
>   while (__x != 0)
>     {
>       _Link_type __y = _M_clone_node(__x);
>       __p->_M_left = __y;
>       __y->_M_parent = __p;
>       if (__x->_M_right)
>  __y->_M_right = _M_copy(_S_right(__x), __y);
>       __p = __y;
>       __x = _S_left(__x);
>     }
> }
>      catch(...)
> {
>   _M_erase(__top);
>   throw;
> }
>      return __top;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    _M_erase(_Link_type __x)
>    {
>
>      while (__x != 0)
> {
>   _M_erase(_S_right(__x));
>   _Link_type __y = _S_left(__x);
>   destroy_node(__x);
>   __x = __y;
> }
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(iterator __first, iterator __last)
>    {
>      if (__first == begin() && __last == end())
> clear();
>      else
> while (__first != __last)
>   erase(__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    void
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    erase(const _Key* __first, const _Key* __last)
>    {
>      while (__first != __last)
> erase(*__first++);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      iterator __j = iterator(__y);
>      return (__j == end()
>       || _M_impl._M_key_compare(__k,
>     _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    find(const _Key& __k) const
>    {
>      _Const_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>
>     while (__x != 0)
>       {
>  if (!_M_impl._M_key_compare(_S_key(__x), __k))
>    __y = __x, __x = _S_left(__x);
>  else
>    __x = _S_right(__x);
>       }
>     const_iterator __j = const_iterator(__y);
>     return (__j == end()
>      || _M_impl._M_key_compare(__k,
>           _S_key(__j._M_node))) ? end() : __j;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::size_type
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    count(const _Key& __k) const
>    {
>      pair<const_iterator, const_iterator> __p = equal_range(__k);
>      const size_type __n = std::distance(__p.first, __p.second);
>      return __n;
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    lower_bound(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    lower_bound(const _Key& __k) const
>    {
>      _Const_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>
>      while (__x != 0)
> if (!_M_impl._M_key_compare(_S_key(__x), __k))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    upper_bound(const _Key& __k)
>    {
>      _Link_type __x = _M_begin();
>      _Link_type __y = _M_end();
>
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      return iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    upper_bound(const _Key& __k) const
>    {
>      _Const_Link_type __x = _M_begin();
>      _Const_Link_type __y = _M_end();
>
>      while (__x != 0)
> if (_M_impl._M_key_compare(__k, _S_key(__x)))
>   __y = __x, __x = _S_left(__x);
> else
>   __x = _S_right(__x);
>
>      return const_iterator(__y);
>    }
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    inline
>    pair<typename _Rb_tree<_Key, _Val, _KeyOfValue,
>      _Compare, _Alloc>::iterator,
>  typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator>
>    _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::
>    equal_range(const _Key& __k)
>    { return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); }
>
>  template<typename _Key, typename _Val, typename _KoV,
>           typename _Compare, typename _Alloc>
>    inline
>    pair<typename _Rb_tree<_Key, _Val, _KoV,
>      _Compare, _Alloc>::const_iterator,
>  typename _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::const_iterator>
>    _Rb_tree<_Key, _Val, _KoV, _Compare, _Alloc>::
>    equal_range(const _Key& __k) const
>    { return pair<const_iterator, const_iterator>(lower_bound(__k),
>        upper_bound(__k)); }
>
>  unsigned int
>  _Rb_tree_black_count(const _Rb_tree_node_base* __node,
>                       const _Rb_tree_node_base* __root);
>
>  template<typename _Key, typename _Val, typename _KeyOfValue,
>           typename _Compare, typename _Alloc>
>    bool
>    _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::__rb_verify() const
>    {
>      if (_M_impl._M_node_count == 0 || begin() == end())
> return _M_impl._M_node_count == 0 && begin() == end()
>        && this->_M_impl._M_header._M_left == _M_end()
>        && this->_M_impl._M_header._M_right == _M_end();
>
>      unsigned int __len = _Rb_tree_black_count(_M_leftmost(), _M_root());
>      for (const_iterator __it = begin(); __it != end(); ++__it)
> {
>   _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
>   _Const_Link_type __L = _S_left(__x);
>   _Const_Link_type __R = _S_right(__x);
>
>   if (__x->_M_color == _S_red)
>     if ((__L && __L->_M_color == _S_red)
>  || (__R && __R->_M_color == _S_red))
>       return false;
>
>   if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
>     return false;
>   if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))
>     return false;
>
>   if (!__L && !__R && _Rb_tree_black_count(__x, _M_root()) != __len)
>     return false;
> }
>
>      if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
> return false;
>      if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))
> return false;
>      return true;
>    }
>}
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>namespace std
>{
># 89 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>  template <typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
>            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class map
>    {
>
>     
>     
>
>
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class map<_Key,_Tp,_Compare,_Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef _Rb_tree<key_type, value_type,
>         _Select1st<value_type>, key_compare, _Alloc> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::const_reference const_reference;
>      typedef typename _Rep_type::allocator_type allocator_type;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>
>      map()
>      : _M_t(_Compare(), allocator_type()) { }
>
>
>
>
>
>      explicit
>      map(const _Compare& __comp, const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 165 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      map(const map& __x)
>      : _M_t(__x._M_t) { }
># 177 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last)
> : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_unique(__first, __last); }
># 193 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        map(_InputIterator __first, _InputIterator __last,
>     const _Compare& __comp, const allocator_type& __a = allocator_type())
> : _M_t(__comp, __a)
>        { _M_t.insert_unique(__first, __last); }
># 215 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      map&
>      operator=(const map& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>      allocator_type
>      get_allocator() const
>      { return _M_t.get_allocator(); }
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>      iterator
>      end()
>      { return _M_t.end(); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return _M_t.rend(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
>
>
>
>
>
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 330 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      mapped_type&
>      operator[](const key_type& __k)
>      {
>
>
>
> iterator __i = lower_bound(__k);
>
> if (__i == end() || key_comp()(__k, (*__i).first))
>          __i = insert(__i, value_type(__k, mapped_type()));
> return (*__i).second;
>      }
># 358 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      std::pair<iterator,bool>
>      insert(const value_type& __x)
>      { return _M_t.insert_unique(__x); }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      insert(iterator position, const value_type& __x)
>      { return _M_t.insert_unique(position, __x); }
># 394 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_unique(__first, __last); }
># 408 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 423 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 438 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 453 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      void
>      swap(map& __x)
>      { _M_t.swap(__x._M_t); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
>
>
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>
>
>
>
>      value_compare
>      value_comp() const
>      { return value_compare(_M_t.key_comp()); }
># 496 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 511 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
># 523 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
># 538 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 553 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
>
>
>
>
>
>
>
>      iterator
>      upper_bound(const key_type& __x)
>      { return _M_t.upper_bound(__x); }
>
>
>
>
>
>
>
>      const_iterator
>      upper_bound(const key_type& __x) const
>      { return _M_t.upper_bound(__x); }
># 592 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      std::pair<iterator,iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 611 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>      std::pair<const_iterator,const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>      template <typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator== (const map<_K1,_T1,_C1,_A1>&,
>      const map<_K1,_T1,_C1,_A1>&);
>
>      template <typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator< (const map<_K1,_T1,_C1,_A1>&,
>     const map<_K1,_T1,_C1,_A1>&);
>    };
># 636 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>               const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 653 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_map.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>              const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>               const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>              const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __y < __x; }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>               const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const map<_Key,_Tp,_Compare,_Alloc>& __x,
>               const map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(map<_Key,_Tp,_Compare,_Alloc>& __x, map<_Key,_Tp,_Compare,_Alloc>& __y)
>    { __x.swap(__y); }
>}
># 67 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>namespace std
>{
>
>
>  template <typename _Key, typename _Tp,
>            typename _Compare = std::less<_Key>,
>            typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
>    class multimap;
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>        const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>       const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
># 106 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    class multimap
>    {
>
>     
>     
>
>
>    public:
>      typedef _Key key_type;
>      typedef _Tp mapped_type;
>      typedef std::pair<const _Key, _Tp> value_type;
>      typedef _Compare key_compare;
>
>      class value_compare
>      : public std::binary_function<value_type, value_type, bool>
>      {
> friend class multimap<_Key,_Tp,_Compare,_Alloc>;
>      protected:
> _Compare comp;
>
> value_compare(_Compare __c)
> : comp(__c) { }
>
>      public:
> bool operator()(const value_type& __x, const value_type& __y) const
> { return comp(__x.first, __y.first); }
>      };
>
>    private:
>
>      typedef _Rb_tree<key_type, value_type,
>         _Select1st<value_type>, key_compare, _Alloc> _Rep_type;
>
>      _Rep_type _M_t;
>
>    public:
>
>
>      typedef typename _Alloc::pointer pointer;
>      typedef typename _Alloc::const_pointer const_pointer;
>      typedef typename _Alloc::reference reference;
>      typedef typename _Alloc::const_reference const_reference;
>      typedef typename _Rep_type::allocator_type allocator_type;
>      typedef typename _Rep_type::iterator iterator;
>      typedef typename _Rep_type::const_iterator const_iterator;
>      typedef typename _Rep_type::size_type size_type;
>      typedef typename _Rep_type::difference_type difference_type;
>      typedef typename _Rep_type::reverse_iterator reverse_iterator;
>      typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
>
>
>
>
>
>
>      multimap()
>      : _M_t(_Compare(), allocator_type()) { }
>
>
>
>
>
>      explicit
>      multimap(const _Compare& __comp,
>        const allocator_type& __a = allocator_type())
>      : _M_t(__comp, __a) { }
># 181 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      multimap(const multimap& __x)
>      : _M_t(__x._M_t) { }
># 193 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last)
> : _M_t(_Compare(), allocator_type())
>        { _M_t.insert_equal(__first, __last); }
># 209 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        multimap(_InputIterator __first, _InputIterator __last,
>   const _Compare& __comp,
>   const allocator_type& __a = allocator_type())
>        : _M_t(__comp, __a)
>        { _M_t.insert_equal(__first, __last); }
># 232 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      multimap&
>      operator=(const multimap& __x)
>      {
> _M_t = __x._M_t;
> return *this;
>      }
>
>
>      allocator_type
>      get_allocator() const
>      { return _M_t.get_allocator(); }
>
>
>
>
>
>
>
>      iterator
>      begin()
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      const_iterator
>      begin() const
>      { return _M_t.begin(); }
>
>
>
>
>
>
>      iterator
>      end()
>      { return _M_t.end(); }
>
>
>
>
>
>
>      const_iterator
>      end() const
>      { return _M_t.end(); }
>
>
>
>
>
>
>      reverse_iterator
>      rbegin()
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rbegin() const
>      { return _M_t.rbegin(); }
>
>
>
>
>
>
>      reverse_iterator
>      rend()
>      { return _M_t.rend(); }
>
>
>
>
>
>
>      const_reverse_iterator
>      rend() const
>      { return _M_t.rend(); }
>
>
>
>      bool
>      empty() const
>      { return _M_t.empty(); }
>
>
>      size_type
>      size() const
>      { return _M_t.size(); }
>
>
>      size_type
>      max_size() const
>      { return _M_t.max_size(); }
># 346 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      insert(const value_type& __x)
>      { return _M_t.insert_equal(__x); }
># 370 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      insert(iterator __position, const value_type& __x)
>      { return _M_t.insert_equal(__position, __x); }
># 382 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      template <typename _InputIterator>
>        void
>        insert(_InputIterator __first, _InputIterator __last)
>        { _M_t.insert_equal(__first, __last); }
># 397 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __position)
>      { _M_t.erase(__position); }
># 412 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      size_type
>      erase(const key_type& __x)
>      { return _M_t.erase(__x); }
># 427 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      void
>      erase(iterator __first, iterator __last)
>      { _M_t.erase(__first, __last); }
># 442 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      void
>      swap(multimap& __x)
>      { _M_t.swap(__x._M_t); }
>
>
>
>
>
>
>
>      void
>      clear()
>      { _M_t.clear(); }
>
>
>
>
>
>
>      key_compare
>      key_comp() const
>      { return _M_t.key_comp(); }
>
>
>
>
>
>      value_compare
>      value_comp() const
>      { return value_compare(_M_t.key_comp()); }
># 485 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      find(const key_type& __x)
>      { return _M_t.find(__x); }
># 500 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      const_iterator
>      find(const key_type& __x) const
>      { return _M_t.find(__x); }
>
>
>
>
>
>
>      size_type
>      count(const key_type& __x) const
>      { return _M_t.count(__x); }
># 524 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      iterator
>      lower_bound(const key_type& __x)
>      { return _M_t.lower_bound(__x); }
># 539 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      const_iterator
>      lower_bound(const key_type& __x) const
>      { return _M_t.lower_bound(__x); }
>
>
>
>
>
>
>
>      iterator
>      upper_bound(const key_type& __x)
>      { return _M_t.upper_bound(__x); }
>
>
>
>
>
>
>
>      const_iterator
>      upper_bound(const key_type& __x) const
>      { return _M_t.upper_bound(__x); }
># 576 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      std::pair<iterator,iterator>
>      equal_range(const key_type& __x)
>      { return _M_t.equal_range(__x); }
># 593 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>      std::pair<const_iterator,const_iterator>
>      equal_range(const key_type& __x) const
>      { return _M_t.equal_range(__x); }
>
>      template <typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator== (const multimap<_K1,_T1,_C1,_A1>&,
>      const multimap<_K1,_T1,_C1,_A1>&);
>
>      template <typename _K1, typename _T1, typename _C1, typename _A1>
>        friend bool
>        operator< (const multimap<_K1,_T1,_C1,_A1>&,
>     const multimap<_K1,_T1,_C1,_A1>&);
>  };
># 618 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>               const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __x._M_t == __y._M_t; }
># 635 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_multimap.h" 3
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>              const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __x._M_t < __y._M_t; }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator!=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>               const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__x == __y); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>              const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return __y < __x; }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator<=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>               const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__y < __x); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline bool
>    operator>=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>               const multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { return !(__x < __y); }
>
>
>  template <typename _Key, typename _Tp, typename _Compare, typename _Alloc>
>    inline void
>    swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x,
>         multimap<_Key,_Tp,_Compare,_Alloc>& __y)
>    { __x.swap(__y); }
>}
># 68 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/map" 2 3
># 40 "heaplayers/mmapheap.h" 2
>
>
># 1 "heaplayers/util/sassert.h" 1
># 43 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/util/myhashmap.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "heaplayers/util/myhashmap.h" 2
># 1 "heaplayers/util/hash.h" 1
>
>
>
>
>
>namespace HL {
>  template <typename Key>
>    extern size_t hash (Key k);
>
>  template <>
>    inline size_t hash (void * v) {
>    return (size_t) v;
>  }
>
>  template <>
>    inline size_t hash (const void * v) {
>    return (size_t) ((size_t) v);
>  }
>
>  template <>
>    inline size_t hash (int v) {
>    return (size_t) v;
>  }
>};
># 8 "heaplayers/util/myhashmap.h" 2
>
>namespace HL {
>
>template <typename Key,
>   typename Value,
>   class Allocator>
>class MyHashMap {
>
>public:
>
>  MyHashMap (int size = INITIAL_NUM_BINS)
>    : num_bins (size)
>  {
>    bins = new (alloc.malloc (sizeof(ListNodePtr) * num_bins)) ListNodePtr;
>    for (int i = 0 ; i < num_bins; i++) {
>      bins[i] = __null;
>    }
>  }
>
>  void set (Key k, Value v) {
>    int binIndex = (unsigned int) hash(k) % num_bins;
>    ListNode * l = bins[binIndex];
>    while (l != __null) {
>      if (l->key == k) {
> l->value = v;
> return;
>      }
>      l = l->next;
>    }
>
>    insert (k, v);
>  }
>
>  Value get (Key k) {
>    int binIndex = (unsigned int) hash(k) % num_bins;
>    ListNode * l = bins[binIndex];
>    while (l != __null) {
>      if (l->key == k) {
> return l->value;
>      }
>      l = l->next;
>    }
>
>    return 0;
>  }
>
>  void erase (Key k) {
>    int binIndex = (unsigned int) hash(k) % num_bins;
>    ListNode * curr = bins[binIndex];
>    ListNode * prev = __null;
>    while (curr != __null) {
>      if (curr->key == k) {
>
> if (curr != bins[binIndex]) {
>   (static_cast<void> (0));
>   prev->next = prev->next->next;
>   alloc.free (curr);
> } else {
>   ListNode * n = bins[binIndex]->next;
>   alloc.free (bins[binIndex]);
>   bins[binIndex] = n;
> }
> return;
>      }
>      prev = curr;
>      curr = curr->next;
>    }
>  }
>
>
>private:
>
>  void insert (Key k, Value v) {
>    int binIndex = (unsigned int) hash(k) % num_bins;
>    ListNode * l = new (alloc.malloc (sizeof(ListNode))) ListNode;
>    l->key = k;
>    l->value = v;
>    l->next = bins[binIndex];
>    bins[binIndex] = l;
>  }
>
>  enum { INITIAL_NUM_BINS = 511 };
>
>  class ListNode {
>  public:
>    ListNode (void)
>      : next (__null)
>    {}
>    Key key;
>    Value value;
>    ListNode * next;
>  };
>
>  int num_bins;
>
>  typedef ListNode * ListNodePtr;
>  ListNodePtr * bins;
>  Allocator alloc;
>};
>
>};
># 44 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/stlallocator.h" 1
># 34 "heaplayers/stlallocator.h"
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 1 3
># 51 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>       
># 52 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>
>
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 1 3
># 66 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 3
>namespace std
>{
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __true_type)
>    { return std::copy(__first, __last, __result); }
>
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    __uninitialized_copy_aux(_InputIterator __first, _InputIterator __last,
>        _ForwardIterator __result,
>        __false_type)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     std::_Construct(&*__cur, *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur);
>   throw;
> }
>    }
># 105 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator, typename _ForwardIterator>
>    inline _ForwardIterator
>    uninitialized_copy(_InputIterator __first, _InputIterator __last,
>         _ForwardIterator __result)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      return std::__uninitialized_copy_aux(__first, __last, __result,
>        _Is_POD());
>    }
>
>  inline char*
>  uninitialized_copy(const char* __first, const char* __last, char* __result)
>  {
>    std::memmove(__result, __first, __last - __first);
>    return __result + (__last - __first);
>  }
>
>  inline wchar_t*
>  uninitialized_copy(const wchar_t* __first, const wchar_t* __last,
>       wchar_t* __result)
>  {
>    std::memmove(__result, __first, sizeof(wchar_t) * (__last - __first));
>    return __result + (__last - __first);
>  }
>
>
>
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    __uninitialized_fill_aux(_ForwardIterator __first,
>        _ForwardIterator __last,
>        const _Tp& __x, __true_type)
>    { std::fill(__first, __last, __x); }
>
>  template<typename _ForwardIterator, typename _Tp>
>    void
>    __uninitialized_fill_aux(_ForwardIterator __first, _ForwardIterator __last,
>        const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 167 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Tp>
>    inline void
>    uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last,
>         const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_aux(__first, __last, __x, _Is_POD());
>    }
>
>
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __true_type)
>    { std::fill_n(__first, __n, __x); }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    void
>    __uninitialized_fill_n_aux(_ForwardIterator __first, _Size __n,
>          const _Tp& __x, __false_type)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __n > 0; --__n, ++__cur)
>     std::_Construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur);
>   throw;
> }
>    }
># 212 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 3
>  template<typename _ForwardIterator, typename _Size, typename _Tp>
>    inline void
>    uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x)
>    {
>      typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
>      typedef typename std::__is_scalar<_ValueType>::__type _Is_POD;
>      std::__uninitialized_fill_n_aux(__first, __n, __x, _Is_POD());
>    }
>
>
>
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator,
>    typename _Allocator>
>    _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result,
>      _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __result;
>      try
> {
>   for (; __first != __last; ++__first, ++__cur)
>     __alloc.construct(&*__cur, *__first);
>   return __cur;
> }
>      catch(...)
> {
>   std::_Destroy(__result, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp>
>    inline _ForwardIterator
>    __uninitialized_copy_a(_InputIterator __first, _InputIterator __last,
>      _ForwardIterator __result,
>      allocator<_Tp>)
>    {
>      return std::uninitialized_copy(__first, __last, __result);
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Allocator>
>    void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __cur != __last; ++__cur)
>     __alloc.construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Tp, typename _Tp2>
>    inline void
>    __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last,
>      const _Tp& __x, allocator<_Tp2>)
>    {
>      std::uninitialized_fill(__first, __last, __x);
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Allocator>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x,
>        _Allocator __alloc)
>    {
>      _ForwardIterator __cur = __first;
>      try
> {
>   for (; __n > 0; --__n, ++__cur)
>     __alloc.construct(&*__cur, __x);
> }
>      catch(...)
> {
>   std::_Destroy(__first, __cur, __alloc);
>   throw;
> }
>    }
>
>  template<typename _ForwardIterator, typename _Size, typename _Tp,
>    typename _Tp2>
>    void
>    __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n,
>        const _Tp& __x,
>        allocator<_Tp2>)
>    {
>      std::uninitialized_fill_n(__first, __n, __x);
>    }
># 323 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_uninitialized.h" 3
>  template<typename _InputIterator1, typename _InputIterator2,
>    typename _ForwardIterator, typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_copy_copy(_InputIterator1 __first1,
>         _InputIterator1 __last1,
>         _InputIterator2 __first2,
>         _InputIterator2 __last2,
>         _ForwardIterator __result,
>         _Allocator __alloc)
>    {
>      _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1,
>          __result,
>          __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _ForwardIterator, typename _Tp, typename _InputIterator,
>    typename _Allocator>
>    inline _ForwardIterator
>    __uninitialized_fill_copy(_ForwardIterator __result, _ForwardIterator __mid,
>         const _Tp& __x, _InputIterator __first,
>         _InputIterator __last,
>         _Allocator __alloc)
>    {
>      std::__uninitialized_fill_a(__result, __mid, __x, __alloc);
>      try
> {
>   return std::__uninitialized_copy_a(__first, __last, __mid, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__result, __mid, __alloc);
>   throw;
> }
>    }
>
>
>
>
>  template<typename _InputIterator, typename _ForwardIterator, typename _Tp,
>    typename _Allocator>
>    inline void
>    __uninitialized_copy_fill(_InputIterator __first1, _InputIterator __last1,
>         _ForwardIterator __first2,
>         _ForwardIterator __last2, const _Tp& __x,
>         _Allocator __alloc)
>    {
>      _ForwardIterator __mid2 = std::__uninitialized_copy_a(__first1, __last1,
>           __first2,
>           __alloc);
>      try
> {
>   std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc);
> }
>      catch(...)
> {
>   std::_Destroy(__first2, __mid2, __alloc);
>   throw;
> }
>    }
>
>}
># 58 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 2 3
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_raw_storage_iter.h" 1 3
># 64 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/bits/stl_raw_storage_iter.h" 3
>namespace std
>{
>
>
>
>
>  template <class _ForwardIterator, class _Tp>
>    class raw_storage_iterator
>    : public iterator<output_iterator_tag, void, void, void, void>
>    {
>    protected:
>      _ForwardIterator _M_iter;
>
>    public:
>      explicit
>      raw_storage_iterator(_ForwardIterator __x)
>      : _M_iter(__x) {}
>
>      raw_storage_iterator&
>      operator*() { return *this; }
>
>      raw_storage_iterator&
>      operator=(const _Tp& __element)
>      {
> std::_Construct(&*_M_iter, __element);
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>&
>      operator++()
>      {
> ++_M_iter;
> return *this;
>      }
>
>      raw_storage_iterator<_ForwardIterator, _Tp>
>      operator++(int)
>      {
> raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this;
> ++_M_iter;
> return __tmp;
>      }
>    };
>}
># 59 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 2 3
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 1 3
># 45 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 3
>       
># 46 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 3
># 149 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 3
>namespace std
>{
>
>
>
>
>
>  enum float_round_style
>  {
>    round_indeterminate = -1,
>    round_toward_zero = 0,
>    round_to_nearest = 1,
>    round_toward_infinity = 2,
>    round_toward_neg_infinity = 3
>  };
>
>
>
>
>
>
>
>  enum float_denorm_style
>  {
>
>    denorm_indeterminate = -1,
>
>    denorm_absent = 0,
>
>    denorm_present = 1
>  };
># 191 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 3
>  struct __numeric_limits_base
>  {
>
>
>    static const bool is_specialized = false;
>
>
>
>
>    static const int digits = 0;
>
>    static const int digits10 = 0;
>
>    static const bool is_signed = false;
>
>
>
>
>
>    static const bool is_integer = false;
>
>
>
>
>    static const bool is_exact = false;
>
>
>    static const int radix = 0;
>
>
>
>    static const int min_exponent = 0;
>
>
>    static const int min_exponent10 = 0;
>
>
>
>    static const int max_exponent = 0;
>
>
>    static const int max_exponent10 = 0;
>
>
>    static const bool has_infinity = false;
>
>
>    static const bool has_quiet_NaN = false;
>
>
>    static const bool has_signaling_NaN = false;
>
>    static const float_denorm_style has_denorm = denorm_absent;
>
>
>    static const bool has_denorm_loss = false;
>
>
>
>    static const bool is_iec559 = false;
>
>
>
>    static const bool is_bounded = false;
>
>
>
>
>    static const bool is_modulo = false;
>
>
>    static const bool traps = false;
>
>    static const bool tinyness_before = false;
>
>
>
>    static const float_round_style round_style = round_toward_zero;
>  };
># 284 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/limits" 3
>  template<typename _Tp>
>    struct numeric_limits : public __numeric_limits_base
>    {
>
>
>      static _Tp min() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp max() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp epsilon() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp round_error() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp infinity() throw() { return static_cast<_Tp>(0); }
>
>      static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>      static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); }
>
>
>
>      static _Tp denorm_min() throw() { return static_cast<_Tp>(0); }
>    };
>
>
>
>
>
>  template<>
>    struct numeric_limits<bool>
>    {
>      static const bool is_specialized = true;
>
>      static bool min() throw()
>      { return false; }
>      static bool max() throw()
>      { return true; }
>
>      static const int digits = 1;
>      static const int digits10 = 0;
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static bool epsilon() throw()
>      { return false; }
>      static bool round_error() throw()
>      { return false; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static bool infinity() throw()
>      { return false; }
>      static bool quiet_NaN() throw()
>      { return false; }
>      static bool signaling_NaN() throw()
>      { return false; }
>      static bool denorm_min() throw()
>      { return false; }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>
>
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<char>
>    {
>      static const bool is_specialized = true;
>
>      static char min() throw()
>      { return (((char)(-1) < 0) ? (char)1 << (sizeof(char) * 8 - ((char)(-1) < 0)) : (char)0); }
>      static char max() throw()
>      { return (((char)(-1) < 0) ? ((char)1 << (sizeof(char) * 8 - ((char)(-1) < 0))) - 1 : ~(char)0); }
>
>      static const int digits = (sizeof(char) * 8 - ((char)(-1) < 0));
>      static const int digits10 = ((sizeof(char) * 8 - ((char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((char)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static char epsilon() throw()
>      { return 0; }
>      static char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static char infinity() throw()
>      { return char(); }
>      static char quiet_NaN() throw()
>      { return char(); }
>      static char signaling_NaN() throw()
>      { return char(); }
>      static char denorm_min() throw()
>      { return static_cast<char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<signed char>
>    {
>      static const bool is_specialized = true;
>
>      static signed char min() throw()
>      { return -127 - 1; }
>      static signed char max() throw()
>      { return 127; }
>
>      static const int digits = (sizeof(signed char) * 8 - ((signed char)(-1) < 0));
>      static const int digits10 = ((sizeof(signed char) * 8 - ((signed char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static signed char epsilon() throw()
>      { return 0; }
>      static signed char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static signed char infinity() throw()
>      { return static_cast<signed char>(0); }
>      static signed char quiet_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char signaling_NaN() throw()
>      { return static_cast<signed char>(0); }
>      static signed char denorm_min() throw()
>      { return static_cast<signed char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned char>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned char min() throw()
>      { return 0; }
>      static unsigned char max() throw()
>      { return 127 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned char epsilon() throw()
>      { return 0; }
>      static unsigned char round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned char infinity() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char quiet_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char signaling_NaN() throw()
>      { return static_cast<unsigned char>(0); }
>      static unsigned char denorm_min() throw()
>      { return static_cast<unsigned char>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<wchar_t>
>    {
>      static const bool is_specialized = true;
>
>      static wchar_t min() throw()
>      { return (((wchar_t)(-1) < 0) ? (wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) : (wchar_t)0); }
>      static wchar_t max() throw()
>      { return (((wchar_t)(-1) < 0) ? ((wchar_t)1 << (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0))) - 1 : ~(wchar_t)0); }
>
>      static const int digits = (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0));
>      static const int digits10 = ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = ((wchar_t)(-1) < 0);
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static wchar_t epsilon() throw()
>      { return 0; }
>      static wchar_t round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static wchar_t infinity() throw()
>      { return wchar_t(); }
>      static wchar_t quiet_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t signaling_NaN() throw()
>      { return wchar_t(); }
>      static wchar_t denorm_min() throw()
>      { return wchar_t(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<short>
>    {
>      static const bool is_specialized = true;
>
>      static short min() throw()
>      { return -32767 - 1; }
>      static short max() throw()
>      { return 32767; }
>
>      static const int digits = (sizeof(short) * 8 - ((short)(-1) < 0));
>      static const int digits10 = ((sizeof(short) * 8 - ((short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static short epsilon() throw()
>      { return 0; }
>      static short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static short infinity() throw()
>      { return short(); }
>      static short quiet_NaN() throw()
>      { return short(); }
>      static short signaling_NaN() throw()
>      { return short(); }
>      static short denorm_min() throw()
>      { return short(); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned short>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned short min() throw()
>      { return 0; }
>      static unsigned short max() throw()
>      { return 32767 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned short epsilon() throw()
>      { return 0; }
>      static unsigned short round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned short infinity() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short quiet_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short signaling_NaN() throw()
>      { return static_cast<unsigned short>(0); }
>      static unsigned short denorm_min() throw()
>      { return static_cast<unsigned short>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<int>
>    {
>      static const bool is_specialized = true;
>
>      static int min() throw()
>      { return -2147483647 - 1; }
>      static int max() throw()
>      { return 2147483647; }
>
>      static const int digits = (sizeof(int) * 8 - ((int)(-1) < 0));
>      static const int digits10 = ((sizeof(int) * 8 - ((int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static int epsilon() throw()
>      { return 0; }
>      static int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static int infinity() throw()
>      { return static_cast<int>(0); }
>      static int quiet_NaN() throw()
>      { return static_cast<int>(0); }
>      static int signaling_NaN() throw()
>      { return static_cast<int>(0); }
>      static int denorm_min() throw()
>      { return static_cast<int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned int>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned int min() throw()
>      { return 0; }
>      static unsigned int max() throw()
>      { return 2147483647 * 2U + 1; }
>
>      static const int digits = (sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned int epsilon() throw()
>      { return 0; }
>      static unsigned int round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned int infinity() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int quiet_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int signaling_NaN() throw()
>      { return static_cast<unsigned int>(0); }
>      static unsigned int denorm_min() throw()
>      { return static_cast<unsigned int>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long>
>    {
>      static const bool is_specialized = true;
>
>      static long min() throw()
>      { return -2147483647L - 1; }
>      static long max() throw()
>      { return 2147483647L; }
>
>      static const int digits = (sizeof(long) * 8 - ((long)(-1) < 0));
>      static const int digits10 = ((sizeof(long) * 8 - ((long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long epsilon() throw()
>      { return 0; }
>      static long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long infinity() throw()
>      { return static_cast<long>(0); }
>      static long quiet_NaN() throw()
>      { return static_cast<long>(0); }
>      static long signaling_NaN() throw()
>      { return static_cast<long>(0); }
>      static long denorm_min() throw()
>      { return static_cast<long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long min() throw()
>      { return 0; }
>      static unsigned long max() throw()
>      { return 2147483647L * 2UL + 1; }
>
>      static const int digits = (sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long epsilon() throw()
>      { return 0; }
>      static unsigned long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long infinity() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long quiet_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long signaling_NaN() throw()
>      { return static_cast<unsigned long>(0); }
>      static unsigned long denorm_min() throw()
>      { return static_cast<unsigned long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<long long>
>    {
>      static const bool is_specialized = true;
>
>      static long long min() throw()
>      { return -9223372036854775807LL - 1; }
>      static long long max() throw()
>      { return 9223372036854775807LL; }
>
>      static const int digits = (sizeof(long long) * 8 - ((long long)(-1) < 0));
>      static const int digits10 = ((sizeof(long long) * 8 - ((long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = true;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static long long epsilon() throw()
>      { return 0; }
>      static long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static long long infinity() throw()
>      { return static_cast<long long>(0); }
>      static long long quiet_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long signaling_NaN() throw()
>      { return static_cast<long long>(0); }
>      static long long denorm_min() throw()
>      { return static_cast<long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<unsigned long long>
>    {
>      static const bool is_specialized = true;
>
>      static unsigned long long min() throw()
>      { return 0; }
>      static unsigned long long max() throw()
>      { return 9223372036854775807LL * 2ULL + 1; }
>
>      static const int digits = (sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0));
>      static const int digits10 = ((sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)) * 643 / 2136);
>      static const bool is_signed = false;
>      static const bool is_integer = true;
>      static const bool is_exact = true;
>      static const int radix = 2;
>      static unsigned long long epsilon() throw()
>      { return 0; }
>      static unsigned long long round_error() throw()
>      { return 0; }
>
>      static const int min_exponent = 0;
>      static const int min_exponent10 = 0;
>      static const int max_exponent = 0;
>      static const int max_exponent10 = 0;
>
>      static const bool has_infinity = false;
>      static const bool has_quiet_NaN = false;
>      static const bool has_signaling_NaN = false;
>      static const float_denorm_style has_denorm = denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static unsigned long long infinity() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long quiet_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long signaling_NaN() throw()
>      { return static_cast<unsigned long long>(0); }
>      static unsigned long long denorm_min() throw()
>      { return static_cast<unsigned long long>(0); }
>
>      static const bool is_iec559 = false;
>      static const bool is_bounded = true;
>      static const bool is_modulo = true;
>
>      static const bool traps = true;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_toward_zero;
>    };
>
>
>  template<>
>    struct numeric_limits<float>
>    {
>      static const bool is_specialized = true;
>
>      static float min() throw()
>      { return 1.17549435e-38F; }
>      static float max() throw()
>      { return 3.40282347e+38F; }
>
>      static const int digits = 24;
>      static const int digits10 = 6;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static float epsilon() throw()
>      { return 1.19209290e-7F; }
>      static float round_error() throw()
>      { return 0.5F; }
>
>      static const int min_exponent = (-125);
>      static const int min_exponent10 = (-37);
>      static const int max_exponent = 128;
>      static const int max_exponent10 = 38;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(1.40129846e-45F) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static float infinity() throw()
>      { return __builtin_huge_valf (); }
>      static float quiet_NaN() throw()
>      { return __builtin_nanf (""); }
>      static float signaling_NaN() throw()
>      { return __builtin_nansf (""); }
>      static float denorm_min() throw()
>      { return 1.40129846e-45F; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<double>
>    {
>      static const bool is_specialized = true;
>
>      static double min() throw()
>      { return 2.2250738585072014e-308; }
>      static double max() throw()
>      { return 1.7976931348623157e+308; }
>
>      static const int digits = 53;
>      static const int digits10 = 15;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static double epsilon() throw()
>      { return 2.2204460492503131e-16; }
>      static double round_error() throw()
>      { return 0.5; }
>
>      static const int min_exponent = (-1021);
>      static const int min_exponent10 = (-307);
>      static const int max_exponent = 1024;
>      static const int max_exponent10 = 308;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(4.9406564584124654e-324) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss = false;
>
>      static double infinity() throw()
>      { return __builtin_huge_val(); }
>      static double quiet_NaN() throw()
>      { return __builtin_nan (""); }
>      static double signaling_NaN() throw()
>      { return __builtin_nans (""); }
>      static double denorm_min() throw()
>      { return 4.9406564584124654e-324; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>
>  template<>
>    struct numeric_limits<long double>
>    {
>      static const bool is_specialized = true;
>
>      static long double min() throw()
>      { return 3.36210314311209350626e-4932L; }
>      static long double max() throw()
>      { return 1.18973149535723176502e+4932L; }
>
>      static const int digits = 64;
>      static const int digits10 = 18;
>      static const bool is_signed = true;
>      static const bool is_integer = false;
>      static const bool is_exact = false;
>      static const int radix = 2;
>      static long double epsilon() throw()
>      { return 1.08420217248550443401e-19L; }
>      static long double round_error() throw()
>      { return 0.5L; }
>
>      static const int min_exponent = (-16381);
>      static const int min_exponent10 = (-4931);
>      static const int max_exponent = 16384;
>      static const int max_exponent10 = 4932;
>
>      static const bool has_infinity = 1;
>      static const bool has_quiet_NaN = 1;
>      static const bool has_signaling_NaN = has_quiet_NaN;
>      static const float_denorm_style has_denorm
> = bool(3.64519953188247460253e-4951L) ? denorm_present : denorm_absent;
>      static const bool has_denorm_loss
> = false;
>
>      static long double infinity() throw()
>      { return __builtin_huge_vall (); }
>      static long double quiet_NaN() throw()
>      { return __builtin_nanl (""); }
>      static long double signaling_NaN() throw()
>      { return __builtin_nansl (""); }
>      static long double denorm_min() throw()
>      { return 3.64519953188247460253e-4951L; }
>
>      static const bool is_iec559
> = has_infinity && has_quiet_NaN && has_denorm == denorm_present;
>      static const bool is_bounded = true;
>      static const bool is_modulo = false;
>
>      static const bool traps = false;
>      static const bool tinyness_before = false;
>      static const float_round_style round_style = round_to_nearest;
>    };
>
>
>
>
>
>}
># 61 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 2 3
>
>namespace std
>{
># 72 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>  template<typename _Tp>
>    pair<_Tp*, ptrdiff_t>
>    __get_temporary_buffer(ptrdiff_t __len, _Tp*)
>    {
>      const ptrdiff_t __max = numeric_limits<ptrdiff_t>::max() / sizeof(_Tp);
>      if (__len > __max)
> __len = __max;
>
>      while (__len > 0)
> {
>   _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp),
>       nothrow));
>   if (__tmp != 0)
>     return pair<_Tp*, ptrdiff_t>(__tmp, __len);
>   __len /= 2;
> }
>      return pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0);
>    }
># 108 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>  template<typename _Tp>
>    inline pair<_Tp*, ptrdiff_t>
>    get_temporary_buffer(ptrdiff_t __len)
>    { return std::__get_temporary_buffer(__len, static_cast<_Tp*>(0)); }
># 120 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>  template<typename _Tp>
>    void
>    return_temporary_buffer(_Tp* __p)
>    { ::operator delete(__p, nothrow); }
># 132 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>  template<typename _Tp1>
>    struct auto_ptr_ref
>    {
>      _Tp1* _M_ptr;
>
>      explicit
>      auto_ptr_ref(_Tp1* __p): _M_ptr(__p) { }
>    };
># 173 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>  template<typename _Tp>
>    class auto_ptr
>    {
>    private:
>      _Tp* _M_ptr;
>
>    public:
>
>      typedef _Tp element_type;
>
>
>
>
>
>
>
>      explicit
>      auto_ptr(element_type* __p = 0) throw() : _M_ptr(__p) { }
># 199 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      auto_ptr(auto_ptr& __a) throw() : _M_ptr(__a.release()) { }
># 211 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr(auto_ptr<_Tp1>& __a) throw() : _M_ptr(__a.release()) { }
># 222 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      auto_ptr&
>      operator=(auto_ptr& __a) throw()
>      {
> reset(__a.release());
> return *this;
>      }
># 239 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      template<typename _Tp1>
>        auto_ptr&
>        operator=(auto_ptr<_Tp1>& __a) throw()
>        {
>   reset(__a.release());
>   return *this;
> }
># 259 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      ~auto_ptr() { delete _M_ptr; }
># 269 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      element_type&
>      operator*() const throw()
>      {
> ;
> return *_M_ptr;
>      }
>
>
>
>
>
>
>
>      element_type*
>      operator->() const throw()
>      {
> ;
> return _M_ptr;
>      }
># 299 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      element_type*
>      get() const throw() { return _M_ptr; }
># 313 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      element_type*
>      release() throw()
>      {
> element_type* __tmp = _M_ptr;
> _M_ptr = 0;
> return __tmp;
>      }
># 328 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      void
>      reset(element_type* __p = 0) throw()
>      {
> if (__p != _M_ptr)
>   {
>     delete _M_ptr;
>     _M_ptr = __p;
>   }
>      }
># 349 "/usr/lib/gcc/i386-redhat-linux/4.0.2/../../../../include/c++/4.0.2/memory" 3
>      auto_ptr(auto_ptr_ref<element_type> __ref) throw()
>      : _M_ptr(__ref._M_ptr) { }
>
>      auto_ptr&
>      operator=(auto_ptr_ref<element_type> __ref) throw()
>      {
> if (__ref._M_ptr != this->get())
>   {
>     delete _M_ptr;
>     _M_ptr = __ref._M_ptr;
>   }
> return *this;
>      }
>
>      template<typename _Tp1>
>        operator auto_ptr_ref<_Tp1>() throw()
>        { return auto_ptr_ref<_Tp1>(this->release()); }
>
>      template<typename _Tp1>
>        operator auto_ptr<_Tp1>() throw()
>        { return auto_ptr<_Tp1>(this->release()); }
>  };
>}
># 35 "heaplayers/stlallocator.h" 2
>
>using namespace std;
># 52 "heaplayers/stlallocator.h"
>namespace HL {
>
>template <class T, class Super>
>class STLAllocator : public Super {
>public:
>
>  typedef T value_type;
>  typedef std::size_t size_type;
>  typedef std::ptrdiff_t difference_type;
>  typedef T * pointer;
>  typedef const T * const_pointer;
>  typedef T& reference;
>  typedef const T& const_reference;
>
>  STLAllocator (void) {}
>  virtual ~STLAllocator (void) {}
>
>  STLAllocator (const STLAllocator& s)
>    : Super (s)
>  {}
># 89 "heaplayers/stlallocator.h"
>  inline pointer allocate (size_type n,
>     const void * = 0) {
>    if (n) {
>      return reinterpret_cast<pointer>(Super::malloc (sizeof(T) * n));
>    } else {
>      return 0;
>    }
>  }
>
>
>  inline void deallocate (void * p, size_type) {
>    Super::free (p);
>  }
>
>  inline void deallocate (pointer p, size_type) {
>    Super::free (p);
>  }
>
>  pointer address (reference x) const { return &x; }
>  const_pointer address (const_reference x) const { return &x; }
>
>  void construct (pointer p, const T& val) { new (p) T (val); }
>  void destroy (pointer p) { p->~T(); }
>
>
>  size_type max_size(void) const
>  {
>    size_type n = (size_type)(-1);
>    return (n > 0 ? n : (size_type)(n));
>  }
>
>  template <class U> STLAllocator( const STLAllocator<U, Super> &) {}
>  template <class U> struct rebind { typedef STLAllocator<U,Super> other; };
>
>};
>
>  template <typename T, class S>
>  inline bool operator!=(const STLAllocator<T,S>& a, const STLAllocator<T,S>& b) {
>    return (&a != &b);
>  }
>
>  template <typename T, class S>
>  inline bool operator==(const STLAllocator<T,S>& a, const STLAllocator<T,S>& b) {
>    return (&a == &b);
>  }
># 164 "heaplayers/stlallocator.h"
>}
># 45 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/freelistheap.h" 1
># 15 "heaplayers/freelistheap.h"
># 1 "heaplayers/freesllist.h" 1
># 16 "heaplayers/freelistheap.h" 2
># 1 "/usr/include/assert.h" 1 3 4
># 17 "heaplayers/freelistheap.h" 2
>
>
>
>
>
>namespace HL {
>
>template <class SuperHeap>
>class FreelistHeap : public SuperHeap {
>public:
>
>  inline void * malloc (size_t sz) {
>
>    void * ptr = _freelist.get();
>
>
>    if (ptr == 0) {
>      ptr = SuperHeap::malloc (sz);
>    }
>    return ptr;
>  }
>
>  inline void free (void * ptr) {
>    if (ptr == 0) {
>      return;
>    }
>    _freelist.insert (ptr);
>  }
>
>  inline void clear (void) {
>    void * ptr;
>    while (ptr = _freelist.get()) {
>      SuperHeap::free (ptr);
>    }
>  }
>
>private:
>
>  FreeSLList _freelist;
>
>};
>
>}
># 46 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/zoneheap.h" 1
># 17 "heaplayers/zoneheap.h"
># 1 "/usr/include/assert.h" 1 3 4
># 18 "heaplayers/zoneheap.h" 2
>
>namespace HL {
>
>  template <class Super, size_t ChunkSize>
>  class ZoneHeap : public Super {
>  public:
>
>    ZoneHeap (void)
>      : sizeRemaining (-1),
> currentArena (__null),
> pastArenas (__null)
>    {}
>
>    ~ZoneHeap (void)
>    {
>
>
>      Arena * ptr = pastArenas;
>      while (ptr != __null) {
> void * oldPtr = (void *) ptr;
> ptr = ptr->nextArena;
>
> Super::free (oldPtr);
>      }
>      if (currentArena != __null)
>
> Super::free (currentArena);
>    }
>
>    inline void * malloc (size_t sz) {
>      void * ptr = zoneMalloc (sz);
>      return ptr;
>    }
>
>
>    inline void free (void *) {}
>
>
>    inline int remove (void *) { return 0; }
>
>
>  private:
>
>    inline static size_t align (int sz) {
>      return (sz + (sizeof(double) - 1)) & ~(sizeof(double) - 1);
>    }
>
>    inline void * zoneMalloc (size_t sz) {
>      void * ptr;
>
>      sz = align (sz);
>
>      if ((currentArena == __null) || (sizeRemaining < (int) sz)) {
>
> if (currentArena != __null) {
>   currentArena->nextArena = pastArenas;
>   pastArenas = currentArena;
> }
>
> size_t allocSize = ChunkSize;
> if (allocSize < sz) {
>   allocSize = sz;
> }
> currentArena =
>   (Arena *) Super::malloc (allocSize + sizeof(Arena));
> if (currentArena == __null) {
>   return __null;
> }
> currentArena->arenaSpace = (char *) (currentArena + 1);
> currentArena->nextArena = __null;
> sizeRemaining = ChunkSize;
>      }
>
>      sizeRemaining -= sz;
>      ptr = currentArena->arenaSpace;
>      currentArena->arenaSpace += sz;
>      (static_cast<void> (0));
>      return ptr;
>    }
>
>    class Arena {
>    public:
>      Arena * nextArena;
>      char * arenaSpace;
>      double _dummy;
>    };
>
>
>    long sizeRemaining;
>
>
>    Arena * currentArena;
>
>
>    Arena * pastArenas;
>  };
>
>}
># 47 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/lockedheap.h" 1
># 30 "heaplayers/lockedheap.h"
># 1 "heaplayers/util/guard.h" 1
># 31 "heaplayers/lockedheap.h" 2
>
>namespace HL {
>
>template <class LockType, class Super>
>class LockedHeap : public Super {
>public:
>
>  inline void * malloc (size_t sz) {
>    Guard<LockType> l (thelock);
>    return Super::malloc (sz);
>  }
>
>  inline void free (void * ptr) {
>    Guard<LockType> l (thelock);
>    Super::free (ptr);
>  }
>
>  inline void lock (void) {
>    thelock.lock();
>  }
>
>  inline void unlock (void) {
>    thelock.unlock();
>  }
>
>private:
>  LockType thelock;
>};
>
>}
># 48 "heaplayers/mmapheap.h" 2
># 1 "heaplayers/spinlock.h" 1
># 42 "heaplayers/spinlock.h"
># 1 "heaplayers/hldefines.h" 1
># 43 "heaplayers/spinlock.h" 2
># 1 "heaplayers/util/cpuinfo.h" 1
># 44 "heaplayers/spinlock.h" 2
># 80 "heaplayers/spinlock.h"
>extern volatile int anyThreadCreated;
>
>namespace HL {
>
>class SpinLockType {
>public:
>
>  SpinLockType (void)
>    : mutex (UNLOCKED)
>  {}
>
>  ~SpinLockType (void)
>  {}
>
>  inline void lock (void) {
>
>    if (anyThreadCreated) {
>      if (MyInterlockedExchange (const_cast<unsigned long *>(&mutex), LOCKED)
>   != UNLOCKED) {
> contendedLock();
>      }
>    } else {
>      mutex = LOCKED;
>    }
>  }
>
>
>  inline void unlock (void) {
>    if (anyThreadCreated) {
>
>
>
>
>      asm volatile ("" : : : "memory");
>
>
>    }
>    mutex = UNLOCKED;
>  }
>
>
>
>  inline static volatile unsigned long MyInterlockedExchange (unsigned long *,unsigned long);
>
>
>private:
>
>  __attribute__ ((noinline))
>  void contendedLock (void) {
>    while (1) {
>      if (MyInterlockedExchange (const_cast<unsigned long *>(&mutex), LOCKED)
>   == UNLOCKED) {
> return;
>      }
>      while (mutex == LOCKED) {
> ;
> yieldProcessor();
>      }
>    }
>  }
>
>
>  inline bool onMultiprocessor (void) {
>    static CPUInfo cpuInfo;
>    return (cpuInfo.getNumProcessors() > 1);
>  }
>
>  inline void yieldProcessor (void) {
>
>
>
>
>
>
>    sched_yield();
>
>
>  }
>
>  enum { UNLOCKED = 0, LOCKED = 1 };
>
>  enum { MAX_SPIN_LIMIT = 1024 };
>
>  union {
>    double _dummy;
>    volatile unsigned long mutex;
>  };
>
>};
>
>}
>
>
>
>
>
>
>
>inline volatile unsigned long
>HL::SpinLockType::MyInterlockedExchange (unsigned long * oldval,
>       unsigned long newval)
>{
># 192 "heaplayers/spinlock.h"
>  asm volatile ("lock; xchgl %0, %1"
>  : "=r" (newval)
>  : "m" (*oldval), "0" (newval)
>  : "memory");
># 236 "heaplayers/spinlock.h"
>  return newval;
>}
># 49 "heaplayers/mmapheap.h" 2
># 70 "heaplayers/mmapheap.h"
>namespace HL {
>
>  class PrivateMmapHeap {
>  public:
>
>
>    enum { ZeroMemory = 1 };
># 109 "heaplayers/mmapheap.h"
>    virtual ~PrivateMmapHeap (void) {}
>
>
>
>
>
>
>
>    enum { Alignment = 4 * 1024 };
>
>
>    inline void * malloc (size_t sz) {
>
>
>
>
>
>
>
>      void * ptr = mmap (__null, sz, (0x1 | 0x2), 0x02 | 0x20, -1, 0);
>
>      if (ptr == ((void *) -1)) {
> ptr = __null;
>      }
>      return ptr;
>    }
>
>
>    inline void free (void * ptr) {
>      abort();
>      munmap (reinterpret_cast<char *>(ptr), getSize(ptr));
>    }
>
>    inline size_t getSize (void * ptr) {
>      abort();
>      return Alignment;
>    }
>
>
>    void free (void * ptr, size_t sz)
>    {
>      if ((long) sz < 0) {
> abort();
>      }
>
>      munmap (reinterpret_cast<char *>(ptr), sz);
>    }
>
>
>
>  };
>
>
>  class MmapHeap : public PrivateMmapHeap {
>
>
>  private:
>
>    class MyHeap : public LockedHeap<SpinLockType, FreelistHeap<ZoneHeap<PrivateMmapHeap, 16384 - 16> > > {};
>
>    typedef MyHashMap<void *, size_t, MyHeap> mapType;
>
>  protected:
>    mapType MyMap;
>
>    SpinLockType MyMapLock;
>
>  public:
>    inline void * malloc (size_t sz) {
>      void * ptr = PrivateMmapHeap::malloc (sz);
>      MyMapLock.lock();
>      MyMap.set (ptr, sz);
>      MyMapLock.unlock();
>      (static_cast<void> (0));
>      return const_cast<void *>(ptr);
>    }
>
>    inline size_t getSize (void * ptr) {
>      MyMapLock.lock();
>      size_t sz = MyMap.get (ptr);
>      MyMapLock.unlock();
>      return sz;
>    }
>
>
>    void free (void * ptr, size_t sz) {
>      PrivateMmapHeap::free (ptr, sz);
>    }
>
>    inline void free (void * ptr) {
>      (static_cast<void> (0));
>      MyMapLock.lock();
>      size_t sz = MyMap.get (ptr);
>      PrivateMmapHeap::free (ptr, sz);
>      MyMap.erase (ptr);
>      MyMapLock.unlock();
>    }
>
>  };
>
>}
># 7 "alignedsuperblockheap.h" 2
>
>
>
># 1 "heaplayers/lockedheap.h" 1
># 11 "alignedsuperblockheap.h" 2
>
># 1 "heaplayers/util/dllist.h" 1
># 30 "heaplayers/util/dllist.h"
># 1 "/usr/include/assert.h" 1 3 4
># 31 "heaplayers/util/dllist.h" 2
># 39 "heaplayers/util/dllist.h"
>namespace HL {
>
>class DLList {
>public:
>
>  inline DLList (void) {
>    clear();
>  }
>
>  class Entry;
>
>
>  inline void clear (void) {
>    head.setPrev (&head);
>    head.setNext (&head);
>  }
>
>
>  inline bool isEmpty (void) const {
>    return (head.getNext() == &head);
>  }
>
>
>  inline Entry * get (void) {
>    const Entry * e = head.next;
>    if (e == &head) {
>      return __null;
>    }
>    head.next = e->next;
>    head.next->prev = &head;
>    return (Entry *) e;
>  }
>
>
>  inline void remove (Entry * e) {
>    e->remove();
>  }
>
>
>  inline void insert (Entry * e) {
>    e->insert (&head, head.next);
>  }
>
>
>  class Entry {
>  public:
>
>    inline void setPrev (Entry * p) { (static_cast<void> (0)); prev = p; }
>    inline void setNext (Entry * p) { (static_cast<void> (0)); next = p; }
>    inline Entry * getPrev (void) const { return prev; }
>    inline Entry * getNext (void) const { return next; }
>    inline void remove (void) const {
>      prev->setNext(next);
>      next->setPrev(prev);
>    }
>    inline void insert (Entry * p, Entry * n) {
>      prev = p;
>      next = n;
>      p->setNext (this);
>      n->setPrev (this);
>    }
>    Entry * prev;
>    Entry * next;
>  };
>
>
>private:
>
>
>  Entry head;
>
>};
>
>};
># 13 "alignedsuperblockheap.h" 2
>
>
># 1 "alignedmmap.h" 1
># 13 "alignedmmap.h"
># 1 "heaplayers/util/myhashmap.h" 1
># 14 "alignedmmap.h" 2
># 1 "heaplayers/freelistheap.h" 1
># 15 "alignedmmap.h" 2
># 1 "heaplayers/mmapwrapper.h" 1
># 52 "heaplayers/mmapwrapper.h"
>namespace HL {
>
>class MmapWrapper {
>public:
># 86 "heaplayers/mmapwrapper.h"
>  enum { Size = 4 * 1024 };
>  enum { Alignment = 4 * 1024 };
>
>
>  static void * map (size_t sz) {
>
>    if (sz == 0) {
>      return __null;
>    }
>
>    void * ptr;
># 105 "heaplayers/mmapwrapper.h"
>    ptr = mmap ((void *) 0, sz, (0x1 | 0x2), 0x02 | 0x20, -1, 0);
>
>
>    if (ptr == ((void *) -1)) {
>      return __null;
>    } else {
>      return ptr;
>    }
>  }
>
>  static void unmap (void * ptr, size_t sz) {
>    munmap (reinterpret_cast<char *>(ptr), sz);
>  }
>
>
>
>};
>
>}
># 16 "alignedmmap.h" 2
># 1 "bumpalloc.h" 1
># 10 "bumpalloc.h"
>namespace Hoard {
>
>template <int ChunkSize,
>   class super>
>class BumpAlloc : public super {
>public:
>
>  BumpAlloc (void)
>    : _bump (__null),
>      _remaining (0)
>  {}
>
>  inline void * malloc (size_t sz) {
>
>
>    if (_remaining < sz) {
>      refill(sz);
>    }
>    char * old = _bump;
>    _bump += sz;
>    _remaining -= sz;
>    return old;
>  }
>
>
>  inline void free (void *) {}
>
>private:
>
>
>  char * _bump;
>
>
>  int _remaining;
>
>
>  void refill (size_t sz) {
>    if (sz < ChunkSize) {
>      sz = ChunkSize;
>    }
>    _bump = (char *) super::malloc (sz);
>    _remaining = sz;
>  }
>
>};
>
>};
># 17 "alignedmmap.h" 2
># 1 "exactlyone.h" 1
># 10 "exactlyone.h"
>namespace Hoard {
>
>template <class CLASS>
>class ExactlyOne {
>public:
>
>  inline CLASS& operator() (void) {
>    static CLASS theOneTrueInstance;
>    return theOneTrueInstance;
>  }
>
>};
>
>};
># 18 "alignedmmap.h" 2
># 1 "mmapalloc.h" 1
># 16 "mmapalloc.h"
>namespace Hoard {
>
>class MmapAlloc {
>public:
>  void * malloc (size_t sz) {
>    void * ptr = HL::MmapWrapper::map (sz);
>    return ptr;
>  }
>
>};
>
>}
># 19 "alignedmmap.h" 2
>
>using namespace std;
>using namespace HL;
>
>namespace Hoard {
># 32 "alignedmmap.h"
>template <size_t Alignment_>
>class AlignedMmapInstance {
>public:
>
>  enum { Alignment = Alignment_ };
>
>  inline void * malloc (size_t sz) {
>
>
>    sz = (sz + HL::MmapWrapper::Size - 1) & ~(HL::MmapWrapper::Size - 1);
>
>
>    if ((size_t) HL::MmapWrapper::Alignment % (size_t) Alignment == 0) {
>      void * ptr = HL::MmapWrapper::map (sz);
>      MyMap.set (ptr, sz);
>      return ptr;
>    }
>
>
>
>
>    char * ptr = reinterpret_cast<char *>(HL::MmapWrapper::map (sz));
>
>    if (ptr == align(ptr)) {
>
>      MyMap.set (ptr, sz);
>      return ptr;
>    } else {
>
>      HL::MmapWrapper::unmap ((void *) ptr, sz);
>    }
>
>
>
>
>
>    ptr = reinterpret_cast<char *>(HL::MmapWrapper::map (sz + Alignment_));
>
>    if (ptr == __null) {
>      return __null;
>    }
>
>    char * newptr = align (ptr);
>
>
>
>    size_t prolog = (size_t) newptr - (size_t) ptr;
>
>    if (prolog > 0) {
>
>      HL::MmapWrapper::unmap (ptr, prolog);
>    }
>
>    size_t epilog = Alignment_ - prolog;
>    HL::MmapWrapper::unmap ((char *) newptr + sz, epilog);
>
>
>
>    MyMap.set (newptr, sz);
>    return newptr;
>  }
>
>  inline void free (void * ptr) {
>
>
>
>
>    size_t requestedSize = MyMap.get (ptr);
>
>    if (requestedSize == 0) {
>      return;
>    }
>
>    HL::MmapWrapper::unmap (ptr, requestedSize);
>
>
>    MyMap.erase (ptr);
>
>    (static_cast<void> (0));
>  }
>
>  inline size_t getSize (void * ptr) {
>    return MyMap.get (ptr);
>  }
>
>
>private:
>
>
>  inline static char * align (char * buf) {
>    return (char *)(((size_t) buf + (Alignment_-1)) & ~(Alignment_-1));
>  }
>
>
>
>
>
>  typedef void * keyType;
>
>
>  typedef size_t valType;
>
>
>
>  class SourceHeap : public HL::FreelistHeap<BumpAlloc<65536, MmapAlloc> > { };
>
>
>  typedef MyHashMap<keyType, valType, SourceHeap> mapType;
>
>
>  mapType MyMap;
>
>};
># 153 "alignedmmap.h"
>template <size_t Alignment_>
>class AlignedMmap : public ExactlyOne<AlignedMmapInstance<Alignment_> > {
>public:
>
>  enum { Alignment = Alignment_ };
>
>  inline void * malloc (size_t sz) {
>    return (*this)().malloc (sz);
>  }
>  inline void free (void * ptr) {
>    return (*this)().free (ptr);
>  }
>  inline size_t getSize (void * ptr) const {
>    return (*this)().getSize (ptr);
>  }
>
>};
>
>};
># 16 "alignedsuperblockheap.h" 2
>
>namespace Hoard {
>
>template <size_t SuperblockSize>
>class SuperblockStore {
>public:
>
>  enum { Alignment = AlignedMmap<SuperblockSize>::Alignment };
>
>  void * malloc (size_t sz) {
>    (static_cast<void> (0));
>    if (_freeSuperblocks.isEmpty()) {
>
>      void * ptr = _superblockSource.malloc (ChunksToGrab * SuperblockSize);
>      if (!ptr) {
> return __null;
>      }
>      char * p = (char *) ptr;
>      for (int i = 0; i < ChunksToGrab; i++) {
> _freeSuperblocks.insert ((DLList::Entry *) p);
> p += SuperblockSize;
>      }
>    }
>    return _freeSuperblocks.get();
>  }
>
>  void free (void * ptr) {
>    _freeSuperblocks.insert ((DLList::Entry *) ptr);
>  }
>
>private:
>
>
>
>
>  enum { ChunksToGrab = 1 };
>
>
>  AlignedMmap<SuperblockSize> _superblockSource;
>  DLList _freeSuperblocks;
>
>};
>
>}
>
>
>namespace Hoard {
>
>template <class TheLockType,
>   size_t SuperblockSize>
>class AlignedSuperblockHeapHelper :
>  public ConformantHeap<HL::LockedHeap<TheLockType,
>           FixedRequestHeap<SuperblockSize,
>
>           SuperblockStore<SuperblockSize> > > > {};
>
>
>template <class TheLockType,
>   size_t SuperblockSize>
>class AlignedSuperblockHeap :
>  public AlignedSuperblockHeapHelper<TheLockType, SuperblockSize> {
>
>  HL::sassert<(AlignedSuperblockHeapHelper<TheLockType, SuperblockSize>::Alignment % SuperblockSize == 0)> EnsureProperAlignment;
>
>};
>
>};
># 50 "hoard.h" 2
>
># 1 "globalheap.h" 1
>
>
>
>
># 1 "processheap.h" 1
># 14 "processheap.h"
>namespace Hoard {
>
>  template <size_t SuperblockSize,
>     int EmptinessClasses,
>     class LockType,
>     class ThresholdClass>
>  class ProcessHeap :
>    public ConformantHeap<
>    HoardManager<AlignedSuperblockHeap<LockType, SuperblockSize>,
>   EmptyHoardManager<HoardSuperblock<LockType, SuperblockSize, ProcessHeap<SuperblockSize, EmptinessClasses, LockType, ThresholdClass> > >,
>   HoardSuperblock<LockType, SuperblockSize, ProcessHeap<SuperblockSize, EmptinessClasses, LockType, ThresholdClass> >,
>   EmptinessClasses,
>   LockType,
>   ThresholdClass,
>   ProcessHeap<SuperblockSize, EmptinessClasses, LockType, ThresholdClass> > > {
>
>public:
>
>  ProcessHeap (void) {}
>
>
>  inline void * malloc (size_t);
>
>private:
>
>
>  ProcessHeap (const ProcessHeap&);
>  ProcessHeap& operator=(const ProcessHeap&);
>
>};
>
>};
># 6 "globalheap.h" 2
>
>namespace Hoard {
>
>template <size_t SuperblockSize,
>   int EmptinessClasses,
>   class LockType>
>class GlobalHeap {
>
>  class bogusThresholdFunctionClass {
>  public:
>    static inline bool function (int, int, size_t) {
>
>      return false;
>    }
>  };
>
>public:
>
>  GlobalHeap (void)
>    : theHeap (getHeap())
>    {
>    }
>
>  typedef ProcessHeap<SuperblockSize, EmptinessClasses, LockType, bogusThresholdFunctionClass> SuperHeap;
>  typedef HoardSuperblock<LockType, SuperblockSize, GlobalHeap> SuperblockType;
>
>  void put (void * s, size_t sz) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    theHeap->put ((typename SuperHeap::SuperblockType *) s,
>    sz);
>  }
>
>  SuperblockType * get (size_t sz, void * dest) {
>    SuperblockType * s =
>      reinterpret_cast<SuperblockType *>
>      (theHeap->get (sz, reinterpret_cast<SuperHeap *>(dest)));
>    if (s) {
>      (static_cast<void> (0));
>    }
>    return s;
>  }
>
>private:
>
>  SuperHeap * theHeap;
>
>  inline static SuperHeap * getHeap (void) {
>    static double theHeapBuf[sizeof(SuperHeap) / sizeof(double) + 1];
>    static SuperHeap * theHeap = new (&theHeapBuf[0]) SuperHeap;
>    return theHeap;
>  }
>
>
>  GlobalHeap (const GlobalHeap&);
>  GlobalHeap& operator=(const GlobalHeap&);
>
>};
>
>};
># 52 "hoard.h" 2
>
>
>
># 1 "heaplayers/ansiwrapper.h" 1
># 16 "heaplayers/ansiwrapper.h"
>namespace HL {
>
>template <class SuperHeap>
>class ANSIWrapper : public SuperHeap {
>private:
>  int inside;
>public:
>
>  ANSIWrapper (void)
>    : inside (0)
>    {}
>
>  inline void * malloc (size_t sz) {
>    if (sz < 2 * sizeof(size_t)) {
>
>
>
>      sz = 2 * sizeof(size_t);
>    }
>    sz = align(sz);
>    void * ptr = SuperHeap::malloc (sz);
>    return ptr;
>  }
>
>  inline void free (void * ptr) {
>    if (ptr != 0) {
>      SuperHeap::free (ptr);
>    }
>  }
>
>  inline void * calloc (const size_t s1, const size_t s2) {
>    void * ptr = malloc (s1 * s2);
>    if (ptr) {
>      memset (ptr, 0, s1 * s2);
>    }
>    return ptr;
>  }
>
>  inline void * realloc (void * ptr, const size_t sz) {
>    if (ptr == 0) {
>      return malloc (sz);
>    }
>    if (sz == 0) {
>      free (ptr);
>      return 0;
>    }
>
>    size_t objSize = getSize (ptr);
>    if (objSize == sz) {
>      return ptr;
>    }
>
>
>    void * buf = malloc (sz);
>
>
>
>
>    size_t minSize = (objSize < sz) ? objSize : sz;
>    if (buf) {
>      memcpy (buf, ptr, minSize);
>    }
>
>
>    free (ptr);
>    return buf;
>  }
>
>  inline size_t getSize (void * ptr) {
>    if (ptr) {
>      return SuperHeap::getSize (ptr);
>    } else {
>      return 0;
>    }
>  }
>
>private:
>  inline static size_t align (size_t sz) {
>    return (sz + (sizeof(double) - 1)) & ~(sizeof(double) - 1);
>  }
>};
>
>}
># 56 "hoard.h" 2
># 1 "heaplayers/debugheap.h" 1
>
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 8 "heaplayers/debugheap.h" 2
>
>
>
>
>
>
>namespace HL {
>
>template <class Super,
>   char freeChar = 'F'>
>class DebugHeap : public Super {
>private:
>
>  enum { CANARY = 0xdeadbeef };
>
>public:
>
>
>  inline void * malloc (size_t sz) {
>
>    void * ptr;
>    ptr = Super::malloc (sz + sizeof(unsigned long));
>    memset (ptr, 'A', sz);
>    *((unsigned long *) ((char *) ptr + sz)) = (unsigned long) CANARY;
>    (static_cast<void> (0));
>    return ptr;
>  }
>
>
>  inline void free (void * ptr) {
>    char * b = (char *) ptr;
>    size_t sz = Super::getSize(ptr);
>
>    unsigned long storedCanary = *((unsigned long *) b + sz - sizeof(unsigned long));
>    if (storedCanary != CANARY) {
>      abort();
>    }
>    memset (ptr, freeChar, sz);
>    Super::free (ptr);
>  }
>};
>
>}
># 57 "hoard.h" 2
>
># 1 "heaplayers/util/winlock.h" 1
># 59 "hoard.h" 2
># 1 "heaplayers/bins4k.h" 1
>
>
>
>
>
># 1 "heaplayers/bins.h" 1
># 7 "heaplayers/bins4k.h" 2
>
>
>namespace HL {
>
>  template <class Header>
>    class bins<Header, 4096> {
>
>    public:
>      bins (void) {}
>
>      enum { NUM_BINS = 33 };
>      enum { BIG_OBJECT = 4096 - sizeof(Header) };
>
>      static const size_t _bins[NUM_BINS];
>
>      static inline int getSizeClass (size_t sz) {
> (static_cast<void> (0));
> if (sz < 8) {
>   return 0;
> } else if (sz <= 128) {
>   return ((sz + 7) >> 3) - 1;
> } else {
>   return slowLookupSizeClass (sz);
> }
>      }
>
>      static inline size_t getClassSize (const int i) {
> (static_cast<void> (0));
> (static_cast<void> (0));
> return _bins[i];
>      }
>
>    private:
>
>      static int slowLookupSizeClass (const size_t sz) {
>
>
> int sizeclass = 0;
> while (_bins[sizeclass] < sz)
>   {
>     sizeclass++;
>     (static_cast<void> (0));
>   }
> return sizeclass;
>      }
>
>      sassert<(BIG_OBJECT > 0)> verifyHeaderSize;
>
>    };
>}
>
>template <class Header>
>const size_t HL::bins<Header, 4096>::_bins[NUM_BINS] = {8UL, 16UL, 24UL, 32UL, 40UL, 48UL, 56UL, 64UL, 72UL, 80UL, 88UL, 96UL, 104UL, 112UL, 120UL, 128UL, 152UL, 176UL, 208UL, 248UL, 296UL, 352UL, 416UL, 496UL, 592UL, 704UL, 856UL, 1024UL, 1224UL, 1712UL, 2048UL, 3416UL, 4096UL - sizeof(Header)};
># 60 "hoard.h" 2
># 1 "heaplayers/bins8k.h" 1
># 9 "heaplayers/bins8k.h"
>namespace HL {
>
>  template <class Header>
>    class bins<Header, 8192> {
>
>    public:
>      bins (void) {}
>
>  enum { NUM_BINS = 32 };
>  enum { NUM_SIZECLASSES = 1018 };
>
>  enum { BIG_OBJECT = 4096 - sizeof(Header) };
>
>  static const size_t _bins[NUM_BINS];
>  static const int _sizeclasses[NUM_SIZECLASSES];
>
>  static inline int getSizeClass (size_t sz) {
>    (static_cast<void> (0));
>    const int ind = (sz - 1) >> 3;
>    (static_cast<void> (0));
>    return _sizeclasses[ind];
>  }
>
>  static inline size_t getClassSize (const int i) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return _bins[i];
>  }
>
>private:
>
>  sassert<(BIG_OBJECT > 0)> verifyHeaderSize;
>
>};
>
>}
>
>template <class Header>
>const size_t HL::bins<Header, 8192>::_bins[NUM_BINS] = {8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 96, 112, 128, 152, 176, 208, 248, 296, 352, 416, 496, 592, 704, 840, 1008, 1208, 1448, 1736, 2272, 2720, 3400, BIG_OBJECT};
>
>template <class Header>
>const int HL::bins<Header, 8192>::_sizeclasses[NUM_SIZECLASSES] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33 };
># 61 "hoard.h" 2
># 1 "heaplayers/bins16k.h" 1
>
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 8 "heaplayers/bins16k.h" 2
>
>
>
>
>namespace HL {
>
>template <class Header>
>class bins<Header, 16384> {
>public:
>
>  bins (void)
>  {
>  }
>
>  enum { NUM_BINS = 24 };
>  enum { NUM_SIZECLASSES = 2044 };
>
>  enum { BIG_OBJECT = 16384 - sizeof(Header) };
>
>  static const size_t _bins[NUM_BINS];
>  static const int _sizeclasses[NUM_SIZECLASSES];
>
>  static inline int getSizeClass (size_t sz) {
>    (static_cast<void> (0));
>    const int ind = (sz - 1) >> 3;
>    return _sizeclasses[ind];
>  }
>
>  static inline size_t getClassSize (const int i) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return _bins[i];
>  }
>
>private:
>
>  sassert<(BIG_OBJECT > 0)> verifyHeaderSize;
>
>};
>
>}
>
>template <class Header>
>const size_t HL::bins<Header, 16384>::_bins[NUM_BINS] = { 8, 16, 24, 32, 40, 56, 80, 112, 160, 224, 320, 456, 648, 920, 1312, 1864, 2656, 3784, 5392, 5448, 7760, 8176, 11648, 16384 - sizeof(Header) };
>
>template <class Header>
>const int HL::bins<Header, 16384>::_sizeclasses[NUM_SIZECLASSES] = { 0, 1, 2, 3, 4, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23 };
># 62 "hoard.h" 2
># 1 "heaplayers/bins64k.h" 1
>
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 8 "heaplayers/bins64k.h" 2
>
>
>
>
>namespace HL {
>
>template <class Header>
>class bins<Header, 65536> {
>public:
>
>  bins (void)
>  {
># 28 "heaplayers/bins64k.h"
>  }
>
>  enum { BIG_OBJECT = 65536 / 2 - sizeof(Header) };
>
>  enum { NUM_BINS = 55,
>  NUM_LOOKUP = 508 };
>
>  static const size_t _bins[NUM_BINS];
>  static const int _sizeclasses[NUM_LOOKUP];
>
>  static inline int getSizeClass (size_t sz) {
>    (static_cast<void> (0));
>    sz = (sz < sizeof(double))? sizeof(double) : sz;
>    if (sz <= 80) {
>      return (sz - 1) >> 3;
>    } else {
>      return slowGetSizeClass (sz);
>    }
>  }
>
>  static inline size_t getClassSize (const int i) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return _bins[i];
>  }
>
>private:
>
>  static inline size_t slowGetSizeClass (size_t sz) {
>    int ind = 0;
>    while (sz > _bins[ind]) {
>      ind++;
>      (static_cast<void> (0));
>    }
>    return ind;
>  }
>
>  sassert<(BIG_OBJECT > 0)> verifyHeaderSize;
>};
>
>}
>
>
>template <class Header>
>const size_t HL::bins<Header, 65536>::_bins[NUM_BINS] =
>  { 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 96, 112, 128, 152, 176, 208, 248, 296, 352, 416, 496, 592, 704, 840, 1008, 1208, 1448, 1736, 2080, 2496, 2992, 3584, 4096 - sizeof(Header), 4912, 5888, 7064, 8192 - sizeof(Header), 9824, 11784, 12288 - sizeof(Header), 14744, 16384 - sizeof(Header), 19656, 20480 - sizeof(Header), 24576 - sizeof(Header), 28672 - sizeof(Header), 32768 - sizeof(Header), 36864 - sizeof(Header), 40960 - sizeof(Header), 45056 - sizeof(Header), 49152 - sizeof(Header), 53248 - sizeof(Header), 57344 - sizeof(Header), 61440 - sizeof(Header), 65536 - sizeof(Header) };
>
>template <class Header>
>const int HL::bins<Header, 65536>::_sizeclasses[NUM_LOOKUP] =
>  {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 11, 11, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32 };
># 63 "hoard.h" 2
># 1 "heaplayers/oneheap.h" 1
># 34 "heaplayers/oneheap.h"
>namespace HL {
>
>template <class SuperHeap>
>class OneHeap {
>public:
>  OneHeap (void)
>  : theHeap (getHeap())
>  {}
>
>  inline void * malloc (const size_t sz) {
>    return theHeap->malloc (sz);
>  }
>  inline void free (void * ptr) {
>    theHeap->free (ptr);
>  }
>  inline int remove (void * ptr) {
>    return theHeap->remove (ptr);
>  }
>  inline void clear (void) {
>    theHeap->clear();
>  }
>  inline size_t getSize (void * ptr) {
>    return theHeap->getSize (ptr);
>  }
>
>  enum { Alignment = SuperHeap::Alignment };
>
>private:
>
>  SuperHeap * theHeap;
>
>  inline static SuperHeap * getHeap (void) {
>    static SuperHeap theHeap;
>    return &theHeap;
>  }
>
>};
>
>}
># 64 "hoard.h" 2
>
># 1 "heaplayers/threadheap.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "heaplayers/threadheap.h" 2
># 32 "heaplayers/threadheap.h"
>namespace HL {
>
>template <int NumHeaps, class PerThreadHeap>
>class ThreadHeap : public PerThreadHeap {
>public:
>
>  inline void * malloc (size_t sz) {
>    int tid = getThreadId() % NumHeaps;
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return getHeap(tid)->malloc (sz);
>  }
>
>  inline void free (void * ptr) {
>    int tid = getThreadId() % NumHeaps;
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    getHeap(tid)->free (ptr);
>  }
>
>  inline size_t getSize (void * ptr) {
>    int tid = getThreadId() % NumHeaps;
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return getHeap(tid)->getSize (ptr);
>  }
>
>
>private:
>
>
>  inline PerThreadHeap * getHeap (int index) {
>    (static_cast<void> (0));
>    (static_cast<void> (0));
>    return &ptHeaps[index];
>  }
>
>
>  inline static volatile int getThreadId (void);
>
>  PerThreadHeap ptHeaps[NumHeaps];
>
>};
>
>}
># 90 "heaplayers/threadheap.h"
>template <int NumHeaps, class PerThreadHeap>
>inline volatile int
>HL::ThreadHeap<NumHeaps, PerThreadHeap>::getThreadId (void) {
># 106 "heaplayers/threadheap.h"
>  return (int) pthread_self() >> 10;
># 125 "heaplayers/threadheap.h"
>}
># 66 "hoard.h" 2
># 1 "heaplayers/hybridheap.h" 1
>
>
>
>
>
># 1 "/usr/include/assert.h" 1 3 4
># 7 "heaplayers/hybridheap.h" 2
># 16 "heaplayers/hybridheap.h"
>namespace HL {
>
>template <int BigSize, class SmallHeap, class BigHeap>
>class HybridHeap : public SmallHeap {
>public:
>
>  HybridHeap (void)
>  {
>  }
>
>  enum { Alignment = ((int) SmallHeap::Alignment < (int) BigHeap::Alignment) ?
>                      (int) SmallHeap::Alignment :
>               (int) BigHeap::Alignment };
>
>  __attribute__((malloc)) inline void * malloc (size_t sz) {
>    if (sz <= BigSize) {
>      return SmallHeap::malloc (sz);
>    } else {
>      return slowPath (sz);
>    }
>  }
>
>  inline void free (void * ptr) {
>    if (SmallHeap::getSize(ptr) <= BigSize) {
>      SmallHeap::free (ptr);
>    } else {
>      bm.free (ptr);
>    }
>  }
>
>  inline void clear (void) {
>    bm.clear();
>    SmallHeap::clear();
>  }
>
>
>private:
>
>  __attribute__((malloc)) __attribute__ ((noinline))
>    void * slowPath (size_t sz) {
>    return bm.malloc (sz);
>  }
>
>
>  HL::sassert<(BigSize > 0)> checkBigSizeNonZero;
>
>  BigHeap bm;
>};
>
>}
># 67 "hoard.h" 2
># 1 "heaplayers/util/posixlock.h" 1
># 39 "heaplayers/util/posixlock.h"
>namespace HL {
>
>class PosixLockType {
>public:
>
>  PosixLockType (void)
>  {
>    pthread_mutex_init (&mutex, __null);
>  }
>
>  ~PosixLockType (void)
>  {
>    pthread_mutex_destroy (&mutex);
>  }
>
>  void lock (void) {
>    pthread_mutex_lock (&mutex);
>  }
>
>  void unlock (void) {
>    pthread_mutex_unlock (&mutex);
>  }
>
>private:
>  union {
>    pthread_mutex_t mutex;
>    double _dummy[sizeof(pthread_mutex_t)/sizeof(double) + 1];
>  };
>};
>
>}
># 68 "hoard.h" 2
># 1 "heaplayers/spinlock.h" 1
># 69 "hoard.h" 2
># 77 "hoard.h"
>typedef HL::SpinLockType TheLockType;
>
>
>namespace Hoard {
>
>  typedef GlobalHeap<65536, 8, TheLockType> TheGlobalHeap;
>
>  class hoardThresholdFunctionClass {
>  public:
>    inline static bool function (int u, int a, size_t objSize) {
>
>
>
>
>
>
>      bool r = ((8 * u) < ((8 -1) * a)) && ((u < a - (2 * 65536) / (int) objSize));
>      return r;
>    }
>  };
>
>
>  class SmallHeap;
>
>  typedef HoardSuperblock<TheLockType, 65536, SmallHeap> SmallSuperblockType;
>
>
>  class SmallHeap :
>    public ConformantHeap<
>    HoardManager<AlignedSuperblockHeap<TheLockType, 65536>,
>   TheGlobalHeap,
>   SmallSuperblockType,
>   8,
>   TheLockType,
>   hoardThresholdFunctionClass,
>   SmallHeap> > {};
>
>  class BigHeap;
>
>  typedef HoardSuperblock<TheLockType, 65536, BigHeap> BigSuperblockType;
>
>
>  class BigHeap :
>    public ConformantHeap<HL::LockedHeap<TheLockType,
>      AddHeaderHeap<BigSuperblockType,
>             65536,
>             AlignedMmap<65536> > > >
>  {};
>
>
>  enum { BigObjectSize =
>  HL::bins<SmallSuperblockType::Header, 65536>::BIG_OBJECT };
>
>  class PerThreadHoardHeap :
>    public RedirectFree<LockMallocHeap<SmallHeap>,
>   SmallSuperblockType> {};
>
>  template <int N, int NH>
>  class HoardHeap :
>    public HL::ANSIWrapper<
>    IgnoreInvalidFree<
>      HL::HybridHeap<Hoard::BigObjectSize,
>       ThreadPoolHeap<N, NH, Hoard::PerThreadHoardHeap>,
>       Hoard::BigHeap> > >
>  {
>  public:
>
>    enum { BIG_OBJECT = Hoard::BigObjectSize };
>
>    HL::sassert<sizeof(Hoard::BigSuperblockType::Header)
>      == sizeof(Hoard::SmallSuperblockType::Header)> ensureSameSizeHeaders;
>  };
>
>};
># 94 "libhoard.cpp" 2
># 1 "heapmanager.h" 1
># 11 "heapmanager.h"
>namespace Hoard {
>
>  template <typename LockType,
>     typename HeapType>
>  class HeapManager : public HeapType {
>  public:
>
>    HeapManager (void)
>    {
>      HL::Guard<LockType> g (heapLock);
>
>
>      int i;
>      for (i = 0; i < HeapType::MaxThreads; i++) {
> HeapType::setTidMap (i, 0);
>      }
>      for (i = 0; i < HeapType::MaxHeaps; i++) {
> HeapType::setInusemap (i, 0);
>      }
>    }
>
>
>    void chooseZero (void) {
>      HL::Guard<LockType> g (heapLock);
>      HeapType::setTidMap ((int) HL::CPUInfo::getThreadId() % MaxThreads, 0);
>    }
>
>    int findUnusedHeap (void) {
>
>      HL::Guard<LockType> g (heapLock);
>
>      unsigned int tid_original = HL::CPUInfo::getThreadId();
>      unsigned int tid = tid_original % HeapType::MaxThreads;
>
>      int i = 0;
>      while ((i < HeapType::MaxHeaps) && (HeapType::getInusemap(i)))
> i++;
>      if (i >= HeapType::MaxHeaps) {
>
> i = 0;
>      }
>
>      HeapType::setInusemap (i, 1);
>      HeapType::setTidMap (tid, i);
>
>      return i;
>    }
>
>    void releaseHeap (void) {
>
>
>      HL::Guard<LockType> g (heapLock);
>
>
>      enum { VerifyPowerOfTwo = 1 / ((HeapType::MaxThreads & ~(HeapType::MaxThreads-1))) };
>
>      int tid = HL::CPUInfo::getThreadId() & (HeapType::MaxThreads - 1);
>      int heapIndex = HeapType::getTidMap (tid);
>
>      HeapType::setInusemap (heapIndex, 0);
>
>
>
>      if (HeapType::getInusemap (heapIndex) < 0) {
> HeapType::setInusemap (heapIndex, 0);
>      }
>    }
>
>
>  private:
>
>
>
>    HeapManager (const HeapManager&);
>    HeapManager& operator= (const HeapManager&);
>
>
>    LockType heapLock;
>  };
>
>};
># 95 "libhoard.cpp" 2
># 1 "tlab.h" 1
># 13 "tlab.h"
>namespace Hoard {
>
>template <int NumBins,
>   int (*getSizeClass) (size_t),
>   size_t (*getClassSize) (const int),
>   int LargestObject,
>   int LocalHeapThreshold,
>   class SuperblockType,
>   int SuperblockSize,
>   class ParentHeap>
>
>class ThreadLocalAllocationBuffer {
>
>public:
>
>  ThreadLocalAllocationBuffer (ParentHeap * parent)
>    : _parentHeap (parent),
>      _localHeapBytes (0)
>  {
>  }
>
>  ~ThreadLocalAllocationBuffer (void) {
>    clear();
>  }
>
>  inline static size_t getSize (void * ptr) {
>    return getSuperblock(ptr)->getSize (ptr);
>  }
>
>  inline static void * normalize (void * ptr) {
>    SuperblockType * s = getSuperblock(ptr);
>    if (!s->isValidSuperblock()) {
>      return __null;
>    } else {
>      return s->normalize (ptr);
>    }
>  }
>
>  inline void * malloc (size_t sz) {
>
>
>    if (sz <= LargestObject) {
>      int c = getSizeClass (sz);
>      void * ptr = _localHeap(c).get();
>      if (ptr) {
> _localHeapBytes -= sz;
> (static_cast<void> (0));
> return ptr;
>      }
>    }
>
>
>
>    void * ptr = _parentHeap->malloc (sz);
>    return ptr;
>  }
>
>
>  inline void free (void * ptr) {
>    if (!ptr) {
>      return;
>    }
>    const SuperblockType * s = getSuperblock (ptr);
>
>
>
>    if (s->isValidSuperblock()) {
>      const size_t sz = s->getSize (ptr);
>
>
>      if (sz <= LargestObject) {
>
> (static_cast<void> (0));
> int c = getSizeClass (sz);
> _localHeap(c).insert ((HL::DLList::Entry *) ptr);
> _localHeapBytes += sz;
>
>
>
>
> if (_localHeapBytes > LocalHeapThreshold) {
>   clear();
> }
> return;
>      }
>
>
>      _parentHeap->free (ptr);
>    } else {
>
>
>
>
>
>    }
>  }
>
>  void clear (void) {
>
>    for (int i = NumBins-1; i >= 0; i--) {
>      while (!_localHeap(i).isEmpty()) {
> HL::DLList::Entry * e = _localHeap(i).get();
> _parentHeap->free (e);
>      }
>    }
>    _localHeapBytes = 0;
>  }
>
>  static inline SuperblockType * getSuperblock (void * ptr) {
>    return SuperblockType::getSuperblock (ptr);
>  }
>
>private:
>
>
>
>  ThreadLocalAllocationBuffer (const ThreadLocalAllocationBuffer&);
>  ThreadLocalAllocationBuffer& operator=(const ThreadLocalAllocationBuffer&);
>
>
>  ParentHeap * _parentHeap;
>
>
>  int _localHeapBytes;
>
>
>  Array<NumBins, HL::DLList> _localHeap;
>
>};
>
>}
># 96 "libhoard.cpp" 2
>
>
>
>
>
>namespace Hoard {
>
>  class HoardHeapType :
>    public HeapManager<TheLockType, HoardHeap<MaxThreads, NumHeaps> > {
>  };
>
>
>
>
>
>
>
>  class TheHeader : public HoardHeapType::SuperblockType::Header {
>  public:
>    TheHeader (size_t sz, size_t buf)
>      : HoardHeapType::SuperblockType::Header (sz, buf)
>    {}
>  };
>
>  typedef ThreadLocalAllocationBuffer<HL::bins<TheHeader, 65536>::NUM_BINS,
>          HL::bins<TheHeader, 65536>::getSizeClass,
>          HL::bins<TheHeader, 65536>::getClassSize,
>          LargestSmallObject,
>          MAX_MEMORY_PER_TLAB,
>          HoardHeapType::SuperblockType,
>          65536,
>          HoardHeapType> TLABBase;
>
>  class TLAB : public TLABBase {
>  public:
>    TLAB (HoardHeapType * h)
>      : TLABBase (h)
>    {}
>
>    inline void free (void * ptr) {
>      if (ptr != 0) {
>
> ptr = TLABBase::normalize (ptr);
> TLABBase::free (ptr);
>      }
>    }
>  };
>
>}
>
>using namespace Hoard;
>
>typedef TLAB TheCustomHeapType;
>
>
>
>inline static HoardHeapType * getMainHoardHeap (void) {
>
>
>
>  static double thBuf[sizeof(HoardHeapType) / sizeof(double) + 1];
>
>
>  static HoardHeapType * th = new (thBuf) HoardHeapType;
>  return th;
>}
>
>
>
>
>
>
># 1 "userealtls.cpp" 1
># 13 "userealtls.cpp"
># 1 "VERSION.h" 1
># 14 "userealtls.cpp" 2
># 33 "userealtls.cpp"
>static __thread double tlabBuffer[sizeof(TheCustomHeapType) / sizeof(double) + 1];
>static __thread TheCustomHeapType * theTLAB = __null;
>
>static void initializeCustomHeap (void) {
>  new ((char *) &tlabBuffer) TheCustomHeapType (getMainHoardHeap());
>  theTLAB = (TheCustomHeapType *) &tlabBuffer;
>}
>
>inline TheCustomHeapType * getCustomHeap (void) {
>
>  if (!theTLAB) {
>    initializeCustomHeap();
>  }
>  return theTLAB;
>}
># 196 "userealtls.cpp"
>extern "C" {
>
>typedef void * (*threadFunctionType) (void *);
>
>typedef
>int (*pthread_create_function) (pthread_t *thread,
>    const pthread_attr_t *attr,
>    threadFunctionType start_routine,
>    void *arg);
>}
>
>
>static void exitRoutine (void) {
>
>  getCustomHeap()->clear();
>
>
>  getMainHoardHeap()->releaseHeap();
>}
>
>
>extern "C" {
>
>static void * startMeUp (void * a)
>{
>  getCustomHeap();
>  getMainHoardHeap()->findUnusedHeap();
>
>  pair<threadFunctionType, void *> * z
>    = (pair<threadFunctionType, void *> *) a;
>
>  threadFunctionType f = z->first;
>  void * arg = z->second;
>  void * result = (*f)(arg);
>  exitRoutine();
>  return result;
>}
>
>}
>
># 1 "/usr/include/dlfcn.h" 1 3 4
># 25 "/usr/include/dlfcn.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 26 "/usr/include/dlfcn.h" 2 3 4
>
>
># 1 "/usr/include/bits/dlfcn.h" 1 3 4
># 58 "/usr/include/bits/dlfcn.h" 3 4
>extern "C" {
>
>
>extern void _dl_mcount_wrapper_check (void *__selfpc) throw ();
>
>}
># 29 "/usr/include/dlfcn.h" 2 3 4
># 45 "/usr/include/dlfcn.h" 3 4
>typedef long int Lmid_t;
>
>
>
>
>
>
>
>extern "C" {
>
>
>
>extern void *dlopen (__const char *__file, int __mode) throw ();
>
>
>
>extern int dlclose (void *__handle) throw () __attribute__ ((__nonnull__ (1)));
>
>
>
>extern void *dlsym (void *__restrict __handle,
>      __const char *__restrict __name) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>extern void *dlmopen (Lmid_t __nsid, __const char *__file, int __mode) throw ();
>
>
>
>extern void *dlvsym (void *__restrict __handle,
>       __const char *__restrict __name,
>       __const char *__restrict __version)
>     throw () __attribute__ ((__nonnull__ (2, 3)));
>
>
>
>
>
>extern char *dlerror (void) throw ();
>
>
>
>
>
>typedef struct
>{
>  __const char *dli_fname;
>  void *dli_fbase;
>  __const char *dli_sname;
>  void *dli_saddr;
>} Dl_info;
>
>
>
>extern int dladdr (__const void *__address, Dl_info *__info)
>     throw () __attribute__ ((__nonnull__ (2)));
>
>
>extern int dladdr1 (__const void *__address, Dl_info *__info,
>      void **__extra_info, int __flags) throw () __attribute__ ((__nonnull__ (2)));
>
>
>
>
>enum
>  {
>
>    RTLD_DL_SYMENT = 1,
>
>
>    RTLD_DL_LINKMAP = 2
>  };
>
>
>
>
>
>
>
>extern int dlinfo (void *__restrict __handle,
>     int __request, void *__restrict __arg)
>     throw () __attribute__ ((__nonnull__ (1, 3)));
>
>
>enum
>  {
>
>    RTLD_DI_LMID = 1,
>
>
>
>    RTLD_DI_LINKMAP = 2,
>
>
>
>
>
>
>    RTLD_DI_SERINFO = 4,
>    RTLD_DI_SERINFOSIZE = 5,
>
>
>
>    RTLD_DI_ORIGIN = 6,
>
>    RTLD_DI_CONFIGADDR = 3
>  };
>
>
>
>
>typedef struct
>{
>  char *dls_name;
>  unsigned int dls_flags;
>} Dl_serpath;
>
>
>
>typedef struct
>{
>  size_t dls_size;
>  unsigned int dls_cnt;
>  Dl_serpath dls_serpath[1];
>} Dl_serinfo;
>
>
>
>}
># 237 "userealtls.cpp" 2
>
>
>extern "C" int pthread_create (pthread_t *thread,
>          const pthread_attr_t *attr,
>          void * (*start_routine) (void *),
>          void * arg)
>
>  throw ()
>
>{
>
>  static pthread_create_function real_pthread_create = __null;
>
>
>  volatile static TheCustomHeapType * t = getCustomHeap();
>
>
>  char fname[] = "pthread_create";
>
>
>
>
>
>
>
>  if (real_pthread_create == __null) {
>    real_pthread_create = (pthread_create_function) dlsym (((void *) -1l), fname);
>    if (real_pthread_create == __null) {
>      fprintf (stderr, "Could not find the pthread_create function!\n");
>      fprintf (stderr, "Please report this problem to emery@cs.umass.edu.\n");
>      abort();
>    }
>  }
>
>  anyThreadCreated = 1;
>
>  pair<threadFunctionType, void *> * args
>    = new pair<threadFunctionType, void *> (start_routine, arg);
>
>  int result = (*real_pthread_create)(thread, attr, startMeUp, args);
>
>  return result;
>}
># 169 "libhoard.cpp" 2
>
>
>
>
>
># 1 "heaplayers/wrapper.cpp" 1
># 35 "heaplayers/wrapper.cpp"
># 1 "/usr/include/malloc.h" 1 3 4
># 24 "/usr/include/malloc.h" 3 4
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/stddef.h" 1 3 4
># 25 "/usr/include/malloc.h" 2 3 4
># 46 "/usr/include/malloc.h" 3 4
>extern "C" {
>
>
>extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ;
>
>
>extern void *calloc (size_t __nmemb, size_t __size) throw ()
>       __attribute__ ((__malloc__)) ;
>
>
>
>extern void *realloc (void *__ptr, size_t __size) throw ()
>       __attribute__ ((__malloc__)) __attribute__ ((__warn_unused_result__));
>
>
>extern void free (void *__ptr) throw ();
>
>
>extern void cfree (void *__ptr) throw ();
>
>
>extern void *memalign (size_t __alignment, size_t __size) throw ()
>       __attribute__ ((__malloc__)) ;
>
>
>extern void *valloc (size_t __size) throw ()
>       __attribute__ ((__malloc__)) ;
>
>
>
>extern void * pvalloc (size_t __size) throw ()
>       __attribute__ ((__malloc__)) ;
>
>
>
>extern void *(*__morecore) (ptrdiff_t __size);
>
>
>extern void *__default_morecore (ptrdiff_t __size) throw ()
>       __attribute__ ((__malloc__));
>
>
>
>struct mallinfo {
>  int arena;
>  int ordblks;
>  int smblks;
>  int hblks;
>  int hblkhd;
>  int usmblks;
>  int fsmblks;
>  int uordblks;
>  int fordblks;
>  int keepcost;
>};
>
>
>extern struct mallinfo mallinfo (void) throw ();
># 128 "/usr/include/malloc.h" 3 4
>extern int mallopt (int __param, int __val) throw ();
>
>
>
>extern int malloc_trim (size_t __pad) throw ();
>
>
>
>extern size_t malloc_usable_size (void *__ptr) throw ();
>
>
>extern void malloc_stats (void) throw ();
>
>
>extern void *malloc_get_state (void) throw ();
>
>
>
>extern int malloc_set_state (void *__ptr) throw ();
>
>
>
>
>extern void (*__malloc_initialize_hook) (void);
>
>extern void (*__free_hook) (void *__ptr, __const void *);
>
>extern void *(*__malloc_hook) (size_t __size, __const void *);
>
>extern void *(*__realloc_hook) (void *__ptr, size_t __size, __const void *);
>
>extern void *(*__memalign_hook) (size_t __alignment, size_t __size, __const void *);
>
>
>extern void (*__after_morecore_hook) (void);
>
>
>extern void __malloc_check_init (void) throw ();
>
>
>}
># 36 "heaplayers/wrapper.cpp" 2
># 59 "heaplayers/wrapper.cpp"
># 1 "/usr/include/errno.h" 1 3 4
># 32 "/usr/include/errno.h" 3 4
>extern "C" {
>
>
>
># 1 "/usr/include/bits/errno.h" 1 3 4
># 25 "/usr/include/bits/errno.h" 3 4
># 1 "/usr/include/linux/errno.h" 1 3 4
>
>
>
># 1 "/usr/include/asm/errno.h" 1 3 4
># 5 "/usr/include/linux/errno.h" 2 3 4
># 26 "/usr/include/bits/errno.h" 2 3 4
># 38 "/usr/include/bits/errno.h" 3 4
>extern int *__errno_location (void) throw () __attribute__ ((__const__));
># 37 "/usr/include/errno.h" 2 3 4
># 55 "/usr/include/errno.h" 3 4
>extern char *program_invocation_name, *program_invocation_short_name;
>
>
>
>}
># 69 "/usr/include/errno.h" 3 4
>typedef int error_t;
># 60 "heaplayers/wrapper.cpp" 2
># 93 "heaplayers/wrapper.cpp"
>extern "C" void * malloc(size_t sz)
>{
>  TheCustomHeapType * theCustomHeap = getCustomHeap();
>  void * ptr = theCustomHeap->malloc (sz);
>  return ptr;
>}
>
>extern "C" void * calloc(size_t nelem,size_t elsize)
>{
>  size_t n = nelem * elsize;
>  void * ptr = malloc(n);
>
>  if (ptr != __null) {
>    memset (ptr, 0, n);
>  }
>  return ptr;
>}
>
>
>
>extern "C" void * memalign(size_t alignment,size_t size);
>
>extern "C" int posix_memalign (void **memptr, size_t alignment, size_t size)
>{
>
>  if ((alignment == 0) ||
>      (alignment & (alignment - 1)))
>    {
>      return 22;
>    }
>  void * ptr = memalign(alignment,size);
>  if (!ptr) {
>    return 12;
>  } else {
>    *memptr = ptr;
>    return 0;
>  }
>}
>
>
>
>extern "C" void * memalign(size_t alignment,size_t size)
>{
>
>  if (alignment == sizeof(double)) {
>    return malloc(size);
>  } else {
>    void * ptr = malloc(size + 2 * alignment);
>    void * alignedPtr = (void *) (((size_t) ptr + alignment - 1) & ~(alignment - 1));
>    return alignedPtr;
>  }
>}
>
>extern "C" size_t malloc_usable_size(void * ptr)
>{
>  TheCustomHeapType * theCustomHeap = getCustomHeap();
>  if (ptr == __null) {
>    return 0;
>  }
>  return theCustomHeap->getSize(ptr);
>}
>
>extern "C" void free(void * ptr)
>{
>  TheCustomHeapType * theCustomHeap = getCustomHeap();
>  theCustomHeap->free (ptr);
>}
>
>extern "C" void * realloc(void * ptr,size_t sz)
>{
>  if (ptr == __null) {
>    ptr = malloc(sz);
>    return ptr;
>  }
>  if (sz == 0) {
>    free(ptr);
>    return __null;
>  }
>
>  size_t objSize = malloc_usable_size(ptr);
>  void * buf = malloc((size_t) (sz));
>
>  if (buf != __null) {
>
>
>    size_t minSize = (objSize < sz) ? objSize : sz;
>    memcpy (buf, ptr, minSize);
>  }
>
>
>  free(ptr);
>
>
>  return buf;
>}
>
>
>extern "C" char * strndup (const char * s, size_t sz)
>{
>  char * newString = __null;
>  if (s != __null) {
>    size_t cappedLength = strnlen (s, sz);
>    if ((newString = (char *) malloc(cappedLength + 1))) {
>      strncpy(newString, s, cappedLength);
>      newString[cappedLength] = '\0';
>    }
>  }
>  return newString;
>}
>
>
>extern "C" char * strdup (const char * s)
>{
>  char * newString = __null;
>  if (s != __null) {
>    if ((newString = (char *) malloc(strlen(s) + 1))) {
>      strcpy(newString, s);
>    }
>  }
>  return newString;
>}
>
>
>
># 1 "/usr/lib/gcc/i386-redhat-linux/4.0.2/include/limits.h" 1 3 4
># 218 "heaplayers/wrapper.cpp" 2
>
>
>
>
>
>
>typedef char * getcwdFunction (char *, size_t);
>
>extern "C" char * getcwd (char * buf, size_t size)
>{
>  static getcwdFunction * real_getcwd
>    = (getcwdFunction *) dlsym (((void *) -1l), "getcwd");
>
>  if (!buf) {
>    if (size == 0) {
>      size = 4096;
>    }
>    buf = (char *) malloc(size);
>  }
>  return (real_getcwd)(buf, size);
>}
>
>
>
>
>namespace std {
>  struct nothrow_t;
>}
>
>void * operator new (size_t sz)
>{
>  return malloc(sz);
>}
>
>void operator delete (void * ptr)
>{
>  free(ptr);
>}
>
>
>void * operator new (size_t sz, const std::nothrow_t&) throw() {
>  return malloc(sz);
>}
>
>void * operator new[] (size_t size)
>
>{
>  return malloc(size);
>}
>
>void * operator new[] (size_t sz, const std::nothrow_t&) throw() {
>  return malloc(sz);
>}
>
>void operator delete[] (void * ptr)
>{
>  free(ptr);
>}
># 284 "heaplayers/wrapper.cpp"
>extern "C" int mallopt(int number,int value)
>{
>
>  return 0;
>}
>
>
>
>extern "C" void * valloc(size_t sz)
>{
>  return memalign(8192,sz);
>}
>
>
>extern "C" void * pvalloc(size_t sz)
>{
>
>
>  return valloc((sz + 8191) & ~8191);
>}
># 174 "libhoard.cpp" 2

Actions: View

Attachments on bug 241402: 155473