@@ -108,7 +108,7 @@ static int check_dquot_block_header(struct qtree_mem_dqinfo *info,
108
108
/* Remove empty block from list and return it */
109
109
static int get_free_dqblk (struct qtree_mem_dqinfo * info )
110
110
{
111
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
111
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
112
112
struct qt_disk_dqdbheader * dh = (struct qt_disk_dqdbheader * )buf ;
113
113
int ret , blk ;
114
114
@@ -160,7 +160,7 @@ static int put_free_dqblk(struct qtree_mem_dqinfo *info, char *buf, uint blk)
160
160
static int remove_free_dqentry (struct qtree_mem_dqinfo * info , char * buf ,
161
161
uint blk )
162
162
{
163
- char * tmpbuf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
163
+ char * tmpbuf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
164
164
struct qt_disk_dqdbheader * dh = (struct qt_disk_dqdbheader * )buf ;
165
165
uint nextblk = le32_to_cpu (dh -> dqdh_next_free );
166
166
uint prevblk = le32_to_cpu (dh -> dqdh_prev_free );
@@ -207,7 +207,7 @@ static int remove_free_dqentry(struct qtree_mem_dqinfo *info, char *buf,
207
207
static int insert_free_dqentry (struct qtree_mem_dqinfo * info , char * buf ,
208
208
uint blk )
209
209
{
210
- char * tmpbuf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
210
+ char * tmpbuf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
211
211
struct qt_disk_dqdbheader * dh = (struct qt_disk_dqdbheader * )buf ;
212
212
int err ;
213
213
@@ -255,7 +255,7 @@ static uint find_free_dqentry(struct qtree_mem_dqinfo *info,
255
255
{
256
256
uint blk , i ;
257
257
struct qt_disk_dqdbheader * dh ;
258
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
258
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
259
259
char * ddquot ;
260
260
261
261
* err = 0 ;
@@ -329,7 +329,7 @@ static uint find_free_dqentry(struct qtree_mem_dqinfo *info,
329
329
static int do_insert_tree (struct qtree_mem_dqinfo * info , struct dquot * dquot ,
330
330
uint * treeblk , int depth )
331
331
{
332
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
332
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
333
333
int ret = 0 , newson = 0 , newact = 0 ;
334
334
__le32 * ref ;
335
335
uint newblk ;
@@ -410,7 +410,7 @@ int qtree_write_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)
410
410
int type = dquot -> dq_id .type ;
411
411
struct super_block * sb = dquot -> dq_sb ;
412
412
ssize_t ret ;
413
- char * ddquot = kmalloc (info -> dqi_entry_size , GFP_NOFS );
413
+ char * ddquot = kmalloc (info -> dqi_entry_size , GFP_KERNEL );
414
414
415
415
if (!ddquot )
416
416
return - ENOMEM ;
@@ -449,7 +449,7 @@ static int free_dqentry(struct qtree_mem_dqinfo *info, struct dquot *dquot,
449
449
uint blk )
450
450
{
451
451
struct qt_disk_dqdbheader * dh ;
452
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
452
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
453
453
int ret = 0 ;
454
454
455
455
if (!buf )
@@ -513,7 +513,7 @@ static int free_dqentry(struct qtree_mem_dqinfo *info, struct dquot *dquot,
513
513
static int remove_tree (struct qtree_mem_dqinfo * info , struct dquot * dquot ,
514
514
uint * blk , int depth )
515
515
{
516
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
516
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
517
517
int ret = 0 ;
518
518
uint newblk ;
519
519
__le32 * ref = (__le32 * )buf ;
@@ -577,7 +577,7 @@ EXPORT_SYMBOL(qtree_delete_dquot);
577
577
static loff_t find_block_dqentry (struct qtree_mem_dqinfo * info ,
578
578
struct dquot * dquot , uint blk )
579
579
{
580
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
580
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
581
581
loff_t ret = 0 ;
582
582
int i ;
583
583
char * ddquot ;
@@ -615,7 +615,7 @@ static loff_t find_block_dqentry(struct qtree_mem_dqinfo *info,
615
615
static loff_t find_tree_dqentry (struct qtree_mem_dqinfo * info ,
616
616
struct dquot * dquot , uint blk , int depth )
617
617
{
618
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
618
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
619
619
loff_t ret = 0 ;
620
620
__le32 * ref = (__le32 * )buf ;
621
621
@@ -684,7 +684,7 @@ int qtree_read_dquot(struct qtree_mem_dqinfo *info, struct dquot *dquot)
684
684
}
685
685
dquot -> dq_off = offset ;
686
686
}
687
- ddquot = kmalloc (info -> dqi_entry_size , GFP_NOFS );
687
+ ddquot = kmalloc (info -> dqi_entry_size , GFP_KERNEL );
688
688
if (!ddquot )
689
689
return - ENOMEM ;
690
690
ret = sb -> s_op -> quota_read (sb , type , ddquot , info -> dqi_entry_size ,
@@ -728,7 +728,7 @@ EXPORT_SYMBOL(qtree_release_dquot);
728
728
static int find_next_id (struct qtree_mem_dqinfo * info , qid_t * id ,
729
729
unsigned int blk , int depth )
730
730
{
731
- char * buf = kmalloc (info -> dqi_usable_bs , GFP_NOFS );
731
+ char * buf = kmalloc (info -> dqi_usable_bs , GFP_KERNEL );
732
732
__le32 * ref = (__le32 * )buf ;
733
733
ssize_t ret ;
734
734
unsigned int epb = info -> dqi_usable_bs >> 2 ;
0 commit comments