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 "unicode.h"
47 #include "security.h"
48
49 #include "winternl.h"
50 #include "wine/library.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 time_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
87 /* a key value */
88 struct key_value
89 {
90 WCHAR *name; /* value name */
91 unsigned short namelen; /* length of value name */
92 unsigned short type; /* value type */
93 data_size_t len; /* value data length in bytes */
94 void *data; /* pointer to value data */
95 };
96
97 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
98 #define MIN_VALUES 8 /* min. number of allocated values per key */
99
100 #define MAX_NAME_LEN MAX_PATH /* max. length of a key name */
101 #define MAX_VALUE_LEN MAX_PATH /* max. length of a value name */
102
103 /* the root of the registry tree */
104 static struct key *root_key;
105
106 static const timeout_t save_period = 30 * -TICKS_PER_SEC; /* delay between periodic saves */
107 static struct timeout_user *save_timeout_user; /* saving timer */
108
109 static void set_periodic_save_timer(void);
110
111 /* information about where to save a registry branch */
112 struct save_branch_info
113 {
114 struct key *key;
115 const char *path;
116 };
117
118 #define MAX_SAVE_BRANCH_INFO 3
119 static int save_branch_count;
120 static struct save_branch_info save_branch_info[MAX_SAVE_BRANCH_INFO];
121
122
123 /* information about a file being loaded */
124 struct file_load_info
125 {
126 const char *filename; /* input file name */
127 FILE *file; /* input file */
128 char *buffer; /* line buffer */
129 int len; /* buffer length */
130 int line; /* current input line */
131 WCHAR *tmp; /* temp buffer to use while parsing input */
132 size_t tmplen; /* length of temp buffer */
133 };
134
135
136 static void key_dump( struct object *obj, int verbose );
137 static unsigned int key_map_access( struct object *obj, unsigned int access );
138 static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle );
139 static void key_destroy( struct object *obj );
140
141 static const struct object_ops key_ops =
142 {
143 sizeof(struct key), /* size */
144 key_dump, /* dump */
145 no_get_type, /* get_type */
146 no_add_queue, /* add_queue */
147 NULL, /* remove_queue */
148 NULL, /* signaled */
149 NULL, /* satisfied */
150 no_signal, /* signal */
151 no_get_fd, /* get_fd */
152 key_map_access, /* map_access */
153 default_get_sd, /* get_sd */
154 default_set_sd, /* set_sd */
155 no_lookup_name, /* lookup_name */
156 no_open_file, /* open_file */
157 key_close_handle, /* close_handle */
158 key_destroy /* destroy */
159 };
160
161
162 /*
163 * The registry text file format v2 used by this code is similar to the one
164 * used by REGEDIT import/export functionality, with the following differences:
165 * - strings and key names can contain \x escapes for Unicode
166 * - key names use escapes too in order to support Unicode
167 * - the modification time optionally follows the key name
168 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
169 */
170
171 /* dump the full path of a key */
172 static void dump_path( const struct key *key, const struct key *base, FILE *f )
173 {
174 if (key->parent && key->parent != base)
175 {
176 dump_path( key->parent, base, f );
177 fprintf( f, "\\\\" );
178 }
179 dump_strW( key->name, key->namelen / sizeof(WCHAR), f, "[]" );
180 }
181
182 /* dump a value to a text file */
183 static void dump_value( const struct key_value *value, FILE *f )
184 {
185 unsigned int i, dw;
186 int count;
187
188 if (value->namelen)
189 {
190 fputc( '\"', f );
191 count = 1 + dump_strW( value->name, value->namelen / sizeof(WCHAR), f, "\"\"" );
192 count += fprintf( f, "\"=" );
193 }
194 else count = fprintf( f, "@=" );
195
196 switch(value->type)
197 {
198 case REG_SZ:
199 case REG_EXPAND_SZ:
200 case REG_MULTI_SZ:
201 /* only output properly terminated strings in string format */
202 if (value->len < sizeof(WCHAR)) break;
203 if (value->len % sizeof(WCHAR)) break;
204 if (((WCHAR *)value->data)[value->len / sizeof(WCHAR) - 1]) break;
205 if (value->type != REG_SZ) fprintf( f, "str(%x):", value->type );
206 fputc( '\"', f );
207 dump_strW( (WCHAR *)value->data, value->len / sizeof(WCHAR), f, "\"\"" );
208 fprintf( f, "\"\n" );
209 return;
210
211 case REG_DWORD:
212 if (value->len != sizeof(dw)) break;
213 memcpy( &dw, value->data, sizeof(dw) );
214 fprintf( f, "dword:%08x\n", dw );
215 return;
216 }
217
218 if (value->type == REG_BINARY) count += fprintf( f, "hex:" );
219 else count += fprintf( f, "hex(%x):", value->type );
220 for (i = 0; i < value->len; i++)
221 {
222 count += fprintf( f, "%02x", *((unsigned char *)value->data + i) );
223 if (i < value->len-1)
224 {
225 fputc( ',', f );
226 if (++count > 76)
227 {
228 fprintf( f, "\\\n " );
229 count = 2;
230 }
231 }
232 }
233 fputc( '\n', f );
234 }
235
236 /* save a registry and all its subkeys to a text file */
237 static void save_subkeys( const struct key *key, const struct key *base, FILE *f )
238 {
239 int i;
240
241 if (key->flags & KEY_VOLATILE) return;
242 /* save key if it has either some values or no subkeys */
243 /* keys with no values but subkeys are saved implicitly by saving the subkeys */
244 if ((key->last_value >= 0) || (key->last_subkey == -1))
245 {
246 fprintf( f, "\n[" );
247 if (key != base) dump_path( key, base, f );
248 fprintf( f, "] %ld\n", (long)key->modif );
249 for (i = 0; i <= key->last_value; i++) dump_value( &key->values[i], f );
250 }
251 for (i = 0; i <= key->last_subkey; i++) save_subkeys( key->subkeys[i], base, f );
252 }
253
254 static void dump_operation( const struct key *key, const struct key_value *value, const char *op )
255 {
256 fprintf( stderr, "%s key ", op );
257 if (key) dump_path( key, NULL, stderr );
258 else fprintf( stderr, "ERROR" );
259 if (value)
260 {
261 fprintf( stderr, " value ");
262 dump_value( value, stderr );
263 }
264 else fprintf( stderr, "\n" );
265 }
266
267 static void key_dump( struct object *obj, int verbose )
268 {
269 struct key *key = (struct key *)obj;
270 assert( obj->ops == &key_ops );
271 fprintf( stderr, "Key flags=%x ", key->flags );
272 dump_path( key, NULL, stderr );
273 fprintf( stderr, "\n" );
274 }
275
276 /* notify waiter and maybe delete the notification */
277 static void do_notification( struct key *key, struct notify *notify, int del )
278 {
279 if (notify->event)
280 {
281 set_event( notify->event );
282 release_object( notify->event );
283 notify->event = NULL;
284 }
285 if (del)
286 {
287 list_remove( ¬ify->entry );
288 free( notify );
289 }
290 }
291
292 static inline struct notify *find_notify( struct key *key, struct process *process, obj_handle_t hkey )
293 {
294 struct notify *notify;
295
296 LIST_FOR_EACH_ENTRY( notify, &key->notify_list, struct notify, entry )
297 {
298 if (notify->process == process && notify->hkey == hkey) return notify;
299 }
300 return NULL;
301 }
302
303 static unsigned int key_map_access( struct object *obj, unsigned int access )
304 {
305 if (access & GENERIC_READ) access |= KEY_READ;
306 if (access & GENERIC_WRITE) access |= KEY_WRITE;
307 if (access & GENERIC_EXECUTE) access |= KEY_EXECUTE;
308 if (access & GENERIC_ALL) access |= KEY_ALL_ACCESS;
309 return access & ~(GENERIC_READ | GENERIC_WRITE | GENERIC_EXECUTE | GENERIC_ALL);
310 }
311
312 /* close the notification associated with a handle */
313 static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle )
314 {
315 struct key * key = (struct key *) obj;
316 struct notify *notify = find_notify( key, process, handle );
317 if (notify) do_notification( key, notify, 1 );
318 return 1; /* ok to close */
319 }
320
321 static void key_destroy( struct object *obj )
322 {
323 int i;
324 struct list *ptr;
325 struct key *key = (struct key *)obj;
326 assert( obj->ops == &key_ops );
327
328 free( key->name );
329 free( key->class );
330 for (i = 0; i <= key->last_value; i++)
331 {
332 free( key->values[i].name );
333 free( key->values[i].data );
334 }
335 free( key->values );
336 for (i = 0; i <= key->last_subkey; i++)
337 {
338 key->subkeys[i]->parent = NULL;
339 release_object( key->subkeys[i] );
340 }
341 free( key->subkeys );
342 /* unconditionally notify everything waiting on this key */
343 while ((ptr = list_head( &key->notify_list )))
344 {
345 struct notify *notify = LIST_ENTRY( ptr, struct notify, entry );
346 do_notification( key, notify, 1 );
347 }
348 }
349
350 /* get the request vararg as registry path */
351 static inline void get_req_path( struct unicode_str *str, int skip_root )
352 {
353 static const WCHAR root_name[] = { '\\','R','e','g','i','s','t','r','y','\\' };
354
355 str->str = get_req_data();
356 str->len = (get_req_data_size() / sizeof(WCHAR)) * sizeof(WCHAR);
357
358 if (skip_root && str->len >= sizeof(root_name) &&
359 !memicmpW( str->str, root_name, sizeof(root_name)/sizeof(WCHAR) ))
360 {
361 str->str += sizeof(root_name)/sizeof(WCHAR);
362 str->len -= sizeof(root_name);
363 }
364 }
365
366 /* return the next token in a given path */
367 /* token->str must point inside the path, or be NULL for the first call */
368 static struct unicode_str *get_path_token( const struct unicode_str *path, struct unicode_str *token )
369 {
370 data_size_t i = 0, len = path->len / sizeof(WCHAR);
371
372 if (!token->str) /* first time */
373 {
374 /* path cannot start with a backslash */
375 if (len && path->str[0] == '\\')
376 {
377 set_error( STATUS_OBJECT_PATH_INVALID );
378 return NULL;
379 }
380 }
381 else
382 {
383 i = token->str - path->str;
384 i += token->len / sizeof(WCHAR);
385 while (i < len && path->str[i] == '\\') i++;
386 }
387 token->str = path->str + i;
388 while (i < len && path->str[i] != '\\') i++;
389 token->len = (path->str + i - token->str) * sizeof(WCHAR);
390 return token;
391 }
392
393 /* allocate a key object */
394 static struct key *alloc_key( const struct unicode_str *name, time_t modif )
395 {
396 struct key *key;
397 if ((key = alloc_object( &key_ops )))
398 {
399 key->name = NULL;
400 key->class = NULL;
401 key->namelen = name->len;
402 key->classlen = 0;
403 key->flags = 0;
404 key->last_subkey = -1;
405 key->nb_subkeys = 0;
406 key->subkeys = NULL;
407 key->nb_values = 0;
408 key->last_value = -1;
409 key->values = NULL;
410 key->modif = modif;
411 key->parent = NULL;
412 list_init( &key->notify_list );
413 if (name->len && !(key->name = memdup( name->str, name->len )))
414 {
415 release_object( key );
416 key = NULL;
417 }
418 }
419 return key;
420 }
421
422 /* mark a key and all its parents as dirty (modified) */
423 static void make_dirty( struct key *key )
424 {
425 while (key)
426 {
427 if (key->flags & (KEY_DIRTY|KEY_VOLATILE)) return; /* nothing to do */
428 key->flags |= KEY_DIRTY;
429 key = key->parent;
430 }
431 }
432
433 /* mark a key and all its subkeys as clean (not modified) */
434 static void make_clean( struct key *key )
435 {
436 int i;
437
438 if (key->flags & KEY_VOLATILE) return;
439 if (!(key->flags & KEY_DIRTY)) return;
440 key->flags &= ~KEY_DIRTY;
441 for (i = 0; i <= key->last_subkey; i++) make_clean( key->subkeys[i] );
442 }
443
444 /* go through all the notifications and send them if necessary */
445 static void check_notify( struct key *key, unsigned int change, int not_subtree )
446 {
447 struct list *ptr, *next;
448
449 LIST_FOR_EACH_SAFE( ptr, next, &key->notify_list )
450 {
451 struct notify *n = LIST_ENTRY( ptr, struct notify, entry );
452 if ( ( not_subtree || n->subtree ) && ( change & n->filter ) )
453 do_notification( key, n, 0 );
454 }
455 }
456
457 /* update key modification time */
458 static void touch_key( struct key *key, unsigned int change )
459 {
460 struct key *k;
461
462 key->modif = time(NULL);
463 make_dirty( key );
464
465 /* do notifications */
466 check_notify( key, change, 1 );
467 for ( k = key->parent; k; k = k->parent )
468 check_notify( k, change & ~REG_NOTIFY_CHANGE_LAST_SET, 0 );
469 }
470
471 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
472 static int grow_subkeys( struct key *key )
473 {
474 struct key **new_subkeys;
475 int nb_subkeys;
476
477 if (key->nb_subkeys)
478 {
479 nb_subkeys = key->nb_subkeys + (key->nb_subkeys / 2); /* grow by 50% */
480 if (!(new_subkeys = realloc( key->subkeys, nb_subkeys * sizeof(*new_subkeys) )))
481 {
482 set_error( STATUS_NO_MEMORY );
483 return 0;
484 }
485 }
486 else
487 {
488 nb_subkeys = MIN_VALUES;
489 if (!(new_subkeys = mem_alloc( nb_subkeys * sizeof(*new_subkeys) ))) return 0;
490 }
491 key->subkeys = new_subkeys;
492 key->nb_subkeys = nb_subkeys;
493 return 1;
494 }
495
496 /* allocate a subkey for a given key, and return its index */
497 static struct key *alloc_subkey( struct key *parent, const struct unicode_str *name,
498 int index, time_t modif )
499 {
500 struct key *key;
501 int i;
502
503 if (name->len > MAX_NAME_LEN * sizeof(WCHAR))
504 {
505 set_error( STATUS_NAME_TOO_LONG );
506 return NULL;
507 }
508 if (parent->last_subkey + 1 == parent->nb_subkeys)
509 {
510 /* need to grow the array */
511 if (!grow_subkeys( parent )) return NULL;
512 }
513 if ((key = alloc_key( name, modif )) != NULL)
514 {
515 key->parent = parent;
516 for (i = ++parent->last_subkey; i > index; i--)
517 parent->subkeys[i] = parent->subkeys[i-1];
518 parent->subkeys[index] = key;
519 }
520 return key;
521 }
522
523 /* free a subkey of a given key */
524 static void free_subkey( struct key *parent, int index )
525 {
526 struct key *key;
527 int i, nb_subkeys;
528
529 assert( index >= 0 );
530 assert( index <= parent->last_subkey );
531
532 key = parent->subkeys[index];
533 for (i = index; i < parent->last_subkey; i++) parent->subkeys[i] = parent->subkeys[i + 1];
534 parent->last_subkey--;
535 key->flags |= KEY_DELETED;
536 key->parent = NULL;
537 release_object( key );
538
539 /* try to shrink the array */
540 nb_subkeys = parent->nb_subkeys;
541 if (nb_subkeys > MIN_SUBKEYS && parent->last_subkey < nb_subkeys / 2)
542 {
543 struct key **new_subkeys;
544 nb_subkeys -= nb_subkeys / 3; /* shrink by 33% */
545 if (nb_subkeys < MIN_SUBKEYS) nb_subkeys = MIN_SUBKEYS;
546 if (!(new_subkeys = realloc( parent->subkeys, nb_subkeys * sizeof(*new_subkeys) ))) return;
547 parent->subkeys = new_subkeys;
548 parent->nb_subkeys = nb_subkeys;
549 }
550 }
551
552 /* find the named child of a given key and return its index */
553 static struct key *find_subkey( const struct key *key, const struct unicode_str *name, int *index )
554 {
555 int i, min, max, res;
556 data_size_t len;
557
558 min = 0;
559 max = key->last_subkey;
560 while (min <= max)
561 {
562 i = (min + max) / 2;
563 len = min( key->subkeys[i]->namelen, name->len );
564 res = memicmpW( key->subkeys[i]->name, name->str, len / sizeof(WCHAR) );
565 if (!res) res = key->subkeys[i]->namelen - name->len;
566 if (!res)
567 {
568 *index = i;
569 return key->subkeys[i];
570 }
571 if (res > 0) max = i - 1;
572 else min = i + 1;
573 }
574 *index = min; /* this is where we should insert it */
575 return NULL;
576 }
577
578 /* open a subkey */
579 static struct key *open_key( struct key *key, const struct unicode_str *name )
580 {
581 int index;
582 struct unicode_str token;
583
584 token.str = NULL;
585 if (!get_path_token( name, &token )) return NULL;
586 while (token.len)
587 {
588 if (!(key = find_subkey( key, &token, &index )))
589 {
590 set_error( STATUS_OBJECT_NAME_NOT_FOUND );
591 break;
592 }
593 get_path_token( name, &token );
594 }
595
596 if (debug_level > 1) dump_operation( key, NULL, "Open" );
597 if (key) grab_object( key );
598 return key;
599 }
600
601 /* create a subkey */
602 static struct key *create_key( struct key *key, const struct unicode_str *name,
603 const struct unicode_str *class, int flags, time_t modif, int *created )
604 {
605 struct key *base;
606 int index;
607 struct unicode_str token;
608
609 if (key->flags & KEY_DELETED) /* we cannot create a subkey under a deleted key */
610 {
611 set_error( STATUS_KEY_DELETED );
612 return NULL;
613 }
614 if (!(flags & KEY_VOLATILE) && (key->flags & KEY_VOLATILE))
615 {
616 set_error( STATUS_CHILD_MUST_BE_VOLATILE );
617 return NULL;
618 }
619 if (!modif) modif = time(NULL);
620
621 token.str = NULL;
622 if (!get_path_token( name, &token )) return NULL;
623 *created = 0;
624 while (token.len)
625 {
626 struct key *subkey;
627 if (!(subkey = find_subkey( key, &token, &index ))) break;
628 key = subkey;
629 get_path_token( name, &token );
630 }
631
632 /* create the remaining part */
633
634 if (!token.len) goto done;
635 *created = 1;
636 if (flags & KEY_DIRTY) make_dirty( key );
637 if (!(key = alloc_subkey( key, &token, index, modif ))) return NULL;
638 base = key;
639 for (;;)
640 {
641 key->flags |= flags;
642 get_path_token( name, &token );
643 if (!token.len) break;
644 /* we know the index is always 0 in a new key */
645 if (!(key = alloc_subkey( key, &token, 0, modif )))
646 {
647 free_subkey( base, index );
648 return NULL;
649 }
650 }
651
652 done:
653 if (debug_level > 1) dump_operation( key, NULL, "Create" );
654 if (class && class->len)
655 {
656 key->classlen = class->len;
657 free(key->class);
658 if (!(key->class = memdup( class->str, key->classlen ))) key->classlen = 0;
659 }
660 grab_object( key );
661 return key;
662 }
663
664 /* query information about a key or a subkey */
665 static void enum_key( const struct key *key, int index, int info_class,
666 struct enum_key_reply *reply )
667 {
668 int i;
669 data_size_t len, namelen, classlen;
670 data_size_t max_subkey = 0, max_class = 0;
671 data_size_t max_value = 0, max_data = 0;
672 char *data;
673
674 if (index != -1) /* -1 means use the specified key directly */
675 {
676 if ((index < 0) || (index > key->last_subkey))
677 {
678 set_error( STATUS_NO_MORE_ENTRIES );
679 return;
680 }
681 key = key->subkeys[index];
682 }
683
684 namelen = key->namelen;
685 classlen = key->classlen;
686
687 switch(info_class)
688 {
689 case KeyBasicInformation:
690 classlen = 0; /* only return the name */
691 /* fall through */
692 case KeyNodeInformation:
693 reply->max_subkey = 0;
694 reply->max_class = 0;
695 reply->max_value = 0;
696 reply->max_data = 0;
697 break;
698 case KeyFullInformation:
699 for (i = 0; i <= key->last_subkey; i++)
700 {
701 struct key *subkey = key->subkeys[i];
702 len = subkey->namelen / sizeof(WCHAR);
703 if (len > max_subkey) max_subkey = len;
704 len = subkey->classlen / sizeof(WCHAR);
705 if (len > max_class) max_class = len;
706 }
707 for (i = 0; i <= key->last_value; i++)
708 {
709 len = key->values[i].namelen / sizeof(WCHAR);
710 if (len > max_value) max_value = len;
711 len = key->values[i].len;
712 if (len > max_data) max_data = len;
713 }
714 reply->max_subkey = max_subkey;
715 reply->max_class = max_class;
716 reply->max_value = max_value;
717 reply->max_data = max_data;
718 namelen = 0; /* only return the class */
719 break;
720 default:
721 set_error( STATUS_INVALID_PARAMETER );
722 return;
723 }
724 reply->subkeys = key->last_subkey + 1;
725 reply->values = key->last_value + 1;
726 reply->modif = key->modif;
727 reply->total = namelen + classlen;
728
729 len = min( reply->total, get_reply_max_size() );
730 if (len && (data = set_reply_data_size( len )))
731 {
732 if (len > namelen)
733 {
734 reply->namelen = namelen;
735 memcpy( data, key->name, namelen );
736 memcpy( data + namelen, key->class, len - namelen );
737 }
738 else
739 {
740 reply->namelen = len;
741 memcpy( data, key->name, len );
742 }
743 }
744 if (debug_level > 1) dump_operation( key, NULL, "Enum" );
745 }
746
747 /* delete a key and its values */
748 static int delete_key( struct key *key, int recurse )
749 {
750 int index;
751 struct key *parent;
752
753 /* must find parent and index */
754 if (key == root_key)
755 {
756 set_error( STATUS_ACCESS_DENIED );
757 return -1;
758 }
759 if (!(parent = key->parent) || (key->flags & KEY_DELETED))
760 {
761 set_error( STATUS_KEY_DELETED );
762 return -1;
763 }
764
765 while (recurse && (key->last_subkey>=0))
766 if (0 > delete_key(key->subkeys[key->last_subkey], 1))
767 return -1;
768
769 for (index = 0; index <= parent->last_subkey; index++)
770 if (parent->subkeys[index] == key) break;
771 assert( index <= parent->last_subkey );
772
773 /* we can only delete a key that has no subkeys */
774 if (key->last_subkey >= 0)
775 {
776 set_error( STATUS_ACCESS_DENIED );
777 return -1;
778 }
779
780 if (debug_level > 1) dump_operation( key, NULL, "Delete" );
781 free_subkey( parent, index );
782 touch_key( parent, REG_NOTIFY_CHANGE_NAME );
783 return 0;
784 }
785
786 /* try to grow the array of values; return 1 if OK, 0 on error */
787 static int grow_values( struct key *key )
788 {
789 struct key_value *new_val;
790 int nb_values;
791
792 if (key->nb_values)
793 {
794 nb_values = key->nb_values + (key->nb_values / 2); /* grow by 50% */
795 if (!(new_val = realloc( key->values, nb_values * sizeof(*new_val) )))
796 {
797 set_error( STATUS_NO_MEMORY );
798 return 0;
799 }
800 }
801 else
802 {
803 nb_values = MIN_VALUES;
804 if (!(new_val = mem_alloc( nb_values * sizeof(*new_val) ))) return 0;
805 }
806 key->values = new_val;
807 key->nb_values = nb_values;
808 return 1;
809 }
810
811 /* find the named value of a given key and return its index in the array */
812 static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index )
813 {
814 int i, min, max, res;
815 data_size_t len;
816
817 min = 0;
818 max = key->last_value;
819 while (min <= max)
820 {
821 i = (min + max) / 2;
822 len = min( key->values[i].namelen, name->len );
823 res = memicmpW( key->values[i].name, name->str, len / sizeof(WCHAR) );
824 if (!res) res = key->values[i].namelen - name->len;
825 if (!res)
826 {
827 *index = i;
828 return &key->values[i];
829 }
830 if (res > 0) max = i - 1;
831 else min = i + 1;
832 }
833 *index = min; /* this is where we should insert it */
834 return NULL;
835 }
836
837 /* insert a new value; the index must have been returned by find_value */
838 static struct key_value *insert_value( struct key *key, const struct unicode_str *name, int index )
839 {
840 struct key_value *value;
841 WCHAR *new_name = NULL;
842 int i;
843
844 if (name->len > MAX_VALUE_LEN * sizeof(WCHAR))
845 {
846 set_error( STATUS_NAME_TOO_LONG );
847 return NULL;
848 }
849 if (key->last_value + 1 == key->nb_values)
850 {
851 if (!grow_values( key )) return NULL;
852 }
853 if (name->len && !(new_name = memdup( name->str, name->len ))) return NULL;
854 for (i = ++key->last_value; i > index; i--) key->values[i] = key->values[i - 1];
855 value = &key->values[index];
856 value->name = new_name;
857 value->namelen = name->len;
858 value->len = 0;
859 value->data = NULL;
860 return value;
861 }
862
863 /* set a key value */
864 static void set_value( struct key *key, const struct unicode_str *name,
865 int type, const void *data, data_size_t len )
866 {
867 struct key_value *value;
868 void *ptr = NULL;
869 int index;
870
871 if ((value = find_value( key, name, &index )))
872 {
873 /* check if the new value is identical to the existing one */
874 if (value->type == type && value->len == len &&
875 value->data && !memcmp( value->data, data, len ))
876 {
877 if (debug_level > 1) dump_operation( key, value, "Skip setting" );
878 return;
879 }
880 }
881
882 if (len && !(ptr = memdup( data, len ))) return;
883
884 if (!value)
885 {
886 if (!(value = insert_value( key, name, index )))
887 {
888 free( ptr );
889 return;
890 }
891 }
892 else free( value->data ); /* already existing, free previous data */
893
894 value->type = type;
895 value->len = len;
896 value->data = ptr;
897 touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
898 if (debug_level > 1) dump_operation( key, value, "Set" );
899 }
900
901 /* get a key value */
902 static void get_value( struct key *key, const struct unicode_str *name, int *type, data_size_t *len )
903 {
904 struct key_value *value;
905 int index;
906
907 if ((value = find_value( key, name, &index )))
908 {
909 *type = value