On Tue, 8 Mar 2005, KAMEZAWA Hiroyuki wrote:
> Mel Gorman wrote:
>
> > > >
> > > Now, 5bits per MAX_ORDER pages.
> > > I think it is simpler to use "char[]" for representing type of memory
> > > alloc
> > > type than bitmap.
> > >
> > >
> >
> > Possibly, but it would also use up that bit more sp
Mel Gorman wrote:
Now, 5bits per MAX_ORDER pages.
I think it is simpler to use "char[]" for representing type of memory alloc
type than bitmap.
Possibly, but it would also use up that bit more space. That map could be
condensed to 3 bits but would make it that bit (no pun) more comple
On Tue, 8 Mar 2005, KAMEZAWA Hiroyuki wrote:
> Hi,
>
> Mel Gorman wrote:
>
> > +#define BITS_PER_ALLOC_TYPE 5
> > #define ALLOC_KERNNORCLM 0
> > #define ALLOC_KERNRCLM 1
> > #define ALLOC_USERRCLM 2
> > #define ALLOC_FALLBACK 3
> > +#define ALLOC_USERZERO 4
> > +#define ALLOC_KERNZERO 5
> >
>
> No
Hi,
Mel Gorman wrote:
+#define BITS_PER_ALLOC_TYPE 5
#define ALLOC_KERNNORCLM 0
#define ALLOC_KERNRCLM 1
#define ALLOC_USERRCLM 2
#define ALLOC_FALLBACK 3
+#define ALLOC_USERZERO 4
+#define ALLOC_KERNZERO 5
Now, 5bits per MAX_ORDER pages.
I think it is simpler to use "char[]" for representing type
Changelog since V3
o Have USERZERO and KERNZERO for different types of zero pages to avoid
regressing fragmentation behavior
o Always zero in as large as blocks as possible
o Have a per-cpu pageset for zero-pages
Changelog since V2
o Updated to be in sync with placement policy patches
o Fixed cr
5 matches
Mail list logo