├── .gitignore ├── COPYING ├── Makefile ├── Readme.md ├── dkms.conf ├── fs ├── Makefile └── procg │ ├── Kconfig │ ├── Makefile │ └── root.c ├── patches ├── 0000-cover-letter.patch ├── 0001-memcontrol-make-mem_cgroup_is_root-public.patch └── 0002-memcontrol-make-memcg-stats-public.patch └── procg-dkms-mkdeb ├── Makefile └── debian ├── README.Debian ├── changelog ├── compat ├── control ├── copyright ├── dirs ├── postinst ├── prerm └── rules /.gitignore: -------------------------------------------------------------------------------- 1 | ctags 2 | *.o 3 | *.ko 4 | *.o.cmd 5 | *.ko.cmd 6 | *.mod.c 7 | modules.order 8 | Module.symvers 9 | .tmp_versions 10 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | obj-m = fs/ 2 | -------------------------------------------------------------------------------- /Readme.md: -------------------------------------------------------------------------------- 1 | Custom procfs that provides a cgroup aware `meminfo`. It is currently being 2 | developed and tested against the kernel used on Ubuntu 13.10 (3.11.0), but it is 3 | known to work on 3.14.0 as well. 4 | 5 | ## Building 6 | 7 | This kernel module is built and distributed with [DKMS][dkms]. 8 | 9 | For a local build: 10 | 11 | ``` 12 | ln -s /usr/src/procg-0.0.1 13 | sudo dkms add -m procg -v 0.0.1 14 | sudo dkms build -m procg -v 0.0.1 15 | sudo dkms install -m procg -v 0.0.1 16 | ``` 17 | 18 | To build a debian package: 19 | 20 | ``` 21 | sudo dkms mkdeb procg/0.0.1 --source-only 22 | ``` 23 | 24 | The package will be at `/var/lib/dkms/procg/0.0.1/deb/procg-dkms_0.0.1_all.deb` 25 | 26 | ## Usage 27 | 28 | Once the module is installed (at `/lib/modules/$(uname -r)/updates/dkms`, if you 29 | followed the previous section): 30 | 31 | ``` 32 | sudo modprobe procg 33 | sudo mkdir /procg 34 | sudo mount -t procg none /procg 35 | ``` 36 | 37 | ## License 38 | 39 | Copyright (C) 2014 Fabio Kung 40 | 41 | This program is free software: you can redistribute it and/or modify 42 | it under the terms of the GNU General Public License as published by 43 | the Free Software Foundation, either version 3 of the License, or 44 | (at your option) any later version. 45 | 46 | This program is distributed in the hope that it will be useful, 47 | but WITHOUT ANY WARRANTY; without even the implied warranty of 48 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 49 | GNU General Public License for more details. 50 | 51 | A copy of the GNU General Public License is in the COPYING file, which 52 | can also be found online at . 53 | 54 | [dkms]: http://linux.dell.com/dkms/ 55 | -------------------------------------------------------------------------------- /dkms.conf: -------------------------------------------------------------------------------- 1 | PACKAGE_NAME="procg" 2 | PACKAGE_VERSION="0.0.1" 3 | CLEAN="rm -f *.*o" 4 | 5 | BUILT_MODULE_NAME[0]="procg" 6 | BUILT_MODULE_LOCATION[0]="fs/procg" 7 | DEST_MODULE_LOCATION[0]="/updates" 8 | MAKE[0]="make -C $kernel_source_dir M=$dkms_tree/$PACKAGE_NAME/$PACKAGE_VERSION/build" 9 | AUTOINSTALL="yes" 10 | -------------------------------------------------------------------------------- /fs/Makefile: -------------------------------------------------------------------------------- 1 | obj-m = procg/ 2 | -------------------------------------------------------------------------------- /fs/procg/Kconfig: -------------------------------------------------------------------------------- 1 | config PROC_CGROUP_FS 2 | tristate "cgroup aware /proc file system support" 3 | depends on PROC_FS && MEMCG 4 | default m 5 | help 6 | procfs that uses information from cgroup controllers when available. 7 | -------------------------------------------------------------------------------- /fs/procg/Makefile: -------------------------------------------------------------------------------- 1 | # 2 | # Makefile for the cgroup-aware proc filesystem routines. 3 | # 4 | obj-m += procg.o 5 | 6 | procg-y := root.o 7 | -------------------------------------------------------------------------------- /fs/procg/root.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | 14 | MODULE_LICENSE("GPL"); 15 | MODULE_AUTHOR("Fabio Kung"); 16 | 17 | static int meminfo_cgroup_show(struct seq_file *m, void *v) 18 | { 19 | struct mem_cgroup *memcg; 20 | u64 mem_total, mem_used, mem_free, mem_available; 21 | 22 | memcg = mem_cgroup_from_task(current); 23 | if (!memcg) { 24 | return SEQ_SKIP; 25 | } 26 | 27 | mem_total = mem_cgroup_get_limit(memcg, false); 28 | mem_used = mem_cgroup_usage(memcg, false); 29 | mem_free = mem_total - mem_used; 30 | mem_available = mem_free; 31 | 32 | seq_printf(m, 33 | "MemTotal: %8llu kB\n" 34 | "MemFree: %8llu kB\n" 35 | "MemAvailable: %8llu kB\n" 36 | //"Buffers: %8lu kB\n" 37 | //"Cached: %8lu kB\n" 38 | //"SwapCached: %8lu kB\n" 39 | //"Active: %8lu kB\n" 40 | //"Inactive: %8lu kB\n" 41 | //"Active(anon): %8lu kB\n" 42 | //"Inactive(anon): %8lu kB\n" 43 | //"Active(file): %8lu kB\n" 44 | //"Inactive(file): %8lu kB\n" 45 | //"Unevictable: %8lu kB\n" 46 | //"Mlocked: %8lu kB\n" 47 | //"SwapTotal: %8lu kB\n" 48 | //"SwapFree: %8lu kB\n" 49 | //"Dirty: %8lu kB\n" 50 | //"Writeback: %8lu kB\n" 51 | //"AnonPages: %8lu kB\n" 52 | //"Mapped: %8lu kB\n" 53 | //"Shmem: %8lu kB\n" 54 | //"Slab: %8lu kB\n" 55 | //"SReclaimable: %8lu kB\n" 56 | //"SUnreclaim: %8lu kB\n" 57 | //"KernelStack: %8lu kB\n" 58 | //"PageTables: %8lu kB\n" 59 | //"CommitLimit: %8lu kB\n" 60 | //"Committed_AS: %8lu kB\n" 61 | //"VmallocTotal: %8lu kB\n" 62 | //"VmallocUsed: %8lu kB\n" 63 | //"VmallocChunk: %8lu kB\n" 64 | , 65 | mem_total >> 10, 66 | mem_free >> 10, 67 | mem_available >> 10 68 | ); 69 | return 0; 70 | } 71 | 72 | static int meminfo_cgroup_open(struct inode *inode, struct file *file) 73 | { 74 | return single_open(file, meminfo_cgroup_show, NULL); 75 | } 76 | 77 | static const struct file_operations meminfo_cgroup_fop = { 78 | .open = meminfo_cgroup_open, 79 | .read = seq_read, 80 | .llseek = seq_lseek, 81 | .release = single_release, 82 | }; 83 | 84 | static struct dentry *(*original_proc_mount) (struct file_system_type *, int, 85 | const char *, void *); 86 | 87 | static void (*original_proc_kill_sb) (struct super_block *); 88 | 89 | static struct file_system_type procg_fs_type = { 90 | .name = "procg", 91 | .fs_flags = FS_USERNS_MOUNT 92 | }; 93 | 94 | static struct dentry *procg_mount(struct file_system_type *fs_type, 95 | int flags, const char *dev_name, void *data) 96 | { 97 | struct dentry *raw_proc_fs; 98 | struct dentry *meminfo; 99 | struct inode *meminfo_inode; 100 | 101 | raw_proc_fs = original_proc_mount(fs_type, flags, dev_name, data); 102 | mutex_lock(&raw_proc_fs->d_inode->i_mutex); 103 | meminfo = lookup_one_len("meminfo", raw_proc_fs, 7); 104 | meminfo_inode = meminfo->d_inode; 105 | meminfo_inode->i_fop = &meminfo_cgroup_fop; 106 | mutex_unlock(&raw_proc_fs->d_inode->i_mutex); 107 | 108 | return raw_proc_fs; 109 | } 110 | 111 | static int __init init_procg_fs(void) 112 | { 113 | struct file_system_type *proc; 114 | 115 | proc = get_fs_type("proc"); 116 | original_proc_mount = proc->mount; 117 | original_proc_kill_sb = proc->kill_sb; 118 | procg_fs_type.mount = procg_mount; 119 | procg_fs_type.kill_sb = original_proc_kill_sb; 120 | printk(KERN_INFO "loading procg fs\n"); 121 | return register_filesystem(&procg_fs_type); 122 | } 123 | 124 | static void __exit exit_procg_fs(void) 125 | { 126 | printk(KERN_INFO "unloading procg fs\n"); 127 | unregister_filesystem(&procg_fs_type); 128 | } 129 | 130 | module_init(init_procg_fs); 131 | module_exit(exit_procg_fs); 132 | -------------------------------------------------------------------------------- /patches/0000-cover-letter.patch: -------------------------------------------------------------------------------- 1 | From 416df3c077369f3fefb9d628ea8a205f997f02c6 Mon Sep 17 00:00:00 2001 2 | From: Fabio Kung 3 | Date: Wed, 12 Mar 2014 10:12:42 -0700 4 | Subject: [PATCH 0/2] Expose memcg stats 5 | 6 | With that, procfs, sysfs and other parts of the kernel (eg.: `sysinfo(2)`) may 7 | decide to display cgroup-aware stats for memory. 8 | 9 | Fabio Kung (2): 10 | memcontrol: make mem_cgroup_is_root public 11 | memcontrol: make memcg stats public 12 | 13 | include/linux/memcontrol.h | 35 ++++++++++++++++ 14 | mm/memcontrol.c | 102 ++++++++++++++++++++++++--------------------- 15 | 2 files changed, 89 insertions(+), 48 deletions(-) 16 | 17 | -- 18 | 1.8.3.2 19 | 20 | -------------------------------------------------------------------------------- /patches/0001-memcontrol-make-mem_cgroup_is_root-public.patch: -------------------------------------------------------------------------------- 1 | From e54a1845d1cd15f9f33f89d201fcb1c387640fd0 Mon Sep 17 00:00:00 2001 2 | From: Fabio Kung 3 | Date: Tue, 11 Mar 2014 17:37:17 -0700 4 | Subject: [PATCH 1/2] memcontrol: make mem_cgroup_is_root public 5 | 6 | Also provide an internal alternative (__mem_cgroup_is_root) which can be 7 | inlined, that way performance is not affected anywhere. 8 | 9 | Signed-off-by: Fabio Kung 10 | --- 11 | include/linux/memcontrol.h | 6 ++++++ 12 | mm/memcontrol.c | 46 ++++++++++++++++++++++++++-------------------- 13 | 2 files changed, 32 insertions(+), 20 deletions(-) 14 | 15 | diff --git a/include/linux/memcontrol.h b/include/linux/memcontrol.h 16 | index abd0113..d3393ed 100644 17 | --- a/include/linux/memcontrol.h 18 | +++ b/include/linux/memcontrol.h 19 | @@ -87,6 +87,7 @@ extern void mem_cgroup_uncharge_end(void); 20 | extern void mem_cgroup_uncharge_page(struct page *page); 21 | extern void mem_cgroup_uncharge_cache_page(struct page *page); 22 | 23 | +extern bool mem_cgroup_is_root(const struct mem_cgroup *memcg); 24 | bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg, 25 | struct mem_cgroup *memcg); 26 | bool task_in_mem_cgroup(struct task_struct *task, 27 | @@ -305,6 +306,11 @@ static inline bool mm_match_cgroup(struct mm_struct *mm, 28 | return true; 29 | } 30 | 31 | +static inline bool mem_cgroup_is_root(const struct mem_cgroup *memcg) 32 | +{ 33 | + return true; 34 | +} 35 | + 36 | static inline bool task_in_mem_cgroup(struct task_struct *task, 37 | const struct mem_cgroup *memcg) 38 | { 39 | diff --git a/mm/memcontrol.c b/mm/memcontrol.c 40 | index 5b6b003..2089d0c 100644 41 | --- a/mm/memcontrol.c 42 | +++ b/mm/memcontrol.c 43 | @@ -514,11 +514,17 @@ struct cgroup_subsys_state *vmpressure_to_css(struct vmpressure *vmpr) 44 | return &container_of(vmpr, struct mem_cgroup, vmpressure)->css; 45 | } 46 | 47 | -static inline bool mem_cgroup_is_root(struct mem_cgroup *memcg) 48 | +static inline bool __mem_cgroup_is_root(struct mem_cgroup *memcg) 49 | { 50 | return (memcg == root_mem_cgroup); 51 | } 52 | 53 | +bool mem_cgroup_is_root(struct mem_cgroup *memcg) 54 | +{ 55 | + return __mem_cgroup_is_root(memcg); 56 | +} 57 | +EXPORT_SYMBOL(mem_cgroup_is_root); 58 | + 59 | /* 60 | * We restrict the id in the range of [1, 65535], so it can fit into 61 | * an unsigned short. 62 | @@ -562,7 +568,7 @@ void sock_update_memcg(struct sock *sk) 63 | * decision in this case. 64 | */ 65 | if (sk->sk_cgrp) { 66 | - BUG_ON(mem_cgroup_is_root(sk->sk_cgrp->memcg)); 67 | + BUG_ON(__mem_cgroup_is_root(sk->sk_cgrp->memcg)); 68 | css_get(&sk->sk_cgrp->memcg->css); 69 | return; 70 | } 71 | @@ -570,7 +576,7 @@ void sock_update_memcg(struct sock *sk) 72 | rcu_read_lock(); 73 | memcg = mem_cgroup_from_task(current); 74 | cg_proto = sk->sk_prot->proto_cgroup(memcg); 75 | - if (!mem_cgroup_is_root(memcg) && 76 | + if (!__mem_cgroup_is_root(memcg) && 77 | memcg_proto_active(cg_proto) && css_tryget(&memcg->css)) { 78 | sk->sk_cgrp = cg_proto; 79 | } 80 | @@ -591,7 +597,7 @@ void sock_release_memcg(struct sock *sk) 81 | 82 | struct cg_proto *tcp_proto_cgroup(struct mem_cgroup *memcg) 83 | { 84 | - if (!memcg || mem_cgroup_is_root(memcg)) 85 | + if (!memcg || __mem_cgroup_is_root(memcg)) 86 | return NULL; 87 | 88 | return &memcg->tcp_mem; 89 | @@ -2753,7 +2759,7 @@ static int __mem_cgroup_try_charge(struct mm_struct *mm, 90 | again: 91 | if (*ptr) { /* css should be a valid one */ 92 | memcg = *ptr; 93 | - if (mem_cgroup_is_root(memcg)) 94 | + if (__mem_cgroup_is_root(memcg)) 95 | goto done; 96 | if (consume_stock(memcg, nr_pages)) 97 | goto done; 98 | @@ -2776,7 +2782,7 @@ again: 99 | memcg = mem_cgroup_from_task(p); 100 | if (!memcg) 101 | memcg = root_mem_cgroup; 102 | - if (mem_cgroup_is_root(memcg)) { 103 | + if (__mem_cgroup_is_root(memcg)) { 104 | rcu_read_unlock(); 105 | goto done; 106 | } 107 | @@ -2856,7 +2862,7 @@ bypass: 108 | static void __mem_cgroup_cancel_charge(struct mem_cgroup *memcg, 109 | unsigned int nr_pages) 110 | { 111 | - if (!mem_cgroup_is_root(memcg)) { 112 | + if (!__mem_cgroup_is_root(memcg)) { 113 | unsigned long bytes = nr_pages * PAGE_SIZE; 114 | 115 | res_counter_uncharge(&memcg->res, bytes); 116 | @@ -2874,7 +2880,7 @@ static void __mem_cgroup_cancel_local_charge(struct mem_cgroup *memcg, 117 | { 118 | unsigned long bytes = nr_pages * PAGE_SIZE; 119 | 120 | - if (mem_cgroup_is_root(memcg)) 121 | + if (__mem_cgroup_is_root(memcg)) 122 | return; 123 | 124 | res_counter_uncharge_until(&memcg->res, memcg->res.parent, bytes); 125 | @@ -3003,7 +3009,7 @@ static DEFINE_MUTEX(activate_kmem_mutex); 126 | 127 | static inline bool memcg_can_account_kmem(struct mem_cgroup *memcg) 128 | { 129 | - return !mem_cgroup_disabled() && !mem_cgroup_is_root(memcg) && 130 | + return !mem_cgroup_disabled() && !__mem_cgroup_is_root(memcg) && 131 | memcg_kmem_is_active(memcg); 132 | } 133 | 134 | @@ -3697,7 +3703,7 @@ void __memcg_kmem_commit_charge(struct page *page, struct mem_cgroup *memcg, 135 | { 136 | struct page_cgroup *pc; 137 | 138 | - VM_BUG_ON(mem_cgroup_is_root(memcg)); 139 | + VM_BUG_ON(__mem_cgroup_is_root(memcg)); 140 | 141 | /* The page allocation failed. Revert */ 142 | if (!page) { 143 | @@ -3740,7 +3746,7 @@ void __memcg_kmem_uncharge_pages(struct page *page, int order) 144 | if (!memcg) 145 | return; 146 | 147 | - VM_BUG_ON_PAGE(mem_cgroup_is_root(memcg), page); 148 | + VM_BUG_ON_PAGE(__mem_cgroup_is_root(memcg), page); 149 | memcg_uncharge_kmem(memcg, PAGE_SIZE << order); 150 | } 151 | #else 152 | @@ -3894,7 +3900,7 @@ static int mem_cgroup_move_parent(struct page *page, 153 | unsigned long uninitialized_var(flags); 154 | int ret; 155 | 156 | - VM_BUG_ON(mem_cgroup_is_root(child)); 157 | + VM_BUG_ON(__mem_cgroup_is_root(child)); 158 | 159 | ret = -EBUSY; 160 | if (!get_page_unless_zero(page)) 161 | @@ -4248,7 +4254,7 @@ __mem_cgroup_uncharge_common(struct page *page, enum charge_type ctype, 162 | * replacement page, so leave it alone when phasing out the 163 | * page that is unused after the migration. 164 | */ 165 | - if (!end_migration && !mem_cgroup_is_root(memcg)) 166 | + if (!end_migration && !__mem_cgroup_is_root(memcg)) 167 | mem_cgroup_do_uncharge(memcg, nr_pages, ctype); 168 | 169 | return memcg; 170 | @@ -4381,7 +4387,7 @@ void mem_cgroup_uncharge_swap(swp_entry_t ent) 171 | * We uncharge this because swap is freed. 172 | * This memcg can be obsolete one. We avoid calling css_tryget 173 | */ 174 | - if (!mem_cgroup_is_root(memcg)) 175 | + if (!__mem_cgroup_is_root(memcg)) 176 | res_counter_uncharge(&memcg->memsw, PAGE_SIZE); 177 | mem_cgroup_swap_statistics(memcg, false); 178 | css_put(&memcg->css); 179 | @@ -5022,7 +5028,7 @@ static int mem_cgroup_force_empty_write(struct cgroup_subsys_state *css, 180 | { 181 | struct mem_cgroup *memcg = mem_cgroup_from_css(css); 182 | 183 | - if (mem_cgroup_is_root(memcg)) 184 | + if (__mem_cgroup_is_root(memcg)) 185 | return -EINVAL; 186 | return mem_cgroup_force_empty(memcg); 187 | } 188 | @@ -5088,7 +5094,7 @@ static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) 189 | { 190 | u64 val; 191 | 192 | - if (!mem_cgroup_is_root(memcg)) { 193 | + if (!__mem_cgroup_is_root(memcg)) { 194 | if (!swap) 195 | return res_counter_read_u64(&memcg->res, RES_USAGE); 196 | else 197 | @@ -5287,7 +5293,7 @@ static int mem_cgroup_write(struct cgroup_subsys_state *css, struct cftype *cft, 198 | 199 | switch (name) { 200 | case RES_LIMIT: 201 | - if (mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ 202 | + if (__mem_cgroup_is_root(memcg)) { /* Can't set limit on root */ 203 | ret = -EINVAL; 204 | break; 205 | } 206 | @@ -6677,7 +6683,7 @@ static int mem_cgroup_do_precharge(unsigned long count) 207 | int batch_count = PRECHARGE_COUNT_AT_ONCE; 208 | struct mem_cgroup *memcg = mc.to; 209 | 210 | - if (mem_cgroup_is_root(memcg)) { 211 | + if (__mem_cgroup_is_root(memcg)) { 212 | mc.precharge += count; 213 | /* we don't need css_get for root */ 214 | return ret; 215 | @@ -6992,14 +6998,14 @@ static void __mem_cgroup_clear_mc(void) 216 | /* we must fixup refcnts and charges */ 217 | if (mc.moved_swap) { 218 | /* uncharge swap account from the old cgroup */ 219 | - if (!mem_cgroup_is_root(mc.from)) 220 | + if (!__mem_cgroup_is_root(mc.from)) 221 | res_counter_uncharge(&mc.from->memsw, 222 | PAGE_SIZE * mc.moved_swap); 223 | 224 | for (i = 0; i < mc.moved_swap; i++) 225 | css_put(&mc.from->css); 226 | 227 | - if (!mem_cgroup_is_root(mc.to)) { 228 | + if (!__mem_cgroup_is_root(mc.to)) { 229 | /* 230 | * we charged both to->res and to->memsw, so we should 231 | * uncharge to->res. 232 | -- 233 | 1.8.3.2 234 | 235 | -------------------------------------------------------------------------------- /patches/0002-memcontrol-make-memcg-stats-public.patch: -------------------------------------------------------------------------------- 1 | From 416df3c077369f3fefb9d628ea8a205f997f02c6 Mon Sep 17 00:00:00 2001 2 | From: Fabio Kung 3 | Date: Wed, 12 Mar 2014 10:10:28 -0700 4 | Subject: [PATCH 2/2] memcontrol: make memcg stats public 5 | 6 | Signed-off-by: Fabio Kung 7 | --- 8 | include/linux/memcontrol.h | 31 ++++++++++++++++++++++++- 9 | mm/memcontrol.c | 56 +++++++++++++++++++++++----------------------- 10 | 2 files changed, 58 insertions(+), 29 deletions(-) 11 | 12 | diff --git a/include/linux/memcontrol.h b/include/linux/memcontrol.h 13 | index d3393ed..95993e8 100644 14 | --- a/include/linux/memcontrol.h 15 | +++ b/include/linux/memcontrol.h 16 | @@ -47,6 +47,18 @@ enum mem_cgroup_stat_index { 17 | MEM_CGROUP_STAT_NSTATS, 18 | }; 19 | 20 | +/* 21 | + * The corresponding mem_cgroup_events_names is defined in mm/memcontrol.c, 22 | + * These two lists should keep in accord with each other. 23 | + */ 24 | +enum mem_cgroup_events_index { 25 | + MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */ 26 | + MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */ 27 | + MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */ 28 | + MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */ 29 | + MEM_CGROUP_EVENTS_NSTATS, 30 | +}; 31 | + 32 | struct mem_cgroup_reclaim_cookie { 33 | struct zone *zone; 34 | int priority; 35 | @@ -54,6 +66,10 @@ struct mem_cgroup_reclaim_cookie { 36 | }; 37 | 38 | #ifdef CONFIG_MEMCG 39 | +extern const char * const mem_cgroup_stat_names[]; 40 | +extern const char * const mem_cgroup_events_names[]; 41 | +extern const char * const mem_cgroup_lru_names[]; 42 | + 43 | /* 44 | * All "charge" functions with gfp_mask should use GFP_KERNEL or 45 | * (gfp_mask & GFP_RECLAIM_MASK). In current implementatin, memcg doesn't 46 | @@ -87,7 +103,7 @@ extern void mem_cgroup_uncharge_end(void); 47 | extern void mem_cgroup_uncharge_page(struct page *page); 48 | extern void mem_cgroup_uncharge_cache_page(struct page *page); 49 | 50 | -extern bool mem_cgroup_is_root(const struct mem_cgroup *memcg); 51 | +extern bool mem_cgroup_is_root(struct mem_cgroup *memcg); 52 | bool __mem_cgroup_same_or_subtree(const struct mem_cgroup *root_memcg, 53 | struct mem_cgroup *memcg); 54 | bool task_in_mem_cgroup(struct task_struct *task, 55 | @@ -100,6 +116,19 @@ extern struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm); 56 | extern struct mem_cgroup *parent_mem_cgroup(struct mem_cgroup *memcg); 57 | extern struct mem_cgroup *mem_cgroup_from_css(struct cgroup_subsys_state *css); 58 | 59 | +/* 60 | + * Memory usage in bytes (with or without swap included). 61 | + */ 62 | +extern u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap); 63 | +extern u64 mem_cgroup_get_limit(struct mem_cgroup *memcg, bool swap); 64 | + 65 | +extern long mem_cgroup_read_stat(struct mem_cgroup *memcg, 66 | + enum mem_cgroup_stat_index idx); 67 | +extern unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, 68 | + enum mem_cgroup_events_index idx); 69 | +extern unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, 70 | + unsigned int lru_mask); 71 | + 72 | static inline 73 | bool mm_match_cgroup(const struct mm_struct *mm, const struct mem_cgroup *memcg) 74 | { 75 | diff --git a/mm/memcontrol.c b/mm/memcontrol.c 76 | index 2089d0c..c9dd222 100644 77 | --- a/mm/memcontrol.c 78 | +++ b/mm/memcontrol.c 79 | @@ -87,8 +87,7 @@ static int really_do_swap_account __initdata = 0; 80 | #define do_swap_account 0 81 | #endif 82 | 83 | - 84 | -static const char * const mem_cgroup_stat_names[] = { 85 | +const char * const mem_cgroup_stat_names[] = { 86 | "cache", 87 | "rss", 88 | "rss_huge", 89 | @@ -96,29 +95,24 @@ static const char * const mem_cgroup_stat_names[] = { 90 | "writeback", 91 | "swap", 92 | }; 93 | +EXPORT_SYMBOL(mem_cgroup_stat_names); 94 | 95 | -enum mem_cgroup_events_index { 96 | - MEM_CGROUP_EVENTS_PGPGIN, /* # of pages paged in */ 97 | - MEM_CGROUP_EVENTS_PGPGOUT, /* # of pages paged out */ 98 | - MEM_CGROUP_EVENTS_PGFAULT, /* # of page-faults */ 99 | - MEM_CGROUP_EVENTS_PGMAJFAULT, /* # of major page-faults */ 100 | - MEM_CGROUP_EVENTS_NSTATS, 101 | -}; 102 | - 103 | -static const char * const mem_cgroup_events_names[] = { 104 | +const char * const mem_cgroup_events_names[] = { 105 | "pgpgin", 106 | "pgpgout", 107 | "pgfault", 108 | "pgmajfault", 109 | }; 110 | +EXPORT_SYMBOL(mem_cgroup_events_names); 111 | 112 | -static const char * const mem_cgroup_lru_names[] = { 113 | +const char * const mem_cgroup_lru_names[] = { 114 | "inactive_anon", 115 | "active_anon", 116 | "inactive_file", 117 | "active_file", 118 | "unevictable", 119 | }; 120 | +EXPORT_SYMBOL(mem_cgroup_lru_names); 121 | 122 | /* 123 | * Per memcg event counter is incremented at every pagein/pageout. With THP, 124 | @@ -880,8 +874,8 @@ mem_cgroup_largest_soft_limit_node(struct mem_cgroup_tree_per_zone *mctz) 125 | * common workload, threashold and synchonization as vmstat[] should be 126 | * implemented. 127 | */ 128 | -static long mem_cgroup_read_stat(struct mem_cgroup *memcg, 129 | - enum mem_cgroup_stat_index idx) 130 | +long mem_cgroup_read_stat(struct mem_cgroup *memcg, 131 | + enum mem_cgroup_stat_index idx) 132 | { 133 | long val = 0; 134 | int cpu; 135 | @@ -897,16 +891,10 @@ static long mem_cgroup_read_stat(struct mem_cgroup *memcg, 136 | put_online_cpus(); 137 | return val; 138 | } 139 | +EXPORT_SYMBOL(mem_cgroup_read_stat); 140 | 141 | -static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg, 142 | - bool charge) 143 | -{ 144 | - int val = (charge) ? 1 : -1; 145 | - this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val); 146 | -} 147 | - 148 | -static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, 149 | - enum mem_cgroup_events_index idx) 150 | +unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, 151 | + enum mem_cgroup_events_index idx) 152 | { 153 | unsigned long val = 0; 154 | int cpu; 155 | @@ -922,6 +910,14 @@ static unsigned long mem_cgroup_read_events(struct mem_cgroup *memcg, 156 | put_online_cpus(); 157 | return val; 158 | } 159 | +EXPORT_SYMBOL(mem_cgroup_read_events); 160 | + 161 | +static void mem_cgroup_swap_statistics(struct mem_cgroup *memcg, 162 | + bool charge) 163 | +{ 164 | + int val = (charge) ? 1 : -1; 165 | + this_cpu_add(memcg->stat->count[MEM_CGROUP_STAT_SWAP], val); 166 | +} 167 | 168 | static void mem_cgroup_charge_statistics(struct mem_cgroup *memcg, 169 | struct page *page, 170 | @@ -997,7 +993,7 @@ mem_cgroup_node_nr_lru_pages(struct mem_cgroup *memcg, 171 | return total; 172 | } 173 | 174 | -static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, 175 | +unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, 176 | unsigned int lru_mask) 177 | { 178 | int nid; 179 | @@ -1007,6 +1003,7 @@ static unsigned long mem_cgroup_nr_lru_pages(struct mem_cgroup *memcg, 180 | total += mem_cgroup_node_nr_lru_pages(memcg, nid, lru_mask); 181 | return total; 182 | } 183 | +EXPORT_SYMBOL(mem_cgroup_nr_lru_pages); 184 | 185 | static bool mem_cgroup_event_ratelimit(struct mem_cgroup *memcg, 186 | enum mem_cgroup_events_target target) 187 | @@ -1080,6 +1077,7 @@ struct mem_cgroup *mem_cgroup_from_task(struct task_struct *p) 188 | 189 | return mem_cgroup_from_css(task_css(p, mem_cgroup_subsys_id)); 190 | } 191 | +EXPORT_SYMBOL(mem_cgroup_from_task); 192 | 193 | struct mem_cgroup *try_get_mem_cgroup_from_mm(struct mm_struct *mm) 194 | { 195 | @@ -1793,7 +1791,7 @@ static int mem_cgroup_count_children(struct mem_cgroup *memcg) 196 | /* 197 | * Return the memory (and swap, if configured) limit for a memcg. 198 | */ 199 | -static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg) 200 | +u64 mem_cgroup_get_limit(struct mem_cgroup *memcg, bool swap) 201 | { 202 | u64 limit; 203 | 204 | @@ -1802,7 +1800,7 @@ static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg) 205 | /* 206 | * Do not consider swap space if we cannot swap due to swappiness 207 | */ 208 | - if (mem_cgroup_swappiness(memcg)) { 209 | + if (swap && mem_cgroup_swappiness(memcg)) { 210 | u64 memsw; 211 | 212 | limit += total_swap_pages << PAGE_SHIFT; 213 | @@ -1817,6 +1815,7 @@ static u64 mem_cgroup_get_limit(struct mem_cgroup *memcg) 214 | 215 | return limit; 216 | } 217 | +EXPORT_SYMBOL(mem_cgroup_get_limit); 218 | 219 | static void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask, 220 | int order) 221 | @@ -1838,7 +1837,7 @@ static void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask, 222 | } 223 | 224 | check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, order, NULL); 225 | - totalpages = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT ? : 1; 226 | + totalpages = mem_cgroup_get_limit(memcg, true) >> PAGE_SHIFT ? : 1; 227 | for_each_mem_cgroup_tree(iter, memcg) { 228 | struct css_task_iter it; 229 | struct task_struct *task; 230 | @@ -5090,7 +5089,7 @@ static unsigned long mem_cgroup_recursive_stat(struct mem_cgroup *memcg, 231 | return val; 232 | } 233 | 234 | -static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) 235 | +u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) 236 | { 237 | u64 val; 238 | 239 | @@ -5113,6 +5112,7 @@ static inline u64 mem_cgroup_usage(struct mem_cgroup *memcg, bool swap) 240 | 241 | return val << PAGE_SHIFT; 242 | } 243 | +EXPORT_SYMBOL(mem_cgroup_usage); 244 | 245 | static u64 mem_cgroup_read_u64(struct cgroup_subsys_state *css, 246 | struct cftype *cft) 247 | -- 248 | 1.8.3.2 249 | 250 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/Makefile: -------------------------------------------------------------------------------- 1 | #/usr/bin/make 2 | SRC = $(DESTDIR)/usr/src 3 | SHARE = $(DESTDIR)/usr/share/$(NAME)-dkms 4 | 5 | all: 6 | 7 | clean: 8 | 9 | install: 10 | 11 | #source tree 12 | ifeq ("$(wildcard $(NAME)-$(VERSION))", "$(NAME)-$(VERSION)") 13 | install -d "$(SRC)" 14 | cp -a $(NAME)-$(VERSION) $(SRC) 15 | rm -rf "$(SRC)/$(NAME)-$(VERSION)/.git" 16 | rm -f "$(SRC)/$(NAME)-$(VERSION)/.gitignore" 17 | rm -rf "$(SRC)/$(NAME)-$(VERSION)/procg-dkms-mkdeb" 18 | chmod 644 -R "$(SRC)/$(NAME)-$(VERSION)" 19 | endif 20 | 21 | #tarball, possibly with binaries 22 | ifeq ("$(wildcard $(NAME)-$(VERSION).dkms.tar.gz)", "$(NAME)-$(VERSION).dkms.tar.gz") 23 | install -d "$(SHARE)" 24 | install -m 644 $(NAME)-$(VERSION).dkms.tar.gz "$(SHARE)" 25 | endif 26 | 27 | #postinst, only if we are supporting legacy mode 28 | ifeq ("$(wildcard common.postinst)", "common.postinst") 29 | install -d "$(SHARE)" 30 | install -m 755 $(PREFIX)/usr/lib/dkms/common.postinst $(SHARE)/postinst 31 | endif 32 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/README.Debian: -------------------------------------------------------------------------------- 1 | MODULE_NAME DKMS module for Debian 2 | 3 | More info at . 4 | 5 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/changelog: -------------------------------------------------------------------------------- 1 | DEBIAN_PACKAGE-dkms (MODULE_VERSION) stable; urgency=low 2 | 3 | * Automatically packaged by DKMS. 4 | 5 | -- Fabio Kung DATE_STAMP 6 | 7 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/compat: -------------------------------------------------------------------------------- 1 | 7 2 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/control: -------------------------------------------------------------------------------- 1 | Source: DEBIAN_PACKAGE-dkms 2 | Section: kernel 3 | Priority: optional 4 | Maintainer: Fabio Kung 5 | Build-Depends: debhelper (>= 7), dkms 6 | Standards-Version: 3.8.1 7 | 8 | Package: DEBIAN_PACKAGE-dkms 9 | Architecture: all 10 | Depends: dkms (>= 1.95), ${misc:Depends} 11 | Description: DEBIAN_PACKAGE custom procfs that provides cgroup-aware system metrics, in DKMS format. 12 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/copyright: -------------------------------------------------------------------------------- 1 | 2 | Copyright (C) 2014 Fabio Kung 3 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/dirs: -------------------------------------------------------------------------------- 1 | usr/src 2 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/postinst: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | # Copyright (C) 2002-2005 Flavio Stanchina 3 | # Copyright (C) 2005-2006 Aric Cyr 4 | # Copyright (C) 2007 Mario Limonciello 5 | # Copyright (C) 2009 Alberto Milone 6 | 7 | set -e 8 | 9 | NAME=MODULE_NAME 10 | PACKAGE_NAME=$NAME-dkms 11 | DEB_NAME=$(echo $PACKAGE_NAME | sed 's,_,-,') 12 | CVERSION=`dpkg-query -W -f='${Version}' $DEB_NAME | awk -F "-" '{print $1}' | cut -d\: -f2` 13 | ARCH=`dpkg --print-architecture` 14 | 15 | dkms_configure () { 16 | for POSTINST in /usr/lib/dkms/common.postinst "/usr/share/$PACKAGE_NAME/postinst"; do 17 | if [ -f "$POSTINST" ]; then 18 | "$POSTINST" "$NAME" "$CVERSION" "/usr/share/$PACKAGE_NAME" "$ARCH" "$2" 19 | return $? 20 | fi 21 | echo "WARNING: $POSTINST does not exist." >&2 22 | done 23 | echo "ERROR: DKMS version is too old and $PACKAGE_NAME was not" >&2 24 | echo "built with legacy DKMS support." >&2 25 | echo "You must either rebuild $PACKAGE_NAME with legacy postinst" >&2 26 | echo "support or upgrade DKMS to a more current version." >&2 27 | return 1 28 | } 29 | 30 | case "$1" in 31 | configure) 32 | dkms_configure 33 | ;; 34 | 35 | abort-upgrade|abort-remove|abort-deconfigure) 36 | ;; 37 | 38 | *) 39 | echo "postinst called with unknown argument \`$1'" >&2 40 | exit 1 41 | ;; 42 | esac 43 | 44 | # dh_installdeb will replace this with shell code automatically 45 | # generated by other debhelper scripts. 46 | 47 | #DEBHELPER# 48 | 49 | exit 0 50 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/prerm: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | NAME=MODULE_NAME 4 | VERSION=MODULE_VERSION 5 | 6 | set -e 7 | 8 | case "$1" in 9 | remove|upgrade|deconfigure) 10 | if [ "`dkms status -m $NAME`" ]; then 11 | dkms remove -m $NAME -v $VERSION --all 12 | fi 13 | ;; 14 | 15 | failed-upgrade) 16 | ;; 17 | 18 | *) 19 | echo "prerm called with unknown argument \`$1'" >&2 20 | exit 1 21 | ;; 22 | esac 23 | 24 | #DEBHELPER# 25 | 26 | exit 0 27 | 28 | 29 | -------------------------------------------------------------------------------- /procg-dkms-mkdeb/debian/rules: -------------------------------------------------------------------------------- 1 | #!/usr/bin/make -f 2 | # -*- makefile -*- 3 | 4 | # Uncomment this to turn on verbose mode. 5 | #export DH_VERBOSE=1 6 | 7 | DEB_NAME=DEBIAN_PACKAGE 8 | NAME=MODULE_NAME 9 | VERSION=MODULE_VERSION 10 | 11 | configure: configure-stamp 12 | configure-stamp: 13 | dh_testdir 14 | touch configure-stamp 15 | 16 | 17 | build: build-stamp 18 | 19 | build-stamp: configure-stamp 20 | dh_testdir 21 | $(MAKE) 22 | touch $@ 23 | 24 | clean: 25 | dh_testdir 26 | dh_testroot 27 | rm -f build-stamp configure-stamp 28 | -$(MAKE) clean 29 | dh_clean 30 | 31 | install: build 32 | dh_testdir 33 | dh_testroot 34 | dh_prep 35 | dh_installdirs 36 | $(MAKE) DESTDIR=$(CURDIR)/debian/$(DEB_NAME)-dkms NAME=$(NAME) VERSION=$(VERSION) install 37 | 38 | binary-arch: build install 39 | 40 | binary-indep: build install 41 | dh_testdir 42 | dh_testroot 43 | dh_link 44 | dh_strip 45 | dh_compress 46 | dh_fixperms 47 | dh_installdeb 48 | dh_shlibdeps 49 | dh_gencontrol 50 | dh_md5sums 51 | dh_builddeb 52 | 53 | binary: binary-indep binary-arch 54 | .PHONY: build clean binary-indep binary-arch binary install configure 55 | --------------------------------------------------------------------------------