registry.c 70.3 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 WCHAR *key_get_full_name( struct object *obj, data_size_t *len );
152
static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle );
153 154 155 156
static void key_destroy( struct object *obj );

static const struct object_ops key_ops =
{
157 158
    sizeof(struct key),      /* size */
    key_dump,                /* dump */
159
    key_get_type,            /* get_type */
160 161 162 163
    no_add_queue,            /* add_queue */
    NULL,                    /* remove_queue */
    NULL,                    /* signaled */
    NULL,                    /* satisfied */
164
    no_signal,               /* signal */
165
    no_get_fd,               /* get_fd */
166
    key_map_access,          /* map_access */
167
    key_get_sd,              /* get_sd */
168
    default_set_sd,          /* set_sd */
169
    key_get_full_name,       /* get_full_name */
170
    no_lookup_name,          /* lookup_name */
171 172
    no_link_name,            /* link_name */
    NULL,                    /* unlink_name */
173
    no_open_file,            /* open_file */
174
    no_kernel_obj_list,      /* get_kernel_obj_list */
175
    key_close_handle,        /* close_handle */
176
    key_destroy              /* destroy */
177 178 179
};


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

185 186 187 188 189 190 191 192 193 194
/*
 * 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 */
195
static void dump_path( const struct key *key, const struct key *base, FILE *f )
196
{
197
    if (key->parent && key->parent != base)
198
    {
199
        dump_path( key->parent, base, f );
200 201
        fprintf( f, "\\\\" );
    }
202
    dump_strW( key->name, key->namelen, f, "[]" );
203 204 205
}

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

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

    switch(value->type)
    {
    case REG_SZ:
    case REG_EXPAND_SZ:
    case REG_MULTI_SZ:
224 225 226 227 228
        /* 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 );
229
        fputc( '\"', f );
230
        dump_strW( (WCHAR *)value->data, value->len, f, "\"\"" );
231 232 233
        fprintf( f, "\"\n" );
        return;

234
    case REG_DWORD:
235 236 237 238 239 240 241 242 243 244 245 246
        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)
247
        {
248 249
            fputc( ',', f );
            if (++count > 76)
250
            {
251 252
                fprintf( f, "\\\n  " );
                count = 2;
253 254 255 256 257 258 259
            }
        }
    }
    fputc( '\n', f );
}

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

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

285
static void dump_operation( const struct key *key, const struct key_value *value, const char *op )
286 287
{
    fprintf( stderr, "%s key ", op );
288
    if (key) dump_path( key, NULL, stderr );
289 290 291 292 293 294 295 296 297 298 299 300 301 302
    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 );
303
    dump_path( key, NULL, stderr );
304 305 306
    fprintf( stderr, "\n" );
}

307 308 309 310 311 312 313
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 );
}

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

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

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

341 342 343 344 345 346
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;
347 348 349
    /* 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);
350 351
}

352 353 354 355 356 357 358 359
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)
    {
360 361
        size_t users_sid_len = security_sid_len( security_builtin_users_sid );
        size_t admins_sid_len = security_sid_len( security_builtin_admins_sid );
362 363
        size_t dacl_len = sizeof(ACL) + 2 * offsetof( ACCESS_ALLOWED_ACE, SidStart )
                          + users_sid_len + admins_sid_len;
364 365 366 367 368 369 370
        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;
371
        key_default_sd->sacl_len  = 0;
372 373 374 375 376 377 378 379
        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;
380
        dacl->AceCount = 2;
381 382 383 384 385 386 387
        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 );
388 389 390 391 392 393
        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 );
394 395 396 397
    }
    return key_default_sd;
}

398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420
static WCHAR *key_get_full_name( struct object *obj, data_size_t *ret_len )
{
    static const WCHAR backslash = '\\';
    struct key *key = (struct key *) obj;
    data_size_t len = sizeof(root_name) - sizeof(WCHAR);
    char *ret;

    for (key = (struct key *)obj; key != root_key; key = key->parent) len += key->namelen + sizeof(WCHAR);
    if (!(ret = malloc( len ))) return NULL;

    *ret_len = len;
    key = (struct key *)obj;
    for (key = (struct key *)obj; key != root_key; key = key->parent)
    {
        memcpy( ret + len - key->namelen, key->name, key->namelen );
        dump_strW( (WCHAR *)(ret + len - key->namelen), key->namelen, stderr, "" );
        len -= key->namelen + sizeof(WCHAR);
        memcpy( ret + len, &backslash, sizeof(WCHAR) );
    }
    memcpy( ret, root_name, sizeof(root_name) - sizeof(WCHAR) );
    return (WCHAR *)ret;
}

421
/* close the notification associated with a handle */
422
static int key_close_handle( struct object *obj, struct process *process, obj_handle_t handle )
423 424
{
    struct key * key = (struct key *) obj;
425
    struct notify *notify = find_notify( key, process, handle );
426 427
    if (notify) do_notification( key, notify, 1 );
    return 1;  /* ok to close */
428 429
}

430 431 432
static void key_destroy( struct object *obj )
{
    int i;
433
    struct list *ptr;
434 435 436
    struct key *key = (struct key *)obj;
    assert( obj->ops == &key_ops );

437 438
    free( key->name );
    free( key->class );
439 440
    for (i = 0; i <= key->last_value; i++)
    {
441 442
        free( key->values[i].name );
        free( key->values[i].data );
443
    }
444
    free( key->values );
445 446 447 448 449
    for (i = 0; i <= key->last_subkey; i++)
    {
        key->subkeys[i]->parent = NULL;
        release_object( key->subkeys[i] );
    }
450
    free( key->subkeys );
451
    /* unconditionally notify everything waiting on this key */
452 453 454 455 456
    while ((ptr = list_head( &key->notify_list )))
    {
        struct notify *notify = LIST_ENTRY( ptr, struct notify, entry );
        do_notification( key, notify, 1 );
    }
457 458
}

459
/* get the request vararg as registry path */
460
static inline void get_req_path( struct unicode_str *str, int skip_root )
461
{
462 463
    str->str = get_req_data();
    str->len = (get_req_data_size() / sizeof(WCHAR)) * sizeof(WCHAR);
464

465
    if (skip_root && str->len >= sizeof(root_name) && !memicmp_strW( str->str, root_name, sizeof(root_name) ))
466
    {
467
        str->str += ARRAY_SIZE( root_name );
468
        str->len -= sizeof(root_name);
469 470 471
    }
}

472
/* return the next token in a given path */
473 474
/* 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 )
475
{
476
    data_size_t i = 0, len = path->len / sizeof(WCHAR);
477

478
    if (!token->str)  /* first time */
479
    {
480
        /* path cannot start with a backslash */
481
        if (len && path->str[0] == '\\')
482 483 484 485
        {
            set_error( STATUS_OBJECT_PATH_INVALID );
            return NULL;
        }
486
    }
487
    else
488
    {
489 490 491
        i = token->str - path->str;
        i += token->len / sizeof(WCHAR);
        while (i < len && path->str[i] == '\\') i++;
492
    }
493 494 495 496
    token->str = path->str + i;
    while (i < len && path->str[i] != '\\') i++;
    token->len = (path->str + i - token->str) * sizeof(WCHAR);
    return token;
497 498 499
}

/* allocate a key object */
500
static struct key *alloc_key( const struct unicode_str *name, timeout_t modif )
501 502
{
    struct key *key;
503
    if ((key = alloc_object( &key_ops )))
504
    {
505
        key->name        = NULL;
506
        key->class       = NULL;
507 508
        key->namelen     = name->len;
        key->classlen    = 0;
509 510 511 512 513 514 515 516 517
        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;
518
        list_init( &key->notify_list );
519
        if (name->len && !(key->name = memdup( name->str, name->len )))
520 521 522 523 524 525 526 527
        {
            release_object( key );
            key = NULL;
        }
    }
    return key;
}

528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549
/* 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] );
}

550
/* go through all the notifications and send them if necessary */
551
static void check_notify( struct key *key, unsigned int change, int not_subtree )
552
{
553 554 555
    struct list *ptr, *next;

    LIST_FOR_EACH_SAFE( ptr, next, &key->notify_list )
556
    {
557
        struct notify *n = LIST_ENTRY( ptr, struct notify, entry );
558 559 560 561 562
        if ( ( not_subtree || n->subtree ) && ( change & n->filter ) )
            do_notification( key, n, 0 );
    }
}

563
/* update key modification time */
564
static void touch_key( struct key *key, unsigned int change )
565
{
566 567
    struct key *k;

568
    key->modif = current_time;
569
    make_dirty( key );
570 571 572 573

    /* do notifications */
    check_notify( key, change, 1 );
    for ( k = key->parent; k; k = k->parent )
574
        check_notify( k, change, 0 );
575 576 577 578 579 580 581 582 583 584 585 586 587
}

/* 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) )))
        {
588
            set_error( STATUS_NO_MEMORY );
589 590 591 592 593
            return 0;
        }
    }
    else
    {
594
        nb_subkeys = MIN_SUBKEYS;
595 596 597 598 599 600 601 602
        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 */
603
static struct key *alloc_subkey( struct key *parent, const struct unicode_str *name,
604
                                 int index, timeout_t modif )
605 606 607 608
{
    struct key *key;
    int i;

609 610
    if (name->len > MAX_NAME_LEN * sizeof(WCHAR))
    {
611
        set_error( STATUS_INVALID_PARAMETER );
612 613
        return NULL;
    }
614 615 616 617 618 619 620 621 622 623 624
    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;
625 626
        if (is_wow6432node( key->name, key->namelen ) && !is_wow6432node( parent->name, parent->namelen ))
            parent->flags |= KEY_WOW64;
627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
    }
    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;
645
    if (is_wow6432node( key->name, key->namelen )) parent->flags &= ~KEY_WOW64;
646
    release_object( key );
647

648
    /* try to shrink the array */
649 650
    nb_subkeys = parent->nb_subkeys;
    if (nb_subkeys > MIN_SUBKEYS && parent->last_subkey < nb_subkeys / 2)
651 652 653 654
    {
        struct key **new_subkeys;
        nb_subkeys -= nb_subkeys / 3;  /* shrink by 33% */
        if (nb_subkeys < MIN_SUBKEYS) nb_subkeys = MIN_SUBKEYS;
655 656 657
        if (!(new_subkeys = realloc( parent->subkeys, nb_subkeys * sizeof(*new_subkeys) ))) return;
        parent->subkeys = new_subkeys;
        parent->nb_subkeys = nb_subkeys;
658 659 660 661
    }
}

/* find the named child of a given key and return its index */
662
static struct key *find_subkey( const struct key *key, const struct unicode_str *name, int *index )
663 664
{
    int i, min, max, res;
665
    data_size_t len;
666 667 668 669 670 671

    min = 0;
    max = key->last_subkey;
    while (min <= max)
    {
        i = (min + max) / 2;
672
        len = min( key->subkeys[i]->namelen, name->len );
673
        res = memicmp_strW( key->subkeys[i]->name, name->str, len );
674 675
        if (!res) res = key->subkeys[i]->namelen - name->len;
        if (!res)
676 677 678 679 680 681 682 683 684 685 686
        {
            *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;
}

687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702
/* 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;
}


703 704 705 706 707 708 709 710 711 712 713 714 715 716
/* 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;
717
    if (memicmp_strW( path.str, root_name, sizeof(root_name) )) return NULL;
718
    path.str += ARRAY_SIZE( root_name );
719 720 721 722 723 724 725 726 727 728 729 730 731 732
    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;
}

733 734 735 736
/* 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 )
737
{
738 739 740 741
    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)
742
    {
743
        struct key *subkey;
744 745 746 747 748 749 750 751 752 753
        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;
754 755 756 757
        key = subkey;
        get_path_token( name, token );
        if (!token->len) break;
        if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, token );
758 759 760 761 762
        if (!(key = follow_symlink( key, 0 )))
        {
            set_error( STATUS_OBJECT_NAME_NOT_FOUND );
            return NULL;
        }
763
    }
764 765
    return key;
}
766

767 768 769 770 771 772 773 774 775 776 777 778 779 780
/* 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;
    }
781
    if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
782 783 784 785 786
    if (!(attributes & OBJ_OPENLINK) && !(key = follow_symlink( key, 0 )))
    {
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
        return NULL;
    }
787
    if (debug_level > 1) dump_operation( key, NULL, "Open" );
788
    grab_object( key );
789 790 791 792
    return key;
}

/* create a subkey */
793
static struct key *create_key( struct key *key, const struct unicode_str *name,
794
                               const struct unicode_str *class, unsigned int options,
795 796
                               unsigned int access, unsigned int attributes,
                               const struct security_descriptor *sd, int *created )
797
{
798
    int index;
799
    struct unicode_str token, next;
800 801

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

804
    if (!token.len)  /* the key already exists */
805
    {
806
        if (!(access & KEY_WOW64_64KEY)) key = find_wow64_subkey( key, &token );
807 808 809 810 811 812 813 814 815 816
        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;
        }
817 818 819 820 821 822 823 824 825 826 827 828
        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;
829
    }
830

831
    if ((key->flags & KEY_VOLATILE) && !(options & REG_OPTION_VOLATILE))
832 833 834 835
    {
        set_error( STATUS_CHILD_MUST_BE_VOLATILE );
        return NULL;
    }
836
    *created = 1;
837 838
    make_dirty( key );
    if (!(key = alloc_subkey( key, &token, index, current_time ))) return NULL;
839

840
    if (options & REG_OPTION_CREATE_LINK) key->flags |= KEY_SYMLINK;
841 842
    if (options & REG_OPTION_VOLATILE) key->flags |= KEY_VOLATILE;
    else key->flags |= KEY_DIRTY;
843

844 845 846
    if (sd) default_set_sd( &key->obj, sd, OWNER_SECURITY_INFORMATION | GROUP_SECURITY_INFORMATION |
                            DACL_SECURITY_INFORMATION | SACL_SECURITY_INFORMATION );

847
    if (debug_level > 1) dump_operation( key, NULL, "Create" );
848 849 850
    if (class && class->len)
    {
        key->classlen = class->len;
851
        free(key->class);
852 853
        if (!(key->class = memdup( class->str, key->classlen ))) key->classlen = 0;
    }
854
    touch_key( key->parent, REG_NOTIFY_CHANGE_NAME );
855 856 857 858
    grab_object( key );
    return key;
}

859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901
/* 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;
}

902
/* query information about a key or a subkey */
903
static void enum_key( struct key *key, int index, int info_class, struct enum_key_reply *reply )
904
{
905
    int i;
906
    data_size_t len, namelen, classlen;
907 908
    data_size_t max_subkey = 0, max_class = 0;
    data_size_t max_value = 0, max_data = 0;
909
    WCHAR *fullname = NULL;
910
    char *data;
911

912 913 914 915 916
    if (index != -1)  /* -1 means use the specified key directly */
    {
        if ((index < 0) || (index > key->last_subkey))
        {
            set_error( STATUS_NO_MORE_ENTRIES );
917
            return;
918 919 920 921
        }
        key = key->subkeys[index];
    }

922 923
    namelen = key->namelen;
    classlen = key->classlen;
924 925

    switch(info_class)
926
    {
927
    case KeyNameInformation:
928
        if (!(fullname = key->obj.ops->get_full_name( &key->obj, &namelen ))) return;
929 930
        /* fall through */
    case KeyBasicInformation:
931 932 933 934 935 936 937 938 939
        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:
940
    case KeyCachedInformation:
941 942
        for (i = 0; i <= key->last_subkey; i++)
        {
943 944
            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;
945 946 947
        }
        for (i = 0; i <= key->last_value; i++)
        {
948 949
            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;
950
        }
951 952 953 954
        reply->max_subkey = max_subkey;
        reply->max_class  = max_class;
        reply->max_value  = max_value;
        reply->max_data   = max_data;
955 956 957 958
        reply->namelen    = namelen;
        if (info_class == KeyCachedInformation)
            classlen = 0; /* don't return any data, only its size */
        namelen = 0;  /* don't return name */
959 960 961 962
        break;
    default:
        set_error( STATUS_INVALID_PARAMETER );
        return;
963
    }
964 965 966 967
    reply->subkeys = key->last_subkey + 1;
    reply->values  = key->last_value + 1;
    reply->modif   = key->modif;
    reply->total   = namelen + classlen;
968

969 970
    len = min( reply->total, get_reply_max_size() );
    if (len && (data = set_reply_data_size( len )))
971
    {
972 973 974 975
        if (len > namelen)
        {
            reply->namelen = namelen;
            memcpy( data, key->name, namelen );
976
            memcpy( data + namelen, key->class, len - namelen );
977
        }
978 979 980
        else if (info_class == KeyNameInformation)
        {
            reply->namelen = namelen;
981
            memcpy( data, fullname, namelen );
982
        }
983 984 985 986 987
        else
        {
            reply->namelen = len;
            memcpy( data, key->name, len );
        }
988
    }
989
    free( fullname );
990
    if (debug_level > 1) dump_operation( key, NULL, "Enum" );
991 992 993
}

/* delete a key and its values */
994
static int delete_key( struct key *key, int recurse )
995 996
{
    int index;
997
    struct key *parent = key->parent;
998

999
    /* must find parent and index */
1000
    if (key == root_key)
1001
    {
1002
        set_error( STATUS_ACCESS_DENIED );
1003
        return -1;
1004
    }
1005
    assert( parent );
1006 1007

    while (recurse && (key->last_subkey>=0))
1008
        if (0 > delete_key(key->subkeys[key->last_subkey], 1))
1009 1010
            return -1;

1011 1012 1013
    for (index = 0; index <= parent->last_subkey; index++)
        if (parent->subkeys[index] == key) break;
    assert( index <= parent->last_subkey );
1014

1015 1016
    /* we can only delete a key that has no subkeys */
    if (key->last_subkey >= 0)
1017
    {
1018
        set_error( STATUS_ACCESS_DENIED );
1019
        return -1;
1020
    }
1021

1022 1023
    if (debug_level > 1) dump_operation( key, NULL, "Delete" );
    free_subkey( parent, index );
1024
    touch_key( parent, REG_NOTIFY_CHANGE_NAME );
1025
    return 0;
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038
}

/* 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) )))
        {
1039
            set_error( STATUS_NO_MEMORY );
1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053
            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 */
1054
static struct key_value *find_value( const struct key *key, const struct unicode_str *name, int *index )
1055 1056
{
    int i, min, max, res;
1057
    data_size_t len;
1058 1059 1060 1061 1062 1063

    min = 0;
    max = key->last_value;
    while (min <= max)
    {
        i = (min + max) / 2;
1064
        len = min( key->values[i].namelen, name->len );
1065
        res = memicmp_strW( key->values[i].name, name->str, len );
1066 1067
        if (!res) res = key->values[i].namelen - name->len;
        if (!res)
1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078
        {
            *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;
}

1079
/* insert a new value; the index must have been returned by find_value */
1080
static struct key_value *insert_value( struct key *key, const struct unicode_str *name, int index )
1081 1082
{
    struct key_value *value;
1083
    WCHAR *new_name = NULL;
1084
    int i;
1085

1086 1087 1088 1089 1090
    if (name->len > MAX_VALUE_LEN * sizeof(WCHAR))
    {
        set_error( STATUS_NAME_TOO_LONG );
        return NULL;
    }
1091
    if (key->last_value + 1 == key->nb_values)
1092
    {
1093
        if (!grow_values( key )) return NULL;
1094
    }
1095
    if (name->len && !(new_name = memdup( name->str, name->len ))) return NULL;
1096 1097
    for (i = ++key->last_value; i > index; i--) key->values[i] = key->values[i - 1];
    value = &key->values[index];
1098 1099 1100 1101
    value->name    = new_name;
    value->namelen = name->len;
    value->len     = 0;
    value->data    = NULL;
1102 1103 1104 1105
    return value;
}

/* set a key value */
1106
static void set_value( struct key *key, const struct unicode_str *name,
1107
                       int type, const void *data, data_size_t len )
1108 1109 1110
{
    struct key_value *value;
    void *ptr = NULL;
1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
    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;
        }
    }
1123

1124 1125 1126
    if (key->flags & KEY_SYMLINK)
    {
        if (type != REG_LINK || name->len != symlink_str.len ||
1127
            memicmp_strW( name->str, symlink_str.str, name->len ))
1128 1129 1130 1131 1132 1133
        {
            set_error( STATUS_ACCESS_DENIED );
            return;
        }
    }

1134
    if (len && !(ptr = memdup( data, len ))) return;
1135

1136
    if (!value)
1137
    {
1138 1139
        if (!(value = insert_value( key, name, index )))
        {
1140
            free( ptr );
1141 1142
            return;
        }
1143
    }
1144
    else free( value->data ); /* already existing, free previous data */
1145

1146
    value->type  = type;
1147
    value->len   = len;
1148
    value->data  = ptr;
1149
    touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1150 1151 1152 1153
    if (debug_level > 1) dump_operation( key, value, "Set" );
}

/* get a key value */
1154
static void get_value( struct key *key, const struct unicode_str *name, int *type, data_size_t *len )
1155 1156 1157 1158 1159 1160 1161 1162
{
    struct key_value *value;
    int index;

    if ((value = find_value( key, name, &index )))
    {
        *type = value->type;
        *len  = value->len;
1163
        if (value->data) set_reply_data( value->data, min( value->len, get_reply_max_size() ));
1164 1165 1166 1167 1168
        if (debug_level > 1) dump_operation( key, value, "Get" );
    }
    else
    {
        *type = -1;
1169
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1170 1171 1172 1173
    }
}

/* enumerate a key value */
1174
static void enum_value( struct key *key, int i, int info_class, struct enum_key_value_reply *reply )
1175 1176 1177
{
    struct key_value *value;

1178
    if (i < 0 || i > key->last_value) set_error( STATUS_NO_MORE_ENTRIES );
1179 1180
    else
    {
1181
        void *data;
1182
        data_size_t namelen, maxlen;
1183

1184
        value = &key->values[i];
1185
        reply->type = value->type;
1186
        namelen = value->namelen;
1187

1188
        switch(info_class)
1189
        {
1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208
        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)
1209
            {
1210 1211 1212
                reply->namelen = namelen;
                memcpy( data, value->name, namelen );
                memcpy( (char *)data + namelen, value->data, maxlen - namelen );
1213
            }
1214
            else
1215
            {
1216 1217
                reply->namelen = maxlen;
                memcpy( data, value->name, maxlen );
1218
            }
1219
        }
1220 1221 1222 1223 1224
        if (debug_level > 1) dump_operation( key, value, "Enum" );
    }
}

/* delete a value */
1225
static void delete_value( struct key *key, const struct unicode_str *name )
1226 1227 1228 1229 1230 1231
{
    struct key_value *value;
    int i, index, nb_values;

    if (!(value = find_value( key, name, &index )))
    {
1232
        set_error( STATUS_OBJECT_NAME_NOT_FOUND );
1233 1234 1235
        return;
    }
    if (debug_level > 1) dump_operation( key, value, "Delete" );
1236 1237
    free( value->name );
    free( value->data );
1238 1239
    for (i = index; i < key->last_value; i++) key->values[i] = key->values[i + 1];
    key->last_value--;
1240
    touch_key( key, REG_NOTIFY_CHANGE_LAST_SET );
1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252

    /* 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;
    }
1253
}
1254 1255

/* get the registry key corresponding to an hkey handle */
1256
static struct key *get_hkey_obj( obj_handle_t hkey, unsigned int access )
1257
{
1258 1259 1260 1261 1262 1263 1264 1265 1266
    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;
1267 1268
}

1269 1270 1271 1272
/* 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 );
1273
    return get_hkey_obj( hkey, 0 );
1274 1275
}

1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300
/* 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 )))
        {
1301
            set_error( STATUS_NO_MEMORY );
1302 1303 1304 1305 1306 1307 1308 1309
            return -1;
        }
        info->buffer = newbuf;
        info->len = newlen;
    }
}

/* make sure the temp buffer holds enough space */
1310
static int get_file_tmp_space( struct file_load_info *info, size_t size )
1311
{
1312
    WCHAR *tmp;
1313 1314 1315
    if (info->tmplen >= size) return 1;
    if (!(tmp = realloc( info->tmp, size )))
    {
1316
        set_error( STATUS_NO_MEMORY );
1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
        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 )
{
1327 1328 1329 1330
    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 );
1331 1332 1333 1334 1335 1336 1337
}

/* 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; };

1338
    static const struct data_type data_types[] =
1339 1340 1341 1342 1343 1344 1345 1346
    {                   /* 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 },
1347
        { NULL,        0,    0,                  0 }
1348 1349 1350 1351 1352 1353 1354
    };

    const struct data_type *ptr;
    char *end;

    for (ptr = data_types; ptr->tag; ptr++)
    {
1355
        if (strncmp( ptr->tag, buffer, ptr->len )) continue;
1356 1357 1358 1359
        *parse_type = ptr->parse_type;
        if ((*type = ptr->type) != -1) return ptr->len;
        /* "hex(xx):" is special */
        *type = (int)strtoul( buffer + 4, &end, 16 );
1360
        if ((end <= buffer) || strncmp( end, "):", 2 )) return 0;
1361 1362 1363 1364 1365 1366
        return end + 2 - buffer;
    }
    return 0;
}

/* load and create a key from the input file */
1367 1368
static struct key *load_key( struct key *base, const char *buffer, int prefix_len,
                             struct file_load_info *info, timeout_t *modif )
1369
{
1370 1371
    WCHAR *p;
    struct unicode_str name;
1372 1373
    int res;
    unsigned int mod;
1374
    data_size_t len;
1375

1376
    if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1377

1378
    len = info->tmplen;
1379
    if ((res = parse_strW( info->tmp, &len, buffer, ']' )) == -1)
1380 1381 1382 1383
    {
        file_read_error( "Malformed key", info );
        return NULL;
    }
1384
    if (sscanf( buffer + res, " %u", &mod ) == 1)
1385 1386 1387
        *modif = (timeout_t)mod * TICKS_PER_SEC + ticks_1601_to_1970;
    else
        *modif = current_time;
1388

1389
    p = info->tmp;
1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401
    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 );
    }
1402 1403
    name.str = p;
    name.len = len - (p - info->tmp + 1) * sizeof(WCHAR);
1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414
    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;
    }
1415 1416
}

1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445
/* 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;
}

1446 1447 1448 1449 1450 1451
/* 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;

1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463
    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 );
    }
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474
    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;
    }
1475
    if (!strncmp( buffer, "#link", 5 )) key->flags |= KEY_SYMLINK;
1476 1477 1478 1479
    /* ignore unknown options */
    return 1;
}

1480
/* parse a comma-separated list of hex digits */
1481
static int parse_hex( unsigned char *dest, data_size_t *len, const char *buffer )
1482 1483
{
    const char *p = buffer;
1484
    data_size_t count = 0;
1485 1486
    char *end;

1487 1488
    while (isxdigit(*p))
    {
1489 1490
        unsigned int val = strtoul( p, &end, 16 );
        if (end == p || val > 0xff) return -1;
1491
        if (count++ >= *len) return -1;  /* dest buffer overflow */
1492 1493 1494
        *dest++ = val;
        p = end;
        while (isspace(*p)) p++;
1495
        if (*p == ',') p++;
1496
        while (isspace(*p)) p++;
1497 1498 1499 1500 1501 1502
    }
    *len = count;
    return p - buffer;
}

/* parse a value name and create the corresponding value */
1503
static struct key_value *parse_value_name( struct key *key, const char *buffer, data_size_t *len,
1504 1505
                                           struct file_load_info *info )
{
1506
    struct key_value *value;
1507 1508
    struct unicode_str name;
    int index;
1509

1510
    if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return NULL;
1511
    name.str = info->tmp;
1512
    name.len = info->tmplen;
1513 1514
    if (buffer[0] == '@')
    {
1515
        name.len = 0;
1516 1517 1518 1519
        *len = 1;
    }
    else
    {
1520
        int r = parse_strW( info->tmp, &name.len, buffer + 1, '\"' );
1521 1522
        if (r == -1) goto error;
        *len = r + 1; /* for initial quote */
1523
        name.len -= sizeof(WCHAR);  /* terminating null */
1524
    }
1525
    while (isspace(buffer[*len])) (*len)++;
1526 1527
    if (buffer[*len] != '=') goto error;
    (*len)++;
1528
    while (isspace(buffer[*len])) (*len)++;
1529
    if (!(value = find_value( key, &name, &index ))) value = insert_value( key, &name, index );
1530
    return value;
1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541

 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;
1542
    int res, type, parse_type;
1543
    data_size_t maxlen, len;
1544 1545 1546 1547 1548 1549 1550 1551 1552
    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:
1553 1554
        if (!get_file_tmp_space( info, strlen(buffer) * sizeof(WCHAR) )) return 0;
        len = info->tmplen;
1555
        if ((res = parse_strW( info->tmp, &len, buffer, '\"' )) == -1) goto error;
1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566
        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 (;;)
        {
1567
            maxlen = 1 + strlen(buffer) / 2;  /* at least 2 chars for one hex byte */
1568
            if (!get_file_tmp_space( info, len + maxlen )) return 0;
1569
            if ((res = parse_hex( (unsigned char *)info->tmp + len, &maxlen, buffer )) == -1) goto error;
1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589
            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;

1590
    free( value->data );
1591 1592 1593 1594 1595 1596 1597
    value->data = newptr;
    value->len  = len;
    value->type = type;
    return 1;

 error:
    file_read_error( "Malformed value", info );
1598 1599 1600 1601
    free( value->data );
    value->data = NULL;
    value->len  = 0;
    value->type = REG_NONE;
1602 1603 1604
    return 0;
}

1605 1606 1607 1608 1609 1610
/* 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;
1611
    data_size_t len;
1612

1613
    if (!get_file_tmp_space( info, strlen(name) * sizeof(WCHAR) )) return 0;
1614

1615
    len = info->tmplen;
1616
    if ((res = parse_strW( info->tmp, &len, name, ']' )) == -1)
1617 1618
    {
        file_read_error( "Malformed key", info );
1619
        return 0;
1620
    }
1621
    for (p = info->tmp; *p; p++) if (*p == '\\') break;
1622
    len = (p - info->tmp) * sizeof(WCHAR);
1623
    for (res = 1; key != root_key; res++)
1624
    {
1625
        if (len == key->namelen && !memicmp_strW( info->tmp, key->name, len )) break;
1626 1627
        key = key->parent;
    }
1628
    if (key == root_key) res = 0;  /* no matching name */
1629 1630 1631
    return res;
}

1632
/* load all the keys from the input file */
1633
/* prefix_len is the number of key name prefixes to skip, or -1 for autodetection */
1634
static void load_keys( struct key *key, const char *filename, FILE *f, int prefix_len )
1635 1636 1637
{
    struct key *subkey = NULL;
    struct file_load_info info;
1638
    timeout_t modif = current_time;
1639
    char *p;
1640

1641
    info.filename = filename;
1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655
    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" ))
    {
1656
        set_error( STATUS_NOT_REGISTRY_FILE );
1657 1658 1659 1660 1661
        goto done;
    }

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

 done:
1695 1696 1697 1698 1699
    if (subkey)
    {
        update_key_time( subkey, modif );
        release_object( subkey );
    }
1700 1701 1702 1703 1704
    free( info.buffer );
    free( info.tmp );
}

/* load a part of the registry from a file */
1705
static void load_registry( struct key *key, obj_handle_t handle )
1706
{
1707
    struct file *file;
1708 1709
    int fd;

1710
    if (!(file = get_file_obj( current->process, handle, FILE_READ_DATA ))) return;
1711 1712
    fd = dup( get_file_unix_fd( file ) );
    release_object( file );
1713 1714 1715 1716 1717
    if (fd != -1)
    {
        FILE *f = fdopen( fd, "r" );
        if (f)
        {
1718
            load_keys( key, NULL, f, -1 );
1719 1720 1721 1722 1723 1724
            fclose( f );
        }
        else file_set_error();
    }
}

1725
/* load one of the initial registry files */
1726
static int load_init_registry_from_file( const char *filename, struct key *key )
1727 1728 1729
{
    FILE *f;

1730 1731
    if ((f = fopen( filename, "r" )))
    {
1732
        load_keys( key, filename, f, 0 );
1733 1734
        fclose( f );
        if (get_error() == STATUS_NOT_REGISTRY_FILE)
1735 1736
        {
            fprintf( stderr, "%s is not a valid registry file\n", filename );
1737
            return 1;
1738
        }
1739
    }
1740

1741
    assert( save_branch_count < MAX_SAVE_BRANCH_INFO );
1742

1743 1744
    save_branch_info[save_branch_count].path = filename;
    save_branch_info[save_branch_count++].key = (struct key *)grab_object( key );
1745
    make_object_permanent( &key->obj );
1746
    return (f != NULL);
1747 1748
}

1749
static WCHAR *format_user_registry_path( const SID *sid, struct unicode_str *path )
1750
{
1751
    char buffer[7 + 11 + 11 + 11 * SID_MAX_SUB_AUTHORITIES], *p = buffer;
1752 1753
    unsigned int i;

1754 1755 1756 1757 1758 1759 1760
    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 );
1761 1762
}

1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790
/* 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 */
    }
}

1791 1792 1793
/* registry initialisation */
void init_registry(void)
{
1794 1795
    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' };
1796 1797 1798
    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'};
1799 1800 1801
    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) };
1802
    static const struct unicode_str classes_name = { classes, sizeof(classes) };
1803

1804
    WCHAR *current_user_path;
1805
    struct unicode_str current_user_str;
1806
    struct key *key, *hklm, *hkcu;
1807
    char *p;
1808

1809 1810
    /* switch to the config dir */

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

1813
    /* create the root key */
1814
    root_key = alloc_key( &root_name, current_time );
1815
    assert( root_key );
1816
    make_object_permanent( &root_key->obj );
1817

1818 1819
    /* load system.reg into Registry\Machine */

1820
    if (!(hklm = create_key_recursive( root_key, &HKLM_name, current_time )))
1821 1822
        fatal_error( "could not create Machine registry key\n" );

1823
    if (!load_init_registry_from_file( "system.reg", hklm ))
1824 1825 1826 1827 1828 1829
    {
        if ((p = getenv( "WINEARCH" )) && !strcmp( p, "win32" ))
            prefix_type = PREFIX_32BIT;
        else
            prefix_type = sizeof(void *) > sizeof(int) ? PREFIX_64BIT : PREFIX_32BIT;
    }
1830 1831
    else if (prefix_type == PREFIX_UNKNOWN)
        prefix_type = PREFIX_32BIT;
1832 1833 1834

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

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

1838
    load_init_registry_from_file( "userdef.reg", key );
1839 1840
    release_object( key );

1841 1842
    /* load user.reg into HKEY_CURRENT_USER */

1843
    /* FIXME: match default user in token.c. should get from process token instead */
1844
    current_user_path = format_user_registry_path( security_local_user_sid, &current_user_str );
1845
    if (!current_user_path ||
1846
        !(hkcu = create_key_recursive( root_key, &current_user_str, current_time )))
1847
        fatal_error( "could not create HKEY_CURRENT_USER registry key\n" );
1848
    free( current_user_path );
1849 1850 1851
    load_init_registry_from_file( "user.reg", hkcu );

    /* set the shared flag on Software\Classes\Wow6432Node */
1852
    if (prefix_type == PREFIX_64BIT)
1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863
    {
        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 );
1864 1865 1866

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

1868 1869 1870 1871 1872 1873 1874 1875
    /* 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 );
    }

1876
    /* go back to the server dir */
1877
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
1878 1879
}

1880 1881
/* save a registry branch to a file */
static void save_all_subkeys( struct key *key, FILE *f )
1882
{
1883 1884 1885 1886
    fprintf( f, "WINE REGISTRY Version 2\n" );
    fprintf( f, ";; All keys relative to " );
    dump_path( key, NULL, f );
    fprintf( f, "\n" );
1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897
    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;
    }
1898
    save_subkeys( key, key, f );
1899 1900 1901
}

/* save a registry branch to a file handle */
1902
static void save_registry( struct key *key, obj_handle_t handle )
1903
{
1904
    struct file *file;
1905 1906
    int fd;

1907
    if (!(file = get_file_obj( current->process, handle, FILE_WRITE_DATA ))) return;
1908 1909
    fd = dup( get_file_unix_fd( file ) );
    release_object( file );
1910 1911 1912 1913 1914
    if (fd != -1)
    {
        FILE *f = fdopen( fd, "w" );
        if (f)
        {
1915
            save_all_subkeys( key, f );
1916 1917 1918 1919 1920 1921 1922 1923 1924 1925
            if (fclose( f )) file_set_error();
        }
        else
        {
            file_set_error();
            close( fd );
        }
    }
}

1926 1927 1928
/* save a registry branch to a file */
static int save_branch( struct key *key, const char *path )
{
1929
    struct stat st;
1930 1931
    char *p, *tmp = NULL;
    int fd, count = 0, ret = 0;
1932 1933
    FILE *f;

1934 1935 1936 1937 1938 1939
    if (!(key->flags & KEY_DIRTY))
    {
        if (debug_level > 1) dump_operation( key, NULL, "Not saving clean" );
        return 1;
    }

1940 1941 1942 1943
    /* test the file type */

    if ((fd = open( path, O_WRONLY )) != -1)
    {
1944 1945
        /* 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 */
1946
        if (!lstat( path, &st ) && (!S_ISREG(st.st_mode) || st.st_nlink > 1))
1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961
        {
            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
1962
        sprintf( p, "reg%lx%04x.tmp", (long) getpid(), count++ );
1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983
        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" );
    }

1984
    save_all_subkeys( key, f );
1985 1986 1987 1988 1989 1990 1991 1992 1993 1994
    ret = !fclose(f);

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

done:
1995
    free( tmp );
1996
    if (ret) make_clean( key );
1997 1998 1999 2000 2001 2002 2003
    return ret;
}

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

2005
    if (fchdir( config_dir_fd ) == -1) return;
2006
    save_timeout_user = NULL;
2007 2008
    for (i = 0; i < save_branch_count; i++)
        save_branch( save_branch_info[i].key, save_branch_info[i].path );
2009
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2010 2011 2012 2013 2014 2015 2016
    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 );
2017
    save_timeout_user = add_timeout_user( save_period, periodic_save, NULL );
2018 2019
}

2020 2021
/* save the modified registry branches to disk */
void flush_registry(void)
2022 2023 2024
{
    int i;

2025
    if (fchdir( config_dir_fd ) == -1) return;
2026 2027 2028 2029 2030 2031 2032 2033 2034
    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( " " );
        }
    }
2035
    if (fchdir( server_dir_fd ) == -1) fatal_error( "chdir to server dir: %s\n", strerror( errno ));
2036 2037
}

2038 2039 2040 2041 2042 2043
/* 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));
}

2044

2045 2046 2047
/* create a registry key */
DECL_HANDLER(create_key)
{
2048
    struct key *key = NULL, *parent;
2049
    struct unicode_str name, class;
2050
    unsigned int access = req->access;
2051
    const struct security_descriptor *sd;
2052
    const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2053 2054

    if (!objattr) return;
2055

2056 2057
    if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;

2058 2059
    class.str = get_req_data_after_objattr( objattr, &class.len );
    class.len = (class.len / sizeof(WCHAR)) * sizeof(WCHAR);
2060

2061
    if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2062
        !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2063
    {
2064
        name.str += ARRAY_SIZE( root_name );
2065
        name.len -= sizeof(root_name);
2066 2067
    }

2068
    /* NOTE: no access rights are required from the parent handle to create a key */
2069
    if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2070
    {
2071
        if ((key = create_key( parent, &name, &class, req->options, access,
2072
                               objattr->attributes, sd, &reply->created )))
2073
        {
2074
            reply->hkey = alloc_handle( current->process, key, access, objattr->attributes );
2075 2076
            release_object( key );
        }
2077 2078 2079 2080 2081 2082 2083 2084
        release_object( parent );
    }
}

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

2088 2089
    if (!is_wow64_thread( current )) access = (access & ~KEY_WOW64_32KEY) | KEY_WOW64_64KEY;

2090
    reply->hkey = 0;
2091
    /* NOTE: no access rights are required to open the parent key, only the child key */
2092
    if ((parent = get_parent_hkey_obj( req->parent )))
2093
    {
2094
        get_req_path( &name, !req->parent );
2095
        if ((key = open_key( parent, &name, access, req->attributes )))
2096
        {
2097
            reply->hkey = alloc_handle( current->process, key, access, req->attributes );
2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108
            release_object( key );
        }
        release_object( parent );
    }
}

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

2109
    if ((key = get_hkey_obj( req->hkey, DELETE )))
2110
    {
2111
        delete_key( key, 0);
2112 2113 2114 2115
        release_object( key );
    }
}

2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126
/* 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 );
    }
}

2127 2128 2129 2130 2131
/* enumerate registry subkeys */
DECL_HANDLER(enum_key)
{
    struct key *key;

2132 2133
    if ((key = get_hkey_obj( req->hkey,
                             req->index == -1 ? KEY_QUERY_VALUE : KEY_ENUMERATE_SUB_KEYS )))
2134
    {
2135
        enum_key( key, req->index, req->info_class, reply );
2136 2137 2138 2139 2140 2141 2142 2143
        release_object( key );
    }
}

/* set a value of a registry key */
DECL_HANDLER(set_key_value)
{
    struct key *key;
2144 2145 2146 2147 2148 2149 2150 2151 2152
    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);
2153

2154 2155
    if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
    {
2156
        data_size_t datalen = get_req_data_size() - req->namelen;
Eric Pouech's avatar
Eric Pouech committed
2157
        const char *data = (const char *)get_req_data() + req->namelen;
2158

2159
        set_value( key, &name, req->type, data, datalen );
2160 2161 2162 2163 2164 2165 2166 2167
        release_object( key );
    }
}

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

2170
    reply->total = 0;
2171 2172
    if ((key = get_hkey_obj( req->hkey, KEY_QUERY_VALUE )))
    {
2173
        get_value( key, &name, &reply->type, &reply->total );
2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184
        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 )))
    {
2185
        enum_value( key, req->index, req->info_class, reply );
2186 2187 2188 2189 2190 2191 2192 2193
        release_object( key );
    }
}

/* delete a value of a registry key */
DECL_HANDLER(delete_key_value)
{
    struct key *key;
2194
    struct unicode_str name = get_req_unicode_str();
2195 2196 2197

    if ((key = get_hkey_obj( req->hkey, KEY_SET_VALUE )))
    {
2198
        delete_value( key, &name );
2199 2200 2201 2202 2203 2204 2205
        release_object( key );
    }
}

/* load a registry branch from a file */
DECL_HANDLER(load_registry)
{
James Hawkins's avatar
James Hawkins committed
2206
    struct key *key, *parent;
2207
    struct unicode_str name;
2208
    const struct security_descriptor *sd;
2209
    const struct object_attributes *objattr = get_req_object_attributes( &sd, &name, NULL );
2210

2211 2212
    if (!objattr) return;

2213
    if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2214 2215 2216 2217 2218
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }

2219
    if (!objattr->rootdir && name.len >= sizeof(root_name) &&
2220
        !memicmp_strW( name.str, root_name, sizeof(root_name) ))
2221
    {
2222
        name.str += ARRAY_SIZE( root_name );
2223 2224 2225 2226
        name.len -= sizeof(root_name);
    }

    if ((parent = get_parent_hkey_obj( objattr->rootdir )))
2227
    {
James Hawkins's avatar
James Hawkins committed
2228
        int dummy;
2229
        if ((key = create_key( parent, &name, NULL, 0, KEY_WOW64_64KEY, 0, sd, &dummy )))
James Hawkins's avatar
James Hawkins committed
2230 2231 2232 2233 2234
        {
            load_registry( key, req->file );
            release_object( key );
        }
        release_object( parent );
2235 2236 2237
    }
}

2238 2239 2240
DECL_HANDLER(unload_registry)
{
    struct key *key;
2241

2242
    if (!thread_single_check_privilege( current, &SeRestorePrivilege ))
2243 2244 2245 2246
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }
2247 2248 2249 2250 2251 2252 2253 2254

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

2255 2256 2257 2258 2259
/* save a registry branch to a file */
DECL_HANDLER(save_registry)
{
    struct key *key;

2260 2261 2262 2263 2264 2265 2266
    if (!thread_single_check_privilege( current, &SeBackupPrivilege ))
    {
        set_error( STATUS_PRIVILEGE_NOT_HELD );
        return;
    }

    if ((key = get_hkey_obj( req->hkey, 0 )))
2267 2268 2269 2270 2271 2272
    {
        save_registry( key, req->file );
        release_object( key );
    }
}

2273 2274 2275 2276 2277 2278 2279 2280
/* 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 );
2281
    if (key)
2282 2283
    {
        event = get_event_obj( current->process, req->event, SYNCHRONIZE );
2284
        if (event)
2285
        {
2286
            notify = find_notify( key, current->process, req->hkey );
2287
            if (notify)
2288
            {
2289 2290
                if (notify->event)
                    release_object( notify->event );
2291 2292 2293 2294 2295
                grab_object( event );
                notify->event = event;
            }
            else
            {
2296
                notify = mem_alloc( sizeof(*notify) );
2297
                if (notify)
2298 2299 2300 2301 2302 2303
                {
                    grab_object( event );
                    notify->event   = event;
                    notify->subtree = req->subtree;
                    notify->filter  = req->filter;
                    notify->hkey    = req->hkey;
2304
                    notify->process = current->process;
2305
                    list_add_head( &key->notify_list, &notify->entry );
2306 2307
                }
            }
2308
            if (notify)
2309 2310
            {
                reset_event( event );
2311
                set_error( STATUS_PENDING );
2312
            }
2313 2314 2315 2316 2317
            release_object( event );
        }
        release_object( key );
    }
}