return 0;
}
- qbh->data = data = (char *)kmalloc(2048, GFP_KERNEL);
+ qbh->data = data = (char *)kmalloc(2048, GFP_NOFS);
if (!data) {
printk("HPFS: hpfs_map_4sectors: out of memory\n");
goto bail;
}
/*return hpfs_map_4sectors(s, secno, qbh, 0);*/
- if (!(qbh->data = kmalloc(2048, GFP_KERNEL))) {
+ if (!(qbh->data = kmalloc(2048, GFP_NOFS))) {
printk("HPFS: hpfs_get_4sectors: out of memory\n");
return NULL;
}
for (; hpfs_inode->i_rddir_off[i]; i++)
if (hpfs_inode->i_rddir_off[i] == pos) return;
if (!(i&0x0f)) {
- if (!(ppos = kmalloc((i+0x11) * sizeof(loff_t*), GFP_KERNEL))) {
+ if (!(ppos = kmalloc((i+0x11) * sizeof(loff_t*), GFP_NOFS))) {
printk("HPFS: out of memory for position list\n");
return;
}
struct buffer_head *bh;
struct fnode *fnode;
int c1, c2 = 0;
- if (!(nname = kmalloc(256, GFP_KERNEL))) {
+ if (!(nname = kmalloc(256, GFP_NOFS))) {
printk("HPFS: out of memory, can't add to dnode\n");
return 1;
}
kfree(nname);
return 0;
}
- if (!nd) if (!(nd = kmalloc(0x924, GFP_KERNEL))) {
+ if (!nd) if (!(nd = kmalloc(0x924, GFP_NOFS))) {
/* 0x924 is a max size of dnode after adding a dirent with
max name length. We alloc this only once. There must
not be any error while splitting dnodes, otherwise the
t = get_pos(dnode, de);
for_all_poss(i, hpfs_pos_subst, t, 4);
for_all_poss(i, hpfs_pos_subst, t + 1, 5);
- if (!(nde = kmalloc(de->length, GFP_KERNEL))) {
+ if (!(nde = kmalloc(de->length, GFP_NOFS))) {
hpfs_error(i->i_sb, "out of memory for dirent - directory will be corrupted");
hpfs_brelse4(&qbh);
return 0;
struct quad_buffer_head qbh1;
if (!de_next->down) goto endm;
ndown = de_down_pointer(de_next);
- if (!(de_cp = kmalloc(de->length, GFP_KERNEL))) {
+ if (!(de_cp = kmalloc(de->length, GFP_NOFS))) {
printk("HPFS: out of memory for dtree balancing\n");
goto endm;
}
} else if (down)
*(dnode_secno *) ((void *) del + del->length - 4) = down;
} else goto endm;
- if (!(de_cp = kmalloc(de_prev->length, GFP_KERNEL))) {
+ if (!(de_cp = kmalloc(de_prev->length, GFP_NOFS))) {
printk("HPFS: out of memory for dtree balancing\n");
hpfs_brelse4(&qbh1);
goto endm;
int c1, c2 = 0;
int d1, d2 = 0;
name1 = f->name;
- if (!(name2 = kmalloc(256, GFP_KERNEL))) {
+ if (!(name2 = kmalloc(256, GFP_NOFS))) {
printk("HPFS: out of memory, can't map dirent\n");
return NULL;
}
static char *get_indirect_ea(struct super_block *s, int ano, secno a, int size)
{
char *ret;
- if (!(ret = kmalloc(size + 1, GFP_KERNEL))) {
+ if (!(ret = kmalloc(size + 1, GFP_NOFS))) {
printk("HPFS: out of memory for EA\n");
return NULL;
}
if (!strcmp(ea->name, key)) {
if (ea->indirect)
return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
- if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_KERNEL))) {
+ if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_NOFS))) {
printk("HPFS: out of memory for EA\n");
return NULL;
}
if (!strcmp(ea->name, key)) {
if (ea->indirect)
return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
- if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_KERNEL))) {
+ if (!(ret = kmalloc((*size = ea->valuelen) + 1, GFP_NOFS))) {
printk("HPFS: out of memory for EA\n");
return NULL;
}