2 * Server-side registry management
4 * Copyright (C) 1999 Alexandre Julliard
8 * - behavior with deleted keys
9 * - values larger than request buffer
30 struct object obj
; /* object header */
31 WCHAR
*name
; /* key name */
32 WCHAR
*class; /* key class */
33 struct key
*parent
; /* parent key */
34 int last_subkey
; /* last in use subkey */
35 int nb_subkeys
; /* count of allocated subkeys */
36 struct key
**subkeys
; /* subkeys array */
37 int last_value
; /* last in use value */
38 int nb_values
; /* count of allocated values in array */
39 struct key_value
*values
; /* values array */
40 short flags
; /* flags */
41 short level
; /* saving level */
42 time_t modif
; /* last modification time */
46 #define KEY_VOLATILE 0x0001 /* key is volatile (not saved to disk) */
47 #define KEY_DELETED 0x0002 /* key has been deleted */
48 #define KEY_ROOT 0x0004 /* key is a root key */
53 WCHAR
*name
; /* value name */
54 int type
; /* value type */
55 size_t len
; /* value data length in bytes */
56 void *data
; /* pointer to value data */
59 #define MIN_SUBKEYS 8 /* min. number of allocated subkeys per key */
60 #define MIN_VALUES 8 /* min. number of allocated values per key */
64 #define HKEY_ROOT_FIRST HKEY_CLASSES_ROOT
65 #define HKEY_ROOT_LAST HKEY_DYN_DATA
66 #define NB_ROOT_KEYS (HKEY_ROOT_LAST - HKEY_ROOT_FIRST + 1)
67 #define IS_ROOT_HKEY(h) (((h) >= HKEY_ROOT_FIRST) && ((h) <= HKEY_ROOT_LAST))
68 static struct key
*root_keys
[NB_ROOT_KEYS
];
70 static const char * const root_key_names
[NB_ROOT_KEYS
] =
76 "HKEY_PERFORMANCE_DATA",
77 "HKEY_CURRENT_CONFIG",
82 /* keys saving level */
83 /* current_level is the level that is put into all newly created or modified keys */
84 /* saving_level is the minimum level that a key needs in order to get saved */
85 static int current_level
;
86 static int saving_level
;
88 static int saving_version
= 1; /* file format version */
91 /* information about a file being loaded */
94 FILE *file
; /* input file */
95 char *buffer
; /* line buffer */
96 int len
; /* buffer length */
97 int line
; /* current input line */
98 char *tmp
; /* temp buffer to use while parsing input */
99 int tmplen
; /* length of temp buffer */
103 static void key_dump( struct object
*obj
, int verbose
);
104 static void key_destroy( struct object
*obj
);
106 static const struct object_ops key_ops
=
108 sizeof(struct key
), /* size */
110 no_add_queue
, /* add_queue */
111 NULL
, /* remove_queue */
113 NULL
, /* satisfied */
114 NULL
, /* get_poll_events */
115 NULL
, /* poll_event */
116 no_read_fd
, /* get_read_fd */
117 no_write_fd
, /* get_write_fd */
118 no_flush
, /* flush */
119 no_get_file_info
, /* get_file_info */
120 key_destroy
/* destroy */
125 * The registry text file format v2 used by this code is similar to the one
126 * used by REGEDIT import/export functionality, with the following differences:
127 * - strings and key names can contain \x escapes for Unicode
128 * - key names use escapes too in order to support Unicode
129 * - the modification time optionally follows the key name
130 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
133 static inline char to_hex( char ch
)
135 if (isdigit(ch
)) return ch
- '0';
136 return tolower(ch
) - 'a' + 10;
139 /* dump the full path of a key */
140 static void dump_path( struct key
*key
, struct key
*base
, FILE *f
)
142 if (key
->parent
&& key
!= base
)
144 dump_path( key
->parent
, base
, f
);
145 fprintf( f
, "\\\\" );
148 if (key
->name
) dump_strW( key
->name
, strlenW(key
->name
), f
, "[]" );
152 for (i
= 0; i
< NB_ROOT_KEYS
; i
++)
153 if (root_keys
[i
] == key
) fprintf( f
, "%s", root_key_names
[i
] );
157 /* dump a value to a text file */
158 static void dump_value( struct key_value
*value
, FILE *f
)
165 count
= 1 + dump_strW( value
->name
, strlenW(value
->name
), f
, "\"\"" );
166 count
+= fprintf( f
, "\"=" );
168 else count
= fprintf( f
, "@=" );
175 if (value
->type
!= REG_SZ
) fprintf( f
, "str(%d):", value
->type
);
177 if (value
->data
) dump_strW( (WCHAR
*)value
->data
, value
->len
/ sizeof(WCHAR
), f
, "\"\"" );
181 if (value
->len
== sizeof(DWORD
))
184 memcpy( &dw
, value
->data
, sizeof(DWORD
) );
185 fprintf( f
, "dword:%08lx", dw
);
188 /* else fall through */
190 if (value
->type
== REG_BINARY
) count
+= fprintf( f
, "hex:" );
191 else count
+= fprintf( f
, "hex(%x):", value
->type
);
192 for (i
= 0; i
< value
->len
; i
++)
194 count
+= fprintf( f
, "%02x", *((unsigned char *)value
->data
+ i
) );
195 if (i
< value
->len
-1)
200 fprintf( f
, "\\\n " );
210 /* save a registry and all its subkeys to a text file */
211 static void save_subkeys( struct key
*key
, struct key
*base
, FILE *f
)
215 if (key
->flags
& KEY_VOLATILE
) return;
216 /* save key if it has the proper level, and has either some values or no subkeys */
217 /* keys with no values but subkeys are saved implicitly by saving the subkeys */
218 if ((key
->level
>= saving_level
) && ((key
->last_value
>= 0) || (key
->last_subkey
== -1)))
221 dump_path( key
, base
, f
);
222 fprintf( f
, "] %ld\n", key
->modif
);
223 for (i
= 0; i
<= key
->last_value
; i
++) dump_value( &key
->values
[i
], f
);
225 for (i
= 0; i
<= key
->last_subkey
; i
++) save_subkeys( key
->subkeys
[i
], base
, f
);
228 static void dump_operation( struct key
*key
, struct key_value
*value
, const char *op
)
230 fprintf( stderr
, "%s key ", op
);
231 if (key
) dump_path( key
, NULL
, stderr
);
232 else fprintf( stderr
, "ERROR" );
235 fprintf( stderr
, " value ");
236 dump_value( value
, stderr
);
238 else fprintf( stderr
, "\n" );
241 static void key_dump( struct object
*obj
, int verbose
)
243 struct key
*key
= (struct key
*)obj
;
244 assert( obj
->ops
== &key_ops
);
245 fprintf( stderr
, "Key flags=%x ", key
->flags
);
246 dump_path( key
, NULL
, stderr
);
247 fprintf( stderr
, "\n" );
250 static void key_destroy( struct object
*obj
)
253 struct key
*key
= (struct key
*)obj
;
254 assert( obj
->ops
== &key_ops
);
257 if (key
->class) free( key
->class );
258 for (i
= 0; i
<= key
->last_value
; i
++)
260 free( key
->values
[i
].name
);
261 if (key
->values
[i
].data
) free( key
->values
[i
].data
);
263 for (i
= 0; i
<= key
->last_subkey
; i
++)
265 key
->subkeys
[i
]->parent
= NULL
;
266 release_object( key
->subkeys
[i
] );
270 /* duplicate a key path from the request buffer */
271 /* returns a pointer to a static buffer, so only useable once per request */
272 static WCHAR
*copy_path( const path_t path
)
274 static WCHAR buffer
[MAX_PATH
+1];
277 while (p
< buffer
+ sizeof(buffer
) - 1) if (!(*p
++ = *path
++)) break;
282 /* return the next token in a given path */
283 /* returns a pointer to a static buffer, so only useable once per request */
284 static WCHAR
*get_path_token( const WCHAR
*initpath
, size_t maxlen
)
286 static const WCHAR
*path
;
287 static const WCHAR
*end
;
288 static WCHAR buffer
[MAX_PATH
+1];
294 end
= path
+ maxlen
/ sizeof(WCHAR
);
296 while ((path
< end
) && (*path
== '\\')) path
++;
297 while ((path
< end
) && (p
< buffer
+ sizeof(buffer
) - 1))
300 if (!ch
|| (ch
== '\\')) break;
308 /* duplicate a Unicode string from the request buffer */
309 static WCHAR
*req_strdupW( const WCHAR
*str
)
312 size_t len
= get_req_strlenW( str
);
313 if ((name
= mem_alloc( (len
+ 1) * sizeof(WCHAR
) )) != NULL
)
315 memcpy( name
, str
, len
* sizeof(WCHAR
) );
321 /* allocate a key object */
322 static struct key
*alloc_key( const WCHAR
*name
, time_t modif
)
325 if ((key
= (struct key
*)alloc_object( &key_ops
, -1 )))
330 key
->last_subkey
= -1;
334 key
->last_value
= -1;
336 key
->level
= current_level
;
339 if (name
&& !(key
->name
= strdupW( name
)))
341 release_object( key
);
348 /* update key modification time */
349 static void touch_key( struct key
*key
)
351 key
->modif
= time(NULL
);
352 key
->level
= MAX( key
->level
, current_level
);
355 /* try to grow the array of subkeys; return 1 if OK, 0 on error */
356 static int grow_subkeys( struct key
*key
)
358 struct key
**new_subkeys
;
363 nb_subkeys
= key
->nb_subkeys
+ (key
->nb_subkeys
/ 2); /* grow by 50% */
364 if (!(new_subkeys
= realloc( key
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) )))
366 set_error( STATUS_NO_MEMORY
);
372 nb_subkeys
= MIN_VALUES
;
373 if (!(new_subkeys
= mem_alloc( nb_subkeys
* sizeof(*new_subkeys
) ))) return 0;
375 key
->subkeys
= new_subkeys
;
376 key
->nb_subkeys
= nb_subkeys
;
380 /* allocate a subkey for a given key, and return its index */
381 static struct key
*alloc_subkey( struct key
*parent
, const WCHAR
*name
, int index
, time_t modif
)
386 if (parent
->last_subkey
+ 1 == parent
->nb_subkeys
)
388 /* need to grow the array */
389 if (!grow_subkeys( parent
)) return NULL
;
391 if ((key
= alloc_key( name
, modif
)) != NULL
)
393 key
->parent
= parent
;
394 for (i
= ++parent
->last_subkey
; i
> index
; i
--)
395 parent
->subkeys
[i
] = parent
->subkeys
[i
-1];
396 parent
->subkeys
[index
] = key
;
401 /* free a subkey of a given key */
402 static void free_subkey( struct key
*parent
, int index
)
407 assert( index
>= 0 );
408 assert( index
<= parent
->last_subkey
);
410 key
= parent
->subkeys
[index
];
411 for (i
= index
; i
< parent
->last_subkey
; i
++) parent
->subkeys
[i
] = parent
->subkeys
[i
+ 1];
412 parent
->last_subkey
--;
413 key
->flags
|= KEY_DELETED
;
415 release_object( key
);
417 /* try to shrink the array */
418 nb_subkeys
= key
->nb_subkeys
;
419 if (nb_subkeys
> MIN_SUBKEYS
&& key
->last_subkey
< nb_subkeys
/ 2)
421 struct key
**new_subkeys
;
422 nb_subkeys
-= nb_subkeys
/ 3; /* shrink by 33% */
423 if (nb_subkeys
< MIN_SUBKEYS
) nb_subkeys
= MIN_SUBKEYS
;
424 if (!(new_subkeys
= realloc( key
->subkeys
, nb_subkeys
* sizeof(*new_subkeys
) ))) return;
425 key
->subkeys
= new_subkeys
;
426 key
->nb_subkeys
= nb_subkeys
;
430 /* find the named child of a given key and return its index */
431 static struct key
*find_subkey( struct key
*key
, const WCHAR
*name
, int *index
)
433 int i
, min
, max
, res
;
436 max
= key
->last_subkey
;
440 if (!(res
= strcmpiW( key
->subkeys
[i
]->name
, name
)))
443 return key
->subkeys
[i
];
445 if (res
> 0) max
= i
- 1;
448 *index
= min
; /* this is where we should insert it */
453 static struct key
*open_key( struct key
*key
, const WCHAR
*name
, size_t maxlen
)
458 path
= get_path_token( name
, maxlen
);
461 if (!(key
= find_subkey( key
, path
, &index
)))
463 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
466 path
= get_path_token( NULL
, 0 );
469 if (debug_level
> 1) dump_operation( key
, NULL
, "Open" );
470 if (key
) grab_object( key
);
474 /* create a subkey */
475 static struct key
*create_key( struct key
*key
, const WCHAR
*name
, size_t maxlen
, WCHAR
*class,
476 unsigned int options
, time_t modif
, int *created
)
479 int base_idx
, index
, flags
= 0;
482 if (key
->flags
& KEY_DELETED
) /* we cannot create a subkey under a deleted key */
484 set_error( STATUS_KEY_DELETED
);
487 if (options
& REG_OPTION_VOLATILE
) flags
|= KEY_VOLATILE
;
488 else if (key
->flags
& KEY_VOLATILE
)
490 set_error( STATUS_CHILD_MUST_BE_VOLATILE
);
494 path
= get_path_token( name
, maxlen
);
499 if (!(subkey
= find_subkey( key
, path
, &index
))) break;
501 path
= get_path_token( NULL
, 0 );
504 /* create the remaining part */
506 if (!*path
) goto done
;
510 key
= alloc_subkey( key
, path
, index
, modif
);
514 path
= get_path_token( NULL
, 0 );
515 if (!*path
) goto done
;
516 /* we know the index is always 0 in a new key */
517 key
= alloc_subkey( key
, path
, 0, modif
);
519 if (base_idx
!= -1) free_subkey( base
, base_idx
);
523 if (debug_level
> 1) dump_operation( key
, NULL
, "Create" );
524 if (class) key
->class = strdupW(class);
529 /* find a subkey of a given key by its index */
530 static void enum_key( struct key
*parent
, int index
, WCHAR
*name
, WCHAR
*class, time_t *modif
)
534 if ((index
< 0) || (index
> parent
->last_subkey
)) set_error( STATUS_NO_MORE_ENTRIES
);
537 key
= parent
->subkeys
[index
];
539 strcpyW( name
, key
->name
);
540 if (key
->class) strcpyW( class, key
->class ); /* FIXME: length */
542 if (debug_level
> 1) dump_operation( key
, NULL
, "Enum" );
546 /* query information about a key */
547 static void query_key( struct key
*key
, struct query_key_info_request
*req
)
550 int max_subkey
= 0, max_class
= 0;
551 int max_value
= 0, max_data
= 0;
553 for (i
= 0; i
<= key
->last_subkey
; i
++)
555 struct key
*subkey
= key
->subkeys
[i
];
556 len
= strlenW( subkey
->name
);
557 if (len
> max_subkey
) max_subkey
= len
;
558 if (!subkey
->class) continue;
559 len
= strlenW( subkey
->class );
560 if (len
> max_class
) max_class
= len
;
562 for (i
= 0; i
<= key
->last_value
; i
++)
564 len
= strlenW( key
->values
[i
].name
);
565 if (len
> max_value
) max_value
= len
;
566 len
= key
->values
[i
].len
;
567 if (len
> max_data
) max_data
= len
;
569 req
->subkeys
= key
->last_subkey
+ 1;
570 req
->max_subkey
= max_subkey
;
571 req
->max_class
= max_class
;
572 req
->values
= key
->last_value
+ 1;
573 req
->max_value
= max_value
;
574 req
->max_data
= max_data
;
575 req
->modif
= key
->modif
;
576 strcpyW( req
->name
, key
->name
);
577 if (key
->class) strcpyW( req
->class, key
->class ); /* FIXME: length */
578 else req
->class[0] = 0;
579 if (debug_level
> 1) dump_operation( key
, NULL
, "Query" );
582 /* delete a key and its values */
583 static void delete_key( struct key
*key
, const WCHAR
*name
, size_t maxlen
)
589 path
= get_path_token( name
, maxlen
);
592 /* deleting this key, must find parent and index */
593 if (key
->flags
& KEY_ROOT
)
595 set_error( STATUS_ACCESS_DENIED
);
598 if (!(parent
= key
->parent
) || (key
->flags
& KEY_DELETED
))
600 set_error( STATUS_KEY_DELETED
);
603 for (index
= 0; index
<= parent
->last_subkey
; index
++)
604 if (parent
->subkeys
[index
] == key
) break;
605 assert( index
<= parent
->last_subkey
);
610 if (!(key
= find_subkey( parent
, path
, &index
)))
612 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
615 path
= get_path_token( NULL
, 0 );
618 /* we can only delete a key that has no subkeys (FIXME) */
619 if ((key
->flags
& KEY_ROOT
) || (key
->last_subkey
>= 0))
621 set_error( STATUS_ACCESS_DENIED
);
624 if (debug_level
> 1) dump_operation( key
, NULL
, "Delete" );
625 free_subkey( parent
, index
);
629 /* try to grow the array of values; return 1 if OK, 0 on error */
630 static int grow_values( struct key
*key
)
632 struct key_value
*new_val
;
637 nb_values
= key
->nb_values
+ (key
->nb_values
/ 2); /* grow by 50% */
638 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) )))
640 set_error( STATUS_NO_MEMORY
);
646 nb_values
= MIN_VALUES
;
647 if (!(new_val
= mem_alloc( nb_values
* sizeof(*new_val
) ))) return 0;
649 key
->values
= new_val
;
650 key
->nb_values
= nb_values
;
654 /* find the named value of a given key and return its index in the array */
655 static struct key_value
*find_value( const struct key
*key
, const WCHAR
*name
, int *index
)
657 int i
, min
, max
, res
;
660 max
= key
->last_value
;
664 if (!(res
= strcmpiW( key
->values
[i
].name
, name
)))
667 return &key
->values
[i
];
669 if (res
> 0) max
= i
- 1;
672 *index
= min
; /* this is where we should insert it */
676 /* insert a new value or return a pointer to an existing one */
677 static struct key_value
*insert_value( struct key
*key
, const WCHAR
*name
)
679 struct key_value
*value
;
683 if (!(value
= find_value( key
, name
, &index
)))
685 /* not found, add it */
686 if (key
->last_value
+ 1 == key
->nb_values
)
688 if (!grow_values( key
)) return NULL
;
690 if (!(new_name
= strdupW(name
))) return NULL
;
691 for (i
= ++key
->last_value
; i
> index
; i
--) key
->values
[i
] = key
->values
[i
- 1];
692 value
= &key
->values
[index
];
693 value
->name
= new_name
;
700 /* set a key value */
701 static void set_value( struct key
*key
, WCHAR
*name
, int type
, int datalen
, void *data
)
703 struct key_value
*value
;
706 /* first copy the data */
709 if (!(ptr
= mem_alloc( datalen
))) return;
710 memcpy( ptr
, data
, datalen
);
713 if (!(value
= insert_value( key
, name
)))
715 if (ptr
) free( ptr
);
718 if (value
->data
) free( value
->data
); /* already existing, free previous data */
720 value
->len
= datalen
;
723 if (debug_level
> 1) dump_operation( key
, value
, "Set" );
726 /* get a key value */
727 static void get_value( struct key
*key
, WCHAR
*name
, int *type
, int *len
, void *data
)
729 struct key_value
*value
;
732 if ((value
= find_value( key
, name
, &index
)))
736 if (value
->data
) memcpy( data
, value
->data
, value
->len
);
737 if (debug_level
> 1) dump_operation( key
, value
, "Get" );
743 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
747 /* enumerate a key value */
748 static void enum_value( struct key
*key
, int i
, WCHAR
*name
, int *type
, int *len
, void *data
)
750 struct key_value
*value
;
752 if (i
< 0 || i
> key
->last_value
)
756 set_error( STATUS_NO_MORE_ENTRIES
);
760 value
= &key
->values
[i
];
761 strcpyW( name
, value
->name
);
764 if (value
->data
) memcpy( data
, value
->data
, value
->len
);
765 if (debug_level
> 1) dump_operation( key
, value
, "Enum" );
770 static void delete_value( struct key
*key
, const WCHAR
*name
)
772 struct key_value
*value
;
773 int i
, index
, nb_values
;
775 if (!(value
= find_value( key
, name
, &index
)))
777 set_error( STATUS_OBJECT_NAME_NOT_FOUND
);
780 if (debug_level
> 1) dump_operation( key
, value
, "Delete" );
782 if (value
->data
) free( value
->data
);
783 for (i
= index
; i
< key
->last_value
; i
++) key
->values
[i
] = key
->values
[i
+ 1];
787 /* try to shrink the array */
788 nb_values
= key
->nb_values
;
789 if (nb_values
> MIN_VALUES
&& key
->last_value
< nb_values
/ 2)
791 struct key_value
*new_val
;
792 nb_values
-= nb_values
/ 3; /* shrink by 33% */
793 if (nb_values
< MIN_VALUES
) nb_values
= MIN_VALUES
;
794 if (!(new_val
= realloc( key
->values
, nb_values
* sizeof(*new_val
) ))) return;
795 key
->values
= new_val
;
796 key
->nb_values
= nb_values
;
800 static struct key
*get_hkey_obj( int hkey
, unsigned int access
);
802 static struct key
*create_root_key( int hkey
)
809 /* the two real root-keys */
810 case HKEY_LOCAL_MACHINE
:
812 static const WCHAR name
[] = { 'M','A','C','H','I','N','E',0 };
813 key
= alloc_key( name
, time(NULL
) );
818 static const WCHAR name
[] = { 'U','S','E','R',0 };
819 key
= alloc_key( name
, time(NULL
) );
822 /* special subkeys */
823 case HKEY_CLASSES_ROOT
:
825 static const WCHAR name
[] =
826 { 'S','O','F','T','W','A','R','E','\\','C','l','a','s','s','e','s',0 };
828 struct key
*root
= get_hkey_obj( HKEY_LOCAL_MACHINE
, 0 );
829 if (!root
) return NULL
;
830 key
= create_key( root
, name
, sizeof(name
), NULL
, 0, time(NULL
), &dummy
);
831 release_object( root
);
834 case HKEY_CURRENT_CONFIG
:
836 static const WCHAR name
[] = {
837 'S','Y','S','T','E','M','\\',
838 'C','U','R','R','E','N','T','C','O','N','T','R','O','L','S','E','T','\\',
839 'H','A','R','D','W','A','R','E','P','R','O','F','I','L','E','S','\\',
840 'C','U','R','R','E','N','T',0};
841 struct key
*root
= get_hkey_obj( HKEY_LOCAL_MACHINE
, 0 );
842 if (!root
) return NULL
;
843 key
= create_key( root
, name
, sizeof(name
), NULL
, 0, time(NULL
), &dummy
);
844 release_object( root
);
847 case HKEY_CURRENT_USER
:
849 /* FIXME: should be HKEY_USERS\\the_current_user_SID */
850 static const WCHAR name
[] = { '.','D','e','f','a','u','l','t',0 };
851 struct key
*root
= get_hkey_obj( HKEY_USERS
, 0 );
852 if (!root
) return NULL
;
853 key
= create_key( root
, name
, sizeof(name
), NULL
, 0, time(NULL
), &dummy
);
854 release_object( root
);
857 /* dynamically generated keys */
858 case HKEY_PERFORMANCE_DATA
:
860 key
= alloc_key( NULL
, time(NULL
) );
868 root_keys
[hkey
- HKEY_ROOT_FIRST
] = key
;
869 key
->flags
|= KEY_ROOT
;
874 /* close the top-level keys; used on server exit */
875 void close_registry(void)
878 for (i
= 0; i
< NB_ROOT_KEYS
; i
++)
880 if (root_keys
[i
]) release_object( root_keys
[i
] );
884 /* get the registry key corresponding to an hkey handle */
885 static struct key
*get_hkey_obj( int hkey
, unsigned int access
)
889 if (IS_ROOT_HKEY(hkey
))
891 if (!(key
= root_keys
[hkey
- HKEY_ROOT_FIRST
])) key
= create_root_key( hkey
);
895 key
= (struct key
*)get_handle_obj( current
->process
, hkey
, access
, &key_ops
);
899 /* read a line from the input file */
900 static int read_next_line( struct file_load_info
*info
)
908 if (!fgets( info
->buffer
+ pos
, info
->len
- pos
, info
->file
))
909 return (pos
!= 0); /* EOF */
910 pos
= strlen(info
->buffer
);
911 if (info
->buffer
[pos
-1] == '\n')
913 /* got a full line */
914 info
->buffer
[--pos
] = 0;
915 if (pos
> 0 && info
->buffer
[pos
-1] == '\r') info
->buffer
[pos
-1] = 0;
918 if (pos
< info
->len
- 1) return 1; /* EOF but something was read */
920 /* need to enlarge the buffer */
921 newlen
= info
->len
+ info
->len
/ 2;
922 if (!(newbuf
= realloc( info
->buffer
, newlen
)))
924 set_error( STATUS_NO_MEMORY
);
927 info
->buffer
= newbuf
;
932 /* make sure the temp buffer holds enough space */
933 static int get_file_tmp_space( struct file_load_info
*info
, int size
)
936 if (info
->tmplen
>= size
) return 1;
937 if (!(tmp
= realloc( info
->tmp
, size
)))
939 set_error( STATUS_NO_MEMORY
);
947 /* report an error while loading an input file */
948 static void file_read_error( const char *err
, struct file_load_info
*info
)
950 fprintf( stderr
, "Line %d: %s '%s'\n", info
->line
, err
, info
->buffer
);
953 /* parse an escaped string back into Unicode */
954 /* return the number of chars read from the input, or -1 on output overflow */
955 static int parse_strW( WCHAR
*dest
, int *len
, const char *src
, char endchar
)
957 int count
= sizeof(WCHAR
); /* for terminating null */
959 while (*p
&& *p
!= endchar
)
961 if (*p
!= '\\') *dest
= (WCHAR
)*p
++;
967 case 'a': *dest
= '\a'; p
++; break;
968 case 'b': *dest
= '\b'; p
++; break;
969 case 'e': *dest
= '\e'; p
++; break;
970 case 'f': *dest
= '\f'; p
++; break;
971 case 'n': *dest
= '\n'; p
++; break;
972 case 'r': *dest
= '\r'; p
++; break;
973 case 't': *dest
= '\t'; p
++; break;
974 case 'v': *dest
= '\v'; p
++; break;
975 case 'x': /* hex escape */
977 if (!isxdigit(*p
)) *dest
= 'x';
980 *dest
= to_hex(*p
++);
981 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
982 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
983 if (isxdigit(*p
)) *dest
= (*dest
* 16) + to_hex(*p
++);
993 case '7': /* octal escape */
995 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
996 if (*p
>= '0' && *p
<= '7') *dest
= (*dest
* 8) + (*p
++ - '0');
1003 if ((count
+= sizeof(WCHAR
)) > *len
) return -1; /* dest buffer overflow */
1007 if (!*p
) return -1; /* delimiter not found */
1012 /* convert a data type tag to a value type */
1013 static int get_data_type( const char *buffer
, int *type
, int *parse_type
)
1015 struct data_type
{ const char *tag
; int len
; int type
; int parse_type
; };
1017 static const struct data_type data_types
[] =
1018 { /* actual type */ /* type to assume for parsing */
1019 { "\"", 1, REG_SZ
, REG_SZ
},
1020 { "str:\"", 5, REG_SZ
, REG_SZ
},
1021 { "str(2):\"", 8, REG_EXPAND_SZ
, REG_SZ
},
1022 { "str(7):\"", 8, REG_MULTI_SZ
, REG_SZ
},
1023 { "hex:", 4, REG_BINARY
, REG_BINARY
},
1024 { "dword:", 6, REG_DWORD
, REG_DWORD
},
1025 { "hex(", 4, -1, REG_BINARY
},
1029 const struct data_type
*ptr
;
1032 for (ptr
= data_types
; ptr
->tag
; ptr
++)
1034 if (memcmp( ptr
->tag
, buffer
, ptr
->len
)) continue;
1035 *parse_type
= ptr
->parse_type
;
1036 if ((*type
= ptr
->type
) != -1) return ptr
->len
;
1037 /* "hex(xx):" is special */
1038 *type
= (int)strtoul( buffer
+ 4, &end
, 16 );
1039 if ((end
<= buffer
) || memcmp( end
, "):", 2 )) return 0;
1040 return end
+ 2 - buffer
;
1045 /* load and create a key from the input file */
1046 static struct key
*load_key( struct key
*base
, const char *buffer
, struct file_load_info
*info
)
1049 int res
, len
, modif
;
1051 len
= strlen(buffer
) * sizeof(WCHAR
);
1052 if (!get_file_tmp_space( info
, len
)) return NULL
;
1054 if ((res
= parse_strW( (WCHAR
*)info
->tmp
, &len
, buffer
, ']' )) == -1)
1056 file_read_error( "Malformed key", info
);
1059 if (!sscanf( buffer
+ res
, " %d", &modif
)) modif
= time(NULL
);
1061 for (p
= (WCHAR
*)info
->tmp
; *p
; p
++) if (*p
== '\\') { p
++; break; }
1062 return create_key( base
, p
, len
- ((char *)p
- info
->tmp
), NULL
, 0, modif
, &res
);
1065 /* parse a comma-separated list of hex digits */
1066 static int parse_hex( unsigned char *dest
, int *len
, const char *buffer
)
1068 const char *p
= buffer
;
1070 while (isxdigit(*p
))
1074 memcpy( buf
, p
, 2 );
1076 sscanf( buf
, "%x", &val
);
1077 if (count
++ >= *len
) return -1; /* dest buffer overflow */
1078 *dest
++ = (unsigned char )val
;
1086 /* parse a value name and create the corresponding value */
1087 static struct key_value
*parse_value_name( struct key
*key
, const char *buffer
, int *len
,
1088 struct file_load_info
*info
)
1090 int maxlen
= strlen(buffer
) * sizeof(WCHAR
);
1091 if (!get_file_tmp_space( info
, maxlen
)) return NULL
;
1092 if (buffer
[0] == '@')
1094 info
->tmp
[0] = info
->tmp
[1] = 0;
1099 if ((*len
= parse_strW( (WCHAR
*)info
->tmp
, &maxlen
, buffer
+ 1, '\"' )) == -1) goto error
;
1100 (*len
)++; /* for initial quote */
1102 if (buffer
[*len
] != '=') goto error
;
1104 return insert_value( key
, (WCHAR
*)info
->tmp
);
1107 file_read_error( "Malformed value name", info
);
1111 /* load a value from the input file */
1112 static int load_value( struct key
*key
, const char *buffer
, struct file_load_info
*info
)
1116 int maxlen
, len
, res
;
1117 int type
, parse_type
;
1118 struct key_value
*value
;
1120 if (!(value
= parse_value_name( key
, buffer
, &len
, info
))) return 0;
1121 if (!(res
= get_data_type( buffer
+ len
, &type
, &parse_type
))) goto error
;
1122 buffer
+= len
+ res
;
1127 len
= strlen(buffer
) * sizeof(WCHAR
);
1128 if (!get_file_tmp_space( info
, len
)) return 0;
1129 if ((res
= parse_strW( (WCHAR
*)info
->tmp
, &len
, buffer
, '\"' )) == -1) goto error
;
1133 dw
= strtoul( buffer
, NULL
, 16 );
1137 case REG_BINARY
: /* hex digits */
1141 maxlen
= 1 + strlen(buffer
)/3; /* 3 chars for one hex byte */
1142 if (!get_file_tmp_space( info
, len
+ maxlen
)) return 0;
1143 if ((res
= parse_hex( info
->tmp
+ len
, &maxlen
, buffer
)) == -1) goto error
;
1146 while (isspace(*buffer
)) buffer
++;
1147 if (!*buffer
) break;
1148 if (*buffer
!= '\\') goto error
;
1149 if (read_next_line( info
) != 1) goto error
;
1150 buffer
= info
->buffer
;
1151 while (isspace(*buffer
)) buffer
++;
1157 ptr
= NULL
; /* keep compiler quiet */
1161 if (!len
) newptr
= NULL
;
1162 else if (!(newptr
= memdup( ptr
, len
))) return 0;
1164 if (value
->data
) free( value
->data
);
1165 value
->data
= newptr
;
1168 /* update the key level but not the modification time */
1169 key
->level
= MAX( key
->level
, current_level
);
1173 file_read_error( "Malformed value", info
);
1177 /* load all the keys from the input file */
1178 static void load_keys( struct key
*key
, FILE *f
)
1180 struct key
*subkey
= NULL
;
1181 struct file_load_info info
;
1188 if (!(info
.buffer
= mem_alloc( info
.len
))) return;
1189 if (!(info
.tmp
= mem_alloc( info
.tmplen
)))
1191 free( info
.buffer
);
1195 if ((read_next_line( &info
) != 1) ||
1196 strcmp( info
.buffer
, "WINE REGISTRY Version 2" ))
1198 set_error( STATUS_NOT_REGISTRY_FILE
);
1202 while (read_next_line( &info
) == 1)
1204 for (p
= info
.buffer
; *p
&& isspace(*p
); p
++);
1207 case '[': /* new key */
1208 if (subkey
) release_object( subkey
);
1209 subkey
= load_key( key
, p
+ 1, &info
);
1211 case '@': /* default value */
1212 case '\"': /* value */
1213 if (subkey
) load_value( subkey
, p
, &info
);
1214 else file_read_error( "Value without key", &info
);
1216 case '#': /* comment */
1217 case ';': /* comment */
1218 case 0: /* empty line */
1221 file_read_error( "Unrecognized input", &info
);
1227 if (subkey
) release_object( subkey
);
1228 free( info
.buffer
);
1232 /* load a part of the registry from a file */
1233 static void load_registry( struct key
*key
, int handle
)
1238 if (!(obj
= get_handle_obj( current
->process
, handle
, GENERIC_READ
, NULL
))) return;
1239 fd
= obj
->ops
->get_read_fd( obj
);
1240 release_object( obj
);
1243 FILE *f
= fdopen( fd
, "r" );
1246 load_keys( key
, f
);
1249 else file_set_error();
1253 /* update the level of the parents of a key (only needed for the old format) */
1254 static int update_level( struct key
*key
)
1257 int max
= key
->level
;
1258 for (i
= 0; i
<= key
->last_subkey
; i
++)
1260 int sub
= update_level( key
->subkeys
[i
] );
1261 if (sub
> max
) max
= sub
;
1267 /* dump a string to a registry save file in the old v1 format */
1268 static void save_string_v1( LPCWSTR str
, FILE *f
)
1273 if ((*str
> 0x7f) || (*str
== '\n') || (*str
== '='))
1274 fprintf( f
, "\\u%04x", *str
);
1277 if (*str
== '\\') fputc( '\\', f
);
1278 fputc( (char)*str
, f
);
1284 /* save a registry and all its subkeys to a text file in the old v1 format */
1285 static void save_subkeys_v1( struct key
*key
, int nesting
, FILE *f
)
1289 if (key
->flags
& KEY_VOLATILE
) return;
1290 if (key
->level
< saving_level
) return;
1291 for (i
= 0; i
<= key
->last_value
; i
++)
1293 struct key_value
*value
= &key
->values
[i
];
1294 for (j
= nesting
; j
> 0; j
--) fputc( '\t', f
);
1295 save_string_v1( value
->name
, f
);
1296 fprintf( f
, "=%d,%d,", value
->type
, 0 );
1297 if (value
->type
== REG_SZ
|| value
->type
== REG_EXPAND_SZ
)
1298 save_string_v1( (LPWSTR
)value
->data
, f
);
1300 for (j
= 0; j
< value
->len
; j
++)
1301 fprintf( f
, "%02x", *((unsigned char *)value
->data
+ j
) );
1304 for (i
= 0; i
<= key
->last_subkey
; i
++)
1306 for (j
= nesting
; j
> 0; j
--) fputc( '\t', f
);
1307 save_string_v1( key
->subkeys
[i
]->name
, f
);
1309 save_subkeys_v1( key
->subkeys
[i
], nesting
+ 1, f
);
1313 /* save a registry branch to a file handle */
1314 static void save_registry( struct key
*key
, int handle
)
1319 if (key
->flags
& KEY_DELETED
)
1321 set_error( STATUS_KEY_DELETED
);
1324 if (!(obj
= get_handle_obj( current
->process
, handle
, GENERIC_WRITE
, NULL
))) return;
1325 fd
= obj
->ops
->get_write_fd( obj
);
1326 release_object( obj
);
1329 FILE *f
= fdopen( fd
, "w" );
1332 fprintf( f
, "WINE REGISTRY Version %d\n", saving_version
);
1333 if (saving_version
== 2) save_subkeys( key
, key
, f
);
1336 update_level( key
);
1337 save_subkeys_v1( key
, 0, f
);
1339 if (fclose( f
)) file_set_error();
1349 /* create a registry key */
1350 DECL_HANDLER(create_key
)
1352 struct key
*key
, *parent
;
1354 unsigned int access
= req
->access
;
1356 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1358 if ((parent
= get_hkey_obj( req
->parent
, KEY_CREATE_SUB_KEY
)))
1360 if ((class = req_strdupW( req
->class )))
1362 if ((key
= create_key( parent
, req
->name
, sizeof(req
->name
), class, req
->options
,
1363 req
->modif
, &req
->created
)))
1365 req
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1366 release_object( key
);
1370 release_object( parent
);
1374 /* open a registry key */
1375 DECL_HANDLER(open_key
)
1377 struct key
*key
, *parent
;
1378 unsigned int access
= req
->access
;
1380 if (access
& MAXIMUM_ALLOWED
) access
= KEY_ALL_ACCESS
; /* FIXME: needs general solution */
1382 if ((parent
= get_hkey_obj( req
->parent
, 0 /*FIXME*/ )))
1384 if ((key
= open_key( parent
, req
->name
, sizeof(req
->name
) )))
1386 req
->hkey
= alloc_handle( current
->process
, key
, access
, 0 );
1387 release_object( key
);
1389 release_object( parent
);
1393 /* delete a registry key */
1394 DECL_HANDLER(delete_key
)
1398 if ((key
= get_hkey_obj( req
->hkey
, KEY_CREATE_SUB_KEY
/*FIXME*/ )))
1400 delete_key( key
, req
->name
, sizeof(req
->name
) );
1401 release_object( key
);
1405 /* close a registry key */
1406 DECL_HANDLER(close_key
)
1408 int hkey
= req
->hkey
;
1409 /* ignore attempts to close a root key */
1410 if (!IS_ROOT_HKEY(hkey
)) close_handle( current
->process
, hkey
);
1413 /* enumerate registry subkeys */
1414 DECL_HANDLER(enum_key
)
1418 if ((key
= get_hkey_obj( req
->hkey
, KEY_ENUMERATE_SUB_KEYS
)))
1420 enum_key( key
, req
->index
, req
->name
, req
->class, &req
->modif
);
1421 release_object( key
);
1425 /* query information about a registry key */
1426 DECL_HANDLER(query_key_info
)
1430 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1432 query_key( key
, req
);
1433 release_object( key
);
1437 /* set a value of a registry key */
1438 DECL_HANDLER(set_key_value
)
1441 int max
= get_req_size( req
->data
, sizeof(req
->data
[0]) );
1442 int datalen
= req
->len
;
1445 set_error( STATUS_NO_MEMORY
); /* FIXME */
1448 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1450 set_value( key
, copy_path( req
->name
), req
->type
, datalen
, req
->data
);
1451 release_object( key
);
1455 /* retrieve the value of a registry key */
1456 DECL_HANDLER(get_key_value
)
1460 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1462 get_value( key
, copy_path( req
->name
), &req
->type
, &req
->len
, req
->data
);
1463 release_object( key
);
1467 /* enumerate the value of a registry key */
1468 DECL_HANDLER(enum_key_value
)
1472 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
)))
1474 enum_value( key
, req
->index
, req
->name
, &req
->type
, &req
->len
, req
->data
);
1475 release_object( key
);
1479 /* delete a value of a registry key */
1480 DECL_HANDLER(delete_key_value
)
1485 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
)))
1487 if ((name
= req_strdupW( req
->name
)))
1489 delete_value( key
, name
);
1492 release_object( key
);
1496 /* load a registry branch from a file */
1497 DECL_HANDLER(load_registry
)
1501 if ((key
= get_hkey_obj( req
->hkey
, KEY_SET_VALUE
| KEY_CREATE_SUB_KEY
)))
1503 /* FIXME: use subkey name */
1504 load_registry( key
, req
->file
);
1505 release_object( key
);
1509 /* save a registry branch to a file */
1510 DECL_HANDLER(save_registry
)
1514 if ((key
= get_hkey_obj( req
->hkey
, KEY_QUERY_VALUE
| KEY_ENUMERATE_SUB_KEYS
)))
1516 save_registry( key
, req
->file
);
1517 release_object( key
);
1521 /* set the current and saving level for the registry */
1522 DECL_HANDLER(set_registry_levels
)
1524 current_level
= req
->current
;
1525 saving_level
= req
->saving
;
1526 saving_version
= req
->version
;