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
26 #include "wine/port.h"
41 #define WIN32_NO_STATUS
50 #include "wine/library.h"
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 */
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 */
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 */
90 WCHAR
*name
; /* value name */
91 unsigned short namelen
; /* length of value name */
92 unsigned short type
; /* value type */
93 size_t len
; /* value data length in bytes */
94 void *data
; /* pointer to value data */
97 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
98 #define MIN_VALUES 8 /* min. number of allocated values per key */
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 */
103 /* the root of the registry tree */
104 static struct key
*root_key
;
106 static const int save_period
= 30000; /* delay between periodic saves (in ms) */
107 static struct timeout_user
*save_timeout_user
; /* saving timer */
109 static void set_periodic_save_timer(void);
111 /* information about where to save a registry branch */
112 struct save_branch_info
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
];
123 /* information about a file being loaded */
124 struct file_load_info
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 */
136 static void key_dump( struct object
*obj
, int verbose
);
137 static int key_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
);
138 static void key_destroy( struct object
*obj
);
140 static const struct object_ops key_ops
=
142 sizeof(struct key
), /* size */
144 no_add_queue
, /* add_queue */
145 NULL
, /* remove_queue */
147 NULL
, /* satisfied */
148 no_signal
, /* signal */
149 no_get_fd
, /* get_fd */
150 no_lookup_name
, /* lookup_name */
151 key_close_handle
, /* close_handle */
152 key_destroy
/* destroy */
157 * The registry text file format v2 used by this code is similar to the one
158 * used by REGEDIT import/export functionality, with the following differences:
159 * - strings and key names can contain \x escapes for Unicode
160 * - key names use escapes too in order to support Unicode
161 * - the modification time optionally follows the key name
162 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
165 static inline char to_hex( char ch
)
167 if (isdigit(ch
)) return ch
- '0';
168 return tolower(ch
) - 'a' + 10;
171 /* dump the full path of a key */
172 static void dump_path( const struct key
*key
, const struct key
*base
, FILE *f
)
174 if (key
->parent
&& key
->parent
!= base
)
176 dump_path( key
->parent
, base
, f
);
177 fprintf( f
, "\\\\" );
179 dump_strW( key
->name
, key
->namelen
/ sizeof(WCHAR
), f
, "[]" );
182 /* dump a value to a text file */
183 static void dump_value( const struct key_value
*value
, FILE *f
)
191 count
= 1 + dump_strW( value
->name
, value
->namelen
/ sizeof(WCHAR
), f
, "\"\"" );
192 count
+= fprintf( f
, "\"=" );
194 else count
= fprintf( f
, "@=" );
201 if (value
->type
!= REG_SZ
) fprintf( f
, "str(%d):", value
->type
);
203 if (value
->data
) dump_strW( (WCHAR
*)value
->data
, value
->len
/ sizeof(WCHAR
), f
, "\"\"" );
207 if (value
->len
== sizeof(DWORD
))
210 memcpy( &dw
, value
->data
, sizeof(DWORD
) );
211 fprintf( f
, "dword:%08lx", dw
);
214 /* else fall through */
216 if (value
->type
== REG_BINARY
) count
+= fprintf( f
, "hex:" );
217 else count
+= fprintf( f
, "hex(%x):", value
->type
);
218 for (i
= 0; i
< value
->len
; i
++)
220 count
+= fprintf( f
, "%02x", *((unsigned char *)value
->data
+ i
) );
221 if (i
< value
->len
-1)
226 fprintf( f
, "\\\n " );
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
)
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))
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
);
251 for (i
= 0; i
<= key
->last_subkey
; i
++) save_subkeys( key
->subkeys
[i
], base
, f
);
254 static void dump_operation( const struct key
*key
, const struct key_value
*value
, const char *op
)
256 fprintf( stderr
, "%s key ", op
);
257 if (key
) dump_path( key
, NULL
, stderr
);
258 else fprintf( stderr
, "ERROR" );
261 fprintf( stderr
, " value ");
262 dump_value( value
, stderr
);
264 else fprintf( stderr
, "\n" );
267 static void key_dump( struct object
*obj
, int verbose
)
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" );
276 /* notify waiter and maybe delete the notification */
277 static void do_notification( struct key
*key
, struct notify
*notify
, int del
)
281 set_event( notify
->event
);
282 release_object( notify
->event
);
283 notify
->event
= NULL
;
287 list_remove( ¬ify
->entry
);
292 static inline struct notify
*find_notify( struct key
*key
, struct process
*process
, obj_handle_t hkey
)
294 struct notify
*notify
;
296 LIST_FOR_EACH_ENTRY( notify
, &key
->notify_list
, struct notify
, entry
)
298 if (notify
->process
== process
&& notify
->hkey
== hkey
) return notify
;
303 /* close the notification associated with a handle */
304 static int key_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
)
306 struct key
* key
= (struct key
*) obj
;
307 struct notify
*notify
= find_notify( key
, process
, handle
);
308 if (notify
) do_notification( key
, notify
, 1 );
309 return 1; /* ok to close */
312 static void key_destroy( struct object
*obj
)
316 struct key
*key
= (struct key
*)obj
;
317 assert( obj
->ops
== &key_ops
);
319 if (key
->name
) free( key
->name
);
320 if (key
->class) free( key
->class );
321 for (i
= 0; i
<= key
->last_value
; i
++)
323 if (key
->values
[i
].name
) free( key
->values
[i
].name
);
324 if (key
->values
[i
].data
) free( key
->values
[i
].data
);
326 if (key
->values
) free( key
->values
);
327 for (i
= 0; i
<= key
->last_subkey
; i
++)
329 key
->subkeys
[i
]->parent
= NULL
;
330 release_object( key
->subkeys
[i
] );
332 if (key
->subkeys
) free( key
->subkeys
);
333 /* unconditionally notify everything waiting on this key */
334 while ((ptr
= list_head( &key
->notify_list
)))
336 struct notify
*notify
= LIST_ENTRY( ptr
, struct notify
, entry
);
337 do_notification( key
, notify
, 1 );
341 /* get the request vararg as registry path */
342 inline static void get_req_path( struct unicode_str
*str
, int skip_root
)
344 static const WCHAR root_name
[] = { '\\','R','e','g','i','s','t','r','y','\\' };
346 str
->str
= get_req_data();
347 str
->len
= (get_req_data_size() / sizeof(WCHAR
)) * sizeof(WCHAR
);
349 if (skip_root
&& str
->len
>= sizeof(root_name
) &&
350 !memicmpW( str
->str
, root_name
, sizeof(root_name
)/sizeof(WCHAR
) ))
352 str
->str
+= sizeof(root_name
)/sizeof(WCHAR
);
353 str
->len
-= sizeof(root_name
);
357 /* return the next token in a given path */
358 /* token->str must point inside the path, or be NULL for the first call */
359 static struct unicode_str
*get_path_token( const struct unicode_str
*path
, struct unicode_str
*token
)
361 size_t i
= 0, len
= path
->len
/ sizeof(WCHAR
);
363 if (!token
->str
) /* first time */
365 /* path cannot start with a backslash */
366 if (len
&& path
->str
[0] == '\\')
368 set_error( STATUS_OBJECT_PATH_INVALID
);
374 i
= token
->str
- path
->str
;
375 i
+= token
->len
/ sizeof(WCHAR
);
376 while (i
< len
&& path
->str
[i
] == '\\') i
++;
378 token
->str
= path
->str
+ i
;
379 while (i
< len
&& path
->str
[i
] != '\\') i
++;
380 token
->len
= (path
->str
+ i
- token
->str
) * sizeof(WCHAR
);
384 /* allocate a key object */
385 static struct key
*alloc_key( const struct unicode_str
*name
, time_t modif
)
388 if ((key
= alloc_object( &key_ops
)))
392 key
->namelen
= name
->len
;
395 key
->last_subkey
= -1;
399 key
->last_value
= -1;
403 list_init( &key
->notify_list
);
404 if (name
->len
&& !(key
->name
= memdup( name
->str
, name
->len
)))
406 release_object( key
);
413 /* mark a key and all its parents as dirty (modified) */
414 static void make_dirty( struct key
*key
)
418 if (key
->flags
& (KEY_DIRTY
|KEY_VOLATILE
)) return; /* nothing to do */
419 key
->flags
|= KEY_DIRTY
;
424 /* mark a key and all its subkeys as clean (not modified) */
425 static void make_clean( struct key
*key
)
429 if (key
->flags
& KEY_VOLATILE
) return;
430 if (!(key
->flags
& KEY_DIRTY
)) return;
431 key
->flags
&= ~KEY_DIRTY
;
432 for (i
= 0; i
<= key
->last_subkey
; i
++) make_clean( key
->subkeys
[i
] );
435 /* go through all the notifications and send them if necessary */
436 static void check_notify( struct key
*key
, unsigned int change
, int not_subtree
)
438 struct list
*ptr
, *next
;
440 LIST_FOR_EACH_SAFE( ptr
, next
, &key
->notify_list
)
442 struct notify
*n
= LIST_ENTRY( ptr
, struct notify
, entry
);
443 if ( ( not_subtree
|| n
->subtree
) && ( change
& n
->filter
) )
444 do_notification( key
, n
, 0 );
448 /* update key modification time */
449 static void touch_key( struct key
*key
, unsigned int change
)
453 key
->modif
= time(NULL
);
456 /* do notifications */
457 check_notify( key
, change
, 1 );
458 for ( k
= key
->parent
; k
; k
= k
->parent
)
459 check_notify( k
, change
& ~REG_NOTIFY_CHANGE_LAST_SET
, 0 );
462 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
463 static int grow_subkeys( struct key
*key
)
465 struct key
**new_subkeys
;
470 nb_subkeys
= key
->nb_subkeys
+ (key
->nb_subkeys
/ 2); /* grow by 50% */
471 if (!(new_subkeys
= realloc( key
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) )))
473 set_error( STATUS_NO_MEMORY
);
479 nb_subkeys
= MIN_VALUES
;
480 if (!(new_subkeys
= mem_alloc( nb_subkeys
* sizeof(*new_subkeys
) ))) return 0;
482 key
->subkeys
= new_subkeys
;
483 key
->nb_subkeys
= nb_subkeys
;
487 /* allocate a subkey for a given key, and return its index */
488 static struct key
*alloc_subkey( struct key
*parent
, const struct unicode_str
*name
,
489 int index
, time_t modif
)
494 if (name
->len
> MAX_NAME_LEN
* sizeof(WCHAR
))
496 set_error( STATUS_NAME_TOO_LONG
);
499 if (parent
->last_subkey
+ 1 == parent
->nb_subkeys
)
501 /* need to grow the array */
502 if (!grow_subkeys( parent
)) return NULL
;
504 if ((key
= alloc_key( name
, modif
)) != NULL
)
506 key
->parent
= parent
;
507 for (i
= ++parent
->last_subkey
; i
> index
; i
--)
508 parent
->subkeys
[i
] = parent
->subkeys
[i
-1];
509 parent
->subkeys
[index
] = key
;
514 /* free a subkey of a given key */
515 static void free_subkey( struct key
*parent
, int index
)
520 assert( index
>= 0 );
521 assert( index
<= parent
->last_subkey
);
523 key
= parent
->subkeys
[index
];
524 for (i
= index
; i
< parent
->last_subkey
; i
++) parent
->subkeys
[i
] = parent
->subkeys
[i
+ 1];
525 parent
->last_subkey
--;
526 key
->flags
|= KEY_DELETED
;
528 release_object( key
);
530 /* try to shrink the array */
531 nb_subkeys
= parent
->nb_subkeys
;
532 if (nb_subkeys
> MIN_SUBKEYS
&& parent
->last_subkey
< nb_subkeys
/ 2)
534 struct key
**new_subkeys
;
535 nb_subkeys
-= nb_subkeys
/ 3; /* shrink by 33% */
536 if (nb_subkeys
< MIN_SUBKEYS
) nb_subkeys
= MIN_SUBKEYS
;
537 if (!(new_subkeys
= realloc( parent
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) ))) return;
538 parent
->subkeys
= new_subkeys
;
539 parent
->nb_subkeys
= nb_subkeys
;
543 /* find the named child of a given key and return its index */
544 static struct key
*find_subkey( const struct key
*key
, const struct unicode_str
*name
, int *index
)
546 int i
, min
, max
, res
;
550 max
= key
->last_subkey
;
554 len
= min( key
->subkeys
[i
]->namelen
, name
->len
);
555 res
= memicmpW( key
->subkeys
[i
]->name
, name
->str
, len
/ sizeof(WCHAR
) );
556 if (!res
) res
= key
->subkeys
[i
]->namelen
- name
->len
;
560 return key
->subkeys
[i
];
562 if (res
> 0) max
= i
- 1;
565 *index
= min
; /* this is where we should insert it */
570 static struct key
*open_key( struct key
*key
, const struct unicode_str
*name
)
573 struct unicode_str token
;
576 if (!get_path_token( name
, &token
)) return NULL
;
579 if (!(key
= find_subkey( key
, &token
, &index
)))
581 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
584 get_path_token( name
, &token
);
587 if (debug_level
> 1) dump_operation( key
, NULL
, "Open" );
588 if (key
) grab_object( key
);
592 /* create a subkey */
593 static struct key
*create_key( struct key
*key
, const struct unicode_str
*name
,
594 const struct unicode_str
*class, int flags
, time_t modif
, int *created
)
598 struct unicode_str token
;
600 if (key
->flags
& KEY_DELETED
) /* we cannot create a subkey under a deleted key */
602 set_error( STATUS_KEY_DELETED
);
605 if (!(flags
& KEY_VOLATILE
) && (key
->flags
& KEY_VOLATILE
))
607 set_error( STATUS_CHILD_MUST_BE_VOLATILE
);
610 if (!modif
) modif
= time(NULL
);
613 if (!get_path_token( name
, &token
)) return NULL
;
618 if (!(subkey
= find_subkey( key
, &token
, &index
))) break;
620 get_path_token( name
, &token
);
623 /* create the remaining part */
625 if (!token
.len
) goto done
;
627 if (flags
& KEY_DIRTY
) make_dirty( key
);
628 if (!(key
= alloc_subkey( key
, &token
, index
, modif
))) return NULL
;
633 get_path_token( name
, &token
);
634 if (!token
.len
) break;
635 /* we know the index is always 0 in a new key */
636 if (!(key
= alloc_subkey( key
, &token
, 0, modif
)))
638 free_subkey( base
, index
);
644 if (debug_level
> 1) dump_operation( key
, NULL
, "Create" );
645 if (class && class->len
)
647 key
->classlen
= class->len
;
648 if (!(key
->class = memdup( class->str
, key
->classlen
))) key
->classlen
= 0;
654 /* query information about a key or a subkey */
655 static void enum_key( const struct key
*key
, int index
, int info_class
,
656 struct enum_key_reply
*reply
)
659 size_t len
, namelen
, classlen
;
660 int max_subkey
= 0, max_class
= 0;
661 int max_value
= 0, max_data
= 0;
664 if (index
!= -1) /* -1 means use the specified key directly */
666 if ((index
< 0) || (index
> key
->last_subkey
))
668 set_error( STATUS_NO_MORE_ENTRIES
);
671 key
= key
->subkeys
[index
];
674 namelen
= key
->namelen
;
675 classlen
= key
->classlen
;
679 case KeyBasicInformation
:
680 classlen
= 0; /* only return the name */
682 case KeyNodeInformation
:
683 reply
->max_subkey
= 0;
684 reply
->max_class
= 0;
685 reply
->max_value
= 0;
688 case KeyFullInformation
:
689 for (i
= 0; i
<= key
->last_subkey
; i
++)
691 struct key
*subkey
= key
->subkeys
[i
];
692 len
= subkey
->namelen
/ sizeof(WCHAR
);
693 if (len
> max_subkey
) max_subkey
= len
;
694 len
= subkey
->classlen
/ sizeof(WCHAR
);
695 if (len
> max_class
) max_class
= len
;
697 for (i
= 0; i
<= key
->last_value
; i
++)
699 len
= key
->values
[i
].namelen
/ sizeof(WCHAR
);
700 if (len
> max_value
) max_value
= len
;
701 len
= key
->values
[i
].len
;
702 if (len
> max_data
) max_data
= len
;
704 reply
->max_subkey
= max_subkey
;
705 reply
->max_class
= max_class
;
706 reply
->max_value
= max_value
;
707 reply
->max_data
= max_data
;
708 namelen
= 0; /* only return the class */
711 set_error( STATUS_INVALID_PARAMETER
);
714 reply
->subkeys
= key
->last_subkey
+ 1;
715 reply
->values
= key
->last_value
+ 1;
716 reply
->modif
= key
->modif
;
717 reply
->total
= namelen
+ classlen
;
719 len
= min( reply
->total
, get_reply_max_size() );
720 if (len
&& (data
= set_reply_data_size( len
)))
724 reply
->namelen
= namelen
;
725 memcpy( data
, key
->name
, namelen
);
726 memcpy( data
+ namelen
, key
->class, len
- namelen
);
730 reply
->namelen
= len
;
731 memcpy( data
, key
->name
, len
);
734 if (debug_level
> 1) dump_operation( key
, NULL
, "Enum" );
737 /* delete a key and its values */
738 static int delete_key( struct key
*key
, int recurse
)
743 /* must find parent and index */
746 set_error( STATUS_ACCESS_DENIED
);
749 if (!(parent
= key
->parent
) || (key
->flags
& KEY_DELETED
))
751 set_error( STATUS_KEY_DELETED
);
755 while (recurse
&& (key
->last_subkey
>=0))
756 if (0 > delete_key(key
->subkeys
[key
->last_subkey
], 1))
759 for (index
= 0; index
<= parent
->last_subkey
; index
++)
760 if (parent
->subkeys
[index
] == key
) break;
761 assert( index
<= parent
->last_subkey
);
763 /* we can only delete a key that has no subkeys */
764 if (key
->last_subkey
>= 0)
766 set_error( STATUS_ACCESS_DENIED
);
770 if (debug_level
> 1) dump_operation( key
, NULL
, "Delete" );
771 free_subkey( parent
, index
);
772 touch_key( parent
, REG_NOTIFY_CHANGE_NAME
);
776 /* try to grow the array of values; return 1 if OK, 0 on error */
777 static int grow_values( struct key
*key
)
779 struct key_value
*new_val
;
784 nb_values
= key
->nb_values
+ (key
->nb_values
/ 2); /* grow by 50% */
785 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) )))
787 set_error( STATUS_NO_MEMORY
);
793 nb_values
= MIN_VALUES
;
794 if (!(new_val
= mem_alloc( nb_values
* sizeof(*new_val
) ))) return 0;
796 key
->values
= new_val
;
797 key
->nb_values
= nb_values
;
801 /* find the named value of a given key and return its index in the array */
802 static struct key_value
*find_value( const struct key
*key
, const struct unicode_str
*name
, int *index
)
804 int i
, min
, max
, res
;
808 max
= key
->last_value
;
812 len
= min( key
->values
[i
].namelen
, name
->len
);
813 res
= memicmpW( key
->values
[i
].name
, name
->str
, len
/ sizeof(WCHAR
) );
814 if (!res
) res
= key
->values
[i
].namelen
- name
->len
;
818 return &key
->values
[i
];
820 if (res
> 0) max
= i
- 1;
823 *index
= min
; /* this is where we should insert it */
827 /* insert a new value; the index must have been returned by find_value */
828 static struct key_value
*insert_value( struct key
*key
, const struct unicode_str
*name
, int index
)
830 struct key_value
*value
;
831 WCHAR
*new_name
= NULL
;
834 if (name
->len
> MAX_VALUE_LEN
* sizeof(WCHAR
))
836 set_error( STATUS_NAME_TOO_LONG
);
839 if (key
->last_value
+ 1 == key
->nb_values
)
841 if (!grow_values( key
)) return NULL
;
843 if (name
->len
&& !(new_name
= memdup( name
->str
, name
->len
))) return NULL
;
844 for (i
= ++key
->last_value
; i
> index
; i
--) key
->values
[i
] = key
->values
[i
- 1];
845 value
= &key
->values
[index
];
846 value
->name
= new_name
;
847 value
->namelen
= name
->len
;
853 /* set a key value */
854 static void set_value( struct key
*key
, const struct unicode_str
*name
,
855 int type
, const void *data
, size_t len
)
857 struct key_value
*value
;
861 if ((value
= find_value( key
, name
, &index
)))
863 /* check if the new value is identical to the existing one */
864 if (value
->type
== type
&& value
->len
== len
&&
865 value
->data
&& !memcmp( value
->data
, data
, len
))
867 if (debug_level
> 1) dump_operation( key
, value
, "Skip setting" );
872 if (len
&& !(ptr
= memdup( data
, len
))) return;
876 if (!(value
= insert_value( key
, name
, index
)))
878 if (ptr
) free( ptr
);
882 else if (value
->data
) free( value
->data
); /* already existing, free previous data */
887 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
888 if (debug_level
> 1) dump_operation( key
, value
, "Set" );
891 /* get a key value */
892 static void get_value( struct key
*key
, const struct unicode_str
*name
, int *type
, size_t *len
)
894 struct key_value
*value
;
897 if ((value
= find_value( key
, name
, &index
)))
901 if (value
->data
) set_reply_data( value
->data
, min( value
->len
, get_reply_max_size() ));
902 if (debug_level
> 1) dump_operation( key
, value
, "Get" );
907 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
911 /* enumerate a key value */
912 static void enum_value( struct key
*key
, int i
, int info_class
, struct enum_key_value_reply
*reply
)
914 struct key_value
*value
;
916 if (i
< 0 || i
> key
->last_value
) set_error( STATUS_NO_MORE_ENTRIES
);
920 size_t namelen
, maxlen
;
922 value
= &key
->values
[i
];
923 reply
->type
= value
->type
;
924 namelen
= value
->namelen
;
928 case KeyValueBasicInformation
:
929 reply
->total
= namelen
;
931 case KeyValueFullInformation
:
932 reply
->total
= namelen
+ value
->len
;
934 case KeyValuePartialInformation
:
935 reply
->total
= value
->len
;
939 set_error( STATUS_INVALID_PARAMETER
);
943 maxlen
= min( reply
->total
, get_reply_max_size() );
944 if (maxlen
&& ((data
= set_reply_data_size( maxlen
))))
946 if (maxlen
> namelen
)
948 reply
->namelen
= namelen
;
949 memcpy( data
, value
->name
, namelen
);
950 memcpy( (char *)data
+ namelen
, value
->data
, maxlen
- namelen
);
954 reply
->namelen
= maxlen
;
955 memcpy( data
, value
->name
, maxlen
);
958 if (debug_level
> 1) dump_operation( key
, value
, "Enum" );
963 static void delete_value( struct key
*key
, const struct unicode_str
*name
)
965 struct key_value
*value
;
966 int i
, index
, nb_values
;
968 if (!(value
= find_value( key
, name
, &index
)))
970 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
973 if (debug_level
> 1) dump_operation( key
, value
, "Delete" );
974 if (value
->name
) free( value
->name
);
975 if (value
->data
) free( value
->data
);
976 for (i
= index
; i
< key
->last_value
; i
++) key
->values
[i
] = key
->values
[i
+ 1];
978 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
980 /* try to shrink the array */
981 nb_values
= key
->nb_values
;
982 if (nb_values
> MIN_VALUES
&& key
->last_value
< nb_values
/ 2)
984 struct key_value
*new_val
;
985 nb_values
-= nb_values
/ 3; /* shrink by 33% */
986 if (nb_values
< MIN_VALUES
) nb_values
= MIN_VALUES
;
987 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) ))) return;
988 key
->values
= new_val
;
989 key
->nb_values
= nb_values
;
993 /* get the registry key corresponding to an hkey handle */
994 static struct key
*get_hkey_obj( obj_handle_t hkey
, unsigned int access
)
996 if (!hkey
) return (struct key
*)grab_object( root_key
);
997 return (struct key
*)get_handle_obj( current
->process
, hkey
, access
, &key_ops
);
1000 /* read a line from the input file */
1001 static int read_next_line( struct file_load_info
*info
)
1004 int newlen
, pos
= 0;
1009 if (!fgets( info
->buffer
+ pos
, info
->len
- pos
, info
->file
))
1010 return (pos
!= 0); /* EOF */
1011 pos
= strlen(info
->buffer
);
1012 if (info
->buffer
[pos
-1] == '\n')
1014 /* got a full line */
1015 info
->buffer
[--pos
] = 0;
1016 if (pos
> 0 && info
->buffer
[pos
-1] == '\r') info
->buffer
[pos
-1] = 0;
1019 if (pos
< info
->len
- 1) return 1; /* EOF but something was read */
1021 /* need to enlarge the buffer */
1022 newlen
= info
->len
+ info
->len
/ 2;
1023 if (!(newbuf
= realloc( info
->buffer
, newlen
)))
1025 set_error( STATUS_NO_MEMORY
);
1028 info
->buffer
= newbuf
;
1033 /* make sure the temp buffer holds enough space */
1034 static int get_file_tmp_space( struct file_load_info
*info
, size_t size
)
1037 if (info
->tmplen
>= size
) return 1;
1038 if (!(tmp
= realloc( info
->tmp
, size
)))
1040 set_error( STATUS_NO_MEMORY
);
1044 info
->tmplen
= size
;
1048 /* report an error while loading an input file */
1049 static void file_read_error( const char *err
, struct file_load_info
*info
)
1052 fprintf( stderr
, "%s:%d: %s '%s'\n", info
->filename
, info
->line
, err
, info
->buffer
);
1054 fprintf( stderr
, "<fd>:%d: %s '%s'\n", info
->line
, err
, info
->buffer
);
1057 /* parse an escaped string back into Unicode */
1058 /* return the number of chars read from the input, or -1 on output overflow */
1059 static int parse_strW( WCHAR
*dest
, size_t *len
, const char *src
, char endchar
)
1061 size_t count
= sizeof(WCHAR
); /* for terminating null */
1062 const char *p
= src
;
1063 while (*p
&& *p
!= endchar
)
1065 if (*p
!= '\\') *dest
= (WCHAR
)*p
++;
1071 case 'a': *dest
= '\a'; p
++; break;
1072 case 'b': *dest
= '\b'; p
++; break;
1073 case 'e': *dest
= '\e'; p
++; break;
1074 case 'f': *dest
= '\f'; p
++; break;
1075 case 'n': *dest
= '\n'; p
++; break;
1076 case 'r': *dest
= '\r'; p
++; break;
1077 case 't': *dest
= '\t'; p
++; break;
1078 case 'v': *dest
= '\v'; p
++; break;
1079 case 'x': /* hex escape */
1081 if (!isxdigit(*p
)) *dest
= 'x';
1084 *dest
= to_hex(*p
++);
1085 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1086 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1087 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
1097 case '7': /* octal escape */
1099 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
1100 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
1103 *dest
= (WCHAR
)*p
++;
1107 if ((count
+= sizeof(WCHAR
)) > *len
) return -1; /* dest buffer overflow */
1111 if (!*p
) return -1; /* delimiter not found */
1116 /* convert a data type tag to a value type */
1117 static int get_data_type( const char *buffer
, int *type
, int *parse_type
)
1119 struct data_type
{ const char *tag
; int len
; int type
; int parse_type
; };
1121 static const struct data_type data_types
[] =
1122 { /* actual type */ /* type to assume for parsing */
1123 { "\"", 1, REG_SZ
, REG_SZ
},
1124 { "str:\"", 5, REG_SZ
, REG_SZ
},
1125 { "str(2):\"", 8, REG_EXPAND_SZ
, REG_SZ
},
1126 { "str(7):\"", 8, REG_MULTI_SZ
, REG_SZ
},
1127 { "hex:", 4, REG_BINARY
, REG_BINARY
},
1128 { "dword:", 6, REG_DWORD
, REG_DWORD
},
1129 { "hex(", 4, -1, REG_BINARY
},
1133 const struct data_type
*ptr
;
1136 for (ptr
= data_types
; ptr
->tag
; ptr
++)
1138 if (memcmp( ptr
->tag
, buffer
, ptr
->len
)) continue;
1139 *parse_type
= ptr
->parse_type
;
1140 if ((*type
= ptr
->type
) != -1) return ptr
->len
;
1141 /* "hex(xx):" is special */
1142 *type
= (int)strtoul( buffer
+ 4, &end
, 16 );
1143 if ((end
<= buffer
) || memcmp( end
, "):", 2 )) return 0;
1144 return end
+ 2 - buffer
;
1149 /* load and create a key from the input file */
1150 static struct key
*load_key( struct key
*base
, const char *buffer
, int flags
,
1151 int prefix_len
, struct file_load_info
*info
,
1155 struct unicode_str name
;
1157 size_t len
= strlen(buffer
) * sizeof(WCHAR
);
1159 if (!get_file_tmp_space( info
, len
)) return NULL
;
1161 if ((res
= parse_strW( info
->tmp
, &len
, buffer
, ']' )) == -1)
1163 file_read_error( "Malformed key", info
);
1166 if (sscanf( buffer
+ res
, " %d", &modif
) != 1) modif
= default_modif
;
1169 while (prefix_len
&& *p
) { if (*p
++ == '\\') prefix_len
--; }
1175 file_read_error( "Malformed key", info
);
1178 /* empty key name, return base key */
1179 return (struct key
*)grab_object( base
);
1182 name
.len
= len
- (p
- info
->tmp
+ 1) * sizeof(WCHAR
);
1183 return create_key( base
, &name
, NULL
, flags
, modif
, &res
);
1186 /* parse a comma-separated list of hex digits */
1187 static int parse_hex( unsigned char *dest
, size_t *len
, const char *buffer
)
1189 const char *p
= buffer
;
1191 while (isxdigit(*p
))
1195 memcpy( buf
, p
, 2 );
1197 sscanf( buf
, "%x", &val
);
1198 if (count
++ >= *len
) return -1; /* dest buffer overflow */
1199 *dest
++ = (unsigned char )val
;
1207 /* parse a value name and create the corresponding value */
1208 static struct key_value
*parse_value_name( struct key
*key
, const char *buffer
, size_t *len
,
1209 struct file_load_info
*info
)
1211 struct key_value
*value
;
1212 struct unicode_str name
;
1214 size_t maxlen
= strlen(buffer
) * sizeof(WCHAR
);
1216 if (!get_file_tmp_space( info
, maxlen
)) return NULL
;
1217 name
.str
= info
->tmp
;
1218 if (buffer
[0] == '@')
1225 if ((*len
= parse_strW( info
->tmp
, &maxlen
, buffer
+ 1, '\"' )) == -1) goto error
;
1226 name
.len
= maxlen
- sizeof(WCHAR
);
1227 (*len
)++; /* for initial quote */
1229 while (isspace(buffer
[*len
])) (*len
)++;
1230 if (buffer
[*len
] != '=') goto error
;
1232 while (isspace(buffer
[*len
])) (*len
)++;
1233 if (!(value
= find_value( key
, &name
, &index
))) value
= insert_value( key
, &name
, index
);
1237 file_read_error( "Malformed value name", info
);
1241 /* load a value from the input file */
1242 static int load_value( struct key
*key
, const char *buffer
, struct file_load_info
*info
)
1246 int res
, type
, parse_type
;
1248 struct key_value
*value
;
1250 if (!(value
= parse_value_name( key
, buffer
, &len
, info
))) return 0;
1251 if (!(res
= get_data_type( buffer
+ len
, &type
, &parse_type
))) goto error
;
1252 buffer
+= len
+ res
;
1257 len
= strlen(buffer
) * sizeof(WCHAR
);
1258 if (!get_file_tmp_space( info
, len
)) return 0;
1259 if ((res
= parse_strW( info
->tmp
, &len
, buffer
, '\"' )) == -1) goto error
;
1263 dw
= strtoul( buffer
, NULL
, 16 );
1267 case REG_BINARY
: /* hex digits */
1271 maxlen
= 1 + strlen(buffer
)/3; /* 3 chars for one hex byte */
1272 if (!get_file_tmp_space( info
, len
+ maxlen
)) return 0;
1273 if ((res
= parse_hex( (unsigned char *)info
->tmp
+ len
, &maxlen
, buffer
)) == -1) goto error
;
1276 while (isspace(*buffer
)) buffer
++;
1277 if (!*buffer
) break;
1278 if (*buffer
!= '\\') goto error
;
1279 if (read_next_line( info
) != 1) goto error
;
1280 buffer
= info
->buffer
;
1281 while (isspace(*buffer
)) buffer
++;
1287 ptr
= NULL
; /* keep compiler quiet */
1291 if (!len
) newptr
= NULL
;
1292 else if (!(newptr
= memdup( ptr
, len
))) return 0;
1294 if (value
->data
) free( value
->data
);
1295 value
->data
= newptr
;
1302 file_read_error( "Malformed value", info
);
1306 /* return the length (in path elements) of name that is part of the key name */
1307 /* for instance if key is USER\foo\bar and name is foo\bar\baz, return 2 */
1308 static int get_prefix_len( struct key
*key
, const char *name
, struct file_load_info
*info
)
1312 size_t len
= strlen(name
) * sizeof(WCHAR
);
1314 if (!get_file_tmp_space( info
, len
)) return 0;
1316 if ((res
= parse_strW( info
->tmp
, &len
, name
, ']' )) == -1)
1318 file_read_error( "Malformed key", info
);
1321 for (p
= info
->tmp
; *p
; p
++) if (*p
== '\\') break;
1322 len
= (p
- info
->tmp
) * sizeof(WCHAR
);
1323 for (res
= 1; key
!= root_key
; res
++)
1325 if (len
== key
->namelen
&& !memicmpW( info
->tmp
, key
->name
, len
/ sizeof(WCHAR
) )) break;
1328 if (key
== root_key
) res
= 0; /* no matching name */
1332 /* load all the keys from the input file */
1333 /* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1334 static void load_keys( struct key
*key
, const char *filename
, FILE *f
, int prefix_len
)
1336 struct key
*subkey
= NULL
;
1337 struct file_load_info info
;
1339 int default_modif
= time(NULL
);
1340 int flags
= (key
->flags
& KEY_VOLATILE
) ? KEY_VOLATILE
: KEY_DIRTY
;
1342 info
.filename
= filename
;
1347 if (!(info
.buffer
= mem_alloc( info
.len
))) return;
1348 if (!(info
.tmp
= mem_alloc( info
.tmplen
)))
1350 free( info
.buffer
);
1354 if ((read_next_line( &info
) != 1) ||
1355 strcmp( info
.buffer
, "WINE REGISTRY Version 2" ))
1357 set_error( STATUS_NOT_REGISTRY_FILE
);
1361 while (read_next_line( &info
) == 1)
1364 while (*p
&& isspace(*p
)) p
++;
1367 case '[': /* new key */
1368 if (subkey
) release_object( subkey
);
1369 if (prefix_len
== -1) prefix_len
= get_prefix_len( key
, p
+ 1, &info
);
1370 if (!(subkey
= load_key( key
, p
+ 1, flags
, prefix_len
, &info
, default_modif
)))
1371 file_read_error( "Error creating key", &info
);
1373 case '@': /* default value */
1374 case '\"': /* value */
1375 if (subkey
) load_value( subkey
, p
, &info
);
1376 else file_read_error( "Value without key", &info
);
1378 case '#': /* comment */
1379 case ';': /* comment */
1380 case 0: /* empty line */
1383 file_read_error( "Unrecognized input", &info
);
1389 if (subkey
) release_object( subkey
);
1390 free( info
.buffer
);
1394 /* load a part of the registry from a file */
1395 static void load_registry( struct key
*key
, obj_handle_t handle
)
1400 if (!(file
= get_file_obj( current
->process
, handle
, GENERIC_READ
))) return;
1401 fd
= dup( get_file_unix_fd( file
) );
1402 release_object( file
);
1405 FILE *f
= fdopen( fd
, "r" );
1408 load_keys( key
, NULL
, f
, -1 );
1411 else file_set_error();
1415 /* load one of the initial registry files */
1416 static void load_init_registry_from_file( const char *filename
, struct key
*key
)
1420 if ((f
= fopen( filename
, "r" )))
1422 load_keys( key
, filename
, f
, 0 );
1424 if (get_error() == STATUS_NOT_REGISTRY_FILE
)
1426 fprintf( stderr
, "%s is not a valid registry file\n", filename
);
1431 assert( save_branch_count
< MAX_SAVE_BRANCH_INFO
);
1433 if ((save_branch_info
[save_branch_count
].path
= strdup( filename
)))
1434 save_branch_info
[save_branch_count
++].key
= (struct key
*)grab_object( key
);
1437 static WCHAR
*format_user_registry_path( const SID
*sid
, struct unicode_str
*path
)
1439 static const WCHAR prefixW
[] = {'U','s','e','r','\\','S',0};
1440 static const WCHAR formatW
[] = {'-','%','u',0};
1441 WCHAR buffer
[7 + 10 + 10 + 10 * SID_MAX_SUB_AUTHORITIES
];
1445 strcpyW( p
, prefixW
);
1446 p
+= strlenW( prefixW
);
1447 p
+= sprintfW( p
, formatW
, sid
->Revision
);
1448 p
+= sprintfW( p
, formatW
, MAKELONG( MAKEWORD( sid
->IdentifierAuthority
.Value
[5],
1449 sid
->IdentifierAuthority
.Value
[4] ),
1450 MAKEWORD( sid
->IdentifierAuthority
.Value
[3],
1451 sid
->IdentifierAuthority
.Value
[2] )));
1452 for (i
= 0; i
< sid
->SubAuthorityCount
; i
++)
1453 p
+= sprintfW( p
, formatW
, sid
->SubAuthority
[i
] );
1455 path
->len
= (p
- buffer
) * sizeof(WCHAR
);
1456 path
->str
= p
= memdup( buffer
, path
->len
);
1460 /* registry initialisation */
1461 void init_registry(void)
1463 static const WCHAR HKLM
[] = { 'M','a','c','h','i','n','e' };
1464 static const WCHAR HKU_default
[] = { 'U','s','e','r','\\','.','D','e','f','a','u','l','t' };
1465 static const struct unicode_str root_name
= { NULL
, 0 };
1466 static const struct unicode_str HKLM_name
= { HKLM
, sizeof(HKLM
) };
1467 static const struct unicode_str HKU_name
= { HKU_default
, sizeof(HKU_default
) };
1469 WCHAR
*current_user_path
;
1470 struct unicode_str current_user_str
;
1472 const char *config
= wine_get_config_dir();
1477 /* create the root key */
1478 root_key
= alloc_key( &root_name
, time(NULL
) );
1481 if (!(filename
= malloc( strlen(config
) + 16 ))) fatal_error( "out of memory\n" );
1482 strcpy( filename
, config
);
1483 p
= filename
+ strlen(filename
);
1485 /* load system.reg into Registry\Machine */
1487 if (!(key
= create_key( root_key
, &HKLM_name
, NULL
, 0, time(NULL
), &dummy
)))
1488 fatal_error( "could not create Machine registry key\n" );
1490 strcpy( p
, "/system.reg" );
1491 load_init_registry_from_file( filename
, key
);
1492 release_object( key
);
1494 /* load userdef.reg into Registry\User\.Default */
1496 if (!(key
= create_key( root_key
, &HKU_name
, NULL
, 0, time(NULL
), &dummy
)))
1497 fatal_error( "could not create User\\.Default registry key\n" );
1499 strcpy( p
, "/userdef.reg" );
1500 load_init_registry_from_file( filename
, key
);
1501 release_object( key
);
1503 /* load user.reg into HKEY_CURRENT_USER */
1505 /* FIXME: match default user in token.c. should get from process token instead */
1506 current_user_path
= format_user_registry_path( security_interactive_sid
, ¤t_user_str
);
1507 if (!current_user_path
||
1508 !(key
= create_key( root_key
, ¤t_user_str
, NULL
, 0, time(NULL
), &dummy
)))
1509 fatal_error( "could not create HKEY_CURRENT_USER registry key\n" );
1510 free( current_user_path
);
1511 strcpy( p
, "/user.reg" );
1512 load_init_registry_from_file( filename
, key
);
1513 release_object( key
);
1517 /* start the periodic save timer */
1518 set_periodic_save_timer();
1521 /* save a registry branch to a file */
1522 static void save_all_subkeys( struct key
*key
, FILE *f
)
1524 fprintf( f
, "WINE REGISTRY Version 2\n" );
1525 fprintf( f
, ";; All keys relative to " );
1526 dump_path( key
, NULL
, f
);
1528 save_subkeys( key
, key
, f
);
1531 /* save a registry branch to a file handle */
1532 static void save_registry( struct key
*key
, obj_handle_t handle
)
1537 if (key
->flags
& KEY_DELETED
)
1539 set_error( STATUS_KEY_DELETED
);
1542 if (!(file
= get_file_obj( current
->process
, handle
, GENERIC_WRITE
))) return;
1543 fd
= dup( get_file_unix_fd( file
) );
1544 release_object( file
);
1547 FILE *f
= fdopen( fd
, "w" );
1550 save_all_subkeys( key
, f
);
1551 if (fclose( f
)) file_set_error();
1561 /* save a registry branch to a file */
1562 static int save_branch( struct key
*key
, const char *path
)
1565 char *p
, *real
, *tmp
= NULL
;
1566 int fd
, count
= 0, ret
= 0, by_symlink
;
1569 if (!(key
->flags
& KEY_DIRTY
))
1571 if (debug_level
> 1) dump_operation( key
, NULL
, "Not saving clean" );
1575 /* get the real path */
1577 by_symlink
= (!lstat(path
, &st
) && S_ISLNK (st
.st_mode
));
1578 if (!(real
= malloc( PATH_MAX
))) return 0;
1579 if (!realpath( path
, real
))
1586 /* test the file type */
1588 if ((fd
= open( path
, O_WRONLY
)) != -1)
1590 /* if file is not a regular file or has multiple links or is accessed
1591 * via symbolic links, write directly into it; otherwise use a temp file */
1593 (!fstat( fd
, &st
) && (!S_ISREG(st
.st_mode
) || st
.st_nlink
> 1)))
1601 /* create a temp file in the same directory */
1603 if (!(tmp
= malloc( strlen(path
) + 20 ))) goto done
;
1604 strcpy( tmp
, path
);
1605 if ((p
= strrchr( tmp
, '/' ))) p
++;
1609 sprintf( p
, "reg%lx%04x.tmp", (long) getpid(), count
++ );
1610 if ((fd
= open( tmp
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666 )) != -1) break;
1611 if (errno
!= EEXIST
) goto done
;
1615 /* now save to it */
1618 if (!(f
= fdopen( fd
, "w" )))
1620 if (tmp
) unlink( tmp
);
1625 if (debug_level
> 1)
1627 fprintf( stderr
, "%s: ", path
);
1628 dump_operation( key
, NULL
, "saving" );
1631 save_all_subkeys( key
, f
);
1636 /* if successfully written, rename to final name */
1637 if (ret
) ret
= !rename( tmp
, path
);
1638 if (!ret
) unlink( tmp
);
1644 if (ret
) make_clean( key
);
1648 /* periodic saving of the registry */
1649 static void periodic_save( void *arg
)
1653 save_timeout_user
= NULL
;
1654 for (i
= 0; i
< save_branch_count
; i
++)
1655 save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
);
1656 set_periodic_save_timer();
1659 /* start the periodic save timer */
1660 static void set_periodic_save_timer(void)
1662 struct timeval next
;
1664 gettimeofday( &next
, NULL
);
1665 add_timeout( &next
, save_period
);
1666 if (save_timeout_user
) remove_timeout_user( save_timeout_user
);
1667 save_timeout_user
= add_timeout_user( &next
, periodic_save
, NULL
);
1670 /* save the modified registry branches to disk */
1671 void flush_registry(void)
1675 for (i
= 0; i
< save_branch_count
; i
++)
1677 if (!save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
))
1679 fprintf( stderr
, "wineserver: could not save registry branch to %s",
1680 save_branch_info
[i
].path
);
1686 /* close the top-level keys; used on server exit */
1687 void close_registry(void)
1691 if (save_timeout_user
) remove_timeout_user( save_timeout_user
);
1692 save_timeout_user
= NULL
;
1693 for (i
= 0; i
< save_branch_count
; i
++)
1695 release_object( save_branch_info
[i
].key
);
1696 free( save_branch_info
[i
].path
);
1698 release_object( root_key
);
1702 /* create a registry key */
1703 DECL_HANDLER(create_key
)
1705 struct key
*key
= NULL
, *parent
;
1706 struct unicode_str name
, class;
1707 unsigned int access
= req
->access
;
1709 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1712 if (req
->namelen
> get_req_data_size())
1714 set_error( STATUS_INVALID_PARAMETER
);
1717 class.str
= (const WCHAR
*)get_req_data() + req
->namelen
/ sizeof(WCHAR
);
1718 class.len
= ((get_req_data_size() - req
->namelen
) / sizeof(WCHAR
)) * sizeof(WCHAR
);
1719 get_req_path( &name
, !req
->parent
);
1720 if (name
.str
> class.str
)
1722 set_error( STATUS_INVALID_PARAMETER
);
1725 name
.len
= (class.str
- name
.str
) * sizeof(WCHAR
);
1727 /* NOTE: no access rights are required from the parent handle to create a key */
1728 if ((parent
= get_hkey_obj( req
->parent
, 0 )))
1730 int flags
= (req
->options
& REG_OPTION_VOLATILE
) ? KEY_VOLATILE
: KEY_DIRTY
;
1732 if ((key
= create_key( parent
, &name
, &class, flags
, req
->modif
, &reply
->created
)))
1734 reply
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1735 release_object( key
);
1737 release_object( parent
);
1741 /* open a registry key */
1742 DECL_HANDLER(open_key
)
1744 struct key
*key
, *parent
;
1745 struct unicode_str name
;
1746 unsigned int access
= req
->access
;
1748 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1750 /* NOTE: no access rights are required to open the parent key, only the child key */
1751 if ((parent
= get_hkey_obj( req
->parent
, 0 )))
1753 get_req_path( &name
, !req
->parent
);
1754 if ((key
= open_key( parent
, &name
)))
1756 reply
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1757 release_object( key
);
1759 release_object( parent
);
1763 /* delete a registry key */
1764 DECL_HANDLER(delete_key
)
1768 if ((key
= get_hkey_obj( req
->hkey
, DELETE
)))
1770 delete_key( key
, 0);
1771 release_object( key
);
1775 /* flush a registry key */
1776 DECL_HANDLER(flush_key
)
1778 struct key
*key
= get_hkey_obj( req
->hkey
, 0 );
1781 /* we don't need to do anything here with the current implementation */
1782 release_object( key
);
1786 /* enumerate registry subkeys */
1787 DECL_HANDLER(enum_key
)
1791 if ((key
= get_hkey_obj( req
->hkey
,
1792 req
->index
== -1 ? KEY_QUERY_VALUE
: KEY_ENUMERATE_SUB_KEYS
)))
1794 enum_key( key
, req
->index
, req
->info_class
, reply
);
1795 release_object( key
);
1799 /* set a value of a registry key */
1800 DECL_HANDLER(set_key_value
)
1803 struct unicode_str name
;
1805 if (req
->namelen
> get_req_data_size())
1807 set_error( STATUS_INVALID_PARAMETER
);
1810 name
.str
= get_req_data();
1811 name
.len
= (req
->namelen
/ sizeof(WCHAR
)) * sizeof(WCHAR
);
1813 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1815 size_t datalen
= get_req_data_size() - req
->namelen
;
1816 const char *data
= (const char *)get_req_data() + req
->namelen
;
1818 set_value( key
, &name
, req
->type
, data
, datalen
);
1819 release_object( key
);
1823 /* retrieve the value of a registry key */
1824 DECL_HANDLER(get_key_value
)
1827 struct unicode_str name
;
1830 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1832 get_req_unicode_str( &name
);
1833 get_value( key
, &name
, &reply
->type
, &reply
->total
);
1834 release_object( key
);
1838 /* enumerate the value of a registry key */
1839 DECL_HANDLER(enum_key_value
)
1843 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1845 enum_value( key
, req
->index
, req
->info_class
, reply
);
1846 release_object( key
);
1850 /* delete a value of a registry key */
1851 DECL_HANDLER(delete_key_value
)
1854 struct unicode_str name
;
1856 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1858 get_req_unicode_str( &name
);
1859 delete_value( key
, &name
);
1860 release_object( key
);
1864 /* load a registry branch from a file */
1865 DECL_HANDLER(load_registry
)
1867 struct key
*key
, *parent
;
1868 struct token
*token
= thread_get_impersonation_token( current
);
1869 struct unicode_str name
;
1871 const LUID_AND_ATTRIBUTES privs
[] =
1873 { SeBackupPrivilege
, 0 },
1874 { SeRestorePrivilege
, 0 },
1877 if (!token
|| !token_check_privileges( token
, TRUE
, privs
,
1878 sizeof(privs
)/sizeof(privs
[0]), NULL
))
1880 set_error( STATUS_PRIVILEGE_NOT_HELD
);
1884 if ((parent
= get_hkey_obj( req
->hkey
, 0 )))
1887 get_req_path( &name
, !req
->hkey
);
1888 if ((key
= create_key( parent
, &name
, NULL
, KEY_DIRTY
, time(NULL
), &dummy
)))
1890 load_registry( key
, req
->file
);
1891 release_object( key
);
1893 release_object( parent
);
1897 DECL_HANDLER(unload_registry
)
1900 struct token
*token
= thread_get_impersonation_token( current
);
1902 const LUID_AND_ATTRIBUTES privs
[] =
1904 { SeBackupPrivilege
, 0 },
1905 { SeRestorePrivilege
, 0 },
1908 if (!token
|| !token_check_privileges( token
, TRUE
, privs
,
1909 sizeof(privs
)/sizeof(privs
[0]), NULL
))
1911 set_error( STATUS_PRIVILEGE_NOT_HELD
);
1915 if ((key
= get_hkey_obj( req
->hkey
, 0 )))
1917 delete_key( key
, 1 ); /* FIXME */
1918 release_object( key
);
1922 /* save a registry branch to a file */
1923 DECL_HANDLER(save_registry
)
1927 if (!thread_single_check_privilege( current
, &SeBackupPrivilege
))
1929 set_error( STATUS_PRIVILEGE_NOT_HELD
);
1933 if ((key
= get_hkey_obj( req
->hkey
, 0 )))
1935 save_registry( key
, req
->file
);
1936 release_object( key
);
1940 /* add a registry key change notification */
1941 DECL_HANDLER(set_registry_notification
)
1944 struct event
*event
;
1945 struct notify
*notify
;
1947 key
= get_hkey_obj( req
->hkey
, KEY_NOTIFY
);
1950 event
= get_event_obj( current
->process
, req
->event
, SYNCHRONIZE
);
1953 notify
= find_notify( key
, current
->process
, req
->hkey
);
1956 release_object( notify
->event
);
1957 grab_object( event
);
1958 notify
->event
= event
;
1962 notify
= mem_alloc( sizeof(*notify
) );
1965 grab_object( event
);
1966 notify
->event
= event
;
1967 notify
->subtree
= req
->subtree
;
1968 notify
->filter
= req
->filter
;
1969 notify
->hkey
= req
->hkey
;
1970 notify
->process
= current
->process
;
1971 list_add_head( &key
->notify_list
, ¬ify
->entry
);
1974 release_object( event
);
1976 release_object( key
);