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>
315 lines
6.9 KiB
C
315 lines
6.9 KiB
C
/* x-list.c
|
|
*
|
|
* 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-list.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <pthread.h>
|
|
|
|
/* Allocate in ~4k blocks */
|
|
#define NODES_PER_BLOCK 508
|
|
|
|
typedef struct x_list_block_struct x_list_block;
|
|
|
|
struct x_list_block_struct {
|
|
x_list l[NODES_PER_BLOCK];
|
|
};
|
|
|
|
static x_list *freelist;
|
|
|
|
static pthread_mutex_t freelist_lock = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
static inline void
|
|
list_free_1(x_list *node)
|
|
{
|
|
node->next = freelist;
|
|
freelist = node;
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(list_free_1) (x_list * node) {
|
|
assert(node != NULL);
|
|
|
|
pthread_mutex_lock(&freelist_lock);
|
|
|
|
list_free_1(node);
|
|
|
|
pthread_mutex_unlock(&freelist_lock);
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(list_free) (x_list * lst) {
|
|
x_list *next;
|
|
|
|
pthread_mutex_lock(&freelist_lock);
|
|
|
|
for (; lst != NULL; lst = next) {
|
|
next = lst->next;
|
|
list_free_1(lst);
|
|
}
|
|
|
|
pthread_mutex_unlock(&freelist_lock);
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_prepend) (x_list * lst, void *data) {
|
|
x_list *node;
|
|
|
|
pthread_mutex_lock(&freelist_lock);
|
|
|
|
if (freelist == NULL) {
|
|
x_list_block *b;
|
|
int i;
|
|
|
|
b = malloc(sizeof(x_list_block));
|
|
assert(b != NULL);
|
|
|
|
for (i = 0; i < NODES_PER_BLOCK - 1; i++)
|
|
b->l[i].next = &(b->l[i + 1]);
|
|
b->l[i].next = NULL;
|
|
|
|
freelist = b->l;
|
|
}
|
|
|
|
node = freelist;
|
|
freelist = node->next;
|
|
|
|
pthread_mutex_unlock(&freelist_lock);
|
|
|
|
node->next = lst;
|
|
node->data = data;
|
|
|
|
return node;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_append) (x_list * lst, void *data) {
|
|
x_list *head = lst;
|
|
|
|
if (lst == NULL)
|
|
return X_PFX(list_prepend) (NULL, data);
|
|
|
|
while (lst->next != NULL)
|
|
lst = lst->next;
|
|
|
|
lst->next = X_PFX(list_prepend) (NULL, data);
|
|
|
|
return head;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_reverse) (x_list * lst) {
|
|
x_list *head = NULL, *next;
|
|
|
|
while (lst != NULL)
|
|
{
|
|
next = lst->next;
|
|
lst->next = head;
|
|
head = lst;
|
|
lst = next;
|
|
}
|
|
|
|
return head;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_find) (x_list * lst, void *data) {
|
|
for (; lst != NULL; lst = lst->next) {
|
|
if (lst->data == data)
|
|
return lst;
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_nth) (x_list * lst, int n) {
|
|
while (n-- > 0 && lst != NULL)
|
|
lst = lst->next;
|
|
|
|
return lst;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_pop) (x_list * lst, void **data_ret) {
|
|
void *data = NULL;
|
|
|
|
if (lst != NULL) {
|
|
x_list *tem = lst;
|
|
data = lst->data;
|
|
lst = lst->next;
|
|
X_PFX(list_free_1) (tem);
|
|
}
|
|
|
|
if (data_ret != NULL)
|
|
*data_ret = data;
|
|
|
|
return lst;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_filter) (x_list * lst,
|
|
int (*pred)(void *item, void *data), void *data) {
|
|
x_list *ret = NULL, *node;
|
|
|
|
for (node = lst; node != NULL; node = node->next) {
|
|
if ((*pred)(node->data, data))
|
|
ret = X_PFX(list_prepend) (ret, node->data);
|
|
}
|
|
|
|
return X_PFX(list_reverse) (ret);
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_map) (x_list * lst,
|
|
void *(*fun)(void *item, void *data), void *data) {
|
|
x_list *ret = NULL, *node;
|
|
|
|
for (node = lst; node != NULL; node = node->next) {
|
|
X_PFX(list_prepend) (ret, fun(node->data, data));
|
|
}
|
|
|
|
return X_PFX(list_reverse) (ret);
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_copy) (x_list * lst) {
|
|
x_list *copy = NULL;
|
|
|
|
for (; lst != NULL; lst = lst->next) {
|
|
copy = X_PFX(list_prepend) (copy, lst->data);
|
|
}
|
|
|
|
return X_PFX(list_reverse) (copy);
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_remove) (x_list * lst, void *data) {
|
|
x_list **ptr, *node;
|
|
|
|
for (ptr = &lst; *ptr != NULL;) {
|
|
node = *ptr;
|
|
|
|
if (node->data == data) {
|
|
*ptr = node->next;
|
|
X_PFX(list_free_1) (node);
|
|
}
|
|
else
|
|
ptr = &((*ptr)->next);
|
|
}
|
|
|
|
return lst;
|
|
}
|
|
|
|
X_EXTERN unsigned int
|
|
X_PFX(list_length) (x_list * lst) {
|
|
unsigned int n;
|
|
|
|
n = 0;
|
|
for (; lst != NULL; lst = lst->next)
|
|
n++;
|
|
|
|
return n;
|
|
}
|
|
|
|
X_EXTERN void
|
|
X_PFX(list_foreach) (x_list * lst,
|
|
void (*fun)(void *data, void *user_data),
|
|
void *user_data) {
|
|
for (; lst != NULL; lst = lst->next) {
|
|
(*fun)(lst->data, user_data);
|
|
}
|
|
}
|
|
|
|
static x_list *
|
|
list_sort_1(x_list *lst, int length,
|
|
int (*less)(const void *, const void *))
|
|
{
|
|
x_list *mid, *ptr;
|
|
x_list *out_head, *out;
|
|
int mid_point, i;
|
|
|
|
/* This is a standard (stable) list merge sort */
|
|
|
|
if (length < 2)
|
|
return lst;
|
|
|
|
/* Calculate the halfway point. Split the list into two sub-lists. */
|
|
|
|
mid_point = length / 2;
|
|
ptr = lst;
|
|
for (i = mid_point - 1; i > 0; i--)
|
|
ptr = ptr->next;
|
|
mid = ptr->next;
|
|
ptr->next = NULL;
|
|
|
|
/* Sort each sub-list. */
|
|
|
|
lst = list_sort_1(lst, mid_point, less);
|
|
mid = list_sort_1(mid, length - mid_point, less);
|
|
|
|
/* Then merge them back together. */
|
|
|
|
assert(lst != NULL && mid != NULL);
|
|
|
|
if ((*less)(mid->data, lst->data))
|
|
out = out_head = mid, mid = mid->next;
|
|
else
|
|
out = out_head = lst, lst = lst->next;
|
|
|
|
while (lst != NULL && mid != NULL)
|
|
{
|
|
if ((*less)(mid->data, lst->data))
|
|
out = out->next = mid, mid = mid->next;
|
|
else
|
|
out = out->next = lst, lst = lst->next;
|
|
}
|
|
|
|
if (lst != NULL)
|
|
out->next = lst;
|
|
else
|
|
out->next = mid;
|
|
|
|
return out_head;
|
|
}
|
|
|
|
X_EXTERN x_list *
|
|
X_PFX(list_sort) (x_list * lst, int (*less)(const void *, const void *)) {
|
|
int length;
|
|
|
|
length = X_PFX(list_length) (lst);
|
|
|
|
return list_sort_1(lst, length, less);
|
|
}
|