// Figure out how to get a hash set and a hash map.
-#if defined(HAVE_TR1_UNORDERED_SET) && defined(HAVE_TR1_UNORDERED_MAP)
+#if defined(HAVE_TR1_UNORDERED_SET) && defined(HAVE_TR1_UNORDERED_MAP) \
+ && defined(HAVE_TR1_UNORDERED_MAP_REHASH)
#include <tr1/unordered_set>
#include <tr1/unordered_map>
#define Unordered_set std::tr1::unordered_set
#define Unordered_map std::tr1::unordered_map
+#define reserve_unordered_map(map, n) ((map)->rehash(n))
+
#elif defined(HAVE_EXT_HASH_MAP) && defined(HAVE_EXT_HASH_SET)
#include <ext/hash_map>
}
+#define reserve_unordered_map(map, n) ((map)->resize(n))
+
#else
// The fallback is to just use set and map.
#define Unordered_set std::set
#define Unordered_map std::map
+#define reserve_unordered_map(map, n)
+
#endif
#ifndef HAVE_PREAD
#ifndef HAVE_MREMAP
#define MREMAP_MAYMOVE 1
-extern "C" void *mremap (void *, size_t, size_t, int, ...);
+extern "C" void *mremap(void *, size_t, size_t, int, ...);
+#endif
+
+#ifndef HAVE_FFSLL
+extern "C" int ffsll(long long);
#endif
namespace gold
class General_options;
class Command_line;
-class Input_argument_list;
class Dirsearch;
class Input_objects;
class Mapfile;
// Queue up the set of tasks to be done before
// the middle set of tasks. Only used when garbage
-// collection is to be done.
+// collection is to be done.
extern void
queue_middle_gc_tasks(const General_options&,
const Task*,