* in t.
*/
static node234 *split234_internal(tree234 *t, int index) {
- node234 *halves[2], *n, *sib, *sub;
+ node234 *halves[2] = { NULL, NULL }, *n, *sib, *sub;
node234 *lparent, *rparent;
int ki, pki, i, half, lcount, rcount;
/*
* Search down the tree to find the split point.
*/
+ halves[0] = halves[1] = NULL;
lparent = rparent = NULL;
pki = -1;
while (n) {
*/
LOG((" fell off bottom, lroot is %p, rroot is %p\n",
halves[0], halves[1]));
+ assert(halves[0] != NULL);
+ assert(halves[1] != NULL);
lparent->counts[pki] = rparent->counts[0] = 0;
lparent->kids[pki] = rparent->kids[0] = NULL;
* if not.)
*/
+#include <string.h>
#include <stdarg.h>
#define srealloc realloc