• K
    memcg: use CSS ID · 04046e1a
    KAMEZAWA Hiroyuki 提交于
    Assigning CSS ID for each memcg and use css_get_next() for scanning hierarchy.
    
    	Assume folloing tree.
    
    	group_A (ID=3)
    		/01 (ID=4)
    		   /0A (ID=7)
    		/02 (ID=10)
    	group_B (ID=5)
    	and task in group_A/01/0A hits limit at group_A.
    
    	reclaim will be done in following order (round-robin).
    	group_A(3) -> group_A/01 (4) -> group_A/01/0A (7) -> group_A/02(10)
    	-> group_A -> .....
    
    	Round robin by ID. The last visited cgroup is recorded and restart
    	from it when it start reclaim again.
    	(More smart algorithm can be implemented..)
    
    	No cgroup_mutex or hierarchy_mutex is required.
    Signed-off-by: NKAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
    Cc: Paul Menage <menage@google.com>
    Cc: Li Zefan <lizf@cn.fujitsu.com>
    Cc: Balbir Singh <balbir@in.ibm.com>
    Cc: Daisuke Nishimura <nishimura@mxp.nes.nec.co.jp>
    Cc: David Rientjes <rientjes@google.com>
    Signed-off-by: NAndrew Morton <akpm@linux-foundation.org>
    Signed-off-by: NLinus Torvalds <torvalds@linux-foundation.org>
    04046e1a
memcontrol.c 55.4 KB