libburnia
/
libisofs
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Keep children sorted when renaming a node.

This commit is contained in:
Vreixo Formoso 2007-12-06 16:18:51 +01:00
parent b2d41de603
commit 5abb569e0c
1 changed files with 18 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/node.c
View File

@ -70,15 +70,31 @@ void iso_node_unref(IsoNode *node)
*/ */
int iso_node_set_name(IsoNode *node, const char *name) int iso_node_set_name(IsoNode *node, const char *name)
{ {
char *new;
if (node->parent != NULL) { if (node->parent != NULL) {
/* check if parent already has a node with same name */ /* check if parent already has a node with same name */
if (iso_dir_get_node(node->parent, name, NULL) == 1) { if (iso_dir_get_node(node->parent, name, NULL) == 1) {
return ISO_NODE_NAME_NOT_UNIQUE; return ISO_NODE_NAME_NOT_UNIQUE;
} }
} }
new = strdup(name);
if (new == NULL) {
return ISO_MEM_ERROR;
}
free(node->name); free(node->name);
node->name = strdup(name); node->name = new;
return node->name != NULL ? ISO_SUCCESS : ISO_MEM_ERROR; if (node->parent != NULL) {
IsoDir *parent;
int res;
/* take and add again to ensure correct children order */
parent = node->parent;
iso_node_take(node);
res = iso_dir_add_node(parent, node, 0);
if (res < 0) {
return res;
}
}
return ISO_SUCCESS;
} }
/** /**