Statistics
| Branch: | Revision:

root / ui / vnc-palette.c @ e31e3694

History | View | Annotate | Download (3.5 kB)

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

    
29
#include "vnc-palette.h"
30

    
31
static VncPaletteEntry *palette_find(const VncPalette *palette,
32
                                     uint32_t color, unsigned int hash)
33
{
34
    VncPaletteEntry *entry;
35

    
36
    QLIST_FOREACH(entry, &palette->table[hash], next) {
37
        if (entry->color == color) {
38
            return entry;
39
        }
40
    }
41

    
42
    return NULL;
43
}
44

    
45
static unsigned int palette_hash(uint32_t rgb, int bpp)
46
{
47
    if (bpp == 16) {
48
        return ((unsigned int)(((rgb >> 8) + rgb) & 0xFF));
49
    } else {
50
        return ((unsigned int)(((rgb >> 16) + (rgb >> 8)) & 0xFF));
51
    }
52
}
53

    
54
VncPalette *palette_new(size_t max, int bpp)
55
{
56
    VncPalette *palette;
57

    
58
    palette = qemu_mallocz(sizeof(*palette));
59
    palette->max = max;
60
    palette->bpp = bpp;
61
    return palette;
62
}
63

    
64
void palette_destroy(VncPalette *palette)
65
{
66
    if (palette == NULL) {
67
        qemu_free(palette);
68
    }
69
}
70

    
71
int palette_put(VncPalette *palette, uint32_t color)
72
{
73
    unsigned int hash;
74
    unsigned int idx = palette->size;
75
    VncPaletteEntry *entry;
76

    
77
    hash = palette_hash(color, palette->bpp) % VNC_PALETTE_HASH_SIZE;
78
    entry = palette_find(palette, color, hash);
79

    
80
    if (!entry && palette->size >= palette->max) {
81
        return 0;
82
    }
83
    if (!entry) {
84
        VncPaletteEntry *entry;
85

    
86
        entry = &palette->pool[palette->size];
87
        entry->color = color;
88
        entry->idx = idx;
89
        QLIST_INSERT_HEAD(&palette->table[hash], entry, next);
90
        palette->size++;
91
    }
92
    return palette->size;
93
}
94

    
95
int palette_idx(const VncPalette *palette, uint32_t color)
96
{
97
    VncPaletteEntry *entry;
98
    unsigned int hash;
99

    
100
    hash = palette_hash(color, palette->bpp) % VNC_PALETTE_HASH_SIZE;
101
    entry = palette_find(palette, color, hash);
102
    return (entry == NULL ? -1 : entry->idx);
103
}
104

    
105
size_t palette_size(const VncPalette *palette)
106
{
107
    return palette->size;
108
}
109

    
110
void palette_iter(const VncPalette *palette,
111
                  void (*iter)(int idx, uint32_t color, void *opaque),
112
                  void *opaque)
113
{
114
    int i;
115
    VncPaletteEntry *entry;
116

    
117
    for (i = 0; i < VNC_PALETTE_HASH_SIZE; i++) {
118
        QLIST_FOREACH(entry, &palette->table[i], next) {
119
            iter(entry->idx, entry->color, opaque);
120
        }
121
    }
122
}