/*
* Copyright (c) 2000-2002 Silicon Graphics, Inc. All Rights Reserved.
- *
+ *
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
- *
+ *
* This program is distributed in the hope that it would be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- *
+ *
* Further, this software is distributed without any warranty that it is
* free of the rightful claim of any third person regarding infringement
* or the like. Any license provided herein, whether implied or
* otherwise, applies only to this software file. Patent licenses, if
* any, provided herein do not apply to combinations of this program with
* other software, or any other product whatsoever.
- *
+ *
* You should have received a copy of the GNU General Public License along
* with this program; if not, write the Free Software Foundation, Inc., 59
* Temple Place - Suite 330, Boston MA 02111-1307, USA.
- *
+ *
* Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
* Mountain View, CA 94043, or:
- *
- * http://www.sgi.com
- *
- * For further information regarding this notice, see:
- *
+ *
+ * http://www.sgi.com
+ *
+ * For further information regarding this notice, see:
+ *
* http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
*/
if ((new = malloc(sizeof(ino_tree_node_t[ALLOC_NUM_INOS])))
== NULL)
- do_error("inode map malloc failed\n");
+ do_error(_("inode map malloc failed\n"));
for (i = 0; i < ALLOC_NUM_INOS; i++) {
new->avl_node.avl_nextino =
if (avl_insert(inode_uncertain_tree_ptrs[agno],
(avlnode_t *) ino_rec) == NULL) {
- do_error("xfs_repair: add_aginode_uncertain - "
- "duplicate inode range\n");
+ do_error(_("add_aginode_uncertain - "
+ "duplicate inode range\n"));
}
}
if (avl_insert(inode_tree_ptrs[agno],
(avlnode_t *) ino_rec) == NULL) {
- do_warn("xfs_repair: add_inode - duplicate inode range\n");
+ do_warn(_("add_inode - duplicate inode range\n"));
}
return(ino_rec);
ino_tree_node_t *ino_rec;
if (!uncertain) {
- fprintf(stderr, "good inode list is --\n");
+ fprintf(stderr, _("good inode list is --\n"));
ino_rec = findfirst_inode_rec(agno);
} else {
- fprintf(stderr, "uncertain inode list is --\n");
+ fprintf(stderr, _("uncertain inode list is --\n"));
ino_rec = findfirst_uncertain_inode_rec(agno);
}
if (ino_rec == NULL) {
- fprintf(stderr, "agno %d -- no inodes\n", agno);
+ fprintf(stderr, _("agno %d -- no inodes\n"), agno);
return;
}
- printf("agno %d\n", agno);
+ printf(_("agno %d\n"), agno);
while(ino_rec != NULL) {
fprintf(stderr,
- "\tptr = %lx, start = 0x%x, free = 0x%llx, confirmed = 0x%llx\n",
+ _("\tptr = %lx, start = 0x%x, free = 0x%llx, confirmed = 0x%llx\n"),
(unsigned long)ino_rec,
ino_rec->ino_startnum,
(unsigned long long)ino_rec->ir_free,
ASSERT(full_backptrs == 0);
if (irec->ino_un.plist == NULL) {
- irec->ino_un.plist =
- (parent_list_t*)malloc(sizeof(parent_list_t));
- if (!irec->ino_un.plist)
- do_error("couldn't malloc parent list table\n");
-
+ irec->ino_un.plist =
+ (parent_list_t*)malloc(sizeof(parent_list_t));
+ if (!irec->ino_un.plist)
+ do_error(_("couldn't malloc parent list table\n"));
+
irec->ino_un.plist->pmask = 1LL << offset;
- irec->ino_un.plist->pentries =
- (xfs_ino_t*)memalign(sizeof(xfs_ino_t), sizeof(xfs_ino_t));
- if (!irec->ino_un.plist->pentries)
- do_error("couldn't memalign pentries table\n");
+ irec->ino_un.plist->pentries =
+ (xfs_ino_t*)memalign(sizeof(xfs_ino_t), sizeof(xfs_ino_t));
+ if (!irec->ino_un.plist->pentries)
+ do_error(_("couldn't memalign pentries table\n"));
#ifdef DEBUG
irec->ino_un.plist->cnt = 1;
#endif
ASSERT(cnt >= target);
tmp = (xfs_ino_t*)memalign(sizeof(xfs_ino_t), (cnt + 1) * sizeof(xfs_ino_t));
- if (!tmp)
- do_error("couldn't memalign pentries table\n");
+ if (!tmp)
+ do_error(_("couldn't memalign pentries table\n"));
(void) bcopy(irec->ino_un.plist->pentries, tmp,
target * sizeof(parent_entry_t));
if ((bptrs = malloc(sizeof(backptrs_t[BPTR_ALLOC_NUM])))
== NULL) {
- do_error("couldn't malloc ino rec backptrs.\n");
+ do_error(_("couldn't malloc ino rec backptrs.\n"));
}
bptrs_index = 0;
backptrs_t *ptr;
if ((ptr = malloc(sizeof(backptrs_t))) == NULL)
- do_error("could not malloc back pointer table\n");
-
+ do_error(_("could not malloc back pointer table\n"));
+
bzero(ptr, sizeof(backptrs_t));
return(ptr);
while (ino_rec != NULL) {
tmp = ino_rec->ino_un.plist;
- ino_rec->ino_un.backptrs = get_backptr();
+ ino_rec->ino_un.backptrs = get_backptr();
ino_rec->ino_un.backptrs->parents = tmp;
#ifdef XR_BCKPTR_DBG
if ((inode_tree_ptrs = malloc(agcount *
sizeof(avltree_desc_t *))) == NULL)
- do_error("couldn't malloc inode tree descriptor table\n");
+ do_error(_("couldn't malloc inode tree descriptor table\n"));
if ((inode_uncertain_tree_ptrs = malloc(agcount *
sizeof(avltree_desc_t *))) == NULL)
- do_error("couldn't malloc uncertain ino tree descriptor table\n");
+ do_error(
+ _("couldn't malloc uncertain ino tree descriptor table\n"));
for (i = 0; i < agcount; i++) {
if ((inode_tree_ptrs[i] =
malloc(sizeof(avltree_desc_t))) == NULL)
- do_error("couldn't malloc inode tree descriptor\n");
+ do_error(_("couldn't malloc inode tree descriptor\n"));
if ((inode_uncertain_tree_ptrs[i] =
malloc(sizeof(avltree_desc_t))) == NULL)
do_error(
- "couldn't malloc uncertain ino tree descriptor\n");
+ _("couldn't malloc uncertain ino tree descriptor\n"));
}
for (i = 0; i < agcount; i++) {
avl_init_tree(inode_tree_ptrs[i], &avl_ino_tree_ops);
ino_flist.list = NULL;
if ((last_rec = malloc(sizeof(ino_tree_node_t *) * agcount)) == NULL)
- do_error("couldn't malloc uncertain inode cache area\n");
+ do_error(_("couldn't malloc uncertain inode cache area\n"));
bzero(last_rec, sizeof(ino_tree_node_t *) * agcount);
projects / thirdparty / xfsprogs-dev.git / blobdiff