acpi_mrrm.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (c) 2025, Intel Corporation.
  4. *
  5. * Memory Range and Region Mapping (MRRM) structure
  6. *
  7. * Parse and report the platform's MRRM table in /sys.
  8. */
  9. #define pr_fmt(fmt) "acpi/mrrm: " fmt
  10. #include <linux/acpi.h>
  11. #include <linux/init.h>
  12. #include <linux/string.h>
  13. #include <linux/sysfs.h>
  14. /* Default assume one memory region covering all system memory, per the spec */
  15. static int max_mem_region = 1;
  16. /* Access for use by resctrl file system */
  17. int acpi_mrrm_max_mem_region(void)
  18. {
  19. return max_mem_region;
  20. }
  21. struct mrrm_mem_range_entry {
  22. u64 base;
  23. u64 length;
  24. int node;
  25. u8 local_region_id;
  26. u8 remote_region_id;
  27. };
  28. static struct mrrm_mem_range_entry *mrrm_mem_range_entry;
  29. static u32 mrrm_mem_entry_num;
  30. static int get_node_num(struct mrrm_mem_range_entry *e)
  31. {
  32. unsigned int nid;
  33. for_each_online_node(nid) {
  34. for (int z = 0; z < MAX_NR_ZONES; z++) {
  35. struct zone *zone = NODE_DATA(nid)->node_zones + z;
  36. if (!populated_zone(zone))
  37. continue;
  38. if (zone_intersects(zone, PHYS_PFN(e->base), PHYS_PFN(e->length)))
  39. return zone_to_nid(zone);
  40. }
  41. }
  42. return -ENOENT;
  43. }
  44. static __init int acpi_parse_mrrm(struct acpi_table_header *table)
  45. {
  46. struct acpi_mrrm_mem_range_entry *mre_entry;
  47. struct acpi_table_mrrm *mrrm;
  48. void *mre, *mrrm_end;
  49. int mre_count = 0;
  50. mrrm = (struct acpi_table_mrrm *)table;
  51. if (!mrrm)
  52. return -ENODEV;
  53. if (mrrm->header.revision != 1)
  54. return -EINVAL;
  55. if (mrrm->flags & ACPI_MRRM_FLAGS_REGION_ASSIGNMENT_OS)
  56. return -EOPNOTSUPP;
  57. mrrm_end = (void *)mrrm + mrrm->header.length - 1;
  58. mre = (void *)mrrm + sizeof(struct acpi_table_mrrm);
  59. while (mre < mrrm_end) {
  60. mre_entry = mre;
  61. mre_count++;
  62. mre += mre_entry->header.length;
  63. }
  64. if (!mre_count) {
  65. pr_info(FW_BUG "No ranges listed in MRRM table\n");
  66. return -EINVAL;
  67. }
  68. mrrm_mem_range_entry = kmalloc_objs(*mrrm_mem_range_entry, mre_count,
  69. GFP_KERNEL | __GFP_ZERO);
  70. if (!mrrm_mem_range_entry)
  71. return -ENOMEM;
  72. mre = (void *)mrrm + sizeof(struct acpi_table_mrrm);
  73. while (mre < mrrm_end) {
  74. struct mrrm_mem_range_entry *e;
  75. mre_entry = mre;
  76. e = mrrm_mem_range_entry + mrrm_mem_entry_num;
  77. e->base = mre_entry->addr_base;
  78. e->length = mre_entry->addr_len;
  79. e->node = get_node_num(e);
  80. if (mre_entry->region_id_flags & ACPI_MRRM_VALID_REGION_ID_FLAGS_LOCAL)
  81. e->local_region_id = mre_entry->local_region_id;
  82. else
  83. e->local_region_id = -1;
  84. if (mre_entry->region_id_flags & ACPI_MRRM_VALID_REGION_ID_FLAGS_REMOTE)
  85. e->remote_region_id = mre_entry->remote_region_id;
  86. else
  87. e->remote_region_id = -1;
  88. mrrm_mem_entry_num++;
  89. mre += mre_entry->header.length;
  90. }
  91. max_mem_region = mrrm->max_mem_region;
  92. return 0;
  93. }
  94. #define RANGE_ATTR(name, fmt) \
  95. static ssize_t name##_show(struct kobject *kobj, \
  96. struct kobj_attribute *attr, char *buf) \
  97. { \
  98. struct mrrm_mem_range_entry *mre; \
  99. const char *kname = kobject_name(kobj); \
  100. int n, ret; \
  101. \
  102. ret = kstrtoint(kname + 5, 10, &n); \
  103. if (ret) \
  104. return ret; \
  105. \
  106. mre = mrrm_mem_range_entry + n; \
  107. \
  108. return sysfs_emit(buf, fmt, mre->name); \
  109. } \
  110. static struct kobj_attribute name##_attr = __ATTR_RO(name)
  111. RANGE_ATTR(base, "0x%llx\n");
  112. RANGE_ATTR(length, "0x%llx\n");
  113. RANGE_ATTR(node, "%d\n");
  114. RANGE_ATTR(local_region_id, "%d\n");
  115. RANGE_ATTR(remote_region_id, "%d\n");
  116. static struct attribute *memory_range_attrs[] = {
  117. &base_attr.attr,
  118. &length_attr.attr,
  119. &node_attr.attr,
  120. &local_region_id_attr.attr,
  121. &remote_region_id_attr.attr,
  122. NULL
  123. };
  124. ATTRIBUTE_GROUPS(memory_range);
  125. static __init int add_boot_memory_ranges(void)
  126. {
  127. struct kobject *pkobj, *kobj, **kobjs;
  128. int ret = -EINVAL;
  129. char name[16];
  130. int i;
  131. pkobj = kobject_create_and_add("memory_ranges", acpi_kobj);
  132. if (!pkobj)
  133. return -ENOMEM;
  134. kobjs = kzalloc_objs(*kobjs, mrrm_mem_entry_num);
  135. if (!kobjs) {
  136. kobject_put(pkobj);
  137. return -ENOMEM;
  138. }
  139. for (i = 0; i < mrrm_mem_entry_num; i++) {
  140. scnprintf(name, sizeof(name), "range%d", i);
  141. kobj = kobject_create_and_add(name, pkobj);
  142. if (!kobj) {
  143. ret = -ENOMEM;
  144. goto cleanup;
  145. }
  146. ret = sysfs_create_groups(kobj, memory_range_groups);
  147. if (ret) {
  148. kobject_put(kobj);
  149. goto cleanup;
  150. }
  151. kobjs[i] = kobj;
  152. }
  153. kfree(kobjs);
  154. return 0;
  155. cleanup:
  156. for (int j = 0; j < i; j++) {
  157. if (kobjs[j]) {
  158. sysfs_remove_groups(kobjs[j], memory_range_groups);
  159. kobject_put(kobjs[j]);
  160. }
  161. }
  162. kfree(kobjs);
  163. kobject_put(pkobj);
  164. return ret;
  165. }
  166. static __init int mrrm_init(void)
  167. {
  168. int ret;
  169. ret = acpi_table_parse(ACPI_SIG_MRRM, acpi_parse_mrrm);
  170. if (ret < 0)
  171. return ret;
  172. return add_boot_memory_ranges();
  173. }
  174. device_initcall(mrrm_init);