base.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. /*
  2. * Copyright 2012 Red Hat Inc.
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  17. * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
  18. * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
  19. * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
  20. * OTHER DEALINGS IN THE SOFTWARE.
  21. *
  22. * Authors: Ben Skeggs
  23. */
  24. #include "priv.h"
  25. #include <core/client.h>
  26. #include <engine/fifo.h>
  27. #include <nvif/class.h>
  28. struct nvkm_dmaobj *
  29. nvkm_dma_search(struct nvkm_dma *dma, struct nvkm_client *client, u64 object)
  30. {
  31. struct rb_node *node = client->dmaroot.rb_node;
  32. while (node) {
  33. struct nvkm_dmaobj *dmaobj =
  34. container_of(node, typeof(*dmaobj), rb);
  35. if (object < dmaobj->handle)
  36. node = node->rb_left;
  37. else
  38. if (object > dmaobj->handle)
  39. node = node->rb_right;
  40. else
  41. return dmaobj;
  42. }
  43. return NULL;
  44. }
  45. static int
  46. nvkm_dma_oclass_new(struct nvkm_device *device,
  47. const struct nvkm_oclass *oclass, void *data, u32 size,
  48. struct nvkm_object **pobject)
  49. {
  50. struct nvkm_dma *dma = nvkm_dma(oclass->engine);
  51. struct nvkm_dmaobj *dmaobj = NULL;
  52. struct nvkm_client *client = oclass->client;
  53. struct rb_node **ptr = &client->dmaroot.rb_node;
  54. struct rb_node *parent = NULL;
  55. int ret;
  56. ret = dma->func->class_new(dma, oclass, data, size, &dmaobj);
  57. if (dmaobj)
  58. *pobject = &dmaobj->object;
  59. if (ret)
  60. return ret;
  61. dmaobj->handle = oclass->object;
  62. while (*ptr) {
  63. struct nvkm_dmaobj *obj = container_of(*ptr, typeof(*obj), rb);
  64. parent = *ptr;
  65. if (dmaobj->handle < obj->handle)
  66. ptr = &parent->rb_left;
  67. else
  68. if (dmaobj->handle > obj->handle)
  69. ptr = &parent->rb_right;
  70. else
  71. return -EEXIST;
  72. }
  73. rb_link_node(&dmaobj->rb, parent, ptr);
  74. rb_insert_color(&dmaobj->rb, &client->dmaroot);
  75. return 0;
  76. }
  77. static const struct nvkm_device_oclass
  78. nvkm_dma_oclass_base = {
  79. .ctor = nvkm_dma_oclass_new,
  80. };
  81. static int
  82. nvkm_dma_oclass_fifo_new(const struct nvkm_oclass *oclass, void *data, u32 size,
  83. struct nvkm_object **pobject)
  84. {
  85. return nvkm_dma_oclass_new(oclass->engine->subdev.device,
  86. oclass, data, size, pobject);
  87. }
  88. static const struct nvkm_sclass
  89. nvkm_dma_sclass[] = {
  90. { 0, 0, NV_DMA_FROM_MEMORY, NULL, nvkm_dma_oclass_fifo_new },
  91. { 0, 0, NV_DMA_TO_MEMORY, NULL, nvkm_dma_oclass_fifo_new },
  92. { 0, 0, NV_DMA_IN_MEMORY, NULL, nvkm_dma_oclass_fifo_new },
  93. };
  94. static int
  95. nvkm_dma_oclass_base_get(struct nvkm_oclass *sclass, int index,
  96. const struct nvkm_device_oclass **class)
  97. {
  98. const int count = ARRAY_SIZE(nvkm_dma_sclass);
  99. if (index < count) {
  100. const struct nvkm_sclass *oclass = &nvkm_dma_sclass[index];
  101. sclass->base = oclass[0];
  102. sclass->engn = oclass;
  103. *class = &nvkm_dma_oclass_base;
  104. return index;
  105. }
  106. return count;
  107. }
  108. static int
  109. nvkm_dma_oclass_fifo_get(struct nvkm_oclass *oclass, int index)
  110. {
  111. const int count = ARRAY_SIZE(nvkm_dma_sclass);
  112. if (index < count) {
  113. oclass->base = nvkm_dma_sclass[index];
  114. return index;
  115. }
  116. return count;
  117. }
  118. static void *
  119. nvkm_dma_dtor(struct nvkm_engine *engine)
  120. {
  121. return nvkm_dma(engine);
  122. }
  123. static const struct nvkm_engine_func
  124. nvkm_dma = {
  125. .dtor = nvkm_dma_dtor,
  126. .base.sclass = nvkm_dma_oclass_base_get,
  127. .fifo.sclass = nvkm_dma_oclass_fifo_get,
  128. };
  129. int
  130. nvkm_dma_new_(const struct nvkm_dma_func *func, struct nvkm_device *device,
  131. int index, struct nvkm_dma **pdma)
  132. {
  133. struct nvkm_dma *dma;
  134. if (!(dma = *pdma = kzalloc(sizeof(*dma), GFP_KERNEL)))
  135. return -ENOMEM;
  136. dma->func = func;
  137. return nvkm_engine_ctor(&nvkm_dma, device, index,
  138. 0, true, &dma->engine);
  139. }