c2_alloc.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Open Grid Computing, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/errno.h>
  34. #include <linux/bitmap.h>
  35. #include "c2.h"
  36. static int c2_alloc_mqsp_chunk(struct c2_dev *c2dev, gfp_t gfp_mask,
  37. struct sp_chunk **head)
  38. {
  39. int i;
  40. struct sp_chunk *new_head;
  41. dma_addr_t dma_addr;
  42. new_head = dma_alloc_coherent(&c2dev->pcidev->dev, PAGE_SIZE,
  43. &dma_addr, gfp_mask);
  44. if (new_head == NULL)
  45. return -ENOMEM;
  46. new_head->dma_addr = dma_addr;
  47. dma_unmap_addr_set(new_head, mapping, new_head->dma_addr);
  48. new_head->next = NULL;
  49. new_head->head = 0;
  50. /* build list where each index is the next free slot */
  51. for (i = 0;
  52. i < (PAGE_SIZE - sizeof(struct sp_chunk) -
  53. sizeof(u16)) / sizeof(u16) - 1;
  54. i++) {
  55. new_head->shared_ptr[i] = i + 1;
  56. }
  57. /* terminate list */
  58. new_head->shared_ptr[i] = 0xFFFF;
  59. *head = new_head;
  60. return 0;
  61. }
  62. int c2_init_mqsp_pool(struct c2_dev *c2dev, gfp_t gfp_mask,
  63. struct sp_chunk **root)
  64. {
  65. return c2_alloc_mqsp_chunk(c2dev, gfp_mask, root);
  66. }
  67. void c2_free_mqsp_pool(struct c2_dev *c2dev, struct sp_chunk *root)
  68. {
  69. struct sp_chunk *next;
  70. while (root) {
  71. next = root->next;
  72. dma_free_coherent(&c2dev->pcidev->dev, PAGE_SIZE, root,
  73. dma_unmap_addr(root, mapping));
  74. root = next;
  75. }
  76. }
  77. __be16 *c2_alloc_mqsp(struct c2_dev *c2dev, struct sp_chunk *head,
  78. dma_addr_t *dma_addr, gfp_t gfp_mask)
  79. {
  80. u16 mqsp;
  81. while (head) {
  82. mqsp = head->head;
  83. if (mqsp != 0xFFFF) {
  84. head->head = head->shared_ptr[mqsp];
  85. break;
  86. } else if (head->next == NULL) {
  87. if (c2_alloc_mqsp_chunk(c2dev, gfp_mask, &head->next) ==
  88. 0) {
  89. head = head->next;
  90. mqsp = head->head;
  91. head->head = head->shared_ptr[mqsp];
  92. break;
  93. } else
  94. return NULL;
  95. } else
  96. head = head->next;
  97. }
  98. if (head) {
  99. *dma_addr = head->dma_addr +
  100. ((unsigned long) &(head->shared_ptr[mqsp]) -
  101. (unsigned long) head);
  102. pr_debug("%s addr %p dma_addr %llx\n", __func__,
  103. &(head->shared_ptr[mqsp]), (unsigned long long) *dma_addr);
  104. return (__force __be16 *) &(head->shared_ptr[mqsp]);
  105. }
  106. return NULL;
  107. }
  108. void c2_free_mqsp(__be16 *mqsp)
  109. {
  110. struct sp_chunk *head;
  111. u16 idx;
  112. /* The chunk containing this ptr begins at the page boundary */
  113. head = (struct sp_chunk *) ((unsigned long) mqsp & PAGE_MASK);
  114. /* Link head to new mqsp */
  115. *mqsp = (__force __be16) head->head;
  116. /* Compute the shared_ptr index */
  117. idx = ((unsigned long) mqsp & ~PAGE_MASK) >> 1;
  118. idx -= (unsigned long) &(((struct sp_chunk *) 0)->shared_ptr[0]) >> 1;
  119. /* Point this index at the head */
  120. head->shared_ptr[idx] = head->head;
  121. /* Point head at this index */
  122. head->head = idx;
  123. }