?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
wined3d: Fix / update reported driver model version.
[wine/zf.git] / server / registry.c
blobdcbb3f791e105a3bb43f92a58bd8c0f0077504da
1 /*
2 * Server-side registry management
3 *
4 * Copyright (C) 1999 Alexandre Julliard
5 *
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.
10 *
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.
15 *
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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
19 */
20
21 /* To do:
22 * - symbolic links
23 */
24
25 #include "config.h"
26 #include "wine/port.h"
27
28 #include <assert.h>
29 #include <ctype.h>
30 #include <errno.h>
31 #include <fcntl.h>
32 #include <limits.h>
33 #include <stdio.h>
34 #include <stdarg.h>
35 #include <string.h>
36 #include <stdlib.h>
37 #include <sys/stat.h>
38 #include <unistd.h>
39
40 #include "ntstatus.h"
41 #define WIN32_NO_STATUS
42 #include "object.h"
43 #include "file.h"
44 #include "handle.h"
45 #include "request.h"
46 #include "process.h"
47 #include "unicode.h"
48 #include "security.h"
49
50 #include "winternl.h"
51
52 struct notify
53 {
54 struct list entry; /* entry in list of notifications */
55 struct event *event; /* event to set when changing this key */
56 int subtree; /* true if subtree notification */
57 unsigned int filter; /* which events to notify on */
58 obj_handle_t hkey; /* hkey associated with this notification */
59 struct process *process; /* process in which the hkey is valid */
60 };
61
62 /* a registry key */
63 struct key
64 {
65 struct object obj; /* object header */
66 WCHAR *name; /* key name */
67 WCHAR *class; /* key class */
68 unsigned short namelen; /* length of key name */
69 unsigned short classlen; /* length of class name */
70 struct key *parent; /* parent key */
71 int last_subkey; /* last in use subkey */
72 int nb_subkeys; /* count of allocated subkeys */
73 struct key **subkeys; /* subkeys array */
74 int last_value; /* last in use value */
75 int nb_values; /* count of allocated values in array */
76 struct key_value *values; /* values array */
77 unsigned int flags; /* flags */
78 timeout_t modif; /* last modification time */
79 struct list notify_list; /* list of notifications */
80 };
81
82 /* key flags */
83 #define KEY_VOLATILE 0x0001 /* key is volatile (not saved to disk) */
84 #define KEY_DELETED 0x0002 /* key has been deleted */
85 #define KEY_DIRTY 0x0004 /* key has been modified */
86 #define KEY_SYMLINK 0x0008 /* key is a symbolic link */
87 #define KEY_WOW64 0x0010 /* key contains a Wow6432Node subkey */
88 #define KEY_WOWSHARE 0x0020 /* key is a Wow64 shared key (used for Software\Classes) */
89
90 /* a key value */
91 struct key_value
92 {
93 WCHAR *name; /* value name */
94 unsigned short namelen; /* length of value name */
95 unsigned int type; /* value type */
96 data_size_t len; /* value data length in bytes */
97 void *data; /* pointer to value data */
98 };
99
100 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
101 #define MIN_VALUES 8 /* min. number of allocated values per key */
102
103 #define MAX_NAME_LEN 256 /* max. length of a key name */
104 #define MAX_VALUE_LEN 16383 /* max. length of a value name */
105
106 /* the root of the registry tree */
107 static struct key *root_key;
108
109 static const timeout_t ticks_1601_to_1970 = (timeout_t)86400 * (369 * 365 + 89) * TICKS_PER_SEC;
110 static const timeout_t save_period = 30 * -TICKS_PER_SEC; /* delay between periodic saves */
111 static struct timeout_user *save_timeout_user; /* saving timer */
112 static enum prefix_type { PREFIX_UNKNOWN, PREFIX_32BIT, PREFIX_64BIT } prefix_type;
113
114 static const WCHAR root_name[] = { '\\','R','e','g','i','s','t','r','y','\\' };
115 static const WCHAR wow6432node[] = {'W','o','w','6','4','3','2','N','o','d','e'};
116 static const WCHAR symlink_value[] = {'S','y','m','b','o','l','i','c','L','i','n','k','V','a','l','u','e'};
117 static const struct unicode_str symlink_str = { symlink_value, sizeof(symlink_value) };
118
119 static void set_periodic_save_timer(void);
120 static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index );
121
122 /* information about where to save a registry branch */
123 struct save_branch_info
124 {
125 struct key *key;
126 const char *path;
127 };
128
129 #define MAX_SAVE_BRANCH_INFO 3
130 static int save_branch_count;
131 static struct save_branch_info save_branch_info[MAX_SAVE_BRANCH_INFO];
132
133
134 /* information about a file being loaded */
135 struct file_load_info
136 {
137 const char *filename; /* input file name */
138 FILE *file; /* input file */
139 char *buffer; /* line buffer */
140 int len; /* buffer length */
141 int line; /* current input line */
142 WCHAR *tmp; /* temp buffer to use while parsing input */
143 size_t tmplen; /* length of temp buffer */
144 };
145
146
147 static void key_dump( struct object *obj, int verbose );
148 static struct object_type *key_get_type( struct object *obj );
149 static unsigned int key_map_access( struct object *obj, unsigned int access );
150 static struct security_descriptor *key_get_sd( struct object *obj );
151 static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle );
152 static void key_destroy( struct object *obj );
153
154 static const struct object_ops key_ops =
155 {
156 sizeof(struct key), /* size */
157 key_dump, /* dump */
158 key_get_type, /* get_type */
159 no_add_queue, /* add_queue */
160 NULL, /* remove_queue */
161 NULL, /* signaled */
162 NULL, /* satisfied */
163 no_signal, /* signal */
164 no_get_fd, /* get_fd */
165 key_map_access, /* map_access */
166 key_get_sd, /* get_sd */
167 default_set_sd, /* set_sd */
168 no_lookup_name, /* lookup_name */
169 no_link_name, /* link_name */
170 NULL, /* unlink_name */
171 no_open_file, /* open_file */
172 no_kernel_obj_list, /* get_kernel_obj_list */
173 key_close_handle, /* close_handle */
174 key_destroy /* destroy */
175 };
176
177
178 static inline int is_wow6432node( const WCHAR *name, unsigned int len )
179 {
180 return (len == sizeof(wow6432node) && !memicmp_strW( name, wow6432node, sizeof( wow6432node )));
181 }
182
183 /*
184 * The registry text file format v2 used by this code is similar to the one
185 * used by REGEDIT import/export functionality, with the following differences:
186 * - strings and key names can contain \x escapes for Unicode
187 * - key names use escapes too in order to support Unicode
188 * - the modification time optionally follows the key name
189 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
190 */
191
192 /* dump the full path of a key */
193 static void dump_path( const struct key *key, const struct key *base, FILE *f )
194 {
195 if (key->parent && key->parent != base)
196 {
197 dump_path( key->parent, base, f );
198 fprintf( f, "\\\\" );
199 }
200 dump_strW( key->name, key->namelen, f, "[]" );
201 }
202
203 /* dump a value to a text file */
204 static void dump_value( const struct key_value *value, FILE *f )
205 {
206 unsigned int i, dw;
207 int count;
208
209 if (value->namelen)
210 {
211 fputc( '\"', f );
212 count = 1 + dump_strW( value->name, value->namelen, f, "\"\"" );
213 count += fprintf( f, "\"=" );
214 }
215 else count = fprintf( f, "@=" );
216
217 switch(value->type)
218 {
219 case REG_SZ:
220 case REG_EXPAND_SZ:
221 case REG_MULTI_SZ:
222 /* only output properly terminated strings in string format */
223 if (value->len < sizeof(WCHAR)) break;
224 if (value->len % sizeof(WCHAR)) break;
225 if (((WCHAR *)value->data)[value->len / sizeof(WCHAR) - 1]) break;
226 if (value->type != REG_SZ) fprintf( f, "str(%x):", value->type );
227 fputc( '\"', f );
228 dump_strW( (WCHAR *)value->data, value->len, f, "\"\"" );
229 fprintf( f, "\"\n" );
230 return;
231
232 case REG_DWORD:
233 if (value->len != sizeof(dw)) break;
234 memcpy( &dw, value->data, sizeof(dw) );
235 fprintf( f, "dword:%08x\n", dw );
236 return;
237 }
238
239 if (value->type == REG_BINARY) count += fprintf( f, "hex:" );
240 else count += fprintf( f, "hex(%x):", value->type );
241 for (i = 0; i < value->len; i++)
242 {
243 count += fprintf( f, "%02x", *((unsigned char *)value->data + i) );
244 if (i < value->len-1)
245 {
246 fputc( ',', f );
247 if (++count > 76)
248 {
249 fprintf( f, "\\\n " );
250 count = 2;
251 }
252 }
253 }
254 fputc( '\n', f );
255 }
256
257 /* save a registry and all its subkeys to a text file */
258 static void save_subkeys( const struct key *key, const struct key *base, FILE *f )
259 {
260 int i;
261
262 if (key->flags & KEY_VOLATILE) return;
263 /* save key if it has either some values or no subkeys, or needs special options */
264 /* keys with no values but subkeys are saved implicitly by saving the subkeys */
265 if ((key->last_value >= 0) || (key->last_subkey == -1) || key->class || (key->flags & KEY_SYMLINK))
266 {
267 fprintf( f, "\n[" );
268 if (key != base) dump_path( key, base, f );
269 fprintf( f, "] %u\n", (unsigned int)((key->modif - ticks_1601_to_1970) / TICKS_PER_SEC) );
270 fprintf( f, "#time=%x%08x\n", (unsigned int)(key->modif >> 32), (unsigned int)key->modif );
271 if (key->class)
272 {
273 fprintf( f, "#class=\"" );
274 dump_strW( key->class, key->classlen, f, "\"\"" );
275 fprintf( f, "\"\n" );
276 }
277 if (key->flags & KEY_SYMLINK) fputs( "#link\n", f );
278 for (i = 0; i <= key->last_value; i++) dump_value( &key->values[i], f );
279 }
280 for (i = 0; i <= key->last_subkey; i++) save_subkeys( key->subkeys[i], base, f );
281 }
282
283 static void dump_operation( const struct key *key, const struct key_value *value, const char *op )
284 {
285 fprintf( stderr, "%s key ", op );
286 if (key) dump_path( key, NULL, stderr );
287 else fprintf( stderr, "ERROR" );
288 if (value)
289 {
290 fprintf( stderr, " value ");
291 dump_value( value, stderr );
292 }
293 else fprintf( stderr, "\n" );
294 }
295
296 static void key_dump( struct object *obj, int verbose )
297 {
298 struct key *key = (struct key *)obj;
299 assert( obj->ops == &key_ops );
300 fprintf( stderr, "Key flags=%x ", key->flags );
301 dump_path( key, NULL, stderr );
302 fprintf( stderr, "\n" );
303 }
304
305 static struct object_type *key_get_type( struct object *obj )
306 {
307 static const WCHAR name[] = {'K','e','y'};
308 static const struct unicode_str str = { name, sizeof(name) };
309 return get_object_type( &str );
310 }
311
312 /* notify waiter and maybe delete the notification */
313 static void do_notification( struct key *key, struct notify *notify, int del )
314 {
315 if (notify->event)
316 {
317 set_event( notify->event );
318 release_object( notify->event );
319 notify->event = NULL;
320 }
321 if (del)
322 {
323 list_remove( &notify->entry );
324 free( notify );
325 }
326 }
327
328 static inline struct notify *find_notify( struct key *key, struct process *process, obj_handle_t hkey )
329 {
330 struct notify *notify;
331
332 LIST_FOR_EACH_ENTRY( notify, &key->notify_list, struct notify, entry )
333 {
334 if (notify->process == process && notify->hkey == hkey) return notify;
335 }
336 return NULL;
337 }
338
339 static unsigned int key_map_access( struct object *obj, unsigned int access )
340 {
341 if (access & GENERIC_READ) access |= KEY_READ;
342 if (access & GENERIC_WRITE) access |= KEY_WRITE;
343 if (access & GENERIC_EXECUTE) access |= KEY_EXECUTE;
344 if (access & GENERIC_ALL) access |= KEY_ALL_ACCESS;
345 /* filter the WOW64 masks, as they aren't real access bits */
346 return access & ~(GENERIC_READ | GENERIC_WRITE | GENERIC_EXECUTE | GENERIC_ALL |
347 KEY_WOW64_64KEY | KEY_WOW64_32KEY);
348 }
349
350 static struct security_descriptor *key_get_sd( struct object *obj )
351 {
352 static struct security_descriptor *key_default_sd;
353
354 if (obj->sd) return obj->sd;
355
356 if (!key_default_sd)
357 {
358 size_t users_sid_len = security_sid_len( security_builtin_users_sid );
359 size_t admins_sid_len = security_sid_len( security_builtin_admins_sid );
360 size_t dacl_len = sizeof(ACL) + 2 * offsetof( ACCESS_ALLOWED_ACE, SidStart )
361 + users_sid_len + admins_sid_len;
362 ACCESS_ALLOWED_ACE *aaa;
363 ACL *dacl;
364
365 key_default_sd = mem_alloc( sizeof(*key_default_sd) + 2 * admins_sid_len + dacl_len );
366 key_default_sd->control = SE_DACL_PRESENT;
367 key_default_sd->owner_len = admins_sid_len;
368 key_default_sd->group_len = admins_sid_len;
369 key_default_sd->sacl_len = 0;
370 key_default_sd->dacl_len = dacl_len;
371 memcpy( key_default_sd + 1, security_builtin_admins_sid, admins_sid_len );
372 memcpy( (char *)(key_default_sd + 1) + admins_sid_len, security_builtin_admins_sid, admins_sid_len );
373
374 dacl = (ACL *)((char *)(key_default_sd + 1) + 2 * admins_sid_len);
375 dacl->AclRevision = ACL_REVISION;
376 dacl->Sbz1 = 0;
377 dacl->AclSize = dacl_len;
378 dacl->AceCount = 2;
379 dacl->Sbz2 = 0;
380 aaa = (ACCESS_ALLOWED_ACE *)(dacl + 1);
381 aaa->Header.AceType = ACCESS_ALLOWED_ACE_TYPE;
382 aaa->Header.AceFlags = INHERIT_ONLY_ACE | CONTAINER_INHERIT_ACE;
383 aaa->Header.AceSize = offsetof( ACCESS_ALLOWED_ACE, SidStart ) + users_sid_len;
384 aaa->Mask = GENERIC_READ;
385 memcpy( &aaa->SidStart, security_builtin_users_sid, users_sid_len );
386 aaa = (ACCESS_ALLOWED_ACE *)((char *)aaa + aaa->Header.AceSize);
387 aaa->Header.AceType = ACCESS_ALLOWED_ACE_TYPE;
388 aaa->Header.AceFlags = 0;
389 aaa->Header.AceSize = offsetof( ACCESS_ALLOWED_ACE, SidStart ) + admins_sid_len;
390 aaa->Mask = KEY_ALL_ACCESS;
391 memcpy( &aaa->SidStart, security_builtin_admins_sid, admins_sid_len );
392 }
393 return key_default_sd;
394 }
395
396 /* close the notification associated with a handle */
397 static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle )
398 {
399 struct key * key = (struct key *) obj;
400 struct notify *notify = find_notify( key, process, handle );
401 if (notify) do_notification( key, notify, 1 );
402 return 1; /* ok to close */
403 }
404
405 static void key_destroy( struct object *obj )
406 {
407 int i;
408 struct list *ptr;
409 struct key *key = (struct key *)obj;
410 assert( obj->ops == &key_ops );
411
412 free( key->name );
413 free( key->class );
414 for (i = 0; i <= key->last_value; i++)
415 {
416 free( key->values[i].name );
417 free( key->values[i].data );
418 }
419 free( key->values );
420 for (i = 0; i <= key->last_subkey; i++)
421 {
422 key->subkeys[i]->parent = NULL;
423 release_object( key->subkeys[i] );
424 }
425 free( key->subkeys );
426 /* unconditionally notify everything waiting on this key */
427 while ((ptr = list_head( &key->notify_list )))
428 {
429 struct notify *notify = LIST_ENTRY( ptr, struct notify, entry );
430 do_notification( key, notify, 1 );
431 }
432 }
433
434 /* get the request vararg as registry path */
435 static inline void get_req_path( struct unicode_str *str, int skip_root )
436 {
437 str->str = get_req_data();
438 str->len = (get_req_data_size() / sizeof(WCHAR)) * sizeof(WCHAR);
439
440 if (skip_root && str->len >= sizeof(root_name) && !memicmp_strW( str->str, root_name, sizeof(root_name) ))
441 {
442 str->str += ARRAY_SIZE( root_name );
443 str->len -= sizeof(root_name);
444 }
445 }
446
447 /* return the next token in a given path */
448 /* token->str must point inside the path, or be NULL for the first call */
449 static struct unicode_str *get_path_token( const struct unicode_str *path, struct unicode_str *token )
450 {
451 data_size_t i = 0, len = path->len / sizeof(WCHAR);
452
453 if (!token->str) /* first time */
454 {
455 /* path cannot start with a backslash */
456 if (len && path->str[0] == '\\')
457 {
458 set_error( STATUS_OBJECT_PATH_INVALID );
459 return NULL;
460 }
461 }
462 else
463 {
464 i = token->str - path->str;
465 i += token->len / sizeof(WCHAR);
466 while (i < len && path->str[i] == '\\') i++;
467 }
468 token->str = path->str + i;
469 while (i < len && path->str[i] != '\\') i++;
470 token->len = (path->str + i - token->str) * sizeof(WCHAR);
471 return token;
472 }
473
474 /* allocate a key object */
475 static struct key *alloc_key( const struct unicode_str *name, timeout_t modif )
476 {
477 struct key *key;
478 if ((key = alloc_object( &key_ops )))
479 {
480 key->name = NULL;
481 key->class = NULL;
482 key->namelen = name->len;
483 key->classlen = 0;
484 key->flags = 0;
485 key->last_subkey = -1;
486 key->nb_subkeys = 0;
487 key->subkeys = NULL;
488 key->nb_values = 0;
489 key->last_value = -1;
490 key->values = NULL;
491 key->modif = modif;
492 key->parent = NULL;
493 list_init( &key->notify_list );
494 if (name->len && !(key->name = memdup( name->str, name->len )))
495 {
496 release_object( key );
497 key = NULL;
498 }
499 }
500 return key;
501 }
502
503 /* mark a key and all its parents as dirty (modified) */
504 static void make_dirty( struct key *key )
505 {
506 while (key)
507 {
508 if (key->flags & (KEY_DIRTY|KEY_VOLATILE)) return; /* nothing to do */
509 key->flags |= KEY_DIRTY;
510 key = key->parent;
511 }
512 }
513
514 /* mark a key and all its subkeys as clean (not modified) */
515 static void make_clean( struct key *key )
516 {
517 int i;
518
519 if (key->flags & KEY_VOLATILE) return;
520 if (!(key->flags & KEY_DIRTY)) return;
521 key->flags &= ~KEY_DIRTY;
522 for (i = 0; i <= key->last_subkey; i++) make_clean( key->subkeys[i] );
523 }
524
525 /* go through all the notifications and send them if necessary */
526 static void check_notify( struct key *key, unsigned int change, int not_subtree )
527 {
528 struct list *ptr, *next;
529
530 LIST_FOR_EACH_SAFE( ptr, next, &key->notify_list )
531 {
532 struct notify *n = LIST_ENTRY( ptr, struct notify, entry );
533 if ( ( not_subtree || n->subtree ) && ( change & n->filter ) )
534 do_notification( key, n, 0 );
535 }
536 }
537
538 /* update key modification time */
539 static void touch_key( struct key *key, unsigned int change )
540 {
541 struct key *k;
542
543 key->modif = current_time;
544 make_dirty( key );
545
546 /* do notifications */
547 check_notify( key, change, 1 );
548 for ( k = key->parent; k; k = k->parent )
549 check_notify( k, change, 0 );
550 }
551
552 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
553 static int grow_subkeys( struct key *key )
554 {
555 struct key **new_subkeys;
556 int nb_subkeys;
557
558 if (key->nb_subkeys)
559 {
560 nb_subkeys = key->nb_subkeys + (key->nb_subkeys / 2); /* grow by 50% */
561 if (!(new_subkeys = realloc( key->subkeys, nb_subkeys * sizeof(*new_subkeys) )))
562 {
563 set_error( STATUS_NO_MEMORY );
564 return 0;
565 }
566 }
567 else
568 {
569 nb_subkeys = MIN_SUBKEYS;
570 if (!(new_subkeys = mem_alloc( nb_subkeys * sizeof(*new_subkeys) ))) return 0;
571 }
572 key->subkeys = new_subkeys;
573 key->nb_subkeys = nb_subkeys;
574 return 1;
575 }
576
577 /* allocate a subkey for a given key, and return its index */
578 static struct key *alloc_subkey( struct key *parent, const struct unicode_str *name,
579 int index, timeout_t modif )
580 {
581 struct key *key;
582 int i;
583
584 if (name->len > MAX_NAME_LEN * sizeof(WCHAR))
585 {
586 set_error( STATUS_INVALID_PARAMETER );
587 return NULL;
588 }
589 if (parent->last_subkey + 1 == parent->nb_subkeys)
590 {
591 /* need to grow the array */
592 if (!grow_subkeys( parent )) return NULL;
593 }
594 if ((key = alloc_key( name, modif )) != NULL)
595 {
596 key->parent = parent;
597 for (i = ++parent->last_subkey; i > index; i--)
598 parent->subkeys[i] = parent->subkeys[i-1];
599 parent->subkeys[index] = key;
600 if (is_wow6432node( key->name, key->namelen ) && !is_wow6432node( parent->name, parent->namelen ))
601 parent->flags |= KEY_WOW64;
602 }
603 return key;
604 }
605
606 /* free a subkey of a given key */
607 static void free_subkey( struct key *parent, int index )
608 {
609 struct key *key;
610 int i, nb_subkeys;
611
612 assert( index >= 0 );
613 assert( index <= parent->last_subkey );
614
615 key = parent->subkeys[index];
616 for (i = index; i < parent->last_subkey; i++) parent->subkeys[i] = parent->subkeys[i + 1];
617 parent->last_subkey--;
618 key->flags |= KEY_DELETED;
619 key->parent = NULL;
620 if (is_wow6432node( key->name, key->namelen )) parent->flags &= ~KEY_WOW64;
621 release_object( key );
622
623 /* try to shrink the array */
624 nb_subkeys = parent->nb_subkeys;
625 if (nb_subkeys > MIN_SUBKEYS && parent->last_subkey < nb_subkeys / 2)
626 {
627 struct key **new_subkeys;
628 nb_subkeys -= nb_subkeys / 3; /* shrink by 33% */
629 if (nb_subkeys < MIN_SUBKEYS) nb_subkeys = MIN_SUBKEYS;
630 if (!(new_subkeys = realloc( parent->subkeys, nb_subkeys * sizeof(*new_subkeys) ))) return;
631 parent->subkeys = new_subkeys;
632 parent->nb_subkeys = nb_subkeys;
633 }
634 }
635
636 /* find the named child of a given key and return its index */
637 static struct key *find_subkey( const struct key *key, const struct unicode_str *name, int *index )
638 {
639 int i, min, max, res;
640 data_size_t len;
641
642 min = 0;
643 max = key->last_subkey;
644 while (min <= max)
645 {
646 i = (min + max) / 2;
647 len = min( key->subkeys[i]->namelen, name->len );
648 res = memicmp_strW( key->subkeys[i]->name, name->str, len );
649 if (!res) res = key->subkeys[i]->namelen - name->len;
650 if (!res)
651 {
652 *index = i;
653 return key->subkeys[i];
654 }
655 if (res > 0) max = i - 1;
656 else min = i + 1;
657 }
658 *index = min; /* this is where we should insert it */
659 return NULL;
660 }
661
662 /* return the wow64 variant of the key, or the key itself if none */
663 static struct key *find_wow64_subkey( struct key *key, const struct unicode_str *name )
664 {
665 static const struct unicode_str wow6432node_str = { wow6432node, sizeof(wow6432node) };
666 int index;
667
668 if (!(key->flags & KEY_WOW64)) return key;
669 if (!is_wow6432node( name->str, name->len ))
670 {
671 key = find_subkey( key, &wow6432node_str, &index );
672 assert( key ); /* if KEY_WOW64 is set we must find it */
673 }
674 return key;
675 }
676
677
678 /* follow a symlink and return the resolved key */
679 static struct key *follow_symlink( struct key *key, int iteration )
680 {
681 struct unicode_str path, token;
682 struct key_value *value;
683 int index;
684
685 if (iteration > 16) return NULL;
686 if (!(key->flags & KEY_SYMLINK)) return key;
687 if (!(value = find_value( key, &symlink_str, &index ))) return NULL;
688
689 path.str = value->data;
690 path.len = (value->len / sizeof(WCHAR)) * sizeof(WCHAR);
691 if (path.len <= sizeof(root_name)) return NULL;
692 if (memicmp_strW( path.str, root_name, sizeof(root_name) )) return NULL;
693 path.str += ARRAY_SIZE( root_name );
694 path.len -= sizeof(root_name);
695
696 key = root_key;
697 token.str = NULL;
698 if (!get_path_token( &path, &token )) return NULL;
699 while (token.len)
700 {
701 if (!(key = find_subkey( key, &token, &index ))) break;
702 if (!(key = follow_symlink( key, iteration + 1 ))) break;
703 get_path_token( &path, &token );
704 }
705 return key;
706 }
707
708 /* open a key until we find an element that doesn't exist */
709 /* helper for open_key and create_key */
710 static struct key *open_key_prefix( struct key *key, const struct unicode_str *name,
711 unsigned int access, struct unicode_str *token, int *index )
712 {
713 token->str = NULL;
714 if (!get_path_token( name, token )) return NULL;
715 if (access & KEY_WOW64_32KEY) key = find_wow64_subkey( key, token );
716 while (token->len)
717 {
718 struct key *subkey;
719 if (!(subkey = find_subkey( key, token, index )))
720 {
721 if ((key->flags & KEY_WOWSHARE) && !(access & KEY_WOW64_64KEY))
722 {
723 /* try in the 64-bit parent */
724 key = key->parent;
725 subkey = find_subkey( key, token, index );
726 }
727 }
728 if (!subkey) break;
729 key = subkey;
730 get_path_token( name, token );
731 if (!token->len) break;
732 if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, token );
733 if (!(key = follow_symlink( key, 0 )))
734 {
735 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
736 return NULL;
737 }
738 }
739 return key;
740 }
741
742 /* open a subkey */
743 static struct key *open_key( struct key *key, const struct unicode_str *name, unsigned int access,
744 unsigned int attributes )
745 {
746 int index;
747 struct unicode_str token;
748
749 if (!(key = open_key_prefix( key, name, access, &token, &index ))) return NULL;
750
751 if (token.len)
752 {
753 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
754 return NULL;
755 }
756 if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
757 if (!(attributes & OBJ_OPENLINK) && !(key = follow_symlink( key, 0 )))
758 {
759 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
760 return NULL;
761 }
762 if (debug_level > 1) dump_operation( key, NULL, "Open" );
763 grab_object( key );
764 return key;
765 }
766
767 /* create a subkey */
768 static struct key *create_key( struct key *key, const struct unicode_str *name,
769 const struct unicode_str *class, unsigned int options,
770 unsigned int access, unsigned int attributes,
771 const struct security_descriptor *sd, int *created )
772 {
773 int index;
774 struct unicode_str token, next;
775
776 *created = 0;
777 if (!(key = open_key_prefix( key, name, access, &token, &index ))) return NULL;
778
779 if (!token.len) /* the key already exists */
780 {
781 if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
782 if (options & REG_OPTION_CREATE_LINK)
783 {
784 set_error( STATUS_OBJECT_NAME_COLLISION );
785 return NULL;
786 }
787 if (!(attributes & OBJ_OPENLINK) && !(key = follow_symlink( key, 0 )))
788 {
789 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
790 return NULL;
791 }
792 if (debug_level > 1) dump_operation( key, NULL, "Open" );
793 grab_object( key );
794 return key;
795 }
796
797 /* token must be the last path component at this point */
798 next = token;
799 get_path_token( name, &next );
800 if (next.len)
801 {
802 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
803 return NULL;
804 }
805
806 if ((key->flags & KEY_VOLATILE) && !(options & REG_OPTION_VOLATILE))
807 {
808 set_error( STATUS_CHILD_MUST_BE_VOLATILE );
809 return NULL;
810 }
811 *created = 1;
812 make_dirty( key );
813 if (!(key = alloc_subkey( key, &token, index, current_time ))) return NULL;
814
815 if (options & REG_OPTION_CREATE_LINK) key->flags |= KEY_SYMLINK;
816 if (options & REG_OPTION_VOLATILE) key->flags |= KEY_VOLATILE;
817 else key->flags |= KEY_DIRTY;
818
819 if (sd) default_set_sd( &key->obj, sd, OWNER_SECURITY_INFORMATION | GROUP_SECURITY_INFORMATION |
820 DACL_SECURITY_INFORMATION | SACL_SECURITY_INFORMATION );
821
822 if (debug_level > 1) dump_operation( key, NULL, "Create" );
823 if (class && class->len)
824 {
825 key->classlen = class->len;
826 free(key->class);
827 if (!(key->class = memdup( class->str, key->classlen ))) key->classlen = 0;
828 }
829 touch_key( key->parent, REG_NOTIFY_CHANGE_NAME );
830 grab_object( key );
831 return key;
832 }
833
834 /* recursively create a subkey (for internal use only) */
835 static struct key *create_key_recursive( struct key *key, const struct unicode_str *name, timeout_t modif )
836 {
837 struct key *base;
838 int index;
839 struct unicode_str token;
840
841 token.str = NULL;
842 if (!get_path_token( name, &token )) return NULL;
843 while (token.len)
844 {
845 struct key *subkey;
846 if (!(subkey = find_subkey( key, &token, &index ))) break;
847 key = subkey;
848 if (!(key = follow_symlink( key, 0 )))
849 {
850 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
851 return NULL;
852 }
853 get_path_token( name, &token );
854 }
855
856 if (token.len)
857 {
858 if (!(key = alloc_subkey( key, &token, index, modif ))) return NULL;
859 base = key;
860 for (;;)
861 {
862 get_path_token( name, &token );
863 if (!token.len) break;
864 /* we know the index is always 0 in a new key */
865 if (!(key = alloc_subkey( key, &token, 0, modif )))
866 {
867 free_subkey( base, index );
868 return NULL;
869 }
870 }
871 }
872
873 grab_object( key );
874 return key;
875 }
876
877 /* query information about a key or a subkey */
878 static void enum_key( const struct key *key, int index, int info_class,
879 struct enum_key_reply *reply )
880 {
881 static const WCHAR backslash[] = { '\\' };
882 int i;
883 data_size_t len, namelen, classlen;
884 data_size_t max_subkey = 0, max_class = 0;
885 data_size_t max_value = 0, max_data = 0;
886 const struct key *k;
887 char *data;
888
889 if (index != -1) /* -1 means use the specified key directly */
890 {
891 if ((index < 0) || (index > key->last_subkey))
892 {
893 set_error( STATUS_NO_MORE_ENTRIES );
894 return;
895 }
896 key = key->subkeys[index];
897 }
898
899 namelen = key->namelen;
900 classlen = key->classlen;
901
902 switch(info_class)
903 {
904 case KeyNameInformation:
905 namelen = 0;
906 for (k = key; k != root_key; k = k->parent)
907 namelen += k->namelen + sizeof(backslash);
908 if (!namelen) return;
909 namelen += sizeof(root_name) - sizeof(backslash);
910 /* fall through */
911 case KeyBasicInformation:
912 classlen = 0; /* only return the name */
913 /* fall through */
914 case KeyNodeInformation:
915 reply->max_subkey = 0;
916 reply->max_class = 0;
917 reply->max_value = 0;
918 reply->max_data = 0;
919 break;
920 case KeyFullInformation:
921 case KeyCachedInformation:
922 for (i = 0; i <= key->last_subkey; i++)
923 {
924 if (key->subkeys[i]->namelen > max_subkey) max_subkey = key->subkeys[i]->namelen;
925 if (key->subkeys[i]->classlen > max_class) max_class = key->subkeys[i]->classlen;
926 }
927 for (i = 0; i <= key->last_value; i++)
928 {
929 if (key->values[i].namelen > max_value) max_value = key->values[i].namelen;
930 if (key->values[i].len > max_data) max_data = key->values[i].len;
931 }
932 reply->max_subkey = max_subkey;
933 reply->max_class = max_class;
934 reply->max_value = max_value;
935 reply->max_data = max_data;
936 reply->namelen = namelen;
937 if (info_class == KeyCachedInformation)
938 classlen = 0; /* don't return any data, only its size */
939 namelen = 0; /* don't return name */
940 break;
941 default:
942 set_error( STATUS_INVALID_PARAMETER );
943 return;
944 }
945 reply->subkeys = key->last_subkey + 1;
946 reply->values = key->last_value + 1;
947 reply->modif = key->modif;
948 reply->total = namelen + classlen;
949
950 len = min( reply->total, get_reply_max_size() );
951 if (len && (data = set_reply_data_size( len )))
952 {
953 if (len > namelen)
954 {
955 reply->namelen = namelen;
956 memcpy( data, key->name, namelen );
957 memcpy( data + namelen, key->class, len - namelen );
958 }
959 else if (info_class == KeyNameInformation)
960 {
961 data_size_t pos = namelen;
962 reply->namelen = namelen;
963 for (k = key; k != root_key; k = k->parent)
964 {
965 pos -= k->namelen;
966 if (pos < len) memcpy( data + pos, k->name,
967 min( k->namelen, len - pos ) );
968 pos -= sizeof(backslash);
969 if (pos < len) memcpy( data + pos, backslash,
970 min( sizeof(backslash), len - pos ) );
971 }
972 memcpy( data, root_name, min( sizeof(root_name) - sizeof(backslash), len ) );
973 }
974 else
975 {
976 reply->namelen = len;
977 memcpy( data, key->name, len );
978 }
979 }
980 if (debug_level > 1) dump_operation( key, NULL, "Enum" );
981 }
982
983 /* delete a key and its values */
984 static int delete_key( struct key *key, int recurse )
985 {
986 int index;
987 struct key *parent = key->parent;
988
989 /* must find parent and index */
990 if (key == root_key)
991 {
992 set_error( STATUS_ACCESS_DENIED );
993 return -1;
994 }
995 assert( parent );
996
997 while (recurse && (key->last_subkey>=0))
998 if (0 > delete_key(key->subkeys[key->last_subkey], 1))
999 return -1;
1000
1001 for (index = 0; index <= parent->last_subkey; index++)
1002 if (parent->subkeys[index] == key) break;
1003 assert( index <= parent->last_subkey );
1004
1005 /* we can only delete a key that has no subkeys */
1006 if (key->last_subkey >= 0)
1007 {
1008 set_error( STATUS_ACCESS_DENIED );
1009 return -1;
1010 }
1011
1012 if (debug_level > 1) dump_operation( key, NULL, "Delete" );
1013 free_subkey( parent, index );
1014 touch_key( parent, REG_NOTIFY_CHANGE_NAME );
1015 return 0;
1016 }
1017
1018 /* try to grow the array of values; return 1 if OK, 0 on error */
1019 static int grow_values( struct key *key )
1020 {
1021 struct key_value *new_val;
1022 int nb_values;
1023
1024 if (key->nb_values)
1025 {
1026 nb_values = key->nb_values + (key->nb_values / 2); /* grow by 50% */
1027 if (!(new_val = realloc( key->values, nb_values * sizeof(*new_val) )))
1028 {
1029 set_error( STATUS_NO_MEMORY );
1030 return 0;
1031 }
1032 }
1033 else
1034 {
1035 nb_values = MIN_VALUES;
1036 if (!(new_val = mem_alloc( nb_values * sizeof(*new_val) ))) return 0;
1037 }
1038 key->values = new_val;
1039 key->nb_values = nb_values;
1040 return 1;
1041 }
1042
1043 /* find the named value of a given key and return its index in the array */
1044 static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index )
1045 {
1046 int i, min, max, res;
1047 data_size_t len;
1048
1049 min = 0;
1050 max = key->last_value;
1051 while (min <= max)
1052 {
1053 i = (min + max) / 2;
1054 len = min( key->values[i].namelen, name->len );
1055 res = memicmp_strW( key->values[i].name, name->str, len );
1056 if (!res) res = key->values[i].namelen - name->len;
1057 if (!res)
1058 {
1059 *index = i;
1060 return &key->values[i];
1061 }
1062 if (res > 0) max = i - 1;
1063 else min = i + 1;
1064 }
1065 *index = min; /* this is where we should insert it */
1066 return NULL;
1067 }
1068
1069 /* insert a new value; the index must have been returned by find_value */
1070 static struct key_value *insert_value( struct key *key, const struct unicode_str *name, int index )
1071 {
1072 struct key_value *value;
1073 WCHAR *new_name = NULL;
1074 int i;
1075
1076 if (name->len > MAX_VALUE_LEN * sizeof(WCHAR))
1077 {
1078 set_error( STATUS_NAME_TOO_LONG );
1079 return NULL;
1080 }
1081 if (key->last_value + 1 == key->nb_values)
1082 {
1083 if (!grow_values( key )) return NULL;
1084 }
1085 if (name->len && !(new_name = memdup( name->str, name->len ))) return NULL;
1086 for (i = ++key->last_value; i > index; i--) key->values[i] = key->values[i - 1];
1087 value = &key->values[index];
1088 value->name = new_name;
1089 value->namelen = name->len;
1090 value->len = 0;
1091 value->data = NULL;
1092 return value;
1093 }
1094
1095 /* set a key value */
1096 static void set_value( struct key *key, const struct unicode_str *name,
1097 int type, const void *data, data_size_t len )
1098 {
1099 struct key_value *value;
1100 void *ptr = NULL;
1101 int index;
1102
1103 if ((value = find_value( key, name, &index )))
1104 {
1105 /* check if the new value is identical to the existing one */
1106 if (value->type == type && value->len == len &&
1107 value->data && !memcmp( value->data, data, len ))
1108 {
1109 if (debug_level > 1) dump_operation( key, value, "Skip setting" );
1110 return;
1111 }
1112 }
1113
1114 if (key->flags & KEY_SYMLINK)
1115 {
1116 if (type != REG_LINK || name->len != symlink_str.len ||
1117 memicmp_strW( name->str, symlink_str.str, name->len ))
1118 {
1119 set_error( STATUS_ACCESS_DENIED );
1120 return;
1121 }
1122 }
1123
1124 if (len && !(ptr = memdup( data, len ))) return;
1125
1126 if (!value)
1127 {
1128 if (!(value = insert_value( key, name, index )))
1129 {
1130 free( ptr );
1131 return;
1132 }
1133 }
1134 else free( value->data ); /* already existing, free previous data */
1135
1136 value->type = type;
1137 value->len = len;
1138 value->data = ptr;
1139 touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1140 if (debug_level > 1) dump_operation( key, value, "Set" );
1141 }
1142
1143 /* get a key value */
1144 static void get_value( struct key *key, const struct unicode_str *name, int *type, data_size_t *len )
1145 {
1146 struct key_value *value;
1147 int index;
1148
1149 if ((value = find_value( key, name, &index )))
1150 {
1151 *type = value->type;
1152 *len = value->len;
1153 if (value->data) set_reply_data( value->data, min( value->len, get_reply_max_size() ));
1154 if (debug_level > 1) dump_operation( key, value, "Get" );
1155 }
1156 else
1157 {
1158 *type = -1;
1159 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1160 }
1161 }
1162
1163 /* enumerate a key value */
1164 static void enum_value( struct key *key, int i, int info_class, struct enum_key_value_reply *reply )
1165 {
1166 struct key_value *value;
1167
1168 if (i < 0 || i > key->last_value) set_error( STATUS_NO_MORE_ENTRIES );
1169 else
1170 {
1171 void *data;
1172 data_size_t namelen, maxlen;
1173
1174 value = &key->values[i];
1175 reply->type = value->type;
1176 namelen = value->namelen;
1177
1178 switch(info_class)
1179 {
1180 case KeyValueBasicInformation:
1181 reply->total = namelen;
1182 break;
1183 case KeyValueFullInformation:
1184 reply->total = namelen + value->len;
1185 break;
1186 case KeyValuePartialInformation:
1187 reply->total = value->len;
1188 namelen = 0;
1189 break;
1190 default:
1191 set_error( STATUS_INVALID_PARAMETER );
1192 return;
1193 }
1194
1195 maxlen = min( reply->total, get_reply_max_size() );
1196 if (maxlen && ((data = set_reply_data_size( maxlen ))))
1197 {
1198 if (maxlen > namelen)
1199 {
1200 reply->namelen = namelen;
1201 memcpy( data, value->name, namelen );
1202 memcpy( (char *)data + namelen, value->data, maxlen - namelen );
1203 }
1204 else
1205 {
1206 reply->namelen = maxlen;
1207 memcpy( data, value->name, maxlen );
1208 }
1209 }
1210 if (debug_level > 1) dump_operation( key, value, "Enum" );
1211 }
1212 }
1213
1214 /* delete a value */
1215 static void delete_value( struct key *key, const struct unicode_str *name )
1216 {
1217 struct key_value *value;
1218 int i, index, nb_values;
1219
1220 if (!(value = find_value( key, name, &index )))
1221 {
1222 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1223 return;
1224 }
1225 if (debug_level > 1) dump_operation( key, value, "Delete" );
1226 free( value->name );
1227 free( value->data );
1228 for (i = index; i < key->last_value; i++) key->values[i] = key->values[i + 1];
1229 key->last_value--;
1230 touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1231
1232 /* try to shrink the array */
1233 nb_values = key->nb_values;
1234 if (nb_values > MIN_VALUES && key->last_value < nb_values / 2)
1235 {
1236 struct key_value *new_val;
1237 nb_values -= nb_values / 3; /* shrink by 33% */
1238 if (nb_values < MIN_VALUES) nb_values = MIN_VALUES;
1239 if (!(new_val = realloc( key->values, nb_values * sizeof(*new_val) ))) return;
1240 key->values = new_val;
1241 key->nb_values = nb_values;
1242 }
1243 }
1244
1245 /* get the registry key corresponding to an hkey handle */
1246 static struct key *get_hkey_obj( obj_handle_t hkey, unsigned int access )
1247 {
1248 struct key *key = (struct key *)get_handle_obj( current->process, hkey, access, &key_ops );
1249
1250 if (key && key->flags & KEY_DELETED)
1251 {
1252 set_error( STATUS_KEY_DELETED );
1253 release_object( key );
1254 key = NULL;
1255 }
1256 return key;
1257 }
1258
1259 /* get the registry key corresponding to a parent key handle */
1260 static inline struct key *get_parent_hkey_obj( obj_handle_t hkey )
1261 {
1262 if (!hkey) return (struct key *)grab_object( root_key );
1263 return get_hkey_obj( hkey, 0 );
1264 }
1265
1266 /* read a line from the input file */
1267 static int read_next_line( struct file_load_info *info )
1268 {
1269 char *newbuf;
1270 int newlen, pos = 0;
1271
1272 info->line++;
1273 for (;;)
1274 {
1275 if (!fgets( info->buffer + pos, info->len - pos, info->file ))
1276 return (pos != 0); /* EOF */
1277 pos = strlen(info->buffer);
1278 if (info->buffer[pos-1] == '\n')
1279 {
1280 /* got a full line */
1281 info->buffer[--pos] = 0;
1282 if (pos > 0 && info->buffer[pos-1] == '\r') info->buffer[pos-1] = 0;
1283 return 1;
1284 }
1285 if (pos < info->len - 1) return 1; /* EOF but something was read */
1286
1287 /* need to enlarge the buffer */
1288 newlen = info->len + info->len / 2;
1289 if (!(newbuf = realloc( info->buffer, newlen )))
1290 {
1291 set_error( STATUS_NO_MEMORY );
1292 return -1;
1293 }
1294 info->buffer = newbuf;
1295 info->len = newlen;
1296 }
1297 }
1298
1299 /* make sure the temp buffer holds enough space */
1300 static int get_file_tmp_space( struct file_load_info *info, size_t size )
1301 {
1302 WCHAR *tmp;
1303 if (info->tmplen >= size) return 1;
1304 if (!(tmp = realloc( info->tmp, size )))
1305 {
1306 set_error( STATUS_NO_MEMORY );
1307 return 0;
1308 }
1309 info->tmp = tmp;
1310 info->tmplen = size;
1311 return 1;
1312 }
1313
1314 /* report an error while loading an input file */
1315 static void file_read_error( const char *err, struct file_load_info *info )
1316 {
1317 if (info->filename)
1318 fprintf( stderr, "%s:%d: %s '%s'\n", info->filename, info->line, err, info->buffer );
1319 else
1320 fprintf( stderr, "<fd>:%d: %s '%s'\n", info->line, err, info->buffer );
1321 }
1322
1323 /* convert a data type tag to a value type */
1324 static int get_data_type( const char *buffer, int *type, int *parse_type )
1325 {
1326 struct data_type { const char *tag; int len; int type; int parse_type; };
1327
1328 static const struct data_type data_types[] =
1329 { /* actual type */ /* type to assume for parsing */
1330 { "\"", 1, REG_SZ, REG_SZ },
1331 { "str:\"", 5, REG_SZ, REG_SZ },
1332 { "str(2):\"", 8, REG_EXPAND_SZ, REG_SZ },
1333 { "str(7):\"", 8, REG_MULTI_SZ, REG_SZ },
1334 { "hex:", 4, REG_BINARY, REG_BINARY },
1335 { "dword:", 6, REG_DWORD, REG_DWORD },
1336 { "hex(", 4, -1, REG_BINARY },
1337 { NULL, 0, 0, 0 }
1338 };
1339
1340 const struct data_type *ptr;
1341 char *end;
1342
1343 for (ptr = data_types; ptr->tag; ptr++)
1344 {
1345 if (strncmp( ptr->tag, buffer, ptr->len )) continue;
1346 *parse_type = ptr->parse_type;
1347 if ((*type = ptr->type) != -1) return ptr->len;
1348 /* "hex(xx):" is special */
1349 *type = (int)strtoul( buffer + 4, &end, 16 );
1350 if ((end <= buffer) || strncmp( end, "):", 2 )) return 0;
1351 return end + 2 - buffer;
1352 }
1353 return 0;
1354 }
1355
1356 /* load and create a key from the input file */
1357 static struct key *load_key( struct key *base, const char *buffer, int prefix_len,
1358 struct file_load_info *info, timeout_t *modif )
1359 {
1360 WCHAR *p;
1361 struct unicode_str name;
1362 int res;
1363 unsigned int mod;
1364 data_size_t len;
1365
1366 if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1367
1368 len = info->tmplen;
1369 if ((res = parse_strW( info->tmp, &len, buffer, ']' )) == -1)
1370 {
1371 file_read_error( "Malformed key", info );
1372 return NULL;
1373 }
1374 if (sscanf( buffer + res, " %u", &mod ) == 1)
1375 *modif = (timeout_t)mod * TICKS_PER_SEC + ticks_1601_to_1970;
1376 else
1377 *modif = current_time;
1378
1379 p = info->tmp;
1380 while (prefix_len && *p) { if (*p++ == '\\') prefix_len--; }
1381
1382 if (!*p)
1383 {
1384 if (prefix_len > 1)
1385 {
1386 file_read_error( "Malformed key", info );
1387 return NULL;
1388 }
1389 /* empty key name, return base key */
1390 return (struct key *)grab_object( base );
1391 }
1392 name.str = p;
1393 name.len = len - (p - info->tmp + 1) * sizeof(WCHAR);
1394 return create_key_recursive( base, &name, 0 );
1395 }
1396
1397 /* update the modification time of a key (and its parents) after it has been loaded from a file */
1398 static void update_key_time( struct key *key, timeout_t modif )
1399 {
1400 while (key && !key->modif)
1401 {
1402 key->modif = modif;
1403 key = key->parent;
1404 }
1405 }
1406
1407 /* load a global option from the input file */
1408 static int load_global_option( const char *buffer, struct file_load_info *info )
1409 {
1410 const char *p;
1411
1412 if (!strncmp( buffer, "#arch=", 6 ))
1413 {
1414 enum prefix_type type;
1415 p = buffer + 6;
1416 if (!strcmp( p, "win32" )) type = PREFIX_32BIT;
1417 else if (!strcmp( p, "win64" )) type = PREFIX_64BIT;
1418 else
1419 {
1420 file_read_error( "Unknown architecture", info );
1421 set_error( STATUS_NOT_REGISTRY_FILE );
1422 return 0;
1423 }
1424 if (prefix_type == PREFIX_UNKNOWN) prefix_type = type;
1425 else if (type != prefix_type)
1426 {
1427 file_read_error( "Mismatched architecture", info );
1428 set_error( STATUS_NOT_REGISTRY_FILE );
1429 return 0;
1430 }
1431 }
1432 /* ignore unknown options */
1433 return 1;
1434 }
1435
1436 /* load a key option from the input file */
1437 static int load_key_option( struct key *key, const char *buffer, struct file_load_info *info )
1438 {
1439 const char *p;
1440 data_size_t len;
1441
1442 if (!strncmp( buffer, "#time=", 6 ))
1443 {
1444 timeout_t modif = 0;
1445 for (p = buffer + 6; *p; p++)
1446 {
1447 if (*p >= '0' && *p <= '9') modif = (modif << 4) | (*p - '0');
1448 else if (*p >= 'A' && *p <= 'F') modif = (modif << 4) | (*p - 'A' + 10);
1449 else if (*p >= 'a' && *p <= 'f') modif = (modif << 4) | (*p - 'a' + 10);
1450 else break;
1451 }
1452 update_key_time( key, modif );
1453 }
1454 if (!strncmp( buffer, "#class=", 7 ))
1455 {
1456 p = buffer + 7;
1457 if (*p++ != '"') return 0;
1458 if (!get_file_tmp_space( info, strlen(p) * sizeof(WCHAR) )) return 0;
1459 len = info->tmplen;
1460 if (parse_strW( info->tmp, &len, p, '\"' ) == -1) return 0;
1461 free( key->class );
1462 if (!(key->class = memdup( info->tmp, len ))) len = 0;
1463 key->classlen = len;
1464 }
1465 if (!strncmp( buffer, "#link", 5 )) key->flags |= KEY_SYMLINK;
1466 /* ignore unknown options */
1467 return 1;
1468 }
1469
1470 /* parse a comma-separated list of hex digits */
1471 static int parse_hex( unsigned char *dest, data_size_t *len, const char *buffer )
1472 {
1473 const char *p = buffer;
1474 data_size_t count = 0;
1475 char *end;
1476
1477 while (isxdigit(*p))
1478 {
1479 unsigned int val = strtoul( p, &end, 16 );
1480 if (end == p || val > 0xff) return -1;
1481 if (count++ >= *len) return -1; /* dest buffer overflow */
1482 *dest++ = val;
1483 p = end;
1484 while (isspace(*p)) p++;
1485 if (*p == ',') p++;
1486 while (isspace(*p)) p++;
1487 }
1488 *len = count;
1489 return p - buffer;
1490 }
1491
1492 /* parse a value name and create the corresponding value */
1493 static struct key_value *parse_value_name( struct key *key, const char *buffer, data_size_t *len,
1494 struct file_load_info *info )
1495 {
1496 struct key_value *value;
1497 struct unicode_str name;
1498 int index;
1499
1500 if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1501 name.str = info->tmp;
1502 name.len = info->tmplen;
1503 if (buffer[0] == '@')
1504 {
1505 name.len = 0;
1506 *len = 1;
1507 }
1508 else
1509 {
1510 int r = parse_strW( info->tmp, &name.len, buffer + 1, '\"' );
1511 if (r == -1) goto error;
1512 *len = r + 1; /* for initial quote */
1513 name.len -= sizeof(WCHAR); /* terminating null */
1514 }
1515 while (isspace(buffer[*len])) (*len)++;
1516 if (buffer[*len] != '=') goto error;
1517 (*len)++;
1518 while (isspace(buffer[*len])) (*len)++;
1519 if (!(value = find_value( key, &name, &index ))) value = insert_value( key, &name, index );
1520 return value;
1521
1522 error:
1523 file_read_error( "Malformed value name", info );
1524 return NULL;
1525 }
1526
1527 /* load a value from the input file */
1528 static int load_value( struct key *key, const char *buffer, struct file_load_info *info )
1529 {
1530 DWORD dw;
1531 void *ptr, *newptr;
1532 int res, type, parse_type;
1533 data_size_t maxlen, len;
1534 struct key_value *value;
1535
1536 if (!(value = parse_value_name( key, buffer, &len, info ))) return 0;
1537 if (!(res = get_data_type( buffer + len, &type, &parse_type ))) goto error;
1538 buffer += len + res;
1539
1540 switch(parse_type)
1541 {
1542 case REG_SZ:
1543 if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return 0;
1544 len = info->tmplen;
1545 if ((res = parse_strW( info->tmp, &len, buffer, '\"' )) == -1) goto error;
1546 ptr = info->tmp;
1547 break;
1548 case REG_DWORD:
1549 dw = strtoul( buffer, NULL, 16 );
1550 ptr = &dw;
1551 len = sizeof(dw);
1552 break;
1553 case REG_BINARY: /* hex digits */
1554 len = 0;
1555 for (;;)
1556 {
1557 maxlen = 1 + strlen(buffer) / 2; /* at least 2 chars for one hex byte */
1558 if (!get_file_tmp_space( info, len + maxlen )) return 0;
1559 if ((res = parse_hex( (unsigned char *)info->tmp + len, &maxlen, buffer )) == -1) goto error;
1560 len += maxlen;
1561 buffer += res;
1562 while (isspace(*buffer)) buffer++;
1563 if (!*buffer) break;
1564 if (*buffer != '\\') goto error;
1565 if (read_next_line( info) != 1) goto error;
1566 buffer = info->buffer;
1567 while (isspace(*buffer)) buffer++;
1568 }
1569 ptr = info->tmp;
1570 break;
1571 default:
1572 assert(0);
1573 ptr = NULL; /* keep compiler quiet */
1574 break;
1575 }
1576
1577 if (!len) newptr = NULL;
1578 else if (!(newptr = memdup( ptr, len ))) return 0;
1579
1580 free( value->data );
1581 value->data = newptr;
1582 value->len = len;
1583 value->type = type;
1584 return 1;
1585
1586 error:
1587 file_read_error( "Malformed value", info );
1588 free( value->data );
1589 value->data = NULL;
1590 value->len = 0;
1591 value->type = REG_NONE;
1592 return 0;
1593 }
1594
1595 /* return the length (in path elements) of name that is part of the key name */
1596 /* for instance if key is USER\foo\bar and name is foo\bar\baz, return 2 */
1597 static int get_prefix_len( struct key *key, const char *name, struct file_load_info *info )
1598 {
1599 WCHAR *p;
1600 int res;
1601 data_size_t len;
1602
1603 if (!get_file_tmp_space( info, strlen(name) * sizeof(WCHAR) )) return 0;
1604
1605 len = info->tmplen;
1606 if ((res = parse_strW( info->tmp, &len, name, ']' )) == -1)
1607 {
1608 file_read_error( "Malformed key", info );
1609 return 0;
1610 }
1611 for (p = info->tmp; *p; p++) if (*p == '\\') break;
1612 len = (p - info->tmp) * sizeof(WCHAR);
1613 for (res = 1; key != root_key; res++)
1614 {
1615 if (len == key->namelen && !memicmp_strW( info->tmp, key->name, len )) break;
1616 key = key->parent;
1617 }
1618 if (key == root_key) res = 0; /* no matching name */
1619 return res;
1620 }
1621
1622 /* load all the keys from the input file */
1623 /* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1624 static void load_keys( struct key *key, const char *filename, FILE *f, int prefix_len )
1625 {
1626 struct key *subkey = NULL;
1627 struct file_load_info info;
1628 timeout_t modif = current_time;
1629 char *p;
1630
1631 info.filename = filename;
1632 info.file = f;
1633 info.len = 4;
1634 info.tmplen = 4;
1635 info.line = 0;
1636 if (!(info.buffer = mem_alloc( info.len ))) return;
1637 if (!(info.tmp = mem_alloc( info.tmplen )))
1638 {
1639 free( info.buffer );
1640 return;
1641 }
1642
1643 if ((read_next_line( &info ) != 1) ||
1644 strcmp( info.buffer, "WINE REGISTRY Version 2" ))
1645 {
1646 set_error( STATUS_NOT_REGISTRY_FILE );
1647 goto done;
1648 }
1649
1650 while (read_next_line( &info ) == 1)
1651 {
1652 p = info.buffer;
1653 while (*p && isspace(*p)) p++;
1654 switch(*p)
1655 {
1656 case '[': /* new key */
1657 if (subkey)
1658 {
1659 update_key_time( subkey, modif );
1660 release_object( subkey );
1661 }
1662 if (prefix_len == -1) prefix_len = get_prefix_len( key, p + 1, &info );
1663 if (!(subkey = load_key( key, p + 1, prefix_len, &info, &modif )))
1664 file_read_error( "Error creating key", &info );
1665 break;
1666 case '@': /* default value */
1667 case '\"': /* value */
1668 if (subkey) load_value( subkey, p, &info );
1669 else file_read_error( "Value without key", &info );
1670 break;
1671 case '#': /* option */
1672 if (subkey) load_key_option( subkey, p, &info );
1673 else if (!load_global_option( p, &info )) goto done;
1674 break;
1675 case ';': /* comment */
1676 case 0: /* empty line */
1677 break;
1678 default:
1679 file_read_error( "Unrecognized input", &info );
1680 break;
1681 }
1682 }
1683
1684 done:
1685 if (subkey)
1686 {
1687 update_key_time( subkey, modif );
1688 release_object( subkey );
1689 }
1690 free( info.buffer );
1691 free( info.tmp );
1692 }
1693
1694 /* load a part of the registry from a file */
1695 static void load_registry( struct key *key, obj_handle_t handle )
1696 {
1697 struct file *file;
1698 int fd;
1699
1700 if (!(file = get_file_obj( current->process, handle, FILE_READ_DATA ))) return;
1701 fd = dup( get_file_unix_fd( file ) );
1702 release_object( file );
1703 if (fd != -1)
1704 {
1705 FILE *f = fdopen( fd, "r" );
1706 if (f)
1707 {
1708 load_keys( key, NULL, f, -1 );
1709 fclose( f );
1710 }
1711 else file_set_error();
1712 }
1713 }
1714
1715 /* load one of the initial registry files */
1716 static int load_init_registry_from_file( const char *filename, struct key *key )
1717 {
1718 FILE *f;
1719
1720 if ((f = fopen( filename, "r" )))
1721 {
1722 load_keys( key, filename, f, 0 );
1723 fclose( f );
1724 if (get_error() == STATUS_NOT_REGISTRY_FILE)
1725 {
1726 fprintf( stderr, "%s is not a valid registry file\n", filename );
1727 return 1;
1728 }
1729 }
1730
1731 assert( save_branch_count < MAX_SAVE_BRANCH_INFO );
1732
1733 save_branch_info[save_branch_count].path = filename;
1734 save_branch_info[save_branch_count++].key = (struct key *)grab_object( key );
1735 make_object_static( &key->obj );
1736 return (f != NULL);
1737 }
1738
1739 static WCHAR *format_user_registry_path( const SID *sid, struct unicode_str *path )
1740 {
1741 char buffer[7 + 11 + 11 + 11 * SID_MAX_SUB_AUTHORITIES], *p = buffer;
1742 unsigned int i;
1743
1744 p += sprintf( p, "User\\S-%u-%u", sid->Revision,
1745 MAKELONG( MAKEWORD( sid->IdentifierAuthority.Value[5],
1746 sid->IdentifierAuthority.Value[4] ),
1747 MAKEWORD( sid->IdentifierAuthority.Value[3],
1748 sid->IdentifierAuthority.Value[2] )));
1749 for (i = 0; i < sid->SubAuthorityCount; i++) p += sprintf( p, "-%u", sid->SubAuthority[i] );
1750 return ascii_to_unicode_str( buffer, path );
1751 }
1752
1753 /* get the cpu architectures that can be supported in the current prefix */
1754 unsigned int get_prefix_cpu_mask(void)
1755 {
1756 /* Allowed server/client/prefix combinations:
1757 *
1758 * prefix
1759 * 32 64
1760 * server +------+------+ client
1761 * | ok | fail | 32
1762 * 32 +------+------+---
1763 * | fail | fail | 64
1764 * ---+------+------+---
1765 * | ok | ok | 32
1766 * 64 +------+------+---
1767 * | fail | ok | 64
1768 * ---+------+------+---
1769 */
1770 switch (prefix_type)
1771 {
1772 case PREFIX_64BIT:
1773 /* 64-bit prefix requires 64-bit server */
1774 return sizeof(void *) > sizeof(int) ? ~0 : 0;
1775 case PREFIX_32BIT:
1776 default:
1777 return ~CPU_64BIT_MASK; /* only 32-bit cpus supported on 32-bit prefix */
1778 }
1779 }
1780
1781 /* registry initialisation */
1782 void init_registry(void)
1783 {
1784 static const WCHAR HKLM[] = { 'M','a','c','h','i','n','e' };
1785 static const WCHAR HKU_default[] = { 'U','s','e','r','\\','.','D','e','f','a','u','l','t' };
1786 static const WCHAR classes[] = {'S','o','f','t','w','a','r','e','\\',
1787 'C','l','a','s','s','e','s','\\',
1788 'W','o','w','6','4','3','2','N','o','d','e'};
1789 static const struct unicode_str root_name = { NULL, 0 };
1790 static const struct unicode_str HKLM_name = { HKLM, sizeof(HKLM) };
1791 static const struct unicode_str HKU_name = { HKU_default, sizeof(HKU_default) };
1792 static const struct unicode_str classes_name = { classes, sizeof(classes) };
1793
1794 WCHAR *current_user_path;
1795 struct unicode_str current_user_str;
1796 struct key *key, *hklm, *hkcu;
1797 char *p;
1798
1799 /* switch to the config dir */
1800
1801 if (fchdir( config_dir_fd ) == -1) fatal_error( "chdir to config dir: %s\n", strerror( errno ));
1802
1803 /* create the root key */
1804 root_key = alloc_key( &root_name, current_time );
1805 assert( root_key );
1806 make_object_static( &root_key->obj );
1807
1808 /* load system.reg into Registry\Machine */
1809
1810 if (!(hklm = create_key_recursive( root_key, &HKLM_name, current_time )))
1811 fatal_error( "could not create Machine registry key\n" );
1812
1813 if (!load_init_registry_from_file( "system.reg", hklm ))
1814 {
1815 if ((p = getenv( "WINEARCH" )) && !strcmp( p, "win32" ))
1816 prefix_type = PREFIX_32BIT;
1817 else
1818 prefix_type = sizeof(void *) > sizeof(int) ? PREFIX_64BIT : PREFIX_32BIT;
1819 }
1820 else if (prefix_type == PREFIX_UNKNOWN)
1821 prefix_type = PREFIX_32BIT;
1822
1823 /* load userdef.reg into Registry\User\.Default */
1824
1825 if (!(key = create_key_recursive( root_key, &HKU_name, current_time )))
1826 fatal_error( "could not create User\\.Default registry key\n" );
1827
1828 load_init_registry_from_file( "userdef.reg", key );
1829 release_object( key );
1830
1831 /* load user.reg into HKEY_CURRENT_USER */
1832
1833 /* FIXME: match default user in token.c. should get from process token instead */
1834 current_user_path = format_user_registry_path( security_local_user_sid, &current_user_str );
1835 if (!current_user_path ||
1836 !(hkcu = create_key_recursive( root_key, &current_user_str, current_time )))
1837 fatal_error( "could not create HKEY_CURRENT_USER registry key\n" );
1838 free( current_user_path );
1839 load_init_registry_from_file( "user.reg", hkcu );
1840
1841 /* set the shared flag on Software\Classes\Wow6432Node */
1842 if (prefix_type == PREFIX_64BIT)
1843 {
1844 if ((key = create_key_recursive( hklm, &classes_name, current_time )))
1845 {
1846 key->flags |= KEY_WOWSHARE;
1847 release_object( key );
1848 }
1849 /* FIXME: handle HKCU too */
1850 }
1851
1852 release_object( hklm );
1853 release_object( hkcu );
1854
1855 /* start the periodic save timer */
1856 set_periodic_save_timer();
1857
1858 /* create windows directories */
1859
1860 if (!mkdir( "drive_c/windows", 0777 ))
1861 {
1862 mkdir( "drive_c/windows/system32", 0777 );
1863 if (prefix_type == PREFIX_64BIT) mkdir( "drive_c/windows/syswow64", 0777 );
1864 }
1865
1866 /* go back to the server dir */
1867 if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
1868 }
1869
1870 /* save a registry branch to a file */
1871 static void save_all_subkeys( struct key *key, FILE *f )
1872 {
1873 fprintf( f, "WINE REGISTRY Version 2\n" );
1874 fprintf( f, ";; All keys relative to " );
1875 dump_path( key, NULL, f );
1876 fprintf( f, "\n" );
1877 switch (prefix_type)
1878 {
1879 case PREFIX_32BIT:
1880 fprintf( f, "\n#arch=win32\n" );
1881 break;
1882 case PREFIX_64BIT:
1883 fprintf( f, "\n#arch=win64\n" );
1884 break;
1885 default:
1886 break;
1887 }
1888 save_subkeys( key, key, f );
1889 }
1890
1891 /* save a registry branch to a file handle */
1892 static void save_registry( struct key *key, obj_handle_t handle )
1893 {
1894 struct file *file;
1895 int fd;
1896
1897 if (!(file = get_file_obj( current->process, handle, FILE_WRITE_DATA ))) return;
1898 fd = dup( get_file_unix_fd( file ) );
1899 release_object( file );
1900 if (fd != -1)
1901 {
1902 FILE *f = fdopen( fd, "w" );
1903 if (f)
1904 {
1905 save_all_subkeys( key, f );
1906 if (fclose( f )) file_set_error();
1907 }
1908 else
1909 {
1910 file_set_error();
1911 close( fd );
1912 }
1913 }
1914 }
1915
1916 /* save a registry branch to a file */
1917 static int save_branch( struct key *key, const char *path )
1918 {
1919 struct stat st;
1920 char *p, *tmp = NULL;
1921 int fd, count = 0, ret = 0;
1922 FILE *f;
1923
1924 if (!(key->flags & KEY_DIRTY))
1925 {
1926 if (debug_level > 1) dump_operation( key, NULL, "Not saving clean" );
1927 return 1;
1928 }
1929
1930 /* test the file type */
1931
1932 if ((fd = open( path, O_WRONLY )) != -1)
1933 {
1934 /* if file is not a regular file or has multiple links or is accessed
1935 * via symbolic links, write directly into it; otherwise use a temp file */
1936 if (!lstat( path, &st ) && (!S_ISREG(st.st_mode) || st.st_nlink > 1))
1937 {
1938 ftruncate( fd, 0 );
1939 goto save;
1940 }
1941 close( fd );
1942 }
1943
1944 /* create a temp file in the same directory */
1945
1946 if (!(tmp = malloc( strlen(path) + 20 ))) goto done;
1947 strcpy( tmp, path );
1948 if ((p = strrchr( tmp, '/' ))) p++;
1949 else p = tmp;
1950 for (;;)
1951 {
1952 sprintf( p, "reg%lx%04x.tmp", (long) getpid(), count++ );
1953 if ((fd = open( tmp, O_CREAT | O_EXCL | O_WRONLY, 0666 )) != -1) break;
1954 if (errno != EEXIST) goto done;
1955 close( fd );
1956 }
1957
1958 /* now save to it */
1959
1960 save:
1961 if (!(f = fdopen( fd, "w" )))
1962 {
1963 if (tmp) unlink( tmp );
1964 close( fd );
1965 goto done;
1966 }
1967
1968 if (debug_level > 1)
1969 {
1970 fprintf( stderr, "%s: ", path );
1971 dump_operation( key, NULL, "saving" );
1972 }
1973
1974 save_all_subkeys( key, f );
1975 ret = !fclose(f);
1976
1977 if (tmp)
1978 {
1979 /* if successfully written, rename to final name */
1980 if (ret) ret = !rename( tmp, path );
1981 if (!ret) unlink( tmp );
1982 }
1983
1984 done:
1985 free( tmp );
1986 if (ret) make_clean( key );
1987 return ret;
1988 }
1989
1990 /* periodic saving of the registry */
1991 static void periodic_save( void *arg )
1992 {
1993 int i;
1994
1995 if (fchdir( config_dir_fd ) == -1) return;
1996 save_timeout_user = NULL;
1997 for (i = 0; i < save_branch_count; i++)
1998 save_branch( save_branch_info[i].key, save_branch_info[i].path );
1999 if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2000 set_periodic_save_timer();
2001 }
2002
2003 /* start the periodic save timer */
2004 static void set_periodic_save_timer(void)
2005 {
2006 if (save_timeout_user) remove_timeout_user( save_timeout_user );
2007 save_timeout_user = add_timeout_user( save_period, periodic_save, NULL );
2008 }
2009
2010 /* save the modified registry branches to disk */
2011 void flush_registry(void)
2012 {
2013 int i;
2014
2015 if (fchdir( config_dir_fd ) == -1) return;
2016 for (i = 0; i < save_branch_count; i++)
2017 {
2018 if (!save_branch( save_branch_info[i].key, save_branch_info[i].path ))
2019 {
2020 fprintf( stderr, "wineserver: could not save registry branch to %s",
2021 save_branch_info[i].path );
2022 perror( " " );
2023 }
2024 }
2025 if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2026 }
2027
2028 /* determine if the thread is wow64 (32-bit client running on 64-bit prefix) */
2029 static int is_wow64_thread( struct thread *thread )
2030 {
2031 return (prefix_type == PREFIX_64BIT && !(CPU_FLAG(thread->process->cpu) & CPU_64BIT_MASK));
2032 }
2033
2034
2035 /* create a registry key */
2036 DECL_HANDLER(create_key)
2037 {
2038 struct key *key = NULL, *parent;
2039 struct unicode_str name, class;
2040 unsigned int access = req->access;
2041 const struct security_descriptor *sd;
2042 const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2043
2044 if (!objattr) return;
2045
2046 if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;
2047
2048 class.str = get_req_data_after_objattr( objattr, &class.len );
2049 class.len = (class.len / sizeof(WCHAR)) * sizeof(WCHAR);
2050
2051 if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2052 !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2053 {
2054 name.str += ARRAY_SIZE( root_name );
2055 name.len -= sizeof(root_name);
2056 }
2057
2058 /* NOTE: no access rights are required from the parent handle to create a key */
2059 if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2060 {
2061 if ((key = create_key( parent, &name, &class, req->options, access,
2062 objattr->attributes, sd, &reply->created )))
2063 {
2064 reply->hkey = alloc_handle( current->process, key, access, objattr->attributes );
2065 release_object( key );
2066 }
2067 release_object( parent );
2068 }
2069 }
2070
2071 /* open a registry key */
2072 DECL_HANDLER(open_key)
2073 {
2074 struct key *key, *parent;
2075 struct unicode_str name;
2076 unsigned int access = req->access;
2077
2078 if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;
2079
2080 reply->hkey = 0;
2081 /* NOTE: no access rights are required to open the parent key, only the child key */
2082 if ((parent = get_parent_hkey_obj( req->parent )))
2083 {
2084 get_req_path( &name, !req->parent );
2085 if ((key = open_key( parent, &name, access, req->attributes )))
2086 {
2087 reply->hkey = alloc_handle( current->process, key, access, req->attributes );
2088 release_object( key );
2089 }
2090 release_object( parent );
2091 }
2092 }
2093
2094 /* delete a registry key */
2095 DECL_HANDLER(delete_key)
2096 {
2097 struct key *key;
2098
2099 if ((key = get_hkey_obj( req->hkey, DELETE )))
2100 {
2101 delete_key( key, 0);
2102 release_object( key );
2103 }
2104 }
2105
2106 /* flush a registry key */
2107 DECL_HANDLER(flush_key)
2108 {
2109 struct key *key = get_hkey_obj( req->hkey, 0 );
2110 if (key)
2111 {
2112 /* we don't need to do anything here with the current implementation */
2113 release_object( key );
2114 }
2115 }
2116
2117 /* enumerate registry subkeys */
2118 DECL_HANDLER(enum_key)
2119 {
2120 struct key *key;
2121
2122 if ((key = get_hkey_obj( req->hkey,
2123 req->index == -1 ? KEY_QUERY_VALUE : KEY_ENUMERATE_SUB_KEYS )))
2124 {
2125 enum_key( key, req->index, req->info_class, reply );
2126 release_object( key );
2127 }
2128 }
2129
2130 /* set a value of a registry key */
2131 DECL_HANDLER(set_key_value)
2132 {
2133 struct key *key;
2134 struct unicode_str name;
2135
2136 if (req->namelen > get_req_data_size())
2137 {
2138 set_error( STATUS_INVALID_PARAMETER );
2139 return;
2140 }
2141 name.str = get_req_data();
2142 name.len = (req->namelen / sizeof(WCHAR)) * sizeof(WCHAR);
2143
2144 if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
2145 {
2146 data_size_t datalen = get_req_data_size() - req->namelen;
2147 const char *data = (const char *)get_req_data() + req->namelen;
2148
2149 set_value( key, &name, req->type, data, datalen );
2150 release_object( key );
2151 }
2152 }
2153
2154 /* retrieve the value of a registry key */
2155 DECL_HANDLER(get_key_value)
2156 {
2157 struct key *key;
2158 struct unicode_str name = get_req_unicode_str();
2159
2160 reply->total = 0;
2161 if ((key = get_hkey_obj( req->hkey, KEY_QUERY_VALUE )))
2162 {
2163 get_value( key, &name, &reply->type, &reply->total );
2164 release_object( key );
2165 }
2166 }
2167
2168 /* enumerate the value of a registry key */
2169 DECL_HANDLER(enum_key_value)
2170 {
2171 struct key *key;
2172
2173 if ((key = get_hkey_obj( req->hkey, KEY_QUERY_VALUE )))
2174 {
2175 enum_value( key, req->index, req->info_class, reply );
2176 release_object( key );
2177 }
2178 }
2179
2180 /* delete a value of a registry key */
2181 DECL_HANDLER(delete_key_value)
2182 {
2183 struct key *key;
2184 struct unicode_str name = get_req_unicode_str();
2185
2186 if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
2187 {
2188 delete_value( key, &name );
2189 release_object( key );
2190 }
2191 }
2192
2193 /* load a registry branch from a file */
2194 DECL_HANDLER(load_registry)
2195 {
2196 struct key *key, *parent;
2197 struct unicode_str name;
2198 const struct security_descriptor *sd;
2199 const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2200
2201 if (!objattr) return;
2202
2203 if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2204 {
2205 set_error( STATUS_PRIVILEGE_NOT_HELD );
2206 return;
2207 }
2208
2209 if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2210 !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2211 {
2212 name.str += ARRAY_SIZE( root_name );
2213 name.len -= sizeof(root_name);
2214 }
2215
2216 if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2217 {
2218 int dummy;
2219 if ((key = create_key( parent, &name, NULL, 0, KEY_WOW64_64KEY, 0, sd, &dummy )))
2220 {
2221 load_registry( key, req->file );
2222 release_object( key );
2223 }
2224 release_object( parent );
2225 }
2226 }
2227
2228 DECL_HANDLER(unload_registry)
2229 {
2230 struct key *key;
2231
2232 if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2233 {
2234 set_error( STATUS_PRIVILEGE_NOT_HELD );
2235 return;
2236 }
2237
2238 if ((key = get_hkey_obj( req->hkey, 0 )))
2239 {
2240 delete_key( key, 1 ); /* FIXME */
2241 release_object( key );
2242 }
2243 }
2244
2245 /* save a registry branch to a file */
2246 DECL_HANDLER(save_registry)
2247 {
2248 struct key *key;
2249
2250 if (!thread_single_check_privilege( current, &SeBackupPrivilege ))
2251 {
2252 set_error( STATUS_PRIVILEGE_NOT_HELD );
2253 return;
2254 }
2255
2256 if ((key = get_hkey_obj( req->hkey, 0 )))
2257 {
2258 save_registry( key, req->file );
2259 release_object( key );
2260 }
2261 }
2262
2263 /* add a registry key change notification */
2264 DECL_HANDLER(set_registry_notification)
2265 {
2266 struct key *key;
2267 struct event *event;
2268 struct notify *notify;
2269
2270 key = get_hkey_obj( req->hkey, KEY_NOTIFY );
2271 if (key)
2272 {
2273 event = get_event_obj( current->process, req->event, SYNCHRONIZE );
2274 if (event)
2275 {
2276 notify = find_notify( key, current->process, req->hkey );
2277 if (notify)
2278 {
2279 if (notify->event)
2280 release_object( notify->event );
2281 grab_object( event );
2282 notify->event = event;
2283 }
2284 else
2285 {
2286 notify = mem_alloc( sizeof(*notify) );
2287 if (notify)
2288 {
2289 grab_object( event );
2290 notify->event = event;
2291 notify->subtree = req->subtree;
2292 notify->filter = req->filter;
2293 notify->hkey = req->hkey;
2294 notify->process = current->process;
2295 list_add_head( &key->notify_list, &notify->entry );
2296 }
2297 }
2298 if (notify)
2299 {
2300 reset_event( event );
2301 set_error( STATUS_PENDING );
2302 }
2303 release_object( event );
2304 }
2305 release_object( key );
2306 }
2307 }
Zebediah Figura's local tree