hugetlb_cgroup.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424
  1. /*
  2. *
  3. * Copyright IBM Corporation, 2012
  4. * Author Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
  5. *
  6. * This program is free software; you can redistribute it and/or modify it
  7. * under the terms of version 2.1 of the GNU Lesser General Public License
  8. * as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it would be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. */
  15. #include <linux/cgroup.h>
  16. #include <linux/slab.h>
  17. #include <linux/hugetlb.h>
  18. #include <linux/hugetlb_cgroup.h>
  19. struct hugetlb_cgroup {
  20. struct cgroup_subsys_state css;
  21. /*
  22. * the counter to account for hugepages from hugetlb.
  23. */
  24. struct res_counter hugepage[HUGE_MAX_HSTATE];
  25. };
  26. #define MEMFILE_PRIVATE(x, val) (((x) << 16) | (val))
  27. #define MEMFILE_IDX(val) (((val) >> 16) & 0xffff)
  28. #define MEMFILE_ATTR(val) ((val) & 0xffff)
  29. struct cgroup_subsys hugetlb_subsys __read_mostly;
  30. static struct hugetlb_cgroup *root_h_cgroup __read_mostly;
  31. static inline
  32. struct hugetlb_cgroup *hugetlb_cgroup_from_css(struct cgroup_subsys_state *s)
  33. {
  34. return container_of(s, struct hugetlb_cgroup, css);
  35. }
  36. static inline
  37. struct hugetlb_cgroup *hugetlb_cgroup_from_cgroup(struct cgroup *cgroup)
  38. {
  39. return hugetlb_cgroup_from_css(cgroup_css(cgroup, hugetlb_subsys_id));
  40. }
  41. static inline
  42. struct hugetlb_cgroup *hugetlb_cgroup_from_task(struct task_struct *task)
  43. {
  44. return hugetlb_cgroup_from_css(task_css(task, hugetlb_subsys_id));
  45. }
  46. static inline bool hugetlb_cgroup_is_root(struct hugetlb_cgroup *h_cg)
  47. {
  48. return (h_cg == root_h_cgroup);
  49. }
  50. static inline struct hugetlb_cgroup *parent_hugetlb_cgroup(struct cgroup *cg)
  51. {
  52. if (!cg->parent)
  53. return NULL;
  54. return hugetlb_cgroup_from_cgroup(cg->parent);
  55. }
  56. static inline bool hugetlb_cgroup_have_usage(struct cgroup *cg)
  57. {
  58. int idx;
  59. struct hugetlb_cgroup *h_cg = hugetlb_cgroup_from_cgroup(cg);
  60. for (idx = 0; idx < hugetlb_max_hstate; idx++) {
  61. if ((res_counter_read_u64(&h_cg->hugepage[idx], RES_USAGE)) > 0)
  62. return true;
  63. }
  64. return false;
  65. }
  66. static struct cgroup_subsys_state *hugetlb_cgroup_css_alloc(struct cgroup *cgroup)
  67. {
  68. int idx;
  69. struct cgroup *parent_cgroup;
  70. struct hugetlb_cgroup *h_cgroup, *parent_h_cgroup;
  71. h_cgroup = kzalloc(sizeof(*h_cgroup), GFP_KERNEL);
  72. if (!h_cgroup)
  73. return ERR_PTR(-ENOMEM);
  74. parent_cgroup = cgroup->parent;
  75. if (parent_cgroup) {
  76. parent_h_cgroup = hugetlb_cgroup_from_cgroup(parent_cgroup);
  77. for (idx = 0; idx < HUGE_MAX_HSTATE; idx++)
  78. res_counter_init(&h_cgroup->hugepage[idx],
  79. &parent_h_cgroup->hugepage[idx]);
  80. } else {
  81. root_h_cgroup = h_cgroup;
  82. for (idx = 0; idx < HUGE_MAX_HSTATE; idx++)
  83. res_counter_init(&h_cgroup->hugepage[idx], NULL);
  84. }
  85. return &h_cgroup->css;
  86. }
  87. static void hugetlb_cgroup_css_free(struct cgroup *cgroup)
  88. {
  89. struct hugetlb_cgroup *h_cgroup;
  90. h_cgroup = hugetlb_cgroup_from_cgroup(cgroup);
  91. kfree(h_cgroup);
  92. }
  93. /*
  94. * Should be called with hugetlb_lock held.
  95. * Since we are holding hugetlb_lock, pages cannot get moved from
  96. * active list or uncharged from the cgroup, So no need to get
  97. * page reference and test for page active here. This function
  98. * cannot fail.
  99. */
  100. static void hugetlb_cgroup_move_parent(int idx, struct cgroup *cgroup,
  101. struct page *page)
  102. {
  103. int csize;
  104. struct res_counter *counter;
  105. struct res_counter *fail_res;
  106. struct hugetlb_cgroup *page_hcg;
  107. struct hugetlb_cgroup *h_cg = hugetlb_cgroup_from_cgroup(cgroup);
  108. struct hugetlb_cgroup *parent = parent_hugetlb_cgroup(cgroup);
  109. page_hcg = hugetlb_cgroup_from_page(page);
  110. /*
  111. * We can have pages in active list without any cgroup
  112. * ie, hugepage with less than 3 pages. We can safely
  113. * ignore those pages.
  114. */
  115. if (!page_hcg || page_hcg != h_cg)
  116. goto out;
  117. csize = PAGE_SIZE << compound_order(page);
  118. if (!parent) {
  119. parent = root_h_cgroup;
  120. /* root has no limit */
  121. res_counter_charge_nofail(&parent->hugepage[idx],
  122. csize, &fail_res);
  123. }
  124. counter = &h_cg->hugepage[idx];
  125. res_counter_uncharge_until(counter, counter->parent, csize);
  126. set_hugetlb_cgroup(page, parent);
  127. out:
  128. return;
  129. }
  130. /*
  131. * Force the hugetlb cgroup to empty the hugetlb resources by moving them to
  132. * the parent cgroup.
  133. */
  134. static void hugetlb_cgroup_css_offline(struct cgroup *cgroup)
  135. {
  136. struct hstate *h;
  137. struct page *page;
  138. int idx = 0;
  139. do {
  140. for_each_hstate(h) {
  141. spin_lock(&hugetlb_lock);
  142. list_for_each_entry(page, &h->hugepage_activelist, lru)
  143. hugetlb_cgroup_move_parent(idx, cgroup, page);
  144. spin_unlock(&hugetlb_lock);
  145. idx++;
  146. }
  147. cond_resched();
  148. } while (hugetlb_cgroup_have_usage(cgroup));
  149. }
  150. int hugetlb_cgroup_charge_cgroup(int idx, unsigned long nr_pages,
  151. struct hugetlb_cgroup **ptr)
  152. {
  153. int ret = 0;
  154. struct res_counter *fail_res;
  155. struct hugetlb_cgroup *h_cg = NULL;
  156. unsigned long csize = nr_pages * PAGE_SIZE;
  157. if (hugetlb_cgroup_disabled())
  158. goto done;
  159. /*
  160. * We don't charge any cgroup if the compound page have less
  161. * than 3 pages.
  162. */
  163. if (huge_page_order(&hstates[idx]) < HUGETLB_CGROUP_MIN_ORDER)
  164. goto done;
  165. again:
  166. rcu_read_lock();
  167. h_cg = hugetlb_cgroup_from_task(current);
  168. if (!css_tryget(&h_cg->css)) {
  169. rcu_read_unlock();
  170. goto again;
  171. }
  172. rcu_read_unlock();
  173. ret = res_counter_charge(&h_cg->hugepage[idx], csize, &fail_res);
  174. css_put(&h_cg->css);
  175. done:
  176. *ptr = h_cg;
  177. return ret;
  178. }
  179. /* Should be called with hugetlb_lock held */
  180. void hugetlb_cgroup_commit_charge(int idx, unsigned long nr_pages,
  181. struct hugetlb_cgroup *h_cg,
  182. struct page *page)
  183. {
  184. if (hugetlb_cgroup_disabled() || !h_cg)
  185. return;
  186. set_hugetlb_cgroup(page, h_cg);
  187. return;
  188. }
  189. /*
  190. * Should be called with hugetlb_lock held
  191. */
  192. void hugetlb_cgroup_uncharge_page(int idx, unsigned long nr_pages,
  193. struct page *page)
  194. {
  195. struct hugetlb_cgroup *h_cg;
  196. unsigned long csize = nr_pages * PAGE_SIZE;
  197. if (hugetlb_cgroup_disabled())
  198. return;
  199. VM_BUG_ON(!spin_is_locked(&hugetlb_lock));
  200. h_cg = hugetlb_cgroup_from_page(page);
  201. if (unlikely(!h_cg))
  202. return;
  203. set_hugetlb_cgroup(page, NULL);
  204. res_counter_uncharge(&h_cg->hugepage[idx], csize);
  205. return;
  206. }
  207. void hugetlb_cgroup_uncharge_cgroup(int idx, unsigned long nr_pages,
  208. struct hugetlb_cgroup *h_cg)
  209. {
  210. unsigned long csize = nr_pages * PAGE_SIZE;
  211. if (hugetlb_cgroup_disabled() || !h_cg)
  212. return;
  213. if (huge_page_order(&hstates[idx]) < HUGETLB_CGROUP_MIN_ORDER)
  214. return;
  215. res_counter_uncharge(&h_cg->hugepage[idx], csize);
  216. return;
  217. }
  218. static ssize_t hugetlb_cgroup_read(struct cgroup *cgroup, struct cftype *cft,
  219. struct file *file, char __user *buf,
  220. size_t nbytes, loff_t *ppos)
  221. {
  222. u64 val;
  223. char str[64];
  224. int idx, name, len;
  225. struct hugetlb_cgroup *h_cg = hugetlb_cgroup_from_cgroup(cgroup);
  226. idx = MEMFILE_IDX(cft->private);
  227. name = MEMFILE_ATTR(cft->private);
  228. val = res_counter_read_u64(&h_cg->hugepage[idx], name);
  229. len = scnprintf(str, sizeof(str), "%llu\n", (unsigned long long)val);
  230. return simple_read_from_buffer(buf, nbytes, ppos, str, len);
  231. }
  232. static int hugetlb_cgroup_write(struct cgroup *cgroup, struct cftype *cft,
  233. const char *buffer)
  234. {
  235. int idx, name, ret;
  236. unsigned long long val;
  237. struct hugetlb_cgroup *h_cg = hugetlb_cgroup_from_cgroup(cgroup);
  238. idx = MEMFILE_IDX(cft->private);
  239. name = MEMFILE_ATTR(cft->private);
  240. switch (name) {
  241. case RES_LIMIT:
  242. if (hugetlb_cgroup_is_root(h_cg)) {
  243. /* Can't set limit on root */
  244. ret = -EINVAL;
  245. break;
  246. }
  247. /* This function does all necessary parse...reuse it */
  248. ret = res_counter_memparse_write_strategy(buffer, &val);
  249. if (ret)
  250. break;
  251. ret = res_counter_set_limit(&h_cg->hugepage[idx], val);
  252. break;
  253. default:
  254. ret = -EINVAL;
  255. break;
  256. }
  257. return ret;
  258. }
  259. static int hugetlb_cgroup_reset(struct cgroup *cgroup, unsigned int event)
  260. {
  261. int idx, name, ret = 0;
  262. struct hugetlb_cgroup *h_cg = hugetlb_cgroup_from_cgroup(cgroup);
  263. idx = MEMFILE_IDX(event);
  264. name = MEMFILE_ATTR(event);
  265. switch (name) {
  266. case RES_MAX_USAGE:
  267. res_counter_reset_max(&h_cg->hugepage[idx]);
  268. break;
  269. case RES_FAILCNT:
  270. res_counter_reset_failcnt(&h_cg->hugepage[idx]);
  271. break;
  272. default:
  273. ret = -EINVAL;
  274. break;
  275. }
  276. return ret;
  277. }
  278. static char *mem_fmt(char *buf, int size, unsigned long hsize)
  279. {
  280. if (hsize >= (1UL << 30))
  281. snprintf(buf, size, "%luGB", hsize >> 30);
  282. else if (hsize >= (1UL << 20))
  283. snprintf(buf, size, "%luMB", hsize >> 20);
  284. else
  285. snprintf(buf, size, "%luKB", hsize >> 10);
  286. return buf;
  287. }
  288. static void __init __hugetlb_cgroup_file_init(int idx)
  289. {
  290. char buf[32];
  291. struct cftype *cft;
  292. struct hstate *h = &hstates[idx];
  293. /* format the size */
  294. mem_fmt(buf, 32, huge_page_size(h));
  295. /* Add the limit file */
  296. cft = &h->cgroup_files[0];
  297. snprintf(cft->name, MAX_CFTYPE_NAME, "%s.limit_in_bytes", buf);
  298. cft->private = MEMFILE_PRIVATE(idx, RES_LIMIT);
  299. cft->read = hugetlb_cgroup_read;
  300. cft->write_string = hugetlb_cgroup_write;
  301. /* Add the usage file */
  302. cft = &h->cgroup_files[1];
  303. snprintf(cft->name, MAX_CFTYPE_NAME, "%s.usage_in_bytes", buf);
  304. cft->private = MEMFILE_PRIVATE(idx, RES_USAGE);
  305. cft->read = hugetlb_cgroup_read;
  306. /* Add the MAX usage file */
  307. cft = &h->cgroup_files[2];
  308. snprintf(cft->name, MAX_CFTYPE_NAME, "%s.max_usage_in_bytes", buf);
  309. cft->private = MEMFILE_PRIVATE(idx, RES_MAX_USAGE);
  310. cft->trigger = hugetlb_cgroup_reset;
  311. cft->read = hugetlb_cgroup_read;
  312. /* Add the failcntfile */
  313. cft = &h->cgroup_files[3];
  314. snprintf(cft->name, MAX_CFTYPE_NAME, "%s.failcnt", buf);
  315. cft->private = MEMFILE_PRIVATE(idx, RES_FAILCNT);
  316. cft->trigger = hugetlb_cgroup_reset;
  317. cft->read = hugetlb_cgroup_read;
  318. /* NULL terminate the last cft */
  319. cft = &h->cgroup_files[4];
  320. memset(cft, 0, sizeof(*cft));
  321. WARN_ON(cgroup_add_cftypes(&hugetlb_subsys, h->cgroup_files));
  322. return;
  323. }
  324. void __init hugetlb_cgroup_file_init(void)
  325. {
  326. struct hstate *h;
  327. for_each_hstate(h) {
  328. /*
  329. * Add cgroup control files only if the huge page consists
  330. * of more than two normal pages. This is because we use
  331. * page[2].lru.next for storing cgroup details.
  332. */
  333. if (huge_page_order(h) >= HUGETLB_CGROUP_MIN_ORDER)
  334. __hugetlb_cgroup_file_init(hstate_index(h));
  335. }
  336. }
  337. /*
  338. * hugetlb_lock will make sure a parallel cgroup rmdir won't happen
  339. * when we migrate hugepages
  340. */
  341. void hugetlb_cgroup_migrate(struct page *oldhpage, struct page *newhpage)
  342. {
  343. struct hugetlb_cgroup *h_cg;
  344. struct hstate *h = page_hstate(oldhpage);
  345. if (hugetlb_cgroup_disabled())
  346. return;
  347. VM_BUG_ON(!PageHuge(oldhpage));
  348. spin_lock(&hugetlb_lock);
  349. h_cg = hugetlb_cgroup_from_page(oldhpage);
  350. set_hugetlb_cgroup(oldhpage, NULL);
  351. /* move the h_cg details to new cgroup */
  352. set_hugetlb_cgroup(newhpage, h_cg);
  353. list_move(&newhpage->lru, &h->hugepage_activelist);
  354. spin_unlock(&hugetlb_lock);
  355. return;
  356. }
  357. struct cgroup_subsys hugetlb_subsys = {
  358. .name = "hugetlb",
  359. .css_alloc = hugetlb_cgroup_css_alloc,
  360. .css_offline = hugetlb_cgroup_css_offline,
  361. .css_free = hugetlb_cgroup_css_free,
  362. .subsys_id = hugetlb_subsys_id,
  363. };