Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 205651
b: refs/heads/master
c: ef079a7
h: refs/heads/master
i:
  205649: dd4e246
  205647: 3429ac9
v: v3
  • Loading branch information
Nanakos Chrysostomos authored and Greg Kroah-Hartman committed Jun 18, 2010
1 parent e52992c commit 4e65981
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 8 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: 231ded903f2f30b2bcdbf6672c7197187e3bb1ee
refs/heads/master: ef079a76fe78d713eb695a222601fccb3e706f0f
14 changes: 7 additions & 7 deletions trunk/drivers/staging/dream/pmem.c
Original file line number Diff line number Diff line change
Expand Up @@ -24,8 +24,8 @@
#include <linux/mempolicy.h>
#include <linux/sched.h>
#include <linux/slab.h>
#include <asm/io.h>
#include <asm/uaccess.h>
#include <linux/io.h>
#include <linux/uaccess.h>
#include <asm/cacheflush.h>

#define PMEM_MAX_DEVICES 10
Expand Down Expand Up @@ -175,7 +175,7 @@ static int pmem_mmap(struct file *, struct vm_area_struct *);
static int pmem_open(struct inode *, struct file *);
static long pmem_ioctl(struct file *, unsigned int, unsigned long);

struct file_operations pmem_fops = {
const struct file_operations pmem_fops = {
.release = pmem_release,
.mmap = pmem_mmap,
.open = pmem_open,
Expand Down Expand Up @@ -399,8 +399,8 @@ static int pmem_allocate(int id, unsigned long len)
DLOG("order %lx\n", order);

/* look through the bitmap:
* if you find a free slot of the correct order use it
* otherwise, use the best fit (smallest with size > order) slot
* if you find a free slot of the correct order use it
* otherwise, use the best fit (smallest with size > order) slot
*/
while (curr < end) {
if (PMEM_IS_FREE(id, curr)) {
Expand All @@ -426,8 +426,8 @@ static int pmem_allocate(int id, unsigned long len)
}

/* now partition the best fit:
* split the slot into 2 buddies of order - 1
* repeat until the slot is of the correct order
* split the slot into 2 buddies of order - 1
* repeat until the slot is of the correct order
*/
while (PMEM_ORDER(id, best_fit) > (unsigned char)order) {
int buddy;
Expand Down

0 comments on commit 4e65981

Please sign in to comment.