4 * Copyright (C) 1998 Alexandre Julliard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #include "wine/port.h"
39 struct list entry
; /* entry in the hash list */
47 unsigned int hash_size
; /* size of hash table */
48 int case_sensitive
; /* are names case sensitive? */
49 struct list names
[1]; /* array of hash entry lists */
54 static struct list object_list
= LIST_INIT(object_list
);
56 void dump_objects(void)
60 LIST_FOR_EACH( p
, &object_list
)
62 struct object
*ptr
= LIST_ENTRY( p
, struct object
, obj_list
);
63 fprintf( stderr
, "%p:%d: ", ptr
, ptr
->refcount
);
64 ptr
->ops
->dump( ptr
, 1 );
69 /*****************************************************************/
71 /* malloc replacement */
72 void *mem_alloc( size_t size
)
74 void *ptr
= malloc( size
);
75 if (ptr
) memset( ptr
, 0x55, size
);
76 else set_error( STATUS_NO_MEMORY
);
80 /* duplicate a block of memory */
81 void *memdup( const void *data
, size_t len
)
83 void *ptr
= malloc( len
);
84 if (ptr
) memcpy( ptr
, data
, len
);
85 else set_error( STATUS_NO_MEMORY
);
90 /*****************************************************************/
92 static int get_name_hash( const struct namespace *namespace, const WCHAR
*name
, size_t len
)
96 if (namespace->case_sensitive
) while (len
--) hash
^= *name
++;
97 else while (len
--) hash
^= tolowerW(*name
++);
98 return hash
% namespace->hash_size
;
101 /* allocate a name for an object */
102 static struct object_name
*alloc_name( const WCHAR
*name
, size_t len
)
104 struct object_name
*ptr
;
106 if ((ptr
= mem_alloc( sizeof(*ptr
) + len
- sizeof(ptr
->name
) )))
109 memcpy( ptr
->name
, name
, len
);
114 /* free the name of an object */
115 static void free_name( struct object
*obj
)
117 struct object_name
*ptr
= obj
->name
;
118 list_remove( &ptr
->entry
);
122 /* set the name of an existing object */
123 static void set_object_name( struct namespace *namespace,
124 struct object
*obj
, struct object_name
*ptr
)
126 int hash
= get_name_hash( namespace, ptr
->name
, ptr
->len
);
128 list_add_head( &namespace->names
[hash
], &ptr
->entry
);
133 /* allocate and initialize an object */
134 /* if the function fails the fd is closed */
135 void *alloc_object( const struct object_ops
*ops
, int fd
)
137 struct object
*obj
= mem_alloc( ops
->size
);
148 if ((fd
!= -1) && (add_select_user( obj
) == -1))
155 list_add_head( &object_list
, &obj
->obj_list
);
159 if (fd
!= -1) close( fd
);
163 void *create_named_object( struct namespace *namespace, const struct object_ops
*ops
,
164 const WCHAR
*name
, size_t len
)
167 struct object_name
*name_ptr
;
169 if (!name
|| !len
) return alloc_object( ops
, -1 );
171 if ((obj
= find_object( namespace, name
, len
)))
175 set_error( STATUS_OBJECT_NAME_COLLISION
);
178 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
181 if (!(name_ptr
= alloc_name( name
, len
))) return NULL
;
182 if ((obj
= alloc_object( ops
, -1 )))
184 set_object_name( namespace, obj
, name_ptr
);
187 else free( name_ptr
);
191 /* dump the name of an object to stderr */
192 void dump_object_name( struct object
*obj
)
194 if (!obj
->name
) fprintf( stderr
, "name=\"\"" );
197 fprintf( stderr
, "name=L\"" );
198 dump_strW( obj
->name
->name
, obj
->name
->len
/sizeof(WCHAR
), stderr
, "\"\"" );
199 fputc( '\"', stderr
);
203 /* grab an object (i.e. increment its refcount) and return the object */
204 struct object
*grab_object( void *ptr
)
206 struct object
*obj
= (struct object
*)ptr
;
207 assert( obj
->refcount
< INT_MAX
);
212 /* release an object (i.e. decrement its refcount) */
213 void release_object( void *ptr
)
215 struct object
*obj
= (struct object
*)ptr
;
216 assert( obj
->refcount
);
217 if (!--obj
->refcount
)
219 /* if the refcount is 0, nobody can be in the wait queue */
220 assert( !obj
->head
);
221 assert( !obj
->tail
);
222 obj
->ops
->destroy( obj
);
223 if (obj
->fd_obj
) close_fd( obj
->fd_obj
);
224 if (obj
->name
) free_name( obj
);
225 if (obj
->select
!= -1) remove_select_user( obj
);
226 if (obj
->fd
!= -1) close( obj
->fd
);
228 list_remove( &obj
->obj_list
);
229 memset( obj
, 0xaa, obj
->ops
->size
);
235 /* find an object by its name; the refcount is incremented */
236 struct object
*find_object( const struct namespace *namespace, const WCHAR
*name
, size_t len
)
238 const struct list
*list
, *p
;
240 if (!name
|| !len
) return NULL
;
242 list
= &namespace->names
[ get_name_hash( namespace, name
, len
) ];
243 if (namespace->case_sensitive
)
245 LIST_FOR_EACH( p
, list
)
247 struct object_name
*ptr
= LIST_ENTRY( p
, struct object_name
, entry
);
248 if (ptr
->len
!= len
) continue;
249 if (!memcmp( ptr
->name
, name
, len
)) return grab_object( ptr
->obj
);
254 LIST_FOR_EACH( p
, list
)
256 struct object_name
*ptr
= LIST_ENTRY( p
, struct object_name
, entry
);
257 if (ptr
->len
!= len
) continue;
258 if (!strncmpiW( ptr
->name
, name
, len
/sizeof(WCHAR
) )) return grab_object( ptr
->obj
);
264 /* allocate a namespace */
265 struct namespace *create_namespace( unsigned int hash_size
, int case_sensitive
)
267 struct namespace *namespace;
270 namespace = mem_alloc( sizeof(*namespace) + (hash_size
- 1) * sizeof(namespace->names
[0]) );
273 namespace->hash_size
= hash_size
;
274 namespace->case_sensitive
= case_sensitive
;
275 for (i
= 0; i
< hash_size
; i
++) list_init( &namespace->names
[i
] );
280 /* functions for unimplemented/default object operations */
282 int no_add_queue( struct object
*obj
, struct wait_queue_entry
*entry
)
284 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
288 int no_satisfied( struct object
*obj
, struct thread
*thread
)
290 return 0; /* not abandoned */
293 struct fd
*no_get_fd( struct object
*obj
)
295 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
299 struct fd
*default_get_fd( struct object
*obj
)
301 if (obj
->fd_obj
) return (struct fd
*)grab_object( obj
->fd_obj
);
302 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
306 int no_get_file_info( struct object
*obj
, struct get_file_info_reply
*info
, int *flags
)
308 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
310 return FD_TYPE_INVALID
;
313 void no_destroy( struct object
*obj
)
317 /* default handler for poll() events */
318 void default_poll_event( struct object
*obj
, int event
)
320 /* an error occurred, stop polling this fd to avoid busy-looping */
321 if (event
& (POLLERR
| POLLHUP
)) set_select_events( obj
, -1 );