mirror of
https://github.com/samba-team/samba.git
synced 2024-12-31 17:18:04 +03:00
3a1ada7635
prints the hash on every record for easier awk'ing, and tdbbackup allows a
different hash chain length on the backed up tdb.
Jeremy, Günther, this might be interesting for you huge domains. Not only
locking.tdb, also the winbind ones might grow huge.
In the installation I fixed with this winbind spent a huge amount of CPU
spinning through a degenerated winbindd_idmap.tdb with entries for more than
15.000 users. With a default number of hash chains of 131 on that tdb you can
imagine that the lists get large.
Not merging to 4, I don't get tdbbackup to compile there right now.
What about changing the global default hash chain number to be dramatically
larger? Disk is cheap these days.
Volker
(This used to be commit 577d0ff658)
139 lines
3.7 KiB
C
139 lines
3.7 KiB
C
/*
|
|
Unix SMB/CIFS implementation.
|
|
|
|
trivial database library
|
|
|
|
Copyright (C) Andrew Tridgell 1999-2005
|
|
Copyright (C) Paul `Rusty' Russell 2000
|
|
Copyright (C) Jeremy Allison 2000-2003
|
|
|
|
** NOTE! The following LGPL license applies to the tdb
|
|
** library. This does NOT imply that all of Samba is released
|
|
** under the LGPL
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with this library; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
|
|
#include "tdb_private.h"
|
|
|
|
static tdb_off_t tdb_dump_record(struct tdb_context *tdb, int hash,
|
|
tdb_off_t offset)
|
|
{
|
|
struct list_struct rec;
|
|
tdb_off_t tailer_ofs, tailer;
|
|
|
|
if (tdb->methods->tdb_read(tdb, offset, (char *)&rec,
|
|
sizeof(rec), DOCONV()) == -1) {
|
|
printf("ERROR: failed to read record at %u\n", offset);
|
|
return 0;
|
|
}
|
|
|
|
printf(" rec: hash=%d, offset=0x%08x next=0x%08x rec_len=%d "
|
|
"key_len=%d data_len=%d full_hash=0x%x magic=0x%x\n",
|
|
hash, offset, rec.next, rec.rec_len, rec.key_len, rec.data_len,
|
|
rec.full_hash, rec.magic);
|
|
|
|
tailer_ofs = offset + sizeof(rec) + rec.rec_len - sizeof(tdb_off_t);
|
|
|
|
if (tdb_ofs_read(tdb, tailer_ofs, &tailer) == -1) {
|
|
printf("ERROR: failed to read tailer at %u\n", tailer_ofs);
|
|
return rec.next;
|
|
}
|
|
|
|
if (tailer != rec.rec_len + sizeof(rec)) {
|
|
printf("ERROR: tailer does not match record! tailer=%u totalsize=%u\n",
|
|
(unsigned int)tailer, (unsigned int)(rec.rec_len + sizeof(rec)));
|
|
}
|
|
return rec.next;
|
|
}
|
|
|
|
static int tdb_dump_chain(struct tdb_context *tdb, int i)
|
|
{
|
|
tdb_off_t rec_ptr, top;
|
|
|
|
top = TDB_HASH_TOP(i);
|
|
|
|
if (tdb_lock(tdb, i, F_WRLCK) != 0)
|
|
return -1;
|
|
|
|
if (tdb_ofs_read(tdb, top, &rec_ptr) == -1)
|
|
return tdb_unlock(tdb, i, F_WRLCK);
|
|
|
|
if (rec_ptr)
|
|
printf("hash=%d\n", i);
|
|
|
|
while (rec_ptr) {
|
|
rec_ptr = tdb_dump_record(tdb, i, rec_ptr);
|
|
}
|
|
|
|
return tdb_unlock(tdb, i, F_WRLCK);
|
|
}
|
|
|
|
void tdb_dump_all(struct tdb_context *tdb)
|
|
{
|
|
int i;
|
|
for (i=0;i<tdb->header.hash_size;i++) {
|
|
tdb_dump_chain(tdb, i);
|
|
}
|
|
printf("freelist:\n");
|
|
tdb_dump_chain(tdb, -1);
|
|
}
|
|
|
|
int tdb_printfreelist(struct tdb_context *tdb)
|
|
{
|
|
int ret;
|
|
long total_free = 0;
|
|
tdb_off_t offset, rec_ptr;
|
|
struct list_struct rec;
|
|
|
|
if ((ret = tdb_lock(tdb, -1, F_WRLCK)) != 0)
|
|
return ret;
|
|
|
|
offset = FREELIST_TOP;
|
|
|
|
/* read in the freelist top */
|
|
if (tdb_ofs_read(tdb, offset, &rec_ptr) == -1) {
|
|
tdb_unlock(tdb, -1, F_WRLCK);
|
|
return 0;
|
|
}
|
|
|
|
printf("freelist top=[0x%08x]\n", rec_ptr );
|
|
while (rec_ptr) {
|
|
if (tdb->methods->tdb_read(tdb, rec_ptr, (char *)&rec,
|
|
sizeof(rec), DOCONV()) == -1) {
|
|
tdb_unlock(tdb, -1, F_WRLCK);
|
|
return -1;
|
|
}
|
|
|
|
if (rec.magic != TDB_FREE_MAGIC) {
|
|
printf("bad magic 0x%08x in free list\n", rec.magic);
|
|
tdb_unlock(tdb, -1, F_WRLCK);
|
|
return -1;
|
|
}
|
|
|
|
printf("entry offset=[0x%08x], rec.rec_len = [0x%08x (%d)] (end = 0x%08x)\n",
|
|
rec_ptr, rec.rec_len, rec.rec_len, rec_ptr + rec.rec_len);
|
|
total_free += rec.rec_len;
|
|
|
|
/* move to the next record */
|
|
rec_ptr = rec.next;
|
|
}
|
|
printf("total rec_len = [0x%08x (%d)]\n", (int)total_free,
|
|
(int)total_free);
|
|
|
|
return tdb_unlock(tdb, -1, F_WRLCK);
|
|
}
|
|
|