1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*
* caps.c -- Entity Capabilities Cache for mcabber
*
* Copyright (C) 2008-2010 Frank Zschockelt <mcabber@freakysoft.de>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*/
#include <glib.h>
typedef struct {
char *category;
char *name;
char *type;
GHashTable *features;
} caps;
static GHashTable *caps_cache = NULL;
void caps_destroy(gpointer data)
{
caps *c = data;
g_free(c->category);
g_free(c->name);
g_free(c->type);
g_hash_table_destroy(c->features);
g_free(c);
}
void caps_init(void)
{
if (!caps_cache)
caps_cache = g_hash_table_new_full(g_str_hash, g_str_equal,
g_free, caps_destroy);
}
void caps_free(void)
{
if (caps_cache) {
g_hash_table_destroy(caps_cache);
caps_cache = NULL;
}
}
void caps_add(char *hash)
{
if (!hash)
return;
caps *c = g_new0(caps, 1);
c->features = g_hash_table_new_full(g_str_hash, g_str_equal, g_free, NULL);
g_hash_table_insert(caps_cache, g_strdup(hash), c);
}
int caps_has_hash(const char *hash)
{
return (hash != NULL && (g_hash_table_lookup(caps_cache, hash) != NULL));
}
void caps_set_identity(char *hash,
const char *category,
const char *name,
const char *type)
{
caps *c;
if (!hash || !category || !type)
return;
c = g_hash_table_lookup(caps_cache, hash);
if (c) {
c->category = g_strdup(category);
c->name = g_strdup(name);
c->type = g_strdup(type);
}
}
void caps_add_feature(char *hash, const char *feature)
{
caps *c;
if (!hash || !feature)
return;
c = g_hash_table_lookup(caps_cache, hash);
if (c) {
char *f = g_strdup(feature);
g_hash_table_replace(c->features, f, f);
}
}
int caps_has_feature(char *hash, char *feature)
{
caps *c;
if (!hash || !feature)
return 0;
c = g_hash_table_lookup(caps_cache, hash);
if (c)
return (g_hash_table_lookup(c->features, feature) != NULL);
return 0;
}
static GFunc _foreach_function;
void _caps_foreach_helper(gpointer key, gpointer value, gpointer user_data)
{
// GFunc func = (GFunc)user_data;
_foreach_function(value, user_data);
}
void caps_foreach_feature(const char *hash, GFunc func, gpointer user_data)
{
caps *c;
if (!hash)
return;
c = g_hash_table_lookup(caps_cache, hash);
if (!c)
return;
_foreach_function = func;
g_hash_table_foreach(c->features, _caps_foreach_helper, user_data);
}
gint _strcmp_sort(gconstpointer a, gconstpointer b)
{
return g_strcmp0(a, b);
}
// Generates the sha1 hash for the special capability "" and returns it
const char *caps_generate(void)
{
char *identity;
GList *features;
GChecksum *sha1;
guint8 digest[20];
gsize digest_size = 20;
gchar *hash, *old_hash = NULL;
caps *old_caps;
caps *c = g_hash_table_lookup(caps_cache, "");
g_hash_table_steal(caps_cache, "");
sha1 = g_checksum_new(G_CHECKSUM_SHA1);
identity = g_strdup_printf("%s/%s//%s<", c->category, c->type,
c->name ? c->name : "");
g_checksum_update(sha1, (guchar*)identity, -1);
g_free(identity);
features = g_hash_table_get_values(c->features);
features = g_list_sort(features, _strcmp_sort);
{
GList *feature;
for (feature=features; feature; feature=feature->next) {
g_checksum_update(sha1, feature->data, -1);
g_checksum_update(sha1, (guchar *)"<", -1);
}
}
g_list_free(features);
g_checksum_get_digest(sha1, digest, &digest_size);
hash = g_base64_encode(digest, digest_size);
g_checksum_free(sha1);
g_hash_table_lookup_extended(caps_cache, hash,
(gpointer *)&old_hash, (gpointer *)&old_caps);
g_hash_table_insert(caps_cache, hash, c);
if (old_hash)
return old_hash;
else
return hash;
}
/* vim: set expandtab cindent cinoptions=>2\:2(0 sw=2 ts=2: For Vim users... */
|