mobility.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365
  1. /*
  2. * Support for Partition Mobility/Migration
  3. *
  4. * Copyright (C) 2010 Nathan Fontenot
  5. * Copyright (C) 2010 IBM Corporation
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License version
  9. * 2 as published by the Free Software Foundation.
  10. */
  11. #include <linux/kernel.h>
  12. #include <linux/kobject.h>
  13. #include <linux/smp.h>
  14. #include <linux/stat.h>
  15. #include <linux/completion.h>
  16. #include <linux/device.h>
  17. #include <linux/delay.h>
  18. #include <linux/slab.h>
  19. #include <asm/rtas.h>
  20. #include "pseries.h"
  21. static struct kobject *mobility_kobj;
  22. struct update_props_workarea {
  23. u32 phandle;
  24. u32 state;
  25. u64 reserved;
  26. u32 nprops;
  27. } __packed;
  28. #define NODE_ACTION_MASK 0xff000000
  29. #define NODE_COUNT_MASK 0x00ffffff
  30. #define DELETE_DT_NODE 0x01000000
  31. #define UPDATE_DT_NODE 0x02000000
  32. #define ADD_DT_NODE 0x03000000
  33. #define MIGRATION_SCOPE (1)
  34. static int mobility_rtas_call(int token, char *buf, s32 scope)
  35. {
  36. int rc;
  37. spin_lock(&rtas_data_buf_lock);
  38. memcpy(rtas_data_buf, buf, RTAS_DATA_BUF_SIZE);
  39. rc = rtas_call(token, 2, 1, NULL, rtas_data_buf, scope);
  40. memcpy(buf, rtas_data_buf, RTAS_DATA_BUF_SIZE);
  41. spin_unlock(&rtas_data_buf_lock);
  42. return rc;
  43. }
  44. static int delete_dt_node(u32 phandle)
  45. {
  46. struct device_node *dn;
  47. dn = of_find_node_by_phandle(phandle);
  48. if (!dn)
  49. return -ENOENT;
  50. dlpar_detach_node(dn);
  51. of_node_put(dn);
  52. return 0;
  53. }
  54. static int update_dt_property(struct device_node *dn, struct property **prop,
  55. const char *name, u32 vd, char *value)
  56. {
  57. struct property *new_prop = *prop;
  58. int more = 0;
  59. /* A negative 'vd' value indicates that only part of the new property
  60. * value is contained in the buffer and we need to call
  61. * ibm,update-properties again to get the rest of the value.
  62. *
  63. * A negative value is also the two's compliment of the actual value.
  64. */
  65. if (vd & 0x80000000) {
  66. vd = ~vd + 1;
  67. more = 1;
  68. }
  69. if (new_prop) {
  70. /* partial property fixup */
  71. char *new_data = kzalloc(new_prop->length + vd, GFP_KERNEL);
  72. if (!new_data)
  73. return -ENOMEM;
  74. memcpy(new_data, new_prop->value, new_prop->length);
  75. memcpy(new_data + new_prop->length, value, vd);
  76. kfree(new_prop->value);
  77. new_prop->value = new_data;
  78. new_prop->length += vd;
  79. } else {
  80. new_prop = kzalloc(sizeof(*new_prop), GFP_KERNEL);
  81. if (!new_prop)
  82. return -ENOMEM;
  83. new_prop->name = kstrdup(name, GFP_KERNEL);
  84. if (!new_prop->name) {
  85. kfree(new_prop);
  86. return -ENOMEM;
  87. }
  88. new_prop->length = vd;
  89. new_prop->value = kzalloc(new_prop->length, GFP_KERNEL);
  90. if (!new_prop->value) {
  91. kfree(new_prop->name);
  92. kfree(new_prop);
  93. return -ENOMEM;
  94. }
  95. memcpy(new_prop->value, value, vd);
  96. *prop = new_prop;
  97. }
  98. if (!more) {
  99. of_update_property(dn, new_prop);
  100. *prop = NULL;
  101. }
  102. return 0;
  103. }
  104. static int update_dt_node(u32 phandle, s32 scope)
  105. {
  106. struct update_props_workarea *upwa;
  107. struct device_node *dn;
  108. struct property *prop = NULL;
  109. int i, rc, rtas_rc;
  110. char *prop_data;
  111. char *rtas_buf;
  112. int update_properties_token;
  113. u32 vd;
  114. update_properties_token = rtas_token("ibm,update-properties");
  115. if (update_properties_token == RTAS_UNKNOWN_SERVICE)
  116. return -EINVAL;
  117. rtas_buf = kzalloc(RTAS_DATA_BUF_SIZE, GFP_KERNEL);
  118. if (!rtas_buf)
  119. return -ENOMEM;
  120. dn = of_find_node_by_phandle(phandle);
  121. if (!dn) {
  122. kfree(rtas_buf);
  123. return -ENOENT;
  124. }
  125. upwa = (struct update_props_workarea *)&rtas_buf[0];
  126. upwa->phandle = phandle;
  127. do {
  128. rtas_rc = mobility_rtas_call(update_properties_token, rtas_buf,
  129. scope);
  130. if (rtas_rc < 0)
  131. break;
  132. prop_data = rtas_buf + sizeof(*upwa);
  133. /* On the first call to ibm,update-properties for a node the
  134. * the first property value descriptor contains an empty
  135. * property name, the property value length encoded as u32,
  136. * and the property value is the node path being updated.
  137. */
  138. if (*prop_data == 0) {
  139. prop_data++;
  140. vd = *(u32 *)prop_data;
  141. prop_data += vd + sizeof(vd);
  142. upwa->nprops--;
  143. }
  144. for (i = 0; i < upwa->nprops; i++) {
  145. char *prop_name;
  146. prop_name = prop_data;
  147. prop_data += strlen(prop_name) + 1;
  148. vd = *(u32 *)prop_data;
  149. prop_data += sizeof(vd);
  150. switch (vd) {
  151. case 0x00000000:
  152. /* name only property, nothing to do */
  153. break;
  154. case 0x80000000:
  155. prop = of_find_property(dn, prop_name, NULL);
  156. of_remove_property(dn, prop);
  157. prop = NULL;
  158. break;
  159. default:
  160. rc = update_dt_property(dn, &prop, prop_name,
  161. vd, prop_data);
  162. if (rc) {
  163. printk(KERN_ERR "Could not update %s"
  164. " property\n", prop_name);
  165. }
  166. prop_data += vd;
  167. }
  168. }
  169. } while (rtas_rc == 1);
  170. of_node_put(dn);
  171. kfree(rtas_buf);
  172. return 0;
  173. }
  174. static int add_dt_node(u32 parent_phandle, u32 drc_index)
  175. {
  176. struct device_node *dn;
  177. struct device_node *parent_dn;
  178. int rc;
  179. parent_dn = of_find_node_by_phandle(parent_phandle);
  180. if (!parent_dn)
  181. return -ENOENT;
  182. dn = dlpar_configure_connector(drc_index, parent_dn);
  183. if (!dn)
  184. return -ENOENT;
  185. rc = dlpar_attach_node(dn);
  186. if (rc)
  187. dlpar_free_cc_nodes(dn);
  188. of_node_put(parent_dn);
  189. return rc;
  190. }
  191. int pseries_devicetree_update(s32 scope)
  192. {
  193. char *rtas_buf;
  194. u32 *data;
  195. int update_nodes_token;
  196. int rc;
  197. update_nodes_token = rtas_token("ibm,update-nodes");
  198. if (update_nodes_token == RTAS_UNKNOWN_SERVICE)
  199. return -EINVAL;
  200. rtas_buf = kzalloc(RTAS_DATA_BUF_SIZE, GFP_KERNEL);
  201. if (!rtas_buf)
  202. return -ENOMEM;
  203. do {
  204. rc = mobility_rtas_call(update_nodes_token, rtas_buf, scope);
  205. if (rc && rc != 1)
  206. break;
  207. data = (u32 *)rtas_buf + 4;
  208. while (*data & NODE_ACTION_MASK) {
  209. int i;
  210. u32 action = *data & NODE_ACTION_MASK;
  211. int node_count = *data & NODE_COUNT_MASK;
  212. data++;
  213. for (i = 0; i < node_count; i++) {
  214. u32 phandle = *data++;
  215. u32 drc_index;
  216. switch (action) {
  217. case DELETE_DT_NODE:
  218. delete_dt_node(phandle);
  219. break;
  220. case UPDATE_DT_NODE:
  221. update_dt_node(phandle, scope);
  222. break;
  223. case ADD_DT_NODE:
  224. drc_index = *data++;
  225. add_dt_node(phandle, drc_index);
  226. break;
  227. }
  228. }
  229. }
  230. } while (rc == 1);
  231. kfree(rtas_buf);
  232. return rc;
  233. }
  234. void post_mobility_fixup(void)
  235. {
  236. int rc;
  237. int activate_fw_token;
  238. activate_fw_token = rtas_token("ibm,activate-firmware");
  239. if (activate_fw_token == RTAS_UNKNOWN_SERVICE) {
  240. printk(KERN_ERR "Could not make post-mobility "
  241. "activate-fw call.\n");
  242. return;
  243. }
  244. do {
  245. rc = rtas_call(activate_fw_token, 0, 1, NULL);
  246. } while (rtas_busy_delay(rc));
  247. if (rc)
  248. printk(KERN_ERR "Post-mobility activate-fw failed: %d\n", rc);
  249. rc = pseries_devicetree_update(MIGRATION_SCOPE);
  250. if (rc)
  251. printk(KERN_ERR "Post-mobility device tree update "
  252. "failed: %d\n", rc);
  253. return;
  254. }
  255. static ssize_t migrate_store(struct class *class, struct class_attribute *attr,
  256. const char *buf, size_t count)
  257. {
  258. struct rtas_args args;
  259. u64 streamid;
  260. int rc;
  261. rc = strict_strtoull(buf, 0, &streamid);
  262. if (rc)
  263. return rc;
  264. memset(&args, 0, sizeof(args));
  265. args.token = rtas_token("ibm,suspend-me");
  266. args.nargs = 2;
  267. args.nret = 1;
  268. args.args[0] = streamid >> 32 ;
  269. args.args[1] = streamid & 0xffffffff;
  270. args.rets = &args.args[args.nargs];
  271. do {
  272. args.rets[0] = 0;
  273. rc = rtas_ibm_suspend_me(&args);
  274. if (!rc && args.rets[0] == RTAS_NOT_SUSPENDABLE)
  275. ssleep(1);
  276. } while (!rc && args.rets[0] == RTAS_NOT_SUSPENDABLE);
  277. if (rc)
  278. return rc;
  279. else if (args.rets[0])
  280. return args.rets[0];
  281. post_mobility_fixup();
  282. return count;
  283. }
  284. static CLASS_ATTR(migration, S_IWUSR, NULL, migrate_store);
  285. static int __init mobility_sysfs_init(void)
  286. {
  287. int rc;
  288. mobility_kobj = kobject_create_and_add("mobility", kernel_kobj);
  289. if (!mobility_kobj)
  290. return -ENOMEM;
  291. rc = sysfs_create_file(mobility_kobj, &class_attr_migration.attr);
  292. return rc;
  293. }
  294. device_initcall(mobility_sysfs_init);