[30] | 1 | /* |
---|
[169] | 2 | * Copyright (C) 2005-2010 Timothy D. Morgan |
---|
[30] | 3 | * Copyright (C) 2005 Gerald (Jerry) Carter |
---|
| 4 | * |
---|
| 5 | * This program is free software; you can redistribute it and/or modify |
---|
| 6 | * it under the terms of the GNU General Public License as published by |
---|
[111] | 7 | * the Free Software Foundation; version 3 of the License. |
---|
[30] | 8 | * |
---|
| 9 | * This program is distributed in the hope that it will be useful, |
---|
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 12 | * GNU General Public License for more details. |
---|
| 13 | * |
---|
| 14 | * You should have received a copy of the GNU General Public License |
---|
| 15 | * along with this program; if not, write to the Free Software |
---|
[161] | 16 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
---|
[30] | 17 | * |
---|
| 18 | * $Id: regfi.c 250 2011-05-05 04:00:24Z tim $ |
---|
| 19 | */ |
---|
| 20 | |
---|
[169] | 21 | /** |
---|
| 22 | * @file |
---|
| 23 | * |
---|
| 24 | * Windows NT (and later) read-only registry library |
---|
| 25 | * |
---|
| 26 | * See @ref regfi.h for more information. |
---|
| 27 | * |
---|
| 28 | * Branched from Samba project Subversion repository, version #7470: |
---|
| 29 | * http://viewcvs.samba.org/cgi-bin/viewcvs.cgi/trunk/source/registry/regfio.c?rev=7470&view=auto |
---|
| 30 | * |
---|
| 31 | * Since then, it has been heavily rewritten, simplified, and improved. |
---|
| 32 | */ |
---|
[168] | 33 | |
---|
[147] | 34 | #include "regfi.h" |
---|
[30] | 35 | |
---|
[233] | 36 | /* Library version can be overridden at build time */ |
---|
| 37 | #ifndef REGFI_VERSION |
---|
| 38 | #define REGFI_VERSION "trunk" |
---|
| 39 | #endif |
---|
[30] | 40 | |
---|
[233] | 41 | |
---|
[32] | 42 | /* Registry types mapping */ |
---|
[78] | 43 | const unsigned int regfi_num_reg_types = 12; |
---|
| 44 | static const char* regfi_type_names[] = |
---|
[65] | 45 | {"NONE", "SZ", "EXPAND_SZ", "BINARY", "DWORD", "DWORD_BE", "LINK", |
---|
[72] | 46 | "MULTI_SZ", "RSRC_LIST", "RSRC_DESC", "RSRC_REQ_LIST", "QWORD"}; |
---|
[30] | 47 | |
---|
[161] | 48 | const char* regfi_encoding_names[] = |
---|
| 49 | {"US-ASCII//TRANSLIT", "UTF-8//TRANSLIT", "UTF-16LE//TRANSLIT"}; |
---|
[32] | 50 | |
---|
[135] | 51 | |
---|
[185] | 52 | /* Ensures regfi_init runs only once */ |
---|
| 53 | static pthread_once_t regfi_init_once = PTHREAD_ONCE_INIT; |
---|
[182] | 54 | |
---|
[185] | 55 | |
---|
[233] | 56 | /****************************************************************************** |
---|
| 57 | ******************************************************************************/ |
---|
| 58 | const char* regfi_version() |
---|
| 59 | { |
---|
| 60 | return REGFI_VERSION; |
---|
| 61 | } |
---|
[185] | 62 | |
---|
[233] | 63 | |
---|
[135] | 64 | /****************************************************************************** |
---|
| 65 | ******************************************************************************/ |
---|
[185] | 66 | void regfi_log_free(void* ptr) |
---|
[135] | 67 | { |
---|
[185] | 68 | REGFI_LOG* log_info = (REGFI_LOG*)ptr; |
---|
| 69 | |
---|
| 70 | if(log_info->messages != NULL) |
---|
| 71 | free(log_info->messages); |
---|
| 72 | |
---|
| 73 | talloc_free(log_info); |
---|
| 74 | } |
---|
| 75 | |
---|
| 76 | |
---|
| 77 | /****************************************************************************** |
---|
| 78 | ******************************************************************************/ |
---|
| 79 | void regfi_init() |
---|
| 80 | { |
---|
| 81 | int err; |
---|
| 82 | if((err = pthread_key_create(®fi_log_key, regfi_log_free)) != 0) |
---|
| 83 | fprintf(stderr, "ERROR: key_create: %s\n", strerror(err)); |
---|
| 84 | errno = err; |
---|
| 85 | } |
---|
| 86 | |
---|
| 87 | |
---|
| 88 | /****************************************************************************** |
---|
| 89 | ******************************************************************************/ |
---|
| 90 | REGFI_LOG* regfi_log_new() |
---|
| 91 | { |
---|
| 92 | int err; |
---|
[182] | 93 | REGFI_LOG* log_info = talloc(NULL, REGFI_LOG); |
---|
| 94 | if(log_info == NULL) |
---|
[185] | 95 | return NULL; |
---|
[182] | 96 | |
---|
[185] | 97 | log_info->msg_mask = REGFI_DEFAULT_LOG_MASK; |
---|
[182] | 98 | log_info->messages = NULL; |
---|
| 99 | |
---|
[185] | 100 | pthread_once(®fi_init_once, regfi_init); |
---|
[182] | 101 | |
---|
[185] | 102 | if((err = pthread_setspecific(regfi_log_key, log_info)) != 0) |
---|
[182] | 103 | { |
---|
[185] | 104 | fprintf(stderr, "ERROR: setspecific: %s\n", strerror(err)); |
---|
[182] | 105 | goto fail; |
---|
| 106 | } |
---|
| 107 | |
---|
[185] | 108 | return log_info; |
---|
[182] | 109 | |
---|
| 110 | fail: |
---|
| 111 | talloc_free(log_info); |
---|
[185] | 112 | errno = err; |
---|
| 113 | return NULL; |
---|
[182] | 114 | } |
---|
| 115 | |
---|
| 116 | |
---|
| 117 | /****************************************************************************** |
---|
| 118 | ******************************************************************************/ |
---|
| 119 | void regfi_log_add(uint16_t msg_type, const char* fmt, ...) |
---|
| 120 | { |
---|
| 121 | /* XXX: Switch internal storage over to a linked list or stack. |
---|
| 122 | * Then add a regfi_log_get function that returns the list in some |
---|
| 123 | * convenient, user-friendly data structure. regfi_log_get_str should |
---|
| 124 | * stick around and will simply smush the list into a big string when |
---|
| 125 | * it's called, rather than having messages smushed when they're first |
---|
| 126 | * written to the log. |
---|
[135] | 127 | */ |
---|
[168] | 128 | uint32_t buf_size, buf_used; |
---|
[136] | 129 | char* new_msg; |
---|
[182] | 130 | REGFI_LOG* log_info; |
---|
[136] | 131 | va_list args; |
---|
[135] | 132 | |
---|
[185] | 133 | log_info = (REGFI_LOG*)pthread_getspecific(regfi_log_key); |
---|
| 134 | if(log_info == NULL && (log_info = regfi_log_new()) == NULL) |
---|
[182] | 135 | return; |
---|
| 136 | |
---|
[185] | 137 | if((log_info->msg_mask & msg_type) == 0) |
---|
| 138 | return; |
---|
| 139 | |
---|
[182] | 140 | if(log_info->messages == NULL) |
---|
| 141 | buf_used = 0; |
---|
| 142 | else |
---|
| 143 | buf_used = strlen(log_info->messages); |
---|
| 144 | |
---|
| 145 | buf_size = buf_used+strlen(fmt)+160; |
---|
| 146 | new_msg = realloc(log_info->messages, buf_size); |
---|
| 147 | if(new_msg == NULL) |
---|
| 148 | /* XXX: should we report this? */ |
---|
| 149 | return; |
---|
| 150 | |
---|
| 151 | switch (msg_type) |
---|
[138] | 152 | { |
---|
[182] | 153 | case REGFI_LOG_INFO: |
---|
| 154 | strcpy(new_msg+buf_used, "INFO: "); |
---|
| 155 | buf_used += 6; |
---|
| 156 | break; |
---|
| 157 | case REGFI_LOG_WARN: |
---|
| 158 | strcpy(new_msg+buf_used, "WARN: "); |
---|
| 159 | buf_used += 6; |
---|
| 160 | break; |
---|
| 161 | case REGFI_LOG_ERROR: |
---|
| 162 | strcpy(new_msg+buf_used, "ERROR: "); |
---|
| 163 | buf_used += 7; |
---|
| 164 | break; |
---|
[138] | 165 | } |
---|
[182] | 166 | |
---|
| 167 | va_start(args, fmt); |
---|
| 168 | vsnprintf(new_msg+buf_used, buf_size-buf_used, fmt, args); |
---|
| 169 | va_end(args); |
---|
| 170 | strncat(new_msg, "\n", buf_size-1); |
---|
| 171 | |
---|
| 172 | log_info->messages = new_msg; |
---|
[135] | 173 | } |
---|
| 174 | |
---|
| 175 | |
---|
| 176 | /****************************************************************************** |
---|
| 177 | ******************************************************************************/ |
---|
[182] | 178 | char* regfi_log_get_str() |
---|
[135] | 179 | { |
---|
[182] | 180 | char* ret_val; |
---|
[185] | 181 | REGFI_LOG* log_info = (REGFI_LOG*)pthread_getspecific(regfi_log_key); |
---|
| 182 | if(log_info == NULL && (log_info = regfi_log_new()) == NULL) |
---|
[182] | 183 | return NULL; |
---|
[185] | 184 | |
---|
[182] | 185 | ret_val = log_info->messages; |
---|
| 186 | log_info->messages = NULL; |
---|
| 187 | |
---|
[135] | 188 | return ret_val; |
---|
| 189 | } |
---|
| 190 | |
---|
| 191 | |
---|
[182] | 192 | /****************************************************************************** |
---|
| 193 | ******************************************************************************/ |
---|
[185] | 194 | bool regfi_log_set_mask(uint16_t msg_mask) |
---|
[138] | 195 | { |
---|
[185] | 196 | REGFI_LOG* log_info = (REGFI_LOG*)pthread_getspecific(regfi_log_key); |
---|
| 197 | if(log_info == NULL && (log_info = regfi_log_new()) == NULL) |
---|
| 198 | { |
---|
| 199 | return false; |
---|
| 200 | } |
---|
[182] | 201 | |
---|
| 202 | log_info->msg_mask = msg_mask; |
---|
[185] | 203 | return true; |
---|
[138] | 204 | } |
---|
| 205 | |
---|
| 206 | |
---|
[161] | 207 | /****************************************************************************** |
---|
| 208 | * Returns NULL for an invalid e |
---|
| 209 | *****************************************************************************/ |
---|
| 210 | static const char* regfi_encoding_int2str(REGFI_ENCODING e) |
---|
| 211 | { |
---|
| 212 | if(e < REGFI_NUM_ENCODINGS) |
---|
| 213 | return regfi_encoding_names[e]; |
---|
| 214 | |
---|
| 215 | return NULL; |
---|
| 216 | } |
---|
| 217 | |
---|
| 218 | |
---|
| 219 | /****************************************************************************** |
---|
| 220 | * Returns NULL for an invalid val |
---|
| 221 | *****************************************************************************/ |
---|
[78] | 222 | const char* regfi_type_val2str(unsigned int val) |
---|
[32] | 223 | { |
---|
[61] | 224 | if(val == REG_KEY) |
---|
| 225 | return "KEY"; |
---|
| 226 | |
---|
[78] | 227 | if(val >= regfi_num_reg_types) |
---|
[61] | 228 | return NULL; |
---|
| 229 | |
---|
[78] | 230 | return regfi_type_names[val]; |
---|
[32] | 231 | } |
---|
| 232 | |
---|
| 233 | |
---|
[161] | 234 | /****************************************************************************** |
---|
| 235 | * Returns -1 on error |
---|
| 236 | *****************************************************************************/ |
---|
[78] | 237 | int regfi_type_str2val(const char* str) |
---|
[32] | 238 | { |
---|
| 239 | int i; |
---|
| 240 | |
---|
[61] | 241 | if(strcmp("KEY", str) == 0) |
---|
| 242 | return REG_KEY; |
---|
[32] | 243 | |
---|
[78] | 244 | for(i=0; i < regfi_num_reg_types; i++) |
---|
| 245 | if (strcmp(regfi_type_names[i], str) == 0) |
---|
[61] | 246 | return i; |
---|
| 247 | |
---|
| 248 | if(strcmp("DWORD_LE", str) == 0) |
---|
| 249 | return REG_DWORD_LE; |
---|
| 250 | |
---|
| 251 | return -1; |
---|
[32] | 252 | } |
---|
| 253 | |
---|
| 254 | |
---|
[135] | 255 | /* Security descriptor formatting functions */ |
---|
[53] | 256 | |
---|
[168] | 257 | const char* regfi_ace_type2str(uint8_t type) |
---|
[53] | 258 | { |
---|
| 259 | static const char* map[7] |
---|
| 260 | = {"ALLOW", "DENY", "AUDIT", "ALARM", |
---|
| 261 | "ALLOW CPD", "OBJ ALLOW", "OBJ DENY"}; |
---|
| 262 | if(type < 7) |
---|
| 263 | return map[type]; |
---|
| 264 | else |
---|
| 265 | /* XXX: would be nice to return the unknown integer value. |
---|
| 266 | * However, as it is a const string, it can't be free()ed later on, |
---|
| 267 | * so that would need to change. |
---|
| 268 | */ |
---|
| 269 | return "UNKNOWN"; |
---|
| 270 | } |
---|
| 271 | |
---|
| 272 | |
---|
[76] | 273 | /* XXX: need a better reference on the meaning of each flag. */ |
---|
| 274 | /* For more info, see: |
---|
| 275 | * http://msdn2.microsoft.com/en-us/library/aa772242.aspx |
---|
| 276 | */ |
---|
[168] | 277 | char* regfi_ace_flags2str(uint8_t flags) |
---|
[53] | 278 | { |
---|
[76] | 279 | static const char* flag_map[32] = |
---|
[87] | 280 | { "OI", /* Object Inherit */ |
---|
| 281 | "CI", /* Container Inherit */ |
---|
| 282 | "NP", /* Non-Propagate */ |
---|
| 283 | "IO", /* Inherit Only */ |
---|
| 284 | "IA", /* Inherited ACE */ |
---|
[76] | 285 | NULL, |
---|
| 286 | NULL, |
---|
| 287 | NULL, |
---|
| 288 | }; |
---|
[53] | 289 | |
---|
[76] | 290 | char* ret_val = malloc(35*sizeof(char)); |
---|
| 291 | char* fo = ret_val; |
---|
[168] | 292 | uint32_t i; |
---|
| 293 | uint8_t f; |
---|
[76] | 294 | |
---|
| 295 | if(ret_val == NULL) |
---|
[53] | 296 | return NULL; |
---|
| 297 | |
---|
[76] | 298 | fo[0] = '\0'; |
---|
[53] | 299 | if (!flags) |
---|
[76] | 300 | return ret_val; |
---|
[53] | 301 | |
---|
[76] | 302 | for(i=0; i < 8; i++) |
---|
| 303 | { |
---|
| 304 | f = (1<<i); |
---|
| 305 | if((flags & f) && (flag_map[i] != NULL)) |
---|
| 306 | { |
---|
| 307 | strcpy(fo, flag_map[i]); |
---|
| 308 | fo += strlen(flag_map[i]); |
---|
| 309 | *(fo++) = ' '; |
---|
| 310 | flags ^= f; |
---|
| 311 | } |
---|
[53] | 312 | } |
---|
[76] | 313 | |
---|
| 314 | /* Any remaining unknown flags are added at the end in hex. */ |
---|
| 315 | if(flags != 0) |
---|
| 316 | sprintf(fo, "0x%.2X ", flags); |
---|
| 317 | |
---|
| 318 | /* Chop off the last space if we've written anything to ret_val */ |
---|
| 319 | if(fo != ret_val) |
---|
| 320 | fo[-1] = '\0'; |
---|
| 321 | |
---|
| 322 | return ret_val; |
---|
[53] | 323 | } |
---|
| 324 | |
---|
| 325 | |
---|
[168] | 326 | char* regfi_ace_perms2str(uint32_t perms) |
---|
[53] | 327 | { |
---|
[168] | 328 | uint32_t i, p; |
---|
[76] | 329 | /* This is more than is needed by a fair margin. */ |
---|
| 330 | char* ret_val = malloc(350*sizeof(char)); |
---|
| 331 | char* r = ret_val; |
---|
| 332 | |
---|
| 333 | /* Each represents one of 32 permissions bits. NULL is for undefined/reserved bits. |
---|
| 334 | * For more information, see: |
---|
| 335 | * http://msdn2.microsoft.com/en-gb/library/aa374892.aspx |
---|
| 336 | * http://msdn2.microsoft.com/en-gb/library/ms724878.aspx |
---|
| 337 | */ |
---|
| 338 | static const char* perm_map[32] = |
---|
| 339 | {/* object-specific permissions (registry keys, in this case) */ |
---|
| 340 | "QRY_VAL", /* KEY_QUERY_VALUE */ |
---|
| 341 | "SET_VAL", /* KEY_SET_VALUE */ |
---|
| 342 | "CREATE_KEY", /* KEY_CREATE_SUB_KEY */ |
---|
| 343 | "ENUM_KEYS", /* KEY_ENUMERATE_SUB_KEYS */ |
---|
| 344 | "NOTIFY", /* KEY_NOTIFY */ |
---|
| 345 | "CREATE_LNK", /* KEY_CREATE_LINK - Reserved for system use. */ |
---|
| 346 | NULL, |
---|
| 347 | NULL, |
---|
| 348 | "WOW64_64", /* KEY_WOW64_64KEY */ |
---|
| 349 | "WOW64_32", /* KEY_WOW64_32KEY */ |
---|
| 350 | NULL, |
---|
| 351 | NULL, |
---|
| 352 | NULL, |
---|
| 353 | NULL, |
---|
| 354 | NULL, |
---|
| 355 | NULL, |
---|
| 356 | /* standard access rights */ |
---|
| 357 | "DELETE", /* DELETE */ |
---|
| 358 | "R_CONT", /* READ_CONTROL */ |
---|
| 359 | "W_DAC", /* WRITE_DAC */ |
---|
| 360 | "W_OWNER", /* WRITE_OWNER */ |
---|
| 361 | "SYNC", /* SYNCHRONIZE - Shouldn't be set in registries */ |
---|
| 362 | NULL, |
---|
| 363 | NULL, |
---|
| 364 | NULL, |
---|
| 365 | /* other generic */ |
---|
| 366 | "SYS_SEC", /* ACCESS_SYSTEM_SECURITY */ |
---|
| 367 | "MAX_ALLWD", /* MAXIMUM_ALLOWED */ |
---|
| 368 | NULL, |
---|
| 369 | NULL, |
---|
| 370 | "GEN_A", /* GENERIC_ALL */ |
---|
| 371 | "GEN_X", /* GENERIC_EXECUTE */ |
---|
| 372 | "GEN_W", /* GENERIC_WRITE */ |
---|
| 373 | "GEN_R", /* GENERIC_READ */ |
---|
| 374 | }; |
---|
| 375 | |
---|
| 376 | |
---|
[53] | 377 | if(ret_val == NULL) |
---|
| 378 | return NULL; |
---|
| 379 | |
---|
[76] | 380 | r[0] = '\0'; |
---|
| 381 | for(i=0; i < 32; i++) |
---|
| 382 | { |
---|
| 383 | p = (1<<i); |
---|
| 384 | if((perms & p) && (perm_map[i] != NULL)) |
---|
| 385 | { |
---|
| 386 | strcpy(r, perm_map[i]); |
---|
| 387 | r += strlen(perm_map[i]); |
---|
| 388 | *(r++) = ' '; |
---|
| 389 | perms ^= p; |
---|
| 390 | } |
---|
| 391 | } |
---|
| 392 | |
---|
| 393 | /* Any remaining unknown permission bits are added at the end in hex. */ |
---|
| 394 | if(perms != 0) |
---|
| 395 | sprintf(r, "0x%.8X ", perms); |
---|
[53] | 396 | |
---|
[76] | 397 | /* Chop off the last space if we've written anything to ret_val */ |
---|
| 398 | if(r != ret_val) |
---|
| 399 | r[-1] = '\0'; |
---|
| 400 | |
---|
[53] | 401 | return ret_val; |
---|
| 402 | } |
---|
| 403 | |
---|
| 404 | |
---|
[134] | 405 | char* regfi_sid2str(WINSEC_DOM_SID* sid) |
---|
[53] | 406 | { |
---|
[168] | 407 | uint32_t i, size = WINSEC_MAX_SUBAUTHS*11 + 24; |
---|
| 408 | uint32_t left = size; |
---|
| 409 | uint8_t comps = sid->num_auths; |
---|
[53] | 410 | char* ret_val = malloc(size); |
---|
| 411 | |
---|
| 412 | if(ret_val == NULL) |
---|
| 413 | return NULL; |
---|
| 414 | |
---|
[134] | 415 | if(comps > WINSEC_MAX_SUBAUTHS) |
---|
| 416 | comps = WINSEC_MAX_SUBAUTHS; |
---|
[53] | 417 | |
---|
| 418 | left -= sprintf(ret_val, "S-%u-%u", sid->sid_rev_num, sid->id_auth[5]); |
---|
| 419 | |
---|
| 420 | for (i = 0; i < comps; i++) |
---|
| 421 | left -= snprintf(ret_val+(size-left), left, "-%u", sid->sub_auths[i]); |
---|
| 422 | |
---|
| 423 | return ret_val; |
---|
| 424 | } |
---|
| 425 | |
---|
| 426 | |
---|
[134] | 427 | char* regfi_get_acl(WINSEC_ACL* acl) |
---|
[53] | 428 | { |
---|
[168] | 429 | uint32_t i, extra, size = 0; |
---|
[53] | 430 | const char* type_str; |
---|
| 431 | char* flags_str; |
---|
| 432 | char* perms_str; |
---|
| 433 | char* sid_str; |
---|
[61] | 434 | char* ace_delim = ""; |
---|
[53] | 435 | char* ret_val = NULL; |
---|
[61] | 436 | char* tmp_val = NULL; |
---|
| 437 | bool failed = false; |
---|
[53] | 438 | char field_delim = ':'; |
---|
| 439 | |
---|
[61] | 440 | for (i = 0; i < acl->num_aces && !failed; i++) |
---|
[53] | 441 | { |
---|
[134] | 442 | sid_str = regfi_sid2str(acl->aces[i]->trustee); |
---|
| 443 | type_str = regfi_ace_type2str(acl->aces[i]->type); |
---|
| 444 | perms_str = regfi_ace_perms2str(acl->aces[i]->access_mask); |
---|
| 445 | flags_str = regfi_ace_flags2str(acl->aces[i]->flags); |
---|
[53] | 446 | |
---|
[61] | 447 | if(flags_str != NULL && perms_str != NULL |
---|
| 448 | && type_str != NULL && sid_str != NULL) |
---|
| 449 | { |
---|
| 450 | /* XXX: this is slow */ |
---|
| 451 | extra = strlen(sid_str) + strlen(type_str) |
---|
[136] | 452 | + strlen(perms_str) + strlen(flags_str) + 5; |
---|
[61] | 453 | tmp_val = realloc(ret_val, size+extra); |
---|
[53] | 454 | |
---|
[61] | 455 | if(tmp_val == NULL) |
---|
| 456 | { |
---|
| 457 | free(ret_val); |
---|
[136] | 458 | ret_val = NULL; |
---|
[61] | 459 | failed = true; |
---|
| 460 | } |
---|
| 461 | else |
---|
| 462 | { |
---|
| 463 | ret_val = tmp_val; |
---|
[148] | 464 | size += sprintf(ret_val+size, "%s%s%c%s%c%s%c%s", |
---|
| 465 | ace_delim,sid_str, |
---|
| 466 | field_delim,type_str, |
---|
| 467 | field_delim,perms_str, |
---|
| 468 | field_delim,flags_str); |
---|
[61] | 469 | ace_delim = "|"; |
---|
| 470 | } |
---|
| 471 | } |
---|
| 472 | else |
---|
| 473 | failed = true; |
---|
| 474 | |
---|
| 475 | if(sid_str != NULL) |
---|
| 476 | free(sid_str); |
---|
| 477 | if(sid_str != NULL) |
---|
| 478 | free(perms_str); |
---|
| 479 | if(sid_str != NULL) |
---|
| 480 | free(flags_str); |
---|
[53] | 481 | } |
---|
| 482 | |
---|
| 483 | return ret_val; |
---|
| 484 | } |
---|
| 485 | |
---|
| 486 | |
---|
[134] | 487 | char* regfi_get_sacl(WINSEC_DESC *sec_desc) |
---|
[53] | 488 | { |
---|
| 489 | if (sec_desc->sacl) |
---|
[78] | 490 | return regfi_get_acl(sec_desc->sacl); |
---|
[53] | 491 | else |
---|
| 492 | return NULL; |
---|
| 493 | } |
---|
| 494 | |
---|
| 495 | |
---|
[134] | 496 | char* regfi_get_dacl(WINSEC_DESC *sec_desc) |
---|
[53] | 497 | { |
---|
| 498 | if (sec_desc->dacl) |
---|
[78] | 499 | return regfi_get_acl(sec_desc->dacl); |
---|
[53] | 500 | else |
---|
| 501 | return NULL; |
---|
| 502 | } |
---|
| 503 | |
---|
| 504 | |
---|
[134] | 505 | char* regfi_get_owner(WINSEC_DESC *sec_desc) |
---|
[53] | 506 | { |
---|
[78] | 507 | return regfi_sid2str(sec_desc->owner_sid); |
---|
[53] | 508 | } |
---|
| 509 | |
---|
| 510 | |
---|
[134] | 511 | char* regfi_get_group(WINSEC_DESC *sec_desc) |
---|
[53] | 512 | { |
---|
[78] | 513 | return regfi_sid2str(sec_desc->grp_sid); |
---|
[53] | 514 | } |
---|
| 515 | |
---|
| 516 | |
---|
[180] | 517 | bool regfi_read_lock(REGFI_FILE* file, pthread_rwlock_t* lock, const char* context) |
---|
| 518 | { |
---|
| 519 | int lock_ret = pthread_rwlock_rdlock(lock); |
---|
| 520 | if(lock_ret != 0) |
---|
| 521 | { |
---|
[182] | 522 | regfi_log_add(REGFI_LOG_ERROR, "Error obtaining read lock in" |
---|
[180] | 523 | "%s due to: %s\n", context, strerror(lock_ret)); |
---|
| 524 | return false; |
---|
| 525 | } |
---|
| 526 | |
---|
| 527 | return true; |
---|
| 528 | } |
---|
| 529 | |
---|
| 530 | |
---|
| 531 | bool regfi_write_lock(REGFI_FILE* file, pthread_rwlock_t* lock, const char* context) |
---|
| 532 | { |
---|
| 533 | int lock_ret = pthread_rwlock_wrlock(lock); |
---|
| 534 | if(lock_ret != 0) |
---|
| 535 | { |
---|
[182] | 536 | regfi_log_add(REGFI_LOG_ERROR, "Error obtaining write lock in" |
---|
[180] | 537 | "%s due to: %s\n", context, strerror(lock_ret)); |
---|
| 538 | return false; |
---|
| 539 | } |
---|
| 540 | |
---|
| 541 | return true; |
---|
| 542 | } |
---|
| 543 | |
---|
| 544 | |
---|
| 545 | bool regfi_rw_unlock(REGFI_FILE* file, pthread_rwlock_t* lock, const char* context) |
---|
| 546 | { |
---|
| 547 | int lock_ret = pthread_rwlock_unlock(lock); |
---|
| 548 | if(lock_ret != 0) |
---|
| 549 | { |
---|
[182] | 550 | regfi_log_add(REGFI_LOG_ERROR, "Error releasing lock in" |
---|
[180] | 551 | "%s due to: %s\n", context, strerror(lock_ret)); |
---|
| 552 | return false; |
---|
| 553 | } |
---|
| 554 | |
---|
| 555 | return true; |
---|
| 556 | } |
---|
| 557 | |
---|
| 558 | |
---|
| 559 | bool regfi_lock(REGFI_FILE* file, pthread_mutex_t* lock, const char* context) |
---|
| 560 | { |
---|
| 561 | int lock_ret = pthread_mutex_lock(lock); |
---|
| 562 | if(lock_ret != 0) |
---|
| 563 | { |
---|
[182] | 564 | regfi_log_add(REGFI_LOG_ERROR, "Error obtaining mutex lock in" |
---|
[180] | 565 | "%s due to: %s\n", context, strerror(lock_ret)); |
---|
| 566 | return false; |
---|
| 567 | } |
---|
| 568 | |
---|
| 569 | return true; |
---|
| 570 | } |
---|
| 571 | |
---|
| 572 | |
---|
| 573 | bool regfi_unlock(REGFI_FILE* file, pthread_mutex_t* lock, const char* context) |
---|
| 574 | { |
---|
| 575 | int lock_ret = pthread_mutex_unlock(lock); |
---|
| 576 | if(lock_ret != 0) |
---|
| 577 | { |
---|
[182] | 578 | regfi_log_add(REGFI_LOG_ERROR, "Error releasing mutex lock in" |
---|
[180] | 579 | "%s due to: %s\n", context, strerror(lock_ret)); |
---|
| 580 | return false; |
---|
| 581 | } |
---|
| 582 | |
---|
| 583 | return true; |
---|
| 584 | } |
---|
| 585 | |
---|
| 586 | |
---|
[226] | 587 | int64_t regfi_raw_seek(REGFI_RAW_FILE* self, uint64_t offset, int whence) |
---|
[178] | 588 | { |
---|
[226] | 589 | if(sizeof(off_t) == 4 && offset > 2147483647) |
---|
| 590 | { |
---|
| 591 | errno = EOVERFLOW; |
---|
| 592 | return -1; |
---|
| 593 | } |
---|
[178] | 594 | return lseek(*(int*)self->state, offset, whence); |
---|
| 595 | } |
---|
| 596 | |
---|
| 597 | ssize_t regfi_raw_read(REGFI_RAW_FILE* self, void* buf, size_t count) |
---|
| 598 | { |
---|
| 599 | return read(*(int*)self->state, buf, count); |
---|
| 600 | } |
---|
| 601 | |
---|
| 602 | |
---|
[101] | 603 | /***************************************************************************** |
---|
[178] | 604 | * Convenience function to wrap up the ugly callback stuff |
---|
| 605 | *****************************************************************************/ |
---|
[226] | 606 | uint64_t regfi_seek(REGFI_RAW_FILE* file_cb, uint64_t offset, int whence) |
---|
[178] | 607 | { |
---|
| 608 | return file_cb->seek(file_cb, offset, whence); |
---|
| 609 | } |
---|
| 610 | |
---|
| 611 | |
---|
| 612 | /***************************************************************************** |
---|
[101] | 613 | * This function is just like read(2), except that it continues to |
---|
| 614 | * re-try reading from the file descriptor if EINTR or EAGAIN is received. |
---|
[178] | 615 | * regfi_read will attempt to read length bytes from the file and write them to |
---|
| 616 | * buf. |
---|
[101] | 617 | * |
---|
| 618 | * On success, 0 is returned. Upon failure, an errno code is returned. |
---|
| 619 | * |
---|
| 620 | * The number of bytes successfully read is returned through the length |
---|
| 621 | * parameter by reference. If both the return value and length parameter are |
---|
| 622 | * returned as 0, then EOF was encountered immediately |
---|
| 623 | *****************************************************************************/ |
---|
[178] | 624 | uint32_t regfi_read(REGFI_RAW_FILE* file_cb, uint8_t* buf, uint32_t* length) |
---|
[101] | 625 | { |
---|
[168] | 626 | uint32_t rsize = 0; |
---|
| 627 | uint32_t rret = 0; |
---|
[101] | 628 | |
---|
| 629 | do |
---|
| 630 | { |
---|
[225] | 631 | rret = file_cb->read(file_cb, |
---|
| 632 | buf + rsize, |
---|
| 633 | *length - rsize); |
---|
[101] | 634 | if(rret > 0) |
---|
| 635 | rsize += rret; |
---|
| 636 | }while(*length - rsize > 0 |
---|
| 637 | && (rret > 0 || (rret == -1 && (errno == EAGAIN || errno == EINTR)))); |
---|
| 638 | |
---|
| 639 | *length = rsize; |
---|
| 640 | if (rret == -1 && errno != EINTR && errno != EAGAIN) |
---|
| 641 | return errno; |
---|
| 642 | |
---|
| 643 | return 0; |
---|
| 644 | } |
---|
| 645 | |
---|
| 646 | |
---|
| 647 | /***************************************************************************** |
---|
| 648 | * |
---|
| 649 | *****************************************************************************/ |
---|
[178] | 650 | bool regfi_parse_cell(REGFI_RAW_FILE* file_cb, uint32_t offset, uint8_t* hdr, |
---|
| 651 | uint32_t hdr_len, uint32_t* cell_length, bool* unalloc) |
---|
[101] | 652 | { |
---|
[168] | 653 | uint32_t length; |
---|
| 654 | int32_t raw_length; |
---|
| 655 | uint8_t tmp[4]; |
---|
[101] | 656 | |
---|
[178] | 657 | if(regfi_seek(file_cb, offset, SEEK_SET) == -1) |
---|
[101] | 658 | return false; |
---|
| 659 | |
---|
| 660 | length = 4; |
---|
[178] | 661 | if((regfi_read(file_cb, tmp, &length) != 0) || length != 4) |
---|
[101] | 662 | return false; |
---|
| 663 | raw_length = IVALS(tmp, 0); |
---|
| 664 | |
---|
| 665 | if(raw_length < 0) |
---|
| 666 | { |
---|
| 667 | (*cell_length) = raw_length*(-1); |
---|
| 668 | (*unalloc) = false; |
---|
| 669 | } |
---|
| 670 | else |
---|
| 671 | { |
---|
| 672 | (*cell_length) = raw_length; |
---|
| 673 | (*unalloc) = true; |
---|
| 674 | } |
---|
| 675 | |
---|
[103] | 676 | if(*cell_length - 4 < hdr_len) |
---|
| 677 | return false; |
---|
| 678 | |
---|
| 679 | if(hdr_len > 0) |
---|
| 680 | { |
---|
| 681 | length = hdr_len; |
---|
[178] | 682 | if((regfi_read(file_cb, hdr, &length) != 0) || length != hdr_len) |
---|
[103] | 683 | return false; |
---|
| 684 | } |
---|
| 685 | |
---|
[101] | 686 | return true; |
---|
| 687 | } |
---|
| 688 | |
---|
| 689 | |
---|
[157] | 690 | /****************************************************************************** |
---|
[106] | 691 | * Given an offset and an hbin, is the offset within that hbin? |
---|
| 692 | * The offset is a virtual file offset. |
---|
[157] | 693 | ******************************************************************************/ |
---|
[168] | 694 | static bool regfi_offset_in_hbin(const REGFI_HBIN* hbin, uint32_t voffset) |
---|
[30] | 695 | { |
---|
[106] | 696 | if(!hbin) |
---|
[31] | 697 | return false; |
---|
[106] | 698 | |
---|
[145] | 699 | if((voffset > hbin->first_hbin_off) |
---|
| 700 | && (voffset < (hbin->first_hbin_off + hbin->block_size))) |
---|
[31] | 701 | return true; |
---|
[30] | 702 | |
---|
[31] | 703 | return false; |
---|
[30] | 704 | } |
---|
| 705 | |
---|
| 706 | |
---|
[106] | 707 | |
---|
[157] | 708 | /****************************************************************************** |
---|
| 709 | * Provide a physical offset and receive the correpsonding HBIN |
---|
[106] | 710 | * block for it. NULL if one doesn't exist. |
---|
[157] | 711 | ******************************************************************************/ |
---|
[168] | 712 | const REGFI_HBIN* regfi_lookup_hbin(REGFI_FILE* file, uint32_t offset) |
---|
[30] | 713 | { |
---|
[157] | 714 | return (const REGFI_HBIN*)range_list_find_data(file->hbins, offset); |
---|
[30] | 715 | } |
---|
| 716 | |
---|
| 717 | |
---|
[157] | 718 | /****************************************************************************** |
---|
| 719 | * Calculate the largest possible cell size given a physical offset. |
---|
| 720 | * Largest size is based on the HBIN the offset is currently a member of. |
---|
| 721 | * Returns negative values on error. |
---|
| 722 | * (Since cells can only be ~2^31 in size, this works out.) |
---|
| 723 | ******************************************************************************/ |
---|
[168] | 724 | int32_t regfi_calc_maxsize(REGFI_FILE* file, uint32_t offset) |
---|
[157] | 725 | { |
---|
| 726 | const REGFI_HBIN* hbin = regfi_lookup_hbin(file, offset); |
---|
| 727 | if(hbin == NULL) |
---|
| 728 | return -1; |
---|
[139] | 729 | |
---|
[157] | 730 | return (hbin->block_size + hbin->file_off) - offset; |
---|
| 731 | } |
---|
| 732 | |
---|
| 733 | |
---|
[139] | 734 | /****************************************************************************** |
---|
| 735 | ******************************************************************************/ |
---|
[168] | 736 | REGFI_SUBKEY_LIST* regfi_load_subkeylist(REGFI_FILE* file, uint32_t offset, |
---|
| 737 | uint32_t num_keys, uint32_t max_size, |
---|
[139] | 738 | bool strict) |
---|
[127] | 739 | { |
---|
[135] | 740 | REGFI_SUBKEY_LIST* ret_val; |
---|
[134] | 741 | |
---|
[139] | 742 | ret_val = regfi_load_subkeylist_aux(file, offset, max_size, strict, |
---|
| 743 | REGFI_MAX_SUBKEY_DEPTH); |
---|
[143] | 744 | if(ret_val == NULL) |
---|
| 745 | { |
---|
[182] | 746 | regfi_log_add(REGFI_LOG_WARN, "Failed to load subkey list at" |
---|
[143] | 747 | " offset 0x%.8X.", offset); |
---|
| 748 | return NULL; |
---|
| 749 | } |
---|
[139] | 750 | |
---|
| 751 | if(num_keys != ret_val->num_keys) |
---|
| 752 | { |
---|
| 753 | /* Not sure which should be authoritative, the number from the |
---|
| 754 | * NK record, or the number in the subkey list. Just emit a warning for |
---|
| 755 | * now if they don't match. |
---|
| 756 | */ |
---|
[182] | 757 | regfi_log_add(REGFI_LOG_WARN, "Number of subkeys listed in parent" |
---|
[139] | 758 | " (%d) did not match number found in subkey list/tree (%d)" |
---|
| 759 | " while parsing subkey list/tree at offset 0x%.8X.", |
---|
| 760 | num_keys, ret_val->num_keys, offset); |
---|
| 761 | } |
---|
| 762 | |
---|
| 763 | return ret_val; |
---|
| 764 | } |
---|
| 765 | |
---|
| 766 | |
---|
| 767 | /****************************************************************************** |
---|
| 768 | ******************************************************************************/ |
---|
[168] | 769 | REGFI_SUBKEY_LIST* regfi_load_subkeylist_aux(REGFI_FILE* file, uint32_t offset, |
---|
| 770 | uint32_t max_size, bool strict, |
---|
| 771 | uint8_t depth_left) |
---|
[139] | 772 | { |
---|
| 773 | REGFI_SUBKEY_LIST* ret_val; |
---|
| 774 | REGFI_SUBKEY_LIST** sublists; |
---|
[168] | 775 | uint32_t i, num_sublists, off; |
---|
| 776 | int32_t sublist_maxsize; |
---|
[139] | 777 | |
---|
| 778 | if(depth_left == 0) |
---|
| 779 | { |
---|
[182] | 780 | regfi_log_add(REGFI_LOG_WARN, "Maximum depth reached" |
---|
[139] | 781 | " while parsing subkey list/tree at offset 0x%.8X.", |
---|
| 782 | offset); |
---|
[127] | 783 | return NULL; |
---|
[139] | 784 | } |
---|
[134] | 785 | |
---|
[139] | 786 | ret_val = regfi_parse_subkeylist(file, offset, max_size, strict); |
---|
[134] | 787 | if(ret_val == NULL) |
---|
| 788 | return NULL; |
---|
[139] | 789 | |
---|
| 790 | if(ret_val->recursive_type) |
---|
[127] | 791 | { |
---|
[139] | 792 | num_sublists = ret_val->num_children; |
---|
[150] | 793 | sublists = (REGFI_SUBKEY_LIST**)malloc(num_sublists |
---|
[139] | 794 | * sizeof(REGFI_SUBKEY_LIST*)); |
---|
| 795 | for(i=0; i < num_sublists; i++) |
---|
[127] | 796 | { |
---|
[139] | 797 | off = ret_val->elements[i].offset + REGFI_REGF_SIZE; |
---|
[157] | 798 | |
---|
| 799 | sublist_maxsize = regfi_calc_maxsize(file, off); |
---|
| 800 | if(sublist_maxsize < 0) |
---|
[139] | 801 | sublists[i] = NULL; |
---|
| 802 | else |
---|
[157] | 803 | sublists[i] = regfi_load_subkeylist_aux(file, off, sublist_maxsize, |
---|
| 804 | strict, depth_left-1); |
---|
[127] | 805 | } |
---|
[150] | 806 | talloc_free(ret_val); |
---|
[134] | 807 | |
---|
[139] | 808 | return regfi_merge_subkeylists(num_sublists, sublists, strict); |
---|
[127] | 809 | } |
---|
[30] | 810 | |
---|
[127] | 811 | return ret_val; |
---|
| 812 | } |
---|
| 813 | |
---|
| 814 | |
---|
[139] | 815 | /****************************************************************************** |
---|
| 816 | ******************************************************************************/ |
---|
[168] | 817 | REGFI_SUBKEY_LIST* regfi_parse_subkeylist(REGFI_FILE* file, uint32_t offset, |
---|
| 818 | uint32_t max_size, bool strict) |
---|
[30] | 819 | { |
---|
[135] | 820 | REGFI_SUBKEY_LIST* ret_val; |
---|
[168] | 821 | uint32_t i, cell_length, length, elem_size, read_len; |
---|
| 822 | uint8_t* elements = NULL; |
---|
| 823 | uint8_t buf[REGFI_SUBKEY_LIST_MIN_LEN]; |
---|
[104] | 824 | bool unalloc; |
---|
[139] | 825 | bool recursive_type; |
---|
[30] | 826 | |
---|
[186] | 827 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_subkeylist")) |
---|
[180] | 828 | goto fail; |
---|
| 829 | |
---|
[178] | 830 | if(!regfi_parse_cell(file->cb, offset, buf, REGFI_SUBKEY_LIST_MIN_LEN, |
---|
[104] | 831 | &cell_length, &unalloc)) |
---|
[139] | 832 | { |
---|
[182] | 833 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell while " |
---|
[139] | 834 | "parsing subkey-list at offset 0x%.8X.", offset); |
---|
[180] | 835 | goto fail_locked; |
---|
[139] | 836 | } |
---|
[30] | 837 | |
---|
[116] | 838 | if(cell_length > max_size) |
---|
| 839 | { |
---|
[182] | 840 | regfi_log_add(REGFI_LOG_WARN, "Cell size longer than max_size" |
---|
[139] | 841 | " while parsing subkey-list at offset 0x%.8X.", offset); |
---|
[116] | 842 | if(strict) |
---|
[180] | 843 | goto fail_locked; |
---|
[116] | 844 | cell_length = max_size & 0xFFFFFFF8; |
---|
| 845 | } |
---|
[30] | 846 | |
---|
[139] | 847 | recursive_type = false; |
---|
[127] | 848 | if(buf[0] == 'r' && buf[1] == 'i') |
---|
[104] | 849 | { |
---|
[139] | 850 | recursive_type = true; |
---|
[168] | 851 | elem_size = sizeof(uint32_t); |
---|
[104] | 852 | } |
---|
[139] | 853 | else if(buf[0] == 'l' && buf[1] == 'i') |
---|
[203] | 854 | { |
---|
[168] | 855 | elem_size = sizeof(uint32_t); |
---|
[203] | 856 | } |
---|
[134] | 857 | else if((buf[0] == 'l') && (buf[1] == 'f' || buf[1] == 'h')) |
---|
[135] | 858 | elem_size = sizeof(REGFI_SUBKEY_LIST_ELEM); |
---|
[134] | 859 | else |
---|
| 860 | { |
---|
[182] | 861 | regfi_log_add(REGFI_LOG_ERROR, "Unknown magic number" |
---|
[139] | 862 | " (0x%.2X, 0x%.2X) encountered while parsing" |
---|
| 863 | " subkey-list at offset 0x%.8X.", buf[0], buf[1], offset); |
---|
[180] | 864 | goto fail_locked; |
---|
[134] | 865 | } |
---|
| 866 | |
---|
[150] | 867 | ret_val = talloc(NULL, REGFI_SUBKEY_LIST); |
---|
[127] | 868 | if(ret_val == NULL) |
---|
[180] | 869 | goto fail_locked; |
---|
[127] | 870 | |
---|
| 871 | ret_val->offset = offset; |
---|
| 872 | ret_val->cell_size = cell_length; |
---|
[104] | 873 | ret_val->magic[0] = buf[0]; |
---|
| 874 | ret_val->magic[1] = buf[1]; |
---|
[139] | 875 | ret_val->recursive_type = recursive_type; |
---|
| 876 | ret_val->num_children = SVAL(buf, 0x2); |
---|
[101] | 877 | |
---|
[139] | 878 | if(!recursive_type) |
---|
| 879 | ret_val->num_keys = ret_val->num_children; |
---|
[101] | 880 | |
---|
[139] | 881 | length = elem_size*ret_val->num_children; |
---|
[168] | 882 | if(cell_length - REGFI_SUBKEY_LIST_MIN_LEN - sizeof(uint32_t) < length) |
---|
[134] | 883 | { |
---|
[182] | 884 | regfi_log_add(REGFI_LOG_WARN, "Number of elements too large for" |
---|
[139] | 885 | " cell while parsing subkey-list at offset 0x%.8X.", |
---|
| 886 | offset); |
---|
| 887 | if(strict) |
---|
[180] | 888 | goto fail_locked; |
---|
[168] | 889 | length = cell_length - REGFI_SUBKEY_LIST_MIN_LEN - sizeof(uint32_t); |
---|
[134] | 890 | } |
---|
[30] | 891 | |
---|
[150] | 892 | ret_val->elements = talloc_array(ret_val, REGFI_SUBKEY_LIST_ELEM, |
---|
| 893 | ret_val->num_children); |
---|
[127] | 894 | if(ret_val->elements == NULL) |
---|
[180] | 895 | goto fail_locked; |
---|
[30] | 896 | |
---|
[168] | 897 | elements = (uint8_t*)malloc(length); |
---|
[139] | 898 | if(elements == NULL) |
---|
[180] | 899 | goto fail_locked; |
---|
[30] | 900 | |
---|
[150] | 901 | read_len = length; |
---|
[178] | 902 | if(regfi_read(file->cb, elements, &read_len) != 0 || read_len!=length) |
---|
[180] | 903 | goto fail_locked; |
---|
[30] | 904 | |
---|
[186] | 905 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_subkeylist")) |
---|
[180] | 906 | goto fail; |
---|
| 907 | |
---|
[168] | 908 | if(elem_size == sizeof(uint32_t)) |
---|
[104] | 909 | { |
---|
[139] | 910 | for (i=0; i < ret_val->num_children; i++) |
---|
[134] | 911 | { |
---|
[139] | 912 | ret_val->elements[i].offset = IVAL(elements, i*elem_size); |
---|
[134] | 913 | ret_val->elements[i].hash = 0; |
---|
| 914 | } |
---|
[104] | 915 | } |
---|
[134] | 916 | else |
---|
| 917 | { |
---|
[139] | 918 | for (i=0; i < ret_val->num_children; i++) |
---|
[134] | 919 | { |
---|
[139] | 920 | ret_val->elements[i].offset = IVAL(elements, i*elem_size); |
---|
| 921 | ret_val->elements[i].hash = IVAL(elements, i*elem_size+4); |
---|
[134] | 922 | } |
---|
| 923 | } |
---|
[139] | 924 | free(elements); |
---|
[30] | 925 | |
---|
[104] | 926 | return ret_val; |
---|
[150] | 927 | |
---|
[180] | 928 | fail_locked: |
---|
[186] | 929 | regfi_unlock(file, &file->cb_lock, "regfi_parse_subkeylist"); |
---|
[150] | 930 | fail: |
---|
| 931 | if(elements != NULL) |
---|
| 932 | free(elements); |
---|
| 933 | talloc_free(ret_val); |
---|
| 934 | return NULL; |
---|
[30] | 935 | } |
---|
| 936 | |
---|
| 937 | |
---|
[139] | 938 | /******************************************************************* |
---|
| 939 | *******************************************************************/ |
---|
[168] | 940 | REGFI_SUBKEY_LIST* regfi_merge_subkeylists(uint16_t num_lists, |
---|
[139] | 941 | REGFI_SUBKEY_LIST** lists, |
---|
| 942 | bool strict) |
---|
| 943 | { |
---|
[168] | 944 | uint32_t i,j,k; |
---|
[139] | 945 | REGFI_SUBKEY_LIST* ret_val; |
---|
[102] | 946 | |
---|
[139] | 947 | if(lists == NULL) |
---|
| 948 | return NULL; |
---|
[150] | 949 | ret_val = talloc(NULL, REGFI_SUBKEY_LIST); |
---|
[139] | 950 | |
---|
| 951 | if(ret_val == NULL) |
---|
| 952 | return NULL; |
---|
| 953 | |
---|
| 954 | /* Obtain total number of elements */ |
---|
| 955 | ret_val->num_keys = 0; |
---|
| 956 | for(i=0; i < num_lists; i++) |
---|
| 957 | { |
---|
| 958 | if(lists[i] != NULL) |
---|
| 959 | ret_val->num_keys += lists[i]->num_children; |
---|
| 960 | } |
---|
| 961 | ret_val->num_children = ret_val->num_keys; |
---|
| 962 | |
---|
| 963 | if(ret_val->num_keys > 0) |
---|
| 964 | { |
---|
[150] | 965 | ret_val->elements = talloc_array(ret_val, REGFI_SUBKEY_LIST_ELEM, |
---|
| 966 | ret_val->num_keys); |
---|
[139] | 967 | k=0; |
---|
| 968 | |
---|
| 969 | if(ret_val->elements != NULL) |
---|
| 970 | { |
---|
| 971 | for(i=0; i < num_lists; i++) |
---|
| 972 | { |
---|
| 973 | if(lists[i] != NULL) |
---|
| 974 | { |
---|
| 975 | for(j=0; j < lists[i]->num_keys; j++) |
---|
| 976 | { |
---|
[150] | 977 | ret_val->elements[k].hash = lists[i]->elements[j].hash; |
---|
| 978 | ret_val->elements[k++].offset = lists[i]->elements[j].offset; |
---|
[139] | 979 | } |
---|
| 980 | } |
---|
| 981 | } |
---|
| 982 | } |
---|
| 983 | } |
---|
| 984 | |
---|
| 985 | for(i=0; i < num_lists; i++) |
---|
[184] | 986 | talloc_free(lists[i]); |
---|
[139] | 987 | free(lists); |
---|
| 988 | |
---|
| 989 | return ret_val; |
---|
| 990 | } |
---|
| 991 | |
---|
| 992 | |
---|
[147] | 993 | /****************************************************************************** |
---|
| 994 | * |
---|
| 995 | ******************************************************************************/ |
---|
[203] | 996 | REGFI_SK* regfi_parse_sk(REGFI_FILE* file, uint32_t offset, uint32_t max_size, |
---|
[147] | 997 | bool strict) |
---|
[30] | 998 | { |
---|
[203] | 999 | REGFI_SK* ret_val = NULL; |
---|
[168] | 1000 | uint8_t* sec_desc_buf = NULL; |
---|
| 1001 | uint32_t cell_length, length; |
---|
| 1002 | uint8_t sk_header[REGFI_SK_MIN_LENGTH]; |
---|
[102] | 1003 | bool unalloc = false; |
---|
[30] | 1004 | |
---|
[186] | 1005 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_sk")) |
---|
[180] | 1006 | goto fail; |
---|
| 1007 | |
---|
[178] | 1008 | if(!regfi_parse_cell(file->cb, offset, sk_header, REGFI_SK_MIN_LENGTH, |
---|
[102] | 1009 | &cell_length, &unalloc)) |
---|
[137] | 1010 | { |
---|
[182] | 1011 | regfi_log_add(REGFI_LOG_WARN, "Could not parse SK record cell" |
---|
[137] | 1012 | " at offset 0x%.8X.", offset); |
---|
[180] | 1013 | goto fail_locked; |
---|
[137] | 1014 | } |
---|
[102] | 1015 | |
---|
| 1016 | if(sk_header[0] != 's' || sk_header[1] != 'k') |
---|
[137] | 1017 | { |
---|
[182] | 1018 | regfi_log_add(REGFI_LOG_WARN, "Magic number mismatch in parsing" |
---|
[138] | 1019 | " SK record at offset 0x%.8X.", offset); |
---|
[180] | 1020 | goto fail_locked; |
---|
[137] | 1021 | } |
---|
| 1022 | |
---|
[203] | 1023 | ret_val = talloc(NULL, REGFI_SK); |
---|
[102] | 1024 | if(ret_val == NULL) |
---|
[180] | 1025 | goto fail_locked; |
---|
[30] | 1026 | |
---|
[102] | 1027 | ret_val->offset = offset; |
---|
[116] | 1028 | /* XXX: Is there a way to be more conservative (shorter) with |
---|
| 1029 | * cell length when cell is unallocated? |
---|
[111] | 1030 | */ |
---|
[102] | 1031 | ret_val->cell_size = cell_length; |
---|
[30] | 1032 | |
---|
[102] | 1033 | if(ret_val->cell_size > max_size) |
---|
| 1034 | ret_val->cell_size = max_size & 0xFFFFFFF8; |
---|
| 1035 | if((ret_val->cell_size < REGFI_SK_MIN_LENGTH) |
---|
[157] | 1036 | || (strict && (ret_val->cell_size & 0x00000007) != 0)) |
---|
[102] | 1037 | { |
---|
[182] | 1038 | regfi_log_add(REGFI_LOG_WARN, "Invalid cell size found while" |
---|
[138] | 1039 | " parsing SK record at offset 0x%.8X.", offset); |
---|
[180] | 1040 | goto fail_locked; |
---|
[102] | 1041 | } |
---|
[30] | 1042 | |
---|
[102] | 1043 | ret_val->magic[0] = sk_header[0]; |
---|
| 1044 | ret_val->magic[1] = sk_header[1]; |
---|
[30] | 1045 | |
---|
[102] | 1046 | ret_val->unknown_tag = SVAL(sk_header, 0x2); |
---|
| 1047 | ret_val->prev_sk_off = IVAL(sk_header, 0x4); |
---|
| 1048 | ret_val->next_sk_off = IVAL(sk_header, 0x8); |
---|
| 1049 | ret_val->ref_count = IVAL(sk_header, 0xC); |
---|
| 1050 | ret_val->desc_size = IVAL(sk_header, 0x10); |
---|
[30] | 1051 | |
---|
[157] | 1052 | if((ret_val->prev_sk_off & 0x00000007) != 0 |
---|
| 1053 | || (ret_val->next_sk_off & 0x00000007) != 0) |
---|
[140] | 1054 | { |
---|
[182] | 1055 | regfi_log_add(REGFI_LOG_WARN, "SK record's next/previous offsets" |
---|
[140] | 1056 | " are not a multiple of 8 while parsing SK record at" |
---|
| 1057 | " offset 0x%.8X.", offset); |
---|
[180] | 1058 | goto fail_locked; |
---|
[140] | 1059 | } |
---|
| 1060 | |
---|
[102] | 1061 | if(ret_val->desc_size + REGFI_SK_MIN_LENGTH > ret_val->cell_size) |
---|
| 1062 | { |
---|
[182] | 1063 | regfi_log_add(REGFI_LOG_WARN, "Security descriptor too large for" |
---|
[138] | 1064 | " cell while parsing SK record at offset 0x%.8X.", |
---|
| 1065 | offset); |
---|
[180] | 1066 | goto fail_locked; |
---|
[102] | 1067 | } |
---|
[30] | 1068 | |
---|
[168] | 1069 | sec_desc_buf = (uint8_t*)malloc(ret_val->desc_size); |
---|
[147] | 1070 | if(sec_desc_buf == NULL) |
---|
[180] | 1071 | goto fail_locked; |
---|
[102] | 1072 | |
---|
[134] | 1073 | length = ret_val->desc_size; |
---|
[178] | 1074 | if(regfi_read(file->cb, sec_desc_buf, &length) != 0 |
---|
[134] | 1075 | || length != ret_val->desc_size) |
---|
| 1076 | { |
---|
[182] | 1077 | regfi_log_add(REGFI_LOG_ERROR, "Failed to read security" |
---|
[138] | 1078 | " descriptor while parsing SK record at offset 0x%.8X.", |
---|
| 1079 | offset); |
---|
[180] | 1080 | goto fail_locked; |
---|
[134] | 1081 | } |
---|
[102] | 1082 | |
---|
[186] | 1083 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_sk")) |
---|
[180] | 1084 | goto fail; |
---|
| 1085 | |
---|
[147] | 1086 | if(!(ret_val->sec_desc = winsec_parse_desc(ret_val, sec_desc_buf, |
---|
| 1087 | ret_val->desc_size))) |
---|
[134] | 1088 | { |
---|
[182] | 1089 | regfi_log_add(REGFI_LOG_ERROR, "Failed to parse security" |
---|
[138] | 1090 | " descriptor while parsing SK record at offset 0x%.8X.", |
---|
| 1091 | offset); |
---|
[147] | 1092 | goto fail; |
---|
[134] | 1093 | } |
---|
[147] | 1094 | |
---|
[134] | 1095 | free(sec_desc_buf); |
---|
[147] | 1096 | return ret_val; |
---|
[134] | 1097 | |
---|
[180] | 1098 | fail_locked: |
---|
[186] | 1099 | regfi_unlock(file, &file->cb_lock, "regfi_parse_sk"); |
---|
[147] | 1100 | fail: |
---|
| 1101 | if(sec_desc_buf != NULL) |
---|
| 1102 | free(sec_desc_buf); |
---|
| 1103 | talloc_free(ret_val); |
---|
| 1104 | return NULL; |
---|
[30] | 1105 | } |
---|
| 1106 | |
---|
| 1107 | |
---|
[168] | 1108 | REGFI_VALUE_LIST* regfi_parse_valuelist(REGFI_FILE* file, uint32_t offset, |
---|
| 1109 | uint32_t num_values, bool strict) |
---|
[111] | 1110 | { |
---|
[145] | 1111 | REGFI_VALUE_LIST* ret_val; |
---|
[168] | 1112 | uint32_t i, cell_length, length, read_len; |
---|
[111] | 1113 | bool unalloc; |
---|
[30] | 1114 | |
---|
[186] | 1115 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_valuelist")) |
---|
[180] | 1116 | goto fail; |
---|
| 1117 | |
---|
[178] | 1118 | if(!regfi_parse_cell(file->cb, offset, NULL, 0, &cell_length, &unalloc)) |
---|
[137] | 1119 | { |
---|
[182] | 1120 | regfi_log_add(REGFI_LOG_ERROR, "Failed to read cell header" |
---|
[137] | 1121 | " while parsing value list at offset 0x%.8X.", offset); |
---|
[180] | 1122 | goto fail_locked; |
---|
[137] | 1123 | } |
---|
[111] | 1124 | |
---|
[157] | 1125 | if((cell_length & 0x00000007) != 0) |
---|
[111] | 1126 | { |
---|
[182] | 1127 | regfi_log_add(REGFI_LOG_WARN, "Cell length not a multiple of 8" |
---|
[145] | 1128 | " while parsing value list at offset 0x%.8X.", offset); |
---|
[111] | 1129 | if(strict) |
---|
[180] | 1130 | goto fail_locked; |
---|
[111] | 1131 | cell_length = cell_length & 0xFFFFFFF8; |
---|
| 1132 | } |
---|
[145] | 1133 | |
---|
[168] | 1134 | if((num_values * sizeof(uint32_t)) > cell_length-sizeof(uint32_t)) |
---|
[137] | 1135 | { |
---|
[182] | 1136 | regfi_log_add(REGFI_LOG_WARN, "Too many values found" |
---|
[137] | 1137 | " while parsing value list at offset 0x%.8X.", offset); |
---|
[145] | 1138 | if(strict) |
---|
[180] | 1139 | goto fail_locked; |
---|
[168] | 1140 | num_values = cell_length/sizeof(uint32_t) - sizeof(uint32_t); |
---|
[137] | 1141 | } |
---|
[111] | 1142 | |
---|
[168] | 1143 | read_len = num_values*sizeof(uint32_t); |
---|
[150] | 1144 | ret_val = talloc(NULL, REGFI_VALUE_LIST); |
---|
[111] | 1145 | if(ret_val == NULL) |
---|
[180] | 1146 | goto fail_locked; |
---|
[111] | 1147 | |
---|
[150] | 1148 | ret_val->elements = (REGFI_VALUE_LIST_ELEM*)talloc_size(ret_val, read_len); |
---|
[145] | 1149 | if(ret_val->elements == NULL) |
---|
[180] | 1150 | goto fail_locked; |
---|
| 1151 | |
---|
[206] | 1152 | ret_val->offset = offset; |
---|
| 1153 | ret_val->cell_size = cell_length; |
---|
[145] | 1154 | ret_val->num_values = num_values; |
---|
| 1155 | |
---|
[111] | 1156 | length = read_len; |
---|
[178] | 1157 | if((regfi_read(file->cb, (uint8_t*)ret_val->elements, &length) != 0) |
---|
[145] | 1158 | || length != read_len) |
---|
[111] | 1159 | { |
---|
[182] | 1160 | regfi_log_add(REGFI_LOG_ERROR, "Failed to read value pointers" |
---|
[137] | 1161 | " while parsing value list at offset 0x%.8X.", offset); |
---|
[180] | 1162 | goto fail_locked; |
---|
[111] | 1163 | } |
---|
| 1164 | |
---|
[186] | 1165 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_valuelist")) |
---|
[180] | 1166 | goto fail; |
---|
| 1167 | |
---|
[111] | 1168 | for(i=0; i < num_values; i++) |
---|
| 1169 | { |
---|
| 1170 | /* Fix endianness */ |
---|
[145] | 1171 | ret_val->elements[i] = IVAL(&ret_val->elements[i], 0); |
---|
[111] | 1172 | |
---|
| 1173 | /* Validate the first num_values values to ensure they make sense */ |
---|
| 1174 | if(strict) |
---|
| 1175 | { |
---|
[145] | 1176 | /* XXX: Need to revisit this file length check when we start dealing |
---|
| 1177 | * with partial files. */ |
---|
| 1178 | if((ret_val->elements[i] + REGFI_REGF_SIZE > file->file_length) |
---|
[157] | 1179 | || ((ret_val->elements[i] & 0x00000007) != 0)) |
---|
[111] | 1180 | { |
---|
[182] | 1181 | regfi_log_add(REGFI_LOG_WARN, "Invalid value pointer" |
---|
[138] | 1182 | " (0x%.8X) found while parsing value list at offset" |
---|
[145] | 1183 | " 0x%.8X.", ret_val->elements[i], offset); |
---|
[180] | 1184 | goto fail; |
---|
[111] | 1185 | } |
---|
| 1186 | } |
---|
| 1187 | } |
---|
| 1188 | |
---|
| 1189 | return ret_val; |
---|
[180] | 1190 | |
---|
| 1191 | fail_locked: |
---|
[186] | 1192 | regfi_unlock(file, &file->cb_lock, "regfi_parse_valuelist"); |
---|
[180] | 1193 | fail: |
---|
| 1194 | talloc_free(ret_val); |
---|
| 1195 | return NULL; |
---|
[111] | 1196 | } |
---|
| 1197 | |
---|
[206] | 1198 | /* XXX: should give this boolean return type to indicate errors */ |
---|
[203] | 1199 | void regfi_interpret_valuename(REGFI_FILE* file, REGFI_VK* vk, |
---|
[162] | 1200 | REGFI_ENCODING output_encoding, bool strict) |
---|
[30] | 1201 | { |
---|
[165] | 1202 | /* XXX: Registry value names are supposedly limited to 16383 characters |
---|
| 1203 | * according to: |
---|
| 1204 | * http://msdn.microsoft.com/en-us/library/ms724872%28VS.85%29.aspx |
---|
| 1205 | * Might want to emit a warning if this is exceeded. |
---|
| 1206 | * It is expected that "characters" could be variable width. |
---|
| 1207 | * Also, it may be useful to use this information to limit false positives |
---|
| 1208 | * when recovering deleted VK records. |
---|
| 1209 | */ |
---|
[172] | 1210 | int32_t tmp_size; |
---|
| 1211 | REGFI_ENCODING from_encoding = (vk->flags & REGFI_VK_FLAG_ASCIINAME) |
---|
[162] | 1212 | ? REGFI_ENCODING_ASCII : REGFI_ENCODING_UTF16LE; |
---|
[151] | 1213 | |
---|
[162] | 1214 | if(from_encoding == output_encoding) |
---|
| 1215 | { |
---|
[206] | 1216 | vk->name_raw[vk->name_length] = '\0'; |
---|
| 1217 | vk->name = (char*)vk->name_raw; |
---|
[162] | 1218 | } |
---|
| 1219 | else |
---|
| 1220 | { |
---|
[206] | 1221 | vk->name = talloc_array(vk, char, vk->name_length+1); |
---|
| 1222 | if(vk->name == NULL) |
---|
[172] | 1223 | return; |
---|
[162] | 1224 | |
---|
| 1225 | tmp_size = regfi_conv_charset(regfi_encoding_int2str(from_encoding), |
---|
| 1226 | regfi_encoding_int2str(output_encoding), |
---|
[206] | 1227 | vk->name_raw, vk->name, |
---|
[172] | 1228 | vk->name_length, vk->name_length+1); |
---|
[162] | 1229 | if(tmp_size < 0) |
---|
| 1230 | { |
---|
[182] | 1231 | regfi_log_add(REGFI_LOG_WARN, "Error occurred while converting" |
---|
[206] | 1232 | " value name to encoding %s. Error message: %s", |
---|
[162] | 1233 | regfi_encoding_int2str(output_encoding), |
---|
| 1234 | strerror(-tmp_size)); |
---|
[206] | 1235 | talloc_free(vk->name); |
---|
| 1236 | vk->name = NULL; |
---|
[162] | 1237 | } |
---|
| 1238 | } |
---|
[172] | 1239 | } |
---|
[162] | 1240 | |
---|
[172] | 1241 | |
---|
| 1242 | /****************************************************************************** |
---|
| 1243 | ******************************************************************************/ |
---|
[203] | 1244 | REGFI_VK* regfi_load_value(REGFI_FILE* file, uint32_t offset, |
---|
[206] | 1245 | REGFI_ENCODING output_encoding, bool strict) |
---|
[172] | 1246 | { |
---|
[203] | 1247 | REGFI_VK* ret_val = NULL; |
---|
[172] | 1248 | int32_t max_size; |
---|
| 1249 | |
---|
| 1250 | max_size = regfi_calc_maxsize(file, offset); |
---|
| 1251 | if(max_size < 0) |
---|
| 1252 | return NULL; |
---|
| 1253 | |
---|
| 1254 | ret_val = regfi_parse_vk(file, offset, max_size, strict); |
---|
| 1255 | if(ret_val == NULL) |
---|
| 1256 | return NULL; |
---|
| 1257 | |
---|
| 1258 | regfi_interpret_valuename(file, ret_val, output_encoding, strict); |
---|
| 1259 | |
---|
[103] | 1260 | return ret_val; |
---|
[30] | 1261 | } |
---|
| 1262 | |
---|
| 1263 | |
---|
[145] | 1264 | /****************************************************************************** |
---|
| 1265 | * If !strict, the list may contain NULLs, VK records may point to NULL. |
---|
| 1266 | ******************************************************************************/ |
---|
[168] | 1267 | REGFI_VALUE_LIST* regfi_load_valuelist(REGFI_FILE* file, uint32_t offset, |
---|
| 1268 | uint32_t num_values, uint32_t max_size, |
---|
[145] | 1269 | bool strict) |
---|
| 1270 | { |
---|
[168] | 1271 | uint32_t usable_num_values; |
---|
[30] | 1272 | |
---|
[168] | 1273 | if((num_values+1) * sizeof(uint32_t) > max_size) |
---|
[145] | 1274 | { |
---|
[182] | 1275 | regfi_log_add(REGFI_LOG_WARN, "Number of values indicated by" |
---|
[145] | 1276 | " parent key (%d) would cause cell to straddle HBIN" |
---|
| 1277 | " boundary while loading value list at offset" |
---|
| 1278 | " 0x%.8X.", num_values, offset); |
---|
| 1279 | if(strict) |
---|
| 1280 | return NULL; |
---|
[168] | 1281 | usable_num_values = max_size/sizeof(uint32_t) - sizeof(uint32_t); |
---|
[145] | 1282 | } |
---|
| 1283 | else |
---|
| 1284 | usable_num_values = num_values; |
---|
| 1285 | |
---|
| 1286 | return regfi_parse_valuelist(file, offset, usable_num_values, strict); |
---|
| 1287 | } |
---|
| 1288 | |
---|
| 1289 | |
---|
[206] | 1290 | /* XXX: should give this boolean return type to indicate errors */ |
---|
[203] | 1291 | void regfi_interpret_keyname(REGFI_FILE* file, REGFI_NK* nk, |
---|
[161] | 1292 | REGFI_ENCODING output_encoding, bool strict) |
---|
[30] | 1293 | { |
---|
[165] | 1294 | /* XXX: Registry key names are supposedly limited to 255 characters according to: |
---|
| 1295 | * http://msdn.microsoft.com/en-us/library/ms724872%28VS.85%29.aspx |
---|
| 1296 | * Might want to emit a warning if this is exceeded. |
---|
| 1297 | * It is expected that "characters" could be variable width. |
---|
| 1298 | * Also, it may be useful to use this information to limit false positives |
---|
| 1299 | * when recovering deleted NK records. |
---|
| 1300 | */ |
---|
[172] | 1301 | int32_t tmp_size; |
---|
| 1302 | REGFI_ENCODING from_encoding = (nk->flags & REGFI_NK_FLAG_ASCIINAME) |
---|
[161] | 1303 | ? REGFI_ENCODING_ASCII : REGFI_ENCODING_UTF16LE; |
---|
[172] | 1304 | |
---|
[161] | 1305 | if(from_encoding == output_encoding) |
---|
| 1306 | { |
---|
[206] | 1307 | nk->name_raw[nk->name_length] = '\0'; |
---|
| 1308 | nk->name = (char*)nk->name_raw; |
---|
[161] | 1309 | } |
---|
| 1310 | else |
---|
| 1311 | { |
---|
[206] | 1312 | nk->name = talloc_array(nk, char, nk->name_length+1); |
---|
| 1313 | if(nk->name == NULL) |
---|
[172] | 1314 | return; |
---|
[161] | 1315 | |
---|
[206] | 1316 | memset(nk->name,0,nk->name_length+1); |
---|
| 1317 | |
---|
[161] | 1318 | tmp_size = regfi_conv_charset(regfi_encoding_int2str(from_encoding), |
---|
| 1319 | regfi_encoding_int2str(output_encoding), |
---|
[206] | 1320 | nk->name_raw, nk->name, |
---|
[161] | 1321 | nk->name_length, nk->name_length+1); |
---|
| 1322 | if(tmp_size < 0) |
---|
| 1323 | { |
---|
[182] | 1324 | regfi_log_add(REGFI_LOG_WARN, "Error occurred while converting" |
---|
[206] | 1325 | " key name to encoding %s. Error message: %s", |
---|
[161] | 1326 | regfi_encoding_int2str(output_encoding), |
---|
| 1327 | strerror(-tmp_size)); |
---|
[206] | 1328 | talloc_free(nk->name); |
---|
| 1329 | nk->name = NULL; |
---|
[161] | 1330 | } |
---|
| 1331 | } |
---|
[172] | 1332 | } |
---|
[161] | 1333 | |
---|
| 1334 | |
---|
[172] | 1335 | /****************************************************************************** |
---|
| 1336 | * |
---|
| 1337 | ******************************************************************************/ |
---|
[203] | 1338 | REGFI_NK* regfi_load_key(REGFI_FILE* file, uint32_t offset, |
---|
[206] | 1339 | REGFI_ENCODING output_encoding, bool strict) |
---|
[172] | 1340 | { |
---|
[203] | 1341 | REGFI_NK* nk; |
---|
[172] | 1342 | uint32_t off; |
---|
| 1343 | int32_t max_size; |
---|
| 1344 | |
---|
[250] | 1345 | if(file->nk_cache != NULL) |
---|
| 1346 | { |
---|
| 1347 | /* First, check to see if we have this key in our cache */ |
---|
| 1348 | if(!regfi_lock(file, &file->mem_lock, "regfi_load_nk")) |
---|
| 1349 | return NULL; |
---|
| 1350 | regfi_lock(file, &file->nk_lock, "regfi_load_nk"); |
---|
| 1351 | |
---|
| 1352 | nk = (REGFI_NK*)lru_cache_find(file->nk_cache, &offset, 4); |
---|
| 1353 | if(nk != NULL) |
---|
| 1354 | nk = talloc_reference(NULL, nk); |
---|
| 1355 | |
---|
| 1356 | regfi_unlock(file, &file->nk_lock, "regfi_load_nk"); |
---|
| 1357 | regfi_unlock(file, &file->mem_lock, "regfi_load_nk"); |
---|
| 1358 | if(nk != NULL) |
---|
| 1359 | return nk; |
---|
| 1360 | } |
---|
| 1361 | |
---|
| 1362 | /* Not cached currently, proceed with loading it */ |
---|
[172] | 1363 | max_size = regfi_calc_maxsize(file, offset); |
---|
| 1364 | if (max_size < 0) |
---|
| 1365 | return NULL; |
---|
| 1366 | |
---|
| 1367 | /* get the initial nk record */ |
---|
| 1368 | if((nk = regfi_parse_nk(file, offset, max_size, true)) == NULL) |
---|
| 1369 | { |
---|
[182] | 1370 | regfi_log_add(REGFI_LOG_ERROR, "Could not load NK record at" |
---|
| 1371 | " offset 0x%.8X.", offset); |
---|
[172] | 1372 | return NULL; |
---|
| 1373 | } |
---|
| 1374 | |
---|
| 1375 | regfi_interpret_keyname(file, nk, output_encoding, strict); |
---|
| 1376 | |
---|
[146] | 1377 | /* get value list */ |
---|
[135] | 1378 | if(nk->num_values && (nk->values_off!=REGFI_OFFSET_NONE)) |
---|
[32] | 1379 | { |
---|
[157] | 1380 | off = nk->values_off + REGFI_REGF_SIZE; |
---|
| 1381 | max_size = regfi_calc_maxsize(file, off); |
---|
| 1382 | if(max_size < 0) |
---|
[32] | 1383 | { |
---|
[105] | 1384 | if(strict) |
---|
[32] | 1385 | { |
---|
[184] | 1386 | talloc_free(nk); |
---|
[99] | 1387 | return NULL; |
---|
[31] | 1388 | } |
---|
[105] | 1389 | else |
---|
| 1390 | nk->values = NULL; |
---|
[31] | 1391 | } |
---|
[105] | 1392 | else |
---|
[103] | 1393 | { |
---|
[157] | 1394 | nk->values = regfi_load_valuelist(file, off, nk->num_values, |
---|
| 1395 | max_size, true); |
---|
[145] | 1396 | if(nk->values == NULL) |
---|
[105] | 1397 | { |
---|
[182] | 1398 | regfi_log_add(REGFI_LOG_WARN, "Could not load value list" |
---|
| 1399 | " for NK record at offset 0x%.8X.", offset); |
---|
[145] | 1400 | if(strict) |
---|
| 1401 | { |
---|
[184] | 1402 | talloc_free(nk); |
---|
[145] | 1403 | return NULL; |
---|
| 1404 | } |
---|
[105] | 1405 | } |
---|
[223] | 1406 | talloc_reparent(NULL, nk, nk->values); |
---|
[103] | 1407 | } |
---|
[31] | 1408 | } |
---|
[105] | 1409 | |
---|
[146] | 1410 | /* now get subkey list */ |
---|
[135] | 1411 | if(nk->num_subkeys && (nk->subkeys_off != REGFI_OFFSET_NONE)) |
---|
[32] | 1412 | { |
---|
[157] | 1413 | off = nk->subkeys_off + REGFI_REGF_SIZE; |
---|
| 1414 | max_size = regfi_calc_maxsize(file, off); |
---|
| 1415 | if(max_size < 0) |
---|
[32] | 1416 | { |
---|
[105] | 1417 | if(strict) |
---|
[32] | 1418 | { |
---|
[184] | 1419 | talloc_free(nk); |
---|
[99] | 1420 | return NULL; |
---|
[31] | 1421 | } |
---|
[105] | 1422 | else |
---|
| 1423 | nk->subkeys = NULL; |
---|
[31] | 1424 | } |
---|
[105] | 1425 | else |
---|
[104] | 1426 | { |
---|
[134] | 1427 | nk->subkeys = regfi_load_subkeylist(file, off, nk->num_subkeys, |
---|
[157] | 1428 | max_size, true); |
---|
[134] | 1429 | |
---|
[105] | 1430 | if(nk->subkeys == NULL) |
---|
| 1431 | { |
---|
[182] | 1432 | regfi_log_add(REGFI_LOG_WARN, "Could not load subkey list" |
---|
| 1433 | " while parsing NK record at offset 0x%.8X.", offset); |
---|
[105] | 1434 | nk->num_subkeys = 0; |
---|
| 1435 | } |
---|
[223] | 1436 | talloc_reparent(NULL, nk, nk->subkeys); |
---|
[104] | 1437 | } |
---|
[31] | 1438 | } |
---|
[30] | 1439 | |
---|
[250] | 1440 | if(file->nk_cache != NULL) |
---|
| 1441 | { |
---|
| 1442 | /* All is well, so let us cache this key for later */ |
---|
| 1443 | if(!regfi_lock(file, &file->mem_lock, "regfi_load_nk")) |
---|
| 1444 | return NULL; |
---|
| 1445 | regfi_lock(file, &file->nk_lock, "regfi_load_nk"); |
---|
| 1446 | |
---|
| 1447 | lru_cache_update(file->nk_cache, &offset, 4, nk); |
---|
| 1448 | |
---|
| 1449 | regfi_unlock(file, &file->nk_lock, "regfi_load_nk"); |
---|
| 1450 | regfi_unlock(file, &file->mem_lock, "regfi_load_nk"); |
---|
| 1451 | } |
---|
| 1452 | |
---|
[99] | 1453 | return nk; |
---|
[30] | 1454 | } |
---|
| 1455 | |
---|
[32] | 1456 | |
---|
[102] | 1457 | /****************************************************************************** |
---|
| 1458 | ******************************************************************************/ |
---|
[203] | 1459 | const REGFI_SK* regfi_load_sk(REGFI_FILE* file, uint32_t offset, bool strict) |
---|
[146] | 1460 | { |
---|
[203] | 1461 | REGFI_SK* ret_val = NULL; |
---|
[168] | 1462 | int32_t max_size; |
---|
[147] | 1463 | void* failure_ptr = NULL; |
---|
| 1464 | |
---|
[184] | 1465 | max_size = regfi_calc_maxsize(file, offset); |
---|
| 1466 | if(max_size < 0) |
---|
| 1467 | return NULL; |
---|
| 1468 | |
---|
| 1469 | if(file->sk_cache == NULL) |
---|
| 1470 | return regfi_parse_sk(file, offset, max_size, strict); |
---|
| 1471 | |
---|
[250] | 1472 | if(!regfi_lock(file, &file->mem_lock, "regfi_load_sk")) |
---|
[180] | 1473 | return NULL; |
---|
[250] | 1474 | regfi_lock(file, &file->sk_lock, "regfi_load_sk"); |
---|
[180] | 1475 | |
---|
[146] | 1476 | /* First look if we have already parsed it */ |
---|
[203] | 1477 | ret_val = (REGFI_SK*)lru_cache_find(file->sk_cache, &offset, 4); |
---|
[146] | 1478 | |
---|
| 1479 | /* Bail out if we have previously cached a parse failure at this offset. */ |
---|
| 1480 | if(ret_val == (void*)REGFI_OFFSET_NONE) |
---|
[250] | 1481 | { |
---|
| 1482 | ret_val = NULL; |
---|
| 1483 | goto unlock; |
---|
| 1484 | } |
---|
[146] | 1485 | |
---|
| 1486 | if(ret_val == NULL) |
---|
| 1487 | { |
---|
[157] | 1488 | ret_val = regfi_parse_sk(file, offset, max_size, strict); |
---|
[146] | 1489 | if(ret_val == NULL) |
---|
| 1490 | { /* Cache the parse failure and bail out. */ |
---|
[147] | 1491 | failure_ptr = talloc(NULL, uint32_t); |
---|
| 1492 | if(failure_ptr == NULL) |
---|
[250] | 1493 | goto unlock; |
---|
| 1494 | |
---|
[147] | 1495 | *(uint32_t*)failure_ptr = REGFI_OFFSET_NONE; |
---|
| 1496 | lru_cache_update(file->sk_cache, &offset, 4, failure_ptr); |
---|
[184] | 1497 | |
---|
| 1498 | /* Let the cache be the only owner of this */ |
---|
| 1499 | talloc_unlink(NULL, failure_ptr); |
---|
[146] | 1500 | } |
---|
| 1501 | } |
---|
| 1502 | |
---|
[250] | 1503 | unlock: |
---|
| 1504 | regfi_unlock(file, &file->sk_lock, "regfi_load_sk"); |
---|
| 1505 | regfi_unlock(file, &file->mem_lock, "regfi_load_sk"); |
---|
[180] | 1506 | |
---|
[146] | 1507 | return ret_val; |
---|
| 1508 | } |
---|
| 1509 | |
---|
| 1510 | |
---|
| 1511 | |
---|
| 1512 | /****************************************************************************** |
---|
| 1513 | ******************************************************************************/ |
---|
[203] | 1514 | REGFI_NK* regfi_find_root_nk(REGFI_FILE* file, const REGFI_HBIN* hbin, |
---|
[206] | 1515 | REGFI_ENCODING output_encoding) |
---|
[30] | 1516 | { |
---|
[203] | 1517 | REGFI_NK* nk = NULL; |
---|
[168] | 1518 | uint32_t cell_length; |
---|
| 1519 | uint32_t cur_offset = hbin->file_off+REGFI_HBIN_HEADER_SIZE; |
---|
| 1520 | uint32_t hbin_end = hbin->file_off+hbin->block_size; |
---|
[158] | 1521 | bool unalloc; |
---|
[30] | 1522 | |
---|
[158] | 1523 | while(cur_offset < hbin_end) |
---|
[32] | 1524 | { |
---|
[180] | 1525 | |
---|
[186] | 1526 | if(!regfi_lock(file, &file->cb_lock, "regfi_find_root_nk")) |
---|
[180] | 1527 | return NULL; |
---|
| 1528 | |
---|
[178] | 1529 | if(!regfi_parse_cell(file->cb, cur_offset, NULL, 0, &cell_length, &unalloc)) |
---|
[158] | 1530 | { |
---|
[182] | 1531 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell at offset" |
---|
| 1532 | " 0x%.8X while searching for root key.", cur_offset); |
---|
[158] | 1533 | return NULL; |
---|
| 1534 | } |
---|
[180] | 1535 | |
---|
[186] | 1536 | if(!regfi_unlock(file, &file->cb_lock, "regfi_find_root_nk")) |
---|
[180] | 1537 | return NULL; |
---|
| 1538 | |
---|
[158] | 1539 | if(!unalloc) |
---|
[102] | 1540 | { |
---|
[161] | 1541 | nk = regfi_load_key(file, cur_offset, output_encoding, true); |
---|
[102] | 1542 | if(nk != NULL) |
---|
| 1543 | { |
---|
[161] | 1544 | if(nk->flags & REGFI_NK_FLAG_ROOT) |
---|
[158] | 1545 | return nk; |
---|
[102] | 1546 | } |
---|
[31] | 1547 | } |
---|
[30] | 1548 | |
---|
[158] | 1549 | cur_offset += cell_length; |
---|
[31] | 1550 | } |
---|
[32] | 1551 | |
---|
[158] | 1552 | return NULL; |
---|
[30] | 1553 | } |
---|
| 1554 | |
---|
| 1555 | |
---|
[178] | 1556 | |
---|
[166] | 1557 | /****************************************************************************** |
---|
| 1558 | ******************************************************************************/ |
---|
[206] | 1559 | REGFI_FILE* regfi_alloc(int fd, REGFI_ENCODING output_encoding) |
---|
[30] | 1560 | { |
---|
[166] | 1561 | REGFI_FILE* ret_val; |
---|
[178] | 1562 | REGFI_RAW_FILE* file_cb = talloc(NULL, REGFI_RAW_FILE); |
---|
| 1563 | if(file_cb == NULL) |
---|
[31] | 1564 | return NULL; |
---|
[166] | 1565 | |
---|
[178] | 1566 | file_cb->state = (void*)talloc(file_cb, int); |
---|
| 1567 | if(file_cb->state == NULL) |
---|
| 1568 | goto fail; |
---|
| 1569 | *(int*)file_cb->state = fd; |
---|
| 1570 | |
---|
| 1571 | file_cb->cur_off = 0; |
---|
| 1572 | file_cb->size = 0; |
---|
| 1573 | file_cb->read = ®fi_raw_read; |
---|
| 1574 | file_cb->seek = ®fi_raw_seek; |
---|
| 1575 | |
---|
[206] | 1576 | ret_val = regfi_alloc_cb(file_cb, output_encoding); |
---|
[166] | 1577 | if(ret_val == NULL) |
---|
[178] | 1578 | goto fail; |
---|
[166] | 1579 | |
---|
[178] | 1580 | /* In this case, we want file_cb to be freed when ret_val is */ |
---|
[223] | 1581 | talloc_reparent(NULL, ret_val, file_cb); |
---|
[166] | 1582 | return ret_val; |
---|
[178] | 1583 | |
---|
| 1584 | fail: |
---|
| 1585 | talloc_free(file_cb); |
---|
| 1586 | return NULL; |
---|
[166] | 1587 | } |
---|
| 1588 | |
---|
| 1589 | |
---|
[186] | 1590 | /****************************************************************************** |
---|
| 1591 | ******************************************************************************/ |
---|
[223] | 1592 | static int regfi_free_cb(void* f) |
---|
[186] | 1593 | { |
---|
| 1594 | REGFI_FILE* file = (REGFI_FILE*)f; |
---|
[178] | 1595 | |
---|
[186] | 1596 | pthread_mutex_destroy(&file->cb_lock); |
---|
| 1597 | pthread_rwlock_destroy(&file->hbins_lock); |
---|
| 1598 | pthread_mutex_destroy(&file->sk_lock); |
---|
[250] | 1599 | pthread_mutex_destroy(&file->nk_lock); |
---|
| 1600 | pthread_mutex_destroy(&file->mem_lock); |
---|
[186] | 1601 | |
---|
| 1602 | return 0; |
---|
| 1603 | } |
---|
| 1604 | |
---|
| 1605 | |
---|
| 1606 | /****************************************************************************** |
---|
| 1607 | ******************************************************************************/ |
---|
[206] | 1608 | REGFI_FILE* regfi_alloc_cb(REGFI_RAW_FILE* file_cb, |
---|
| 1609 | REGFI_ENCODING output_encoding) |
---|
[166] | 1610 | { |
---|
| 1611 | REGFI_FILE* rb; |
---|
| 1612 | REGFI_HBIN* hbin = NULL; |
---|
[178] | 1613 | uint32_t hbin_off, cache_secret; |
---|
[226] | 1614 | int64_t file_length; |
---|
[166] | 1615 | bool rla; |
---|
| 1616 | |
---|
[178] | 1617 | /* Determine file length. Must be at least big enough for the header |
---|
| 1618 | * and one hbin. |
---|
[137] | 1619 | */ |
---|
[226] | 1620 | file_length = regfi_seek(file_cb, 0, SEEK_END); |
---|
[137] | 1621 | if(file_length < REGFI_REGF_SIZE+REGFI_HBIN_ALLOC) |
---|
[182] | 1622 | { |
---|
| 1623 | regfi_log_add(REGFI_LOG_ERROR, "File length (%d) too short to contain a" |
---|
| 1624 | " header and at least one HBIN.", file_length); |
---|
[137] | 1625 | return NULL; |
---|
[182] | 1626 | } |
---|
[226] | 1627 | regfi_seek(file_cb, 0, SEEK_SET); |
---|
[137] | 1628 | |
---|
[206] | 1629 | if(output_encoding != REGFI_ENCODING_UTF8 |
---|
| 1630 | && output_encoding != REGFI_ENCODING_ASCII) |
---|
| 1631 | { |
---|
| 1632 | regfi_log_add(REGFI_LOG_ERROR, "Invalid output_encoding supplied" |
---|
| 1633 | " in creation of regfi iterator."); |
---|
| 1634 | return NULL; |
---|
| 1635 | } |
---|
| 1636 | |
---|
[166] | 1637 | /* Read file header */ |
---|
[203] | 1638 | if ((rb = regfi_parse_regf(file_cb, false)) == NULL) |
---|
[97] | 1639 | { |
---|
[182] | 1640 | regfi_log_add(REGFI_LOG_ERROR, "Failed to read REGF block."); |
---|
[31] | 1641 | return NULL; |
---|
| 1642 | } |
---|
[203] | 1643 | rb->file_length = file_length; |
---|
[178] | 1644 | rb->cb = file_cb; |
---|
[206] | 1645 | rb->string_encoding = output_encoding; |
---|
[137] | 1646 | |
---|
[186] | 1647 | if(pthread_mutex_init(&rb->cb_lock, NULL) != 0) |
---|
[182] | 1648 | { |
---|
| 1649 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create cb_lock mutex."); |
---|
[180] | 1650 | goto fail; |
---|
[182] | 1651 | } |
---|
[180] | 1652 | |
---|
[186] | 1653 | if(pthread_rwlock_init(&rb->hbins_lock, NULL) != 0) |
---|
[182] | 1654 | { |
---|
| 1655 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create hbins_lock rwlock."); |
---|
[180] | 1656 | goto fail; |
---|
[182] | 1657 | } |
---|
[180] | 1658 | |
---|
[186] | 1659 | if(pthread_mutex_init(&rb->sk_lock, NULL) != 0) |
---|
[182] | 1660 | { |
---|
| 1661 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create sk_lock mutex."); |
---|
[180] | 1662 | goto fail; |
---|
[182] | 1663 | } |
---|
[180] | 1664 | |
---|
[250] | 1665 | if(pthread_mutex_init(&rb->nk_lock, NULL) != 0) |
---|
| 1666 | { |
---|
| 1667 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create nk_lock mutex."); |
---|
| 1668 | goto fail; |
---|
| 1669 | } |
---|
| 1670 | |
---|
[228] | 1671 | if(pthread_mutex_init(&rb->mem_lock, NULL) != 0) |
---|
| 1672 | { |
---|
| 1673 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create mem_lock mutex."); |
---|
| 1674 | goto fail; |
---|
| 1675 | } |
---|
| 1676 | |
---|
[99] | 1677 | rb->hbins = range_list_new(); |
---|
[110] | 1678 | if(rb->hbins == NULL) |
---|
[182] | 1679 | { |
---|
| 1680 | regfi_log_add(REGFI_LOG_ERROR, "Failed to create HBIN range_list."); |
---|
[180] | 1681 | goto fail; |
---|
[182] | 1682 | } |
---|
[223] | 1683 | talloc_reparent(NULL, rb, rb->hbins); |
---|
[150] | 1684 | |
---|
[106] | 1685 | rla = true; |
---|
[135] | 1686 | hbin_off = REGFI_REGF_SIZE; |
---|
[110] | 1687 | hbin = regfi_parse_hbin(rb, hbin_off, true); |
---|
[106] | 1688 | while(hbin && rla) |
---|
| 1689 | { |
---|
[137] | 1690 | rla = range_list_add(rb->hbins, hbin->file_off, hbin->block_size, hbin); |
---|
[148] | 1691 | if(rla) |
---|
[223] | 1692 | talloc_reparent(NULL, rb->hbins, hbin); |
---|
[180] | 1693 | |
---|
[106] | 1694 | hbin_off = hbin->file_off + hbin->block_size; |
---|
[110] | 1695 | hbin = regfi_parse_hbin(rb, hbin_off, true); |
---|
[106] | 1696 | } |
---|
| 1697 | |
---|
[146] | 1698 | /* This secret isn't very secret, but we don't need a good one. This |
---|
| 1699 | * secret is just designed to prevent someone from trying to blow our |
---|
| 1700 | * caching and make things slow. |
---|
| 1701 | */ |
---|
| 1702 | cache_secret = 0x15DEAD05^time(NULL)^(getpid()<<16); |
---|
| 1703 | |
---|
[250] | 1704 | rb->sk_cache = NULL; |
---|
| 1705 | if(REGFI_CACHE_SK_MAX > 0) |
---|
| 1706 | rb->sk_cache = lru_cache_create_ctx(rb, REGFI_CACHE_SK_MAX, |
---|
| 1707 | cache_secret, true); |
---|
[146] | 1708 | |
---|
[250] | 1709 | rb->nk_cache = NULL; |
---|
| 1710 | if(REGFI_CACHE_NK_MAX > 0) |
---|
| 1711 | rb->nk_cache = lru_cache_create_ctx(rb, REGFI_CACHE_NK_MAX, |
---|
| 1712 | cache_secret, true); |
---|
| 1713 | |
---|
[31] | 1714 | /* success */ |
---|
[186] | 1715 | talloc_set_destructor(rb, regfi_free_cb); |
---|
[31] | 1716 | return rb; |
---|
[180] | 1717 | |
---|
| 1718 | fail: |
---|
[186] | 1719 | pthread_mutex_destroy(&rb->cb_lock); |
---|
| 1720 | pthread_rwlock_destroy(&rb->hbins_lock); |
---|
| 1721 | pthread_mutex_destroy(&rb->sk_lock); |
---|
[250] | 1722 | pthread_mutex_destroy(&rb->nk_lock); |
---|
[228] | 1723 | pthread_mutex_destroy(&rb->mem_lock); |
---|
[180] | 1724 | |
---|
| 1725 | range_list_free(rb->hbins); |
---|
| 1726 | talloc_free(rb); |
---|
| 1727 | return NULL; |
---|
[30] | 1728 | } |
---|
| 1729 | |
---|
| 1730 | |
---|
[148] | 1731 | /****************************************************************************** |
---|
| 1732 | ******************************************************************************/ |
---|
[186] | 1733 | void regfi_free(REGFI_FILE* file) |
---|
[166] | 1734 | { |
---|
[186] | 1735 | /* Callback handles cleanup side effects */ |
---|
[150] | 1736 | talloc_free(file); |
---|
[30] | 1737 | } |
---|
| 1738 | |
---|
| 1739 | |
---|
[80] | 1740 | /****************************************************************************** |
---|
[158] | 1741 | * First checks the offset given by the file header, then checks the |
---|
| 1742 | * rest of the file if that fails. |
---|
[148] | 1743 | ******************************************************************************/ |
---|
[215] | 1744 | const REGFI_NK* regfi_get_rootkey(REGFI_FILE* file) |
---|
[30] | 1745 | { |
---|
[203] | 1746 | REGFI_NK* nk = NULL; |
---|
[146] | 1747 | REGFI_HBIN* hbin; |
---|
[168] | 1748 | uint32_t root_offset, i, num_hbins; |
---|
[99] | 1749 | |
---|
| 1750 | if(!file) |
---|
[31] | 1751 | return NULL; |
---|
[99] | 1752 | |
---|
[158] | 1753 | root_offset = file->root_cell+REGFI_REGF_SIZE; |
---|
[206] | 1754 | nk = regfi_load_key(file, root_offset, file->string_encoding, true); |
---|
[158] | 1755 | if(nk != NULL) |
---|
| 1756 | { |
---|
[161] | 1757 | if(nk->flags & REGFI_NK_FLAG_ROOT) |
---|
[158] | 1758 | return nk; |
---|
| 1759 | } |
---|
| 1760 | |
---|
[182] | 1761 | regfi_log_add(REGFI_LOG_WARN, "File header indicated root key at" |
---|
| 1762 | " location 0x%.8X, but no root key found." |
---|
| 1763 | " Searching rest of file...", root_offset); |
---|
[158] | 1764 | |
---|
| 1765 | /* If the file header gives bad info, scan through the file one HBIN |
---|
| 1766 | * block at a time looking for an NK record with a root key type. |
---|
[146] | 1767 | */ |
---|
[180] | 1768 | |
---|
[215] | 1769 | if(!regfi_read_lock(file, &file->hbins_lock, "regfi_get_rootkey")) |
---|
[180] | 1770 | return NULL; |
---|
| 1771 | |
---|
[107] | 1772 | num_hbins = range_list_size(file->hbins); |
---|
[158] | 1773 | for(i=0; i < num_hbins && nk == NULL; i++) |
---|
[99] | 1774 | { |
---|
[135] | 1775 | hbin = (REGFI_HBIN*)range_list_get(file->hbins, i)->data; |
---|
[206] | 1776 | nk = regfi_find_root_nk(file, hbin, file->string_encoding); |
---|
[31] | 1777 | } |
---|
[30] | 1778 | |
---|
[215] | 1779 | if(!regfi_rw_unlock(file, &file->hbins_lock, "regfi_get_rootkey")) |
---|
[180] | 1780 | return NULL; |
---|
| 1781 | |
---|
[80] | 1782 | return nk; |
---|
[30] | 1783 | } |
---|
| 1784 | |
---|
| 1785 | |
---|
[80] | 1786 | /****************************************************************************** |
---|
| 1787 | *****************************************************************************/ |
---|
[228] | 1788 | void regfi_free_record(REGFI_FILE* file, const void* record) |
---|
[30] | 1789 | { |
---|
[228] | 1790 | if(!regfi_lock(file, &file->mem_lock, "regfi_free_record")) |
---|
| 1791 | return; |
---|
| 1792 | |
---|
[184] | 1793 | talloc_unlink(NULL, (void*)record); |
---|
[228] | 1794 | |
---|
| 1795 | regfi_unlock(file, &file->mem_lock, "regfi_free_record"); |
---|
[150] | 1796 | } |
---|
[127] | 1797 | |
---|
[80] | 1798 | |
---|
[224] | 1799 | /****************************************************************************** |
---|
| 1800 | *****************************************************************************/ |
---|
[228] | 1801 | bool regfi_reference_record(REGFI_FILE* file, const void* record) |
---|
[224] | 1802 | { |
---|
[228] | 1803 | bool ret_val = false; |
---|
| 1804 | if(!regfi_lock(file, &file->mem_lock, "regfi_reference_record")) |
---|
| 1805 | return ret_val; |
---|
| 1806 | |
---|
[224] | 1807 | if(talloc_reference(NULL, record) != NULL) |
---|
[228] | 1808 | ret_val = true; |
---|
| 1809 | |
---|
| 1810 | regfi_unlock(file, &file->mem_lock, "regfi_reference_record"); |
---|
| 1811 | return ret_val; |
---|
[224] | 1812 | } |
---|
[80] | 1813 | |
---|
[207] | 1814 | |
---|
[80] | 1815 | /****************************************************************************** |
---|
| 1816 | *****************************************************************************/ |
---|
[207] | 1817 | uint32_t regfi_fetch_num_subkeys(const REGFI_NK* key) |
---|
| 1818 | { |
---|
| 1819 | uint32_t num_in_list = 0; |
---|
[215] | 1820 | if(key == NULL) |
---|
| 1821 | return 0; |
---|
| 1822 | |
---|
[207] | 1823 | if(key->subkeys != NULL) |
---|
| 1824 | num_in_list = key->subkeys->num_keys; |
---|
| 1825 | |
---|
| 1826 | if(num_in_list != key->num_subkeys) |
---|
| 1827 | { |
---|
| 1828 | regfi_log_add(REGFI_LOG_INFO, "Key at offset 0x%.8X contains %d keys in its" |
---|
| 1829 | " subkey list but reports %d should be available.", |
---|
| 1830 | key->offset, num_in_list, key->num_subkeys); |
---|
| 1831 | return (num_in_list < key->num_subkeys)?num_in_list:key->num_subkeys; |
---|
| 1832 | } |
---|
| 1833 | |
---|
| 1834 | return num_in_list; |
---|
| 1835 | } |
---|
| 1836 | |
---|
| 1837 | |
---|
| 1838 | /****************************************************************************** |
---|
| 1839 | *****************************************************************************/ |
---|
| 1840 | uint32_t regfi_fetch_num_values(const REGFI_NK* key) |
---|
| 1841 | { |
---|
| 1842 | uint32_t num_in_list = 0; |
---|
[215] | 1843 | if(key == NULL) |
---|
| 1844 | return 0; |
---|
| 1845 | |
---|
[207] | 1846 | if(key->values != NULL) |
---|
| 1847 | num_in_list = key->values->num_values; |
---|
| 1848 | |
---|
| 1849 | if(num_in_list != key->num_values) |
---|
| 1850 | { |
---|
| 1851 | regfi_log_add(REGFI_LOG_INFO, "Key at offset 0x%.8X contains %d values in" |
---|
| 1852 | " its value list but reports %d should be available.", |
---|
| 1853 | key->offset, num_in_list, key->num_values); |
---|
| 1854 | return (num_in_list < key->num_values)?num_in_list:key->num_values; |
---|
| 1855 | } |
---|
| 1856 | |
---|
| 1857 | return num_in_list; |
---|
| 1858 | } |
---|
| 1859 | |
---|
| 1860 | |
---|
| 1861 | /****************************************************************************** |
---|
| 1862 | *****************************************************************************/ |
---|
[206] | 1863 | REGFI_ITERATOR* regfi_iterator_new(REGFI_FILE* file) |
---|
[80] | 1864 | { |
---|
[203] | 1865 | REGFI_NK* root; |
---|
[161] | 1866 | REGFI_ITERATOR* ret_val; |
---|
| 1867 | |
---|
| 1868 | ret_val = talloc(NULL, REGFI_ITERATOR); |
---|
[80] | 1869 | if(ret_val == NULL) |
---|
| 1870 | return NULL; |
---|
[249] | 1871 | |
---|
| 1872 | ret_val->cur = talloc(ret_val, REGFI_ITER_POSITION); |
---|
| 1873 | if(ret_val->cur == NULL) |
---|
[80] | 1874 | { |
---|
[150] | 1875 | talloc_free(ret_val); |
---|
[80] | 1876 | return NULL; |
---|
| 1877 | } |
---|
| 1878 | |
---|
[135] | 1879 | ret_val->key_positions = void_stack_new(REGFI_MAX_DEPTH); |
---|
[80] | 1880 | if(ret_val->key_positions == NULL) |
---|
| 1881 | { |
---|
[150] | 1882 | talloc_free(ret_val); |
---|
[80] | 1883 | return NULL; |
---|
| 1884 | } |
---|
[223] | 1885 | talloc_reparent(NULL, ret_val, ret_val->key_positions); |
---|
[80] | 1886 | |
---|
[249] | 1887 | root = (REGFI_NK*)regfi_get_rootkey(file); |
---|
| 1888 | if(root == NULL) |
---|
| 1889 | { |
---|
| 1890 | talloc_free(ret_val); |
---|
| 1891 | return NULL; |
---|
| 1892 | } |
---|
| 1893 | |
---|
| 1894 | ret_val->cur->offset = root->offset; |
---|
| 1895 | if(root->subkeys_off == REGFI_OFFSET_NONE) |
---|
| 1896 | ret_val->cur->num_subkeys = 0; |
---|
| 1897 | else |
---|
| 1898 | ret_val->cur->num_subkeys = regfi_fetch_num_subkeys(root); |
---|
| 1899 | |
---|
| 1900 | if(root->values_off == REGFI_OFFSET_NONE) |
---|
| 1901 | ret_val->cur->num_values = 0; |
---|
| 1902 | else |
---|
| 1903 | ret_val->cur->num_values = regfi_fetch_num_values(root); |
---|
| 1904 | |
---|
| 1905 | ret_val->cur->cur_subkey = 0; |
---|
| 1906 | ret_val->cur->cur_value = 0; |
---|
[159] | 1907 | ret_val->f = file; |
---|
[249] | 1908 | |
---|
| 1909 | regfi_free_record(ret_val->f, root); |
---|
[80] | 1910 | return ret_val; |
---|
| 1911 | } |
---|
| 1912 | |
---|
| 1913 | |
---|
| 1914 | /****************************************************************************** |
---|
| 1915 | *****************************************************************************/ |
---|
| 1916 | void regfi_iterator_free(REGFI_ITERATOR* i) |
---|
| 1917 | { |
---|
[228] | 1918 | talloc_unlink(NULL, i); |
---|
[80] | 1919 | } |
---|
| 1920 | |
---|
| 1921 | |
---|
| 1922 | /****************************************************************************** |
---|
| 1923 | *****************************************************************************/ |
---|
| 1924 | /* XXX: some way of indicating reason for failure should be added. */ |
---|
| 1925 | bool regfi_iterator_down(REGFI_ITERATOR* i) |
---|
| 1926 | { |
---|
[203] | 1927 | REGFI_NK* subkey; |
---|
[249] | 1928 | REGFI_ITER_POSITION* pos = talloc(i, REGFI_ITER_POSITION); |
---|
[80] | 1929 | if(pos == NULL) |
---|
| 1930 | return false; |
---|
| 1931 | |
---|
[203] | 1932 | subkey = (REGFI_NK*)regfi_iterator_cur_subkey(i); |
---|
[80] | 1933 | if(subkey == NULL) |
---|
| 1934 | { |
---|
[249] | 1935 | regfi_log_add(REGFI_LOG_WARN, "Could not obtain cur_subkey during" |
---|
| 1936 | " iterator_down with subkey index (%d) and key offset=%.8X\n", |
---|
| 1937 | i->cur->cur_subkey, i->cur->offset); |
---|
[150] | 1938 | talloc_free(pos); |
---|
[80] | 1939 | return false; |
---|
| 1940 | } |
---|
| 1941 | |
---|
[249] | 1942 | if(!void_stack_push(i->key_positions, i->cur)) |
---|
[80] | 1943 | { |
---|
[150] | 1944 | talloc_free(pos); |
---|
[249] | 1945 | regfi_free_record(i->f, subkey); |
---|
[80] | 1946 | return false; |
---|
[249] | 1947 | } |
---|
[80] | 1948 | |
---|
[249] | 1949 | pos->offset = subkey->offset; |
---|
| 1950 | if(subkey->subkeys_off == REGFI_OFFSET_NONE) |
---|
| 1951 | pos->num_subkeys = 0; |
---|
| 1952 | else |
---|
| 1953 | pos->num_subkeys = regfi_fetch_num_subkeys(subkey); |
---|
[80] | 1954 | |
---|
[249] | 1955 | if(subkey->values_off == REGFI_OFFSET_NONE) |
---|
| 1956 | pos->num_values = 0; |
---|
| 1957 | else |
---|
| 1958 | pos->num_values = regfi_fetch_num_values(subkey); |
---|
| 1959 | |
---|
| 1960 | pos->cur_subkey = 0; |
---|
| 1961 | pos->cur_value = 0; |
---|
| 1962 | i->cur = pos; |
---|
| 1963 | |
---|
| 1964 | regfi_free_record(i->f, subkey); |
---|
[80] | 1965 | return true; |
---|
| 1966 | } |
---|
| 1967 | |
---|
| 1968 | |
---|
| 1969 | /****************************************************************************** |
---|
| 1970 | *****************************************************************************/ |
---|
| 1971 | bool regfi_iterator_up(REGFI_ITERATOR* i) |
---|
| 1972 | { |
---|
| 1973 | REGFI_ITER_POSITION* pos; |
---|
| 1974 | |
---|
| 1975 | pos = (REGFI_ITER_POSITION*)void_stack_pop(i->key_positions); |
---|
| 1976 | if(pos == NULL) |
---|
| 1977 | return false; |
---|
| 1978 | |
---|
[228] | 1979 | if(!regfi_lock(i->f, &i->f->mem_lock, "regfi_iterator_up")) |
---|
| 1980 | return false; |
---|
| 1981 | |
---|
[249] | 1982 | talloc_unlink(i, i->cur); |
---|
| 1983 | |
---|
[228] | 1984 | regfi_unlock(i->f, &i->f->mem_lock, "regfi_iterator_up"); |
---|
| 1985 | |
---|
[249] | 1986 | i->cur = pos; |
---|
[80] | 1987 | return true; |
---|
| 1988 | } |
---|
| 1989 | |
---|
| 1990 | |
---|
| 1991 | /****************************************************************************** |
---|
| 1992 | *****************************************************************************/ |
---|
| 1993 | bool regfi_iterator_to_root(REGFI_ITERATOR* i) |
---|
| 1994 | { |
---|
| 1995 | while(regfi_iterator_up(i)) |
---|
| 1996 | continue; |
---|
| 1997 | |
---|
| 1998 | return true; |
---|
| 1999 | } |
---|
| 2000 | |
---|
| 2001 | |
---|
| 2002 | /****************************************************************************** |
---|
| 2003 | *****************************************************************************/ |
---|
[207] | 2004 | bool regfi_iterator_find_subkey(REGFI_ITERATOR* i, const char* name) |
---|
[80] | 2005 | { |
---|
[249] | 2006 | const REGFI_NK* cur_key; |
---|
[207] | 2007 | uint32_t new_index; |
---|
[249] | 2008 | bool ret_val = false; |
---|
[133] | 2009 | |
---|
[249] | 2010 | cur_key = regfi_iterator_cur_key(i); |
---|
| 2011 | if(cur_key == NULL) |
---|
| 2012 | /* XXX: report error */ |
---|
| 2013 | return ret_val; |
---|
| 2014 | |
---|
| 2015 | if(regfi_find_subkey(i->f, cur_key, name, &new_index)) |
---|
[80] | 2016 | { |
---|
[249] | 2017 | i->cur->cur_subkey = new_index; |
---|
| 2018 | ret_val = true; |
---|
[80] | 2019 | } |
---|
| 2020 | |
---|
[249] | 2021 | regfi_free_record(i->f, cur_key); |
---|
| 2022 | return ret_val; |
---|
[80] | 2023 | } |
---|
| 2024 | |
---|
| 2025 | |
---|
| 2026 | /****************************************************************************** |
---|
| 2027 | *****************************************************************************/ |
---|
| 2028 | bool regfi_iterator_walk_path(REGFI_ITERATOR* i, const char** path) |
---|
| 2029 | { |
---|
[168] | 2030 | uint32_t x; |
---|
[80] | 2031 | if(path == NULL) |
---|
| 2032 | return false; |
---|
| 2033 | |
---|
| 2034 | for(x=0; |
---|
| 2035 | ((path[x] != NULL) && regfi_iterator_find_subkey(i, path[x]) |
---|
| 2036 | && regfi_iterator_down(i)); |
---|
| 2037 | x++) |
---|
| 2038 | { continue; } |
---|
| 2039 | |
---|
| 2040 | if(path[x] == NULL) |
---|
[215] | 2041 | { |
---|
[80] | 2042 | return true; |
---|
[215] | 2043 | } |
---|
| 2044 | |
---|
[80] | 2045 | /* XXX: is this the right number of times? */ |
---|
| 2046 | for(; x > 0; x--) |
---|
| 2047 | regfi_iterator_up(i); |
---|
| 2048 | |
---|
| 2049 | return false; |
---|
| 2050 | } |
---|
| 2051 | |
---|
| 2052 | |
---|
| 2053 | /****************************************************************************** |
---|
| 2054 | *****************************************************************************/ |
---|
[203] | 2055 | const REGFI_NK* regfi_iterator_cur_key(REGFI_ITERATOR* i) |
---|
[80] | 2056 | { |
---|
[228] | 2057 | const REGFI_NK* ret_val = NULL; |
---|
| 2058 | |
---|
[249] | 2059 | ret_val = regfi_load_key(i->f, i->cur->offset, i->f->string_encoding, true); |
---|
[228] | 2060 | return ret_val; |
---|
[80] | 2061 | } |
---|
| 2062 | |
---|
| 2063 | |
---|
| 2064 | /****************************************************************************** |
---|
| 2065 | *****************************************************************************/ |
---|
[206] | 2066 | const REGFI_SK* regfi_fetch_sk(REGFI_FILE* file, const REGFI_NK* key) |
---|
[109] | 2067 | { |
---|
[206] | 2068 | if(key == NULL || key->sk_off == REGFI_OFFSET_NONE) |
---|
[109] | 2069 | return NULL; |
---|
| 2070 | |
---|
[206] | 2071 | return regfi_load_sk(file, key->sk_off + REGFI_REGF_SIZE, true); |
---|
[109] | 2072 | } |
---|
| 2073 | |
---|
| 2074 | |
---|
| 2075 | /****************************************************************************** |
---|
| 2076 | *****************************************************************************/ |
---|
[199] | 2077 | bool regfi_iterator_first_subkey(REGFI_ITERATOR* i) |
---|
[80] | 2078 | { |
---|
[249] | 2079 | i->cur->cur_subkey = 0; |
---|
| 2080 | return (i->cur->cur_subkey < i->cur->num_subkeys); |
---|
[80] | 2081 | } |
---|
| 2082 | |
---|
| 2083 | |
---|
| 2084 | /****************************************************************************** |
---|
| 2085 | *****************************************************************************/ |
---|
[203] | 2086 | const REGFI_NK* regfi_iterator_cur_subkey(REGFI_ITERATOR* i) |
---|
[80] | 2087 | { |
---|
[249] | 2088 | const REGFI_NK* cur_key; |
---|
| 2089 | const REGFI_NK* ret_val; |
---|
| 2090 | |
---|
| 2091 | cur_key = regfi_iterator_cur_key(i); |
---|
| 2092 | if(cur_key == NULL) |
---|
| 2093 | /* XXX: report error */ |
---|
| 2094 | return NULL; |
---|
| 2095 | |
---|
| 2096 | ret_val = regfi_get_subkey(i->f, cur_key, i->cur->cur_subkey); |
---|
| 2097 | |
---|
| 2098 | regfi_free_record(i->f, cur_key); |
---|
| 2099 | return ret_val; |
---|
[30] | 2100 | } |
---|
[80] | 2101 | |
---|
| 2102 | |
---|
| 2103 | /****************************************************************************** |
---|
| 2104 | *****************************************************************************/ |
---|
[199] | 2105 | bool regfi_iterator_next_subkey(REGFI_ITERATOR* i) |
---|
[80] | 2106 | { |
---|
[249] | 2107 | i->cur->cur_subkey++; |
---|
| 2108 | return (i->cur->cur_subkey < i->cur->num_subkeys); |
---|
[80] | 2109 | } |
---|
| 2110 | |
---|
| 2111 | |
---|
| 2112 | /****************************************************************************** |
---|
| 2113 | *****************************************************************************/ |
---|
[207] | 2114 | bool regfi_iterator_find_value(REGFI_ITERATOR* i, const char* name) |
---|
[80] | 2115 | { |
---|
[249] | 2116 | const REGFI_NK* cur_key; |
---|
[207] | 2117 | uint32_t new_index; |
---|
[249] | 2118 | bool ret_val = false; |
---|
[80] | 2119 | |
---|
[249] | 2120 | cur_key = regfi_iterator_cur_key(i); |
---|
| 2121 | if(cur_key == NULL) |
---|
| 2122 | /* XXX: report error */ |
---|
| 2123 | return ret_val; |
---|
| 2124 | |
---|
| 2125 | if(regfi_find_value(i->f, cur_key, name, &new_index)) |
---|
[80] | 2126 | { |
---|
[249] | 2127 | i->cur->cur_value = new_index; |
---|
| 2128 | ret_val = true; |
---|
[80] | 2129 | } |
---|
| 2130 | |
---|
[249] | 2131 | regfi_free_record(i->f, cur_key); |
---|
| 2132 | return ret_val; |
---|
[80] | 2133 | } |
---|
| 2134 | |
---|
| 2135 | |
---|
| 2136 | /****************************************************************************** |
---|
| 2137 | *****************************************************************************/ |
---|
[199] | 2138 | bool regfi_iterator_first_value(REGFI_ITERATOR* i) |
---|
[80] | 2139 | { |
---|
[249] | 2140 | i->cur->cur_value = 0; |
---|
| 2141 | return (i->cur->cur_value < i->cur->num_values); |
---|
[80] | 2142 | } |
---|
| 2143 | |
---|
| 2144 | |
---|
| 2145 | /****************************************************************************** |
---|
| 2146 | *****************************************************************************/ |
---|
[203] | 2147 | const REGFI_VK* regfi_iterator_cur_value(REGFI_ITERATOR* i) |
---|
[80] | 2148 | { |
---|
[249] | 2149 | const REGFI_NK* cur_key; |
---|
| 2150 | const REGFI_VK* ret_val = NULL; |
---|
| 2151 | |
---|
| 2152 | cur_key = regfi_iterator_cur_key(i); |
---|
| 2153 | if(cur_key == NULL) |
---|
| 2154 | /* XXX: report error */ |
---|
| 2155 | return ret_val; |
---|
| 2156 | |
---|
| 2157 | ret_val = regfi_get_value(i->f, cur_key, i->cur->cur_value); |
---|
| 2158 | |
---|
| 2159 | regfi_free_record(i->f, cur_key); |
---|
| 2160 | return ret_val; |
---|
[80] | 2161 | } |
---|
| 2162 | |
---|
| 2163 | |
---|
| 2164 | /****************************************************************************** |
---|
| 2165 | *****************************************************************************/ |
---|
[199] | 2166 | bool regfi_iterator_next_value(REGFI_ITERATOR* i) |
---|
[80] | 2167 | { |
---|
[249] | 2168 | i->cur->cur_value++; |
---|
| 2169 | return (i->cur->cur_value < i->cur->num_values); |
---|
[80] | 2170 | } |
---|
[97] | 2171 | |
---|
| 2172 | |
---|
[249] | 2173 | |
---|
| 2174 | |
---|
[159] | 2175 | /****************************************************************************** |
---|
| 2176 | *****************************************************************************/ |
---|
[249] | 2177 | const REGFI_NK** regfi_iterator_cur_path(REGFI_ITERATOR* i) |
---|
| 2178 | { |
---|
| 2179 | REGFI_NK** ret_val; |
---|
| 2180 | void_stack_iterator* iter; |
---|
| 2181 | const REGFI_ITER_POSITION* cur; |
---|
[250] | 2182 | uint16_t k, num_keys; |
---|
[249] | 2183 | |
---|
[250] | 2184 | num_keys = void_stack_size(i->key_positions)+1; |
---|
| 2185 | ret_val = talloc_array(NULL, REGFI_NK*, num_keys+1); |
---|
[249] | 2186 | if(ret_val == NULL) |
---|
| 2187 | return NULL; |
---|
| 2188 | |
---|
| 2189 | iter = void_stack_iterator_new(i->key_positions); |
---|
| 2190 | if (iter == NULL) |
---|
| 2191 | { |
---|
| 2192 | talloc_free(ret_val); |
---|
| 2193 | return NULL; |
---|
| 2194 | } |
---|
[250] | 2195 | |
---|
| 2196 | k=0; |
---|
| 2197 | for(cur=void_stack_iterator_next(iter); |
---|
| 2198 | cur != NULL; cur=void_stack_iterator_next(iter)) |
---|
| 2199 | { |
---|
| 2200 | ret_val[k++] = regfi_load_key(i->f, cur->offset, i->f->string_encoding, true); |
---|
| 2201 | } |
---|
| 2202 | ret_val[k] = regfi_load_key(i->f, i->cur->offset, i->f->string_encoding, true); |
---|
| 2203 | void_stack_iterator_free(iter); |
---|
| 2204 | |
---|
[249] | 2205 | if(!regfi_lock(i->f, &i->f->mem_lock, "regfi_cur_path")) |
---|
| 2206 | { |
---|
| 2207 | talloc_free(ret_val); |
---|
| 2208 | return NULL; |
---|
| 2209 | } |
---|
| 2210 | |
---|
[250] | 2211 | for(k=0; k<num_keys; k++) |
---|
[249] | 2212 | talloc_reparent(NULL, ret_val, ret_val[k]); |
---|
| 2213 | |
---|
| 2214 | regfi_unlock(i->f, &i->f->mem_lock, "regfi_cur_path"); |
---|
| 2215 | |
---|
[250] | 2216 | ret_val[k] = NULL; |
---|
[249] | 2217 | return (const REGFI_NK**)ret_val; |
---|
| 2218 | } |
---|
| 2219 | |
---|
| 2220 | |
---|
| 2221 | /****************************************************************************** |
---|
| 2222 | *****************************************************************************/ |
---|
[206] | 2223 | const REGFI_CLASSNAME* regfi_fetch_classname(REGFI_FILE* file, |
---|
| 2224 | const REGFI_NK* key) |
---|
[160] | 2225 | { |
---|
| 2226 | REGFI_CLASSNAME* ret_val; |
---|
[168] | 2227 | uint8_t* raw; |
---|
[160] | 2228 | char* interpreted; |
---|
[168] | 2229 | uint32_t offset; |
---|
| 2230 | int32_t conv_size, max_size; |
---|
| 2231 | uint16_t parse_length; |
---|
[160] | 2232 | |
---|
| 2233 | if(key->classname_off == REGFI_OFFSET_NONE || key->classname_length == 0) |
---|
| 2234 | return NULL; |
---|
| 2235 | |
---|
| 2236 | offset = key->classname_off + REGFI_REGF_SIZE; |
---|
[206] | 2237 | max_size = regfi_calc_maxsize(file, offset); |
---|
[160] | 2238 | if(max_size <= 0) |
---|
| 2239 | return NULL; |
---|
| 2240 | |
---|
| 2241 | parse_length = key->classname_length; |
---|
[206] | 2242 | raw = regfi_parse_classname(file, offset, &parse_length, max_size, true); |
---|
[160] | 2243 | |
---|
| 2244 | if(raw == NULL) |
---|
| 2245 | { |
---|
[182] | 2246 | regfi_log_add(REGFI_LOG_WARN, "Could not parse class" |
---|
| 2247 | " name at offset 0x%.8X for key record at offset 0x%.8X.", |
---|
| 2248 | offset, key->offset); |
---|
[160] | 2249 | return NULL; |
---|
| 2250 | } |
---|
| 2251 | |
---|
| 2252 | ret_val = talloc(NULL, REGFI_CLASSNAME); |
---|
| 2253 | if(ret_val == NULL) |
---|
| 2254 | return NULL; |
---|
| 2255 | |
---|
[206] | 2256 | ret_val->offset = offset; |
---|
[160] | 2257 | ret_val->raw = raw; |
---|
| 2258 | ret_val->size = parse_length; |
---|
[223] | 2259 | talloc_reparent(NULL, ret_val, raw); |
---|
[160] | 2260 | |
---|
| 2261 | interpreted = talloc_array(NULL, char, parse_length); |
---|
| 2262 | |
---|
[161] | 2263 | conv_size = regfi_conv_charset(regfi_encoding_int2str(REGFI_ENCODING_UTF16LE), |
---|
[206] | 2264 | regfi_encoding_int2str(file->string_encoding), |
---|
[160] | 2265 | raw, interpreted, |
---|
| 2266 | parse_length, parse_length); |
---|
| 2267 | if(conv_size < 0) |
---|
| 2268 | { |
---|
[182] | 2269 | regfi_log_add(REGFI_LOG_WARN, "Error occurred while" |
---|
| 2270 | " converting classname to charset %s. Error message: %s", |
---|
[206] | 2271 | file->string_encoding, strerror(-conv_size)); |
---|
[160] | 2272 | talloc_free(interpreted); |
---|
| 2273 | ret_val->interpreted = NULL; |
---|
| 2274 | } |
---|
| 2275 | else |
---|
| 2276 | { |
---|
[223] | 2277 | /* XXX: check for NULL return here? */ |
---|
[160] | 2278 | interpreted = talloc_realloc(NULL, interpreted, char, conv_size); |
---|
| 2279 | ret_val->interpreted = interpreted; |
---|
[223] | 2280 | talloc_reparent(NULL, ret_val, interpreted); |
---|
[160] | 2281 | } |
---|
| 2282 | |
---|
| 2283 | return ret_val; |
---|
| 2284 | } |
---|
| 2285 | |
---|
| 2286 | |
---|
| 2287 | /****************************************************************************** |
---|
| 2288 | *****************************************************************************/ |
---|
[206] | 2289 | const REGFI_DATA* regfi_fetch_data(REGFI_FILE* file, |
---|
| 2290 | const REGFI_VK* value) |
---|
[159] | 2291 | { |
---|
| 2292 | REGFI_DATA* ret_val = NULL; |
---|
| 2293 | REGFI_BUFFER raw_data; |
---|
| 2294 | |
---|
| 2295 | if(value->data_size != 0) |
---|
| 2296 | { |
---|
[206] | 2297 | raw_data = regfi_load_data(file, value->data_off, value->data_size, |
---|
[209] | 2298 | value->data_in_offset, true); |
---|
[159] | 2299 | if(raw_data.buf == NULL) |
---|
| 2300 | { |
---|
[182] | 2301 | regfi_log_add(REGFI_LOG_WARN, "Could not parse data record" |
---|
| 2302 | " while parsing VK record at offset 0x%.8X.", |
---|
| 2303 | value->offset); |
---|
[159] | 2304 | } |
---|
| 2305 | else |
---|
| 2306 | { |
---|
| 2307 | ret_val = regfi_buffer_to_data(raw_data); |
---|
| 2308 | |
---|
| 2309 | if(ret_val == NULL) |
---|
| 2310 | { |
---|
[182] | 2311 | regfi_log_add(REGFI_LOG_WARN, "Error occurred in converting" |
---|
| 2312 | " data buffer to data structure while interpreting " |
---|
| 2313 | "data for VK record at offset 0x%.8X.", |
---|
| 2314 | value->offset); |
---|
[159] | 2315 | talloc_free(raw_data.buf); |
---|
| 2316 | return NULL; |
---|
| 2317 | } |
---|
| 2318 | |
---|
[206] | 2319 | if(!regfi_interpret_data(file, file->string_encoding, |
---|
| 2320 | value->type, ret_val)) |
---|
[159] | 2321 | { |
---|
[182] | 2322 | regfi_log_add(REGFI_LOG_INFO, "Error occurred while" |
---|
| 2323 | " interpreting data for VK record at offset 0x%.8X.", |
---|
| 2324 | value->offset); |
---|
[159] | 2325 | } |
---|
| 2326 | } |
---|
| 2327 | } |
---|
| 2328 | |
---|
| 2329 | return ret_val; |
---|
| 2330 | } |
---|
| 2331 | |
---|
| 2332 | |
---|
[207] | 2333 | |
---|
[159] | 2334 | /****************************************************************************** |
---|
| 2335 | *****************************************************************************/ |
---|
[207] | 2336 | bool regfi_find_subkey(REGFI_FILE* file, const REGFI_NK* key, |
---|
| 2337 | const char* name, uint32_t* index) |
---|
| 2338 | { |
---|
| 2339 | const REGFI_NK* cur; |
---|
| 2340 | uint32_t i; |
---|
| 2341 | uint32_t num_subkeys = regfi_fetch_num_subkeys(key); |
---|
| 2342 | bool found = false; |
---|
| 2343 | |
---|
| 2344 | /* XXX: cur->name can be NULL in the registry. |
---|
| 2345 | * Should we allow for a way to search for that? |
---|
| 2346 | */ |
---|
| 2347 | if(name == NULL) |
---|
| 2348 | return false; |
---|
| 2349 | |
---|
| 2350 | for(i=0; (i < num_subkeys) && (found == false); i++) |
---|
| 2351 | { |
---|
| 2352 | cur = regfi_get_subkey(file, key, i); |
---|
| 2353 | if(cur == NULL) |
---|
| 2354 | return false; |
---|
| 2355 | |
---|
| 2356 | if((cur->name != NULL) |
---|
| 2357 | && (strcasecmp(cur->name, name) == 0)) |
---|
| 2358 | { |
---|
| 2359 | found = true; |
---|
| 2360 | *index = i; |
---|
| 2361 | } |
---|
| 2362 | |
---|
[228] | 2363 | regfi_free_record(file, cur); |
---|
[207] | 2364 | } |
---|
| 2365 | |
---|
| 2366 | return found; |
---|
| 2367 | } |
---|
| 2368 | |
---|
| 2369 | |
---|
| 2370 | |
---|
| 2371 | /****************************************************************************** |
---|
| 2372 | *****************************************************************************/ |
---|
| 2373 | bool regfi_find_value(REGFI_FILE* file, const REGFI_NK* key, |
---|
| 2374 | const char* name, uint32_t* index) |
---|
| 2375 | { |
---|
| 2376 | const REGFI_VK* cur; |
---|
| 2377 | uint32_t i; |
---|
| 2378 | uint32_t num_values = regfi_fetch_num_values(key); |
---|
| 2379 | bool found = false; |
---|
| 2380 | |
---|
| 2381 | /* XXX: cur->name can be NULL in the registry. |
---|
| 2382 | * Should we allow for a way to search for that? |
---|
| 2383 | */ |
---|
| 2384 | if(name == NULL) |
---|
| 2385 | return false; |
---|
| 2386 | |
---|
| 2387 | for(i=0; (i < num_values) && (found == false); i++) |
---|
| 2388 | { |
---|
| 2389 | cur = regfi_get_value(file, key, i); |
---|
| 2390 | if(cur == NULL) |
---|
| 2391 | return false; |
---|
| 2392 | |
---|
| 2393 | if((cur->name != NULL) |
---|
| 2394 | && (strcasecmp(cur->name, name) == 0)) |
---|
| 2395 | { |
---|
| 2396 | found = true; |
---|
| 2397 | *index = i; |
---|
| 2398 | } |
---|
| 2399 | |
---|
[228] | 2400 | regfi_free_record(file, cur); |
---|
[207] | 2401 | } |
---|
| 2402 | |
---|
| 2403 | return found; |
---|
| 2404 | } |
---|
| 2405 | |
---|
| 2406 | |
---|
| 2407 | |
---|
| 2408 | /****************************************************************************** |
---|
| 2409 | *****************************************************************************/ |
---|
| 2410 | const REGFI_NK* regfi_get_subkey(REGFI_FILE* file, const REGFI_NK* key, |
---|
| 2411 | uint32_t index) |
---|
| 2412 | { |
---|
| 2413 | if(index < regfi_fetch_num_subkeys(key)) |
---|
| 2414 | { |
---|
| 2415 | return regfi_load_key(file, |
---|
| 2416 | key->subkeys->elements[index].offset+REGFI_REGF_SIZE, |
---|
| 2417 | file->string_encoding, true); |
---|
| 2418 | } |
---|
| 2419 | |
---|
| 2420 | return NULL; |
---|
| 2421 | } |
---|
| 2422 | |
---|
| 2423 | |
---|
| 2424 | /****************************************************************************** |
---|
| 2425 | *****************************************************************************/ |
---|
| 2426 | const REGFI_VK* regfi_get_value(REGFI_FILE* file, const REGFI_NK* key, |
---|
| 2427 | uint32_t index) |
---|
| 2428 | { |
---|
| 2429 | if(index < regfi_fetch_num_values(key)) |
---|
| 2430 | { |
---|
| 2431 | return regfi_load_value(file, |
---|
| 2432 | key->values->elements[index]+REGFI_REGF_SIZE, |
---|
| 2433 | file->string_encoding, true); |
---|
| 2434 | } |
---|
| 2435 | |
---|
| 2436 | return NULL; |
---|
| 2437 | } |
---|
| 2438 | |
---|
| 2439 | |
---|
[215] | 2440 | |
---|
[207] | 2441 | /****************************************************************************** |
---|
| 2442 | *****************************************************************************/ |
---|
[215] | 2443 | const REGFI_NK* regfi_get_parentkey(REGFI_FILE* file, const REGFI_NK* key) |
---|
| 2444 | { |
---|
| 2445 | if(key != NULL && key->parent_off != REGFI_OFFSET_NONE) |
---|
| 2446 | return regfi_load_key(file, |
---|
| 2447 | key->parent_off+REGFI_REGF_SIZE, |
---|
| 2448 | file->string_encoding, true); |
---|
[228] | 2449 | |
---|
[215] | 2450 | return NULL; |
---|
| 2451 | } |
---|
| 2452 | |
---|
| 2453 | |
---|
| 2454 | |
---|
| 2455 | /****************************************************************************** |
---|
| 2456 | *****************************************************************************/ |
---|
[159] | 2457 | REGFI_DATA* regfi_buffer_to_data(REGFI_BUFFER raw_data) |
---|
| 2458 | { |
---|
| 2459 | REGFI_DATA* ret_val; |
---|
| 2460 | |
---|
| 2461 | if(raw_data.buf == NULL) |
---|
| 2462 | return NULL; |
---|
| 2463 | |
---|
| 2464 | ret_val = talloc(NULL, REGFI_DATA); |
---|
| 2465 | if(ret_val == NULL) |
---|
| 2466 | return NULL; |
---|
| 2467 | |
---|
[223] | 2468 | talloc_reparent(NULL, ret_val, raw_data.buf); |
---|
[159] | 2469 | ret_val->raw = raw_data.buf; |
---|
| 2470 | ret_val->size = raw_data.len; |
---|
| 2471 | ret_val->interpreted_size = 0; |
---|
| 2472 | ret_val->interpreted.qword = 0; |
---|
| 2473 | |
---|
| 2474 | return ret_val; |
---|
| 2475 | } |
---|
| 2476 | |
---|
| 2477 | |
---|
| 2478 | /****************************************************************************** |
---|
| 2479 | *****************************************************************************/ |
---|
[161] | 2480 | bool regfi_interpret_data(REGFI_FILE* file, REGFI_ENCODING string_encoding, |
---|
[168] | 2481 | uint32_t type, REGFI_DATA* data) |
---|
[159] | 2482 | { |
---|
[168] | 2483 | uint8_t** tmp_array; |
---|
| 2484 | uint8_t* tmp_str; |
---|
| 2485 | int32_t tmp_size; |
---|
| 2486 | uint32_t i, j, array_size; |
---|
[159] | 2487 | |
---|
| 2488 | if(data == NULL) |
---|
| 2489 | return false; |
---|
| 2490 | |
---|
| 2491 | switch (type) |
---|
| 2492 | { |
---|
| 2493 | case REG_SZ: |
---|
| 2494 | case REG_EXPAND_SZ: |
---|
| 2495 | /* REG_LINK is a symbolic link, stored as a unicode string. */ |
---|
| 2496 | case REG_LINK: |
---|
[168] | 2497 | tmp_str = talloc_array(NULL, uint8_t, data->size); |
---|
[159] | 2498 | if(tmp_str == NULL) |
---|
| 2499 | { |
---|
| 2500 | data->interpreted.string = NULL; |
---|
| 2501 | data->interpreted_size = 0; |
---|
| 2502 | return false; |
---|
| 2503 | } |
---|
| 2504 | |
---|
[161] | 2505 | tmp_size = regfi_conv_charset(regfi_encoding_int2str(REGFI_ENCODING_UTF16LE), |
---|
| 2506 | regfi_encoding_int2str(string_encoding), |
---|
[159] | 2507 | data->raw, (char*)tmp_str, |
---|
| 2508 | data->size, data->size); |
---|
| 2509 | if(tmp_size < 0) |
---|
| 2510 | { |
---|
[182] | 2511 | regfi_log_add(REGFI_LOG_INFO, "Error occurred while" |
---|
[193] | 2512 | " converting data of type %d to %d. Error message: %s", |
---|
[182] | 2513 | type, string_encoding, strerror(-tmp_size)); |
---|
[159] | 2514 | talloc_free(tmp_str); |
---|
| 2515 | data->interpreted.string = NULL; |
---|
| 2516 | data->interpreted_size = 0; |
---|
| 2517 | return false; |
---|
| 2518 | } |
---|
| 2519 | |
---|
[223] | 2520 | /* XXX: check for NULL */ |
---|
[168] | 2521 | tmp_str = talloc_realloc(NULL, tmp_str, uint8_t, tmp_size); |
---|
[159] | 2522 | data->interpreted.string = tmp_str; |
---|
| 2523 | data->interpreted_size = tmp_size; |
---|
[223] | 2524 | talloc_reparent(NULL, data, tmp_str); |
---|
[159] | 2525 | break; |
---|
| 2526 | |
---|
| 2527 | case REG_DWORD: |
---|
| 2528 | if(data->size < 4) |
---|
| 2529 | { |
---|
| 2530 | data->interpreted.dword = 0; |
---|
| 2531 | data->interpreted_size = 0; |
---|
| 2532 | return false; |
---|
| 2533 | } |
---|
| 2534 | data->interpreted.dword = IVAL(data->raw, 0); |
---|
| 2535 | data->interpreted_size = 4; |
---|
| 2536 | break; |
---|
| 2537 | |
---|
| 2538 | case REG_DWORD_BE: |
---|
| 2539 | if(data->size < 4) |
---|
| 2540 | { |
---|
| 2541 | data->interpreted.dword_be = 0; |
---|
| 2542 | data->interpreted_size = 0; |
---|
| 2543 | return false; |
---|
| 2544 | } |
---|
| 2545 | data->interpreted.dword_be = RIVAL(data->raw, 0); |
---|
| 2546 | data->interpreted_size = 4; |
---|
| 2547 | break; |
---|
| 2548 | |
---|
| 2549 | case REG_QWORD: |
---|
| 2550 | if(data->size < 8) |
---|
| 2551 | { |
---|
| 2552 | data->interpreted.qword = 0; |
---|
| 2553 | data->interpreted_size = 0; |
---|
| 2554 | return false; |
---|
| 2555 | } |
---|
| 2556 | data->interpreted.qword = |
---|
[168] | 2557 | (uint64_t)IVAL(data->raw, 0) + (((uint64_t)IVAL(data->raw, 4))<<32); |
---|
[159] | 2558 | data->interpreted_size = 8; |
---|
| 2559 | break; |
---|
| 2560 | |
---|
| 2561 | case REG_MULTI_SZ: |
---|
[168] | 2562 | tmp_str = talloc_array(NULL, uint8_t, data->size); |
---|
[159] | 2563 | if(tmp_str == NULL) |
---|
| 2564 | { |
---|
| 2565 | data->interpreted.multiple_string = NULL; |
---|
| 2566 | data->interpreted_size = 0; |
---|
| 2567 | return false; |
---|
| 2568 | } |
---|
| 2569 | |
---|
| 2570 | /* Attempt to convert entire string from UTF-16LE to output encoding, |
---|
| 2571 | * then parse and quote fields individually. |
---|
| 2572 | */ |
---|
[161] | 2573 | tmp_size = regfi_conv_charset(regfi_encoding_int2str(REGFI_ENCODING_UTF16LE), |
---|
| 2574 | regfi_encoding_int2str(string_encoding), |
---|
[159] | 2575 | data->raw, (char*)tmp_str, |
---|
| 2576 | data->size, data->size); |
---|
| 2577 | if(tmp_size < 0) |
---|
| 2578 | { |
---|
[182] | 2579 | regfi_log_add(REGFI_LOG_INFO, "Error occurred while" |
---|
| 2580 | " converting data of type %d to %s. Error message: %s", |
---|
| 2581 | type, string_encoding, strerror(-tmp_size)); |
---|
[159] | 2582 | talloc_free(tmp_str); |
---|
| 2583 | data->interpreted.multiple_string = NULL; |
---|
| 2584 | data->interpreted_size = 0; |
---|
| 2585 | return false; |
---|
| 2586 | } |
---|
| 2587 | |
---|
| 2588 | array_size = tmp_size+1; |
---|
[168] | 2589 | tmp_array = talloc_array(NULL, uint8_t*, array_size); |
---|
[159] | 2590 | if(tmp_array == NULL) |
---|
| 2591 | { |
---|
| 2592 | talloc_free(tmp_str); |
---|
| 2593 | data->interpreted.string = NULL; |
---|
| 2594 | data->interpreted_size = 0; |
---|
| 2595 | return false; |
---|
| 2596 | } |
---|
| 2597 | |
---|
| 2598 | tmp_array[0] = tmp_str; |
---|
| 2599 | for(i=0,j=1; i < tmp_size && j < array_size-1; i++) |
---|
| 2600 | { |
---|
[209] | 2601 | if(tmp_str[i] == '\0' && (i+1 < tmp_size) && tmp_str[i+1] != '\0') |
---|
[159] | 2602 | tmp_array[j++] = tmp_str+i+1; |
---|
| 2603 | } |
---|
| 2604 | tmp_array[j] = NULL; |
---|
[168] | 2605 | tmp_array = talloc_realloc(NULL, tmp_array, uint8_t*, j+1); |
---|
[159] | 2606 | data->interpreted.multiple_string = tmp_array; |
---|
| 2607 | /* XXX: how meaningful is this? should we store number of strings instead? */ |
---|
| 2608 | data->interpreted_size = tmp_size; |
---|
[223] | 2609 | talloc_reparent(NULL, tmp_array, tmp_str); |
---|
| 2610 | talloc_reparent(NULL, data, tmp_array); |
---|
[159] | 2611 | break; |
---|
| 2612 | |
---|
| 2613 | /* XXX: Dont know how to interpret these yet, just treat as binary */ |
---|
| 2614 | case REG_NONE: |
---|
| 2615 | data->interpreted.none = data->raw; |
---|
| 2616 | data->interpreted_size = data->size; |
---|
| 2617 | break; |
---|
| 2618 | |
---|
| 2619 | case REG_RESOURCE_LIST: |
---|
| 2620 | data->interpreted.resource_list = data->raw; |
---|
| 2621 | data->interpreted_size = data->size; |
---|
| 2622 | break; |
---|
| 2623 | |
---|
| 2624 | case REG_FULL_RESOURCE_DESCRIPTOR: |
---|
| 2625 | data->interpreted.full_resource_descriptor = data->raw; |
---|
| 2626 | data->interpreted_size = data->size; |
---|
| 2627 | break; |
---|
| 2628 | |
---|
| 2629 | case REG_RESOURCE_REQUIREMENTS_LIST: |
---|
| 2630 | data->interpreted.resource_requirements_list = data->raw; |
---|
| 2631 | data->interpreted_size = data->size; |
---|
| 2632 | break; |
---|
| 2633 | |
---|
| 2634 | case REG_BINARY: |
---|
| 2635 | data->interpreted.binary = data->raw; |
---|
| 2636 | data->interpreted_size = data->size; |
---|
| 2637 | break; |
---|
| 2638 | |
---|
| 2639 | default: |
---|
| 2640 | data->interpreted.qword = 0; |
---|
| 2641 | data->interpreted_size = 0; |
---|
| 2642 | return false; |
---|
| 2643 | } |
---|
| 2644 | |
---|
| 2645 | data->type = type; |
---|
| 2646 | return true; |
---|
| 2647 | } |
---|
| 2648 | |
---|
| 2649 | |
---|
[166] | 2650 | /****************************************************************************** |
---|
[159] | 2651 | * Convert from UTF-16LE to specified character set. |
---|
| 2652 | * On error, returns a negative errno code. |
---|
[166] | 2653 | *****************************************************************************/ |
---|
[168] | 2654 | int32_t regfi_conv_charset(const char* input_charset, const char* output_charset, |
---|
[206] | 2655 | uint8_t* input, char* output, |
---|
| 2656 | uint32_t input_len, uint32_t output_max) |
---|
[159] | 2657 | { |
---|
| 2658 | iconv_t conv_desc; |
---|
| 2659 | char* inbuf = (char*)input; |
---|
| 2660 | char* outbuf = output; |
---|
| 2661 | size_t in_len = (size_t)input_len; |
---|
| 2662 | size_t out_len = (size_t)(output_max-1); |
---|
| 2663 | int ret; |
---|
| 2664 | |
---|
[161] | 2665 | /* XXX: Consider creating a couple of conversion descriptors earlier, |
---|
| 2666 | * storing them on an iterator so they don't have to be recreated |
---|
| 2667 | * each time. |
---|
| 2668 | */ |
---|
| 2669 | |
---|
[159] | 2670 | /* Set up conversion descriptor. */ |
---|
[161] | 2671 | conv_desc = iconv_open(output_charset, input_charset); |
---|
[159] | 2672 | |
---|
| 2673 | ret = iconv(conv_desc, &inbuf, &in_len, &outbuf, &out_len); |
---|
| 2674 | if(ret == -1) |
---|
| 2675 | { |
---|
| 2676 | iconv_close(conv_desc); |
---|
| 2677 | return -errno; |
---|
| 2678 | } |
---|
| 2679 | *outbuf = '\0'; |
---|
| 2680 | |
---|
| 2681 | iconv_close(conv_desc); |
---|
| 2682 | return output_max-out_len-1; |
---|
| 2683 | } |
---|
| 2684 | |
---|
| 2685 | |
---|
| 2686 | |
---|
| 2687 | /******************************************************************* |
---|
[97] | 2688 | * Computes the checksum of the registry file header. |
---|
[159] | 2689 | * buffer must be at least the size of a regf header (4096 bytes). |
---|
[97] | 2690 | *******************************************************************/ |
---|
[168] | 2691 | static uint32_t regfi_compute_header_checksum(uint8_t* buffer) |
---|
[97] | 2692 | { |
---|
[168] | 2693 | uint32_t checksum, x; |
---|
[97] | 2694 | int i; |
---|
| 2695 | |
---|
| 2696 | /* XOR of all bytes 0x0000 - 0x01FB */ |
---|
| 2697 | |
---|
| 2698 | checksum = x = 0; |
---|
| 2699 | |
---|
| 2700 | for ( i=0; i<0x01FB; i+=4 ) { |
---|
| 2701 | x = IVAL(buffer, i ); |
---|
| 2702 | checksum ^= x; |
---|
| 2703 | } |
---|
| 2704 | |
---|
| 2705 | return checksum; |
---|
| 2706 | } |
---|
| 2707 | |
---|
| 2708 | |
---|
| 2709 | /******************************************************************* |
---|
| 2710 | *******************************************************************/ |
---|
[178] | 2711 | REGFI_FILE* regfi_parse_regf(REGFI_RAW_FILE* file_cb, bool strict) |
---|
[97] | 2712 | { |
---|
[168] | 2713 | uint8_t file_header[REGFI_REGF_SIZE]; |
---|
| 2714 | uint32_t length; |
---|
[135] | 2715 | REGFI_FILE* ret_val; |
---|
[97] | 2716 | |
---|
[150] | 2717 | ret_val = talloc(NULL, REGFI_FILE); |
---|
[97] | 2718 | if(ret_val == NULL) |
---|
| 2719 | return NULL; |
---|
| 2720 | |
---|
[150] | 2721 | ret_val->sk_cache = NULL; |
---|
| 2722 | ret_val->hbins = NULL; |
---|
[178] | 2723 | |
---|
[135] | 2724 | length = REGFI_REGF_SIZE; |
---|
[178] | 2725 | if((regfi_read(file_cb, file_header, &length)) != 0 |
---|
| 2726 | || length != REGFI_REGF_SIZE) |
---|
[182] | 2727 | { |
---|
| 2728 | regfi_log_add(REGFI_LOG_WARN, "Read failed while parsing REGF structure."); |
---|
[150] | 2729 | goto fail; |
---|
[182] | 2730 | } |
---|
| 2731 | |
---|
[97] | 2732 | ret_val->checksum = IVAL(file_header, 0x1FC); |
---|
| 2733 | ret_val->computed_checksum = regfi_compute_header_checksum(file_header); |
---|
| 2734 | if (strict && (ret_val->checksum != ret_val->computed_checksum)) |
---|
[182] | 2735 | { |
---|
| 2736 | regfi_log_add(REGFI_LOG_WARN, "Stored header checksum (%.8X) did not equal" |
---|
| 2737 | " computed checksum (%.8X).", |
---|
| 2738 | ret_val->checksum, ret_val->computed_checksum); |
---|
| 2739 | if(strict) |
---|
| 2740 | goto fail; |
---|
| 2741 | } |
---|
[97] | 2742 | |
---|
[135] | 2743 | memcpy(ret_val->magic, file_header, REGFI_REGF_MAGIC_SIZE); |
---|
[150] | 2744 | if(memcmp(ret_val->magic, "regf", REGFI_REGF_MAGIC_SIZE) != 0) |
---|
[97] | 2745 | { |
---|
[182] | 2746 | regfi_log_add(REGFI_LOG_ERROR, "Magic number mismatch " |
---|
| 2747 | "(%.2X %.2X %.2X %.2X) while parsing hive header", |
---|
| 2748 | ret_val->magic[0], ret_val->magic[1], |
---|
| 2749 | ret_val->magic[2], ret_val->magic[3]); |
---|
| 2750 | goto fail; |
---|
[97] | 2751 | } |
---|
[178] | 2752 | |
---|
[151] | 2753 | ret_val->sequence1 = IVAL(file_header, 0x4); |
---|
| 2754 | ret_val->sequence2 = IVAL(file_header, 0x8); |
---|
[97] | 2755 | ret_val->mtime.low = IVAL(file_header, 0xC); |
---|
| 2756 | ret_val->mtime.high = IVAL(file_header, 0x10); |
---|
[151] | 2757 | ret_val->major_version = IVAL(file_header, 0x14); |
---|
| 2758 | ret_val->minor_version = IVAL(file_header, 0x18); |
---|
| 2759 | ret_val->type = IVAL(file_header, 0x1C); |
---|
| 2760 | ret_val->format = IVAL(file_header, 0x20); |
---|
| 2761 | ret_val->root_cell = IVAL(file_header, 0x24); |
---|
[97] | 2762 | ret_val->last_block = IVAL(file_header, 0x28); |
---|
[151] | 2763 | ret_val->cluster = IVAL(file_header, 0x2C); |
---|
[97] | 2764 | |
---|
[151] | 2765 | memcpy(ret_val->file_name, file_header+0x30, REGFI_REGF_NAME_SIZE); |
---|
| 2766 | |
---|
| 2767 | /* XXX: Should we add a warning if these uuid parsers fail? Can they? */ |
---|
| 2768 | ret_val->rm_id = winsec_parse_uuid(ret_val, file_header+0x70, 16); |
---|
| 2769 | ret_val->log_id = winsec_parse_uuid(ret_val, file_header+0x80, 16); |
---|
| 2770 | ret_val->flags = IVAL(file_header, 0x90); |
---|
| 2771 | ret_val->tm_id = winsec_parse_uuid(ret_val, file_header+0x94, 16); |
---|
| 2772 | ret_val->guid_signature = IVAL(file_header, 0xa4); |
---|
| 2773 | |
---|
| 2774 | memcpy(ret_val->reserved1, file_header+0xa8, REGFI_REGF_RESERVED1_SIZE); |
---|
| 2775 | memcpy(ret_val->reserved2, file_header+0x200, REGFI_REGF_RESERVED2_SIZE); |
---|
| 2776 | |
---|
| 2777 | ret_val->thaw_tm_id = winsec_parse_uuid(ret_val, file_header+0xFC8, 16); |
---|
| 2778 | ret_val->thaw_rm_id = winsec_parse_uuid(ret_val, file_header+0xFD8, 16); |
---|
| 2779 | ret_val->thaw_log_id = winsec_parse_uuid(ret_val, file_header+0xFE8, 16); |
---|
[152] | 2780 | ret_val->boot_type = IVAL(file_header, 0xFF8); |
---|
| 2781 | ret_val->boot_recover = IVAL(file_header, 0xFFC); |
---|
[151] | 2782 | |
---|
[97] | 2783 | return ret_val; |
---|
[150] | 2784 | |
---|
| 2785 | fail: |
---|
| 2786 | talloc_free(ret_val); |
---|
| 2787 | return NULL; |
---|
[97] | 2788 | } |
---|
| 2789 | |
---|
| 2790 | |
---|
| 2791 | |
---|
[148] | 2792 | /****************************************************************************** |
---|
[97] | 2793 | * Given real file offset, read and parse the hbin at that location |
---|
[110] | 2794 | * along with it's associated cells. |
---|
[148] | 2795 | ******************************************************************************/ |
---|
[168] | 2796 | REGFI_HBIN* regfi_parse_hbin(REGFI_FILE* file, uint32_t offset, bool strict) |
---|
[97] | 2797 | { |
---|
[181] | 2798 | REGFI_HBIN* hbin = NULL; |
---|
[168] | 2799 | uint8_t hbin_header[REGFI_HBIN_HEADER_SIZE]; |
---|
| 2800 | uint32_t length; |
---|
[99] | 2801 | |
---|
| 2802 | if(offset >= file->file_length) |
---|
[180] | 2803 | goto fail; |
---|
| 2804 | |
---|
[186] | 2805 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_hbin")) |
---|
[180] | 2806 | goto fail; |
---|
[97] | 2807 | |
---|
[178] | 2808 | if(regfi_seek(file->cb, offset, SEEK_SET) == -1) |
---|
[137] | 2809 | { |
---|
[182] | 2810 | regfi_log_add(REGFI_LOG_ERROR, "Seek failed" |
---|
| 2811 | " while parsing hbin at offset 0x%.8X.", offset); |
---|
[180] | 2812 | goto fail_locked; |
---|
[137] | 2813 | } |
---|
[97] | 2814 | |
---|
[135] | 2815 | length = REGFI_HBIN_HEADER_SIZE; |
---|
[178] | 2816 | if((regfi_read(file->cb, hbin_header, &length) != 0) |
---|
[135] | 2817 | || length != REGFI_HBIN_HEADER_SIZE) |
---|
[182] | 2818 | { |
---|
| 2819 | regfi_log_add(REGFI_LOG_ERROR, "Read failed" |
---|
| 2820 | " while parsing hbin at offset 0x%.8X.", offset); |
---|
[180] | 2821 | goto fail_locked; |
---|
[182] | 2822 | } |
---|
[97] | 2823 | |
---|
[186] | 2824 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_hbin")) |
---|
[180] | 2825 | goto fail; |
---|
[97] | 2826 | |
---|
[148] | 2827 | hbin = talloc(NULL, REGFI_HBIN); |
---|
| 2828 | if(hbin == NULL) |
---|
[180] | 2829 | goto fail; |
---|
[99] | 2830 | hbin->file_off = offset; |
---|
| 2831 | |
---|
[97] | 2832 | memcpy(hbin->magic, hbin_header, 4); |
---|
| 2833 | if(strict && (memcmp(hbin->magic, "hbin", 4) != 0)) |
---|
[99] | 2834 | { |
---|
[182] | 2835 | /* This always seems to happen at the end of a file, so we make it an INFO |
---|
| 2836 | * message, rather than something more serious. |
---|
| 2837 | */ |
---|
| 2838 | regfi_log_add(REGFI_LOG_INFO, "Magic number mismatch " |
---|
| 2839 | "(%.2X %.2X %.2X %.2X) while parsing hbin at offset" |
---|
| 2840 | " 0x%.8X.", hbin->magic[0], hbin->magic[1], |
---|
| 2841 | hbin->magic[2], hbin->magic[3], offset); |
---|
[180] | 2842 | goto fail; |
---|
[99] | 2843 | } |
---|
[97] | 2844 | |
---|
| 2845 | hbin->first_hbin_off = IVAL(hbin_header, 0x4); |
---|
| 2846 | hbin->block_size = IVAL(hbin_header, 0x8); |
---|
[182] | 2847 | /* this should be the same thing as hbin->block_size, but just in case */ |
---|
[97] | 2848 | hbin->next_block = IVAL(hbin_header, 0x1C); |
---|
| 2849 | |
---|
| 2850 | |
---|
| 2851 | /* Ensure the block size is a multiple of 0x1000 and doesn't run off |
---|
| 2852 | * the end of the file. |
---|
| 2853 | */ |
---|
[116] | 2854 | /* XXX: This may need to be relaxed for dealing with |
---|
| 2855 | * partial or corrupt files. |
---|
| 2856 | */ |
---|
[97] | 2857 | if((offset + hbin->block_size > file->file_length) |
---|
| 2858 | || (hbin->block_size & 0xFFFFF000) != hbin->block_size) |
---|
[99] | 2859 | { |
---|
[182] | 2860 | regfi_log_add(REGFI_LOG_ERROR, "The hbin offset is not aligned" |
---|
| 2861 | " or runs off the end of the file" |
---|
| 2862 | " while parsing hbin at offset 0x%.8X.", offset); |
---|
[180] | 2863 | goto fail; |
---|
[99] | 2864 | } |
---|
[97] | 2865 | |
---|
| 2866 | return hbin; |
---|
[180] | 2867 | |
---|
| 2868 | fail_locked: |
---|
[186] | 2869 | regfi_unlock(file, &file->cb_lock, "regfi_parse_hbin"); |
---|
[180] | 2870 | fail: |
---|
| 2871 | talloc_free(hbin); |
---|
| 2872 | return NULL; |
---|
[97] | 2873 | } |
---|
| 2874 | |
---|
| 2875 | |
---|
[126] | 2876 | /******************************************************************* |
---|
| 2877 | *******************************************************************/ |
---|
[203] | 2878 | REGFI_NK* regfi_parse_nk(REGFI_FILE* file, uint32_t offset, |
---|
| 2879 | uint32_t max_size, bool strict) |
---|
[99] | 2880 | { |
---|
[168] | 2881 | uint8_t nk_header[REGFI_NK_MIN_LENGTH]; |
---|
[203] | 2882 | REGFI_NK* ret_val; |
---|
[168] | 2883 | uint32_t length,cell_length; |
---|
[101] | 2884 | bool unalloc = false; |
---|
[99] | 2885 | |
---|
[203] | 2886 | ret_val = talloc(NULL, REGFI_NK); |
---|
[180] | 2887 | if(ret_val == NULL) |
---|
| 2888 | { |
---|
[182] | 2889 | regfi_log_add(REGFI_LOG_ERROR, "Failed to allocate memory while" |
---|
| 2890 | " parsing NK record at offset 0x%.8X.", offset); |
---|
[180] | 2891 | goto fail; |
---|
| 2892 | } |
---|
| 2893 | |
---|
[186] | 2894 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_nk")) |
---|
[180] | 2895 | goto fail; |
---|
| 2896 | |
---|
[178] | 2897 | if(!regfi_parse_cell(file->cb, offset, nk_header, REGFI_NK_MIN_LENGTH, |
---|
[101] | 2898 | &cell_length, &unalloc)) |
---|
[137] | 2899 | { |
---|
[182] | 2900 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell header" |
---|
| 2901 | " while parsing NK record at offset 0x%.8X.", offset); |
---|
[180] | 2902 | goto fail_locked; |
---|
[137] | 2903 | } |
---|
| 2904 | |
---|
[101] | 2905 | if((nk_header[0x0] != 'n') || (nk_header[0x1] != 'k')) |
---|
[135] | 2906 | { |
---|
[182] | 2907 | regfi_log_add(REGFI_LOG_WARN, "Magic number mismatch in parsing" |
---|
| 2908 | " NK record at offset 0x%.8X.", offset); |
---|
[180] | 2909 | goto fail_locked; |
---|
[135] | 2910 | } |
---|
[99] | 2911 | |
---|
[150] | 2912 | ret_val->values = NULL; |
---|
| 2913 | ret_val->subkeys = NULL; |
---|
[99] | 2914 | ret_val->offset = offset; |
---|
[101] | 2915 | ret_val->cell_size = cell_length; |
---|
| 2916 | |
---|
[99] | 2917 | if(ret_val->cell_size > max_size) |
---|
| 2918 | ret_val->cell_size = max_size & 0xFFFFFFF8; |
---|
| 2919 | if((ret_val->cell_size < REGFI_NK_MIN_LENGTH) |
---|
[157] | 2920 | || (strict && (ret_val->cell_size & 0x00000007) != 0)) |
---|
[99] | 2921 | { |
---|
[182] | 2922 | regfi_log_add(REGFI_LOG_WARN, "A length check failed while" |
---|
| 2923 | " parsing NK record at offset 0x%.8X.", offset); |
---|
[180] | 2924 | goto fail_locked; |
---|
[99] | 2925 | } |
---|
| 2926 | |
---|
[101] | 2927 | ret_val->magic[0] = nk_header[0x0]; |
---|
| 2928 | ret_val->magic[1] = nk_header[0x1]; |
---|
[161] | 2929 | ret_val->flags = SVAL(nk_header, 0x2); |
---|
[152] | 2930 | |
---|
[161] | 2931 | if((ret_val->flags & ~REGFI_NK_KNOWN_FLAGS) != 0) |
---|
[99] | 2932 | { |
---|
[182] | 2933 | regfi_log_add(REGFI_LOG_WARN, "Unknown key flags (0x%.4X) while" |
---|
| 2934 | " parsing NK record at offset 0x%.8X.", |
---|
| 2935 | (ret_val->flags & ~REGFI_NK_KNOWN_FLAGS), offset); |
---|
[99] | 2936 | } |
---|
[101] | 2937 | |
---|
| 2938 | ret_val->mtime.low = IVAL(nk_header, 0x4); |
---|
| 2939 | ret_val->mtime.high = IVAL(nk_header, 0x8); |
---|
[116] | 2940 | /* If the key is unallocated and the MTIME is earlier than Jan 1, 1990 |
---|
| 2941 | * or later than Jan 1, 2290, we consider this a bad key. This helps |
---|
| 2942 | * weed out some false positives during deleted data recovery. |
---|
| 2943 | */ |
---|
| 2944 | if(unalloc |
---|
[178] | 2945 | && (ret_val->mtime.high < REGFI_MTIME_MIN_HIGH |
---|
| 2946 | || ret_val->mtime.high > REGFI_MTIME_MAX_HIGH)) |
---|
[180] | 2947 | { goto fail_locked; } |
---|
[116] | 2948 | |
---|
[101] | 2949 | ret_val->unknown1 = IVAL(nk_header, 0xC); |
---|
| 2950 | ret_val->parent_off = IVAL(nk_header, 0x10); |
---|
| 2951 | ret_val->num_subkeys = IVAL(nk_header, 0x14); |
---|
| 2952 | ret_val->unknown2 = IVAL(nk_header, 0x18); |
---|
| 2953 | ret_val->subkeys_off = IVAL(nk_header, 0x1C); |
---|
| 2954 | ret_val->unknown3 = IVAL(nk_header, 0x20); |
---|
| 2955 | ret_val->num_values = IVAL(nk_header, 0x24); |
---|
| 2956 | ret_val->values_off = IVAL(nk_header, 0x28); |
---|
| 2957 | ret_val->sk_off = IVAL(nk_header, 0x2C); |
---|
| 2958 | ret_val->classname_off = IVAL(nk_header, 0x30); |
---|
[99] | 2959 | |
---|
[101] | 2960 | ret_val->max_bytes_subkeyname = IVAL(nk_header, 0x34); |
---|
| 2961 | ret_val->max_bytes_subkeyclassname = IVAL(nk_header, 0x38); |
---|
| 2962 | ret_val->max_bytes_valuename = IVAL(nk_header, 0x3C); |
---|
| 2963 | ret_val->max_bytes_value = IVAL(nk_header, 0x40); |
---|
| 2964 | ret_val->unk_index = IVAL(nk_header, 0x44); |
---|
[99] | 2965 | |
---|
[101] | 2966 | ret_val->name_length = SVAL(nk_header, 0x48); |
---|
| 2967 | ret_val->classname_length = SVAL(nk_header, 0x4A); |
---|
[206] | 2968 | ret_val->name = NULL; |
---|
[99] | 2969 | |
---|
| 2970 | if(ret_val->name_length + REGFI_NK_MIN_LENGTH > ret_val->cell_size) |
---|
[101] | 2971 | { |
---|
| 2972 | if(strict) |
---|
| 2973 | { |
---|
[182] | 2974 | regfi_log_add(REGFI_LOG_ERROR, "Contents too large for cell" |
---|
| 2975 | " while parsing NK record at offset 0x%.8X.", offset); |
---|
[180] | 2976 | goto fail_locked; |
---|
[101] | 2977 | } |
---|
| 2978 | else |
---|
| 2979 | ret_val->name_length = ret_val->cell_size - REGFI_NK_MIN_LENGTH; |
---|
| 2980 | } |
---|
| 2981 | else if (unalloc) |
---|
| 2982 | { /* Truncate cell_size if it's much larger than the apparent total record length. */ |
---|
| 2983 | /* Round up to the next multiple of 8 */ |
---|
| 2984 | length = (ret_val->name_length + REGFI_NK_MIN_LENGTH) & 0xFFFFFFF8; |
---|
| 2985 | if(length < ret_val->name_length + REGFI_NK_MIN_LENGTH) |
---|
| 2986 | length+=8; |
---|
[99] | 2987 | |
---|
[101] | 2988 | /* If cell_size is still greater, truncate. */ |
---|
| 2989 | if(length < ret_val->cell_size) |
---|
| 2990 | ret_val->cell_size = length; |
---|
| 2991 | } |
---|
| 2992 | |
---|
[206] | 2993 | /* +1 to length in case we decided to use this directly as a string later */ |
---|
| 2994 | ret_val->name_raw = talloc_array(ret_val, uint8_t, ret_val->name_length+1); |
---|
| 2995 | if(ret_val->name_raw == NULL) |
---|
[180] | 2996 | goto fail_locked; |
---|
[99] | 2997 | |
---|
| 2998 | /* Don't need to seek, should be at the right offset */ |
---|
| 2999 | length = ret_val->name_length; |
---|
[206] | 3000 | if((regfi_read(file->cb, (uint8_t*)ret_val->name_raw, &length) != 0) |
---|
[99] | 3001 | || length != ret_val->name_length) |
---|
| 3002 | { |
---|
[182] | 3003 | regfi_log_add(REGFI_LOG_ERROR, "Failed to read key name" |
---|
| 3004 | " while parsing NK record at offset 0x%.8X.", offset); |
---|
[180] | 3005 | goto fail_locked; |
---|
[99] | 3006 | } |
---|
| 3007 | |
---|
[186] | 3008 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_nk")) |
---|
[180] | 3009 | goto fail; |
---|
| 3010 | |
---|
[126] | 3011 | return ret_val; |
---|
[180] | 3012 | |
---|
| 3013 | fail_locked: |
---|
[186] | 3014 | regfi_unlock(file, &file->cb_lock, "regfi_parse_nk"); |
---|
[180] | 3015 | fail: |
---|
| 3016 | talloc_free(ret_val); |
---|
| 3017 | return NULL; |
---|
[126] | 3018 | } |
---|
| 3019 | |
---|
| 3020 | |
---|
[168] | 3021 | uint8_t* regfi_parse_classname(REGFI_FILE* file, uint32_t offset, |
---|
[206] | 3022 | uint16_t* name_length, uint32_t max_size, bool strict) |
---|
[126] | 3023 | { |
---|
[168] | 3024 | uint8_t* ret_val = NULL; |
---|
| 3025 | uint32_t length; |
---|
| 3026 | uint32_t cell_length; |
---|
[126] | 3027 | bool unalloc = false; |
---|
| 3028 | |
---|
[180] | 3029 | if(*name_length <= 0 || offset == REGFI_OFFSET_NONE |
---|
| 3030 | || (offset & 0x00000007) != 0) |
---|
| 3031 | { goto fail; } |
---|
| 3032 | |
---|
[186] | 3033 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_classname")) |
---|
[180] | 3034 | goto fail; |
---|
| 3035 | |
---|
| 3036 | if(!regfi_parse_cell(file->cb, offset, NULL, 0, &cell_length, &unalloc)) |
---|
[131] | 3037 | { |
---|
[182] | 3038 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell header" |
---|
| 3039 | " while parsing class name at offset 0x%.8X.", offset); |
---|
[180] | 3040 | goto fail_locked; |
---|
| 3041 | } |
---|
| 3042 | |
---|
| 3043 | if((cell_length & 0x0000007) != 0) |
---|
| 3044 | { |
---|
[182] | 3045 | regfi_log_add(REGFI_LOG_ERROR, "Cell length not a multiple of 8" |
---|
| 3046 | " while parsing class name at offset 0x%.8X.", offset); |
---|
[180] | 3047 | goto fail_locked; |
---|
| 3048 | } |
---|
| 3049 | |
---|
| 3050 | if(cell_length > max_size) |
---|
| 3051 | { |
---|
[182] | 3052 | regfi_log_add(REGFI_LOG_WARN, "Cell stretches past hbin " |
---|
| 3053 | "boundary while parsing class name at offset 0x%.8X.", |
---|
| 3054 | offset); |
---|
[180] | 3055 | if(strict) |
---|
| 3056 | goto fail_locked; |
---|
| 3057 | cell_length = max_size; |
---|
| 3058 | } |
---|
| 3059 | |
---|
| 3060 | if((cell_length - 4) < *name_length) |
---|
| 3061 | { |
---|
[182] | 3062 | regfi_log_add(REGFI_LOG_WARN, "Class name is larger than" |
---|
| 3063 | " cell_length while parsing class name at offset" |
---|
| 3064 | " 0x%.8X.", offset); |
---|
[180] | 3065 | if(strict) |
---|
| 3066 | goto fail_locked; |
---|
| 3067 | *name_length = cell_length - 4; |
---|
| 3068 | } |
---|
| 3069 | |
---|
| 3070 | ret_val = talloc_array(NULL, uint8_t, *name_length); |
---|
| 3071 | if(ret_val != NULL) |
---|
| 3072 | { |
---|
| 3073 | length = *name_length; |
---|
| 3074 | if((regfi_read(file->cb, ret_val, &length) != 0) |
---|
| 3075 | || length != *name_length) |
---|
[137] | 3076 | { |
---|
[182] | 3077 | regfi_log_add(REGFI_LOG_ERROR, "Could not read class name" |
---|
| 3078 | " while parsing class name at offset 0x%.8X.", offset); |
---|
[180] | 3079 | goto fail_locked; |
---|
[137] | 3080 | } |
---|
[180] | 3081 | } |
---|
[126] | 3082 | |
---|
[186] | 3083 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_classname")) |
---|
[180] | 3084 | goto fail; |
---|
[137] | 3085 | |
---|
[180] | 3086 | return ret_val; |
---|
[131] | 3087 | |
---|
[180] | 3088 | fail_locked: |
---|
[186] | 3089 | regfi_unlock(file, &file->cb_lock, "regfi_parse_classname"); |
---|
[180] | 3090 | fail: |
---|
| 3091 | talloc_free(ret_val); |
---|
| 3092 | return NULL; |
---|
[99] | 3093 | } |
---|
| 3094 | |
---|
| 3095 | |
---|
[152] | 3096 | /****************************************************************************** |
---|
| 3097 | *******************************************************************************/ |
---|
[203] | 3098 | REGFI_VK* regfi_parse_vk(REGFI_FILE* file, uint32_t offset, |
---|
[168] | 3099 | uint32_t max_size, bool strict) |
---|
[97] | 3100 | { |
---|
[203] | 3101 | REGFI_VK* ret_val; |
---|
[168] | 3102 | uint8_t vk_header[REGFI_VK_MIN_LENGTH]; |
---|
| 3103 | uint32_t raw_data_size, length, cell_length; |
---|
[101] | 3104 | bool unalloc = false; |
---|
[97] | 3105 | |
---|
[203] | 3106 | ret_val = talloc(NULL, REGFI_VK); |
---|
[180] | 3107 | if(ret_val == NULL) |
---|
| 3108 | goto fail; |
---|
| 3109 | |
---|
[186] | 3110 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_nk")) |
---|
[180] | 3111 | goto fail; |
---|
| 3112 | |
---|
[178] | 3113 | if(!regfi_parse_cell(file->cb, offset, vk_header, REGFI_VK_MIN_LENGTH, |
---|
[101] | 3114 | &cell_length, &unalloc)) |
---|
[137] | 3115 | { |
---|
[182] | 3116 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell header" |
---|
| 3117 | " while parsing VK record at offset 0x%.8X.", offset); |
---|
[180] | 3118 | goto fail_locked; |
---|
[137] | 3119 | } |
---|
[111] | 3120 | |
---|
[101] | 3121 | ret_val->offset = offset; |
---|
| 3122 | ret_val->cell_size = cell_length; |
---|
[206] | 3123 | ret_val->name = NULL; |
---|
| 3124 | ret_val->name_raw = NULL; |
---|
[150] | 3125 | |
---|
[101] | 3126 | if(ret_val->cell_size > max_size) |
---|
| 3127 | ret_val->cell_size = max_size & 0xFFFFFFF8; |
---|
| 3128 | if((ret_val->cell_size < REGFI_VK_MIN_LENGTH) |
---|
[157] | 3129 | || (ret_val->cell_size & 0x00000007) != 0) |
---|
[97] | 3130 | { |
---|
[182] | 3131 | regfi_log_add(REGFI_LOG_WARN, "Invalid cell size encountered" |
---|
| 3132 | " while parsing VK record at offset 0x%.8X.", offset); |
---|
[180] | 3133 | goto fail_locked; |
---|
[101] | 3134 | } |
---|
[97] | 3135 | |
---|
[101] | 3136 | ret_val->magic[0] = vk_header[0x0]; |
---|
| 3137 | ret_val->magic[1] = vk_header[0x1]; |
---|
| 3138 | if((ret_val->magic[0] != 'v') || (ret_val->magic[1] != 'k')) |
---|
| 3139 | { |
---|
[124] | 3140 | /* XXX: This does not account for deleted keys under Win2K which |
---|
| 3141 | * often have this (and the name length) overwritten with |
---|
| 3142 | * 0xFFFF. |
---|
| 3143 | */ |
---|
[182] | 3144 | regfi_log_add(REGFI_LOG_WARN, "Magic number mismatch" |
---|
| 3145 | " while parsing VK record at offset 0x%.8X.", offset); |
---|
[180] | 3146 | goto fail_locked; |
---|
[101] | 3147 | } |
---|
| 3148 | |
---|
| 3149 | ret_val->name_length = SVAL(vk_header, 0x2); |
---|
| 3150 | raw_data_size = IVAL(vk_header, 0x4); |
---|
[135] | 3151 | ret_val->data_size = raw_data_size & ~REGFI_VK_DATA_IN_OFFSET; |
---|
[157] | 3152 | /* The data is typically stored in the offset if the size <= 4, |
---|
| 3153 | * in which case this flag is set. |
---|
| 3154 | */ |
---|
[135] | 3155 | ret_val->data_in_offset = (bool)(raw_data_size & REGFI_VK_DATA_IN_OFFSET); |
---|
[101] | 3156 | ret_val->data_off = IVAL(vk_header, 0x8); |
---|
| 3157 | ret_val->type = IVAL(vk_header, 0xC); |
---|
[162] | 3158 | ret_val->flags = SVAL(vk_header, 0x10); |
---|
[101] | 3159 | ret_val->unknown1 = SVAL(vk_header, 0x12); |
---|
| 3160 | |
---|
[162] | 3161 | if(ret_val->name_length > 0) |
---|
[101] | 3162 | { |
---|
[113] | 3163 | if(ret_val->name_length + REGFI_VK_MIN_LENGTH + 4 > ret_val->cell_size) |
---|
[101] | 3164 | { |
---|
[182] | 3165 | regfi_log_add(REGFI_LOG_WARN, "Name too long for remaining cell" |
---|
| 3166 | " space while parsing VK record at offset 0x%.8X.", |
---|
| 3167 | offset); |
---|
[101] | 3168 | if(strict) |
---|
[180] | 3169 | goto fail_locked; |
---|
[101] | 3170 | else |
---|
[113] | 3171 | ret_val->name_length = ret_val->cell_size - REGFI_VK_MIN_LENGTH - 4; |
---|
[101] | 3172 | } |
---|
| 3173 | |
---|
| 3174 | /* Round up to the next multiple of 8 */ |
---|
[113] | 3175 | cell_length = (ret_val->name_length + REGFI_VK_MIN_LENGTH + 4) & 0xFFFFFFF8; |
---|
| 3176 | if(cell_length < ret_val->name_length + REGFI_VK_MIN_LENGTH + 4) |
---|
| 3177 | cell_length+=8; |
---|
[101] | 3178 | |
---|
[206] | 3179 | /* +1 to length in case we decided to use this directly as a string later */ |
---|
| 3180 | ret_val->name_raw = talloc_array(ret_val, uint8_t, ret_val->name_length+1); |
---|
| 3181 | if(ret_val->name_raw == NULL) |
---|
[180] | 3182 | goto fail_locked; |
---|
[113] | 3183 | |
---|
[101] | 3184 | length = ret_val->name_length; |
---|
[206] | 3185 | if((regfi_read(file->cb, (uint8_t*)ret_val->name_raw, &length) != 0) |
---|
[101] | 3186 | || length != ret_val->name_length) |
---|
| 3187 | { |
---|
[182] | 3188 | regfi_log_add(REGFI_LOG_ERROR, "Could not read value name" |
---|
| 3189 | " while parsing VK record at offset 0x%.8X.", offset); |
---|
[180] | 3190 | goto fail_locked; |
---|
[101] | 3191 | } |
---|
| 3192 | } |
---|
| 3193 | else |
---|
[113] | 3194 | cell_length = REGFI_VK_MIN_LENGTH + 4; |
---|
[101] | 3195 | |
---|
[186] | 3196 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_nk")) |
---|
[180] | 3197 | goto fail; |
---|
| 3198 | |
---|
[101] | 3199 | if(unalloc) |
---|
| 3200 | { |
---|
| 3201 | /* If cell_size is still greater, truncate. */ |
---|
[113] | 3202 | if(cell_length < ret_val->cell_size) |
---|
| 3203 | ret_val->cell_size = cell_length; |
---|
[101] | 3204 | } |
---|
| 3205 | |
---|
| 3206 | return ret_val; |
---|
[180] | 3207 | |
---|
| 3208 | fail_locked: |
---|
[186] | 3209 | regfi_unlock(file, &file->cb_lock, "regfi_parse_vk"); |
---|
[180] | 3210 | fail: |
---|
| 3211 | talloc_free(ret_val); |
---|
| 3212 | return NULL; |
---|
[97] | 3213 | } |
---|
[101] | 3214 | |
---|
| 3215 | |
---|
[152] | 3216 | /****************************************************************************** |
---|
[157] | 3217 | * |
---|
| 3218 | ******************************************************************************/ |
---|
[168] | 3219 | REGFI_BUFFER regfi_load_data(REGFI_FILE* file, uint32_t voffset, |
---|
| 3220 | uint32_t length, bool data_in_offset, |
---|
[157] | 3221 | bool strict) |
---|
[101] | 3222 | { |
---|
[151] | 3223 | REGFI_BUFFER ret_val; |
---|
[168] | 3224 | uint32_t cell_length, offset; |
---|
| 3225 | int32_t max_size; |
---|
[101] | 3226 | bool unalloc; |
---|
[151] | 3227 | |
---|
[159] | 3228 | /* Microsoft's documentation indicates that "available memory" is |
---|
[165] | 3229 | * the limit on value sizes for the more recent registry format version. |
---|
| 3230 | * This is not only annoying, but it's probably also incorrect, since clearly |
---|
| 3231 | * value data sizes are limited to 2^31 (high bit used as a flag) and even |
---|
| 3232 | * with big data records, the apparent max size is: |
---|
| 3233 | * 16344 * 2^16 = 1071104040 (~1GB). |
---|
| 3234 | * |
---|
| 3235 | * We choose to limit it to 1M which was the limit in older versions and |
---|
| 3236 | * should rarely be exceeded unless the file is corrupt or malicious. |
---|
| 3237 | * For more info, see: |
---|
| 3238 | * http://msdn.microsoft.com/en-us/library/ms724872%28VS.85%29.aspx |
---|
[159] | 3239 | */ |
---|
[160] | 3240 | /* XXX: add way to skip this check at user discression. */ |
---|
| 3241 | if(length > REGFI_VK_MAX_DATA_LENGTH) |
---|
[159] | 3242 | { |
---|
[182] | 3243 | regfi_log_add(REGFI_LOG_WARN, "Value data size %d larger than " |
---|
| 3244 | "%d, truncating...", length, REGFI_VK_MAX_DATA_LENGTH); |
---|
[160] | 3245 | length = REGFI_VK_MAX_DATA_LENGTH; |
---|
[159] | 3246 | } |
---|
| 3247 | |
---|
[145] | 3248 | if(data_in_offset) |
---|
[157] | 3249 | return regfi_parse_little_data(file, voffset, length, strict); |
---|
| 3250 | else |
---|
[101] | 3251 | { |
---|
[157] | 3252 | offset = voffset + REGFI_REGF_SIZE; |
---|
| 3253 | max_size = regfi_calc_maxsize(file, offset); |
---|
| 3254 | if(max_size < 0) |
---|
[137] | 3255 | { |
---|
[182] | 3256 | regfi_log_add(REGFI_LOG_WARN, "Could not find HBIN for data" |
---|
| 3257 | " at offset 0x%.8X.", offset); |
---|
[151] | 3258 | goto fail; |
---|
[137] | 3259 | } |
---|
[157] | 3260 | |
---|
[186] | 3261 | if(!regfi_lock(file, &file->cb_lock, "regfi_load_data")) |
---|
[180] | 3262 | goto fail; |
---|
| 3263 | |
---|
[178] | 3264 | if(!regfi_parse_cell(file->cb, offset, NULL, 0, |
---|
[101] | 3265 | &cell_length, &unalloc)) |
---|
[137] | 3266 | { |
---|
[182] | 3267 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell while" |
---|
| 3268 | " parsing data record at offset 0x%.8X.", offset); |
---|
[180] | 3269 | goto fail_locked; |
---|
[137] | 3270 | } |
---|
[111] | 3271 | |
---|
[186] | 3272 | if(!regfi_unlock(file, &file->cb_lock, "regfi_load_data")) |
---|
[180] | 3273 | goto fail; |
---|
| 3274 | |
---|
[157] | 3275 | if((cell_length & 0x00000007) != 0) |
---|
[137] | 3276 | { |
---|
[182] | 3277 | regfi_log_add(REGFI_LOG_WARN, "Cell length not multiple of 8" |
---|
| 3278 | " while parsing data record at offset 0x%.8X.", |
---|
| 3279 | offset); |
---|
[151] | 3280 | goto fail; |
---|
[137] | 3281 | } |
---|
[101] | 3282 | |
---|
[131] | 3283 | if(cell_length > max_size) |
---|
| 3284 | { |
---|
[182] | 3285 | regfi_log_add(REGFI_LOG_WARN, "Cell extends past HBIN boundary" |
---|
| 3286 | " while parsing data record at offset 0x%.8X.", |
---|
| 3287 | offset); |
---|
[157] | 3288 | goto fail; |
---|
[131] | 3289 | } |
---|
| 3290 | |
---|
[101] | 3291 | if(cell_length - 4 < length) |
---|
| 3292 | { |
---|
[155] | 3293 | /* XXX: All big data records thus far have been 16 bytes long. |
---|
| 3294 | * Should we check for this precise size instead of just |
---|
| 3295 | * relying upon the above check? |
---|
| 3296 | */ |
---|
[152] | 3297 | if (file->major_version >= 1 && file->minor_version >= 5) |
---|
| 3298 | { |
---|
| 3299 | /* Attempt to parse a big data record */ |
---|
[157] | 3300 | return regfi_load_big_data(file, offset, length, cell_length, |
---|
| 3301 | NULL, strict); |
---|
[152] | 3302 | } |
---|
[101] | 3303 | else |
---|
[152] | 3304 | { |
---|
[182] | 3305 | regfi_log_add(REGFI_LOG_WARN, "Data length (0x%.8X) larger than" |
---|
| 3306 | " remaining cell length (0x%.8X)" |
---|
| 3307 | " while parsing data record at offset 0x%.8X.", |
---|
| 3308 | length, cell_length - 4, offset); |
---|
[152] | 3309 | if(strict) |
---|
| 3310 | goto fail; |
---|
| 3311 | else |
---|
| 3312 | length = cell_length - 4; |
---|
| 3313 | } |
---|
[101] | 3314 | } |
---|
| 3315 | |
---|
[157] | 3316 | ret_val = regfi_parse_data(file, offset, length, strict); |
---|
[101] | 3317 | } |
---|
| 3318 | |
---|
| 3319 | return ret_val; |
---|
[151] | 3320 | |
---|
[180] | 3321 | fail_locked: |
---|
[186] | 3322 | regfi_unlock(file, &file->cb_lock, "regfi_load_data"); |
---|
[151] | 3323 | fail: |
---|
| 3324 | ret_val.buf = NULL; |
---|
| 3325 | ret_val.len = 0; |
---|
| 3326 | return ret_val; |
---|
[101] | 3327 | } |
---|
[110] | 3328 | |
---|
| 3329 | |
---|
[152] | 3330 | /****************************************************************************** |
---|
[157] | 3331 | * Parses the common case data records stored in a single cell. |
---|
| 3332 | ******************************************************************************/ |
---|
[168] | 3333 | REGFI_BUFFER regfi_parse_data(REGFI_FILE* file, uint32_t offset, |
---|
| 3334 | uint32_t length, bool strict) |
---|
[157] | 3335 | { |
---|
| 3336 | REGFI_BUFFER ret_val; |
---|
[168] | 3337 | uint32_t read_length; |
---|
[157] | 3338 | |
---|
| 3339 | ret_val.buf = NULL; |
---|
| 3340 | ret_val.len = 0; |
---|
| 3341 | |
---|
[180] | 3342 | if((ret_val.buf = talloc_array(NULL, uint8_t, length)) == NULL) |
---|
| 3343 | goto fail; |
---|
| 3344 | ret_val.len = length; |
---|
| 3345 | |
---|
[186] | 3346 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_data")) |
---|
[180] | 3347 | goto fail; |
---|
| 3348 | |
---|
[178] | 3349 | if(regfi_seek(file->cb, offset+4, SEEK_SET) == -1) |
---|
[157] | 3350 | { |
---|
[182] | 3351 | regfi_log_add(REGFI_LOG_WARN, "Could not seek while " |
---|
| 3352 | "reading data at offset 0x%.8X.", offset); |
---|
[180] | 3353 | goto fail_locked; |
---|
[157] | 3354 | } |
---|
| 3355 | |
---|
| 3356 | read_length = length; |
---|
[178] | 3357 | if((regfi_read(file->cb, ret_val.buf, &read_length) != 0) |
---|
[157] | 3358 | || read_length != length) |
---|
| 3359 | { |
---|
[182] | 3360 | regfi_log_add(REGFI_LOG_ERROR, "Could not read data block while" |
---|
| 3361 | " parsing data record at offset 0x%.8X.", offset); |
---|
[180] | 3362 | goto fail_locked; |
---|
[157] | 3363 | } |
---|
| 3364 | |
---|
[186] | 3365 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_data")) |
---|
[180] | 3366 | goto fail; |
---|
| 3367 | |
---|
[157] | 3368 | return ret_val; |
---|
[180] | 3369 | |
---|
| 3370 | fail_locked: |
---|
[186] | 3371 | regfi_unlock(file, &file->cb_lock, "regfi_parse_data"); |
---|
[180] | 3372 | fail: |
---|
| 3373 | talloc_free(ret_val.buf); |
---|
| 3374 | ret_val.buf = NULL; |
---|
| 3375 | ret_val.buf = 0; |
---|
| 3376 | return ret_val; |
---|
[157] | 3377 | } |
---|
| 3378 | |
---|
| 3379 | |
---|
| 3380 | |
---|
| 3381 | /****************************************************************************** |
---|
| 3382 | * |
---|
| 3383 | ******************************************************************************/ |
---|
[168] | 3384 | REGFI_BUFFER regfi_parse_little_data(REGFI_FILE* file, uint32_t voffset, |
---|
| 3385 | uint32_t length, bool strict) |
---|
[157] | 3386 | { |
---|
[173] | 3387 | uint8_t i; |
---|
[157] | 3388 | REGFI_BUFFER ret_val; |
---|
| 3389 | |
---|
| 3390 | ret_val.buf = NULL; |
---|
| 3391 | ret_val.len = 0; |
---|
| 3392 | |
---|
| 3393 | if(length > 4) |
---|
| 3394 | { |
---|
[182] | 3395 | regfi_log_add(REGFI_LOG_ERROR, "Data in offset but length > 4" |
---|
| 3396 | " while parsing data record. (voffset=0x%.8X, length=%d)", |
---|
| 3397 | voffset, length); |
---|
[157] | 3398 | return ret_val; |
---|
| 3399 | } |
---|
| 3400 | |
---|
[168] | 3401 | if((ret_val.buf = talloc_array(NULL, uint8_t, length)) == NULL) |
---|
[157] | 3402 | return ret_val; |
---|
| 3403 | ret_val.len = length; |
---|
| 3404 | |
---|
| 3405 | for(i = 0; i < length; i++) |
---|
[168] | 3406 | ret_val.buf[i] = (uint8_t)((voffset >> i*8) & 0xFF); |
---|
[157] | 3407 | |
---|
| 3408 | return ret_val; |
---|
| 3409 | } |
---|
| 3410 | |
---|
| 3411 | /****************************************************************************** |
---|
[152] | 3412 | *******************************************************************************/ |
---|
[168] | 3413 | REGFI_BUFFER regfi_parse_big_data_header(REGFI_FILE* file, uint32_t offset, |
---|
| 3414 | uint32_t max_size, bool strict) |
---|
[152] | 3415 | { |
---|
| 3416 | REGFI_BUFFER ret_val; |
---|
[168] | 3417 | uint32_t cell_length; |
---|
[152] | 3418 | bool unalloc; |
---|
[157] | 3419 | |
---|
| 3420 | /* XXX: do something with unalloc? */ |
---|
[168] | 3421 | ret_val.buf = (uint8_t*)talloc_array(NULL, uint8_t, REGFI_BIG_DATA_MIN_LENGTH); |
---|
[157] | 3422 | if(ret_val.buf == NULL) |
---|
[152] | 3423 | goto fail; |
---|
| 3424 | |
---|
[157] | 3425 | if(REGFI_BIG_DATA_MIN_LENGTH > max_size) |
---|
| 3426 | { |
---|
[182] | 3427 | regfi_log_add(REGFI_LOG_WARN, "Big data header exceeded max_size " |
---|
| 3428 | "while parsing big data header at offset 0x%.8X.",offset); |
---|
[157] | 3429 | goto fail; |
---|
| 3430 | } |
---|
| 3431 | |
---|
[186] | 3432 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_big_data_header")) |
---|
[180] | 3433 | goto fail; |
---|
| 3434 | |
---|
| 3435 | |
---|
[178] | 3436 | if(!regfi_parse_cell(file->cb, offset, ret_val.buf, REGFI_BIG_DATA_MIN_LENGTH, |
---|
[152] | 3437 | &cell_length, &unalloc)) |
---|
| 3438 | { |
---|
[182] | 3439 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell while" |
---|
| 3440 | " parsing big data header at offset 0x%.8X.", offset); |
---|
[180] | 3441 | goto fail_locked; |
---|
[152] | 3442 | } |
---|
[157] | 3443 | |
---|
[186] | 3444 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_header")) |
---|
[180] | 3445 | goto fail; |
---|
| 3446 | |
---|
[157] | 3447 | if((ret_val.buf[0] != 'd') || (ret_val.buf[1] != 'b')) |
---|
[152] | 3448 | { |
---|
[182] | 3449 | regfi_log_add(REGFI_LOG_WARN, "Unknown magic number" |
---|
| 3450 | " (0x%.2X, 0x%.2X) encountered while parsing" |
---|
| 3451 | " big data header at offset 0x%.8X.", |
---|
| 3452 | ret_val.buf[0], ret_val.buf[1], offset); |
---|
[152] | 3453 | goto fail; |
---|
| 3454 | } |
---|
| 3455 | |
---|
[157] | 3456 | ret_val.len = REGFI_BIG_DATA_MIN_LENGTH; |
---|
| 3457 | return ret_val; |
---|
| 3458 | |
---|
[180] | 3459 | fail_locked: |
---|
[186] | 3460 | regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_header"); |
---|
[157] | 3461 | fail: |
---|
[180] | 3462 | talloc_free(ret_val.buf); |
---|
| 3463 | ret_val.buf = NULL; |
---|
[157] | 3464 | ret_val.len = 0; |
---|
| 3465 | return ret_val; |
---|
| 3466 | } |
---|
| 3467 | |
---|
| 3468 | |
---|
| 3469 | |
---|
| 3470 | /****************************************************************************** |
---|
| 3471 | * |
---|
| 3472 | ******************************************************************************/ |
---|
[168] | 3473 | uint32_t* regfi_parse_big_data_indirect(REGFI_FILE* file, uint32_t offset, |
---|
| 3474 | uint16_t num_chunks, bool strict) |
---|
[157] | 3475 | { |
---|
[168] | 3476 | uint32_t* ret_val; |
---|
| 3477 | uint32_t indirect_length; |
---|
| 3478 | int32_t max_size; |
---|
| 3479 | uint16_t i; |
---|
[157] | 3480 | bool unalloc; |
---|
| 3481 | |
---|
| 3482 | /* XXX: do something with unalloc? */ |
---|
| 3483 | |
---|
| 3484 | max_size = regfi_calc_maxsize(file, offset); |
---|
[168] | 3485 | if((max_size < 0) || (num_chunks*sizeof(uint32_t) + 4 > max_size)) |
---|
[157] | 3486 | return NULL; |
---|
| 3487 | |
---|
[168] | 3488 | ret_val = (uint32_t*)talloc_array(NULL, uint32_t, num_chunks); |
---|
[157] | 3489 | if(ret_val == NULL) |
---|
[152] | 3490 | goto fail; |
---|
| 3491 | |
---|
[186] | 3492 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_big_data_indirect")) |
---|
[180] | 3493 | goto fail; |
---|
| 3494 | |
---|
[178] | 3495 | if(!regfi_parse_cell(file->cb, offset, (uint8_t*)ret_val, |
---|
[168] | 3496 | num_chunks*sizeof(uint32_t), |
---|
[152] | 3497 | &indirect_length, &unalloc)) |
---|
| 3498 | { |
---|
[182] | 3499 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell while" |
---|
| 3500 | " parsing big data indirect record at offset 0x%.8X.", |
---|
| 3501 | offset); |
---|
[180] | 3502 | goto fail_locked; |
---|
[152] | 3503 | } |
---|
[157] | 3504 | |
---|
[186] | 3505 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_indirect")) |
---|
[180] | 3506 | goto fail; |
---|
| 3507 | |
---|
[157] | 3508 | /* Convert pointers to proper endianess, verify they are aligned. */ |
---|
| 3509 | for(i=0; i<num_chunks; i++) |
---|
[152] | 3510 | { |
---|
[168] | 3511 | ret_val[i] = IVAL(ret_val, i*sizeof(uint32_t)); |
---|
[157] | 3512 | if((ret_val[i] & 0x00000007) != 0) |
---|
| 3513 | goto fail; |
---|
[152] | 3514 | } |
---|
[157] | 3515 | |
---|
| 3516 | return ret_val; |
---|
[152] | 3517 | |
---|
[180] | 3518 | fail_locked: |
---|
[186] | 3519 | regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_indirect"); |
---|
[157] | 3520 | fail: |
---|
[180] | 3521 | talloc_free(ret_val); |
---|
[157] | 3522 | return NULL; |
---|
| 3523 | } |
---|
| 3524 | |
---|
| 3525 | |
---|
| 3526 | /****************************************************************************** |
---|
| 3527 | * Arguments: |
---|
| 3528 | * file -- |
---|
| 3529 | * offsets -- list of virtual offsets. |
---|
| 3530 | * num_chunks -- |
---|
| 3531 | * strict -- |
---|
| 3532 | * |
---|
| 3533 | * Returns: |
---|
| 3534 | * A range_list with physical offsets and complete lengths |
---|
| 3535 | * (including cell headers) of associated cells. |
---|
| 3536 | * No data in range_list elements. |
---|
| 3537 | ******************************************************************************/ |
---|
[168] | 3538 | range_list* regfi_parse_big_data_cells(REGFI_FILE* file, uint32_t* offsets, |
---|
| 3539 | uint16_t num_chunks, bool strict) |
---|
[157] | 3540 | { |
---|
[168] | 3541 | uint32_t cell_length, chunk_offset; |
---|
[157] | 3542 | range_list* ret_val; |
---|
[168] | 3543 | uint16_t i; |
---|
[157] | 3544 | bool unalloc; |
---|
| 3545 | |
---|
| 3546 | /* XXX: do something with unalloc? */ |
---|
| 3547 | ret_val = range_list_new(); |
---|
| 3548 | if(ret_val == NULL) |
---|
| 3549 | goto fail; |
---|
| 3550 | |
---|
[166] | 3551 | for(i=0; i<num_chunks; i++) |
---|
[152] | 3552 | { |
---|
[186] | 3553 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_big_data_cells")) |
---|
[180] | 3554 | goto fail; |
---|
| 3555 | |
---|
[157] | 3556 | chunk_offset = offsets[i]+REGFI_REGF_SIZE; |
---|
[178] | 3557 | if(!regfi_parse_cell(file->cb, chunk_offset, NULL, 0, |
---|
[157] | 3558 | &cell_length, &unalloc)) |
---|
[152] | 3559 | { |
---|
[182] | 3560 | regfi_log_add(REGFI_LOG_WARN, "Could not parse cell while" |
---|
| 3561 | " parsing big data chunk at offset 0x%.8X.", |
---|
| 3562 | chunk_offset); |
---|
[180] | 3563 | goto fail_locked; |
---|
[152] | 3564 | } |
---|
| 3565 | |
---|
[186] | 3566 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_cells")) |
---|
[180] | 3567 | goto fail; |
---|
| 3568 | |
---|
[157] | 3569 | if(!range_list_add(ret_val, chunk_offset, cell_length, NULL)) |
---|
| 3570 | goto fail; |
---|
| 3571 | } |
---|
| 3572 | |
---|
| 3573 | return ret_val; |
---|
| 3574 | |
---|
[180] | 3575 | fail_locked: |
---|
[186] | 3576 | regfi_unlock(file, &file->cb_lock, "regfi_parse_big_data_cells"); |
---|
[157] | 3577 | fail: |
---|
| 3578 | if(ret_val != NULL) |
---|
| 3579 | range_list_free(ret_val); |
---|
| 3580 | return NULL; |
---|
| 3581 | } |
---|
| 3582 | |
---|
| 3583 | |
---|
| 3584 | /****************************************************************************** |
---|
| 3585 | *******************************************************************************/ |
---|
| 3586 | REGFI_BUFFER regfi_load_big_data(REGFI_FILE* file, |
---|
[168] | 3587 | uint32_t offset, uint32_t data_length, |
---|
| 3588 | uint32_t cell_length, range_list* used_ranges, |
---|
[157] | 3589 | bool strict) |
---|
| 3590 | { |
---|
| 3591 | REGFI_BUFFER ret_val; |
---|
[168] | 3592 | uint16_t num_chunks, i; |
---|
| 3593 | uint32_t read_length, data_left, tmp_len, indirect_offset; |
---|
| 3594 | uint32_t* indirect_ptrs = NULL; |
---|
[157] | 3595 | REGFI_BUFFER bd_header; |
---|
| 3596 | range_list* bd_cells = NULL; |
---|
| 3597 | const range_list_element* cell_info; |
---|
| 3598 | |
---|
| 3599 | ret_val.buf = NULL; |
---|
| 3600 | |
---|
| 3601 | /* XXX: Add better error/warning messages */ |
---|
| 3602 | |
---|
| 3603 | bd_header = regfi_parse_big_data_header(file, offset, cell_length, strict); |
---|
| 3604 | if(bd_header.buf == NULL) |
---|
| 3605 | goto fail; |
---|
| 3606 | |
---|
| 3607 | /* Keep track of used space for use by reglookup-recover */ |
---|
| 3608 | if(used_ranges != NULL) |
---|
| 3609 | if(!range_list_add(used_ranges, offset, cell_length, NULL)) |
---|
| 3610 | goto fail; |
---|
| 3611 | |
---|
| 3612 | num_chunks = SVAL(bd_header.buf, 0x2); |
---|
| 3613 | indirect_offset = IVAL(bd_header.buf, 0x4) + REGFI_REGF_SIZE; |
---|
| 3614 | talloc_free(bd_header.buf); |
---|
| 3615 | |
---|
| 3616 | indirect_ptrs = regfi_parse_big_data_indirect(file, indirect_offset, |
---|
| 3617 | num_chunks, strict); |
---|
| 3618 | if(indirect_ptrs == NULL) |
---|
| 3619 | goto fail; |
---|
| 3620 | |
---|
| 3621 | if(used_ranges != NULL) |
---|
| 3622 | if(!range_list_add(used_ranges, indirect_offset, num_chunks*4+4, NULL)) |
---|
| 3623 | goto fail; |
---|
| 3624 | |
---|
| 3625 | if((ret_val.buf = talloc_array(NULL, uint8_t, data_length)) == NULL) |
---|
| 3626 | goto fail; |
---|
| 3627 | data_left = data_length; |
---|
| 3628 | |
---|
| 3629 | bd_cells = regfi_parse_big_data_cells(file, indirect_ptrs, num_chunks, strict); |
---|
| 3630 | if(bd_cells == NULL) |
---|
| 3631 | goto fail; |
---|
| 3632 | |
---|
| 3633 | talloc_free(indirect_ptrs); |
---|
| 3634 | indirect_ptrs = NULL; |
---|
| 3635 | |
---|
| 3636 | for(i=0; (i<num_chunks) && (data_left>0); i++) |
---|
| 3637 | { |
---|
| 3638 | cell_info = range_list_get(bd_cells, i); |
---|
| 3639 | if(cell_info == NULL) |
---|
| 3640 | goto fail; |
---|
| 3641 | |
---|
| 3642 | /* XXX: This should be "cell_info->length-4" to account for the 4 byte cell |
---|
[154] | 3643 | * length. However, it has been observed that some (all?) chunks |
---|
| 3644 | * have an additional 4 bytes of 0 at the end of their cells that |
---|
| 3645 | * isn't part of the data, so we're trimming that off too. |
---|
[157] | 3646 | * Perhaps it's just an 8 byte alignment requirement... |
---|
[154] | 3647 | */ |
---|
[157] | 3648 | if(cell_info->length - 8 >= data_left) |
---|
| 3649 | { |
---|
| 3650 | if(i+1 != num_chunks) |
---|
| 3651 | { |
---|
[182] | 3652 | regfi_log_add(REGFI_LOG_WARN, "Left over chunks detected " |
---|
| 3653 | "while constructing big data at offset 0x%.8X " |
---|
| 3654 | "(chunk offset 0x%.8X).", offset, cell_info->offset); |
---|
[157] | 3655 | } |
---|
[152] | 3656 | read_length = data_left; |
---|
[157] | 3657 | } |
---|
[152] | 3658 | else |
---|
[157] | 3659 | read_length = cell_info->length - 8; |
---|
[152] | 3660 | |
---|
[157] | 3661 | |
---|
| 3662 | if(read_length > regfi_calc_maxsize(file, cell_info->offset)) |
---|
| 3663 | { |
---|
[182] | 3664 | regfi_log_add(REGFI_LOG_WARN, "A chunk exceeded the maxsize " |
---|
| 3665 | "while constructing big data at offset 0x%.8X " |
---|
| 3666 | "(chunk offset 0x%.8X).", offset, cell_info->offset); |
---|
[157] | 3667 | goto fail; |
---|
| 3668 | } |
---|
| 3669 | |
---|
[186] | 3670 | if(!regfi_lock(file, &file->cb_lock, "regfi_load_big_data")) |
---|
[180] | 3671 | goto fail; |
---|
| 3672 | |
---|
[178] | 3673 | if(regfi_seek(file->cb, cell_info->offset+sizeof(uint32_t), SEEK_SET) == -1) |
---|
[157] | 3674 | { |
---|
[182] | 3675 | regfi_log_add(REGFI_LOG_WARN, "Could not seek to chunk while " |
---|
| 3676 | "constructing big data at offset 0x%.8X " |
---|
| 3677 | "(chunk offset 0x%.8X).", offset, cell_info->offset); |
---|
[180] | 3678 | goto fail_locked; |
---|
[157] | 3679 | } |
---|
| 3680 | |
---|
| 3681 | tmp_len = read_length; |
---|
[178] | 3682 | if(regfi_read(file->cb, ret_val.buf+(data_length-data_left), |
---|
[157] | 3683 | &read_length) != 0 || (read_length != tmp_len)) |
---|
[152] | 3684 | { |
---|
[182] | 3685 | regfi_log_add(REGFI_LOG_WARN, "Could not read data chunk while" |
---|
| 3686 | " constructing big data at offset 0x%.8X" |
---|
| 3687 | " (chunk offset 0x%.8X).", offset, cell_info->offset); |
---|
[180] | 3688 | goto fail_locked; |
---|
[152] | 3689 | } |
---|
| 3690 | |
---|
[186] | 3691 | if(!regfi_unlock(file, &file->cb_lock, "regfi_load_big_data")) |
---|
[180] | 3692 | goto fail; |
---|
| 3693 | |
---|
[157] | 3694 | if(used_ranges != NULL) |
---|
| 3695 | if(!range_list_add(used_ranges, cell_info->offset,cell_info->length,NULL)) |
---|
| 3696 | goto fail; |
---|
| 3697 | |
---|
[152] | 3698 | data_left -= read_length; |
---|
| 3699 | } |
---|
[157] | 3700 | range_list_free(bd_cells); |
---|
| 3701 | |
---|
[152] | 3702 | ret_val.len = data_length-data_left; |
---|
| 3703 | return ret_val; |
---|
| 3704 | |
---|
[180] | 3705 | fail_locked: |
---|
[186] | 3706 | regfi_unlock(file, &file->cb_lock, "regfi_load_big_data"); |
---|
[152] | 3707 | fail: |
---|
[180] | 3708 | talloc_free(ret_val.buf); |
---|
| 3709 | talloc_free(indirect_ptrs); |
---|
[157] | 3710 | if(bd_cells != NULL) |
---|
| 3711 | range_list_free(bd_cells); |
---|
[152] | 3712 | ret_val.buf = NULL; |
---|
| 3713 | ret_val.len = 0; |
---|
| 3714 | return ret_val; |
---|
| 3715 | } |
---|
| 3716 | |
---|
| 3717 | |
---|
[135] | 3718 | range_list* regfi_parse_unalloc_cells(REGFI_FILE* file) |
---|
[110] | 3719 | { |
---|
| 3720 | range_list* ret_val; |
---|
[135] | 3721 | REGFI_HBIN* hbin; |
---|
[110] | 3722 | const range_list_element* hbins_elem; |
---|
[168] | 3723 | uint32_t i, num_hbins, curr_off, cell_len; |
---|
[110] | 3724 | bool is_unalloc; |
---|
| 3725 | |
---|
| 3726 | ret_val = range_list_new(); |
---|
| 3727 | if(ret_val == NULL) |
---|
| 3728 | return NULL; |
---|
| 3729 | |
---|
[186] | 3730 | if(!regfi_read_lock(file, &file->hbins_lock, "regfi_parse_unalloc_cells")) |
---|
[180] | 3731 | { |
---|
| 3732 | range_list_free(ret_val); |
---|
| 3733 | return NULL; |
---|
| 3734 | } |
---|
| 3735 | |
---|
[110] | 3736 | num_hbins = range_list_size(file->hbins); |
---|
| 3737 | for(i=0; i<num_hbins; i++) |
---|
| 3738 | { |
---|
| 3739 | hbins_elem = range_list_get(file->hbins, i); |
---|
| 3740 | if(hbins_elem == NULL) |
---|
| 3741 | break; |
---|
[135] | 3742 | hbin = (REGFI_HBIN*)hbins_elem->data; |
---|
[110] | 3743 | |
---|
[135] | 3744 | curr_off = REGFI_HBIN_HEADER_SIZE; |
---|
[110] | 3745 | while(curr_off < hbin->block_size) |
---|
| 3746 | { |
---|
[186] | 3747 | if(!regfi_lock(file, &file->cb_lock, "regfi_parse_unalloc_cells")) |
---|
[180] | 3748 | break; |
---|
| 3749 | |
---|
[178] | 3750 | if(!regfi_parse_cell(file->cb, hbin->file_off+curr_off, NULL, 0, |
---|
[110] | 3751 | &cell_len, &is_unalloc)) |
---|
[180] | 3752 | { |
---|
[186] | 3753 | regfi_unlock(file, &file->cb_lock, "regfi_parse_unalloc_cells"); |
---|
[110] | 3754 | break; |
---|
[180] | 3755 | } |
---|
| 3756 | |
---|
[186] | 3757 | if(!regfi_unlock(file, &file->cb_lock, "regfi_parse_unalloc_cells")) |
---|
[180] | 3758 | break; |
---|
| 3759 | |
---|
[157] | 3760 | if((cell_len == 0) || ((cell_len & 0x00000007) != 0)) |
---|
[140] | 3761 | { |
---|
[182] | 3762 | regfi_log_add(REGFI_LOG_ERROR, "Bad cell length encountered" |
---|
| 3763 | " while parsing unallocated cells at offset 0x%.8X.", |
---|
| 3764 | hbin->file_off+curr_off); |
---|
[110] | 3765 | break; |
---|
[140] | 3766 | } |
---|
| 3767 | |
---|
[110] | 3768 | /* for some reason the record_size of the last record in |
---|
| 3769 | an hbin block can extend past the end of the block |
---|
| 3770 | even though the record fits within the remaining |
---|
| 3771 | space....aaarrrgggghhhhhh */ |
---|
| 3772 | if(curr_off + cell_len >= hbin->block_size) |
---|
| 3773 | cell_len = hbin->block_size - curr_off; |
---|
| 3774 | |
---|
| 3775 | if(is_unalloc) |
---|
| 3776 | range_list_add(ret_val, hbin->file_off+curr_off, |
---|
| 3777 | cell_len, NULL); |
---|
| 3778 | |
---|
| 3779 | curr_off = curr_off+cell_len; |
---|
| 3780 | } |
---|
| 3781 | } |
---|
| 3782 | |
---|
[186] | 3783 | if(!regfi_rw_unlock(file, &file->hbins_lock, "regfi_parse_unalloc_cells")) |
---|
[180] | 3784 | { |
---|
| 3785 | range_list_free(ret_val); |
---|
| 3786 | return NULL; |
---|
| 3787 | } |
---|
| 3788 | |
---|
[110] | 3789 | return ret_val; |
---|
| 3790 | } |
---|
[168] | 3791 | |
---|
| 3792 | |
---|
| 3793 | /* From lib/time.c */ |
---|
| 3794 | |
---|
| 3795 | /**************************************************************************** |
---|
| 3796 | Put a 8 byte filetime from a time_t |
---|
| 3797 | This takes real GMT as input and converts to kludge-GMT |
---|
| 3798 | ****************************************************************************/ |
---|
| 3799 | void regfi_unix2nt_time(REGFI_NTTIME *nt, time_t t) |
---|
| 3800 | { |
---|
| 3801 | double d; |
---|
| 3802 | |
---|
| 3803 | if (t==0) |
---|
| 3804 | { |
---|
| 3805 | nt->low = 0; |
---|
| 3806 | nt->high = 0; |
---|
| 3807 | return; |
---|
| 3808 | } |
---|
| 3809 | |
---|
| 3810 | if (t == TIME_T_MAX) |
---|
| 3811 | { |
---|
| 3812 | nt->low = 0xffffffff; |
---|
| 3813 | nt->high = 0x7fffffff; |
---|
| 3814 | return; |
---|
| 3815 | } |
---|
| 3816 | |
---|
| 3817 | if (t == -1) |
---|
| 3818 | { |
---|
| 3819 | nt->low = 0xffffffff; |
---|
| 3820 | nt->high = 0xffffffff; |
---|
| 3821 | return; |
---|
| 3822 | } |
---|
| 3823 | |
---|
| 3824 | /* this converts GMT to kludge-GMT */ |
---|
| 3825 | /* XXX: This was removed due to difficult dependency requirements. |
---|
| 3826 | * So far, times appear to be correct without this adjustment, but |
---|
| 3827 | * that may be proven wrong with adequate testing. |
---|
| 3828 | */ |
---|
| 3829 | /* t -= TimeDiff(t) - get_serverzone(); */ |
---|
| 3830 | |
---|
| 3831 | d = (double)(t); |
---|
| 3832 | d += TIME_FIXUP_CONSTANT; |
---|
| 3833 | d *= 1.0e7; |
---|
| 3834 | |
---|
| 3835 | nt->high = (uint32_t)(d * (1.0/(4.0*(double)(1<<30)))); |
---|
| 3836 | nt->low = (uint32_t)(d - ((double)nt->high)*4.0*(double)(1<<30)); |
---|
| 3837 | } |
---|
| 3838 | |
---|
| 3839 | |
---|
| 3840 | /**************************************************************************** |
---|
| 3841 | Interpret an 8 byte "filetime" structure to a time_t |
---|
| 3842 | It's originally in "100ns units since jan 1st 1601" |
---|
| 3843 | |
---|
| 3844 | An 8 byte value of 0xffffffffffffffff will be returned as (time_t)0. |
---|
| 3845 | |
---|
| 3846 | It appears to be kludge-GMT (at least for file listings). This means |
---|
| 3847 | its the GMT you get by taking a localtime and adding the |
---|
| 3848 | serverzone. This is NOT the same as GMT in some cases. This routine |
---|
| 3849 | converts this to real GMT. |
---|
| 3850 | ****************************************************************************/ |
---|
[219] | 3851 | double regfi_nt2unix_time(const REGFI_NTTIME* nt) |
---|
[168] | 3852 | { |
---|
[219] | 3853 | double ret_val; |
---|
| 3854 | |
---|
[168] | 3855 | /* The next two lines are a fix needed for the |
---|
| 3856 | broken SCO compiler. JRA. */ |
---|
| 3857 | time_t l_time_min = TIME_T_MIN; |
---|
| 3858 | time_t l_time_max = TIME_T_MAX; |
---|
| 3859 | |
---|
| 3860 | if (nt->high == 0 || (nt->high == 0xffffffff && nt->low == 0xffffffff)) |
---|
| 3861 | return(0); |
---|
| 3862 | |
---|
[219] | 3863 | ret_val = ((double)nt->high)*4.0*(double)(1<<30); |
---|
| 3864 | ret_val += nt->low; |
---|
| 3865 | ret_val *= 1.0e-7; |
---|
[168] | 3866 | |
---|
| 3867 | /* now adjust by 369 years to make the secs since 1970 */ |
---|
[219] | 3868 | ret_val -= TIME_FIXUP_CONSTANT; |
---|
[168] | 3869 | |
---|
[219] | 3870 | /* XXX: should these sanity checks be removed? */ |
---|
| 3871 | if (ret_val <= l_time_min) |
---|
[168] | 3872 | return (l_time_min); |
---|
| 3873 | |
---|
[219] | 3874 | if (ret_val >= l_time_max) |
---|
[168] | 3875 | return (l_time_max); |
---|
| 3876 | |
---|
| 3877 | /* this takes us from kludge-GMT to real GMT */ |
---|
| 3878 | /* XXX: This was removed due to difficult dependency requirements. |
---|
| 3879 | * So far, times appear to be correct without this adjustment, but |
---|
| 3880 | * that may be proven wrong with adequate testing. |
---|
| 3881 | */ |
---|
| 3882 | /* |
---|
| 3883 | ret -= get_serverzone(); |
---|
| 3884 | ret += LocTimeDiff(ret); |
---|
| 3885 | */ |
---|
| 3886 | |
---|
[219] | 3887 | return ret_val; |
---|
[168] | 3888 | } |
---|
| 3889 | |
---|
| 3890 | /* End of stuff from lib/time.c */ |
---|