github.com/brouhaha.tumble
1
0
Fork 0
mirror of synced 2026-01-21 10:22:38 +00:00
Code Issues Releases Wiki Activity

fixes to pdf_split_name_tree_node(). when splitting a non-leaf node, update children's parent field. recursively split upward if necessary.

Browse Source
This commit is contained in:
Eric Smith 2003-03-08 09:31:23 +00:00
parent b059651b34
commit 00e7b497b0
1 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
pdf_name_tree.c
View File

@ -4,7 +4,7 @@
* will be compressed using ITU-T T.6 (G4) fax encoding.
*
* PDF routines
* $Id: pdf_name_tree.c,v 1.6 2003/03/08 01:23:05 eric Exp $
* $Id: pdf_name_tree.c,v 1.7 2003/03/08 01:31:23 eric Exp $
* Copyright 2003 Eric Smith <eric@brouhaha.com>
*
* This program is free software; you can redistribute it and/or modify
@ -116,6 +116,12 @@ static void pdf_split_name_tree_node (struct pdf_name_tree *tree,
tree->root = new_root_node;
}
if (parent->count == MAX_NAME_TREE_NODE_ENTRIES)
{
pdf_split_name_tree_node (tree, parent);
parent = node->parent;
}
new_node = pdf_calloc (1, sizeof (struct pdf_name_tree_node));
new_node->parent = parent;
new_node->leaf = node->leaf;
@ -133,9 +139,14 @@ static void pdf_split_name_tree_node (struct pdf_name_tree *tree,
memcpy (& new_node->values [0],
& node->values [i],
j * sizeof (struct pdf_obj *));
node->count = i;
new_node->count = j;
if (! new_node->leaf)
for (i = 0; i < j; i++)
new_node->kids [i]->parent = new_node;
/* set max_key of the old node */
if (node->leaf)
node->max_key = node->keys [node->count - 1];