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"
33 #define WIN32_NO_STATUS
43 struct list entry
; /* entry in the hash list */
44 struct object
*obj
; /* object owning this name */
45 struct object
*parent
; /* parent object */
46 size_t len
; /* name length in bytes */
52 unsigned int hash_size
; /* size of hash table */
53 struct list names
[1]; /* array of hash entry lists */
58 static struct list object_list
= LIST_INIT(object_list
);
60 void dump_objects(void)
64 LIST_FOR_EACH( p
, &object_list
)
66 struct object
*ptr
= LIST_ENTRY( p
, struct object
, obj_list
);
67 fprintf( stderr
, "%p:%d: ", ptr
, ptr
->refcount
);
68 ptr
->ops
->dump( ptr
, 1 );
73 /*****************************************************************/
75 /* malloc replacement */
76 void *mem_alloc( size_t size
)
78 void *ptr
= malloc( size
);
79 if (ptr
) memset( ptr
, 0x55, size
);
80 else set_error( STATUS_NO_MEMORY
);
84 /* duplicate a block of memory */
85 void *memdup( const void *data
, size_t len
)
87 void *ptr
= malloc( len
);
88 if (ptr
) memcpy( ptr
, data
, len
);
89 else set_error( STATUS_NO_MEMORY
);
94 /*****************************************************************/
96 static int get_name_hash( const struct namespace *namespace, const WCHAR
*name
, size_t len
)
100 while (len
--) hash
^= tolowerW(*name
++);
101 return hash
% namespace->hash_size
;
104 /* allocate a name for an object */
105 static struct object_name
*alloc_name( const struct unicode_str
*name
)
107 struct object_name
*ptr
;
109 if ((ptr
= mem_alloc( sizeof(*ptr
) + name
->len
- sizeof(ptr
->name
) )))
111 ptr
->len
= name
->len
;
113 memcpy( ptr
->name
, name
->str
, name
->len
);
118 /* free the name of an object */
119 static void free_name( struct object
*obj
)
121 struct object_name
*ptr
= obj
->name
;
122 list_remove( &ptr
->entry
);
123 if (ptr
->parent
) release_object( ptr
->parent
);
127 /* set the name of an existing object */
128 static void set_object_name( struct namespace *namespace,
129 struct object
*obj
, struct object_name
*ptr
)
131 int hash
= get_name_hash( namespace, ptr
->name
, ptr
->len
);
133 list_add_head( &namespace->names
[hash
], &ptr
->entry
);
138 /* get the name of an existing object */
139 const WCHAR
*get_object_name( struct object
*obj
, size_t *len
)
141 struct object_name
*ptr
= obj
->name
;
142 if (!ptr
) return NULL
;
147 /* allocate and initialize an object */
148 void *alloc_object( const struct object_ops
*ops
)
150 struct object
*obj
= mem_alloc( ops
->size
);
156 list_init( &obj
->wait_queue
);
158 list_add_head( &object_list
, &obj
->obj_list
);
165 void *create_object( struct namespace *namespace, const struct object_ops
*ops
,
166 const struct unicode_str
*name
, struct object
*parent
)
169 struct object_name
*name_ptr
;
171 if (!(name_ptr
= alloc_name( name
))) return NULL
;
172 if ((obj
= alloc_object( ops
)))
174 set_object_name( namespace, obj
, name_ptr
);
175 if (parent
) name_ptr
->parent
= grab_object( parent
);
182 void *create_named_object( struct namespace *namespace, const struct object_ops
*ops
,
183 const struct unicode_str
*name
, unsigned int attributes
)
187 if (!name
|| !name
->len
) return alloc_object( ops
);
189 if ((obj
= find_object( namespace, name
, attributes
)))
191 if (attributes
& OBJ_OPENIF
&& obj
->ops
== ops
)
192 set_error( STATUS_OBJECT_NAME_EXISTS
);
195 release_object( obj
);
197 if (attributes
& OBJ_OPENIF
)
198 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
200 set_error( STATUS_OBJECT_NAME_COLLISION
);
204 if ((obj
= create_object( namespace, ops
, name
, NULL
))) clear_error();
208 /* dump the name of an object to stderr */
209 void dump_object_name( struct object
*obj
)
211 if (!obj
->name
) fprintf( stderr
, "name=\"\"" );
214 fprintf( stderr
, "name=L\"" );
215 dump_strW( obj
->name
->name
, obj
->name
->len
/sizeof(WCHAR
), stderr
, "\"\"" );
216 fputc( '\"', stderr
);
220 /* grab an object (i.e. increment its refcount) and return the object */
221 struct object
*grab_object( void *ptr
)
223 struct object
*obj
= (struct object
*)ptr
;
224 assert( obj
->refcount
< INT_MAX
);
229 /* release an object (i.e. decrement its refcount) */
230 void release_object( void *ptr
)
232 struct object
*obj
= (struct object
*)ptr
;
233 assert( obj
->refcount
);
234 if (!--obj
->refcount
)
236 /* if the refcount is 0, nobody can be in the wait queue */
237 assert( list_empty( &obj
->wait_queue
));
238 obj
->ops
->destroy( obj
);
239 if (obj
->name
) free_name( obj
);
241 list_remove( &obj
->obj_list
);
242 memset( obj
, 0xaa, obj
->ops
->size
);
248 /* find an object by its name; the refcount is incremented */
249 struct object
*find_object( const struct namespace *namespace, const struct unicode_str
*name
,
250 unsigned int attributes
)
252 const struct list
*list
, *p
;
254 if (!name
|| !name
->len
) return NULL
;
256 list
= &namespace->names
[ get_name_hash( namespace, name
->str
, name
->len
) ];
257 LIST_FOR_EACH( p
, list
)
259 const struct object_name
*ptr
= LIST_ENTRY( p
, const struct object_name
, entry
);
260 if (ptr
->len
!= name
->len
) continue;
261 if (attributes
& OBJ_CASE_INSENSITIVE
)
263 if (!strncmpiW( ptr
->name
, name
->str
, name
->len
/sizeof(WCHAR
) ))
264 return grab_object( ptr
->obj
);
268 if (!memcmp( ptr
->name
, name
->str
, name
->len
))
269 return grab_object( ptr
->obj
);
275 /* allocate a namespace */
276 struct namespace *create_namespace( unsigned int hash_size
)
278 struct namespace *namespace;
281 namespace = mem_alloc( sizeof(*namespace) + (hash_size
- 1) * sizeof(namespace->names
[0]) );
284 namespace->hash_size
= hash_size
;
285 for (i
= 0; i
< hash_size
; i
++) list_init( &namespace->names
[i
] );
290 /* functions for unimplemented/default object operations */
292 int no_add_queue( struct object
*obj
, struct wait_queue_entry
*entry
)
294 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
298 int no_satisfied( struct object
*obj
, struct thread
*thread
)
300 return 0; /* not abandoned */
303 int no_signal( struct object
*obj
, unsigned int access
)
305 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
309 struct fd
*no_get_fd( struct object
*obj
)
311 set_error( STATUS_OBJECT_TYPE_MISMATCH
);
315 unsigned int no_map_access( struct object
*obj
, unsigned int access
)
317 if (access
& GENERIC_READ
) access
|= STANDARD_RIGHTS_READ
;
318 if (access
& GENERIC_WRITE
) access
|= STANDARD_RIGHTS_WRITE
;
319 if (access
& GENERIC_EXECUTE
) access
|= STANDARD_RIGHTS_EXECUTE
;
320 if (access
& GENERIC_ALL
) access
|= STANDARD_RIGHTS_ALL
;
321 return access
& ~(GENERIC_READ
| GENERIC_WRITE
| GENERIC_EXECUTE
| GENERIC_ALL
);
324 struct object
*no_lookup_name( struct object
*obj
, struct unicode_str
*name
,
330 int no_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
)
332 return 1; /* ok to close */
335 void no_destroy( struct object
*obj
)