kcs_bmc.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (c) 2015-2018, Intel Corporation.
  4. */
  5. #define pr_fmt(fmt) "kcs-bmc: " fmt
  6. #include <linux/errno.h>
  7. #include <linux/io.h>
  8. #include <linux/ipmi_bmc.h>
  9. #include <linux/module.h>
  10. #include <linux/platform_device.h>
  11. #include <linux/poll.h>
  12. #include <linux/sched.h>
  13. #include <linux/slab.h>
  14. #include "kcs_bmc.h"
  15. #define KCS_MSG_BUFSIZ 1000
  16. #define KCS_ZERO_DATA 0
  17. /* IPMI 2.0 - Table 9-1, KCS Interface Status Register Bits */
  18. #define KCS_STATUS_STATE(state) (state << 6)
  19. #define KCS_STATUS_STATE_MASK GENMASK(7, 6)
  20. #define KCS_STATUS_CMD_DAT BIT(3)
  21. #define KCS_STATUS_SMS_ATN BIT(2)
  22. #define KCS_STATUS_IBF BIT(1)
  23. #define KCS_STATUS_OBF BIT(0)
  24. /* IPMI 2.0 - Table 9-2, KCS Interface State Bits */
  25. enum kcs_states {
  26. IDLE_STATE = 0,
  27. READ_STATE = 1,
  28. WRITE_STATE = 2,
  29. ERROR_STATE = 3,
  30. };
  31. /* IPMI 2.0 - Table 9-3, KCS Interface Control Codes */
  32. #define KCS_CMD_GET_STATUS_ABORT 0x60
  33. #define KCS_CMD_WRITE_START 0x61
  34. #define KCS_CMD_WRITE_END 0x62
  35. #define KCS_CMD_READ_BYTE 0x68
  36. static inline u8 read_data(struct kcs_bmc *kcs_bmc)
  37. {
  38. return kcs_bmc->io_inputb(kcs_bmc, kcs_bmc->ioreg.idr);
  39. }
  40. static inline void write_data(struct kcs_bmc *kcs_bmc, u8 data)
  41. {
  42. kcs_bmc->io_outputb(kcs_bmc, kcs_bmc->ioreg.odr, data);
  43. }
  44. static inline u8 read_status(struct kcs_bmc *kcs_bmc)
  45. {
  46. return kcs_bmc->io_inputb(kcs_bmc, kcs_bmc->ioreg.str);
  47. }
  48. static inline void write_status(struct kcs_bmc *kcs_bmc, u8 data)
  49. {
  50. kcs_bmc->io_outputb(kcs_bmc, kcs_bmc->ioreg.str, data);
  51. }
  52. static void update_status_bits(struct kcs_bmc *kcs_bmc, u8 mask, u8 val)
  53. {
  54. u8 tmp = read_status(kcs_bmc);
  55. tmp &= ~mask;
  56. tmp |= val & mask;
  57. write_status(kcs_bmc, tmp);
  58. }
  59. static inline void set_state(struct kcs_bmc *kcs_bmc, u8 state)
  60. {
  61. update_status_bits(kcs_bmc, KCS_STATUS_STATE_MASK,
  62. KCS_STATUS_STATE(state));
  63. }
  64. static void kcs_force_abort(struct kcs_bmc *kcs_bmc)
  65. {
  66. set_state(kcs_bmc, ERROR_STATE);
  67. read_data(kcs_bmc);
  68. write_data(kcs_bmc, KCS_ZERO_DATA);
  69. kcs_bmc->phase = KCS_PHASE_ERROR;
  70. kcs_bmc->data_in_avail = false;
  71. kcs_bmc->data_in_idx = 0;
  72. }
  73. static void kcs_bmc_handle_data(struct kcs_bmc *kcs_bmc)
  74. {
  75. u8 data;
  76. switch (kcs_bmc->phase) {
  77. case KCS_PHASE_WRITE_START:
  78. kcs_bmc->phase = KCS_PHASE_WRITE_DATA;
  79. /* fall through */
  80. case KCS_PHASE_WRITE_DATA:
  81. if (kcs_bmc->data_in_idx < KCS_MSG_BUFSIZ) {
  82. set_state(kcs_bmc, WRITE_STATE);
  83. write_data(kcs_bmc, KCS_ZERO_DATA);
  84. kcs_bmc->data_in[kcs_bmc->data_in_idx++] =
  85. read_data(kcs_bmc);
  86. } else {
  87. kcs_force_abort(kcs_bmc);
  88. kcs_bmc->error = KCS_LENGTH_ERROR;
  89. }
  90. break;
  91. case KCS_PHASE_WRITE_END_CMD:
  92. if (kcs_bmc->data_in_idx < KCS_MSG_BUFSIZ) {
  93. set_state(kcs_bmc, READ_STATE);
  94. kcs_bmc->data_in[kcs_bmc->data_in_idx++] =
  95. read_data(kcs_bmc);
  96. kcs_bmc->phase = KCS_PHASE_WRITE_DONE;
  97. kcs_bmc->data_in_avail = true;
  98. wake_up_interruptible(&kcs_bmc->queue);
  99. } else {
  100. kcs_force_abort(kcs_bmc);
  101. kcs_bmc->error = KCS_LENGTH_ERROR;
  102. }
  103. break;
  104. case KCS_PHASE_READ:
  105. if (kcs_bmc->data_out_idx == kcs_bmc->data_out_len)
  106. set_state(kcs_bmc, IDLE_STATE);
  107. data = read_data(kcs_bmc);
  108. if (data != KCS_CMD_READ_BYTE) {
  109. set_state(kcs_bmc, ERROR_STATE);
  110. write_data(kcs_bmc, KCS_ZERO_DATA);
  111. break;
  112. }
  113. if (kcs_bmc->data_out_idx == kcs_bmc->data_out_len) {
  114. write_data(kcs_bmc, KCS_ZERO_DATA);
  115. kcs_bmc->phase = KCS_PHASE_IDLE;
  116. break;
  117. }
  118. write_data(kcs_bmc,
  119. kcs_bmc->data_out[kcs_bmc->data_out_idx++]);
  120. break;
  121. case KCS_PHASE_ABORT_ERROR1:
  122. set_state(kcs_bmc, READ_STATE);
  123. read_data(kcs_bmc);
  124. write_data(kcs_bmc, kcs_bmc->error);
  125. kcs_bmc->phase = KCS_PHASE_ABORT_ERROR2;
  126. break;
  127. case KCS_PHASE_ABORT_ERROR2:
  128. set_state(kcs_bmc, IDLE_STATE);
  129. read_data(kcs_bmc);
  130. write_data(kcs_bmc, KCS_ZERO_DATA);
  131. kcs_bmc->phase = KCS_PHASE_IDLE;
  132. break;
  133. default:
  134. kcs_force_abort(kcs_bmc);
  135. break;
  136. }
  137. }
  138. static void kcs_bmc_handle_cmd(struct kcs_bmc *kcs_bmc)
  139. {
  140. u8 cmd;
  141. set_state(kcs_bmc, WRITE_STATE);
  142. write_data(kcs_bmc, KCS_ZERO_DATA);
  143. cmd = read_data(kcs_bmc);
  144. switch (cmd) {
  145. case KCS_CMD_WRITE_START:
  146. kcs_bmc->phase = KCS_PHASE_WRITE_START;
  147. kcs_bmc->error = KCS_NO_ERROR;
  148. kcs_bmc->data_in_avail = false;
  149. kcs_bmc->data_in_idx = 0;
  150. break;
  151. case KCS_CMD_WRITE_END:
  152. if (kcs_bmc->phase != KCS_PHASE_WRITE_DATA) {
  153. kcs_force_abort(kcs_bmc);
  154. break;
  155. }
  156. kcs_bmc->phase = KCS_PHASE_WRITE_END_CMD;
  157. break;
  158. case KCS_CMD_GET_STATUS_ABORT:
  159. if (kcs_bmc->error == KCS_NO_ERROR)
  160. kcs_bmc->error = KCS_ABORTED_BY_COMMAND;
  161. kcs_bmc->phase = KCS_PHASE_ABORT_ERROR1;
  162. kcs_bmc->data_in_avail = false;
  163. kcs_bmc->data_in_idx = 0;
  164. break;
  165. default:
  166. kcs_force_abort(kcs_bmc);
  167. kcs_bmc->error = KCS_ILLEGAL_CONTROL_CODE;
  168. break;
  169. }
  170. }
  171. int kcs_bmc_handle_event(struct kcs_bmc *kcs_bmc)
  172. {
  173. unsigned long flags;
  174. int ret = 0;
  175. u8 status;
  176. spin_lock_irqsave(&kcs_bmc->lock, flags);
  177. if (!kcs_bmc->running) {
  178. kcs_force_abort(kcs_bmc);
  179. ret = -ENODEV;
  180. goto out_unlock;
  181. }
  182. status = read_status(kcs_bmc) & (KCS_STATUS_IBF | KCS_STATUS_CMD_DAT);
  183. switch (status) {
  184. case KCS_STATUS_IBF | KCS_STATUS_CMD_DAT:
  185. kcs_bmc_handle_cmd(kcs_bmc);
  186. break;
  187. case KCS_STATUS_IBF:
  188. kcs_bmc_handle_data(kcs_bmc);
  189. break;
  190. default:
  191. ret = -ENODATA;
  192. break;
  193. }
  194. out_unlock:
  195. spin_unlock_irqrestore(&kcs_bmc->lock, flags);
  196. return ret;
  197. }
  198. EXPORT_SYMBOL(kcs_bmc_handle_event);
  199. static inline struct kcs_bmc *to_kcs_bmc(struct file *filp)
  200. {
  201. return container_of(filp->private_data, struct kcs_bmc, miscdev);
  202. }
  203. static int kcs_bmc_open(struct inode *inode, struct file *filp)
  204. {
  205. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  206. int ret = 0;
  207. spin_lock_irq(&kcs_bmc->lock);
  208. if (!kcs_bmc->running)
  209. kcs_bmc->running = 1;
  210. else
  211. ret = -EBUSY;
  212. spin_unlock_irq(&kcs_bmc->lock);
  213. return ret;
  214. }
  215. static __poll_t kcs_bmc_poll(struct file *filp, poll_table *wait)
  216. {
  217. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  218. __poll_t mask = 0;
  219. poll_wait(filp, &kcs_bmc->queue, wait);
  220. spin_lock_irq(&kcs_bmc->lock);
  221. if (kcs_bmc->data_in_avail)
  222. mask |= EPOLLIN;
  223. spin_unlock_irq(&kcs_bmc->lock);
  224. return mask;
  225. }
  226. static ssize_t kcs_bmc_read(struct file *filp, char __user *buf,
  227. size_t count, loff_t *ppos)
  228. {
  229. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  230. bool data_avail;
  231. size_t data_len;
  232. ssize_t ret;
  233. if (!(filp->f_flags & O_NONBLOCK))
  234. wait_event_interruptible(kcs_bmc->queue,
  235. kcs_bmc->data_in_avail);
  236. mutex_lock(&kcs_bmc->mutex);
  237. spin_lock_irq(&kcs_bmc->lock);
  238. data_avail = kcs_bmc->data_in_avail;
  239. if (data_avail) {
  240. data_len = kcs_bmc->data_in_idx;
  241. memcpy(kcs_bmc->kbuffer, kcs_bmc->data_in, data_len);
  242. }
  243. spin_unlock_irq(&kcs_bmc->lock);
  244. if (!data_avail) {
  245. ret = -EAGAIN;
  246. goto out_unlock;
  247. }
  248. if (count < data_len) {
  249. pr_err("channel=%u with too large data : %zu\n",
  250. kcs_bmc->channel, data_len);
  251. spin_lock_irq(&kcs_bmc->lock);
  252. kcs_force_abort(kcs_bmc);
  253. spin_unlock_irq(&kcs_bmc->lock);
  254. ret = -EOVERFLOW;
  255. goto out_unlock;
  256. }
  257. if (copy_to_user(buf, kcs_bmc->kbuffer, data_len)) {
  258. ret = -EFAULT;
  259. goto out_unlock;
  260. }
  261. ret = data_len;
  262. spin_lock_irq(&kcs_bmc->lock);
  263. if (kcs_bmc->phase == KCS_PHASE_WRITE_DONE) {
  264. kcs_bmc->phase = KCS_PHASE_WAIT_READ;
  265. kcs_bmc->data_in_avail = false;
  266. kcs_bmc->data_in_idx = 0;
  267. } else {
  268. ret = -EAGAIN;
  269. }
  270. spin_unlock_irq(&kcs_bmc->lock);
  271. out_unlock:
  272. mutex_unlock(&kcs_bmc->mutex);
  273. return ret;
  274. }
  275. static ssize_t kcs_bmc_write(struct file *filp, const char __user *buf,
  276. size_t count, loff_t *ppos)
  277. {
  278. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  279. ssize_t ret;
  280. /* a minimum response size '3' : netfn + cmd + ccode */
  281. if (count < 3 || count > KCS_MSG_BUFSIZ)
  282. return -EINVAL;
  283. mutex_lock(&kcs_bmc->mutex);
  284. if (copy_from_user(kcs_bmc->kbuffer, buf, count)) {
  285. ret = -EFAULT;
  286. goto out_unlock;
  287. }
  288. spin_lock_irq(&kcs_bmc->lock);
  289. if (kcs_bmc->phase == KCS_PHASE_WAIT_READ) {
  290. kcs_bmc->phase = KCS_PHASE_READ;
  291. kcs_bmc->data_out_idx = 1;
  292. kcs_bmc->data_out_len = count;
  293. memcpy(kcs_bmc->data_out, kcs_bmc->kbuffer, count);
  294. write_data(kcs_bmc, kcs_bmc->data_out[0]);
  295. ret = count;
  296. } else {
  297. ret = -EINVAL;
  298. }
  299. spin_unlock_irq(&kcs_bmc->lock);
  300. out_unlock:
  301. mutex_unlock(&kcs_bmc->mutex);
  302. return ret;
  303. }
  304. static long kcs_bmc_ioctl(struct file *filp, unsigned int cmd,
  305. unsigned long arg)
  306. {
  307. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  308. long ret = 0;
  309. spin_lock_irq(&kcs_bmc->lock);
  310. switch (cmd) {
  311. case IPMI_BMC_IOCTL_SET_SMS_ATN:
  312. update_status_bits(kcs_bmc, KCS_STATUS_SMS_ATN,
  313. KCS_STATUS_SMS_ATN);
  314. break;
  315. case IPMI_BMC_IOCTL_CLEAR_SMS_ATN:
  316. update_status_bits(kcs_bmc, KCS_STATUS_SMS_ATN,
  317. 0);
  318. break;
  319. case IPMI_BMC_IOCTL_FORCE_ABORT:
  320. kcs_force_abort(kcs_bmc);
  321. break;
  322. default:
  323. ret = -EINVAL;
  324. break;
  325. }
  326. spin_unlock_irq(&kcs_bmc->lock);
  327. return ret;
  328. }
  329. static int kcs_bmc_release(struct inode *inode, struct file *filp)
  330. {
  331. struct kcs_bmc *kcs_bmc = to_kcs_bmc(filp);
  332. spin_lock_irq(&kcs_bmc->lock);
  333. kcs_bmc->running = 0;
  334. kcs_force_abort(kcs_bmc);
  335. spin_unlock_irq(&kcs_bmc->lock);
  336. return 0;
  337. }
  338. static const struct file_operations kcs_bmc_fops = {
  339. .owner = THIS_MODULE,
  340. .open = kcs_bmc_open,
  341. .read = kcs_bmc_read,
  342. .write = kcs_bmc_write,
  343. .release = kcs_bmc_release,
  344. .poll = kcs_bmc_poll,
  345. .unlocked_ioctl = kcs_bmc_ioctl,
  346. };
  347. struct kcs_bmc *kcs_bmc_alloc(struct device *dev, int sizeof_priv, u32 channel)
  348. {
  349. struct kcs_bmc *kcs_bmc;
  350. kcs_bmc = devm_kzalloc(dev, sizeof(*kcs_bmc) + sizeof_priv, GFP_KERNEL);
  351. if (!kcs_bmc)
  352. return NULL;
  353. dev_set_name(dev, "ipmi-kcs%u", channel);
  354. spin_lock_init(&kcs_bmc->lock);
  355. kcs_bmc->channel = channel;
  356. mutex_init(&kcs_bmc->mutex);
  357. init_waitqueue_head(&kcs_bmc->queue);
  358. kcs_bmc->data_in = devm_kmalloc(dev, KCS_MSG_BUFSIZ, GFP_KERNEL);
  359. kcs_bmc->data_out = devm_kmalloc(dev, KCS_MSG_BUFSIZ, GFP_KERNEL);
  360. kcs_bmc->kbuffer = devm_kmalloc(dev, KCS_MSG_BUFSIZ, GFP_KERNEL);
  361. if (!kcs_bmc->data_in || !kcs_bmc->data_out || !kcs_bmc->kbuffer)
  362. return NULL;
  363. kcs_bmc->miscdev.minor = MISC_DYNAMIC_MINOR;
  364. kcs_bmc->miscdev.name = dev_name(dev);
  365. kcs_bmc->miscdev.fops = &kcs_bmc_fops;
  366. return kcs_bmc;
  367. }
  368. EXPORT_SYMBOL(kcs_bmc_alloc);
  369. MODULE_LICENSE("GPL v2");
  370. MODULE_AUTHOR("Haiyue Wang <haiyue.wang@linux.intel.com>");
  371. MODULE_DESCRIPTION("KCS BMC to handle the IPMI request from system software");