resource.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134
  1. /*
  2. * AppArmor security module
  3. *
  4. * This file contains AppArmor resource mediation and attachment
  5. *
  6. * Copyright (C) 1998-2008 Novell/SUSE
  7. * Copyright 2009-2010 Canonical Ltd.
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License as
  11. * published by the Free Software Foundation, version 2 of the
  12. * License.
  13. */
  14. #include <linux/audit.h>
  15. #include "include/audit.h"
  16. #include "include/resource.h"
  17. #include "include/policy.h"
  18. /*
  19. * Table of rlimit names: we generate it from resource.h.
  20. */
  21. #include "rlim_names.h"
  22. /* audit callback for resource specific fields */
  23. static void audit_cb(struct audit_buffer *ab, void *va)
  24. {
  25. struct common_audit_data *sa = va;
  26. audit_log_format(ab, " rlimit=%s value=%lu",
  27. rlim_names[sa->aad.rlim.rlim], sa->aad.rlim.max);
  28. }
  29. /**
  30. * audit_resource - audit setting resource limit
  31. * @profile: profile being enforced (NOT NULL)
  32. * @resoure: rlimit being auditing
  33. * @value: value being set
  34. * @error: error value
  35. *
  36. * Returns: 0 or sa->error else other error code on failure
  37. */
  38. static int audit_resource(struct aa_profile *profile, unsigned int resource,
  39. unsigned long value, int error)
  40. {
  41. struct common_audit_data sa;
  42. COMMON_AUDIT_DATA_INIT(&sa, NONE);
  43. sa.aad.op = OP_SETRLIMIT,
  44. sa.aad.rlim.rlim = resource;
  45. sa.aad.rlim.max = value;
  46. sa.aad.error = error;
  47. return aa_audit(AUDIT_APPARMOR_AUTO, profile, GFP_KERNEL, &sa,
  48. audit_cb);
  49. }
  50. /**
  51. * aa_map_resouce - map compiled policy resource to internal #
  52. * @resource: flattened policy resource number
  53. *
  54. * Returns: resource # for the current architecture.
  55. *
  56. * rlimit resource can vary based on architecture, map the compiled policy
  57. * resource # to the internal representation for the architecture.
  58. */
  59. int aa_map_resource(int resource)
  60. {
  61. return rlim_map[resource];
  62. }
  63. /**
  64. * aa_task_setrlimit - test permission to set an rlimit
  65. * @profile - profile confining the task (NOT NULL)
  66. * @resource - the resource being set
  67. * @new_rlim - the new resource limit (NOT NULL)
  68. *
  69. * Control raising the processes hard limit.
  70. *
  71. * Returns: 0 or error code if setting resource failed
  72. */
  73. int aa_task_setrlimit(struct aa_profile *profile, unsigned int resource,
  74. struct rlimit *new_rlim)
  75. {
  76. int error = 0;
  77. if (profile->rlimits.mask & (1 << resource) &&
  78. new_rlim->rlim_max > profile->rlimits.limits[resource].rlim_max)
  79. error = audit_resource(profile, resource, new_rlim->rlim_max,
  80. -EACCES);
  81. return error;
  82. }
  83. /**
  84. * __aa_transition_rlimits - apply new profile rlimits
  85. * @old: old profile on task (NOT NULL)
  86. * @new: new profile with rlimits to apply (NOT NULL)
  87. */
  88. void __aa_transition_rlimits(struct aa_profile *old, struct aa_profile *new)
  89. {
  90. unsigned int mask = 0;
  91. struct rlimit *rlim, *initrlim;
  92. int i;
  93. /* for any rlimits the profile controlled reset the soft limit
  94. * to the less of the tasks hard limit and the init tasks soft limit
  95. */
  96. if (old->rlimits.mask) {
  97. for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
  98. if (old->rlimits.mask & mask) {
  99. rlim = current->signal->rlim + i;
  100. initrlim = init_task.signal->rlim + i;
  101. rlim->rlim_cur = min(rlim->rlim_max,
  102. initrlim->rlim_cur);
  103. }
  104. }
  105. }
  106. /* set any new hard limits as dictated by the new profile */
  107. if (!new->rlimits.mask)
  108. return;
  109. for (i = 0, mask = 1; i < RLIM_NLIMITS; i++, mask <<= 1) {
  110. if (!(new->rlimits.mask & mask))
  111. continue;
  112. rlim = current->signal->rlim + i;
  113. rlim->rlim_max = min(rlim->rlim_max,
  114. new->rlimits.limits[i].rlim_max);
  115. /* soft limit should not exceed hard limit */
  116. rlim->rlim_cur = min(rlim->rlim_cur, rlim->rlim_max);
  117. }
  118. }