5324557c7b
indent butchered Objective-C formatting. This patch was created by: 1) Reverting the indent changes in hw/xquartz 2) Editing X11Application.m and chaning some #ifdef logic to work with uncrustify 3) Hand edited some (c) notifications 4) Opened all XQuartz sources in XCode and re-indented (^I) 5) Ran uncrustify with this configuration (as close to the indent rules as I could get): tok_split_gte=false utf8_byte=true utf8_force=true indent_cmt_with_tabs=false indent_align_string=false indent_braces=false indent_braces_no_func=false indent_braces_no_class=false indent_braces_no_struct=false indent_brace_parent=false indent_namespace=false indent_extern=false indent_class=false indent_class_colon=false indent_else_if=false indent_var_def_cont=false indent_func_call_param=false indent_func_def_param=false indent_func_proto_param=false indent_func_class_param=false indent_func_ctor_var_param=false indent_template_param=false indent_func_param_double=false indent_relative_single_line_comments=false indent_col1_comment=false indent_access_spec_body=false indent_paren_nl=false indent_comma_paren=false indent_bool_paren=false indent_first_bool_expr=false indent_square_nl=false indent_preserve_sql=false indent_align_assign=true sp_balance_nested_parens=false align_keep_tabs=false align_with_tabs=false align_on_tabstop=false align_number_left=false align_func_params=false align_same_func_call_params=false align_var_def_colon=true align_var_def_attribute=true align_var_def_inline=true align_right_cmt_mix=false align_on_operator=false align_mix_var_proto=false align_single_line_func=false align_single_line_brace=false align_nl_cont=false align_left_shift=true align_oc_decl_colon=true nl_collapse_empty_body=true nl_assign_leave_one_liners=true nl_class_leave_one_liners=true nl_enum_leave_one_liners=true nl_getset_leave_one_liners=true nl_func_leave_one_liners=true nl_if_leave_one_liners=true nl_multi_line_cond=false nl_multi_line_define=false nl_before_case=true nl_after_case=true nl_after_return=false nl_after_semicolon=true nl_after_brace_open=true nl_after_brace_open_cmt=false nl_after_vbrace_open=false nl_after_vbrace_open_empty=false nl_after_brace_close=false nl_after_vbrace_close=false nl_define_macro=false nl_squeeze_ifdef=false nl_ds_struct_enum_cmt=false nl_ds_struct_enum_close_brace=false nl_create_if_one_liner=false nl_create_for_one_liner=false nl_create_while_one_liner=false ls_for_split_full=false ls_func_split_full=false nl_after_multiline_comment=false eat_blanks_after_open_brace=false eat_blanks_before_close_brace=false mod_full_brace_if_chain=false mod_pawn_semicolon=false mod_full_paren_if_bool=false mod_remove_extra_semicolon=false mod_sort_import=false mod_sort_using=false mod_sort_include=false mod_move_case_break=false mod_remove_empty_return=false cmt_indent_multi=true cmt_c_group=false cmt_c_nl_start=false cmt_c_nl_end=false cmt_cpp_group=false cmt_cpp_nl_start=false cmt_cpp_nl_end=false cmt_cpp_to_c=false cmt_star_cont=false cmt_multi_check_last=true cmt_insert_before_preproc=false pp_indent_at_level=false pp_region_indent_code=false pp_if_indent_code=false pp_define_at_level=false indent_columns=4 indent_brace=0 indent_switch_case=0 align_struct_init_span=2 align_pp_define_gap=0 align_pp_define_span=2 align_oc_msg_colon_span=16 nl_end_of_file_min=1 nl_func_var_def_blk=0 code_width=78 nl_max=2 newlines=auto indent_with_tabs=0 sp_arith=force sp_assign=force sp_assign_default=force sp_before_assign=force sp_after_assign=force sp_enum_assign=force sp_enum_before_assign=force sp_enum_after_assign=force sp_pp_stringify=add sp_bool=force sp_compare=force sp_inside_paren=remove sp_paren_paren=remove sp_paren_brace=force sp_before_ptr_star=ignore sp_before_unnamed_ptr_star=force sp_before_byref=force sp_before_unnamed_byref=force sp_after_byref=remove sp_after_type=force sp_before_sparen=force sp_inside_sparen=remove sp_inside_sparen_close=remove sp_after_sparen=force sp_sparen_brace=force sp_special_semi=force sp_before_semi=remove sp_after_semi=force sp_after_semi_for=force sp_after_semi_for_empty=remove sp_before_square=remove sp_inside_square=remove sp_after_comma=force sp_before_comma=remove sp_paren_comma=force sp_before_ellipsis=force sp_after_class_colon=force sp_before_class_colon=force sp_before_case_colon=remove sp_after_cast=remove sp_inside_paren_cast=remove sp_sizeof_paren=remove sp_inside_braces_enum=force sp_inside_braces_struct=force sp_inside_braces=force sp_inside_braces_empty=remove sp_func_proto_paren=remove sp_func_def_paren=remove sp_inside_fparens=remove sp_inside_fparen=remove sp_square_fparen=remove sp_fparen_brace=force sp_func_call_paren=remove sp_func_call_paren_empty=remove sp_return_paren=force sp_attribute_paren=remove sp_defined_paren=remove sp_macro=force sp_macro_func=force sp_else_brace=force sp_brace_else=force sp_brace_typedef=force sp_not=remove sp_inv=remove nl_start_of_file=remove nl_end_of_file=force nl_assign_square=remove nl_after_square_assign=remove nl_fcall_brace=remove nl_enum_brace=remove nl_struct_brace=remove nl_union_brace=remove nl_if_brace=remove nl_brace_else=force nl_elseif_brace=remove nl_else_brace=remove nl_else_if=remove nl_for_brace=remove nl_do_brace=remove nl_brace_while=remove nl_switch_brace=remove nl_case_colon_brace=force nl_func_type_name=force nl_func_type_name_class=force nl_func_proto_type_name=force nl_func_paren=remove nl_func_def_paren=remove nl_func_decl_start=remove nl_func_def_start=remove nl_func_decl_args=remove nl_func_decl_end=remove nl_func_def_end=remove nl_func_decl_end_single=remove nl_func_def_end_single=remove nl_func_decl_empty=remove nl_func_def_empty=remove nl_fdef_brace=force nl_return_expr=remove nl_before_if=ignore nl_after_if=ignore nl_before_for=ignore nl_after_for=ignore nl_before_while=ignore nl_after_while=ignore nl_before_switch=ignore nl_after_switch=ignore nl_before_do=ignore nl_after_do=ignore pp_space=remove Signed-off-by: Jeremy Huddleston <jeremyhu@apple.com>
322 lines
8.2 KiB
C
322 lines
8.2 KiB
C
/* x-hash.c - basic hash tables
|
|
*
|
|
* Copyright (c) 2002-2012 Apple Inc. All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person
|
|
* obtaining a copy of this software and associated documentation files
|
|
* (the "Software"), to deal in the Software without restriction,
|
|
* including without limitation the rights to use, copy, modify, merge,
|
|
* publish, distribute, sublicense, and/or sell copies of the Software,
|
|
* and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE ABOVE LISTED COPYRIGHT
|
|
* HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
* DEALINGS IN THE SOFTWARE.
|
|
*
|
|
* Except as contained in this notice, the name(s) of the above
|
|
* copyright holders shall not be used in advertising or otherwise to
|
|
* promote the sale, use or other dealings in this Software without
|
|
* prior written authorization.
|
|
*/
|
|
|
|
#ifdef HAVE_DIX_CONFIG_H
|
|
#include <dix-config.h>
|
|
#endif
|
|
|
|
#include "x-hash.h"
|
|
#include "x-list.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
|
|
struct x_hash_table_struct {
|
|
unsigned int bucket_index;
|
|
unsigned int total_keys;
|
|
x_list **buckets;
|
|
|
|
x_hash_fun *hash_key;
|
|
x_compare_fun *compare_keys;
|
|
x_destroy_fun *destroy_key;
|
|
x_destroy_fun *destroy_value;
|
|
};
|
|
|
|
#define ITEM_NEW(k, v) X_PFX(list_prepend) ((x_list *)(k), v)
|
|
#define ITEM_FREE(i) X_PFX(list_free_1) (i)
|
|
#define ITEM_KEY(i) ((void *)(i)->next)
|
|
#define ITEM_VALUE(i) ((i)->data)
|
|
|
|
#define SPLIT_THRESHOLD_FACTOR 2
|
|
|
|
/* http://planetmath.org/?op=getobj&from=objects&name=GoodHashTablePrimes */
|
|
static const unsigned int bucket_sizes[] = {
|
|
29, 53, 97, 193, 389, 769, 1543,
|
|
3079, 6151, 12289, 24593, 49157,
|
|
98317, 196613, 393241, 786433, 1572869, 3145739, 6291469,
|
|
12582917,
|
|
25165843, 50331653, 100663319, 201326611, 402653189, 805306457,
|
|
1610612741
|
|
};
|
|
|
|
#define N_BUCKET_SIZES (sizeof(bucket_sizes) / sizeof(bucket_sizes[0]))
|
|
|
|
static inline unsigned int
|
|
hash_table_total_buckets(x_hash_table *h)
|
|
{
|
|
return bucket_sizes[h->bucket_index];
|
|
}
|
|
|
|
static inline void
|
|
hash_table_destroy_item(x_hash_table *h, void *k, void *v)
|
|
{
|
|
if (h->destroy_key != 0)
|
|
(*h->destroy_key)(k);
|
|
|
|
if (h->destroy_value != 0)
|
|
(*h->destroy_value)(v);
|
|
}
|
|
|
|
static inline size_t
|
|
hash_table_hash_key(x_hash_table *h, void *k)
|
|
{
|
|
if (h->hash_key != 0)
|
|
return (*h->hash_key)(k);
|
|
else
|
|
return (size_t)k;
|
|
}
|
|
|
|
static inline int
|
|
hash_table_compare_keys(x_hash_table *h, void *k1, void *k2)
|
|
{
|
|
if (h->compare_keys == 0)
|
|
return k1 == k2;
|
|
else
|
|
return (*h->compare_keys)(k1, k2) == 0;
|
|
}
|
|
|
|
static void
|
|
hash_table_split(x_hash_table *h)
|
|
{
|
|
x_list **new, **old;
|
|
x_list *node, *item, *next;
|
|
int new_size, old_size;
|
|
size_t b;
|
|
int i;
|
|
|
|
if (h->bucket_index == N_BUCKET_SIZES - 1)
|
|
return;
|
|
|
|
old_size = hash_table_total_buckets(h);
|
|
old = h->buckets;
|
|
|
|
h->bucket_index++;
|
|
|
|
new_size = hash_table_total_buckets(h);
|
|
new = calloc(new_size, sizeof(x_list *));
|
|
|
|
if (new == 0) {
|
|
h->bucket_index--;
|
|
return;
|
|
}
|
|
|
|
for (i = 0; i < old_size; i++) {
|
|
for (node = old[i]; node != 0; node = next) {
|
|
next = node->next;
|
|
item = node->data;
|
|
|
|
b = hash_table_hash_key(h, ITEM_KEY(item)) % new_size;
|
|
|
|
node->next = new[b];
|
|
new[b] = node;
|
|
}
|
|
}
|
|
|
|
h->buckets = new;
|
|
free(old);
|
|
}
|
|
|
|
X_EXTERN x_hash_table *
|
|
X_PFX(hash_table_new) (x_hash_fun * hash,
|
|
x_compare_fun * compare,
|
|
x_destroy_fun * key_destroy,
|
|
x_destroy_fun * value_destroy) {
|
|
x_hash_table *h;
|
|
|
|
h = calloc(1, sizeof(x_hash_table));
|
|
if (h == 0)
|
|
return 0;
|
|
|
|
h->bucket_index = 0;
|
|
h->buckets = calloc(hash_table_total_buckets(h), sizeof(x_list *));
|
|
|
|
if (h->buckets == 0) {
|
|
free(h);
|
|
return 0;
|
|
}
|
|
|
|
h->hash_key = hash;
|
|
h->compare_keys = compare;
|
|
h->destroy_key = key_destroy;
|
|
h->destroy_value = value_destroy;
|
|
|
|
return h;
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(hash_table_free) (x_hash_table * h) {
|
|
int n, i;
|
|
x_list *node, *item;
|
|
|
|
assert(h != NULL);
|
|
|
|
n = hash_table_total_buckets(h);
|
|
|
|
for (i = 0; i < n; i++) {
|
|
for (node = h->buckets[i]; node != 0; node = node->next) {
|
|
item = node->data;
|
|
hash_table_destroy_item(h, ITEM_KEY(item), ITEM_VALUE(item));
|
|
ITEM_FREE(item);
|
|
}
|
|
X_PFX(list_free) (h->buckets[i]);
|
|
}
|
|
|
|
free(h->buckets);
|
|
free(h);
|
|
}
|
|
|
|
X_EXTERN unsigned int
|
|
X_PFX(hash_table_size) (x_hash_table * h) {
|
|
assert(h != NULL);
|
|
|
|
return h->total_keys;
|
|
}
|
|
|
|
static void
|
|
hash_table_modify(x_hash_table *h, void *k, void *v, int replace)
|
|
{
|
|
size_t hash_value;
|
|
x_list *node, *item;
|
|
|
|
assert(h != NULL);
|
|
|
|
hash_value = hash_table_hash_key(h, k);
|
|
|
|
for (node = h->buckets[hash_value % hash_table_total_buckets(h)];
|
|
node != 0; node = node->next) {
|
|
item = node->data;
|
|
|
|
if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {
|
|
if (replace) {
|
|
hash_table_destroy_item(h, ITEM_KEY(item),
|
|
ITEM_VALUE(item));
|
|
item->next = k;
|
|
ITEM_VALUE(item) = v;
|
|
}
|
|
else {
|
|
hash_table_destroy_item(h, k, ITEM_VALUE(item));
|
|
ITEM_VALUE(item) = v;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
|
|
/* Key isn't already in the table. Insert it. */
|
|
|
|
if (h->total_keys + 1
|
|
> hash_table_total_buckets(h) * SPLIT_THRESHOLD_FACTOR) {
|
|
hash_table_split(h);
|
|
}
|
|
|
|
hash_value = hash_value % hash_table_total_buckets(h);
|
|
h->buckets[hash_value] = X_PFX(list_prepend) (h->buckets[hash_value],
|
|
ITEM_NEW(k, v));
|
|
h->total_keys++;
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(hash_table_insert) (x_hash_table * h, void *k, void *v) {
|
|
hash_table_modify(h, k, v, 0);
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(hash_table_replace) (x_hash_table * h, void *k, void *v) {
|
|
hash_table_modify(h, k, v, 1);
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(hash_table_remove) (x_hash_table * h, void *k) {
|
|
size_t hash_value;
|
|
x_list **ptr, *item;
|
|
|
|
assert(h != NULL);
|
|
|
|
hash_value = hash_table_hash_key(h, k);
|
|
|
|
for (ptr = &h->buckets[hash_value % hash_table_total_buckets(h)];
|
|
*ptr != 0; ptr = &((*ptr)->next)) {
|
|
item = (*ptr)->data;
|
|
|
|
if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {
|
|
hash_table_destroy_item(h, ITEM_KEY(item), ITEM_VALUE(item));
|
|
ITEM_FREE(item);
|
|
item = *ptr;
|
|
*ptr = item->next;
|
|
X_PFX(list_free_1) (item);
|
|
h->total_keys--;
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
X_EXTERN void *
|
|
X_PFX(hash_table_lookup) (x_hash_table * h, void *k, void **k_ret) {
|
|
size_t hash_value;
|
|
x_list *node, *item;
|
|
|
|
assert(h != NULL);
|
|
|
|
hash_value = hash_table_hash_key(h, k);
|
|
|
|
for (node = h->buckets[hash_value % hash_table_total_buckets(h)];
|
|
node != 0; node = node->next) {
|
|
item = node->data;
|
|
|
|
if (hash_table_compare_keys(h, ITEM_KEY(item), k)) {
|
|
if (k_ret != 0)
|
|
*k_ret = ITEM_KEY(item);
|
|
|
|
return ITEM_VALUE(item);
|
|
}
|
|
}
|
|
|
|
if (k_ret != 0)
|
|
*k_ret = 0;
|
|
|
|
return 0;
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(hash_table_foreach) (x_hash_table * h,
|
|
x_hash_foreach_fun * fun, void *data) {
|
|
int i, n;
|
|
x_list *node, *item;
|
|
|
|
assert(h != NULL);
|
|
|
|
n = hash_table_total_buckets(h);
|
|
|
|
for (i = 0; i < n; i++) {
|
|
for (node = h->buckets[i]; node != 0; node = node->next) {
|
|
item = node->data;
|
|
(*fun)(ITEM_KEY(item), ITEM_VALUE(item), data);
|
|
}
|
|
}
|
|
}
|