registry.c 70 KB
Newer Older
1 2 3 4
/*
 * Server-side registry management
 *
 * Copyright (C) 1999 Alexandre Julliard
5 6 7 8 9 10 11 12 13 14 15 16 17
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
18
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
19 20 21 22 23 24
 */

/* To do:
 * - symbolic links
 */

25 26 27
#include "config.h"
#include "wine/port.h"

28
#include <assert.h>
29
#include <ctype.h>
30 31
#include <errno.h>
#include <fcntl.h>
32 33
#include <limits.h>
#include <stdio.h>
34
#include <stdarg.h>
35
#include <string.h>
36
#include <stdlib.h>
37
#include <sys/stat.h>
38
#include <unistd.h>
39

40 41
#include "ntstatus.h"
#define WIN32_NO_STATUS
42
#include "object.h"
43
#include "file.h"
44 45
#include "handle.h"
#include "request.h"
46
#include "process.h"
47
#include "unicode.h"
48
#include "security.h"
49

50
#include "winternl.h"
51

52 53
struct notify
{
54
    struct list       entry;    /* entry in list of notifications */
55 56 57 58
    struct event     *event;    /* event to set when changing this key */
    int               subtree;  /* true if subtree notification */
    unsigned int      filter;   /* which events to notify on */
    obj_handle_t      hkey;     /* hkey associated with this notification */
59
    struct process   *process;  /* process in which the hkey is valid */
60 61
};

62 63 64 65 66 67
/* a registry key */
struct key
{
    struct object     obj;         /* object header */
    WCHAR            *name;        /* key name */
    WCHAR            *class;       /* key class */
68 69
    unsigned short    namelen;     /* length of key name */
    unsigned short    classlen;    /* length of class name */
70 71 72 73 74 75 76
    struct key       *parent;      /* parent key */
    int               last_subkey; /* last in use subkey */
    int               nb_subkeys;  /* count of allocated subkeys */
    struct key      **subkeys;     /* subkeys array */
    int               last_value;  /* last in use value */
    int               nb_values;   /* count of allocated values in array */
    struct key_value *values;      /* values array */
77
    unsigned int      flags;       /* flags */
78
    timeout_t         modif;       /* last modification time */
79
    struct list       notify_list; /* list of notifications */
80 81 82 83 84
};

/* key flags */
#define KEY_VOLATILE 0x0001  /* key is volatile (not saved to disk) */
#define KEY_DELETED  0x0002  /* key has been deleted */
85
#define KEY_DIRTY    0x0004  /* key has been modified */
86
#define KEY_SYMLINK  0x0008  /* key is a symbolic link */
87
#define KEY_WOW64    0x0010  /* key contains a Wow6432Node subkey */
88
#define KEY_WOWSHARE 0x0020  /* key is a Wow64 shared key (used for Software\Classes) */
89 90 91 92 93

/* a key value */
struct key_value
{
    WCHAR            *name;    /* value name */
94
    unsigned short    namelen; /* length of value name */
95
    unsigned int      type;    /* value type */
96
    data_size_t       len;     /* value data length in bytes */
97 98 99 100 101 102
    void             *data;    /* pointer to value data */
};

#define MIN_SUBKEYS  8   /* min. number of allocated subkeys per key */
#define MIN_VALUES   8   /* min. number of allocated values per key */

103
#define MAX_NAME_LEN  256    /* max. length of a key name */
104
#define MAX_VALUE_LEN 16383  /* max. length of a value name */
105

106
/* the root of the registry tree */
107 108
static struct key *root_key;

109
static const timeout_t ticks_1601_to_1970 = (timeout_t)86400 * (369 * 365 + 89) * TICKS_PER_SEC;
110
static const timeout_t save_period = 30 * -TICKS_PER_SEC;  /* delay between periodic saves */
111
static struct timeout_user *save_timeout_user;  /* saving timer */
112
static enum prefix_type { PREFIX_UNKNOWN, PREFIX_32BIT, PREFIX_64BIT } prefix_type;
113

114
static const WCHAR root_name[] = { '\\','R','e','g','i','s','t','r','y','\\' };
115
static const WCHAR wow6432node[] = {'W','o','w','6','4','3','2','N','o','d','e'};
116 117 118
static const WCHAR symlink_value[] = {'S','y','m','b','o','l','i','c','L','i','n','k','V','a','l','u','e'};
static const struct unicode_str symlink_str = { symlink_value, sizeof(symlink_value) };

119
static void set_periodic_save_timer(void);
120
static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index );
121

122 123 124 125
/* information about where to save a registry branch */
struct save_branch_info
{
    struct key  *key;
126
    const char  *path;
127 128
};

129
#define MAX_SAVE_BRANCH_INFO 3
130 131 132
static int save_branch_count;
static struct save_branch_info save_branch_info[MAX_SAVE_BRANCH_INFO];

133

134 135 136
/* information about a file being loaded */
struct file_load_info
{
137 138 139 140 141 142 143
    const char *filename; /* input file name */
    FILE       *file;     /* input file */
    char       *buffer;   /* line buffer */
    int         len;      /* buffer length */
    int         line;     /* current input line */
    WCHAR      *tmp;      /* temp buffer to use while parsing input */
    size_t      tmplen;   /* length of temp buffer */
144 145 146
};


147
static void key_dump( struct object *obj, int verbose );
148
static struct object_type *key_get_type( struct object *obj );
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 153 154 155
static void key_destroy( struct object *obj );

static const struct object_ops key_ops =
{
156 157
    sizeof(struct key),      /* size */
    key_dump,                /* dump */
158
    key_get_type,            /* get_type */
159 160 161 162
    no_add_queue,            /* add_queue */
    NULL,                    /* remove_queue */
    NULL,                    /* signaled */
    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 170
    no_link_name,            /* link_name */
    NULL,                    /* unlink_name */
171
    no_open_file,            /* open_file */
172
    no_kernel_obj_list,      /* get_kernel_obj_list */
173
    key_close_handle,        /* close_handle */
174
    key_destroy              /* destroy */
175 176 177
};


178 179
static inline int is_wow6432node( const WCHAR *name, unsigned int len )
{
180
    return (len == sizeof(wow6432node) && !memicmp_strW( name, wow6432node, sizeof( wow6432node )));
181 182
}

183 184 185 186 187 188 189 190 191 192
/*
 * The registry text file format v2 used by this code is similar to the one
 * used by REGEDIT import/export functionality, with the following differences:
 * - strings and key names can contain \x escapes for Unicode
 * - key names use escapes too in order to support Unicode
 * - the modification time optionally follows the key name
 * - REG_EXPAND_SZ and REG_MULTI_SZ are saved as strings instead of hex
 */

/* dump the full path of a key */
193
static void dump_path( const struct key *key, const struct key *base, FILE *f )
194
{
195
    if (key->parent && key->parent != base)
196
    {
197
        dump_path( key->parent, base, f );
198 199
        fprintf( f, "\\\\" );
    }
200
    dump_strW( key->name, key->namelen, f, "[]" );
201 202 203
}

/* dump a value to a text file */
204
static void dump_value( const struct key_value *value, FILE *f )
205
{
206
    unsigned int i, dw;
207
    int count;
208

209
    if (value->namelen)
210 211
    {
        fputc( '\"', f );
212
        count = 1 + dump_strW( value->name, value->namelen, f, "\"\"" );
213 214 215 216 217 218 219 220 221
        count += fprintf( f, "\"=" );
    }
    else count = fprintf( f, "@=" );

    switch(value->type)
    {
    case REG_SZ:
    case REG_EXPAND_SZ:
    case REG_MULTI_SZ:
222 223 224 225 226
        /* only output properly terminated strings in string format */
        if (value->len < sizeof(WCHAR)) break;
        if (value->len % sizeof(WCHAR)) break;
        if (((WCHAR *)value->data)[value->len / sizeof(WCHAR) - 1]) break;
        if (value->type != REG_SZ) fprintf( f, "str(%x):", value->type );
227
        fputc( '\"', f );
228
        dump_strW( (WCHAR *)value->data, value->len, f, "\"\"" );
229 230 231
        fprintf( f, "\"\n" );
        return;

232
    case REG_DWORD:
233 234 235 236 237 238 239 240 241 242 243 244
        if (value->len != sizeof(dw)) break;
        memcpy( &dw, value->data, sizeof(dw) );
        fprintf( f, "dword:%08x\n", dw );
        return;
    }

    if (value->type == REG_BINARY) count += fprintf( f, "hex:" );
    else count += fprintf( f, "hex(%x):", value->type );
    for (i = 0; i < value->len; i++)
    {
        count += fprintf( f, "%02x", *((unsigned char *)value->data + i) );
        if (i < value->len-1)
245
        {
246 247
            fputc( ',', f );
            if (++count > 76)
248
            {
249 250
                fprintf( f, "\\\n  " );
                count = 2;
251 252 253 254 255 256 257
            }
        }
    }
    fputc( '\n', f );
}

/* save a registry and all its subkeys to a text file */
258
static void save_subkeys( const struct key *key, const struct key *base, FILE *f )
259 260 261 262
{
    int i;

    if (key->flags & KEY_VOLATILE) return;
263
    /* save key if it has either some values or no subkeys, or needs special options */
264
    /* keys with no values but subkeys are saved implicitly by saving the subkeys */
265
    if ((key->last_value >= 0) || (key->last_subkey == -1) || key->class || (key->flags & KEY_SYMLINK))
266 267
    {
        fprintf( f, "\n[" );
268
        if (key != base) dump_path( key, base, f );
269
        fprintf( f, "] %u\n", (unsigned int)((key->modif - ticks_1601_to_1970) / TICKS_PER_SEC) );
270
        fprintf( f, "#time=%x%08x\n", (unsigned int)(key->modif >> 32), (unsigned int)key->modif );
271 272 273
        if (key->class)
        {
            fprintf( f, "#class=\"" );
274
            dump_strW( key->class, key->classlen, f, "\"\"" );
275 276
            fprintf( f, "\"\n" );
        }
277
        if (key->flags & KEY_SYMLINK) fputs( "#link\n", f );
278 279
        for (i = 0; i <= key->last_value; i++) dump_value( &key->values[i], f );
    }
280
    for (i = 0; i <= key->last_subkey; i++) save_subkeys( key->subkeys[i], base, f );
281 282
}

283
static void dump_operation( const struct key *key, const struct key_value *value, const char *op )
284 285
{
    fprintf( stderr, "%s key ", op );
286
    if (key) dump_path( key, NULL, stderr );
287 288 289 290 291 292 293 294 295 296 297 298 299 300
    else fprintf( stderr, "ERROR" );
    if (value)
    {
        fprintf( stderr, " value ");
        dump_value( value, stderr );
    }
    else fprintf( stderr, "\n" );
}

static void key_dump( struct object *obj, int verbose )
{
    struct key *key = (struct key *)obj;
    assert( obj->ops == &key_ops );
    fprintf( stderr, "Key flags=%x ", key->flags );
301
    dump_path( key, NULL, stderr );
302 303 304
    fprintf( stderr, "\n" );
}

305 306 307 308 309 310 311
static struct object_type *key_get_type( struct object *obj )
{
    static const WCHAR name[] = {'K','e','y'};
    static const struct unicode_str str = { name, sizeof(name) };
    return get_object_type( &str );
}

312 313 314
/* notify waiter and maybe delete the notification */
static void do_notification( struct key *key, struct notify *notify, int del )
{
315
    if (notify->event)
316 317 318 319 320
    {
        set_event( notify->event );
        release_object( notify->event );
        notify->event = NULL;
    }
321 322 323 324 325
    if (del)
    {
        list_remove( &notify->entry );
        free( notify );
    }
326 327
}

328
static inline struct notify *find_notify( struct key *key, struct process *process, obj_handle_t hkey )
329
{
330
    struct notify *notify;
331

332 333
    LIST_FOR_EACH_ENTRY( notify, &key->notify_list, struct notify, entry )
    {
334
        if (notify->process == process && notify->hkey == hkey) return notify;
335 336
    }
    return NULL;
337 338
}

339 340 341 342 343 344
static unsigned int key_map_access( struct object *obj, unsigned int access )
{
    if (access & GENERIC_READ)    access |= KEY_READ;
    if (access & GENERIC_WRITE)   access |= KEY_WRITE;
    if (access & GENERIC_EXECUTE) access |= KEY_EXECUTE;
    if (access & GENERIC_ALL)     access |= KEY_ALL_ACCESS;
345 346 347
    /* filter the WOW64 masks, as they aren't real access bits */
    return access & ~(GENERIC_READ | GENERIC_WRITE | GENERIC_EXECUTE | GENERIC_ALL |
                      KEY_WOW64_64KEY | KEY_WOW64_32KEY);
348 349
}

350 351 352 353 354 355 356 357
static struct security_descriptor *key_get_sd( struct object *obj )
{
    static struct security_descriptor *key_default_sd;

    if (obj->sd) return obj->sd;

    if (!key_default_sd)
    {
358 359
        size_t users_sid_len = security_sid_len( security_builtin_users_sid );
        size_t admins_sid_len = security_sid_len( security_builtin_admins_sid );
360 361
        size_t dacl_len = sizeof(ACL) + 2 * offsetof( ACCESS_ALLOWED_ACE, SidStart )
                          + users_sid_len + admins_sid_len;
362 363 364 365 366 367 368
        ACCESS_ALLOWED_ACE *aaa;
        ACL *dacl;

        key_default_sd = mem_alloc( sizeof(*key_default_sd) + 2 * admins_sid_len + dacl_len );
        key_default_sd->control   = SE_DACL_PRESENT;
        key_default_sd->owner_len = admins_sid_len;
        key_default_sd->group_len = admins_sid_len;
369
        key_default_sd->sacl_len  = 0;
370 371 372 373 374 375 376 377
        key_default_sd->dacl_len  = dacl_len;
        memcpy( key_default_sd + 1, security_builtin_admins_sid, admins_sid_len );
        memcpy( (char *)(key_default_sd + 1) + admins_sid_len, security_builtin_admins_sid, admins_sid_len );

        dacl = (ACL *)((char *)(key_default_sd + 1) + 2 * admins_sid_len);
        dacl->AclRevision = ACL_REVISION;
        dacl->Sbz1 = 0;
        dacl->AclSize = dacl_len;
378
        dacl->AceCount = 2;
379 380 381 382 383 384 385
        dacl->Sbz2 = 0;
        aaa = (ACCESS_ALLOWED_ACE *)(dacl + 1);
        aaa->Header.AceType = ACCESS_ALLOWED_ACE_TYPE;
        aaa->Header.AceFlags = INHERIT_ONLY_ACE | CONTAINER_INHERIT_ACE;
        aaa->Header.AceSize = offsetof( ACCESS_ALLOWED_ACE, SidStart ) + users_sid_len;
        aaa->Mask = GENERIC_READ;
        memcpy( &aaa->SidStart, security_builtin_users_sid, users_sid_len );
386 387 388 389 390 391
        aaa = (ACCESS_ALLOWED_ACE *)((char *)aaa + aaa->Header.AceSize);
        aaa->Header.AceType = ACCESS_ALLOWED_ACE_TYPE;
        aaa->Header.AceFlags = 0;
        aaa->Header.AceSize = offsetof( ACCESS_ALLOWED_ACE, SidStart ) + admins_sid_len;
        aaa->Mask = KEY_ALL_ACCESS;
        memcpy( &aaa->SidStart, security_builtin_admins_sid, admins_sid_len );
392 393 394 395
    }
    return key_default_sd;
}

396
/* close the notification associated with a handle */
397
static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle )
398 399
{
    struct key * key = (struct key *) obj;
400
    struct notify *notify = find_notify( key, process, handle );
401 402
    if (notify) do_notification( key, notify, 1 );
    return 1;  /* ok to close */
403 404
}

405 406 407
static void key_destroy( struct object *obj )
{
    int i;
408
    struct list *ptr;
409 410 411
    struct key *key = (struct key *)obj;
    assert( obj->ops == &key_ops );

412 413
    free( key->name );
    free( key->class );
414 415
    for (i = 0; i <= key->last_value; i++)
    {
416 417
        free( key->values[i].name );
        free( key->values[i].data );
418
    }
419
    free( key->values );
420 421 422 423 424
    for (i = 0; i <= key->last_subkey; i++)
    {
        key->subkeys[i]->parent = NULL;
        release_object( key->subkeys[i] );
    }
425
    free( key->subkeys );
426
    /* unconditionally notify everything waiting on this key */
427 428 429 430 431
    while ((ptr = list_head( &key->notify_list )))
    {
        struct notify *notify = LIST_ENTRY( ptr, struct notify, entry );
        do_notification( key, notify, 1 );
    }
432 433
}

434
/* get the request vararg as registry path */
435
static inline void get_req_path( struct unicode_str *str, int skip_root )
436
{
437 438
    str->str = get_req_data();
    str->len = (get_req_data_size() / sizeof(WCHAR)) * sizeof(WCHAR);
439

440
    if (skip_root && str->len >= sizeof(root_name) && !memicmp_strW( str->str, root_name, sizeof(root_name) ))
441
    {
442
        str->str += ARRAY_SIZE( root_name );
443
        str->len -= sizeof(root_name);
444 445 446
    }
}

447
/* return the next token in a given path */
448 449
/* token->str must point inside the path, or be NULL for the first call */
static struct unicode_str *get_path_token( const struct unicode_str *path, struct unicode_str *token )
450
{
451
    data_size_t i = 0, len = path->len / sizeof(WCHAR);
452

453
    if (!token->str)  /* first time */
454
    {
455
        /* path cannot start with a backslash */
456
        if (len && path->str[0] == '\\')
457 458 459 460
        {
            set_error( STATUS_OBJECT_PATH_INVALID );
            return NULL;
        }
461
    }
462
    else
463
    {
464 465 466
        i = token->str - path->str;
        i += token->len / sizeof(WCHAR);
        while (i < len && path->str[i] == '\\') i++;
467
    }
468 469 470 471
    token->str = path->str + i;
    while (i < len && path->str[i] != '\\') i++;
    token->len = (path->str + i - token->str) * sizeof(WCHAR);
    return token;
472 473 474
}

/* allocate a key object */
475
static struct key *alloc_key( const struct unicode_str *name, timeout_t modif )
476 477
{
    struct key *key;
478
    if ((key = alloc_object( &key_ops )))
479
    {
480
        key->name        = NULL;
481
        key->class       = NULL;
482 483
        key->namelen     = name->len;
        key->classlen    = 0;
484 485 486 487 488 489 490 491 492
        key->flags       = 0;
        key->last_subkey = -1;
        key->nb_subkeys  = 0;
        key->subkeys     = NULL;
        key->nb_values   = 0;
        key->last_value  = -1;
        key->values      = NULL;
        key->modif       = modif;
        key->parent      = NULL;
493
        list_init( &key->notify_list );
494
        if (name->len && !(key->name = memdup( name->str, name->len )))
495 496 497 498 499 500 501 502
        {
            release_object( key );
            key = NULL;
        }
    }
    return key;
}

503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524
/* mark a key and all its parents as dirty (modified) */
static void make_dirty( struct key *key )
{
    while (key)
    {
        if (key->flags & (KEY_DIRTY|KEY_VOLATILE)) return;  /* nothing to do */
        key->flags |= KEY_DIRTY;
        key = key->parent;
    }
}

/* mark a key and all its subkeys as clean (not modified) */
static void make_clean( struct key *key )
{
    int i;

    if (key->flags & KEY_VOLATILE) return;
    if (!(key->flags & KEY_DIRTY)) return;
    key->flags &= ~KEY_DIRTY;
    for (i = 0; i <= key->last_subkey; i++) make_clean( key->subkeys[i] );
}

525
/* go through all the notifications and send them if necessary */
526
static void check_notify( struct key *key, unsigned int change, int not_subtree )
527
{
528 529 530
    struct list *ptr, *next;

    LIST_FOR_EACH_SAFE( ptr, next, &key->notify_list )
531
    {
532
        struct notify *n = LIST_ENTRY( ptr, struct notify, entry );
533 534 535 536 537
        if ( ( not_subtree || n->subtree ) && ( change & n->filter ) )
            do_notification( key, n, 0 );
    }
}

538
/* update key modification time */
539
static void touch_key( struct key *key, unsigned int change )
540
{
541 542
    struct key *k;

543
    key->modif = current_time;
544
    make_dirty( key );
545 546 547 548

    /* do notifications */
    check_notify( key, change, 1 );
    for ( k = key->parent; k; k = k->parent )
549
        check_notify( k, change, 0 );
550 551 552 553 554 555 556 557 558 559 560 561 562
}

/* try to grow the array of subkeys; return 1 if OK, 0 on error */
static int grow_subkeys( struct key *key )
{
    struct key **new_subkeys;
    int nb_subkeys;

    if (key->nb_subkeys)
    {
        nb_subkeys = key->nb_subkeys + (key->nb_subkeys / 2);  /* grow by 50% */
        if (!(new_subkeys = realloc( key->subkeys, nb_subkeys * sizeof(*new_subkeys) )))
        {
563
            set_error( STATUS_NO_MEMORY );
564 565 566 567 568
            return 0;
        }
    }
    else
    {
569
        nb_subkeys = MIN_SUBKEYS;
570 571 572 573 574 575 576 577
        if (!(new_subkeys = mem_alloc( nb_subkeys * sizeof(*new_subkeys) ))) return 0;
    }
    key->subkeys    = new_subkeys;
    key->nb_subkeys = nb_subkeys;
    return 1;
}

/* allocate a subkey for a given key, and return its index */
578
static struct key *alloc_subkey( struct key *parent, const struct unicode_str *name,
579
                                 int index, timeout_t modif )
580 581 582 583
{
    struct key *key;
    int i;

584 585
    if (name->len > MAX_NAME_LEN * sizeof(WCHAR))
    {
586
        set_error( STATUS_INVALID_PARAMETER );
587 588
        return NULL;
    }
589 590 591 592 593 594 595 596 597 598 599
    if (parent->last_subkey + 1 == parent->nb_subkeys)
    {
        /* need to grow the array */
        if (!grow_subkeys( parent )) return NULL;
    }
    if ((key = alloc_key( name, modif )) != NULL)
    {
        key->parent = parent;
        for (i = ++parent->last_subkey; i > index; i--)
            parent->subkeys[i] = parent->subkeys[i-1];
        parent->subkeys[index] = key;
600 601
        if (is_wow6432node( key->name, key->namelen ) && !is_wow6432node( parent->name, parent->namelen ))
            parent->flags |= KEY_WOW64;
602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619
    }
    return key;
}

/* free a subkey of a given key */
static void free_subkey( struct key *parent, int index )
{
    struct key *key;
    int i, nb_subkeys;

    assert( index >= 0 );
    assert( index <= parent->last_subkey );

    key = parent->subkeys[index];
    for (i = index; i < parent->last_subkey; i++) parent->subkeys[i] = parent->subkeys[i + 1];
    parent->last_subkey--;
    key->flags |= KEY_DELETED;
    key->parent = NULL;
620
    if (is_wow6432node( key->name, key->namelen )) parent->flags &= ~KEY_WOW64;
621
    release_object( key );
622

623
    /* try to shrink the array */
624 625
    nb_subkeys = parent->nb_subkeys;
    if (nb_subkeys > MIN_SUBKEYS && parent->last_subkey < nb_subkeys / 2)
626 627 628 629
    {
        struct key **new_subkeys;
        nb_subkeys -= nb_subkeys / 3;  /* shrink by 33% */
        if (nb_subkeys < MIN_SUBKEYS) nb_subkeys = MIN_SUBKEYS;
630 631 632
        if (!(new_subkeys = realloc( parent->subkeys, nb_subkeys * sizeof(*new_subkeys) ))) return;
        parent->subkeys = new_subkeys;
        parent->nb_subkeys = nb_subkeys;
633 634 635 636
    }
}

/* find the named child of a given key and return its index */
637
static struct key *find_subkey( const struct key *key, const struct unicode_str *name, int *index )
638 639
{
    int i, min, max, res;
640
    data_size_t len;
641 642 643 644 645 646

    min = 0;
    max = key->last_subkey;
    while (min <= max)
    {
        i = (min + max) / 2;
647
        len = min( key->subkeys[i]->namelen, name->len );
648
        res = memicmp_strW( key->subkeys[i]->name, name->str, len );
649 650
        if (!res) res = key->subkeys[i]->namelen - name->len;
        if (!res)
651 652 653 654 655 656 657 658 659 660 661
        {
            *index = i;
            return key->subkeys[i];
        }
        if (res > 0) max = i - 1;
        else min = i + 1;
    }
    *index = min;  /* this is where we should insert it */
    return NULL;
}

662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677
/* return the wow64 variant of the key, or the key itself if none */
static struct key *find_wow64_subkey( struct key *key, const struct unicode_str *name )
{
    static const struct unicode_str wow6432node_str = { wow6432node, sizeof(wow6432node) };
    int index;

    if (!(key->flags & KEY_WOW64)) return key;
    if (!is_wow6432node( name->str, name->len ))
    {
        key = find_subkey( key, &wow6432node_str, &index );
        assert( key );  /* if KEY_WOW64 is set we must find it */
    }
    return key;
}


678 679 680 681 682 683 684 685 686 687 688 689 690 691
/* follow a symlink and return the resolved key */
static struct key *follow_symlink( struct key *key, int iteration )
{
    struct unicode_str path, token;
    struct key_value *value;
    int index;

    if (iteration > 16) return NULL;
    if (!(key->flags & KEY_SYMLINK)) return key;
    if (!(value = find_value( key, &symlink_str, &index ))) return NULL;

    path.str = value->data;
    path.len = (value->len / sizeof(WCHAR)) * sizeof(WCHAR);
    if (path.len <= sizeof(root_name)) return NULL;
692
    if (memicmp_strW( path.str, root_name, sizeof(root_name) )) return NULL;
693
    path.str += ARRAY_SIZE( root_name );
694 695 696 697 698 699 700 701 702 703 704 705 706 707
    path.len -= sizeof(root_name);

    key = root_key;
    token.str = NULL;
    if (!get_path_token( &path, &token )) return NULL;
    while (token.len)
    {
        if (!(key = find_subkey( key, &token, &index ))) break;
        if (!(key = follow_symlink( key, iteration + 1 ))) break;
        get_path_token( &path, &token );
    }
    return key;
}

708 709 710 711
/* open a key until we find an element that doesn't exist */
/* helper for open_key and create_key */
static struct key *open_key_prefix( struct key *key, const struct unicode_str *name,
                                    unsigned int access, struct unicode_str *token, int *index )
712
{
713 714 715 716
    token->str = NULL;
    if (!get_path_token( name, token )) return NULL;
    if (access & KEY_WOW64_32KEY) key = find_wow64_subkey( key, token );
    while (token->len)
717
    {
718
        struct key *subkey;
719 720 721 722 723 724 725 726 727 728
        if (!(subkey = find_subkey( key, token, index )))
        {
            if ((key->flags & KEY_WOWSHARE) && !(access & KEY_WOW64_64KEY))
            {
                /* try in the 64-bit parent */
                key = key->parent;
                subkey = find_subkey( key, token, index );
            }
        }
        if (!subkey) break;
729 730 731 732
        key = subkey;
        get_path_token( name, token );
        if (!token->len) break;
        if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, token );
733 734 735 736 737
        if (!(key = follow_symlink( key, 0 )))
        {
            set_error( STATUS_OBJECT_NAME_NOT_FOUND );
            return NULL;
        }
738
    }
739 740
    return key;
}
741

742 743 744 745 746 747 748 749 750 751 752 753 754 755
/* open a subkey */
static struct key *open_key( struct key *key, const struct unicode_str *name, unsigned int access,
                             unsigned int attributes )
{
    int index;
    struct unicode_str token;

    if (!(key = open_key_prefix( key, name, access, &token, &index ))) return NULL;

    if (token.len)
    {
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
        return NULL;
    }
756
    if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
757 758 759 760 761
    if (!(attributes & OBJ_OPENLINK) && !(key = follow_symlink( key, 0 )))
    {
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
        return NULL;
    }
762
    if (debug_level > 1) dump_operation( key, NULL, "Open" );
763
    grab_object( key );
764 765 766 767
    return key;
}

/* create a subkey */
768
static struct key *create_key( struct key *key, const struct unicode_str *name,
769
                               const struct unicode_str *class, unsigned int options,
770 771
                               unsigned int access, unsigned int attributes,
                               const struct security_descriptor *sd, int *created )
772
{
773
    int index;
774
    struct unicode_str token, next;
775 776

    *created = 0;
777
    if (!(key = open_key_prefix( key, name, access, &token, &index ))) return NULL;
778

779
    if (!token.len)  /* the key already exists */
780
    {
781
        if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
782 783 784 785 786 787 788 789 790 791
        if (options & REG_OPTION_CREATE_LINK)
        {
            set_error( STATUS_OBJECT_NAME_COLLISION );
            return NULL;
        }
        if (!(attributes & OBJ_OPENLINK) && !(key = follow_symlink( key, 0 )))
        {
            set_error( STATUS_OBJECT_NAME_NOT_FOUND );
            return NULL;
        }
792 793 794 795 796 797 798 799 800 801 802 803
        if (debug_level > 1) dump_operation( key, NULL, "Open" );
        grab_object( key );
        return key;
    }

    /* token must be the last path component at this point */
    next = token;
    get_path_token( name, &next );
    if (next.len)
    {
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
        return NULL;
804
    }
805

806
    if ((key->flags & KEY_VOLATILE) && !(options & REG_OPTION_VOLATILE))
807 808 809 810
    {
        set_error( STATUS_CHILD_MUST_BE_VOLATILE );
        return NULL;
    }
811
    *created = 1;
812 813
    make_dirty( key );
    if (!(key = alloc_subkey( key, &token, index, current_time ))) return NULL;
814

815
    if (options & REG_OPTION_CREATE_LINK) key->flags |= KEY_SYMLINK;
816 817
    if (options & REG_OPTION_VOLATILE) key->flags |= KEY_VOLATILE;
    else key->flags |= KEY_DIRTY;
818

819 820 821
    if (sd) default_set_sd( &key->obj, sd, OWNER_SECURITY_INFORMATION | GROUP_SECURITY_INFORMATION |
                            DACL_SECURITY_INFORMATION | SACL_SECURITY_INFORMATION );

822
    if (debug_level > 1) dump_operation( key, NULL, "Create" );
823 824 825
    if (class && class->len)
    {
        key->classlen = class->len;
826
        free(key->class);
827 828
        if (!(key->class = memdup( class->str, key->classlen ))) key->classlen = 0;
    }
829
    touch_key( key->parent, REG_NOTIFY_CHANGE_NAME );
830 831 832 833
    grab_object( key );
    return key;
}

834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876
/* recursively create a subkey (for internal use only) */
static struct key *create_key_recursive( struct key *key, const struct unicode_str *name, timeout_t modif )
{
    struct key *base;
    int index;
    struct unicode_str token;

    token.str = NULL;
    if (!get_path_token( name, &token )) return NULL;
    while (token.len)
    {
        struct key *subkey;
        if (!(subkey = find_subkey( key, &token, &index ))) break;
        key = subkey;
        if (!(key = follow_symlink( key, 0 )))
        {
            set_error( STATUS_OBJECT_NAME_NOT_FOUND );
            return NULL;
        }
        get_path_token( name, &token );
    }

    if (token.len)
    {
        if (!(key = alloc_subkey( key, &token, index, modif ))) return NULL;
        base = key;
        for (;;)
        {
            get_path_token( name, &token );
            if (!token.len) break;
            /* we know the index is always 0 in a new key */
            if (!(key = alloc_subkey( key, &token, 0, modif )))
            {
                free_subkey( base, index );
                return NULL;
            }
        }
    }

    grab_object( key );
    return key;
}

877
/* query information about a key or a subkey */
878 879
static void enum_key( const struct key *key, int index, int info_class,
                      struct enum_key_reply *reply )
880
{
881
    static const WCHAR backslash[] = { '\\' };
882
    int i;
883
    data_size_t len, namelen, classlen;
884 885
    data_size_t max_subkey = 0, max_class = 0;
    data_size_t max_value = 0, max_data = 0;
886
    const struct key *k;
887
    char *data;
888

889 890 891 892 893
    if (index != -1)  /* -1 means use the specified key directly */
    {
        if ((index < 0) || (index > key->last_subkey))
        {
            set_error( STATUS_NO_MORE_ENTRIES );
894
            return;
895 896 897 898
        }
        key = key->subkeys[index];
    }

899 900
    namelen = key->namelen;
    classlen = key->classlen;
901 902

    switch(info_class)
903
    {
904
    case KeyNameInformation:
905 906 907 908 909 910 911
        namelen = 0;
        for (k = key; k != root_key; k = k->parent)
            namelen += k->namelen + sizeof(backslash);
        if (!namelen) return;
        namelen += sizeof(root_name) - sizeof(backslash);
        /* fall through */
    case KeyBasicInformation:
912 913 914 915 916 917 918 919 920
        classlen = 0; /* only return the name */
        /* fall through */
    case KeyNodeInformation:
        reply->max_subkey = 0;
        reply->max_class  = 0;
        reply->max_value  = 0;
        reply->max_data   = 0;
        break;
    case KeyFullInformation:
921
    case KeyCachedInformation:
922 923
        for (i = 0; i <= key->last_subkey; i++)
        {
924 925
            if (key->subkeys[i]->namelen > max_subkey) max_subkey = key->subkeys[i]->namelen;
            if (key->subkeys[i]->classlen > max_class) max_class = key->subkeys[i]->classlen;
926 927 928
        }
        for (i = 0; i <= key->last_value; i++)
        {
929 930
            if (key->values[i].namelen > max_value) max_value = key->values[i].namelen;
            if (key->values[i].len > max_data) max_data = key->values[i].len;
931
        }
932 933 934 935
        reply->max_subkey = max_subkey;
        reply->max_class  = max_class;
        reply->max_value  = max_value;
        reply->max_data   = max_data;
936 937 938 939
        reply->namelen    = namelen;
        if (info_class == KeyCachedInformation)
            classlen = 0; /* don't return any data, only its size */
        namelen = 0;  /* don't return name */
940 941 942 943
        break;
    default:
        set_error( STATUS_INVALID_PARAMETER );
        return;
944
    }
945 946 947 948
    reply->subkeys = key->last_subkey + 1;
    reply->values  = key->last_value + 1;
    reply->modif   = key->modif;
    reply->total   = namelen + classlen;
949

950 951
    len = min( reply->total, get_reply_max_size() );
    if (len && (data = set_reply_data_size( len )))
952
    {
953 954 955 956
        if (len > namelen)
        {
            reply->namelen = namelen;
            memcpy( data, key->name, namelen );
957
            memcpy( data + namelen, key->class, len - namelen );
958
        }
959 960 961 962 963 964 965
        else if (info_class == KeyNameInformation)
        {
            data_size_t pos = namelen;
            reply->namelen = namelen;
            for (k = key; k != root_key; k = k->parent)
            {
                pos -= k->namelen;
966
                if (pos < len) memcpy( data + pos, k->name,
967 968
                                       min( k->namelen, len - pos ) );
                pos -= sizeof(backslash);
969
                if (pos < len) memcpy( data + pos, backslash,
970 971 972 973
                                       min( sizeof(backslash), len - pos ) );
            }
            memcpy( data, root_name, min( sizeof(root_name) - sizeof(backslash), len ) );
        }
974 975 976 977 978
        else
        {
            reply->namelen = len;
            memcpy( data, key->name, len );
        }
979 980
    }
    if (debug_level > 1) dump_operation( key, NULL, "Enum" );
981 982 983
}

/* delete a key and its values */
984
static int delete_key( struct key *key, int recurse )
985 986
{
    int index;
987
    struct key *parent = key->parent;
988

989
    /* must find parent and index */
990
    if (key == root_key)
991
    {
992
        set_error( STATUS_ACCESS_DENIED );
993
        return -1;
994
    }
995
    assert( parent );
996 997

    while (recurse && (key->last_subkey>=0))
998
        if (0 > delete_key(key->subkeys[key->last_subkey], 1))
999 1000
            return -1;

1001 1002 1003
    for (index = 0; index <= parent->last_subkey; index++)
        if (parent->subkeys[index] == key) break;
    assert( index <= parent->last_subkey );
1004

1005 1006
    /* we can only delete a key that has no subkeys */
    if (key->last_subkey >= 0)
1007
    {
1008
        set_error( STATUS_ACCESS_DENIED );
1009
        return -1;
1010
    }
1011

1012 1013
    if (debug_level > 1) dump_operation( key, NULL, "Delete" );
    free_subkey( parent, index );
1014
    touch_key( parent, REG_NOTIFY_CHANGE_NAME );
1015
    return 0;
1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028
}

/* try to grow the array of values; return 1 if OK, 0 on error */
static int grow_values( struct key *key )
{
    struct key_value *new_val;
    int nb_values;

    if (key->nb_values)
    {
        nb_values = key->nb_values + (key->nb_values / 2);  /* grow by 50% */
        if (!(new_val = realloc( key->values, nb_values * sizeof(*new_val) )))
        {
1029
            set_error( STATUS_NO_MEMORY );
1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043
            return 0;
        }
    }
    else
    {
        nb_values = MIN_VALUES;
        if (!(new_val = mem_alloc( nb_values * sizeof(*new_val) ))) return 0;
    }
    key->values = new_val;
    key->nb_values = nb_values;
    return 1;
}

/* find the named value of a given key and return its index in the array */
1044
static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index )
1045 1046
{
    int i, min, max, res;
1047
    data_size_t len;
1048 1049 1050 1051 1052 1053

    min = 0;
    max = key->last_value;
    while (min <= max)
    {
        i = (min + max) / 2;
1054
        len = min( key->values[i].namelen, name->len );
1055
        res = memicmp_strW( key->values[i].name, name->str, len );
1056 1057
        if (!res) res = key->values[i].namelen - name->len;
        if (!res)
1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068
        {
            *index = i;
            return &key->values[i];
        }
        if (res > 0) max = i - 1;
        else min = i + 1;
    }
    *index = min;  /* this is where we should insert it */
    return NULL;
}

1069
/* insert a new value; the index must have been returned by find_value */
1070
static struct key_value *insert_value( struct key *key, const struct unicode_str *name, int index )
1071 1072
{
    struct key_value *value;
1073
    WCHAR *new_name = NULL;
1074
    int i;
1075

1076 1077 1078 1079 1080
    if (name->len > MAX_VALUE_LEN * sizeof(WCHAR))
    {
        set_error( STATUS_NAME_TOO_LONG );
        return NULL;
    }
1081
    if (key->last_value + 1 == key->nb_values)
1082
    {
1083
        if (!grow_values( key )) return NULL;
1084
    }
1085
    if (name->len && !(new_name = memdup( name->str, name->len ))) return NULL;
1086 1087
    for (i = ++key->last_value; i > index; i--) key->values[i] = key->values[i - 1];
    value = &key->values[index];
1088 1089 1090 1091
    value->name    = new_name;
    value->namelen = name->len;
    value->len     = 0;
    value->data    = NULL;
1092 1093 1094 1095
    return value;
}

/* set a key value */
1096
static void set_value( struct key *key, const struct unicode_str *name,
1097
                       int type, const void *data, data_size_t len )
1098 1099 1100
{
    struct key_value *value;
    void *ptr = NULL;
1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112
    int index;

    if ((value = find_value( key, name, &index )))
    {
        /* check if the new value is identical to the existing one */
        if (value->type == type && value->len == len &&
            value->data && !memcmp( value->data, data, len ))
        {
            if (debug_level > 1) dump_operation( key, value, "Skip setting" );
            return;
        }
    }
1113

1114 1115 1116
    if (key->flags & KEY_SYMLINK)
    {
        if (type != REG_LINK || name->len != symlink_str.len ||
1117
            memicmp_strW( name->str, symlink_str.str, name->len ))
1118 1119 1120 1121 1122 1123
        {
            set_error( STATUS_ACCESS_DENIED );
            return;
        }
    }

1124
    if (len && !(ptr = memdup( data, len ))) return;
1125

1126
    if (!value)
1127
    {
1128 1129
        if (!(value = insert_value( key, name, index )))
        {
1130
            free( ptr );
1131 1132
            return;
        }
1133
    }
1134
    else free( value->data ); /* already existing, free previous data */
1135

1136
    value->type  = type;
1137
    value->len   = len;
1138
    value->data  = ptr;
1139
    touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1140 1141 1142 1143
    if (debug_level > 1) dump_operation( key, value, "Set" );
}

/* get a key value */
1144
static void get_value( struct key *key, const struct unicode_str *name, int *type, data_size_t *len )
1145 1146 1147 1148 1149 1150 1151 1152
{
    struct key_value *value;
    int index;

    if ((value = find_value( key, name, &index )))
    {
        *type = value->type;
        *len  = value->len;
1153
        if (value->data) set_reply_data( value->data, min( value->len, get_reply_max_size() ));
1154 1155 1156 1157 1158
        if (debug_level > 1) dump_operation( key, value, "Get" );
    }
    else
    {
        *type = -1;
1159
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1160 1161 1162 1163
    }
}

/* enumerate a key value */
1164
static void enum_value( struct key *key, int i, int info_class, struct enum_key_value_reply *reply )
1165 1166 1167
{
    struct key_value *value;

1168
    if (i < 0 || i > key->last_value) set_error( STATUS_NO_MORE_ENTRIES );
1169 1170
    else
    {
1171
        void *data;
1172
        data_size_t namelen, maxlen;
1173

1174
        value = &key->values[i];
1175
        reply->type = value->type;
1176
        namelen = value->namelen;
1177

1178
        switch(info_class)
1179
        {
1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
        case KeyValueBasicInformation:
            reply->total = namelen;
            break;
        case KeyValueFullInformation:
            reply->total = namelen + value->len;
            break;
        case KeyValuePartialInformation:
            reply->total = value->len;
            namelen = 0;
            break;
        default:
            set_error( STATUS_INVALID_PARAMETER );
            return;
        }

        maxlen = min( reply->total, get_reply_max_size() );
        if (maxlen && ((data = set_reply_data_size( maxlen ))))
        {
            if (maxlen > namelen)
1199
            {
1200 1201 1202
                reply->namelen = namelen;
                memcpy( data, value->name, namelen );
                memcpy( (char *)data + namelen, value->data, maxlen - namelen );
1203
            }
1204
            else
1205
            {
1206 1207
                reply->namelen = maxlen;
                memcpy( data, value->name, maxlen );
1208
            }
1209
        }
1210 1211 1212 1213 1214
        if (debug_level > 1) dump_operation( key, value, "Enum" );
    }
}

/* delete a value */
1215
static void delete_value( struct key *key, const struct unicode_str *name )
1216 1217 1218 1219 1220 1221
{
    struct key_value *value;
    int i, index, nb_values;

    if (!(value = find_value( key, name, &index )))
    {
1222
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1223 1224 1225
        return;
    }
    if (debug_level > 1) dump_operation( key, value, "Delete" );
1226 1227
    free( value->name );
    free( value->data );
1228 1229
    for (i = index; i < key->last_value; i++) key->values[i] = key->values[i + 1];
    key->last_value--;
1230
    touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242

    /* try to shrink the array */
    nb_values = key->nb_values;
    if (nb_values > MIN_VALUES && key->last_value < nb_values / 2)
    {
        struct key_value *new_val;
        nb_values -= nb_values / 3;  /* shrink by 33% */
        if (nb_values < MIN_VALUES) nb_values = MIN_VALUES;
        if (!(new_val = realloc( key->values, nb_values * sizeof(*new_val) ))) return;
        key->values = new_val;
        key->nb_values = nb_values;
    }
1243
}
1244 1245

/* get the registry key corresponding to an hkey handle */
1246
static struct key *get_hkey_obj( obj_handle_t hkey, unsigned int access )
1247
{
1248 1249 1250 1251 1252 1253 1254 1255 1256
    struct key *key = (struct key *)get_handle_obj( current->process, hkey, access, &key_ops );

    if (key && key->flags & KEY_DELETED)
    {
        set_error( STATUS_KEY_DELETED );
        release_object( key );
        key = NULL;
    }
    return key;
1257 1258
}

1259 1260 1261 1262
/* get the registry key corresponding to a parent key handle */
static inline struct key *get_parent_hkey_obj( obj_handle_t hkey )
{
    if (!hkey) return (struct key *)grab_object( root_key );
1263
    return get_hkey_obj( hkey, 0 );
1264 1265
}

1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290
/* read a line from the input file */
static int read_next_line( struct file_load_info *info )
{
    char *newbuf;
    int newlen, pos = 0;

    info->line++;
    for (;;)
    {
        if (!fgets( info->buffer + pos, info->len - pos, info->file ))
            return (pos != 0);  /* EOF */
        pos = strlen(info->buffer);
        if (info->buffer[pos-1] == '\n')
        {
            /* got a full line */
            info->buffer[--pos] = 0;
            if (pos > 0 && info->buffer[pos-1] == '\r') info->buffer[pos-1] = 0;
            return 1;
        }
        if (pos < info->len - 1) return 1;  /* EOF but something was read */

        /* need to enlarge the buffer */
        newlen = info->len + info->len / 2;
        if (!(newbuf = realloc( info->buffer, newlen )))
        {
1291
            set_error( STATUS_NO_MEMORY );
1292 1293 1294 1295 1296 1297 1298 1299
            return -1;
        }
        info->buffer = newbuf;
        info->len = newlen;
    }
}

/* make sure the temp buffer holds enough space */
1300
static int get_file_tmp_space( struct file_load_info *info, size_t size )
1301
{
1302
    WCHAR *tmp;
1303 1304 1305
    if (info->tmplen >= size) return 1;
    if (!(tmp = realloc( info->tmp, size )))
    {
1306
        set_error( STATUS_NO_MEMORY );
1307 1308 1309 1310 1311 1312 1313 1314 1315 1316
        return 0;
    }
    info->tmp = tmp;
    info->tmplen = size;
    return 1;
}

/* report an error while loading an input file */
static void file_read_error( const char *err, struct file_load_info *info )
{
1317 1318 1319 1320
    if (info->filename)
        fprintf( stderr, "%s:%d: %s '%s'\n", info->filename, info->line, err, info->buffer );
    else
        fprintf( stderr, "<fd>:%d: %s '%s'\n", info->line, err, info->buffer );
1321 1322 1323 1324 1325 1326 1327
}

/* convert a data type tag to a value type */
static int get_data_type( const char *buffer, int *type, int *parse_type )
{
    struct data_type { const char *tag; int len; int type; int parse_type; };

1328
    static const struct data_type data_types[] =
1329 1330 1331 1332 1333 1334 1335 1336
    {                   /* actual type */  /* type to assume for parsing */
        { "\"",        1,   REG_SZ,              REG_SZ },
        { "str:\"",    5,   REG_SZ,              REG_SZ },
        { "str(2):\"", 8,   REG_EXPAND_SZ,       REG_SZ },
        { "str(7):\"", 8,   REG_MULTI_SZ,        REG_SZ },
        { "hex:",      4,   REG_BINARY,          REG_BINARY },
        { "dword:",    6,   REG_DWORD,           REG_DWORD },
        { "hex(",      4,   -1,                  REG_BINARY },
1337
        { NULL,        0,    0,                  0 }
1338 1339 1340 1341 1342 1343 1344
    };

    const struct data_type *ptr;
    char *end;

    for (ptr = data_types; ptr->tag; ptr++)
    {
1345
        if (strncmp( ptr->tag, buffer, ptr->len )) continue;
1346 1347 1348 1349
        *parse_type = ptr->parse_type;
        if ((*type = ptr->type) != -1) return ptr->len;
        /* "hex(xx):" is special */
        *type = (int)strtoul( buffer + 4, &end, 16 );
1350
        if ((end <= buffer) || strncmp( end, "):", 2 )) return 0;
1351 1352 1353 1354 1355 1356
        return end + 2 - buffer;
    }
    return 0;
}

/* load and create a key from the input file */
1357 1358
static struct key *load_key( struct key *base, const char *buffer, int prefix_len,
                             struct file_load_info *info, timeout_t *modif )
1359
{
1360 1361
    WCHAR *p;
    struct unicode_str name;
1362 1363
    int res;
    unsigned int mod;
1364
    data_size_t len;
1365

1366
    if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1367

1368
    len = info->tmplen;
1369
    if ((res = parse_strW( info->tmp, &len, buffer, ']' )) == -1)
1370 1371 1372 1373
    {
        file_read_error( "Malformed key", info );
        return NULL;
    }
1374
    if (sscanf( buffer + res, " %u", &mod ) == 1)
1375 1376 1377
        *modif = (timeout_t)mod * TICKS_PER_SEC + ticks_1601_to_1970;
    else
        *modif = current_time;
1378

1379
    p = info->tmp;
1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391
    while (prefix_len && *p) { if (*p++ == '\\') prefix_len--; }

    if (!*p)
    {
        if (prefix_len > 1)
        {
            file_read_error( "Malformed key", info );
            return NULL;
        }
        /* empty key name, return base key */
        return (struct key *)grab_object( base );
    }
1392 1393
    name.str = p;
    name.len = len - (p - info->tmp + 1) * sizeof(WCHAR);
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
    return create_key_recursive( base, &name, 0 );
}

/* update the modification time of a key (and its parents) after it has been loaded from a file */
static void update_key_time( struct key *key, timeout_t modif )
{
    while (key && !key->modif)
    {
        key->modif = modif;
        key = key->parent;
    }
1405 1406
}

1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435
/* load a global option from the input file */
static int load_global_option( const char *buffer, struct file_load_info *info )
{
    const char *p;

    if (!strncmp( buffer, "#arch=", 6 ))
    {
        enum prefix_type type;
        p = buffer + 6;
        if (!strcmp( p, "win32" )) type = PREFIX_32BIT;
        else if (!strcmp( p, "win64" )) type = PREFIX_64BIT;
        else
        {
            file_read_error( "Unknown architecture", info );
            set_error( STATUS_NOT_REGISTRY_FILE );
            return 0;
        }
        if (prefix_type == PREFIX_UNKNOWN) prefix_type = type;
        else if (type != prefix_type)
        {
            file_read_error( "Mismatched architecture", info );
            set_error( STATUS_NOT_REGISTRY_FILE );
            return 0;
        }
    }
    /* ignore unknown options */
    return 1;
}

1436 1437 1438 1439 1440 1441
/* load a key option from the input file */
static int load_key_option( struct key *key, const char *buffer, struct file_load_info *info )
{
    const char *p;
    data_size_t len;

1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453
    if (!strncmp( buffer, "#time=", 6 ))
    {
        timeout_t modif = 0;
        for (p = buffer + 6; *p; p++)
        {
            if (*p >= '0' && *p <= '9') modif = (modif << 4) | (*p - '0');
            else if (*p >= 'A' && *p <= 'F') modif = (modif << 4) | (*p - 'A' + 10);
            else if (*p >= 'a' && *p <= 'f') modif = (modif << 4) | (*p - 'a' + 10);
            else break;
        }
        update_key_time( key, modif );
    }
1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464
    if (!strncmp( buffer, "#class=", 7 ))
    {
        p = buffer + 7;
        if (*p++ != '"') return 0;
        if (!get_file_tmp_space( info, strlen(p) * sizeof(WCHAR) )) return 0;
        len = info->tmplen;
        if (parse_strW( info->tmp, &len, p, '\"' ) == -1) return 0;
        free( key->class );
        if (!(key->class = memdup( info->tmp, len ))) len = 0;
        key->classlen = len;
    }
1465
    if (!strncmp( buffer, "#link", 5 )) key->flags |= KEY_SYMLINK;
1466 1467 1468 1469
    /* ignore unknown options */
    return 1;
}

1470
/* parse a comma-separated list of hex digits */
1471
static int parse_hex( unsigned char *dest, data_size_t *len, const char *buffer )
1472 1473
{
    const char *p = buffer;
1474
    data_size_t count = 0;
1475 1476
    char *end;

1477 1478
    while (isxdigit(*p))
    {
1479 1480
        unsigned int val = strtoul( p, &end, 16 );
        if (end == p || val > 0xff) return -1;
1481
        if (count++ >= *len) return -1;  /* dest buffer overflow */
1482 1483 1484
        *dest++ = val;
        p = end;
        while (isspace(*p)) p++;
1485
        if (*p == ',') p++;
1486
        while (isspace(*p)) p++;
1487 1488 1489 1490 1491 1492
    }
    *len = count;
    return p - buffer;
}

/* parse a value name and create the corresponding value */
1493
static struct key_value *parse_value_name( struct key *key, const char *buffer, data_size_t *len,
1494 1495
                                           struct file_load_info *info )
{
1496
    struct key_value *value;
1497 1498
    struct unicode_str name;
    int index;
1499

1500
    if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1501
    name.str = info->tmp;
1502
    name.len = info->tmplen;
1503 1504
    if (buffer[0] == '@')
    {
1505
        name.len = 0;
1506 1507 1508 1509
        *len = 1;
    }
    else
    {
1510
        int r = parse_strW( info->tmp, &name.len, buffer + 1, '\"' );
1511 1512
        if (r == -1) goto error;
        *len = r + 1; /* for initial quote */
1513
        name.len -= sizeof(WCHAR);  /* terminating null */
1514
    }
1515
    while (isspace(buffer[*len])) (*len)++;
1516 1517
    if (buffer[*len] != '=') goto error;
    (*len)++;
1518
    while (isspace(buffer[*len])) (*len)++;
1519
    if (!(value = find_value( key, &name, &index ))) value = insert_value( key, &name, index );
1520
    return value;
1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531

 error:
    file_read_error( "Malformed value name", info );
    return NULL;
}

/* load a value from the input file */
static int load_value( struct key *key, const char *buffer, struct file_load_info *info )
{
    DWORD dw;
    void *ptr, *newptr;
1532
    int res, type, parse_type;
1533
    data_size_t maxlen, len;
1534 1535 1536 1537 1538 1539 1540 1541 1542
    struct key_value *value;

    if (!(value = parse_value_name( key, buffer, &len, info ))) return 0;
    if (!(res = get_data_type( buffer + len, &type, &parse_type ))) goto error;
    buffer += len + res;

    switch(parse_type)
    {
    case REG_SZ:
1543 1544
        if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return 0;
        len = info->tmplen;
1545
        if ((res = parse_strW( info->tmp, &len, buffer, '\"' )) == -1) goto error;
1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556
        ptr = info->tmp;
        break;
    case REG_DWORD:
        dw = strtoul( buffer, NULL, 16 );
        ptr = &dw;
        len = sizeof(dw);
        break;
    case REG_BINARY:  /* hex digits */
        len = 0;
        for (;;)
        {
1557
            maxlen = 1 + strlen(buffer) / 2;  /* at least 2 chars for one hex byte */
1558
            if (!get_file_tmp_space( info, len + maxlen )) return 0;
1559
            if ((res = parse_hex( (unsigned char *)info->tmp + len, &maxlen, buffer )) == -1) goto error;
1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579
            len += maxlen;
            buffer += res;
            while (isspace(*buffer)) buffer++;
            if (!*buffer) break;
            if (*buffer != '\\') goto error;
            if (read_next_line( info) != 1) goto error;
            buffer = info->buffer;
            while (isspace(*buffer)) buffer++;
        }
        ptr = info->tmp;
        break;
    default:
        assert(0);
        ptr = NULL;  /* keep compiler quiet */
        break;
    }

    if (!len) newptr = NULL;
    else if (!(newptr = memdup( ptr, len ))) return 0;

1580
    free( value->data );
1581 1582 1583 1584 1585 1586 1587
    value->data = newptr;
    value->len  = len;
    value->type = type;
    return 1;

 error:
    file_read_error( "Malformed value", info );
1588 1589 1590 1591
    free( value->data );
    value->data = NULL;
    value->len  = 0;
    value->type = REG_NONE;
1592 1593 1594
    return 0;
}

1595 1596 1597 1598 1599 1600
/* return the length (in path elements) of name that is part of the key name */
/* for instance if key is USER\foo\bar and name is foo\bar\baz, return 2 */
static int get_prefix_len( struct key *key, const char *name, struct file_load_info *info )
{
    WCHAR *p;
    int res;
1601
    data_size_t len;
1602

1603
    if (!get_file_tmp_space( info, strlen(name) * sizeof(WCHAR) )) return 0;
1604

1605
    len = info->tmplen;
1606
    if ((res = parse_strW( info->tmp, &len, name, ']' )) == -1)
1607 1608
    {
        file_read_error( "Malformed key", info );
1609
        return 0;
1610
    }
1611
    for (p = info->tmp; *p; p++) if (*p == '\\') break;
1612
    len = (p - info->tmp) * sizeof(WCHAR);
1613
    for (res = 1; key != root_key; res++)
1614
    {
1615
        if (len == key->namelen && !memicmp_strW( info->tmp, key->name, len )) break;
1616 1617
        key = key->parent;
    }
1618
    if (key == root_key) res = 0;  /* no matching name */
1619 1620 1621
    return res;
}

1622
/* load all the keys from the input file */
1623
/* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1624
static void load_keys( struct key *key, const char *filename, FILE *f, int prefix_len )
1625 1626 1627
{
    struct key *subkey = NULL;
    struct file_load_info info;
1628
    timeout_t modif = current_time;
1629
    char *p;
1630

1631
    info.filename = filename;
1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645
    info.file   = f;
    info.len    = 4;
    info.tmplen = 4;
    info.line   = 0;
    if (!(info.buffer = mem_alloc( info.len ))) return;
    if (!(info.tmp = mem_alloc( info.tmplen )))
    {
        free( info.buffer );
        return;
    }

    if ((read_next_line( &info ) != 1) ||
        strcmp( info.buffer, "WINE REGISTRY Version 2" ))
    {
1646
        set_error( STATUS_NOT_REGISTRY_FILE );
1647 1648 1649 1650 1651
        goto done;
    }

    while (read_next_line( &info ) == 1)
    {
1652 1653
        p = info.buffer;
        while (*p && isspace(*p)) p++;
1654 1655 1656
        switch(*p)
        {
        case '[':   /* new key */
1657 1658 1659 1660 1661
            if (subkey)
            {
                update_key_time( subkey, modif );
                release_object( subkey );
            }
1662
            if (prefix_len == -1) prefix_len = get_prefix_len( key, p + 1, &info );
1663
            if (!(subkey = load_key( key, p + 1, prefix_len, &info, &modif )))
1664
                file_read_error( "Error creating key", &info );
1665 1666 1667 1668 1669 1670
            break;
        case '@':   /* default value */
        case '\"':  /* value */
            if (subkey) load_value( subkey, p, &info );
            else file_read_error( "Value without key", &info );
            break;
1671 1672
        case '#':   /* option */
            if (subkey) load_key_option( subkey, p, &info );
1673
            else if (!load_global_option( p, &info )) goto done;
1674
            break;
1675 1676 1677 1678 1679 1680 1681 1682 1683 1684
        case ';':   /* comment */
        case 0:     /* empty line */
            break;
        default:
            file_read_error( "Unrecognized input", &info );
            break;
        }
    }

 done:
1685 1686 1687 1688 1689
    if (subkey)
    {
        update_key_time( subkey, modif );
        release_object( subkey );
    }
1690 1691 1692 1693 1694
    free( info.buffer );
    free( info.tmp );
}

/* load a part of the registry from a file */
1695
static void load_registry( struct key *key, obj_handle_t handle )
1696
{
1697
    struct file *file;
1698 1699
    int fd;

1700
    if (!(file = get_file_obj( current->process, handle, FILE_READ_DATA ))) return;
1701 1702
    fd = dup( get_file_unix_fd( file ) );
    release_object( file );
1703 1704 1705 1706 1707
    if (fd != -1)
    {
        FILE *f = fdopen( fd, "r" );
        if (f)
        {
1708
            load_keys( key, NULL, f, -1 );
1709 1710 1711 1712 1713 1714
            fclose( f );
        }
        else file_set_error();
    }
}

1715
/* load one of the initial registry files */
1716
static int load_init_registry_from_file( const char *filename, struct key *key )
1717 1718 1719
{
    FILE *f;

1720 1721
    if ((f = fopen( filename, "r" )))
    {
1722
        load_keys( key, filename, f, 0 );
1723 1724
        fclose( f );
        if (get_error() == STATUS_NOT_REGISTRY_FILE)
1725 1726
        {
            fprintf( stderr, "%s is not a valid registry file\n", filename );
1727
            return 1;
1728
        }
1729
    }
1730

1731
    assert( save_branch_count < MAX_SAVE_BRANCH_INFO );
1732

1733 1734 1735
    save_branch_info[save_branch_count].path = filename;
    save_branch_info[save_branch_count++].key = (struct key *)grab_object( key );
    make_object_static( &key->obj );
1736
    return (f != NULL);
1737 1738
}

1739
static WCHAR *format_user_registry_path( const SID *sid, struct unicode_str *path )
1740
{
1741
    char buffer[7 + 11 + 11 + 11 * SID_MAX_SUB_AUTHORITIES], *p = buffer;
1742 1743
    unsigned int i;

1744 1745 1746 1747 1748 1749 1750
    p += sprintf( p, "User\\S-%u-%u", sid->Revision,
                  MAKELONG( MAKEWORD( sid->IdentifierAuthority.Value[5],
                                      sid->IdentifierAuthority.Value[4] ),
                            MAKEWORD( sid->IdentifierAuthority.Value[3],
                                      sid->IdentifierAuthority.Value[2] )));
    for (i = 0; i < sid->SubAuthorityCount; i++) p += sprintf( p, "-%u", sid->SubAuthority[i] );
    return ascii_to_unicode_str( buffer, path );
1751 1752
}

1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780
/* get the cpu architectures that can be supported in the current prefix */
unsigned int get_prefix_cpu_mask(void)
{
    /* Allowed server/client/prefix combinations:
     *
     *              prefix
     *            32     64
     *  server +------+------+ client
     *         |  ok  | fail | 32
     *      32 +------+------+---
     *         | fail | fail | 64
     *      ---+------+------+---
     *         |  ok  |  ok  | 32
     *      64 +------+------+---
     *         | fail |  ok  | 64
     *      ---+------+------+---
     */
    switch (prefix_type)
    {
    case PREFIX_64BIT:
        /* 64-bit prefix requires 64-bit server */
        return sizeof(void *) > sizeof(int) ? ~0 : 0;
    case PREFIX_32BIT:
    default:
        return ~CPU_64BIT_MASK;  /* only 32-bit cpus supported on 32-bit prefix */
    }
}

1781 1782 1783
/* registry initialisation */
void init_registry(void)
{
1784 1785
    static const WCHAR HKLM[] = { 'M','a','c','h','i','n','e' };
    static const WCHAR HKU_default[] = { 'U','s','e','r','\\','.','D','e','f','a','u','l','t' };
1786 1787 1788
    static const WCHAR classes[] = {'S','o','f','t','w','a','r','e','\\',
                                    'C','l','a','s','s','e','s','\\',
                                    'W','o','w','6','4','3','2','N','o','d','e'};
1789 1790 1791
    static const struct unicode_str root_name = { NULL, 0 };
    static const struct unicode_str HKLM_name = { HKLM, sizeof(HKLM) };
    static const struct unicode_str HKU_name = { HKU_default, sizeof(HKU_default) };
1792
    static const struct unicode_str classes_name = { classes, sizeof(classes) };
1793

1794
    WCHAR *current_user_path;
1795
    struct unicode_str current_user_str;
1796
    struct key *key, *hklm, *hkcu;
1797
    char *p;
1798

1799 1800
    /* switch to the config dir */

1801
    if (fchdir( config_dir_fd ) == -1) fatal_error( "chdir to config dir: %s\n", strerror( errno ));
1802

1803
    /* create the root key */
1804
    root_key = alloc_key( &root_name, current_time );
1805
    assert( root_key );
1806
    make_object_static( &root_key->obj );
1807

1808 1809
    /* load system.reg into Registry\Machine */

1810
    if (!(hklm = create_key_recursive( root_key, &HKLM_name, current_time )))
1811 1812
        fatal_error( "could not create Machine registry key\n" );

1813
    if (!load_init_registry_from_file( "system.reg", hklm ))
1814 1815 1816 1817 1818 1819
    {
        if ((p = getenv( "WINEARCH" )) && !strcmp( p, "win32" ))
            prefix_type = PREFIX_32BIT;
        else
            prefix_type = sizeof(void *) > sizeof(int) ? PREFIX_64BIT : PREFIX_32BIT;
    }
1820 1821
    else if (prefix_type == PREFIX_UNKNOWN)
        prefix_type = PREFIX_32BIT;
1822 1823 1824

    /* load userdef.reg into Registry\User\.Default */

1825
    if (!(key = create_key_recursive( root_key, &HKU_name, current_time )))
1826 1827
        fatal_error( "could not create User\\.Default registry key\n" );

1828
    load_init_registry_from_file( "userdef.reg", key );
1829 1830
    release_object( key );

1831 1832
    /* load user.reg into HKEY_CURRENT_USER */

1833
    /* FIXME: match default user in token.c. should get from process token instead */
1834
    current_user_path = format_user_registry_path( security_local_user_sid, &current_user_str );
1835
    if (!current_user_path ||
1836
        !(hkcu = create_key_recursive( root_key, &current_user_str, current_time )))
1837
        fatal_error( "could not create HKEY_CURRENT_USER registry key\n" );
1838
    free( current_user_path );
1839 1840 1841
    load_init_registry_from_file( "user.reg", hkcu );

    /* set the shared flag on Software\Classes\Wow6432Node */
1842
    if (prefix_type == PREFIX_64BIT)
1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853
    {
        if ((key = create_key_recursive( hklm, &classes_name, current_time )))
        {
            key->flags |= KEY_WOWSHARE;
            release_object( key );
        }
        /* FIXME: handle HKCU too */
    }

    release_object( hklm );
    release_object( hkcu );
1854 1855 1856

    /* start the periodic save timer */
    set_periodic_save_timer();
1857

1858 1859 1860 1861 1862 1863 1864 1865
    /* create windows directories */

    if (!mkdir( "drive_c/windows", 0777 ))
    {
        mkdir( "drive_c/windows/system32", 0777 );
        if (prefix_type == PREFIX_64BIT) mkdir( "drive_c/windows/syswow64", 0777 );
    }

1866
    /* go back to the server dir */
1867
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
1868 1869
}

1870 1871
/* save a registry branch to a file */
static void save_all_subkeys( struct key *key, FILE *f )
1872
{
1873 1874 1875 1876
    fprintf( f, "WINE REGISTRY Version 2\n" );
    fprintf( f, ";; All keys relative to " );
    dump_path( key, NULL, f );
    fprintf( f, "\n" );
1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887
    switch (prefix_type)
    {
    case PREFIX_32BIT:
        fprintf( f, "\n#arch=win32\n" );
        break;
    case PREFIX_64BIT:
        fprintf( f, "\n#arch=win64\n" );
        break;
    default:
        break;
    }
1888
    save_subkeys( key, key, f );
1889 1890 1891
}

/* save a registry branch to a file handle */
1892
static void save_registry( struct key *key, obj_handle_t handle )
1893
{
1894
    struct file *file;
1895 1896
    int fd;

1897
    if (!(file = get_file_obj( current->process, handle, FILE_WRITE_DATA ))) return;
1898 1899
    fd = dup( get_file_unix_fd( file ) );
    release_object( file );
1900 1901 1902 1903 1904
    if (fd != -1)
    {
        FILE *f = fdopen( fd, "w" );
        if (f)
        {
1905
            save_all_subkeys( key, f );
1906 1907 1908 1909 1910 1911 1912 1913 1914 1915
            if (fclose( f )) file_set_error();
        }
        else
        {
            file_set_error();
            close( fd );
        }
    }
}

1916 1917 1918
/* save a registry branch to a file */
static int save_branch( struct key *key, const char *path )
{
1919
    struct stat st;
1920 1921
    char *p, *tmp = NULL;
    int fd, count = 0, ret = 0;
1922 1923
    FILE *f;

1924 1925 1926 1927 1928 1929
    if (!(key->flags & KEY_DIRTY))
    {
        if (debug_level > 1) dump_operation( key, NULL, "Not saving clean" );
        return 1;
    }

1930 1931 1932 1933
    /* test the file type */

    if ((fd = open( path, O_WRONLY )) != -1)
    {
1934 1935
        /* if file is not a regular file or has multiple links or is accessed
         * via symbolic links, write directly into it; otherwise use a temp file */
1936
        if (!lstat( path, &st ) && (!S_ISREG(st.st_mode) || st.st_nlink > 1))
1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951
        {
            ftruncate( fd, 0 );
            goto save;
        }
        close( fd );
    }

    /* create a temp file in the same directory */

    if (!(tmp = malloc( strlen(path) + 20 ))) goto done;
    strcpy( tmp, path );
    if ((p = strrchr( tmp, '/' ))) p++;
    else p = tmp;
    for (;;)
    {
Patrik Stridvall's avatar
Patrik Stridvall committed
1952
        sprintf( p, "reg%lx%04x.tmp", (long) getpid(), count++ );
1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973
        if ((fd = open( tmp, O_CREAT | O_EXCL | O_WRONLY, 0666 )) != -1) break;
        if (errno != EEXIST) goto done;
        close( fd );
    }

    /* now save to it */

 save:
    if (!(f = fdopen( fd, "w" )))
    {
        if (tmp) unlink( tmp );
        close( fd );
        goto done;
    }

    if (debug_level > 1)
    {
        fprintf( stderr, "%s: ", path );
        dump_operation( key, NULL, "saving" );
    }

1974
    save_all_subkeys( key, f );
1975 1976 1977 1978 1979 1980 1981 1982 1983 1984
    ret = !fclose(f);

    if (tmp)
    {
        /* if successfully written, rename to final name */
        if (ret) ret = !rename( tmp, path );
        if (!ret) unlink( tmp );
    }

done:
1985
    free( tmp );
1986
    if (ret) make_clean( key );
1987 1988 1989 1990 1991 1992 1993
    return ret;
}

/* periodic saving of the registry */
static void periodic_save( void *arg )
{
    int i;
1994

1995
    if (fchdir( config_dir_fd ) == -1) return;
1996
    save_timeout_user = NULL;
1997 1998
    for (i = 0; i < save_branch_count; i++)
        save_branch( save_branch_info[i].key, save_branch_info[i].path );
1999
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2000 2001 2002 2003 2004 2005 2006
    set_periodic_save_timer();
}

/* start the periodic save timer */
static void set_periodic_save_timer(void)
{
    if (save_timeout_user) remove_timeout_user( save_timeout_user );
2007
    save_timeout_user = add_timeout_user( save_period, periodic_save, NULL );
2008 2009
}

2010 2011
/* save the modified registry branches to disk */
void flush_registry(void)
2012 2013 2014
{
    int i;

2015
    if (fchdir( config_dir_fd ) == -1) return;
2016 2017 2018 2019 2020 2021 2022 2023 2024
    for (i = 0; i < save_branch_count; i++)
    {
        if (!save_branch( save_branch_info[i].key, save_branch_info[i].path ))
        {
            fprintf( stderr, "wineserver: could not save registry branch to %s",
                     save_branch_info[i].path );
            perror( " " );
        }
    }
2025
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2026 2027
}

2028 2029 2030 2031 2032 2033
/* determine if the thread is wow64 (32-bit client running on 64-bit prefix) */
static int is_wow64_thread( struct thread *thread )
{
    return (prefix_type == PREFIX_64BIT && !(CPU_FLAG(thread->process->cpu) & CPU_64BIT_MASK));
}

2034

2035 2036 2037
/* create a registry key */
DECL_HANDLER(create_key)
{
2038
    struct key *key = NULL, *parent;
2039
    struct unicode_str name, class;
2040
    unsigned int access = req->access;
2041
    const struct security_descriptor *sd;
2042
    const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2043 2044

    if (!objattr) return;
2045

2046 2047
    if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;

2048 2049
    class.str = get_req_data_after_objattr( objattr, &class.len );
    class.len = (class.len / sizeof(WCHAR)) * sizeof(WCHAR);
2050

2051
    if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2052
        !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2053
    {
2054
        name.str += ARRAY_SIZE( root_name );
2055
        name.len -= sizeof(root_name);
2056 2057
    }

2058
    /* NOTE: no access rights are required from the parent handle to create a key */
2059
    if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2060
    {
2061
        if ((key = create_key( parent, &name, &class, req->options, access,
2062
                               objattr->attributes, sd, &reply->created )))
2063
        {
2064
            reply->hkey = alloc_handle( current->process, key, access, objattr->attributes );
2065 2066
            release_object( key );
        }
2067 2068 2069 2070 2071 2072 2073 2074
        release_object( parent );
    }
}

/* open a registry key */
DECL_HANDLER(open_key)
{
    struct key *key, *parent;
2075
    struct unicode_str name;
2076 2077
    unsigned int access = req->access;

2078 2079
    if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;

2080
    reply->hkey = 0;
2081
    /* NOTE: no access rights are required to open the parent key, only the child key */
2082
    if ((parent = get_parent_hkey_obj( req->parent )))
2083
    {
2084
        get_req_path( &name, !req->parent );
2085
        if ((key = open_key( parent, &name, access, req->attributes )))
2086
        {
2087
            reply->hkey = alloc_handle( current->process, key, access, req->attributes );
2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098
            release_object( key );
        }
        release_object( parent );
    }
}

/* delete a registry key */
DECL_HANDLER(delete_key)
{
    struct key *key;

2099
    if ((key = get_hkey_obj( req->hkey, DELETE )))
2100
    {
2101
        delete_key( key, 0);
2102 2103 2104 2105
        release_object( key );
    }
}

2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116
/* flush a registry key */
DECL_HANDLER(flush_key)
{
    struct key *key = get_hkey_obj( req->hkey, 0 );
    if (key)
    {
        /* we don't need to do anything here with the current implementation */
        release_object( key );
    }
}

2117 2118 2119 2120 2121
/* enumerate registry subkeys */
DECL_HANDLER(enum_key)
{
    struct key *key;

2122 2123
    if ((key = get_hkey_obj( req->hkey,
                             req->index == -1 ? KEY_QUERY_VALUE : KEY_ENUMERATE_SUB_KEYS )))
2124
    {
2125
        enum_key( key, req->index, req->info_class, reply );
2126 2127 2128 2129 2130 2131 2132 2133
        release_object( key );
    }
}

/* set a value of a registry key */
DECL_HANDLER(set_key_value)
{
    struct key *key;
2134 2135 2136 2137 2138 2139 2140 2141 2142
    struct unicode_str name;

    if (req->namelen > get_req_data_size())
    {
        set_error( STATUS_INVALID_PARAMETER );
        return;
    }
    name.str = get_req_data();
    name.len = (req->namelen / sizeof(WCHAR)) * sizeof(WCHAR);
2143

2144 2145
    if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
    {
2146
        data_size_t datalen = get_req_data_size() - req->namelen;
Eric Pouech's avatar
Eric Pouech committed
2147
        const char *data = (const char *)get_req_data() + req->namelen;
2148

2149
        set_value( key, &name, req->type, data, datalen );
2150 2151 2152 2153 2154 2155 2156 2157
        release_object( key );
    }
}

/* retrieve the value of a registry key */
DECL_HANDLER(get_key_value)
{
    struct key *key;
2158
    struct unicode_str name = get_req_unicode_str();
2159

2160
    reply->total = 0;
2161 2162
    if ((key = get_hkey_obj( req->hkey, KEY_QUERY_VALUE )))
    {
2163
        get_value( key, &name, &reply->type, &reply->total );
2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174
        release_object( key );
    }
}

/* enumerate the value of a registry key */
DECL_HANDLER(enum_key_value)
{
    struct key *key;

    if ((key = get_hkey_obj( req->hkey, KEY_QUERY_VALUE )))
    {
2175
        enum_value( key, req->index, req->info_class, reply );
2176 2177 2178 2179 2180 2181 2182 2183
        release_object( key );
    }
}

/* delete a value of a registry key */
DECL_HANDLER(delete_key_value)
{
    struct key *key;
2184
    struct unicode_str name = get_req_unicode_str();
2185 2186 2187

    if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
    {
2188
        delete_value( key, &name );
2189 2190 2191 2192 2193 2194 2195
        release_object( key );
    }
}

/* load a registry branch from a file */
DECL_HANDLER(load_registry)
{
James Hawkins's avatar
James Hawkins committed
2196
    struct key *key, *parent;
2197
    struct unicode_str name;
2198
    const struct security_descriptor *sd;
2199
    const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2200

2201 2202
    if (!objattr) return;

2203
    if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2204 2205 2206 2207 2208
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }

2209
    if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2210
        !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2211
    {
2212
        name.str += ARRAY_SIZE( root_name );
2213 2214 2215 2216
        name.len -= sizeof(root_name);
    }

    if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2217
    {
James Hawkins's avatar
James Hawkins committed
2218
        int dummy;
2219
        if ((key = create_key( parent, &name, NULL, 0, KEY_WOW64_64KEY, 0, sd, &dummy )))
James Hawkins's avatar
James Hawkins committed
2220 2221 2222 2223 2224
        {
            load_registry( key, req->file );
            release_object( key );
        }
        release_object( parent );
2225 2226 2227
    }
}

2228 2229 2230
DECL_HANDLER(unload_registry)
{
    struct key *key;
2231

2232
    if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2233 2234 2235 2236
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }
2237 2238 2239 2240 2241 2242 2243 2244

    if ((key = get_hkey_obj( req->hkey, 0 )))
    {
        delete_key( key, 1 );     /* FIXME */
        release_object( key );
    }
}

2245 2246 2247 2248 2249
/* save a registry branch to a file */
DECL_HANDLER(save_registry)
{
    struct key *key;

2250 2251 2252 2253 2254 2255 2256
    if (!thread_single_check_privilege( current, &SeBackupPrivilege ))
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }

    if ((key = get_hkey_obj( req->hkey, 0 )))
2257 2258 2259 2260 2261 2262
    {
        save_registry( key, req->file );
        release_object( key );
    }
}

2263 2264 2265 2266 2267 2268 2269 2270
/* add a registry key change notification */
DECL_HANDLER(set_registry_notification)
{
    struct key *key;
    struct event *event;
    struct notify *notify;

    key = get_hkey_obj( req->hkey, KEY_NOTIFY );
2271
    if (key)
2272 2273
    {
        event = get_event_obj( current->process, req->event, SYNCHRONIZE );
2274
        if (event)
2275
        {
2276
            notify = find_notify( key, current->process, req->hkey );
2277
            if (notify)
2278
            {
2279 2280
                if (notify->event)
                    release_object( notify->event );
2281 2282 2283 2284 2285
                grab_object( event );
                notify->event = event;
            }
            else
            {
2286
                notify = mem_alloc( sizeof(*notify) );
2287
                if (notify)
2288 2289 2290 2291 2292 2293
                {
                    grab_object( event );
                    notify->event   = event;
                    notify->subtree = req->subtree;
                    notify->filter  = req->filter;
                    notify->hkey    = req->hkey;
2294
                    notify->process = current->process;
2295
                    list_add_head( &key->notify_list, &notify->entry );
2296 2297
                }
            }
2298
            if (notify)
2299 2300
            {
                reset_event( event );
2301
                set_error( STATUS_PENDING );
2302
            }
2303 2304 2305 2306 2307
            release_object( event );
        }
        release_object( key );
    }
}