Searched refs:rehash (Results 1 - 25 of 38) sorted by relevance

12

/netbsd-current/external/gpl3/binutils.old/dist/gold/
H A Dsystem.h77 #define reserve_unordered_map(map, n) ((map)->rehash(n))
91 #define reserve_unordered_map(map, n) ((map)->rehash(n))
H A Dstringpool.cc79 this->string_set_.rehash(this->string_set_.size() + n);
82 // rehash() implementation is broken in gcc 4.0.3's stl
83 //this->string_set_.rehash(this->string_set_.size() + n);
/netbsd-current/external/gpl3/binutils/dist/gold/
H A Dsystem.h77 #define reserve_unordered_map(map, n) ((map)->rehash(n))
91 #define reserve_unordered_map(map, n) ((map)->rehash(n))
H A Dstringpool.cc79 this->string_set_.rehash(this->string_set_.size() + n);
82 // rehash() implementation is broken in gcc 4.0.3's stl
83 //this->string_set_.rehash(this->string_set_.size() + n);
/netbsd-current/external/gpl3/gdb.old/dist/gold/
H A Dsystem.h77 #define reserve_unordered_map(map, n) ((map)->rehash(n))
91 #define reserve_unordered_map(map, n) ((map)->rehash(n))
H A Dstringpool.cc79 this->string_set_.rehash(this->string_set_.size() + n);
82 // rehash() implementation is broken in gcc 4.0.3's stl
83 //this->string_set_.rehash(this->string_set_.size() + n);
/netbsd-current/external/gpl2/groff/dist/src/roff/troff/
H A Ddictionary.h50 void rehash(int);
/netbsd-current/external/gpl3/gdb.old/dist/gdb/mi/
H A Dmi-cmds.c227 int rehash; member in struct:mi_cmd_stats
261 stats.rehash++;
286 command->name, stats.rehash - nr_rehash);
289 nr_rehash = stats.rehash;
/netbsd-current/external/apache2/llvm/dist/libcxx/benchmarks/
H A DContainerBenchmarks.h69 c.rehash(16);
125 c.rehash(8);
/netbsd-current/bin/sh/
H A Dexec.c93 char rehash; /* if set, cd done since entry created */ member in struct:tblentry
555 if (cmdp->rehash)
624 if (cmdp != NULL && cmdp->rehash == 0)
635 if (cmdp) { /* doing a rehash */
660 /* if rehash, don't redo absolute path names */
753 cmdp->rehash = 0;
832 cmdp->rehash = 1;
994 cmdp->rehash = 0;
/netbsd-current/external/gpl2/gmake/dist/
H A Ddir.c591 int rehash = 0;
643 * filesystems force a rehash always as mtime does not change
651 rehash = 1;
657 rehash = 1;
661 if (!rehash)
706 if (! rehash || HASH_VACANT (*dirfile_slot))
587 int rehash = 0; local
/netbsd-current/external/historical/nawk/dist/
H A Dproto.h107 extern void rehash(Array *);
H A Dtran.c38 #define FULLTAB 2 /* rehash when table gets this x full */
256 rehash(tp);
274 void rehash(Array *tp) /* rehash items in small table into big one */ function
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/testsuite/libphobos.aa/
H A Dtest_aa.d93 aa.rehash;
423 test.rehash;
424 test["test3"] = "test3"; // causes divide by zero if rehash broke the AA
428 /// stops using binit, in order to test another code path in rehash.
436 aa.rehash;
582 map.rehash;
/netbsd-current/external/gpl3/gcc/dist/libphobos/testsuite/libphobos.aa/
H A Dtest_aa.d95 aa.rehash;
424 test.rehash;
425 test["test3"] = "test3"; // causes divide by zero if rehash broke the AA
429 /// stops using binit, in order to test another code path in rehash.
437 aa.rehash;
583 map.rehash;
/netbsd-current/external/gpl3/binutils/dist/bfd/
H A Decoff.c2821 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2827 unsigned int *rehash,
2839 *rehash = (hash & (size - 1)) | 1;
2950 unsigned int hash, rehash, srch;
2956 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
2961 /* See if we can rehash to this location. */
2962 for (srch = (hash + rehash) & (count - 1);
2964 srch = (srch + rehash) & (count - 1))
3113 unsigned int hash, rehash = 0;
3130 hash = ecoff_armap_hash (*map[i].name, &rehash, hashsiz
2818 ecoff_armap_hash(const char *s, unsigned int *rehash, unsigned int size, unsigned int hlog) argument
2942 unsigned int hash, rehash, srch; local
3105 unsigned int hash, rehash = 0; local
3562 unsigned int hash, rehash = 0; local
[all...]
/netbsd-current/external/gpl3/binutils.old/dist/bfd/
H A Decoff.c2848 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2854 unsigned int *rehash,
2866 *rehash = (hash & (size - 1)) | 1;
2975 unsigned int hash, rehash, srch;
2981 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
2986 /* See if we can rehash to this location. */
2987 for (srch = (hash + rehash) & (count - 1);
2989 srch = (srch + rehash) & (count - 1))
3129 unsigned int hash, rehash = 0;
3146 hash = ecoff_armap_hash (*map[i].name, &rehash, hashsiz
2845 ecoff_armap_hash(const char *s, unsigned int *rehash, unsigned int size, unsigned int hlog) argument
2967 unsigned int hash, rehash, srch; local
3121 unsigned int hash, rehash = 0; local
3599 unsigned int hash, rehash = 0; local
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/bfd/
H A Decoff.c2860 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2866 unsigned int *rehash,
2878 *rehash = (hash & (size - 1)) | 1;
2989 unsigned int hash, rehash, srch;
2995 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
3000 /* See if we can rehash to this location. */
3001 for (srch = (hash + rehash) & (count - 1);
3003 srch = (srch + rehash) & (count - 1))
3152 unsigned int hash, rehash = 0;
3169 hash = ecoff_armap_hash (*map[i].name, &rehash, hashsiz
2857 ecoff_armap_hash(const char *s, unsigned int *rehash, unsigned int size, unsigned int hlog) argument
2981 unsigned int hash, rehash, srch; local
3144 unsigned int hash, rehash = 0; local
3614 unsigned int hash, rehash = 0; local
[all...]
/netbsd-current/external/gpl3/gdb/dist/bfd/
H A Decoff.c2822 *REHASH to the rehash adjustment if the first slot is taken. SIZE
2828 unsigned int *rehash,
2840 *rehash = (hash & (size - 1)) | 1;
2951 unsigned int hash, rehash, srch;
2957 hash = ecoff_armap_hash (stringbase + name_offset, &rehash, count,
2962 /* See if we can rehash to this location. */
2963 for (srch = (hash + rehash) & (count - 1);
2965 srch = (srch + rehash) & (count - 1))
3114 unsigned int hash, rehash = 0;
3131 hash = ecoff_armap_hash (*map[i].name, &rehash, hashsiz
2819 ecoff_armap_hash(const char *s, unsigned int *rehash, unsigned int size, unsigned int hlog) argument
2943 unsigned int hash, rehash, srch; local
3106 unsigned int hash, rehash = 0; local
3563 unsigned int hash, rehash = 0; local
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dunordered_set.h792 * @brief May rehash the %unordered_set.
799 rehash(size_type __n) function in class:unordered_set
800 { _M_h.rehash(__n); }
807 * Same as rehash(ceil(n / max_load_factor())).
1586 * @brief May rehash the %unordered_multiset.
1593 rehash(size_type __n) function in class:unordered_multiset
1594 { _M_h.rehash(__n); }
1601 * Same as rehash(ceil(n / max_load_factor())).
H A Dunordered_map.h1113 * @brief May rehash the %unordered_map.
1120 rehash(size_type __n) function in class:unordered_map
1121 { _M_h.rehash(__n); }
1128 * Same as rehash(ceil(n / max_load_factor())).
1964 * @brief May rehash the %unordered_multimap.
1971 rehash(size_type __n) function in class:unordered_multimap
1972 { _M_h.rehash(__n); }
1979 * Same as rehash(ceil(n / max_load_factor())).
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dunordered_set.h842 * @brief May rehash the %unordered_set.
849 rehash(size_type __n) function in class:unordered_set
850 { _M_h.rehash(__n); }
857 * Same as rehash(ceil(n / max_load_factor())).
1685 * @brief May rehash the %unordered_multiset.
1692 rehash(size_type __n) function in class:unordered_multiset
1693 { _M_h.rehash(__n); }
1700 * Same as rehash(ceil(n / max_load_factor())).
H A Dunordered_map.h1108 * @brief May rehash the %unordered_map.
1115 rehash(size_type __n) function in class:unordered_map
1116 { _M_h.rehash(__n); }
1123 * Same as rehash(ceil(n / max_load_factor())).
2006 * @brief May rehash the %unordered_multimap.
2013 rehash(size_type __n) function in class:unordered_multimap
2014 { _M_h.rehash(__n); }
2021 * Same as rehash(ceil(n / max_load_factor())).
/netbsd-current/external/mit/lua/dist/src/
H A Dltable.c608 static void rehash (lua_State *L, Table *t, const TValue *ek) { function
701 rehash(L, t, key); /* grow table */
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/libdruntime/
H A Dobject.d1931 T rehash(T : Value[Key], Value, Key)(T aa)
1938 T rehash(T : Value[Key], Value, Key)(T* aa)
1945 T rehash(T : shared Value[Key], Value, Key)(T aa)
1952 T rehash(T : shared Value[Key], Value, Key)(T* aa)

Completed in 445 milliseconds

12