headers/cpp/stl_hashtable.h

130

_Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)

headers/cpp/stl_hashtable.h

131

: _M_cur(__n), _M_ht(__tab) {}

headers/cpp/stl_hashtable.h

91

_Hashtable_iterator(_Node* __n, _Hashtable* __tab)

headers/cpp/stl_hashtable.h

92

: _M_cur(__n), _M_ht(__tab) {}

src/system/libroot/posix/musl/search/hsearch.c

116

htab->__tab = calloc(1, sizeof *htab->__tab);

src/system/libroot/posix/musl/search/hsearch.c

117

if (!htab->__tab)

src/system/libroot/posix/musl/search/hsearch.c

121

free(htab->__tab);

src/system/libroot/posix/musl/search/hsearch.c

122

htab->__tab = 0;

src/system/libroot/posix/musl/search/hsearch.c

130

if (htab->__tab) free(htab->__tab->entries);

src/system/libroot/posix/musl/search/hsearch.c

131

free(htab->__tab);

src/system/libroot/posix/musl/search/hsearch.c

132

htab->__tab = 0;

src/system/libroot/posix/musl/search/hsearch.c

150

if (++htab->__tab->used > htab->__tab->mask - htab->__tab->mask/4) {

src/system/libroot/posix/musl/search/hsearch.c

151

if (!resize(2*htab->__tab->used, htab)) {

src/system/libroot/posix/musl/search/hsearch.c

152

htab->__tab->used--;

src/system/libroot/posix/musl/search/hsearch.c

27

struct __tab *__tab;

src/system/libroot/posix/musl/search/hsearch.c

54

ENTRY *oldtab = htab->__tab->entries;

src/system/libroot/posix/musl/search/hsearch.c

55

ENTRY *oldend = htab->__tab->entries + htab->__tab->mask + 1;

src/system/libroot/posix/musl/search/hsearch.c

60

htab->__tab->entries = calloc(newsize, sizeof *htab->__tab->entries);

src/system/libroot/posix/musl/search/hsearch.c

61

if (!htab->__tab->entries) {

src/system/libroot/posix/musl/search/hsearch.c

62

htab->__tab->entries = oldtab;

src/system/libroot/posix/musl/search/hsearch.c

65

htab->__tab->mask = newsize - 1;

src/system/libroot/posix/musl/search/hsearch.c

71

newe = htab->__tab->entries + (i & htab->__tab->mask);

src/system/libroot/posix/musl/search/hsearch.c

97

e = htab->__tab->entries + (i & htab->__tab->mask);