3 * These are the server equivalent of K32OBJ
5 * Copyright (C) 1998 Alexandre Julliard
21 struct object_name *next;
22 struct object_name *prev;
28 #define NAME_HASH_SIZE 37
30 static struct object_name *names[NAME_HASH_SIZE];
33 static struct object *first;
35 void dump_objects(void)
37 struct object *ptr = first;
40 fprintf( stderr, "%p:%d: ", ptr, ptr->refcount );
41 ptr->ops->dump( ptr, 1 );
47 /*****************************************************************/
49 /* malloc replacement */
50 void *mem_alloc( size_t size )
52 void *ptr = malloc( size );
53 if (ptr) memset( ptr, 0x55, size );
54 else set_error( STATUS_NO_MEMORY );
58 /* duplicate a block of memory */
59 void *memdup( const void *data, size_t len )
61 void *ptr = malloc( len );
62 if (ptr) memcpy( ptr, data, len );
63 else set_error( STATUS_NO_MEMORY );
68 /*****************************************************************/
70 static int get_name_hash( const WCHAR *name, size_t len )
74 while (len--) hash ^= *name++;
75 return hash % NAME_HASH_SIZE;
78 /* allocate a name for an object */
79 static struct object_name *alloc_name( const WCHAR *name, size_t len )
81 struct object_name *ptr;
83 if ((ptr = mem_alloc( sizeof(*ptr) + len - sizeof(ptr->name) )))
86 memcpy( ptr->name, name, len );
91 /* free the name of an object */
92 static void free_name( struct object *obj )
94 struct object_name *ptr = obj->name;
95 if (ptr->next) ptr->next->prev = ptr->prev;
96 if (ptr->prev) ptr->prev->next = ptr->next;
100 for (hash = 0; hash < NAME_HASH_SIZE; hash++)
101 if (names[hash] == ptr)
103 names[hash] = ptr->next;
110 /* set the name of an existing object */
111 static void set_object_name( struct object *obj, struct object_name *ptr )
113 int hash = get_name_hash( ptr->name, ptr->len );
115 if ((ptr->next = names[hash]) != NULL) ptr->next->prev = ptr;
119 assert( !obj->name );
123 /* allocate and initialize an object */
124 /* if the function fails the fd is closed */
125 void *alloc_object( const struct object_ops *ops, int fd )
127 struct object *obj = mem_alloc( ops->size );
137 if ((fd != -1) && (add_select_user( obj ) == -1))
145 if ((obj->next = first) != NULL) obj->next->prev = obj;
150 if (fd != -1) close( fd );
154 void *create_named_object( const struct object_ops *ops, const WCHAR *name, size_t len )
157 struct object_name *name_ptr;
159 if (!name || !len) return alloc_object( ops, -1 );
160 if (!(name_ptr = alloc_name( name, len ))) return NULL;
162 if ((obj = find_object( name_ptr->name, name_ptr->len )))
164 free( name_ptr ); /* we no longer need it */
167 set_error( STATUS_OBJECT_NAME_COLLISION );
170 set_error( STATUS_OBJECT_TYPE_MISMATCH );
173 if ((obj = alloc_object( ops, -1 )))
175 set_object_name( obj, name_ptr );
178 else free( name_ptr );
182 /* dump the name of an object to stderr */
183 void dump_object_name( struct object *obj )
185 if (!obj->name) fprintf( stderr, "name=\"\"" );
188 fprintf( stderr, "name=L\"" );
189 dump_strW( obj->name->name, obj->name->len/sizeof(WCHAR), stderr, "\"\"" );
190 fputc( '\"', stderr );
194 /* grab an object (i.e. increment its refcount) and return the object */
195 struct object *grab_object( void *ptr )
197 struct object *obj = (struct object *)ptr;
198 assert( obj->refcount < INT_MAX );
203 /* release an object (i.e. decrement its refcount) */
204 void release_object( void *ptr )
206 struct object *obj = (struct object *)ptr;
207 assert( obj->refcount );
208 if (!--obj->refcount)
210 /* if the refcount is 0, nobody can be in the wait queue */
211 assert( !obj->head );
212 assert( !obj->tail );
213 obj->ops->destroy( obj );
214 if (obj->name) free_name( obj );
215 if (obj->select != -1) remove_select_user( obj );
216 if (obj->fd != -1) close( obj->fd );
218 if (obj->next) obj->next->prev = obj->prev;
219 if (obj->prev) obj->prev->next = obj->next;
220 else first = obj->next;
221 memset( obj, 0xaa, obj->ops->size );
227 /* find an object by its name; the refcount is incremented */
228 struct object *find_object( const WCHAR *name, size_t len )
230 struct object_name *ptr;
232 if (!name || !len) return NULL;
233 for (ptr = names[ get_name_hash( name, len ) ]; ptr; ptr = ptr->next)
235 if (ptr->len != len) continue;
236 if (!memcmp( ptr->name, name, len )) return grab_object( ptr->obj );
241 /* functions for unimplemented/default object operations */
243 int no_add_queue( struct object *obj, struct wait_queue_entry *entry )
245 set_error( STATUS_OBJECT_TYPE_MISMATCH );
249 int no_satisfied( struct object *obj, struct thread *thread )
251 return 0; /* not abandoned */
254 int no_get_fd( struct object *obj )
256 set_error( STATUS_OBJECT_TYPE_MISMATCH );
260 int no_flush( struct object *obj )
262 set_error( STATUS_OBJECT_TYPE_MISMATCH );
266 int no_get_file_info( struct object *obj, struct get_file_info_reply *info )
268 set_error( STATUS_OBJECT_TYPE_MISMATCH );
269 return FD_TYPE_INVALID;
272 void no_destroy( struct object *obj )
276 /* default add_queue() routine for objects that poll() on an fd */
277 int default_poll_add_queue( struct object *obj, struct wait_queue_entry *entry )
279 if (!obj->head) /* first on the queue */
280 set_select_events( obj, obj->ops->get_poll_events( obj ) );
281 add_queue( obj, entry );
285 /* default remove_queue() routine for objects that poll() on an fd */
286 void default_poll_remove_queue( struct object *obj, struct wait_queue_entry *entry )
289 remove_queue( obj, entry );
290 if (!obj->head) /* last on the queue is gone */
291 set_select_events( obj, 0 );
292 release_object( obj );
295 /* default signaled() routine for objects that poll() on an fd */
296 int default_poll_signaled( struct object *obj, struct thread *thread )
298 int events = obj->ops->get_poll_events( obj );
300 if (check_select_events( obj->fd, events ))
302 /* stop waiting on select() if we are signaled */
303 set_select_events( obj, 0 );
306 /* restart waiting on select() if we are no longer signaled */
307 if (obj->head) set_select_events( obj, events );
311 /* default handler for poll() events */
312 void default_poll_event( struct object *obj, int event )
314 /* an error occurred, stop polling this fd to avoid busy-looping */
315 if (event & (POLLERR | POLLHUP)) set_select_events( obj, -1 );