diff --git a/ChangeLog b/ChangeLog index 2736ed4..0e0667c 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,10 @@ +bzr branch lp:libisofs/for-libisoburn (to become libisofs-1.3.8.tar.gz) +=============================================================================== +* Bug fix: Prevent allocation of empty hash tables. Thanks Richard Nolde. +* Bug fix: Prevent allocation of empty directory children lists. + Thanks Richard Nolde. + + libisofs-1.3.6.tar.gz Tue Mar 04 2014 =============================================================================== * Bug fix: Division by zero if HFS+ was combined with TOC emulation for diff --git a/libisofs/ecma119_tree.c b/libisofs/ecma119_tree.c index 8ef80c9..fb5b84b 100644 --- a/libisofs/ecma119_tree.c +++ b/libisofs/ecma119_tree.c @@ -1,6 +1,6 @@ /* * Copyright (c) 2007 Vreixo Formoso - * Copyright (c) 2009 - 2012 Thomas Schmitt + * Copyright (c) 2009 - 2014 Thomas Schmitt * * This file is part of the libisofs project; you can redistribute it and/or * modify it under the terms of the GNU General Public License version 2 diff --git a/libisofs/iso1999.c b/libisofs/iso1999.c index dd503d1..00ae938 100644 --- a/libisofs/iso1999.c +++ b/libisofs/iso1999.c @@ -1,6 +1,6 @@ /* * Copyright (c) 2007 Vreixo Formoso - * Copyright (c) 2011-2012 Thomas Schmitt + * Copyright (c) 2011-2014 Thomas Schmitt * * This file is part of the libisofs project; you can redistribute it and/or * modify it under the terms of the GNU General Public License version 2 @@ -80,7 +80,8 @@ void iso1999_node_free(Iso1999Node *node) for (i = 0; i < node->info.dir->nchildren; i++) { iso1999_node_free(node->info.dir->children[i]); } - free(node->info.dir->children); + if (node->info.dir->children != NULL) + free(node->info.dir->children); free(node->info.dir); } iso_node_unref(node->node); @@ -111,11 +112,14 @@ int create_node(Ecma119Image *t, IsoNode *iso, Iso1999Node **node) free(n); return ISO_OUT_OF_MEM; } - n->info.dir->children = calloc(sizeof(void*), dir->nchildren); - if (n->info.dir->children == NULL) { - free(n->info.dir); - free(n); - return ISO_OUT_OF_MEM; + n->info.dir->children = NULL; + if (dir->nchildren > 0) { + n->info.dir->children = calloc(sizeof(void*), dir->nchildren); + if (n->info.dir->children == NULL) { + free(n->info.dir); + free(n); + return ISO_OUT_OF_MEM; + } } n->type = ISO1999_DIR; } else if (iso->type == LIBISO_FILE) { @@ -293,6 +297,8 @@ void sort_tree(Iso1999Node *root) { size_t i; + if (root->info.dir->children == NULL) + return; qsort(root->info.dir->children, root->info.dir->nchildren, sizeof(void*), cmp_node); for (i = 0; i < root->info.dir->nchildren; i++) { @@ -312,10 +318,14 @@ int mangle_single_dir(Ecma119Image *img, Iso1999Node *dir) int need_sort = 0; char *full_name = NULL, *tmp = NULL; + nchildren = dir->info.dir->nchildren; + if (nchildren <= 0) { + ret = ISO_SUCCESS; + goto ex; + } + children = dir->info.dir->children; LIBISO_ALLOC_MEM(full_name, char, 208); LIBISO_ALLOC_MEM(tmp, char, 208); - nchildren = dir->info.dir->nchildren; - children = dir->info.dir->children; /* a hash table will temporary hold the names, for fast searching */ ret = iso_htable_create((nchildren * 100) / 80, iso_str_hash, diff --git a/libisofs/joliet.c b/libisofs/joliet.c index c4642a2..a49ec8d 100644 --- a/libisofs/joliet.c +++ b/libisofs/joliet.c @@ -1,7 +1,7 @@ /* * Copyright (c) 2007 Vreixo Formoso * Copyright (c) 2007 Mario Danic - * Copyright (c) 2011-2012 Thomas Schmitt + * Copyright (c) 2011-2014 Thomas Schmitt * * This file is part of the libisofs project; you can redistribute it and/or * modify it under the terms of the GNU General Public License version 2 @@ -126,7 +126,8 @@ void joliet_node_free(JolietNode *node) for (i = 0; i < node->info.dir->nchildren; i++) { joliet_node_free(node->info.dir->children[i]); } - free(node->info.dir->children); + if (node->info.dir->children != NULL) + free(node->info.dir->children); free(node->info.dir); } iso_node_unref(node->node); @@ -157,11 +158,14 @@ int create_node(Ecma119Image *t, IsoNode *iso, JolietNode **node) free(joliet); return ISO_OUT_OF_MEM; } - joliet->info.dir->children = calloc(sizeof(void*), dir->nchildren); - if (joliet->info.dir->children == NULL) { - free(joliet->info.dir); - free(joliet); - return ISO_OUT_OF_MEM; + joliet->info.dir->children = NULL; + if (dir->nchildren > 0) { + joliet->info.dir->children = calloc(sizeof(void*), dir->nchildren); + if (joliet->info.dir->children == NULL) { + free(joliet->info.dir); + free(joliet); + return ISO_OUT_OF_MEM; + } } joliet->type = JOLIET_DIR; } else if (iso->type == LIBISO_FILE) { @@ -333,6 +337,8 @@ void sort_tree(JolietNode *root) { size_t i; + if (root->info.dir->children == NULL) + return; qsort(root->info.dir->children, root->info.dir->nchildren, sizeof(void*), cmp_node); for (i = 0; i < root->info.dir->nchildren; i++) { @@ -406,10 +412,14 @@ int mangle_single_dir(Ecma119Image *t, JolietNode *dir) uint16_t *full_name = NULL; uint16_t *tmp = NULL; + nchildren = dir->info.dir->nchildren; + if (nchildren <= 0) { + ret = ISO_SUCCESS; + goto ex; + } + children = dir->info.dir->children; LIBISO_ALLOC_MEM(full_name, uint16_t, LIBISO_JOLIET_NAME_MAX); LIBISO_ALLOC_MEM(tmp, uint16_t, LIBISO_JOLIET_NAME_MAX); - nchildren = dir->info.dir->nchildren; - children = dir->info.dir->children; if (t->opts->joliet_long_names) maxchar = 103; diff --git a/libisofs/util_htable.c b/libisofs/util_htable.c index 5e55273..fba5141 100644 --- a/libisofs/util_htable.c +++ b/libisofs/util_htable.c @@ -1,5 +1,6 @@ /* * Copyright (c) 2007 Vreixo Formoso + * Copyright (c) 2014 Thomas Schmitt * * This file is part of the libisofs project; you can redistribute it and/or * modify it under the terms of the GNU General Public License version 2