ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/keyboard.C
(Generate patch)

Comparing rxvt-unicode/src/keyboard.C (file contents):
Revision 1.10 by root, Thu Feb 3 10:24:10 2005 UTC vs.
Revision 1.40 by root, Thu Mar 24 17:34:28 2011 UTC

1/*----------------------------------------------------------------------*
2 * File: keyboard.C
3 *----------------------------------------------------------------------*
4 *
5 * All portions of code are copyright by their respective author/s.
6 * Copyright (c) 2005 WU Fengguang
7 * Copyright (c) 2005-2006 Marc Lehmann <schmorp@schmorp.de>
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 *----------------------------------------------------------------------*/
23
1#include "../config.h" 24#include "../config.h"
2#include "rxvt.h" 25#include "rxvt.h"
3 26
4#ifdef KEYSYM_RESOURCE 27#ifdef KEYSYM_RESOURCE
5 28
6#include <cstring> 29#include <cstring>
7 30
31#include "rxvtperl.h"
8#include "keyboard.h" 32#include "keyboard.h"
9#include "command.h" 33#include "command.h"
10 34
11//////////////////////////////////////////////////////////////////////////////// 35/* an intro to the data structure:
12// default keycode translation map and keyevent handlers 36 *
13 37 * vector keymap[] is grouped.
14keysym_t keyboard_manager::stock_keymap[] = { 38 *
15 /* examples */ 39 * inside each group, elements are sorted by the criteria given by compare_priority().
16 /* keysym, state, range, handler, str */ 40 * the lookup of keysym is done in two steps:
17//{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"}, 41 * 1) locate the group corresponds to the keysym;
18//{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, 42 * 2) do a linear search inside the group.
19//{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, 43 *
20//{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, 44 * array hash[] effectively defines a map from a keysym to a group in keymap[].
21//{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, 45 *
22//{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, 46 * each group has its address(the index of first group element in keymap[]),
23//{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033<C-Tab>"}, 47 * which is computed and stored in hash[].
24//{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"}, 48 * hash[] stores the addresses in the form of:
25//{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"}, 49 * index: 0 I1 I2 I3 In
26//{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"}, 50 * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An
27//{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"}, 51 * where
28//{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"}, 52 * A1 = 0;
29//{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"}, 53 * Ai+1 = N1 + N2 + ... + Ni.
30//{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"}, 54 * it is computed from hash_bucket_size[]:
31//{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"}, 55 * index: 0 I1 I2 I3 In
32//{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, 56 * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0
33//{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, 57 * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[])
34//{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, 58 * or we can say
35//{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, 59 * hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0,
36}; 60 * where
61 * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym }
62 * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK
63 * n(the number of groups) = the number of non-zero member of hash_bucket_size[];
64 * Ni(the size of group i) = hash_bucket_size[Ii].
65 */
37 66
38static void 67static void
39output_string (rxvt_term *rt, const char *str) 68output_string (rxvt_term *rt, const char *str)
40{ 69{
41 if (strncmp (str, "command:", 8) == 0) 70 if (strncmp (str, "command:", 8) == 0)
42 rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); 71 rt->cmdbuf_append (str + 8, strlen (str) - 8);
72 else if (strncmp (str, "perl:", 5) == 0)
73 HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END));
43 else 74 else
44 rt->tt_write ((unsigned char *)str, strlen (str)); 75 rt->tt_write (str, strlen (str));
45} 76}
46
47static void
48output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen)
49{
50 if (state & rt->ModMetaMask)
51 {
52#ifdef META8_OPTION
53 if (rt->meta_char == 0x80) /* set 8-bit on */
54 {
55 for (char *ch = buf; ch < buf + buflen; ch++)
56 *ch |= 0x80;
57 }
58 else if (rt->meta_char == C0_ESC) /* escape prefix */
59#endif
60 {
61 const unsigned char ch = C0_ESC;
62 rt->tt_write (&ch, 1);
63 }
64 }
65
66 rt->tt_write ((unsigned char *) buf, buflen);
67}
68
69static int
70format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize)
71{
72 size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]);
73
74 if (len >= (size_t)bufsize)
75 {
76 rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n");
77 *buf = 0;
78 }
79
80 return len;
81}
82
83////////////////////////////////////////////////////////////////////////////////
84// return: #bits of '1'
85#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3)
86# define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n); }))
87#else
88static int
89bitcount (uint16_t n)
90{
91 int i;
92
93 for (i = 0; n; ++i, n &= n - 1)
94 ;
95
96 return i;
97}
98#endif
99 77
100// return: priority_of_a - priority_of_b 78// return: priority_of_a - priority_of_b
101static int 79static int
102compare_priority (keysym_t *a, keysym_t *b) 80compare_priority (keysym_t *a, keysym_t *b)
103{ 81{
104 // (the more '1's in state; the less range): the greater priority 82 // (the more '1's in state; the less range): the greater priority
105 int ca = bitcount (a->state /* & OtherModMask */); 83 int ca = rxvt_popcount (a->state /* & OtherModMask */);
106 int cb = bitcount (b->state /* & OtherModMask */); 84 int cb = rxvt_popcount (b->state /* & OtherModMask */);
107 85
108 if (ca != cb) 86 if (ca != cb)
109 return ca - cb; 87 return ca - cb;
110//else if (a->state != b->state) // this behavior is to be disscussed 88//else if (a->state != b->state) // this behavior is to be discussed
111// return b->state - a->state; 89// return b->state - a->state;
112 else 90 else
113 return b->range - a->range; 91 return b->range - a->range;
114} 92}
115 93
… …
126} 104}
127 105
128void 106void
129keyboard_manager::clear () 107keyboard_manager::clear ()
130{ 108{
109 hash [0] = 2;
110
111 for (unsigned int i = 0; i < keymap.size (); ++i)
112 {
113 free ((void *)keymap [i]->str);
114 delete keymap [i];
115 keymap [i] = 0;
116 }
117
131 keymap.clear (); 118 keymap.clear ();
132 hash [0] = 2;
133
134 for (unsigned int i = 0; i < user_translations.size (); ++i)
135 {
136 free ((void *)user_translations [i]);
137 user_translations [i] = 0;
138 }
139
140 for (unsigned int i = 0; i < user_keymap.size (); ++i)
141 {
142 delete user_keymap [i];
143 user_keymap [i] = 0;
144 }
145
146 user_keymap.clear ();
147 user_translations.clear ();
148} 119}
149 120
150// a wrapper for register_keymap, 121// a wrapper for register_keymap,
151// so that outside codes don't have to know so much details. 122// so that outside codes don't have to know so much details.
152// 123//
… …
155void 126void
156keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 127keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans)
157{ 128{
158 keysym_t *key = new keysym_t; 129 keysym_t *key = new keysym_t;
159 wchar_t *wc = rxvt_mbstowcs (trans); 130 wchar_t *wc = rxvt_mbstowcs (trans);
160 const char *translation = rxvt_wcstoutf8 (wc); 131 char *translation = rxvt_wcstoutf8 (wc);
161 free (wc); 132 free (wc);
162 133
163 if (key && translation) 134 if (key && translation)
164 { 135 {
165 key->keysym = keysym; 136 key->keysym = keysym;
166 key->state = state; 137 key->state = state;
167 key->range = 1; 138 key->range = 1;
168 key->str = translation; 139 key->str = translation;
169 key->type = keysym_t::NORMAL; 140 key->type = keysym_t::STRING;
170 141
171 if (strncmp (translation, "list", 4) == 0 && translation [4]) 142 if (strncmp (translation, "list", 4) == 0 && translation [4])
172 { 143 {
173 char *middle = strchr (translation + 5, translation [4]); 144 char *middle = strchr (translation + 5, translation [4]);
174 char *suffix = strrchr (translation + 5, translation [4]); 145 char *suffix = strrchr (translation + 5, translation [4]);
175 146
176 if (suffix && middle && suffix > middle + 1) 147 if (suffix && middle && suffix > middle + 1)
177 { 148 {
178 key->type = keysym_t::LIST; 149 key->type = keysym_t::LIST;
179 key->range = suffix - middle - 1; 150 key->range = suffix - middle - 1;
180 151
181 strcpy (translation, translation + 4); 152 memmove (translation, translation + 4, strlen (translation + 4) + 1);
182 } 153 }
183 else 154 else
184 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); 155 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation);
185 } 156 }
157 else if (strncmp (translation, "builtin:", 8) == 0)
158 key->type = keysym_t::BUILTIN;
186 159
187 user_keymap.push_back (key);
188 user_translations.push_back (translation);
189 register_keymap (key); 160 register_keymap (key);
190 } 161 }
191 else 162 else
192 { 163 {
193 delete key; 164 delete key;
… …
207} 178}
208 179
209void 180void
210keyboard_manager::register_done () 181keyboard_manager::register_done ()
211{ 182{
212 unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t);
213
214 if (keymap.back () != &stock_keymap[n - 1])
215 for (i = 0; i < n; ++i)
216 register_keymap (&stock_keymap[i]);
217
218 purge_duplicate_keymap ();
219
220 setup_hash (); 183 setup_hash ();
221} 184}
222 185
223bool 186bool
224keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 187keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state)
225{ 188{
226 assert (hash[0] == 0 && "register_done() need to be called"); 189 assert (hash[0] == 0 && "register_done() need to be called");
190
191 state &= OtherModMask; // mask out uninteresting modifiers
227 192
228 if (state & term->ModMetaMask) state |= MetaMask; 193 if (state & term->ModMetaMask) state |= MetaMask;
229 if (state & term->ModNumLockMask) state |= NumLockMask; 194 if (state & term->ModNumLockMask) state |= NumLockMask;
230 if (state & term->ModLevel3Mask) state |= Level3Mask; 195 if (state & term->ModLevel3Mask) state |= Level3Mask;
231 196
… …
236 201
237 if (index >= 0) 202 if (index >= 0)
238 { 203 {
239 const keysym_t &key = *keymap [index]; 204 const keysym_t &key = *keymap [index];
240 205
241 int keysym_offset = keysym - key.keysym; 206 if (key.type != keysym_t::BUILTIN)
242
243 wchar_t *wc = rxvt_utf8towcs (key.str);
244
245 char *str = rxvt_wcstombs (wc);
246 // TODO: do translations, unescaping etc, here (allow \u escape etc.)
247 free (wc);
248
249 switch (key.type)
250 { 207 {
251 case keysym_t::NORMAL: 208 int keysym_offset = keysym - key.keysym;
252 output_string (term, str);
253 break;
254 209
255 case keysym_t::RANGE: 210 wchar_t *wc = rxvt_utf8towcs (key.str);
211 char *str = rxvt_wcstombs (wc);
212 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
213 free (wc);
214
215 switch (key.type)
256 { 216 {
217 case keysym_t::STRING:
218 output_string (term, str);
219 break;
220
221 case keysym_t::LIST:
222 {
257 char buf[STRING_MAX]; 223 char buf[STRING_MAX];
258 224
259 if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) 225 char *prefix, *middle, *suffix;
226
227 prefix = str;
228 middle = strchr (prefix + 1, *prefix);
229 suffix = strrchr (middle + 1, *prefix);
230
231 memcpy (buf, prefix + 1, middle - prefix - 1);
232 buf [middle - prefix - 1] = middle [keysym_offset + 1];
233 strcpy (buf + (middle - prefix), suffix + 1);
234
260 output_string (term, buf); 235 output_string (term, buf);
236 }
237 break;
261 } 238 }
262 break;
263 239
264 case keysym_t::RANGE_META8: 240 free (str);
265 {
266 int len;
267 char buf[STRING_MAX];
268 241
269 len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); 242 return true;
270 if (len > 0)
271 output_string_meta8 (term, state, buf, len);
272 }
273 break;
274
275 case keysym_t::LIST:
276 {
277 char buf[STRING_MAX];
278
279 char *prefix, *middle, *suffix;
280
281 prefix = str;
282 middle = strchr (prefix + 1, *prefix);
283 suffix = strrchr (middle + 1, *prefix);
284
285 memcpy (buf, prefix + 1, middle - prefix - 1);
286 buf [middle - prefix - 1] = middle [keysym_offset + 1];
287 strcpy (buf + (middle - prefix), suffix + 1);
288
289 output_string (term, buf);
290 }
291 break;
292 } 243 }
293
294 free (str);
295
296 return true;
297 }
298 else
299 { 244 }
300 // fprintf(stderr,"[%x:%x]",state,keysym); 245
301 return false; 246 return false;
302 }
303}
304
305// purge duplicate keymap entries
306void keyboard_manager::purge_duplicate_keymap ()
307{
308 for (unsigned int i = 0; i < keymap.size (); ++i)
309 {
310 for (unsigned int j = 0; j < i; ++j)
311 {
312 if (keymap [i] == keymap [j])
313 {
314 while (keymap [i] == keymap.back ())
315 keymap.pop_back ();
316
317 if (i < keymap.size ())
318 {
319 keymap[i] = keymap.back ();
320 keymap.pop_back ();
321 }
322 break;
323 }
324 }
325 }
326} 247}
327 248
328void 249void
329keyboard_manager::setup_hash () 250keyboard_manager::setup_hash ()
330{ 251{
331 unsigned int i, index, hashkey; 252 unsigned int i, index, hashkey;
332 vector <keysym_t *> sorted_keymap; 253 vector <keysym_t *> sorted_keymap;
333 uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget 254 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket
334 uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget
335 255
336 memset (hash_budget_size, 0, sizeof (hash_budget_size)); 256 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
337 memset (hash_budget_counter, 0, sizeof (hash_budget_counter));
338 257
339 // count keysyms for corresponding hash budgets 258 // determine hash bucket size
340 for (i = 0; i < keymap.size (); ++i) 259 for (i = 0; i < keymap.size (); ++i)
260 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j)
341 { 261 {
342 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; 262 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK;
343 ++hash_budget_size [hashkey]; 263 ++hash_bucket_size [hashkey];
344 } 264 }
345 265
346 // a keysym_t with range>1 is counted one more time for every keysym that 266 // now we know the size of each bucket
347 // lies in its range 267 // compute the index of each bucket
268 hash [0] = 0;
269 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i)
270 {
271 index += hash_bucket_size [i - 1];
272 hash [i] = index;
273 }
274
275 // and allocate just enough space
276 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0);
277
278 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
279
280 // fill in sorted_keymap
281 // it is sorted in each bucket
348 for (i = 0; i < keymap.size (); ++i) 282 for (i = 0; i < keymap.size (); ++i)
349 {
350 if (keymap[i]->range > 1)
351 {
352 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j > 0; --j)
353 {
354 hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK);
355 if (hash_budget_size [hashkey])
356 ++hash_budget_size [hashkey];
357 }
358 }
359 }
360
361 // now we know the size of each budget
362 // compute the index of each budget
363 hash [0] = 0;
364 for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i)
365 {
366 index += hash_budget_size [i - 1];
367 hash[i] = (hash_budget_size [i] ? index : hash [i - 1]);
368 }
369
370 // and allocate just enough space
371 sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0);
372
373 // fill in sorted_keymap
374 // it is sorted in each budget
375 for (i = 0; i < keymap.size (); ++i)
376 {
377 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) 283 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j)
378 { 284 {
379 hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); 285 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK;
380 286
381 if (hash_budget_size [hashkey])
382 {
383 index = hash [hashkey] + hash_budget_counter [hashkey]; 287 index = hash [hashkey] + hash_bucket_size [hashkey];
384 288
385 while (index > hash [hashkey] 289 while (index > hash [hashkey]
386 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) 290 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0)
387 { 291 {
388 sorted_keymap [index] = sorted_keymap [index - 1]; 292 sorted_keymap [index] = sorted_keymap [index - 1];
389 --index; 293 --index;
390 } 294 }
391 295
392 sorted_keymap [index] = keymap [i]; 296 sorted_keymap [index] = keymap [i];
393 ++hash_budget_counter [hashkey]; 297 ++hash_bucket_size [hashkey];
394 }
395 } 298 }
396 }
397 299
398 keymap.swap (sorted_keymap); 300 keymap.swap (sorted_keymap);
399 301
400#if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) 302#ifndef NDEBUG
401 // check for invariants 303 // check for invariants
402 for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) 304 for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
403 { 305 {
404 index = hash[i]; 306 index = hash[i];
405 for (int j = 0; j < hash_budget_size [i]; ++j) 307 for (int j = 0; j < hash_bucket_size [i]; ++j)
406 { 308 {
407 if (keymap [index + j]->range == 1) 309 if (keymap [index + j]->range == 1)
408 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); 310 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK));
409 311
410 if (j) 312 if (j)
… …
421 { 323 {
422 int index = find_keysym (a->keysym + j, a->state); 324 int index = find_keysym (a->keysym + j, a->state);
423 325
424 assert (index >= 0); 326 assert (index >= 0);
425 keysym_t *b = keymap [index]; 327 keysym_t *b = keymap [index];
426 assert (i == (signed) index || // the normally expected result 328 assert (i == index // the normally expected result
427 (a->keysym + j) >= b->keysym && (a->keysym + j) <= (b->keysym + b->range) && compare_priority (a, b) <= 0); // is effectively the same or a closer match 329 || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range)
330 && compare_priority (a, b) <= 0); // is effectively the same or a closer match
428 } 331 }
429 } 332 }
430#endif 333#endif
431} 334}
432 335
433int 336int
434keyboard_manager::find_keysym (KeySym keysym, unsigned int state) 337keyboard_manager::find_keysym (KeySym keysym, unsigned int state)
435{ 338{
436 int hashkey = keysym & KEYSYM_HASH_MASK; 339 int hashkey = keysym & KEYSYM_HASH_MASK;
437 unsigned int index = hash [hashkey]; 340 unsigned int index = hash [hashkey];
341 unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1
342 ? hash [hashkey + 1]
343 : keymap.size ();
438 344
439 for (; index < keymap.size (); ++index) 345 for (; index < end; ++index)
440 { 346 {
441 keysym_t *key = keymap [index]; 347 keysym_t *key = keymap [index];
442 348
443 if (key->keysym <= keysym && key->keysym + key->range > keysym 349 if (key->keysym <= keysym && keysym < key->keysym + key->range
444 // match only the specified bits in state and ignore others 350 // match only the specified bits in state and ignore others
445 && (key->state & state) == key->state) 351 && (key->state & state) == key->state)
446 return index; 352 return index;
447 else if ((key->keysym & KEYSYM_HASH_MASK) > hashkey && key->range == 1)
448 return -1;
449 } 353 }
450 354
451 return -1; 355 return -1;
452} 356}
453 357

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines