2 * Server-side registry management
4 * Copyright (C) 1999 Alexandre Julliard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * - behavior with deleted keys
23 * - values larger than request buffer
28 #include "wine/port.h"
51 #include "wine/library.h"
55 struct list entry
; /* entry in list of notifications */
56 struct event
*event
; /* event to set when changing this key */
57 int subtree
; /* true if subtree notification */
58 unsigned int filter
; /* which events to notify on */
59 obj_handle_t hkey
; /* hkey associated with this notification */
65 struct object obj
; /* object header */
66 WCHAR
*name
; /* key name */
67 WCHAR
*class; /* key class */
68 struct key
*parent
; /* parent key */
69 int last_subkey
; /* last in use subkey */
70 int nb_subkeys
; /* count of allocated subkeys */
71 struct key
**subkeys
; /* subkeys array */
72 int last_value
; /* last in use value */
73 int nb_values
; /* count of allocated values in array */
74 struct key_value
*values
; /* values array */
75 unsigned int flags
; /* flags */
76 time_t modif
; /* last modification time */
77 struct list notify_list
; /* list of notifications */
81 #define KEY_VOLATILE 0x0001 /* key is volatile (not saved to disk) */
82 #define KEY_DELETED 0x0002 /* key has been deleted */
83 #define KEY_DIRTY 0x0004 /* key has been modified */
88 WCHAR
*name
; /* value name */
89 int type
; /* value type */
90 size_t len
; /* value data length in bytes */
91 void *data
; /* pointer to value data */
94 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
95 #define MIN_VALUES 8 /* min. number of allocated values per key */
98 /* the root of the registry tree */
99 static struct key
*root_key
;
101 static const int save_period
= 30000; /* delay between periodic saves (in ms) */
102 static struct timeout_user
*save_timeout_user
; /* saving timer */
104 static void set_periodic_save_timer(void);
106 /* information about where to save a registry branch */
107 struct save_branch_info
113 #define MAX_SAVE_BRANCH_INFO 3
114 static int save_branch_count
;
115 static struct save_branch_info save_branch_info
[MAX_SAVE_BRANCH_INFO
];
118 /* information about a file being loaded */
119 struct file_load_info
121 FILE *file
; /* input file */
122 char *buffer
; /* line buffer */
123 int len
; /* buffer length */
124 int line
; /* current input line */
125 char *tmp
; /* temp buffer to use while parsing input */
126 int tmplen
; /* length of temp buffer */
130 static void key_dump( struct object
*obj
, int verbose
);
131 static void key_destroy( struct object
*obj
);
133 static const struct object_ops key_ops
=
135 sizeof(struct key
), /* size */
137 no_add_queue
, /* add_queue */
138 NULL
, /* remove_queue */
140 NULL
, /* satisfied */
141 no_signal
, /* signal */
142 no_get_fd
, /* get_fd */
143 key_destroy
/* destroy */
148 * The registry text file format v2 used by this code is similar to the one
149 * used by REGEDIT import/export functionality, with the following differences:
150 * - strings and key names can contain \x escapes for Unicode
151 * - key names use escapes too in order to support Unicode
152 * - the modification time optionally follows the key name
153 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
156 static inline char to_hex( char ch
)
158 if (isdigit(ch
)) return ch
- '0';
159 return tolower(ch
) - 'a' + 10;
162 /* dump the full path of a key */
163 static void dump_path( const struct key
*key
, const struct key
*base
, FILE *f
)
165 if (key
->parent
&& key
->parent
!= base
)
167 dump_path( key
->parent
, base
, f
);
168 fprintf( f
, "\\\\" );
170 dump_strW( key
->name
, strlenW(key
->name
), f
, "[]" );
173 /* dump a value to a text file */
174 static void dump_value( const struct key_value
*value
, FILE *f
)
182 count
= 1 + dump_strW( value
->name
, strlenW(value
->name
), f
, "\"\"" );
183 count
+= fprintf( f
, "\"=" );
185 else count
= fprintf( f
, "@=" );
192 if (value
->type
!= REG_SZ
) fprintf( f
, "str(%d):", value
->type
);
194 if (value
->data
) dump_strW( (WCHAR
*)value
->data
, value
->len
/ sizeof(WCHAR
), f
, "\"\"" );
198 if (value
->len
== sizeof(DWORD
))
201 memcpy( &dw
, value
->data
, sizeof(DWORD
) );
202 fprintf( f
, "dword:%08lx", dw
);
205 /* else fall through */
207 if (value
->type
== REG_BINARY
) count
+= fprintf( f
, "hex:" );
208 else count
+= fprintf( f
, "hex(%x):", value
->type
);
209 for (i
= 0; i
< value
->len
; i
++)
211 count
+= fprintf( f
, "%02x", *((unsigned char *)value
->data
+ i
) );
212 if (i
< value
->len
-1)
217 fprintf( f
, "\\\n " );
227 /* save a registry and all its subkeys to a text file */
228 static void save_subkeys( const struct key
*key
, const struct key
*base
, FILE *f
)
232 if (key
->flags
& KEY_VOLATILE
) return;
233 /* save key if it has either some values or no subkeys */
234 /* keys with no values but subkeys are saved implicitly by saving the subkeys */
235 if ((key
->last_value
>= 0) || (key
->last_subkey
== -1))
238 if (key
!= base
) dump_path( key
, base
, f
);
239 fprintf( f
, "] %ld\n", (long)key
->modif
);
240 for (i
= 0; i
<= key
->last_value
; i
++) dump_value( &key
->values
[i
], f
);
242 for (i
= 0; i
<= key
->last_subkey
; i
++) save_subkeys( key
->subkeys
[i
], base
, f
);
245 static void dump_operation( const struct key
*key
, const struct key_value
*value
, const char *op
)
247 fprintf( stderr
, "%s key ", op
);
248 if (key
) dump_path( key
, NULL
, stderr
);
249 else fprintf( stderr
, "ERROR" );
252 fprintf( stderr
, " value ");
253 dump_value( value
, stderr
);
255 else fprintf( stderr
, "\n" );
258 static void key_dump( struct object
*obj
, int verbose
)
260 struct key
*key
= (struct key
*)obj
;
261 assert( obj
->ops
== &key_ops
);
262 fprintf( stderr
, "Key flags=%x ", key
->flags
);
263 dump_path( key
, NULL
, stderr
);
264 fprintf( stderr
, "\n" );
267 /* notify waiter and maybe delete the notification */
268 static void do_notification( struct key
*key
, struct notify
*notify
, int del
)
272 set_event( notify
->event
);
273 release_object( notify
->event
);
274 notify
->event
= NULL
;
278 list_remove( ¬ify
->entry
);
283 static struct notify
*find_notify( struct key
*key
, obj_handle_t hkey
)
285 struct notify
*notify
;
287 LIST_FOR_EACH_ENTRY( notify
, &key
->notify_list
, struct notify
, entry
)
289 if (notify
->hkey
== hkey
) return notify
;
294 /* close the notification associated with a handle */
295 void registry_close_handle( struct object
*obj
, obj_handle_t hkey
)
297 struct key
* key
= (struct key
*) obj
;
298 struct notify
*notify
;
300 if( obj
->ops
!= &key_ops
)
302 notify
= find_notify( key
, hkey
);
305 do_notification( key
, notify
, 1 );
308 static void key_destroy( struct object
*obj
)
312 struct key
*key
= (struct key
*)obj
;
313 assert( obj
->ops
== &key_ops
);
315 if (key
->name
) free( key
->name
);
316 if (key
->class) free( key
->class );
317 for (i
= 0; i
<= key
->last_value
; i
++)
319 free( key
->values
[i
].name
);
320 if (key
->values
[i
].data
) free( key
->values
[i
].data
);
322 for (i
= 0; i
<= key
->last_subkey
; i
++)
324 key
->subkeys
[i
]->parent
= NULL
;
325 release_object( key
->subkeys
[i
] );
327 /* unconditionally notify everything waiting on this key */
328 while ((ptr
= list_head( &key
->notify_list
)))
330 struct notify
*notify
= LIST_ENTRY( ptr
, struct notify
, entry
);
331 do_notification( key
, notify
, 1 );
335 /* duplicate a key path */
336 /* returns a pointer to a static buffer, so only useable once per request */
337 static WCHAR
*copy_path( const WCHAR
*path
, size_t len
, int skip_root
)
339 static WCHAR buffer
[MAX_PATH
+1];
340 static const WCHAR root_name
[] = { '\\','R','e','g','i','s','t','r','y','\\',0 };
342 if (len
> sizeof(buffer
)-sizeof(buffer
[0]))
344 set_error( STATUS_BUFFER_OVERFLOW
);
347 memcpy( buffer
, path
, len
);
348 buffer
[len
/ sizeof(WCHAR
)] = 0;
349 if (skip_root
&& !strncmpiW( buffer
, root_name
, 10 )) return buffer
+ 10;
353 /* copy a path from the request buffer */
354 static WCHAR
*copy_req_path( size_t len
, int skip_root
)
356 const WCHAR
*name_ptr
= get_req_data();
357 if (len
> get_req_data_size())
359 fatal_protocol_error( current
, "copy_req_path: invalid length %d/%d\n",
360 len
, get_req_data_size() );
363 return copy_path( name_ptr
, len
, skip_root
);
366 /* return the next token in a given path */
367 /* returns a pointer to a static buffer, so only useable once per request */
368 static WCHAR
*get_path_token( WCHAR
*initpath
)
375 /* path cannot start with a backslash */
376 if (*initpath
== '\\')
378 set_error( STATUS_OBJECT_PATH_INVALID
);
383 else while (*path
== '\\') path
++;
386 while (*path
&& *path
!= '\\') path
++;
387 if (*path
) *path
++ = 0;
391 /* duplicate a Unicode string from the request buffer */
392 static WCHAR
*req_strdupW( const void *req
, const WCHAR
*str
, size_t len
)
395 if ((name
= mem_alloc( len
+ sizeof(WCHAR
) )) != NULL
)
397 memcpy( name
, str
, len
);
398 name
[len
/ sizeof(WCHAR
)] = 0;
403 /* allocate a key object */
404 static struct key
*alloc_key( const WCHAR
*name
, time_t modif
)
407 if ((key
= alloc_object( &key_ops
)))
411 key
->last_subkey
= -1;
415 key
->last_value
= -1;
419 list_init( &key
->notify_list
);
420 if (!(key
->name
= strdupW( name
)))
422 release_object( key
);
429 /* mark a key and all its parents as dirty (modified) */
430 static void make_dirty( struct key
*key
)
434 if (key
->flags
& (KEY_DIRTY
|KEY_VOLATILE
)) return; /* nothing to do */
435 key
->flags
|= KEY_DIRTY
;
440 /* mark a key and all its subkeys as clean (not modified) */
441 static void make_clean( struct key
*key
)
445 if (key
->flags
& KEY_VOLATILE
) return;
446 if (!(key
->flags
& KEY_DIRTY
)) return;
447 key
->flags
&= ~KEY_DIRTY
;
448 for (i
= 0; i
<= key
->last_subkey
; i
++) make_clean( key
->subkeys
[i
] );
451 /* go through all the notifications and send them if necessary */
452 void check_notify( struct key
*key
, unsigned int change
, int not_subtree
)
454 struct list
*ptr
, *next
;
456 LIST_FOR_EACH_SAFE( ptr
, next
, &key
->notify_list
)
458 struct notify
*n
= LIST_ENTRY( ptr
, struct notify
, entry
);
459 if ( ( not_subtree
|| n
->subtree
) && ( change
& n
->filter
) )
460 do_notification( key
, n
, 0 );
464 /* update key modification time */
465 static void touch_key( struct key
*key
, unsigned int change
)
469 key
->modif
= time(NULL
);
472 /* do notifications */
473 check_notify( key
, change
, 1 );
474 for ( k
= key
->parent
; k
; k
= k
->parent
)
475 check_notify( k
, change
& ~REG_NOTIFY_CHANGE_LAST_SET
, 0 );
478 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
479 static int grow_subkeys( struct key
*key
)
481 struct key
**new_subkeys
;
486 nb_subkeys
= key
->nb_subkeys
+ (key
->nb_subkeys
/ 2); /* grow by 50% */
487 if (!(new_subkeys
= realloc( key
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) )))
489 set_error( STATUS_NO_MEMORY
);
495 nb_subkeys
= MIN_VALUES
;
496 if (!(new_subkeys
= mem_alloc( nb_subkeys
* sizeof(*new_subkeys
) ))) return 0;
498 key
->subkeys
= new_subkeys
;
499 key
->nb_subkeys
= nb_subkeys
;
503 /* allocate a subkey for a given key, and return its index */
504 static struct key
*alloc_subkey( struct key
*parent
, const WCHAR
*name
, int index
, time_t modif
)
509 if (parent
->last_subkey
+ 1 == parent
->nb_subkeys
)
511 /* need to grow the array */
512 if (!grow_subkeys( parent
)) return NULL
;
514 if ((key
= alloc_key( name
, modif
)) != NULL
)
516 key
->parent
= parent
;
517 for (i
= ++parent
->last_subkey
; i
> index
; i
--)
518 parent
->subkeys
[i
] = parent
->subkeys
[i
-1];
519 parent
->subkeys
[index
] = key
;
524 /* free a subkey of a given key */
525 static void free_subkey( struct key
*parent
, int index
)
530 assert( index
>= 0 );
531 assert( index
<= parent
->last_subkey
);
533 key
= parent
->subkeys
[index
];
534 for (i
= index
; i
< parent
->last_subkey
; i
++) parent
->subkeys
[i
] = parent
->subkeys
[i
+ 1];
535 parent
->last_subkey
--;
536 key
->flags
|= KEY_DELETED
;
538 release_object( key
);
540 /* try to shrink the array */
541 nb_subkeys
= parent
->nb_subkeys
;
542 if (nb_subkeys
> MIN_SUBKEYS
&& parent
->last_subkey
< nb_subkeys
/ 2)
544 struct key
**new_subkeys
;
545 nb_subkeys
-= nb_subkeys
/ 3; /* shrink by 33% */
546 if (nb_subkeys
< MIN_SUBKEYS
) nb_subkeys
= MIN_SUBKEYS
;
547 if (!(new_subkeys
= realloc( parent
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) ))) return;
548 parent
->subkeys
= new_subkeys
;
549 parent
->nb_subkeys
= nb_subkeys
;
553 /* find the named child of a given key and return its index */
554 static struct key
*find_subkey( const struct key
*key
, const WCHAR
*name
, int *index
)
556 int i
, min
, max
, res
;
559 max
= key
->last_subkey
;
563 if (!(res
= strcmpiW( key
->subkeys
[i
]->name
, name
)))
566 return key
->subkeys
[i
];
568 if (res
> 0) max
= i
- 1;
571 *index
= min
; /* this is where we should insert it */
576 /* warning: the key name must be writeable (use copy_path) */
577 static struct key
*open_key( struct key
*key
, WCHAR
*name
)
582 if (!(path
= get_path_token( name
))) return NULL
;
585 if (!(key
= find_subkey( key
, path
, &index
)))
587 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
590 path
= get_path_token( NULL
);
593 if (debug_level
> 1) dump_operation( key
, NULL
, "Open" );
594 if (key
) grab_object( key
);
598 /* create a subkey */
599 /* warning: the key name must be writeable (use copy_path) */
600 static struct key
*create_key( struct key
*key
, WCHAR
*name
, WCHAR
*class,
601 int flags
, time_t modif
, int *created
)
607 if (key
->flags
& KEY_DELETED
) /* we cannot create a subkey under a deleted key */
609 set_error( STATUS_KEY_DELETED
);
612 if (!(flags
& KEY_VOLATILE
) && (key
->flags
& KEY_VOLATILE
))
614 set_error( STATUS_CHILD_MUST_BE_VOLATILE
);
617 if (!modif
) modif
= time(NULL
);
619 if (!(path
= get_path_token( name
))) return NULL
;
624 if (!(subkey
= find_subkey( key
, path
, &index
))) break;
626 path
= get_path_token( NULL
);
629 /* create the remaining part */
631 if (!*path
) goto done
;
633 if (flags
& KEY_DIRTY
) make_dirty( key
);
636 key
= alloc_subkey( key
, path
, index
, modif
);
640 path
= get_path_token( NULL
);
641 if (!*path
) goto done
;
642 /* we know the index is always 0 in a new key */
643 key
= alloc_subkey( key
, path
, 0, modif
);
645 if (base_idx
!= -1) free_subkey( base
, base_idx
);
649 if (debug_level
> 1) dump_operation( key
, NULL
, "Create" );
650 if (class) key
->class = strdupW(class);
655 /* query information about a key or a subkey */
656 static void enum_key( const struct key
*key
, int index
, int info_class
,
657 struct enum_key_reply
*reply
)
660 size_t len
, namelen
, classlen
;
661 int max_subkey
= 0, max_class
= 0;
662 int max_value
= 0, max_data
= 0;
665 if (index
!= -1) /* -1 means use the specified key directly */
667 if ((index
< 0) || (index
> key
->last_subkey
))
669 set_error( STATUS_NO_MORE_ENTRIES
);
672 key
= key
->subkeys
[index
];
675 namelen
= strlenW(key
->name
) * sizeof(WCHAR
);
676 classlen
= key
->class ? strlenW(key
->class) * sizeof(WCHAR
) : 0;
680 case KeyBasicInformation
:
681 classlen
= 0; /* only return the name */
683 case KeyNodeInformation
:
684 reply
->max_subkey
= 0;
685 reply
->max_class
= 0;
686 reply
->max_value
= 0;
689 case KeyFullInformation
:
690 for (i
= 0; i
<= key
->last_subkey
; i
++)
692 struct key
*subkey
= key
->subkeys
[i
];
693 len
= strlenW( subkey
->name
);
694 if (len
> max_subkey
) max_subkey
= len
;
695 if (!subkey
->class) continue;
696 len
= strlenW( subkey
->class );
697 if (len
> max_class
) max_class
= len
;
699 for (i
= 0; i
<= key
->last_value
; i
++)
701 len
= strlenW( key
->values
[i
].name
);
702 if (len
> max_value
) max_value
= len
;
703 len
= key
->values
[i
].len
;
704 if (len
> max_data
) max_data
= len
;
706 reply
->max_subkey
= max_subkey
;
707 reply
->max_class
= max_class
;
708 reply
->max_value
= max_value
;
709 reply
->max_data
= max_data
;
710 namelen
= 0; /* only return the class */
713 set_error( STATUS_INVALID_PARAMETER
);
716 reply
->subkeys
= key
->last_subkey
+ 1;
717 reply
->values
= key
->last_value
+ 1;
718 reply
->modif
= key
->modif
;
719 reply
->total
= namelen
+ classlen
;
721 len
= min( reply
->total
, get_reply_max_size() );
722 if (len
&& (data
= set_reply_data_size( len
)))
726 reply
->namelen
= namelen
;
727 memcpy( data
, key
->name
, namelen
);
728 memcpy( (char *)data
+ namelen
, key
->class, len
- namelen
);
732 reply
->namelen
= len
;
733 memcpy( data
, key
->name
, len
);
736 if (debug_level
> 1) dump_operation( key
, NULL
, "Enum" );
739 /* delete a key and its values */
740 static int delete_key( struct key
*key
, int recurse
)
745 /* must find parent and index */
748 set_error( STATUS_ACCESS_DENIED
);
751 if (!(parent
= key
->parent
) || (key
->flags
& KEY_DELETED
))
753 set_error( STATUS_KEY_DELETED
);
757 while (recurse
&& (key
->last_subkey
>=0))
758 if(0>delete_key(key
->subkeys
[key
->last_subkey
], 1))
761 for (index
= 0; index
<= parent
->last_subkey
; index
++)
762 if (parent
->subkeys
[index
] == key
) break;
763 assert( index
<= parent
->last_subkey
);
765 /* we can only delete a key that has no subkeys */
766 if (key
->last_subkey
>= 0)
768 set_error( STATUS_ACCESS_DENIED
);
772 if (debug_level
> 1) dump_operation( key
, NULL
, "Delete" );
773 free_subkey( parent
, index
);
774 touch_key( parent
, REG_NOTIFY_CHANGE_NAME
);
778 /* try to grow the array of values; return 1 if OK, 0 on error */
779 static int grow_values( struct key
*key
)
781 struct key_value
*new_val
;
786 nb_values
= key
->nb_values
+ (key
->nb_values
/ 2); /* grow by 50% */
787 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) )))
789 set_error( STATUS_NO_MEMORY
);
795 nb_values
= MIN_VALUES
;
796 if (!(new_val
= mem_alloc( nb_values
* sizeof(*new_val
) ))) return 0;
798 key
->values
= new_val
;
799 key
->nb_values
= nb_values
;
803 /* find the named value of a given key and return its index in the array */
804 static struct key_value
*find_value( const struct key
*key
, const WCHAR
*name
, int *index
)
806 int i
, min
, max
, res
;
809 max
= key
->last_value
;
813 if (!(res
= strcmpiW( key
->values
[i
].name
, name
)))
816 return &key
->values
[i
];
818 if (res
> 0) max
= i
- 1;
821 *index
= min
; /* this is where we should insert it */
825 /* insert a new value; the index must have been returned by find_value */
826 static struct key_value
*insert_value( struct key
*key
, const WCHAR
*name
, int index
)
828 struct key_value
*value
;
832 if (key
->last_value
+ 1 == key
->nb_values
)
834 if (!grow_values( key
)) return NULL
;
836 if (!(new_name
= strdupW(name
))) return NULL
;
837 for (i
= ++key
->last_value
; i
> index
; i
--) key
->values
[i
] = key
->values
[i
- 1];
838 value
= &key
->values
[index
];
839 value
->name
= new_name
;
845 /* set a key value */
846 static void set_value( struct key
*key
, WCHAR
*name
, int type
, const void *data
, size_t len
)
848 struct key_value
*value
;
852 if ((value
= find_value( key
, name
, &index
)))
854 /* check if the new value is identical to the existing one */
855 if (value
->type
== type
&& value
->len
== len
&&
856 value
->data
&& !memcmp( value
->data
, data
, len
))
858 if (debug_level
> 1) dump_operation( key
, value
, "Skip setting" );
863 if (len
&& !(ptr
= memdup( data
, len
))) return;
867 if (!(value
= insert_value( key
, name
, index
)))
869 if (ptr
) free( ptr
);
873 else if (value
->data
) free( value
->data
); /* already existing, free previous data */
878 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
879 if (debug_level
> 1) dump_operation( key
, value
, "Set" );
882 /* get a key value */
883 static void get_value( struct key
*key
, const WCHAR
*name
, int *type
, int *len
)
885 struct key_value
*value
;
888 if ((value
= find_value( key
, name
, &index
)))
892 if (value
->data
) set_reply_data( value
->data
, min( value
->len
, get_reply_max_size() ));
893 if (debug_level
> 1) dump_operation( key
, value
, "Get" );
898 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
902 /* enumerate a key value */
903 static void enum_value( struct key
*key
, int i
, int info_class
, struct enum_key_value_reply
*reply
)
905 struct key_value
*value
;
907 if (i
< 0 || i
> key
->last_value
) set_error( STATUS_NO_MORE_ENTRIES
);
911 size_t namelen
, maxlen
;
913 value
= &key
->values
[i
];
914 reply
->type
= value
->type
;
915 namelen
= strlenW( value
->name
) * sizeof(WCHAR
);
919 case KeyValueBasicInformation
:
920 reply
->total
= namelen
;
922 case KeyValueFullInformation
:
923 reply
->total
= namelen
+ value
->len
;
925 case KeyValuePartialInformation
:
926 reply
->total
= value
->len
;
930 set_error( STATUS_INVALID_PARAMETER
);
934 maxlen
= min( reply
->total
, get_reply_max_size() );
935 if (maxlen
&& ((data
= set_reply_data_size( maxlen
))))
937 if (maxlen
> namelen
)
939 reply
->namelen
= namelen
;
940 memcpy( data
, value
->name
, namelen
);
941 memcpy( (char *)data
+ namelen
, value
->data
, maxlen
- namelen
);
945 reply
->namelen
= maxlen
;
946 memcpy( data
, value
->name
, maxlen
);
949 if (debug_level
> 1) dump_operation( key
, value
, "Enum" );
954 static void delete_value( struct key
*key
, const WCHAR
*name
)
956 struct key_value
*value
;
957 int i
, index
, nb_values
;
959 if (!(value
= find_value( key
, name
, &index
)))
961 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
964 if (debug_level
> 1) dump_operation( key
, value
, "Delete" );
966 if (value
->data
) free( value
->data
);
967 for (i
= index
; i
< key
->last_value
; i
++) key
->values
[i
] = key
->values
[i
+ 1];
969 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
971 /* try to shrink the array */
972 nb_values
= key
->nb_values
;
973 if (nb_values
> MIN_VALUES
&& key
->last_value
< nb_values
/ 2)
975 struct key_value
*new_val
;
976 nb_values
-= nb_values
/ 3; /* shrink by 33% */
977 if (nb_values
< MIN_VALUES
) nb_values
= MIN_VALUES
;
978 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) ))) return;
979 key
->values
= new_val
;
980 key
->nb_values
= nb_values
;
984 /* get the registry key corresponding to an hkey handle */
985 static struct key
*get_hkey_obj( obj_handle_t hkey
, unsigned int access
)
987 if (!hkey
) return (struct key
*)grab_object( root_key
);
988 return (struct key
*)get_handle_obj( current
->process
, hkey
, access
, &key_ops
);
991 /* read a line from the input file */
992 static int read_next_line( struct file_load_info
*info
)
1000 if (!fgets( info
->buffer
+ pos
, info
->len
- pos
, info
->file
))
1001 return (pos
!= 0); /* EOF */
1002 pos
= strlen(info
->buffer
);
1003 if (info
->buffer
[pos
-1] == '\n')
1005 /* got a full line */
1006 info
->buffer
[--pos
] = 0;
1007 if (pos
> 0 && info
->buffer
[pos
-1] == '\r') info
->buffer
[pos
-1] = 0;
1010 if (pos
< info
->len
- 1) return 1; /* EOF but something was read */
1012 /* need to enlarge the buffer */
1013 newlen
= info
->len
+ info
->len
/ 2;
1014 if (!(newbuf
= realloc( info
->buffer
, newlen
)))
1016 set_error( STATUS_NO_MEMORY
);
1019 info
->buffer
= newbuf
;
1024 /* make sure the temp buffer holds enough space */
1025 static int get_file_tmp_space( struct file_load_info
*info
, int size
)
1028 if (info
->tmplen
>= size
) return 1;
1029 if (!(tmp
= realloc( info
->tmp
, size
)))
1031 set_error( STATUS_NO_MEMORY
);
1035 info
->tmplen
= size
;
1039 /* report an error while loading an input file */
1040 static void file_read_error( const char *err
, struct file_load_info
*info
)
1042 fprintf( stderr
, "Line %d: %s '%s'\n", info
->line
, err
, info
->buffer
);
1045 /* parse an escaped string back into Unicode */
1046 /* return the number of chars read from the input, or -1 on output overflow */
1047 static int parse_strW( WCHAR
*dest
, int *len
, const char *src
, char endchar
)
1049 int count
= sizeof(WCHAR
); /* for terminating null */
1050 const char *p
= src
;
1051 while (*p
&& *p
!= endchar
)
1053 if (*p
!= '\\') *dest
= (WCHAR
)*p
++;
1059 case 'a': *dest
= '\a'; p
++; break;
1060 case 'b': *dest
= '\b'; p
++; break;
1061 case 'e': *dest
= '\e'; p
++; break;
1062 case 'f': *dest
= '\f'; p
++; break;
1063 case 'n': *dest
= '\n'; p
++; break;
1064 case 'r': *dest
= '\r'; p
++; break;
1065 case 't': *dest
= '\t'; p
++; break;
1066 case 'v': *dest
= '\v'; p
++; break;
1067 case 'x': /* hex escape */
1069 if (!isxdigit(*p
)) *dest
= 'x';
1072 *dest
= to_hex(*p
++);
1073 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1074 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1075 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1085 case '7': /* octal escape */
1087 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
1088 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
1091 *dest
= (WCHAR
)*p
++;
1095 if ((count
+= sizeof(WCHAR
)) > *len
) return -1; /* dest buffer overflow */
1099 if (!*p
) return -1; /* delimiter not found */
1104 /* convert a data type tag to a value type */
1105 static int get_data_type( const char *buffer
, int *type
, int *parse_type
)
1107 struct data_type
{ const char *tag
; int len
; int type
; int parse_type
; };
1109 static const struct data_type data_types
[] =
1110 { /* actual type */ /* type to assume for parsing */
1111 { "\"", 1, REG_SZ
, REG_SZ
},
1112 { "str:\"", 5, REG_SZ
, REG_SZ
},
1113 { "str(2):\"", 8, REG_EXPAND_SZ
, REG_SZ
},
1114 { "str(7):\"", 8, REG_MULTI_SZ
, REG_SZ
},
1115 { "hex:", 4, REG_BINARY
, REG_BINARY
},
1116 { "dword:", 6, REG_DWORD
, REG_DWORD
},
1117 { "hex(", 4, -1, REG_BINARY
},
1121 const struct data_type
*ptr
;
1124 for (ptr
= data_types
; ptr
->tag
; ptr
++)
1126 if (memcmp( ptr
->tag
, buffer
, ptr
->len
)) continue;
1127 *parse_type
= ptr
->parse_type
;
1128 if ((*type
= ptr
->type
) != -1) return ptr
->len
;
1129 /* "hex(xx):" is special */
1130 *type
= (int)strtoul( buffer
+ 4, &end
, 16 );
1131 if ((end
<= buffer
) || memcmp( end
, "):", 2 )) return 0;
1132 return end
+ 2 - buffer
;
1137 /* load and create a key from the input file */
1138 static struct key
*load_key( struct key
*base
, const char *buffer
, int flags
,
1139 int prefix_len
, struct file_load_info
*info
,
1143 int res
, len
, modif
;
1145 len
= strlen(buffer
) * sizeof(WCHAR
);
1146 if (!get_file_tmp_space( info
, len
)) return NULL
;
1148 if ((res
= parse_strW( (WCHAR
*)info
->tmp
, &len
, buffer
, ']' )) == -1)
1150 file_read_error( "Malformed key", info
);
1153 if (sscanf( buffer
+ res
, " %d", &modif
) != 1) modif
= default_modif
;
1155 p
= (WCHAR
*)info
->tmp
;
1156 while (prefix_len
&& *p
) { if (*p
++ == '\\') prefix_len
--; }
1162 file_read_error( "Malformed key", info
);
1165 /* empty key name, return base key */
1166 return (struct key
*)grab_object( base
);
1168 if (!(name
= copy_path( p
, len
- ((char *)p
- info
->tmp
), 0 )))
1170 file_read_error( "Key is too long", info
);
1173 return create_key( base
, name
, NULL
, flags
, modif
, &res
);
1176 /* parse a comma-separated list of hex digits */
1177 static int parse_hex( unsigned char *dest
, int *len
, const char *buffer
)
1179 const char *p
= buffer
;
1181 while (isxdigit(*p
))
1185 memcpy( buf
, p
, 2 );
1187 sscanf( buf
, "%x", &val
);
1188 if (count
++ >= *len
) return -1; /* dest buffer overflow */
1189 *dest
++ = (unsigned char )val
;
1197 /* parse a value name and create the corresponding value */
1198 static struct key_value
*parse_value_name( struct key
*key
, const char *buffer
, int *len
,
1199 struct file_load_info
*info
)
1201 struct key_value
*value
;
1204 maxlen
= strlen(buffer
) * sizeof(WCHAR
);
1205 if (!get_file_tmp_space( info
, maxlen
)) return NULL
;
1206 if (buffer
[0] == '@')
1208 info
->tmp
[0] = info
->tmp
[1] = 0;
1213 if ((*len
= parse_strW( (WCHAR
*)info
->tmp
, &maxlen
, buffer
+ 1, '\"' )) == -1) goto error
;
1214 (*len
)++; /* for initial quote */
1216 while (isspace(buffer
[*len
])) (*len
)++;
1217 if (buffer
[*len
] != '=') goto error
;
1219 while (isspace(buffer
[*len
])) (*len
)++;
1220 if (!(value
= find_value( key
, (WCHAR
*)info
->tmp
, &index
)))
1221 value
= insert_value( key
, (WCHAR
*)info
->tmp
, index
);
1225 file_read_error( "Malformed value name", info
);
1229 /* load a value from the input file */
1230 static int load_value( struct key
*key
, const char *buffer
, struct file_load_info
*info
)
1234 int maxlen
, len
, res
;
1235 int type
, parse_type
;
1236 struct key_value
*value
;
1238 if (!(value
= parse_value_name( key
, buffer
, &len
, info
))) return 0;
1239 if (!(res
= get_data_type( buffer
+ len
, &type
, &parse_type
))) goto error
;
1240 buffer
+= len
+ res
;
1245 len
= strlen(buffer
) * sizeof(WCHAR
);
1246 if (!get_file_tmp_space( info
, len
)) return 0;
1247 if ((res
= parse_strW( (WCHAR
*)info
->tmp
, &len
, buffer
, '\"' )) == -1) goto error
;
1251 dw
= strtoul( buffer
, NULL
, 16 );
1255 case REG_BINARY
: /* hex digits */
1259 maxlen
= 1 + strlen(buffer
)/3; /* 3 chars for one hex byte */
1260 if (!get_file_tmp_space( info
, len
+ maxlen
)) return 0;
1261 if ((res
= parse_hex( info
->tmp
+ len
, &maxlen
, buffer
)) == -1) goto error
;
1264 while (isspace(*buffer
)) buffer
++;
1265 if (!*buffer
) break;
1266 if (*buffer
!= '\\') goto error
;
1267 if (read_next_line( info
) != 1) goto error
;
1268 buffer
= info
->buffer
;
1269 while (isspace(*buffer
)) buffer
++;
1275 ptr
= NULL
; /* keep compiler quiet */
1279 if (!len
) newptr
= NULL
;
1280 else if (!(newptr
= memdup( ptr
, len
))) return 0;
1282 if (value
->data
) free( value
->data
);
1283 value
->data
= newptr
;
1290 file_read_error( "Malformed value", info
);
1294 /* return the length (in path elements) of name that is part of the key name */
1295 /* for instance if key is USER\foo\bar and name is foo\bar\baz, return 2 */
1296 static int get_prefix_len( struct key
*key
, const char *name
, struct file_load_info
*info
)
1300 int len
= strlen(name
) * sizeof(WCHAR
);
1301 if (!get_file_tmp_space( info
, len
)) return 0;
1303 if ((res
= parse_strW( (WCHAR
*)info
->tmp
, &len
, name
, ']' )) == -1)
1305 file_read_error( "Malformed key", info
);
1308 for (p
= (WCHAR
*)info
->tmp
; *p
; p
++) if (*p
== '\\') break;
1310 for (res
= 1; key
!= root_key
; res
++)
1312 if (!strcmpiW( (WCHAR
*)info
->tmp
, key
->name
)) break;
1315 if (key
== root_key
) res
= 0; /* no matching name */
1319 /* load all the keys from the input file */
1320 /* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1321 static void load_keys( struct key
*key
, FILE *f
, int prefix_len
)
1323 struct key
*subkey
= NULL
;
1324 struct file_load_info info
;
1326 int default_modif
= time(NULL
);
1327 int flags
= (key
->flags
& KEY_VOLATILE
) ? KEY_VOLATILE
: KEY_DIRTY
;
1333 if (!(info
.buffer
= mem_alloc( info
.len
))) return;
1334 if (!(info
.tmp
= mem_alloc( info
.tmplen
)))
1336 free( info
.buffer
);
1340 if ((read_next_line( &info
) != 1) ||
1341 strcmp( info
.buffer
, "WINE REGISTRY Version 2" ))
1343 set_error( STATUS_NOT_REGISTRY_FILE
);
1347 while (read_next_line( &info
) == 1)
1350 while (*p
&& isspace(*p
)) p
++;
1353 case '[': /* new key */
1354 if (subkey
) release_object( subkey
);
1355 if (prefix_len
== -1) prefix_len
= get_prefix_len( key
, p
+ 1, &info
);
1356 if (!(subkey
= load_key( key
, p
+ 1, flags
, prefix_len
, &info
, default_modif
)))
1357 file_read_error( "Error creating key", &info
);
1359 case '@': /* default value */
1360 case '\"': /* value */
1361 if (subkey
) load_value( subkey
, p
, &info
);
1362 else file_read_error( "Value without key", &info
);
1364 case '#': /* comment */
1365 case ';': /* comment */
1366 case 0: /* empty line */
1369 file_read_error( "Unrecognized input", &info
);
1375 if (subkey
) release_object( subkey
);
1376 free( info
.buffer
);
1380 /* load a part of the registry from a file */
1381 static void load_registry( struct key
*key
, obj_handle_t handle
)
1386 if (!(file
= get_file_obj( current
->process
, handle
, GENERIC_READ
))) return;
1387 fd
= dup( get_file_unix_fd( file
) );
1388 release_object( file
);
1391 FILE *f
= fdopen( fd
, "r" );
1394 load_keys( key
, f
, -1 );
1397 else file_set_error();
1401 /* load one of the initial registry files */
1402 static void load_init_registry_from_file( const char *filename
, struct key
*key
)
1406 if ((f
= fopen( filename
, "r" )))
1408 load_keys( key
, f
, 0 );
1410 if (get_error() == STATUS_NOT_REGISTRY_FILE
)
1411 fatal_error( "%s is not a valid registry file\n", filename
);
1413 fatal_error( "loading %s failed with error %x\n", filename
, get_error() );
1416 if (!(key
->flags
& KEY_VOLATILE
))
1418 assert( save_branch_count
< MAX_SAVE_BRANCH_INFO
);
1420 if ((save_branch_info
[save_branch_count
].path
= strdup( filename
)))
1421 save_branch_info
[save_branch_count
++].key
= (struct key
*)grab_object( key
);
1425 /* load the user registry files */
1426 static void load_user_registries( struct key
*key_current_user
)
1428 const char *config
= wine_get_config_dir();
1431 /* load user.reg into HKEY_CURRENT_USER */
1433 if (!(filename
= mem_alloc( strlen(config
) + sizeof("/user.reg") ))) return;
1434 strcpy( filename
, config
);
1435 strcat( filename
, "/user.reg" );
1436 load_init_registry_from_file( filename
, key_current_user
);
1439 /* start the periodic save timer */
1440 set_periodic_save_timer();
1443 /* registry initialisation */
1444 void init_registry(void)
1446 static const WCHAR root_name
[] = { 0 };
1447 static const WCHAR HKLM
[] = { 'M','a','c','h','i','n','e' };
1448 static const WCHAR HKU_default
[] = { 'U','s','e','r','\\','.','D','e','f','a','u','l','t' };
1449 static const WCHAR config_name
[] =
1450 { 'M','a','c','h','i','n','e','\\','S','o','f','t','w','a','r','e','\\',
1451 'W','i','n','e','\\','W','i','n','e','\\','C','o','n','f','i','g',0 };
1453 const char *config
= wine_get_config_dir();
1458 /* create the root key */
1459 root_key
= alloc_key( root_name
, time(NULL
) );
1462 /* load the config file */
1463 if (!(filename
= malloc( strlen(config
) + 16 ))) fatal_error( "out of memory\n" );
1464 strcpy( filename
, config
);
1465 p
= filename
+ strlen(filename
);
1467 /* load system.reg into Registry\Machine */
1469 if (!(key
= create_key( root_key
, copy_path( HKLM
, sizeof(HKLM
), 0 ),
1470 NULL
, 0, time(NULL
), &dummy
)))
1471 fatal_error( "could not create Machine registry key\n" );
1473 strcpy( p
, "/system.reg" );
1474 load_init_registry_from_file( filename
, key
);
1475 release_object( key
);
1477 /* load userdef.reg into Registry\User\.Default */
1479 if (!(key
= create_key( root_key
, copy_path( HKU_default
, sizeof(HKU_default
), 0 ),
1480 NULL
, 0, time(NULL
), &dummy
)))
1481 fatal_error( "could not create User\\.Default registry key\n" );
1483 strcpy( p
, "/userdef.reg" );
1484 load_init_registry_from_file( filename
, key
);
1485 release_object( key
);
1487 /* load config into Registry\Machine\Software\Wine\Wine\Config */
1489 if (!(key
= create_key( root_key
, copy_path( config_name
, sizeof(config_name
), 0 ),
1490 NULL
, 0, time(NULL
), &dummy
)))
1491 fatal_error( "could not create Config registry key\n" );
1493 key
->flags
|= KEY_VOLATILE
;
1494 strcpy( p
, "/config" );
1495 load_init_registry_from_file( filename
, key
);
1496 release_object( key
);
1501 /* save a registry branch to a file */
1502 static void save_all_subkeys( struct key
*key
, FILE *f
)
1504 fprintf( f
, "WINE REGISTRY Version 2\n" );
1505 fprintf( f
, ";; All keys relative to " );
1506 dump_path( key
, NULL
, f
);
1508 save_subkeys( key
, key
, f
);
1511 /* save a registry branch to a file handle */
1512 static void save_registry( struct key
*key
, obj_handle_t handle
)
1517 if (key
->flags
& KEY_DELETED
)
1519 set_error( STATUS_KEY_DELETED
);
1522 if (!(file
= get_file_obj( current
->process
, handle
, GENERIC_WRITE
))) return;
1523 fd
= dup( get_file_unix_fd( file
) );
1524 release_object( file
);
1527 FILE *f
= fdopen( fd
, "w" );
1530 save_all_subkeys( key
, f
);
1531 if (fclose( f
)) file_set_error();
1541 /* save a registry branch to a file */
1542 static int save_branch( struct key
*key
, const char *path
)
1545 char *p
, *real
, *tmp
= NULL
;
1546 int fd
, count
= 0, ret
= 0, by_symlink
;
1549 if (!(key
->flags
& KEY_DIRTY
))
1551 if (debug_level
> 1) dump_operation( key
, NULL
, "Not saving clean" );
1555 /* get the real path */
1557 by_symlink
= (!lstat(path
, &st
) && S_ISLNK (st
.st_mode
));
1558 if (!(real
= malloc( PATH_MAX
))) return 0;
1559 if (!realpath( path
, real
))
1566 /* test the file type */
1568 if ((fd
= open( path
, O_WRONLY
)) != -1)
1570 /* if file is not a regular file or has multiple links or is accessed
1571 * via symbolic links, write directly into it; otherwise use a temp file */
1573 (!fstat( fd
, &st
) && (!S_ISREG(st
.st_mode
) || st
.st_nlink
> 1)))
1581 /* create a temp file in the same directory */
1583 if (!(tmp
= malloc( strlen(path
) + 20 ))) goto done
;
1584 strcpy( tmp
, path
);
1585 if ((p
= strrchr( tmp
, '/' ))) p
++;
1589 sprintf( p
, "reg%lx%04x.tmp", (long) getpid(), count
++ );
1590 if ((fd
= open( tmp
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666 )) != -1) break;
1591 if (errno
!= EEXIST
) goto done
;
1595 /* now save to it */
1598 if (!(f
= fdopen( fd
, "w" )))
1600 if (tmp
) unlink( tmp
);
1605 if (debug_level
> 1)
1607 fprintf( stderr
, "%s: ", path
);
1608 dump_operation( key
, NULL
, "saving" );
1611 save_all_subkeys( key
, f
);
1616 /* if successfully written, rename to final name */
1617 if (ret
) ret
= !rename( tmp
, path
);
1618 if (!ret
) unlink( tmp
);
1624 if (ret
) make_clean( key
);
1628 /* periodic saving of the registry */
1629 static void periodic_save( void *arg
)
1633 save_timeout_user
= NULL
;
1634 for (i
= 0; i
< save_branch_count
; i
++)
1635 save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
);
1636 set_periodic_save_timer();
1639 /* start the periodic save timer */
1640 static void set_periodic_save_timer(void)
1642 struct timeval next
;
1644 gettimeofday( &next
, 0 );
1645 add_timeout( &next
, save_period
);
1646 if (save_timeout_user
) remove_timeout_user( save_timeout_user
);
1647 save_timeout_user
= add_timeout_user( &next
, periodic_save
, 0 );
1650 /* save the modified registry branches to disk */
1651 void flush_registry(void)
1655 for (i
= 0; i
< save_branch_count
; i
++)
1657 if (!save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
))
1659 fprintf( stderr
, "wineserver: could not save registry branch to %s",
1660 save_branch_info
[i
].path
);
1666 /* close the top-level keys; used on server exit */
1667 void close_registry(void)
1671 if (save_timeout_user
) remove_timeout_user( save_timeout_user
);
1672 save_timeout_user
= NULL
;
1673 for (i
= 0; i
< save_branch_count
; i
++) release_object( save_branch_info
[i
].key
);
1674 release_object( root_key
);
1678 /* create a registry key */
1679 DECL_HANDLER(create_key
)
1681 struct key
*key
= NULL
, *parent
;
1682 unsigned int access
= req
->access
;
1683 WCHAR
*name
, *class;
1685 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1687 if (!(name
= copy_req_path( req
->namelen
, !req
->parent
))) return;
1688 if ((parent
= get_hkey_obj( req
->parent
, 0 /*FIXME*/ )))
1690 int flags
= (req
->options
& REG_OPTION_VOLATILE
) ? KEY_VOLATILE
: KEY_DIRTY
;
1692 if (req
->namelen
== get_req_data_size()) /* no class specified */
1694 key
= create_key( parent
, name
, NULL
, flags
, req
->modif
, &reply
->created
);
1698 const WCHAR
*class_ptr
= (const WCHAR
*)((const char *)get_req_data() + req
->namelen
);
1700 if ((class = req_strdupW( req
, class_ptr
, get_req_data_size() - req
->namelen
)))
1702 key
= create_key( parent
, name
, class, flags
, req
->modif
, &reply
->created
);
1708 reply
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1709 release_object( key
);
1711 release_object( parent
);
1715 /* open a registry key */
1716 DECL_HANDLER(open_key
)
1718 struct key
*key
, *parent
;
1719 unsigned int access
= req
->access
;
1721 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1723 if ((parent
= get_hkey_obj( req
->parent
, 0 /*FIXME*/ )))
1725 WCHAR
*name
= copy_path( get_req_data(), get_req_data_size(), !req
->parent
);
1726 if (name
&& (key
= open_key( parent
, name
)))
1728 reply
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1729 release_object( key
);
1731 release_object( parent
);
1735 /* delete a registry key */
1736 DECL_HANDLER(delete_key
)
1740 if ((key
= get_hkey_obj( req
->hkey
, 0 /*FIXME*/ )))
1742 delete_key( key
, 0);
1743 release_object( key
);
1747 /* flush a registry key */
1748 DECL_HANDLER(flush_key
)
1750 struct key
*key
= get_hkey_obj( req
->hkey
, 0 );
1753 /* we don't need to do anything here with the current implementation */
1754 release_object( key
);
1758 /* enumerate registry subkeys */
1759 DECL_HANDLER(enum_key
)
1763 if ((key
= get_hkey_obj( req
->hkey
,
1764 req
->index
== -1 ? KEY_QUERY_VALUE
: KEY_ENUMERATE_SUB_KEYS
)))
1766 enum_key( key
, req
->index
, req
->info_class
, reply
);
1767 release_object( key
);
1771 /* set a value of a registry key */
1772 DECL_HANDLER(set_key_value
)
1777 if (!(name
= copy_req_path( req
->namelen
, 0 ))) return;
1778 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1780 size_t datalen
= get_req_data_size() - req
->namelen
;
1781 const char *data
= (const char *)get_req_data() + req
->namelen
;
1783 set_value( key
, name
, req
->type
, data
, datalen
);
1784 release_object( key
);
1788 /* retrieve the value of a registry key */
1789 DECL_HANDLER(get_key_value
)
1795 if (!(name
= copy_path( get_req_data(), get_req_data_size(), 0 ))) return;
1796 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1798 get_value( key
, name
, &reply
->type
, &reply
->total
);
1799 release_object( key
);
1803 /* enumerate the value of a registry key */
1804 DECL_HANDLER(enum_key_value
)
1808 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1810 enum_value( key
, req
->index
, req
->info_class
, reply
);
1811 release_object( key
);
1815 /* delete a value of a registry key */
1816 DECL_HANDLER(delete_key_value
)
1821 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1823 if ((name
= req_strdupW( req
, get_req_data(), get_req_data_size() )))
1825 delete_value( key
, name
);
1828 release_object( key
);
1832 /* load a registry branch from a file */
1833 DECL_HANDLER(load_registry
)
1835 struct key
*key
, *parent
;
1837 if ((parent
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
| KEY_CREATE_SUB_KEY
)))
1840 WCHAR
*name
= copy_path( get_req_data(), get_req_data_size(), !req
->hkey
);
1841 if (name
&& (key
= create_key( parent
, name
, NULL
, KEY_DIRTY
, time(NULL
), &dummy
)))
1843 load_registry( key
, req
->file
);
1844 release_object( key
);
1846 release_object( parent
);
1850 DECL_HANDLER(unload_registry
)
1854 if ((key
= get_hkey_obj( req
->hkey
, 0 )))
1856 delete_key( key
, 1 ); /* FIXME */
1857 release_object( key
);
1861 /* save a registry branch to a file */
1862 DECL_HANDLER(save_registry
)
1866 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
| KEY_ENUMERATE_SUB_KEYS
)))
1868 save_registry( key
, req
->file
);
1869 release_object( key
);
1873 /* load the user registry files */
1874 DECL_HANDLER(load_user_registries
)
1878 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
| KEY_CREATE_SUB_KEY
)))
1880 load_user_registries( key
);
1881 release_object( key
);
1885 /* add a registry key change notification */
1886 DECL_HANDLER(set_registry_notification
)
1889 struct event
*event
;
1890 struct notify
*notify
;
1892 key
= get_hkey_obj( req
->hkey
, KEY_NOTIFY
);
1895 event
= get_event_obj( current
->process
, req
->event
, SYNCHRONIZE
);
1898 notify
= find_notify( key
, req
->hkey
);
1901 release_object( notify
->event
);
1902 grab_object( event
);
1903 notify
->event
= event
;
1907 notify
= mem_alloc( sizeof(*notify
) );
1910 grab_object( event
);
1911 notify
->event
= event
;
1912 notify
->subtree
= req
->subtree
;
1913 notify
->filter
= req
->filter
;
1914 notify
->hkey
= req
->hkey
;
1915 list_add_head( &key
->notify_list
, ¬ify
->entry
);
1918 release_object( event
);
1920 release_object( key
);