vnc-palette.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  1. /*
  2. * QEMU VNC display driver: palette hash table
  3. *
  4. * From libvncserver/libvncserver/tight.c
  5. * Copyright (C) 2000, 2001 Const Kaplinsky. All Rights Reserved.
  6. * Copyright (C) 1999 AT&T Laboratories Cambridge. All Rights Reserved.
  7. *
  8. * Copyright (C) 2010 Corentin Chary <corentin.chary@gmail.com>
  9. *
  10. * Permission is hereby granted, free of charge, to any person obtaining a copy
  11. * of this software and associated documentation files (the "Software"), to deal
  12. * in the Software without restriction, including without limitation the rights
  13. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  14. * copies of the Software, and to permit persons to whom the Software is
  15. * furnished to do so, subject to the following conditions:
  16. *
  17. * The above copyright notice and this permission notice shall be included in
  18. * all copies or substantial portions of the Software.
  19. *
  20. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  21. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  22. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  23. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  24. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  25. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  26. * THE SOFTWARE.
  27. */
  28. #include "qemu/osdep.h"
  29. #include "vnc-palette.h"
  30. static VncPaletteEntry *palette_find(const VncPalette *palette,
  31. uint32_t color, unsigned int hash)
  32. {
  33. VncPaletteEntry *entry;
  34. QLIST_FOREACH(entry, &palette->table[hash], next) {
  35. if (entry->color == color) {
  36. return entry;
  37. }
  38. }
  39. return NULL;
  40. }
  41. static unsigned int palette_hash(uint32_t rgb, int bpp)
  42. {
  43. if (bpp == 16) {
  44. return ((unsigned int)(((rgb >> 8) + rgb) & 0xFF));
  45. } else {
  46. return ((unsigned int)(((rgb >> 16) + (rgb >> 8)) & 0xFF));
  47. }
  48. }
  49. VncPalette *palette_new(size_t max, int bpp)
  50. {
  51. VncPalette *palette;
  52. palette = g_malloc0(sizeof(*palette));
  53. palette_init(palette, max, bpp);
  54. return palette;
  55. }
  56. void palette_init(VncPalette *palette, size_t max, int bpp)
  57. {
  58. memset(palette, 0, sizeof (*palette));
  59. palette->max = max;
  60. palette->bpp = bpp;
  61. }
  62. void palette_destroy(VncPalette *palette)
  63. {
  64. g_free(palette);
  65. }
  66. int palette_put(VncPalette *palette, uint32_t color)
  67. {
  68. unsigned int hash;
  69. unsigned int idx = palette->size;
  70. VncPaletteEntry *entry;
  71. hash = palette_hash(color, palette->bpp) % VNC_PALETTE_HASH_SIZE;
  72. entry = palette_find(palette, color, hash);
  73. if (!entry && palette->size >= palette->max) {
  74. return 0;
  75. }
  76. if (!entry) {
  77. VncPaletteEntry *entry;
  78. entry = &palette->pool[palette->size];
  79. entry->color = color;
  80. entry->idx = idx;
  81. QLIST_INSERT_HEAD(&palette->table[hash], entry, next);
  82. palette->size++;
  83. }
  84. return palette->size;
  85. }
  86. int palette_idx(const VncPalette *palette, uint32_t color)
  87. {
  88. VncPaletteEntry *entry;
  89. unsigned int hash;
  90. hash = palette_hash(color, palette->bpp) % VNC_PALETTE_HASH_SIZE;
  91. entry = palette_find(palette, color, hash);
  92. return (entry == NULL ? -1 : entry->idx);
  93. }
  94. size_t palette_size(const VncPalette *palette)
  95. {
  96. return palette->size;
  97. }
  98. void palette_iter(const VncPalette *palette,
  99. void (*iter)(int idx, uint32_t color, void *opaque),
  100. void *opaque)
  101. {
  102. int i;
  103. VncPaletteEntry *entry;
  104. for (i = 0; i < VNC_PALETTE_HASH_SIZE; i++) {
  105. QLIST_FOREACH(entry, &palette->table[i], next) {
  106. iter(entry->idx, entry->color, opaque);
  107. }
  108. }
  109. }
  110. uint32_t palette_color(const VncPalette *palette, int idx, bool *found)
  111. {
  112. int i;
  113. VncPaletteEntry *entry;
  114. for (i = 0; i < VNC_PALETTE_HASH_SIZE; i++) {
  115. QLIST_FOREACH(entry, &palette->table[i], next) {
  116. if (entry->idx == idx) {
  117. *found = true;
  118. return entry->color;
  119. }
  120. }
  121. }
  122. *found = false;
  123. return -1;
  124. }
  125. static void palette_fill_cb(int idx, uint32_t color, void *opaque)
  126. {
  127. uint32_t *colors = opaque;
  128. colors[idx] = color;
  129. }
  130. size_t palette_fill(const VncPalette *palette,
  131. uint32_t colors[VNC_PALETTE_MAX_SIZE])
  132. {
  133. palette_iter(palette, palette_fill_cb, colors);
  134. return palette_size(palette);
  135. }