/*
* brel_ma.c
- *
+ *
* Copyright (C) 1996, 1997 Theodore Ts'o.
*
* TODO: rewrite to not use a direct array!!! (Fortunately this
* module isn't really used yet.)
*
* %Begin-Header%
- * This file may be redistributed under the terms of the GNU Public
- * License.
+ * This file may be redistributed under the terms of the GNU Library
+ * General Public License, version 2.
* %End-Header%
*/
+#include "config.h"
#include <fcntl.h>
#include <stdio.h>
-#include <stdlib.h>
#include <string.h>
#if HAVE_UNISTD_H
#include <unistd.h>
#include <errno.h>
#endif
-#include <linux/ext2_fs.h>
-
+#include "ext2_fs.h"
#include "ext2fs.h"
#include "brel.h"
/*
* Allocate memory structures
*/
- retval = EXT2_NO_MEMORY;
- brel = malloc(sizeof(struct ext2_block_relocation_table));
- if (!brel)
+ retval = ext2fs_get_mem(sizeof(struct ext2_block_relocation_table),
+ &brel);
+ if (retval)
goto errout;
memset(brel, 0, sizeof(struct ext2_block_relocation_table));
-
- brel->name = malloc(strlen(name)+1);
- if (!brel->name)
+
+ retval = ext2fs_get_mem(strlen(name)+1, &brel->name);
+ if (retval)
goto errout;
strcpy(brel->name, name);
-
- ma = malloc(sizeof(struct brel_ma));
- if (!ma)
+
+ retval = ext2fs_get_mem(sizeof(struct brel_ma), &ma);
+ if (retval)
goto errout;
memset(ma, 0, sizeof(struct brel_ma));
- brel->private = ma;
-
+ brel->priv_data = ma;
+
size = (size_t) (sizeof(struct ext2_block_relocate_entry) *
(max_block+1));
- ma->entries = malloc(size);
- if (!ma->entries)
+ retval = ext2fs_get_array(max_block+1,
+ sizeof(struct ext2_block_relocate_entry), &ma->entries);
+ if (retval)
goto errout;
memset(ma->entries, 0, size);
ma->max_block = max_block;
brel->move = bma_move;
brel->delete = bma_delete;
brel->free = bma_free;
-
+
*new_brel = brel;
return 0;
{
struct brel_ma *ma;
- ma = brel->private;
+ ma = brel->priv_data;
if (old > ma->max_block)
- return EXT2_INVALID_ARGUMENT;
+ return EXT2_ET_INVALID_ARGUMENT;
ma->entries[(unsigned)old] = *ent;
return 0;
}
{
struct brel_ma *ma;
- ma = brel->private;
+ ma = brel->priv_data;
if (old > ma->max_block)
- return EXT2_INVALID_ARGUMENT;
+ return EXT2_ET_INVALID_ARGUMENT;
if (ma->entries[(unsigned)old].new == 0)
return ENOENT;
*ent = ma->entries[old];
{
struct brel_ma *ma;
- ma = brel->private;
+ ma = brel->priv_data;
while (++brel->current < ma->max_block) {
if (ma->entries[(unsigned)brel->current].new == 0)
continue;
{
struct brel_ma *ma;
- ma = brel->private;
+ ma = brel->priv_data;
if ((old > ma->max_block) || (new > ma->max_block))
- return EXT2_INVALID_ARGUMENT;
+ return EXT2_ET_INVALID_ARGUMENT;
if (ma->entries[(unsigned)old].new == 0)
return ENOENT;
ma->entries[(unsigned)new] = ma->entries[old];
{
struct brel_ma *ma;
- ma = brel->private;
+ ma = brel->priv_data;
if (old > ma->max_block)
- return EXT2_INVALID_ARGUMENT;
+ return EXT2_ET_INVALID_ARGUMENT;
if (ma->entries[(unsigned)old].new == 0)
return ENOENT;
ma->entries[(unsigned)old].new = 0;
if (!brel)
return 0;
- ma = brel->private;
+ ma = brel->priv_data;
if (ma) {
if (ma->entries)
- free (ma->entries);
- free(ma);
+ ext2fs_free_mem(&ma->entries);
+ ext2fs_free_mem(&ma);
}
if (brel->name)
- free(brel->name);
- free (brel);
+ ext2fs_free_mem(&brel->name);
+ ext2fs_free_mem(&brel);
return 0;
}