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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
26 #include "wine/port.h"
41 #define WIN32_NO_STATUS
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 */
60 struct process
*process
; /* process in which the hkey is valid */
66 struct object obj
; /* object header */
67 WCHAR
*name
; /* key name */
68 WCHAR
*class; /* key class */
69 unsigned short namelen
; /* length of key name */
70 unsigned short classlen
; /* length of class name */
71 struct key
*parent
; /* parent key */
72 int last_subkey
; /* last in use subkey */
73 int nb_subkeys
; /* count of allocated subkeys */
74 struct key
**subkeys
; /* subkeys array */
75 int last_value
; /* last in use value */
76 int nb_values
; /* count of allocated values in array */
77 struct key_value
*values
; /* values array */
78 unsigned int flags
; /* flags */
79 timeout_t modif
; /* last modification time */
80 struct list notify_list
; /* list of notifications */
84 #define KEY_VOLATILE 0x0001 /* key is volatile (not saved to disk) */
85 #define KEY_DELETED 0x0002 /* key has been deleted */
86 #define KEY_DIRTY 0x0004 /* key has been modified */
87 #define KEY_SYMLINK 0x0008 /* key is a symbolic link */
88 #define KEY_WOW64 0x0010 /* key contains a Wow6432Node subkey */
89 #define KEY_WOWSHARE 0x0020 /* key is a Wow64 shared key (used for Software\Classes) */
94 WCHAR
*name
; /* value name */
95 unsigned short namelen
; /* length of value name */
96 unsigned int type
; /* value type */
97 data_size_t len
; /* value data length in bytes */
98 void *data
; /* pointer to value data */
101 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
102 #define MIN_VALUES 8 /* min. number of allocated values per key */
104 #define MAX_NAME_LEN 256 /* max. length of a key name */
105 #define MAX_VALUE_LEN 16383 /* max. length of a value name */
107 /* the root of the registry tree */
108 static struct key
*root_key
;
110 static const timeout_t ticks_1601_to_1970
= (timeout_t
)86400 * (369 * 365 + 89) * TICKS_PER_SEC
;
111 static const timeout_t save_period
= 30 * -TICKS_PER_SEC
; /* delay between periodic saves */
112 static struct timeout_user
*save_timeout_user
; /* saving timer */
113 static enum prefix_type
{ PREFIX_UNKNOWN
, PREFIX_32BIT
, PREFIX_64BIT
} prefix_type
;
115 static const WCHAR root_name
[] = { '\\','R','e','g','i','s','t','r','y','\\' };
116 static const WCHAR wow6432node
[] = {'W','o','w','6','4','3','2','N','o','d','e'};
117 static const WCHAR symlink_value
[] = {'S','y','m','b','o','l','i','c','L','i','n','k','V','a','l','u','e'};
118 static const struct unicode_str symlink_str
= { symlink_value
, sizeof(symlink_value
) };
120 static void set_periodic_save_timer(void);
121 static struct key_value
*find_value( const struct key
*key
, const struct unicode_str
*name
, int *index
);
123 /* information about where to save a registry branch */
124 struct save_branch_info
130 #define MAX_SAVE_BRANCH_INFO 3
131 static int save_branch_count
;
132 static struct save_branch_info save_branch_info
[MAX_SAVE_BRANCH_INFO
];
135 /* information about a file being loaded */
136 struct file_load_info
138 const char *filename
; /* input file name */
139 FILE *file
; /* input file */
140 char *buffer
; /* line buffer */
141 int len
; /* buffer length */
142 int line
; /* current input line */
143 WCHAR
*tmp
; /* temp buffer to use while parsing input */
144 size_t tmplen
; /* length of temp buffer */
148 static void key_dump( struct object
*obj
, int verbose
);
149 static unsigned int key_map_access( struct object
*obj
, unsigned int access
);
150 static struct security_descriptor
*key_get_sd( struct object
*obj
);
151 static int key_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
);
152 static void key_destroy( struct object
*obj
);
154 static const struct object_ops key_ops
=
156 sizeof(struct key
), /* size */
158 no_get_type
, /* get_type */
159 no_add_queue
, /* add_queue */
160 NULL
, /* remove_queue */
162 NULL
, /* satisfied */
163 no_signal
, /* signal */
164 no_get_fd
, /* get_fd */
165 key_map_access
, /* map_access */
166 key_get_sd
, /* get_sd */
167 default_set_sd
, /* set_sd */
168 no_lookup_name
, /* lookup_name */
169 no_open_file
, /* open_file */
170 key_close_handle
, /* close_handle */
171 key_destroy
/* destroy */
175 static inline int is_wow6432node( const WCHAR
*name
, unsigned int len
)
177 return (len
== sizeof(wow6432node
) &&
178 !memicmpW( name
, wow6432node
, sizeof(wow6432node
)/sizeof(WCHAR
) ));
182 * The registry text file format v2 used by this code is similar to the one
183 * used by REGEDIT import/export functionality, with the following differences:
184 * - strings and key names can contain \x escapes for Unicode
185 * - key names use escapes too in order to support Unicode
186 * - the modification time optionally follows the key name
187 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
190 /* dump the full path of a key */
191 static void dump_path( const struct key
*key
, const struct key
*base
, FILE *f
)
193 if (key
->parent
&& key
->parent
!= base
)
195 dump_path( key
->parent
, base
, f
);
196 fprintf( f
, "\\\\" );
198 dump_strW( key
->name
, key
->namelen
/ sizeof(WCHAR
), f
, "[]" );
201 /* dump a value to a text file */
202 static void dump_value( const struct key_value
*value
, FILE *f
)
210 count
= 1 + dump_strW( value
->name
, value
->namelen
/ sizeof(WCHAR
), f
, "\"\"" );
211 count
+= fprintf( f
, "\"=" );
213 else count
= fprintf( f
, "@=" );
220 /* only output properly terminated strings in string format */
221 if (value
->len
< sizeof(WCHAR
)) break;
222 if (value
->len
% sizeof(WCHAR
)) break;
223 if (((WCHAR
*)value
->data
)[value
->len
/ sizeof(WCHAR
) - 1]) break;
224 if (value
->type
!= REG_SZ
) fprintf( f
, "str(%x):", value
->type
);
226 dump_strW( (WCHAR
*)value
->data
, value
->len
/ sizeof(WCHAR
), f
, "\"\"" );
227 fprintf( f
, "\"\n" );
231 if (value
->len
!= sizeof(dw
)) break;
232 memcpy( &dw
, value
->data
, sizeof(dw
) );
233 fprintf( f
, "dword:%08x\n", dw
);
237 if (value
->type
== REG_BINARY
) count
+= fprintf( f
, "hex:" );
238 else count
+= fprintf( f
, "hex(%x):", value
->type
);
239 for (i
= 0; i
< value
->len
; i
++)
241 count
+= fprintf( f
, "%02x", *((unsigned char *)value
->data
+ i
) );
242 if (i
< value
->len
-1)
247 fprintf( f
, "\\\n " );
255 /* save a registry and all its subkeys to a text file */
256 static void save_subkeys( const struct key
*key
, const struct key
*base
, FILE *f
)
260 if (key
->flags
& KEY_VOLATILE
) return;
261 /* save key if it has either some values or no subkeys, or needs special options */
262 /* keys with no values but subkeys are saved implicitly by saving the subkeys */
263 if ((key
->last_value
>= 0) || (key
->last_subkey
== -1) || key
->class || (key
->flags
& KEY_SYMLINK
))
266 if (key
!= base
) dump_path( key
, base
, f
);
267 fprintf( f
, "] %u\n", (unsigned int)((key
->modif
- ticks_1601_to_1970
) / TICKS_PER_SEC
) );
268 fprintf( f
, "#time=%x%08x\n", (unsigned int)(key
->modif
>> 32), (unsigned int)key
->modif
);
271 fprintf( f
, "#class=\"" );
272 dump_strW( key
->class, key
->classlen
/ sizeof(WCHAR
), f
, "\"\"" );
273 fprintf( f
, "\"\n" );
275 if (key
->flags
& KEY_SYMLINK
) fputs( "#link\n", f
);
276 for (i
= 0; i
<= key
->last_value
; i
++) dump_value( &key
->values
[i
], f
);
278 for (i
= 0; i
<= key
->last_subkey
; i
++) save_subkeys( key
->subkeys
[i
], base
, f
);
281 static void dump_operation( const struct key
*key
, const struct key_value
*value
, const char *op
)
283 fprintf( stderr
, "%s key ", op
);
284 if (key
) dump_path( key
, NULL
, stderr
);
285 else fprintf( stderr
, "ERROR" );
288 fprintf( stderr
, " value ");
289 dump_value( value
, stderr
);
291 else fprintf( stderr
, "\n" );
294 static void key_dump( struct object
*obj
, int verbose
)
296 struct key
*key
= (struct key
*)obj
;
297 assert( obj
->ops
== &key_ops
);
298 fprintf( stderr
, "Key flags=%x ", key
->flags
);
299 dump_path( key
, NULL
, stderr
);
300 fprintf( stderr
, "\n" );
303 /* notify waiter and maybe delete the notification */
304 static void do_notification( struct key
*key
, struct notify
*notify
, int del
)
308 set_event( notify
->event
);
309 release_object( notify
->event
);
310 notify
->event
= NULL
;
314 list_remove( ¬ify
->entry
);
319 static inline struct notify
*find_notify( struct key
*key
, struct process
*process
, obj_handle_t hkey
)
321 struct notify
*notify
;
323 LIST_FOR_EACH_ENTRY( notify
, &key
->notify_list
, struct notify
, entry
)
325 if (notify
->process
== process
&& notify
->hkey
== hkey
) return notify
;
330 static unsigned int key_map_access( struct object
*obj
, unsigned int access
)
332 if (access
& GENERIC_READ
) access
|= KEY_READ
;
333 if (access
& GENERIC_WRITE
) access
|= KEY_WRITE
;
334 if (access
& GENERIC_EXECUTE
) access
|= KEY_EXECUTE
;
335 if (access
& GENERIC_ALL
) access
|= KEY_ALL_ACCESS
;
336 /* filter the WOW64 masks, as they aren't real access bits */
337 return access
& ~(GENERIC_READ
| GENERIC_WRITE
| GENERIC_EXECUTE
| GENERIC_ALL
|
338 KEY_WOW64_64KEY
| KEY_WOW64_32KEY
);
341 static struct security_descriptor
*key_get_sd( struct object
*obj
)
343 static struct security_descriptor
*key_default_sd
;
345 if (obj
->sd
) return obj
->sd
;
349 size_t users_sid_len
= security_sid_len( security_builtin_users_sid
);
350 size_t admins_sid_len
= security_sid_len( security_builtin_admins_sid
);
351 size_t dacl_len
= sizeof(ACL
) + 2 * offsetof( ACCESS_ALLOWED_ACE
, SidStart
)
352 + users_sid_len
+ admins_sid_len
;
353 ACCESS_ALLOWED_ACE
*aaa
;
356 key_default_sd
= mem_alloc( sizeof(*key_default_sd
) + 2 * admins_sid_len
+ dacl_len
);
357 key_default_sd
->control
= SE_DACL_PRESENT
;
358 key_default_sd
->owner_len
= admins_sid_len
;
359 key_default_sd
->group_len
= admins_sid_len
;
360 key_default_sd
->sacl_len
= 0;
361 key_default_sd
->dacl_len
= dacl_len
;
362 memcpy( key_default_sd
+ 1, security_builtin_admins_sid
, admins_sid_len
);
363 memcpy( (char *)(key_default_sd
+ 1) + admins_sid_len
, security_builtin_admins_sid
, admins_sid_len
);
365 dacl
= (ACL
*)((char *)(key_default_sd
+ 1) + 2 * admins_sid_len
);
366 dacl
->AclRevision
= ACL_REVISION
;
368 dacl
->AclSize
= dacl_len
;
371 aaa
= (ACCESS_ALLOWED_ACE
*)(dacl
+ 1);
372 aaa
->Header
.AceType
= ACCESS_ALLOWED_ACE_TYPE
;
373 aaa
->Header
.AceFlags
= INHERIT_ONLY_ACE
| CONTAINER_INHERIT_ACE
;
374 aaa
->Header
.AceSize
= offsetof( ACCESS_ALLOWED_ACE
, SidStart
) + users_sid_len
;
375 aaa
->Mask
= GENERIC_READ
;
376 memcpy( &aaa
->SidStart
, security_builtin_users_sid
, users_sid_len
);
377 aaa
= (ACCESS_ALLOWED_ACE
*)((char *)aaa
+ aaa
->Header
.AceSize
);
378 aaa
->Header
.AceType
= ACCESS_ALLOWED_ACE_TYPE
;
379 aaa
->Header
.AceFlags
= 0;
380 aaa
->Header
.AceSize
= offsetof( ACCESS_ALLOWED_ACE
, SidStart
) + admins_sid_len
;
381 aaa
->Mask
= KEY_ALL_ACCESS
;
382 memcpy( &aaa
->SidStart
, security_builtin_admins_sid
, admins_sid_len
);
384 return key_default_sd
;
387 /* close the notification associated with a handle */
388 static int key_close_handle( struct object
*obj
, struct process
*process
, obj_handle_t handle
)
390 struct key
* key
= (struct key
*) obj
;
391 struct notify
*notify
= find_notify( key
, process
, handle
);
392 if (notify
) do_notification( key
, notify
, 1 );
393 return 1; /* ok to close */
396 static void key_destroy( struct object
*obj
)
400 struct key
*key
= (struct key
*)obj
;
401 assert( obj
->ops
== &key_ops
);
405 for (i
= 0; i
<= key
->last_value
; i
++)
407 free( key
->values
[i
].name
);
408 free( key
->values
[i
].data
);
411 for (i
= 0; i
<= key
->last_subkey
; i
++)
413 key
->subkeys
[i
]->parent
= NULL
;
414 release_object( key
->subkeys
[i
] );
416 free( key
->subkeys
);
417 /* unconditionally notify everything waiting on this key */
418 while ((ptr
= list_head( &key
->notify_list
)))
420 struct notify
*notify
= LIST_ENTRY( ptr
, struct notify
, entry
);
421 do_notification( key
, notify
, 1 );
425 /* get the request vararg as registry path */
426 static inline void get_req_path( struct unicode_str
*str
, int skip_root
)
428 str
->str
= get_req_data();
429 str
->len
= (get_req_data_size() / sizeof(WCHAR
)) * sizeof(WCHAR
);
431 if (skip_root
&& str
->len
>= sizeof(root_name
) &&
432 !memicmpW( str
->str
, root_name
, sizeof(root_name
)/sizeof(WCHAR
) ))
434 str
->str
+= sizeof(root_name
)/sizeof(WCHAR
);
435 str
->len
-= sizeof(root_name
);
439 /* return the next token in a given path */
440 /* token->str must point inside the path, or be NULL for the first call */
441 static struct unicode_str
*get_path_token( const struct unicode_str
*path
, struct unicode_str
*token
)
443 data_size_t i
= 0, len
= path
->len
/ sizeof(WCHAR
);
445 if (!token
->str
) /* first time */
447 /* path cannot start with a backslash */
448 if (len
&& path
->str
[0] == '\\')
450 set_error( STATUS_OBJECT_PATH_INVALID
);
456 i
= token
->str
- path
->str
;
457 i
+= token
->len
/ sizeof(WCHAR
);
458 while (i
< len
&& path
->str
[i
] == '\\') i
++;
460 token
->str
= path
->str
+ i
;
461 while (i
< len
&& path
->str
[i
] != '\\') i
++;
462 token
->len
= (path
->str
+ i
- token
->str
) * sizeof(WCHAR
);
466 /* allocate a key object */
467 static struct key
*alloc_key( const struct unicode_str
*name
, timeout_t modif
)
470 if ((key
= alloc_object( &key_ops
)))
474 key
->namelen
= name
->len
;
477 key
->last_subkey
= -1;
481 key
->last_value
= -1;
485 list_init( &key
->notify_list
);
486 if (name
->len
&& !(key
->name
= memdup( name
->str
, name
->len
)))
488 release_object( key
);
495 /* mark a key and all its parents as dirty (modified) */
496 static void make_dirty( struct key
*key
)
500 if (key
->flags
& (KEY_DIRTY
|KEY_VOLATILE
)) return; /* nothing to do */
501 key
->flags
|= KEY_DIRTY
;
506 /* mark a key and all its subkeys as clean (not modified) */
507 static void make_clean( struct key
*key
)
511 if (key
->flags
& KEY_VOLATILE
) return;
512 if (!(key
->flags
& KEY_DIRTY
)) return;
513 key
->flags
&= ~KEY_DIRTY
;
514 for (i
= 0; i
<= key
->last_subkey
; i
++) make_clean( key
->subkeys
[i
] );
517 /* go through all the notifications and send them if necessary */
518 static void check_notify( struct key
*key
, unsigned int change
, int not_subtree
)
520 struct list
*ptr
, *next
;
522 LIST_FOR_EACH_SAFE( ptr
, next
, &key
->notify_list
)
524 struct notify
*n
= LIST_ENTRY( ptr
, struct notify
, entry
);
525 if ( ( not_subtree
|| n
->subtree
) && ( change
& n
->filter
) )
526 do_notification( key
, n
, 0 );
530 /* update key modification time */
531 static void touch_key( struct key
*key
, unsigned int change
)
535 key
->modif
= current_time
;
538 /* do notifications */
539 check_notify( key
, change
, 1 );
540 for ( k
= key
->parent
; k
; k
= k
->parent
)
541 check_notify( k
, change
& ~REG_NOTIFY_CHANGE_LAST_SET
, 0 );
544 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
545 static int grow_subkeys( struct key
*key
)
547 struct key
**new_subkeys
;
552 nb_subkeys
= key
->nb_subkeys
+ (key
->nb_subkeys
/ 2); /* grow by 50% */
553 if (!(new_subkeys
= realloc( key
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) )))
555 set_error( STATUS_NO_MEMORY
);
561 nb_subkeys
= MIN_VALUES
;
562 if (!(new_subkeys
= mem_alloc( nb_subkeys
* sizeof(*new_subkeys
) ))) return 0;
564 key
->subkeys
= new_subkeys
;
565 key
->nb_subkeys
= nb_subkeys
;
569 /* allocate a subkey for a given key, and return its index */
570 static struct key
*alloc_subkey( struct key
*parent
, const struct unicode_str
*name
,
571 int index
, timeout_t modif
)
576 if (name
->len
> MAX_NAME_LEN
* sizeof(WCHAR
))
578 set_error( STATUS_INVALID_PARAMETER
);
581 if (parent
->last_subkey
+ 1 == parent
->nb_subkeys
)
583 /* need to grow the array */
584 if (!grow_subkeys( parent
)) return NULL
;
586 if ((key
= alloc_key( name
, modif
)) != NULL
)
588 key
->parent
= parent
;
589 for (i
= ++parent
->last_subkey
; i
> index
; i
--)
590 parent
->subkeys
[i
] = parent
->subkeys
[i
-1];
591 parent
->subkeys
[index
] = key
;
592 if (is_wow6432node( key
->name
, key
->namelen
) && !is_wow6432node( parent
->name
, parent
->namelen
))
593 parent
->flags
|= KEY_WOW64
;
598 /* free a subkey of a given key */
599 static void free_subkey( struct key
*parent
, int index
)
604 assert( index
>= 0 );
605 assert( index
<= parent
->last_subkey
);
607 key
= parent
->subkeys
[index
];
608 for (i
= index
; i
< parent
->last_subkey
; i
++) parent
->subkeys
[i
] = parent
->subkeys
[i
+ 1];
609 parent
->last_subkey
--;
610 key
->flags
|= KEY_DELETED
;
612 if (is_wow6432node( key
->name
, key
->namelen
)) parent
->flags
&= ~KEY_WOW64
;
613 release_object( key
);
615 /* try to shrink the array */
616 nb_subkeys
= parent
->nb_subkeys
;
617 if (nb_subkeys
> MIN_SUBKEYS
&& parent
->last_subkey
< nb_subkeys
/ 2)
619 struct key
**new_subkeys
;
620 nb_subkeys
-= nb_subkeys
/ 3; /* shrink by 33% */
621 if (nb_subkeys
< MIN_SUBKEYS
) nb_subkeys
= MIN_SUBKEYS
;
622 if (!(new_subkeys
= realloc( parent
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) ))) return;
623 parent
->subkeys
= new_subkeys
;
624 parent
->nb_subkeys
= nb_subkeys
;
628 /* find the named child of a given key and return its index */
629 static struct key
*find_subkey( const struct key
*key
, const struct unicode_str
*name
, int *index
)
631 int i
, min
, max
, res
;
635 max
= key
->last_subkey
;
639 len
= min( key
->subkeys
[i
]->namelen
, name
->len
);
640 res
= memicmpW( key
->subkeys
[i
]->name
, name
->str
, len
/ sizeof(WCHAR
) );
641 if (!res
) res
= key
->subkeys
[i
]->namelen
- name
->len
;
645 return key
->subkeys
[i
];
647 if (res
> 0) max
= i
- 1;
650 *index
= min
; /* this is where we should insert it */
654 /* return the wow64 variant of the key, or the key itself if none */
655 static struct key
*find_wow64_subkey( struct key
*key
, const struct unicode_str
*name
)
657 static const struct unicode_str wow6432node_str
= { wow6432node
, sizeof(wow6432node
) };
660 if (!(key
->flags
& KEY_WOW64
)) return key
;
661 if (!is_wow6432node( name
->str
, name
->len
))
663 key
= find_subkey( key
, &wow6432node_str
, &index
);
664 assert( key
); /* if KEY_WOW64 is set we must find it */
670 /* follow a symlink and return the resolved key */
671 static struct key
*follow_symlink( struct key
*key
, int iteration
)
673 struct unicode_str path
, token
;
674 struct key_value
*value
;
677 if (iteration
> 16) return NULL
;
678 if (!(key
->flags
& KEY_SYMLINK
)) return key
;
679 if (!(value
= find_value( key
, &symlink_str
, &index
))) return NULL
;
681 path
.str
= value
->data
;
682 path
.len
= (value
->len
/ sizeof(WCHAR
)) * sizeof(WCHAR
);
683 if (path
.len
<= sizeof(root_name
)) return NULL
;
684 if (memicmpW( path
.str
, root_name
, sizeof(root_name
)/sizeof(WCHAR
) )) return NULL
;
685 path
.str
+= sizeof(root_name
) / sizeof(WCHAR
);
686 path
.len
-= sizeof(root_name
);
690 if (!get_path_token( &path
, &token
)) return NULL
;
693 if (!(key
= find_subkey( key
, &token
, &index
))) break;
694 if (!(key
= follow_symlink( key
, iteration
+ 1 ))) break;
695 get_path_token( &path
, &token
);
700 /* open a key until we find an element that doesn't exist */
701 /* helper for open_key and create_key */
702 static struct key
*open_key_prefix( struct key
*key
, const struct unicode_str
*name
,
703 unsigned int access
, struct unicode_str
*token
, int *index
)
706 if (!get_path_token( name
, token
)) return NULL
;
707 if (access
& KEY_WOW64_32KEY
) key
= find_wow64_subkey( key
, token
);
711 if (!(subkey
= find_subkey( key
, token
, index
)))
713 if ((key
->flags
& KEY_WOWSHARE
) && !(access
& KEY_WOW64_64KEY
))
715 /* try in the 64-bit parent */
717 subkey
= find_subkey( key
, token
, index
);
722 get_path_token( name
, token
);
723 if (!token
->len
) break;
724 if (!(access
& KEY_WOW64_64KEY
)) key
= find_wow64_subkey( key
, token
);
725 if (!(key
= follow_symlink( key
, 0 )))
727 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
735 static struct key
*open_key( struct key
*key
, const struct unicode_str
*name
, unsigned int access
,
736 unsigned int attributes
)
739 struct unicode_str token
;
741 if (!(key
= open_key_prefix( key
, name
, access
, &token
, &index
))) return NULL
;
745 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
748 if (!(access
& KEY_WOW64_64KEY
)) key
= find_wow64_subkey( key
, &token
);
749 if (!(attributes
& OBJ_OPENLINK
) && !(key
= follow_symlink( key
, 0 )))
751 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
754 if (debug_level
> 1) dump_operation( key
, NULL
, "Open" );
759 /* create a subkey */
760 static struct key
*create_key( struct key
*key
, const struct unicode_str
*name
,
761 const struct unicode_str
*class, unsigned int options
,
762 unsigned int access
, unsigned int attributes
,
763 const struct security_descriptor
*sd
, int *created
)
766 struct unicode_str token
, next
;
769 if (!(key
= open_key_prefix( key
, name
, access
, &token
, &index
))) return NULL
;
771 if (!token
.len
) /* the key already exists */
773 if (!(access
& KEY_WOW64_64KEY
)) key
= find_wow64_subkey( key
, &token
);
774 if (options
& REG_OPTION_CREATE_LINK
)
776 set_error( STATUS_OBJECT_NAME_COLLISION
);
779 if (!(attributes
& OBJ_OPENLINK
) && !(key
= follow_symlink( key
, 0 )))
781 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
784 if (debug_level
> 1) dump_operation( key
, NULL
, "Open" );
789 /* token must be the last path component at this point */
791 get_path_token( name
, &next
);
794 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
798 if ((key
->flags
& KEY_VOLATILE
) && !(options
& REG_OPTION_VOLATILE
))
800 set_error( STATUS_CHILD_MUST_BE_VOLATILE
);
805 if (!(key
= alloc_subkey( key
, &token
, index
, current_time
))) return NULL
;
807 if (options
& REG_OPTION_CREATE_LINK
) key
->flags
|= KEY_SYMLINK
;
808 if (options
& REG_OPTION_VOLATILE
) key
->flags
|= KEY_VOLATILE
;
809 else key
->flags
|= KEY_DIRTY
;
811 if (sd
) default_set_sd( &key
->obj
, sd
, OWNER_SECURITY_INFORMATION
| GROUP_SECURITY_INFORMATION
|
812 DACL_SECURITY_INFORMATION
| SACL_SECURITY_INFORMATION
);
814 if (debug_level
> 1) dump_operation( key
, NULL
, "Create" );
815 if (class && class->len
)
817 key
->classlen
= class->len
;
819 if (!(key
->class = memdup( class->str
, key
->classlen
))) key
->classlen
= 0;
821 touch_key( key
->parent
, REG_NOTIFY_CHANGE_NAME
);
826 /* recursively create a subkey (for internal use only) */
827 static struct key
*create_key_recursive( struct key
*key
, const struct unicode_str
*name
, timeout_t modif
)
831 struct unicode_str token
;
834 if (!get_path_token( name
, &token
)) return NULL
;
838 if (!(subkey
= find_subkey( key
, &token
, &index
))) break;
840 if (!(key
= follow_symlink( key
, 0 )))
842 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
845 get_path_token( name
, &token
);
850 if (!(key
= alloc_subkey( key
, &token
, index
, modif
))) return NULL
;
854 get_path_token( name
, &token
);
855 if (!token
.len
) break;
856 /* we know the index is always 0 in a new key */
857 if (!(key
= alloc_subkey( key
, &token
, 0, modif
)))
859 free_subkey( base
, index
);
869 /* query information about a key or a subkey */
870 static void enum_key( const struct key
*key
, int index
, int info_class
,
871 struct enum_key_reply
*reply
)
873 static const WCHAR backslash
[] = { '\\' };
875 data_size_t len
, namelen
, classlen
;
876 data_size_t max_subkey
= 0, max_class
= 0;
877 data_size_t max_value
= 0, max_data
= 0;
881 if (index
!= -1) /* -1 means use the specified key directly */
883 if ((index
< 0) || (index
> key
->last_subkey
))
885 set_error( STATUS_NO_MORE_ENTRIES
);
888 key
= key
->subkeys
[index
];
891 namelen
= key
->namelen
;
892 classlen
= key
->classlen
;
896 case KeyNameInformation
:
898 for (k
= key
; k
!= root_key
; k
= k
->parent
)
899 namelen
+= k
->namelen
+ sizeof(backslash
);
900 if (!namelen
) return;
901 namelen
+= sizeof(root_name
) - sizeof(backslash
);
903 case KeyBasicInformation
:
904 classlen
= 0; /* only return the name */
906 case KeyNodeInformation
:
907 reply
->max_subkey
= 0;
908 reply
->max_class
= 0;
909 reply
->max_value
= 0;
912 case KeyFullInformation
:
913 case KeyCachedInformation
:
914 for (i
= 0; i
<= key
->last_subkey
; i
++)
916 if (key
->subkeys
[i
]->namelen
> max_subkey
) max_subkey
= key
->subkeys
[i
]->namelen
;
917 if (key
->subkeys
[i
]->classlen
> max_class
) max_class
= key
->subkeys
[i
]->classlen
;
919 for (i
= 0; i
<= key
->last_value
; i
++)
921 if (key
->values
[i
].namelen
> max_value
) max_value
= key
->values
[i
].namelen
;
922 if (key
->values
[i
].len
> max_data
) max_data
= key
->values
[i
].len
;
924 reply
->max_subkey
= max_subkey
;
925 reply
->max_class
= max_class
;
926 reply
->max_value
= max_value
;
927 reply
->max_data
= max_data
;
928 reply
->namelen
= namelen
;
929 if (info_class
== KeyCachedInformation
)
930 classlen
= 0; /* don't return any data, only its size */
931 namelen
= 0; /* don't return name */
934 set_error( STATUS_INVALID_PARAMETER
);
937 reply
->subkeys
= key
->last_subkey
+ 1;
938 reply
->values
= key
->last_value
+ 1;
939 reply
->modif
= key
->modif
;
940 reply
->total
= namelen
+ classlen
;
942 len
= min( reply
->total
, get_reply_max_size() );
943 if (len
&& (data
= set_reply_data_size( len
)))
947 reply
->namelen
= namelen
;
948 memcpy( data
, key
->name
, namelen
);
949 memcpy( data
+ namelen
, key
->class, len
- namelen
);
951 else if (info_class
== KeyNameInformation
)
953 data_size_t pos
= namelen
;
954 reply
->namelen
= namelen
;
955 for (k
= key
; k
!= root_key
; k
= k
->parent
)
958 if (pos
< len
) memcpy( data
+ pos
, k
->name
,
959 min( k
->namelen
, len
- pos
) );
960 pos
-= sizeof(backslash
);
961 if (pos
< len
) memcpy( data
+ pos
, backslash
,
962 min( sizeof(backslash
), len
- pos
) );
964 memcpy( data
, root_name
, min( sizeof(root_name
) - sizeof(backslash
), len
) );
968 reply
->namelen
= len
;
969 memcpy( data
, key
->name
, len
);
972 if (debug_level
> 1) dump_operation( key
, NULL
, "Enum" );
975 /* delete a key and its values */
976 static int delete_key( struct key
*key
, int recurse
)
979 struct key
*parent
= key
->parent
;
981 /* must find parent and index */
984 set_error( STATUS_ACCESS_DENIED
);
989 while (recurse
&& (key
->last_subkey
>=0))
990 if (0 > delete_key(key
->subkeys
[key
->last_subkey
], 1))
993 for (index
= 0; index
<= parent
->last_subkey
; index
++)
994 if (parent
->subkeys
[index
] == key
) break;
995 assert( index
<= parent
->last_subkey
);
997 /* we can only delete a key that has no subkeys */
998 if (key
->last_subkey
>= 0)
1000 set_error( STATUS_ACCESS_DENIED
);
1004 if (debug_level
> 1) dump_operation( key
, NULL
, "Delete" );
1005 free_subkey( parent
, index
);
1006 touch_key( parent
, REG_NOTIFY_CHANGE_NAME
);
1010 /* try to grow the array of values; return 1 if OK, 0 on error */
1011 static int grow_values( struct key
*key
)
1013 struct key_value
*new_val
;
1018 nb_values
= key
->nb_values
+ (key
->nb_values
/ 2); /* grow by 50% */
1019 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) )))
1021 set_error( STATUS_NO_MEMORY
);
1027 nb_values
= MIN_VALUES
;
1028 if (!(new_val
= mem_alloc( nb_values
* sizeof(*new_val
) ))) return 0;
1030 key
->values
= new_val
;
1031 key
->nb_values
= nb_values
;
1035 /* find the named value of a given key and return its index in the array */
1036 static struct key_value
*find_value( const struct key
*key
, const struct unicode_str
*name
, int *index
)
1038 int i
, min
, max
, res
;
1042 max
= key
->last_value
;
1045 i
= (min
+ max
) / 2;
1046 len
= min( key
->values
[i
].namelen
, name
->len
);
1047 res
= memicmpW( key
->values
[i
].name
, name
->str
, len
/ sizeof(WCHAR
) );
1048 if (!res
) res
= key
->values
[i
].namelen
- name
->len
;
1052 return &key
->values
[i
];
1054 if (res
> 0) max
= i
- 1;
1057 *index
= min
; /* this is where we should insert it */
1061 /* insert a new value; the index must have been returned by find_value */
1062 static struct key_value
*insert_value( struct key
*key
, const struct unicode_str
*name
, int index
)
1064 struct key_value
*value
;
1065 WCHAR
*new_name
= NULL
;
1068 if (name
->len
> MAX_VALUE_LEN
* sizeof(WCHAR
))
1070 set_error( STATUS_NAME_TOO_LONG
);
1073 if (key
->last_value
+ 1 == key
->nb_values
)
1075 if (!grow_values( key
)) return NULL
;
1077 if (name
->len
&& !(new_name
= memdup( name
->str
, name
->len
))) return NULL
;
1078 for (i
= ++key
->last_value
; i
> index
; i
--) key
->values
[i
] = key
->values
[i
- 1];
1079 value
= &key
->values
[index
];
1080 value
->name
= new_name
;
1081 value
->namelen
= name
->len
;
1087 /* set a key value */
1088 static void set_value( struct key
*key
, const struct unicode_str
*name
,
1089 int type
, const void *data
, data_size_t len
)
1091 struct key_value
*value
;
1095 if ((value
= find_value( key
, name
, &index
)))
1097 /* check if the new value is identical to the existing one */
1098 if (value
->type
== type
&& value
->len
== len
&&
1099 value
->data
&& !memcmp( value
->data
, data
, len
))
1101 if (debug_level
> 1) dump_operation( key
, value
, "Skip setting" );
1106 if (key
->flags
& KEY_SYMLINK
)
1108 if (type
!= REG_LINK
|| name
->len
!= symlink_str
.len
||
1109 memicmpW( name
->str
, symlink_str
.str
, name
->len
/ sizeof(WCHAR
) ))
1111 set_error( STATUS_ACCESS_DENIED
);
1116 if (len
&& !(ptr
= memdup( data
, len
))) return;
1120 if (!(value
= insert_value( key
, name
, index
)))
1126 else free( value
->data
); /* already existing, free previous data */
1131 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
1132 if (debug_level
> 1) dump_operation( key
, value
, "Set" );
1135 /* get a key value */
1136 static void get_value( struct key
*key
, const struct unicode_str
*name
, int *type
, data_size_t
*len
)
1138 struct key_value
*value
;
1141 if ((value
= find_value( key
, name
, &index
)))
1143 *type
= value
->type
;
1145 if (value
->data
) set_reply_data( value
->data
, min( value
->len
, get_reply_max_size() ));
1146 if (debug_level
> 1) dump_operation( key
, value
, "Get" );
1151 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
1155 /* enumerate a key value */
1156 static void enum_value( struct key
*key
, int i
, int info_class
, struct enum_key_value_reply
*reply
)
1158 struct key_value
*value
;
1160 if (i
< 0 || i
> key
->last_value
) set_error( STATUS_NO_MORE_ENTRIES
);
1164 data_size_t namelen
, maxlen
;
1166 value
= &key
->values
[i
];
1167 reply
->type
= value
->type
;
1168 namelen
= value
->namelen
;
1172 case KeyValueBasicInformation
:
1173 reply
->total
= namelen
;
1175 case KeyValueFullInformation
:
1176 reply
->total
= namelen
+ value
->len
;
1178 case KeyValuePartialInformation
:
1179 reply
->total
= value
->len
;
1183 set_error( STATUS_INVALID_PARAMETER
);
1187 maxlen
= min( reply
->total
, get_reply_max_size() );
1188 if (maxlen
&& ((data
= set_reply_data_size( maxlen
))))
1190 if (maxlen
> namelen
)
1192 reply
->namelen
= namelen
;
1193 memcpy( data
, value
->name
, namelen
);
1194 memcpy( (char *)data
+ namelen
, value
->data
, maxlen
- namelen
);
1198 reply
->namelen
= maxlen
;
1199 memcpy( data
, value
->name
, maxlen
);
1202 if (debug_level
> 1) dump_operation( key
, value
, "Enum" );
1206 /* delete a value */
1207 static void delete_value( struct key
*key
, const struct unicode_str
*name
)
1209 struct key_value
*value
;
1210 int i
, index
, nb_values
;
1212 if (!(value
= find_value( key
, name
, &index
)))
1214 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
1217 if (debug_level
> 1) dump_operation( key
, value
, "Delete" );
1218 free( value
->name
);
1219 free( value
->data
);
1220 for (i
= index
; i
< key
->last_value
; i
++) key
->values
[i
] = key
->values
[i
+ 1];
1222 touch_key( key
, REG_NOTIFY_CHANGE_LAST_SET
);
1224 /* try to shrink the array */
1225 nb_values
= key
->nb_values
;
1226 if (nb_values
> MIN_VALUES
&& key
->last_value
< nb_values
/ 2)
1228 struct key_value
*new_val
;
1229 nb_values
-= nb_values
/ 3; /* shrink by 33% */
1230 if (nb_values
< MIN_VALUES
) nb_values
= MIN_VALUES
;
1231 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) ))) return;
1232 key
->values
= new_val
;
1233 key
->nb_values
= nb_values
;
1237 /* get the registry key corresponding to an hkey handle */
1238 static struct key
*get_hkey_obj( obj_handle_t hkey
, unsigned int access
)
1240 struct key
*key
= (struct key
*)get_handle_obj( current
->process
, hkey
, access
, &key_ops
);
1242 if (key
&& key
->flags
& KEY_DELETED
)
1244 set_error( STATUS_KEY_DELETED
);
1245 release_object( key
);
1251 /* get the registry key corresponding to a parent key handle */
1252 static inline struct key
*get_parent_hkey_obj( obj_handle_t hkey
)
1254 if (!hkey
) return (struct key
*)grab_object( root_key
);
1255 return get_hkey_obj( hkey
, 0 );
1258 /* read a line from the input file */
1259 static int read_next_line( struct file_load_info
*info
)
1262 int newlen
, pos
= 0;
1267 if (!fgets( info
->buffer
+ pos
, info
->len
- pos
, info
->file
))
1268 return (pos
!= 0); /* EOF */
1269 pos
= strlen(info
->buffer
);
1270 if (info
->buffer
[pos
-1] == '\n')
1272 /* got a full line */
1273 info
->buffer
[--pos
] = 0;
1274 if (pos
> 0 && info
->buffer
[pos
-1] == '\r') info
->buffer
[pos
-1] = 0;
1277 if (pos
< info
->len
- 1) return 1; /* EOF but something was read */
1279 /* need to enlarge the buffer */
1280 newlen
= info
->len
+ info
->len
/ 2;
1281 if (!(newbuf
= realloc( info
->buffer
, newlen
)))
1283 set_error( STATUS_NO_MEMORY
);
1286 info
->buffer
= newbuf
;
1291 /* make sure the temp buffer holds enough space */
1292 static int get_file_tmp_space( struct file_load_info
*info
, size_t size
)
1295 if (info
->tmplen
>= size
) return 1;
1296 if (!(tmp
= realloc( info
->tmp
, size
)))
1298 set_error( STATUS_NO_MEMORY
);
1302 info
->tmplen
= size
;
1306 /* report an error while loading an input file */
1307 static void file_read_error( const char *err
, struct file_load_info
*info
)
1310 fprintf( stderr
, "%s:%d: %s '%s'\n", info
->filename
, info
->line
, err
, info
->buffer
);
1312 fprintf( stderr
, "<fd>:%d: %s '%s'\n", info
->line
, err
, info
->buffer
);
1315 /* convert a data type tag to a value type */
1316 static int get_data_type( const char *buffer
, int *type
, int *parse_type
)
1318 struct data_type
{ const char *tag
; int len
; int type
; int parse_type
; };
1320 static const struct data_type data_types
[] =
1321 { /* actual type */ /* type to assume for parsing */
1322 { "\"", 1, REG_SZ
, REG_SZ
},
1323 { "str:\"", 5, REG_SZ
, REG_SZ
},
1324 { "str(2):\"", 8, REG_EXPAND_SZ
, REG_SZ
},
1325 { "str(7):\"", 8, REG_MULTI_SZ
, REG_SZ
},
1326 { "hex:", 4, REG_BINARY
, REG_BINARY
},
1327 { "dword:", 6, REG_DWORD
, REG_DWORD
},
1328 { "hex(", 4, -1, REG_BINARY
},
1332 const struct data_type
*ptr
;
1335 for (ptr
= data_types
; ptr
->tag
; ptr
++)
1337 if (strncmp( ptr
->tag
, buffer
, ptr
->len
)) continue;
1338 *parse_type
= ptr
->parse_type
;
1339 if ((*type
= ptr
->type
) != -1) return ptr
->len
;
1340 /* "hex(xx):" is special */
1341 *type
= (int)strtoul( buffer
+ 4, &end
, 16 );
1342 if ((end
<= buffer
) || strncmp( end
, "):", 2 )) return 0;
1343 return end
+ 2 - buffer
;
1348 /* load and create a key from the input file */
1349 static struct key
*load_key( struct key
*base
, const char *buffer
, int prefix_len
,
1350 struct file_load_info
*info
, timeout_t
*modif
)
1353 struct unicode_str name
;
1358 if (!get_file_tmp_space( info
, strlen(buffer
) * sizeof(WCHAR
) )) return NULL
;
1361 if ((res
= parse_strW( info
->tmp
, &len
, buffer
, ']' )) == -1)
1363 file_read_error( "Malformed key", info
);
1366 if (sscanf( buffer
+ res
, " %u", &mod
) == 1)
1367 *modif
= (timeout_t
)mod
* TICKS_PER_SEC
+ ticks_1601_to_1970
;
1369 *modif
= current_time
;
1372 while (prefix_len
&& *p
) { if (*p
++ == '\\') prefix_len
--; }
1378 file_read_error( "Malformed key", info
);
1381 /* empty key name, return base key */
1382 return (struct key
*)grab_object( base
);
1385 name
.len
= len
- (p
- info
->tmp
+ 1) * sizeof(WCHAR
);
1386 return create_key_recursive( base
, &name
, 0 );
1389 /* update the modification time of a key (and its parents) after it has been loaded from a file */
1390 static void update_key_time( struct key
*key
, timeout_t modif
)
1392 while (key
&& !key
->modif
)
1399 /* load a global option from the input file */
1400 static int load_global_option( const char *buffer
, struct file_load_info
*info
)
1404 if (!strncmp( buffer
, "#arch=", 6 ))
1406 enum prefix_type type
;
1408 if (!strcmp( p
, "win32" )) type
= PREFIX_32BIT
;
1409 else if (!strcmp( p
, "win64" )) type
= PREFIX_64BIT
;
1412 file_read_error( "Unknown architecture", info
);
1413 set_error( STATUS_NOT_REGISTRY_FILE
);
1416 if (prefix_type
== PREFIX_UNKNOWN
) prefix_type
= type
;
1417 else if (type
!= prefix_type
)
1419 file_read_error( "Mismatched architecture", info
);
1420 set_error( STATUS_NOT_REGISTRY_FILE
);
1424 /* ignore unknown options */
1428 /* load a key option from the input file */
1429 static int load_key_option( struct key
*key
, const char *buffer
, struct file_load_info
*info
)
1434 if (!strncmp( buffer
, "#time=", 6 ))
1436 timeout_t modif
= 0;
1437 for (p
= buffer
+ 6; *p
; p
++)
1439 if (*p
>= '0' && *p
<= '9') modif
= (modif
<< 4) | (*p
- '0');
1440 else if (*p
>= 'A' && *p
<= 'F') modif
= (modif
<< 4) | (*p
- 'A' + 10);
1441 else if (*p
>= 'a' && *p
<= 'f') modif
= (modif
<< 4) | (*p
- 'a' + 10);
1444 update_key_time( key
, modif
);
1446 if (!strncmp( buffer
, "#class=", 7 ))
1449 if (*p
++ != '"') return 0;
1450 if (!get_file_tmp_space( info
, strlen(p
) * sizeof(WCHAR
) )) return 0;
1452 if (parse_strW( info
->tmp
, &len
, p
, '\"' ) == -1) return 0;
1454 if (!(key
->class = memdup( info
->tmp
, len
))) len
= 0;
1455 key
->classlen
= len
;
1457 if (!strncmp( buffer
, "#link", 5 )) key
->flags
|= KEY_SYMLINK
;
1458 /* ignore unknown options */
1462 /* parse a comma-separated list of hex digits */
1463 static int parse_hex( unsigned char *dest
, data_size_t
*len
, const char *buffer
)
1465 const char *p
= buffer
;
1466 data_size_t count
= 0;
1469 while (isxdigit(*p
))
1471 unsigned int val
= strtoul( p
, &end
, 16 );
1472 if (end
== p
|| val
> 0xff) return -1;
1473 if (count
++ >= *len
) return -1; /* dest buffer overflow */
1476 while (isspace(*p
)) p
++;
1478 while (isspace(*p
)) p
++;
1484 /* parse a value name and create the corresponding value */
1485 static struct key_value
*parse_value_name( struct key
*key
, const char *buffer
, data_size_t
*len
,
1486 struct file_load_info
*info
)
1488 struct key_value
*value
;
1489 struct unicode_str name
;
1492 if (!get_file_tmp_space( info
, strlen(buffer
) * sizeof(WCHAR
) )) return NULL
;
1493 name
.str
= info
->tmp
;
1494 name
.len
= info
->tmplen
;
1495 if (buffer
[0] == '@')
1502 int r
= parse_strW( info
->tmp
, &name
.len
, buffer
+ 1, '\"' );
1503 if (r
== -1) goto error
;
1504 *len
= r
+ 1; /* for initial quote */
1505 name
.len
-= sizeof(WCHAR
); /* terminating null */
1507 while (isspace(buffer
[*len
])) (*len
)++;
1508 if (buffer
[*len
] != '=') goto error
;
1510 while (isspace(buffer
[*len
])) (*len
)++;
1511 if (!(value
= find_value( key
, &name
, &index
))) value
= insert_value( key
, &name
, index
);
1515 file_read_error( "Malformed value name", info
);
1519 /* load a value from the input file */
1520 static int load_value( struct key
*key
, const char *buffer
, struct file_load_info
*info
)
1524 int res
, type
, parse_type
;
1525 data_size_t maxlen
, len
;
1526 struct key_value
*value
;
1528 if (!(value
= parse_value_name( key
, buffer
, &len
, info
))) return 0;
1529 if (!(res
= get_data_type( buffer
+ len
, &type
, &parse_type
))) goto error
;
1530 buffer
+= len
+ res
;
1535 if (!get_file_tmp_space( info
, strlen(buffer
) * sizeof(WCHAR
) )) return 0;
1537 if ((res
= parse_strW( info
->tmp
, &len
, buffer
, '\"' )) == -1) goto error
;
1541 dw
= strtoul( buffer
, NULL
, 16 );
1545 case REG_BINARY
: /* hex digits */
1549 maxlen
= 1 + strlen(buffer
) / 2; /* at least 2 chars for one hex byte */
1550 if (!get_file_tmp_space( info
, len
+ maxlen
)) return 0;
1551 if ((res
= parse_hex( (unsigned char *)info
->tmp
+ len
, &maxlen
, buffer
)) == -1) goto error
;
1554 while (isspace(*buffer
)) buffer
++;
1555 if (!*buffer
) break;
1556 if (*buffer
!= '\\') goto error
;
1557 if (read_next_line( info
) != 1) goto error
;
1558 buffer
= info
->buffer
;
1559 while (isspace(*buffer
)) buffer
++;
1565 ptr
= NULL
; /* keep compiler quiet */
1569 if (!len
) newptr
= NULL
;
1570 else if (!(newptr
= memdup( ptr
, len
))) return 0;
1572 free( value
->data
);
1573 value
->data
= newptr
;
1579 file_read_error( "Malformed value", info
);
1580 free( value
->data
);
1583 value
->type
= REG_NONE
;
1587 /* return the length (in path elements) of name that is part of the key name */
1588 /* for instance if key is USER\foo\bar and name is foo\bar\baz, return 2 */
1589 static int get_prefix_len( struct key
*key
, const char *name
, struct file_load_info
*info
)
1595 if (!get_file_tmp_space( info
, strlen(name
) * sizeof(WCHAR
) )) return 0;
1598 if ((res
= parse_strW( info
->tmp
, &len
, name
, ']' )) == -1)
1600 file_read_error( "Malformed key", info
);
1603 for (p
= info
->tmp
; *p
; p
++) if (*p
== '\\') break;
1604 len
= (p
- info
->tmp
) * sizeof(WCHAR
);
1605 for (res
= 1; key
!= root_key
; res
++)
1607 if (len
== key
->namelen
&& !memicmpW( info
->tmp
, key
->name
, len
/ sizeof(WCHAR
) )) break;
1610 if (key
== root_key
) res
= 0; /* no matching name */
1614 /* load all the keys from the input file */
1615 /* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1616 static void load_keys( struct key
*key
, const char *filename
, FILE *f
, int prefix_len
)
1618 struct key
*subkey
= NULL
;
1619 struct file_load_info info
;
1620 timeout_t modif
= current_time
;
1623 info
.filename
= filename
;
1628 if (!(info
.buffer
= mem_alloc( info
.len
))) return;
1629 if (!(info
.tmp
= mem_alloc( info
.tmplen
)))
1631 free( info
.buffer
);
1635 if ((read_next_line( &info
) != 1) ||
1636 strcmp( info
.buffer
, "WINE REGISTRY Version 2" ))
1638 set_error( STATUS_NOT_REGISTRY_FILE
);
1642 while (read_next_line( &info
) == 1)
1645 while (*p
&& isspace(*p
)) p
++;
1648 case '[': /* new key */
1651 update_key_time( subkey
, modif
);
1652 release_object( subkey
);
1654 if (prefix_len
== -1) prefix_len
= get_prefix_len( key
, p
+ 1, &info
);
1655 if (!(subkey
= load_key( key
, p
+ 1, prefix_len
, &info
, &modif
)))
1656 file_read_error( "Error creating key", &info
);
1658 case '@': /* default value */
1659 case '\"': /* value */
1660 if (subkey
) load_value( subkey
, p
, &info
);
1661 else file_read_error( "Value without key", &info
);
1663 case '#': /* option */
1664 if (subkey
) load_key_option( subkey
, p
, &info
);
1665 else if (!load_global_option( p
, &info
)) goto done
;
1667 case ';': /* comment */
1668 case 0: /* empty line */
1671 file_read_error( "Unrecognized input", &info
);
1679 update_key_time( subkey
, modif
);
1680 release_object( subkey
);
1682 free( info
.buffer
);
1686 /* load a part of the registry from a file */
1687 static void load_registry( struct key
*key
, obj_handle_t handle
)
1692 if (!(file
= get_file_obj( current
->process
, handle
, FILE_READ_DATA
))) return;
1693 fd
= dup( get_file_unix_fd( file
) );
1694 release_object( file
);
1697 FILE *f
= fdopen( fd
, "r" );
1700 load_keys( key
, NULL
, f
, -1 );
1703 else file_set_error();
1707 /* load one of the initial registry files */
1708 static int load_init_registry_from_file( const char *filename
, struct key
*key
)
1712 if ((f
= fopen( filename
, "r" )))
1714 load_keys( key
, filename
, f
, 0 );
1716 if (get_error() == STATUS_NOT_REGISTRY_FILE
)
1718 fprintf( stderr
, "%s is not a valid registry file\n", filename
);
1723 assert( save_branch_count
< MAX_SAVE_BRANCH_INFO
);
1725 save_branch_info
[save_branch_count
].path
= filename
;
1726 save_branch_info
[save_branch_count
++].key
= (struct key
*)grab_object( key
);
1727 make_object_static( &key
->obj
);
1731 static WCHAR
*format_user_registry_path( const SID
*sid
, struct unicode_str
*path
)
1733 static const WCHAR prefixW
[] = {'U','s','e','r','\\','S',0};
1734 static const WCHAR formatW
[] = {'-','%','u',0};
1735 WCHAR buffer
[7 + 10 + 10 + 10 * SID_MAX_SUB_AUTHORITIES
];
1739 strcpyW( p
, prefixW
);
1740 p
+= strlenW( prefixW
);
1741 p
+= sprintfW( p
, formatW
, sid
->Revision
);
1742 p
+= sprintfW( p
, formatW
, MAKELONG( MAKEWORD( sid
->IdentifierAuthority
.Value
[5],
1743 sid
->IdentifierAuthority
.Value
[4] ),
1744 MAKEWORD( sid
->IdentifierAuthority
.Value
[3],
1745 sid
->IdentifierAuthority
.Value
[2] )));
1746 for (i
= 0; i
< sid
->SubAuthorityCount
; i
++)
1747 p
+= sprintfW( p
, formatW
, sid
->SubAuthority
[i
] );
1749 path
->len
= (p
- buffer
) * sizeof(WCHAR
);
1750 path
->str
= p
= memdup( buffer
, path
->len
);
1754 /* get the cpu architectures that can be supported in the current prefix */
1755 unsigned int get_prefix_cpu_mask(void)
1757 /* Allowed server/client/prefix combinations:
1761 * server +------+------+ client
1763 * 32 +------+------+---
1764 * | fail | fail | 64
1765 * ---+------+------+---
1767 * 64 +------+------+---
1769 * ---+------+------+---
1771 switch (prefix_type
)
1774 /* 64-bit prefix requires 64-bit server */
1775 return sizeof(void *) > sizeof(int) ? ~0 : 0;
1778 return ~CPU_64BIT_MASK
; /* only 32-bit cpus supported on 32-bit prefix */
1782 /* registry initialisation */
1783 void init_registry(void)
1785 static const WCHAR HKLM
[] = { 'M','a','c','h','i','n','e' };
1786 static const WCHAR HKU_default
[] = { 'U','s','e','r','\\','.','D','e','f','a','u','l','t' };
1787 static const WCHAR classes
[] = {'S','o','f','t','w','a','r','e','\\',
1788 'C','l','a','s','s','e','s','\\',
1789 'W','o','w','6','4','3','2','N','o','d','e'};
1790 static const struct unicode_str root_name
= { NULL
, 0 };
1791 static const struct unicode_str HKLM_name
= { HKLM
, sizeof(HKLM
) };
1792 static const struct unicode_str HKU_name
= { HKU_default
, sizeof(HKU_default
) };
1793 static const struct unicode_str classes_name
= { classes
, sizeof(classes
) };
1795 WCHAR
*current_user_path
;
1796 struct unicode_str current_user_str
;
1797 struct key
*key
, *hklm
, *hkcu
;
1799 /* switch to the config dir */
1801 if (fchdir( config_dir_fd
) == -1) fatal_error( "chdir to config dir: %s\n", strerror( errno
));
1803 /* create the root key */
1804 root_key
= alloc_key( &root_name
, current_time
);
1806 make_object_static( &root_key
->obj
);
1808 /* load system.reg into Registry\Machine */
1810 if (!(hklm
= create_key_recursive( root_key
, &HKLM_name
, current_time
)))
1811 fatal_error( "could not create Machine registry key\n" );
1813 if (!load_init_registry_from_file( "system.reg", hklm
))
1814 prefix_type
= sizeof(void *) > sizeof(int) ? PREFIX_64BIT
: PREFIX_32BIT
;
1815 else if (prefix_type
== PREFIX_UNKNOWN
)
1816 prefix_type
= PREFIX_32BIT
;
1818 /* load userdef.reg into Registry\User\.Default */
1820 if (!(key
= create_key_recursive( root_key
, &HKU_name
, current_time
)))
1821 fatal_error( "could not create User\\.Default registry key\n" );
1823 load_init_registry_from_file( "userdef.reg", key
);
1824 release_object( key
);
1826 /* load user.reg into HKEY_CURRENT_USER */
1828 /* FIXME: match default user in token.c. should get from process token instead */
1829 current_user_path
= format_user_registry_path( security_local_user_sid
, ¤t_user_str
);
1830 if (!current_user_path
||
1831 !(hkcu
= create_key_recursive( root_key
, ¤t_user_str
, current_time
)))
1832 fatal_error( "could not create HKEY_CURRENT_USER registry key\n" );
1833 free( current_user_path
);
1834 load_init_registry_from_file( "user.reg", hkcu
);
1836 /* set the shared flag on Software\Classes\Wow6432Node */
1837 if (prefix_type
== PREFIX_64BIT
)
1839 if ((key
= create_key_recursive( hklm
, &classes_name
, current_time
)))
1841 key
->flags
|= KEY_WOWSHARE
;
1842 release_object( key
);
1844 /* FIXME: handle HKCU too */
1847 release_object( hklm
);
1848 release_object( hkcu
);
1850 /* start the periodic save timer */
1851 set_periodic_save_timer();
1853 /* go back to the server dir */
1854 if (fchdir( server_dir_fd
) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno
));
1857 /* save a registry branch to a file */
1858 static void save_all_subkeys( struct key
*key
, FILE *f
)
1860 fprintf( f
, "WINE REGISTRY Version 2\n" );
1861 fprintf( f
, ";; All keys relative to " );
1862 dump_path( key
, NULL
, f
);
1864 switch (prefix_type
)
1867 fprintf( f
, "\n#arch=win32\n" );
1870 fprintf( f
, "\n#arch=win64\n" );
1875 save_subkeys( key
, key
, f
);
1878 /* save a registry branch to a file handle */
1879 static void save_registry( struct key
*key
, obj_handle_t handle
)
1884 if (!(file
= get_file_obj( current
->process
, handle
, FILE_WRITE_DATA
))) return;
1885 fd
= dup( get_file_unix_fd( file
) );
1886 release_object( file
);
1889 FILE *f
= fdopen( fd
, "w" );
1892 save_all_subkeys( key
, f
);
1893 if (fclose( f
)) file_set_error();
1903 /* save a registry branch to a file */
1904 static int save_branch( struct key
*key
, const char *path
)
1907 char *p
, *tmp
= NULL
;
1908 int fd
, count
= 0, ret
= 0;
1911 if (!(key
->flags
& KEY_DIRTY
))
1913 if (debug_level
> 1) dump_operation( key
, NULL
, "Not saving clean" );
1917 /* test the file type */
1919 if ((fd
= open( path
, O_WRONLY
)) != -1)
1921 /* if file is not a regular file or has multiple links or is accessed
1922 * via symbolic links, write directly into it; otherwise use a temp file */
1923 if (!lstat( path
, &st
) && (!S_ISREG(st
.st_mode
) || st
.st_nlink
> 1))
1931 /* create a temp file in the same directory */
1933 if (!(tmp
= malloc( strlen(path
) + 20 ))) goto done
;
1934 strcpy( tmp
, path
);
1935 if ((p
= strrchr( tmp
, '/' ))) p
++;
1939 sprintf( p
, "reg%lx%04x.tmp", (long) getpid(), count
++ );
1940 if ((fd
= open( tmp
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666 )) != -1) break;
1941 if (errno
!= EEXIST
) goto done
;
1945 /* now save to it */
1948 if (!(f
= fdopen( fd
, "w" )))
1950 if (tmp
) unlink( tmp
);
1955 if (debug_level
> 1)
1957 fprintf( stderr
, "%s: ", path
);
1958 dump_operation( key
, NULL
, "saving" );
1961 save_all_subkeys( key
, f
);
1966 /* if successfully written, rename to final name */
1967 if (ret
) ret
= !rename( tmp
, path
);
1968 if (!ret
) unlink( tmp
);
1973 if (ret
) make_clean( key
);
1977 /* periodic saving of the registry */
1978 static void periodic_save( void *arg
)
1982 if (fchdir( config_dir_fd
) == -1) return;
1983 save_timeout_user
= NULL
;
1984 for (i
= 0; i
< save_branch_count
; i
++)
1985 save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
);
1986 if (fchdir( server_dir_fd
) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno
));
1987 set_periodic_save_timer();
1990 /* start the periodic save timer */
1991 static void set_periodic_save_timer(void)
1993 if (save_timeout_user
) remove_timeout_user( save_timeout_user
);
1994 save_timeout_user
= add_timeout_user( save_period
, periodic_save
, NULL
);
1997 /* save the modified registry branches to disk */
1998 void flush_registry(void)
2002 if (fchdir( config_dir_fd
) == -1) return;
2003 for (i
= 0; i
< save_branch_count
; i
++)
2005 if (!save_branch( save_branch_info
[i
].key
, save_branch_info
[i
].path
))
2007 fprintf( stderr
, "wineserver: could not save registry branch to %s",
2008 save_branch_info
[i
].path
);
2012 if (fchdir( server_dir_fd
) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno
));
2015 /* determine if the thread is wow64 (32-bit client running on 64-bit prefix) */
2016 static int is_wow64_thread( struct thread
*thread
)
2018 return (prefix_type
== PREFIX_64BIT
&& !(CPU_FLAG(thread
->process
->cpu
) & CPU_64BIT_MASK
));
2022 /* create a registry key */
2023 DECL_HANDLER(create_key
)
2025 struct key
*key
= NULL
, *parent
;
2026 struct unicode_str name
, class;
2027 unsigned int access
= req
->access
;
2028 const struct security_descriptor
*sd
;
2029 const struct object_attributes
*objattr
= get_req_object_attributes( &sd
, &name
);
2031 if (!objattr
) return;
2033 if (!is_wow64_thread( current
)) access
= (access
& ~KEY_WOW64_32KEY
) | KEY_WOW64_64KEY
;
2035 class.str
= get_req_data_after_objattr( objattr
, &class.len
);
2036 class.len
= (class.len
/ sizeof(WCHAR
)) * sizeof(WCHAR
);
2038 if (!objattr
->rootdir
&& name
.len
>= sizeof(root_name
) &&
2039 !memicmpW( name
.str
, root_name
, sizeof(root_name
)/sizeof(WCHAR
) ))
2041 name
.str
+= sizeof(root_name
)/sizeof(WCHAR
);
2042 name
.len
-= sizeof(root_name
);
2045 /* NOTE: no access rights are required from the parent handle to create a key */
2046 if ((parent
= get_parent_hkey_obj( objattr
->rootdir
)))
2048 if ((key
= create_key( parent
, &name
, &class, req
->options
, access
,
2049 objattr
->attributes
, sd
, &reply
->created
)))
2051 reply
->hkey
= alloc_handle( current
->process
, key
, access
, objattr
->attributes
);
2052 release_object( key
);
2054 release_object( parent
);
2058 /* open a registry key */
2059 DECL_HANDLER(open_key
)
2061 struct key
*key
, *parent
;
2062 struct unicode_str name
;
2063 unsigned int access
= req
->access
;
2065 if (!is_wow64_thread( current
)) access
= (access
& ~KEY_WOW64_32KEY
) | KEY_WOW64_64KEY
;
2068 /* NOTE: no access rights are required to open the parent key, only the child key */
2069 if ((parent
= get_parent_hkey_obj( req
->parent
)))
2071 get_req_path( &name
, !req
->parent
);
2072 if ((key
= open_key( parent
, &name
, access
, req
->attributes
)))
2074 reply
->hkey
= alloc_handle( current
->process
, key
, access
, req
->attributes
);
2075 release_object( key
);
2077 release_object( parent
);
2081 /* delete a registry key */
2082 DECL_HANDLER(delete_key
)
2086 if ((key
= get_hkey_obj( req
->hkey
, DELETE
)))
2088 delete_key( key
, 0);
2089 release_object( key
);
2093 /* flush a registry key */
2094 DECL_HANDLER(flush_key
)
2096 struct key
*key
= get_hkey_obj( req
->hkey
, 0 );
2099 /* we don't need to do anything here with the current implementation */
2100 release_object( key
);
2104 /* enumerate registry subkeys */
2105 DECL_HANDLER(enum_key
)
2109 if ((key
= get_hkey_obj( req
->hkey
,
2110 req
->index
== -1 ? KEY_QUERY_VALUE
: KEY_ENUMERATE_SUB_KEYS
)))
2112 enum_key( key
, req
->index
, req
->info_class
, reply
);
2113 release_object( key
);
2117 /* set a value of a registry key */
2118 DECL_HANDLER(set_key_value
)
2121 struct unicode_str name
;
2123 if (req
->namelen
> get_req_data_size())
2125 set_error( STATUS_INVALID_PARAMETER
);
2128 name
.str
= get_req_data();
2129 name
.len
= (req
->namelen
/ sizeof(WCHAR
)) * sizeof(WCHAR
);
2131 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
2133 data_size_t datalen
= get_req_data_size() - req
->namelen
;
2134 const char *data
= (const char *)get_req_data() + req
->namelen
;
2136 set_value( key
, &name
, req
->type
, data
, datalen
);
2137 release_object( key
);
2141 /* retrieve the value of a registry key */
2142 DECL_HANDLER(get_key_value
)
2145 struct unicode_str name
;
2148 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
2150 get_req_unicode_str( &name
);
2151 get_value( key
, &name
, &reply
->type
, &reply
->total
);
2152 release_object( key
);
2156 /* enumerate the value of a registry key */
2157 DECL_HANDLER(enum_key_value
)
2161 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
2163 enum_value( key
, req
->index
, req
->info_class
, reply
);
2164 release_object( key
);
2168 /* delete a value of a registry key */
2169 DECL_HANDLER(delete_key_value
)
2172 struct unicode_str name
;
2174 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
2176 get_req_unicode_str( &name
);
2177 delete_value( key
, &name
);
2178 release_object( key
);
2182 /* load a registry branch from a file */
2183 DECL_HANDLER(load_registry
)
2185 struct key
*key
, *parent
;
2186 struct unicode_str name
;
2187 const struct security_descriptor
*sd
;
2188 const struct object_attributes
*objattr
= get_req_object_attributes( &sd
, &name
);
2190 if (!thread_single_check_privilege( current
, &SeRestorePrivilege
))
2192 set_error( STATUS_PRIVILEGE_NOT_HELD
);
2196 if (!objattr
->rootdir
&& name
.len
>= sizeof(root_name
) &&
2197 !memicmpW( name
.str
, root_name
, sizeof(root_name
)/sizeof(WCHAR
) ))
2199 name
.str
+= sizeof(root_name
)/sizeof(WCHAR
);
2200 name
.len
-= sizeof(root_name
);
2203 if ((parent
= get_parent_hkey_obj( objattr
->rootdir
)))
2206 if ((key
= create_key( parent
, &name
, NULL
, 0, KEY_WOW64_64KEY
, 0, sd
, &dummy
)))
2208 load_registry( key
, req
->file
);
2209 release_object( key
);
2211 release_object( parent
);
2215 DECL_HANDLER(unload_registry
)
2219 if (!thread_single_check_privilege( current
, &SeRestorePrivilege
))
2221 set_error( STATUS_PRIVILEGE_NOT_HELD
);
2225 if ((key
= get_hkey_obj( req
->hkey
, 0 )))
2227 delete_key( key
, 1 ); /* FIXME */
2228 release_object( key
);
2232 /* save a registry branch to a file */
2233 DECL_HANDLER(save_registry
)
2237 if (!thread_single_check_privilege( current
, &SeBackupPrivilege
))
2239 set_error( STATUS_PRIVILEGE_NOT_HELD
);
2243 if ((key
= get_hkey_obj( req
->hkey
, 0 )))
2245 save_registry( key
, req
->file
);
2246 release_object( key
);
2250 /* add a registry key change notification */
2251 DECL_HANDLER(set_registry_notification
)
2254 struct event
*event
;
2255 struct notify
*notify
;
2257 key
= get_hkey_obj( req
->hkey
, KEY_NOTIFY
);
2260 event
= get_event_obj( current
->process
, req
->event
, SYNCHRONIZE
);
2263 notify
= find_notify( key
, current
->process
, req
->hkey
);
2267 release_object( notify
->event
);
2268 grab_object( event
);
2269 notify
->event
= event
;
2273 notify
= mem_alloc( sizeof(*notify
) );
2276 grab_object( event
);
2277 notify
->event
= event
;
2278 notify
->subtree
= req
->subtree
;
2279 notify
->filter
= req
->filter
;
2280 notify
->hkey
= req
->hkey
;
2281 notify
->process
= current
->process
;
2282 list_add_head( &key
->notify_list
, ¬ify
->entry
);
2287 reset_event( event
);
2288 set_error( STATUS_PENDING
);
2290 release_object( event
);
2292 release_object( key
);