search for: pgdat

Hi all, I'm compiling linux kernel with clang. I want to generate IR with no optimization. However, kernel can only be compile with -O2 instead of -O0. Here is the source code snippet: struct zone *next_zone(struct zone *zone) { pg_data_t **pgdat* = zone->zone_pgdat; } I want to know there is an assignment from "zone" to "pgdat". I'm trying to iterate "store" instructions in IR. When I compile with -O2, I have the following IR: define %struct.zone* @next_zone(%struct.zone* readonly %zone) #0 !dbg !21...

...39;m compiling linux kernel with clang. I want to generate IR with no >> optimization. However, kernel can only be compile with -O2 instead of -O0. >> >> Here is the source code snippet: >> >> struct zone *next_zone(struct zone *zone) >> >> { pg_data_t **pgdat* = zone->zone_pgdat; >> >> } >> >> I want to know there is an assignment from "zone" to "pgdat". I'm trying >> to iterate "store" instructions in IR. >> >> When I compile with -O2, I have the following IR: >> >&...

...te IR with no >>>> optimization. However, kernel can only be compile with -O2 instead of -O0. >>>> >>>> Here is the source code snippet: >>>> >>>> struct zone *next_zone(struct zone *zone) >>>> >>>> { pg_data_t **pgdat* = zone->zone_pgdat; >>>> >>>> } >>>> >>>> I want to know there is an assignment from "zone" to "pgdat". I'm >>>> trying to iterate "store" instructions in IR. >>>> >>>> When I c...

...ead. Changes: - /sys/devices/system/memory/probe interface has been removed; /sys/devices/system/xen_memory/xen_memory0/{target,target_kb} are much better (I forgot about them), - most of the code have been moved to drivers/xen/balloon.c, - this changes forced me to export hotadd_new_pgdat and rollback_node_hotadd function from mm/memory_hotplug.c; could it be accepted by mm/memory_hotplug.c maintainers ??? - PV on HVM mode is supported now; it was tested on git://xenbits.xen.org/people/sstabellini/linux-pvhvm.git repository, 2.6.34-pvhvm head, - most of Jeremy su...

...size) > > Could this be __meminit too then? Good question. I looked throught the code and could not find any simple explanation why mm/memory_hotplug.c authors used __ref instead __meminit. Could you (mm/memory_hotplug.c authors/maintainers) tell us why ??? > >+{ > >+ pg_data_t *pgdat = NULL; > >+ int new_pgdat = 0, ret; > >+ > >+ lock_system_sleep(); > > What''s this for? I see all its other users are in the memory hotplug > code, but presumably they''re concerned about a real S3 suspend. Do we > care about that here? Yes, becaus...

...outside of the zone->lock. What I've had in mind was to simply >> walk free lists of the suitable order and call the callback for each >> one. >> Something as simple as >> >> for (i = 0; i < MAX_NR_ZONES; i++) { >> struct zone *zone = &pgdat->node_zones[i]; >> >> if (!populated_zone(zone)) >> continue; > > Can we directly use for_each_populated_zone(zone) here? > > >> spin_lock_irqsave(&zone->lock, flags); >> for (order = min_order; order < MAX_ORDER; ++...

...outside of the zone->lock. What I've had in mind was to simply >> walk free lists of the suitable order and call the callback for each >> one. >> Something as simple as >> >> for (i = 0; i < MAX_NR_ZONES; i++) { >> struct zone *zone = &pgdat->node_zones[i]; >> >> if (!populated_zone(zone)) >> continue; > > Can we directly use for_each_populated_zone(zone) here? > > >> spin_lock_irqsave(&zone->lock, flags); >> for (order = min_order; order < MAX_ORDER; ++...

...> >pointers outside of the zone->lock. What I've had in mind was to simply > >walk free lists of the suitable order and call the callback for each one. > >Something as simple as > > > > for (i = 0; i < MAX_NR_ZONES; i++) { > > struct zone *zone = &pgdat->node_zones[i]; > > > > if (!populated_zone(zone)) > > continue; > > spin_lock_irqsave(&zone->lock, flags); > > for (order = min_order; order < MAX_ORDER; ++order) { > > struct free_area *free_area = &zone->free_area[order]; > >...

...> >pointers outside of the zone->lock. What I've had in mind was to simply > >walk free lists of the suitable order and call the callback for each one. > >Something as simple as > > > > for (i = 0; i < MAX_NR_ZONES; i++) { > > struct zone *zone = &pgdat->node_zones[i]; > > > > if (!populated_zone(zone)) > > continue; > > spin_lock_irqsave(&zone->lock, flags); > > for (order = min_order; order < MAX_ORDER; ++order) { > > struct free_area *free_area = &zone->free_area[order]; > >...

Hi all, This is a new release of bio-cgroup which provides an IO tracking mechanism. The patches can be applied to the kernel 2.6.30-rc1 and you can also download them from the following site. http://people.valinux.co.jp/~ryov/bio-cgroup/ What's bio-cgroup all about? ============================ With this feature, you can determine the owners of any type of I/Os. This makes

Hi all, This is a new release of bio-cgroup which provides an IO tracking mechanism. The patches can be applied to the kernel 2.6.30-rc1 and you can also download them from the following site. http://people.valinux.co.jp/~ryov/bio-cgroup/ What's bio-cgroup all about? ============================ With this feature, you can determine the owners of any type of I/Os. This makes

Hi all, This is a new release of bio-cgroup which provides an IO tracking mechanism. The patches can be applied to the kernel 2.6.30-rc1 and you can also download them from the following site. http://people.valinux.co.jp/~ryov/bio-cgroup/ What's bio-cgroup all about? ============================ With this feature, you can determine the owners of any type of I/Os. This makes

...too ugly and wrong actually. Never provide struct page pointers outside of the zone->lock. What I've had in mind was to simply walk free lists of the suitable order and call the callback for each one. Something as simple as for (i = 0; i < MAX_NR_ZONES; i++) { struct zone *zone = &pgdat->node_zones[i]; if (!populated_zone(zone)) continue; spin_lock_irqsave(&zone->lock, flags); for (order = min_order; order < MAX_ORDER; ++order) { struct free_area *free_area = &zone->free_area[order]; enum migratetype mt; struct page *page; if (!free_area-...

...too ugly and wrong actually. Never provide struct page pointers outside of the zone->lock. What I've had in mind was to simply walk free lists of the suitable order and call the callback for each one. Something as simple as for (i = 0; i < MAX_NR_ZONES; i++) { struct zone *zone = &pgdat->node_zones[i]; if (!populated_zone(zone)) continue; spin_lock_irqsave(&zone->lock, flags); for (order = min_order; order < MAX_ORDER; ++order) { struct free_area *free_area = &zone->free_area[order]; enum migratetype mt; struct page *page; if (!free_area-...

...or_each_migratetype_order(order, type) > --- > mm/mmzone.c | 2 ++ > 1 file changed, 2 insertions(+) > > diff --git a/mm/mmzone.c b/mm/mmzone.c > index a51c0a6..08a2a3a 100644 > --- a/mm/mmzone.c > +++ b/mm/mmzone.c > @@ -13,6 +13,7 @@ struct pglist_data *first_online_pgdat(void) > { > return NODE_DATA(first_online_node); > } > +EXPORT_SYMBOL_GPL(first_online_pgdat); > > struct pglist_data *next_online_pgdat(struct pglist_data *pgdat) > { > @@ -41,6 +42,7 @@ struct zone *next_zone(struct zone *zone) > } > return zone; > }...

...or_each_migratetype_order(order, type) > --- > mm/mmzone.c | 2 ++ > 1 file changed, 2 insertions(+) > > diff --git a/mm/mmzone.c b/mm/mmzone.c > index a51c0a6..08a2a3a 100644 > --- a/mm/mmzone.c > +++ b/mm/mmzone.c > @@ -13,6 +13,7 @@ struct pglist_data *first_online_pgdat(void) > { > return NODE_DATA(first_online_node); > } > +EXPORT_SYMBOL_GPL(first_online_pgdat); > > struct pglist_data *next_online_pgdat(struct pglist_data *pgdat) > { > @@ -41,6 +42,7 @@ struct zone *next_zone(struct zone *zone) > } > return zone; > }...

Hi all, This is a new release of blkio-cgroup which provides an IO tracking mechanism. You can also download this series of patches from http://people.valinux.co.jp/~ryov/blkio-cgroup/ Changes from the previous release ================================= - bio-cgroup renamed to blkio-cgroup. - Use part of page_cgroup->flags to store the blkio-cgroup ID. This code is taken from Andrea's

Hi all, This is a new release of blkio-cgroup which provides an IO tracking mechanism. You can also download this series of patches from http://people.valinux.co.jp/~ryov/blkio-cgroup/ Changes from the previous release ================================= - bio-cgroup renamed to blkio-cgroup. - Use part of page_cgroup->flags to store the blkio-cgroup ID. This code is taken from Andrea's

Hi all, This is a new release of blkio-cgroup which provides an IO tracking mechanism. You can also download this series of patches from http://people.valinux.co.jp/~ryov/blkio-cgroup/ Changes from the previous release ================================= - bio-cgroup renamed to blkio-cgroup. - Use part of page_cgroup->flags to store the blkio-cgroup ID. This code is taken from Andrea's

...gt;lock. What I've had in mind was to simply > >>>walk free lists of the suitable order and call the callback for each one. > >>>Something as simple as > >>> > >>> for (i = 0; i < MAX_NR_ZONES; i++) { > >>> struct zone *zone = &pgdat->node_zones[i]; > >>> > >>> if (!populated_zone(zone)) > >>> continue; > >>> spin_lock_irqsave(&zone->lock, flags); > >>> for (order = min_order; order < MAX_ORDER; ++order) { > >>> struct free_area *free_ar...