2
0

qemu-co-shared-resource.c 2.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
  1. /*
  2. * Helper functionality for distributing a fixed total amount of
  3. * an abstract resource among multiple coroutines.
  4. *
  5. * Copyright (c) 2019 Virtuozzo International GmbH
  6. *
  7. * Permission is hereby granted, free of charge, to any person obtaining a copy
  8. * of this software and associated documentation files (the "Software"), to deal
  9. * in the Software without restriction, including without limitation the rights
  10. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  11. * copies of the Software, and to permit persons to whom the Software is
  12. * furnished to do so, subject to the following conditions:
  13. *
  14. * The above copyright notice and this permission notice shall be included in
  15. * all copies or substantial portions of the Software.
  16. *
  17. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  18. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  20. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  21. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  22. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  23. * THE SOFTWARE.
  24. */
  25. #include "qemu/osdep.h"
  26. #include "qemu/coroutine.h"
  27. #include "qemu/co-shared-resource.h"
  28. struct SharedResource {
  29. uint64_t total;
  30. uint64_t available;
  31. CoQueue queue;
  32. };
  33. SharedResource *shres_create(uint64_t total)
  34. {
  35. SharedResource *s = g_new0(SharedResource, 1);
  36. s->total = s->available = total;
  37. qemu_co_queue_init(&s->queue);
  38. return s;
  39. }
  40. void shres_destroy(SharedResource *s)
  41. {
  42. assert(s->available == s->total);
  43. g_free(s);
  44. }
  45. bool co_try_get_from_shres(SharedResource *s, uint64_t n)
  46. {
  47. if (s->available >= n) {
  48. s->available -= n;
  49. return true;
  50. }
  51. return false;
  52. }
  53. void coroutine_fn co_get_from_shres(SharedResource *s, uint64_t n)
  54. {
  55. assert(n <= s->total);
  56. while (!co_try_get_from_shres(s, n)) {
  57. qemu_co_queue_wait(&s->queue, NULL);
  58. }
  59. }
  60. void coroutine_fn co_put_to_shres(SharedResource *s, uint64_t n)
  61. {
  62. assert(s->total - s->available >= n);
  63. s->available += n;
  64. qemu_co_queue_restart_all(&s->queue);
  65. }