[30] | 1 | /* |
---|
[135] | 2 | * A utility to read a Windows NT and later registry files. |
---|
[30] | 3 | * |
---|
[135] | 4 | * Copyright (C) 2005-2009 Timothy D. Morgan |
---|
[42] | 5 | * Copyright (C) 2002 Richard Sharpe, rsharpe@richardsharpe.com |
---|
[30] | 6 | * |
---|
| 7 | * This program is free software; you can redistribute it and/or modify |
---|
| 8 | * it under the terms of the GNU General Public License as published by |
---|
[111] | 9 | * the Free Software Foundation; version 3 of the License. |
---|
[30] | 10 | * |
---|
| 11 | * This program is distributed in the hope that it will be useful, |
---|
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 14 | * GNU General Public License for more details. |
---|
| 15 | * |
---|
| 16 | * You should have received a copy of the GNU General Public License |
---|
| 17 | * along with this program; if not, write to the Free Software |
---|
| 18 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
---|
| 19 | * |
---|
| 20 | * $Id: reglookup.c 159 2009-12-06 20:09:01Z tim $ |
---|
| 21 | */ |
---|
| 22 | |
---|
| 23 | |
---|
| 24 | #include <stdlib.h> |
---|
| 25 | #include <stdio.h> |
---|
| 26 | #include <string.h> |
---|
[33] | 27 | #include <strings.h> |
---|
[42] | 28 | #include <time.h> |
---|
[147] | 29 | #include "regfi.h" |
---|
| 30 | #include "void_stack.h" |
---|
[30] | 31 | |
---|
[40] | 32 | /* Globals, influenced by command line parameters */ |
---|
| 33 | bool print_verbose = false; |
---|
| 34 | bool print_security = false; |
---|
[42] | 35 | bool print_header = true; |
---|
[40] | 36 | bool path_filter_enabled = false; |
---|
| 37 | bool type_filter_enabled = false; |
---|
| 38 | char* path_filter = NULL; |
---|
| 39 | int type_filter; |
---|
| 40 | char* registry_file = NULL; |
---|
| 41 | |
---|
[42] | 42 | /* Other globals */ |
---|
[135] | 43 | REGFI_FILE* f; |
---|
[66] | 44 | |
---|
[40] | 45 | |
---|
[116] | 46 | /* XXX: A hack to share some functions with reglookup-recover.c. |
---|
[125] | 47 | * Should move these into a proper library at some point. |
---|
[111] | 48 | */ |
---|
| 49 | #include "common.c" |
---|
[61] | 50 | |
---|
[38] | 51 | |
---|
[159] | 52 | void printValue(REGFI_ITERATOR* iter, const REGFI_VK_REC* vk, char* prefix) |
---|
[41] | 53 | { |
---|
[159] | 54 | REGFI_DATA* data; |
---|
[111] | 55 | char* quoted_value = NULL; |
---|
| 56 | char* quoted_name = NULL; |
---|
| 57 | char* conv_error = NULL; |
---|
| 58 | const char* str_type = NULL; |
---|
[41] | 59 | |
---|
[111] | 60 | quoted_name = quote_string(vk->valuename, key_special_chars); |
---|
| 61 | if (quoted_name == NULL) |
---|
| 62 | { /* Value names are NULL when we're looking at the "(default)" value. |
---|
| 63 | * Currently we just return a 0-length string to try an eliminate |
---|
| 64 | * ambiguity with a literal "(default)" value. The data type of a line |
---|
| 65 | * in the output allows one to differentiate between the parent key and |
---|
| 66 | * this value. |
---|
| 67 | */ |
---|
| 68 | quoted_name = malloc(1*sizeof(char)); |
---|
| 69 | if(quoted_name == NULL) |
---|
[143] | 70 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Could not allocate sufficient memory.\n"); |
---|
[111] | 71 | quoted_name[0] = '\0'; |
---|
| 72 | } |
---|
[159] | 73 | |
---|
| 74 | data = regfi_iterator_fetch_data(iter, vk); |
---|
[41] | 75 | |
---|
[159] | 76 | printMsgs(iter->f); |
---|
| 77 | if(data != NULL) |
---|
[41] | 78 | { |
---|
[159] | 79 | quoted_value = data_to_ascii(data, &conv_error); |
---|
[138] | 80 | if(quoted_value == NULL) |
---|
| 81 | { |
---|
| 82 | if(conv_error == NULL) |
---|
| 83 | fprintf(stderr, "WARN: Could not quote value for '%s/%s'. " |
---|
| 84 | "Memory allocation failure likely.\n", prefix, quoted_name); |
---|
| 85 | else |
---|
| 86 | fprintf(stderr, "WARN: Could not quote value for '%s/%s'. " |
---|
| 87 | "Returned error: %s\n", prefix, quoted_name, conv_error); |
---|
| 88 | } |
---|
[159] | 89 | else if(conv_error != NULL) |
---|
| 90 | fprintf(stderr, "WARN: While quoting value for '%s/%s', " |
---|
[138] | 91 | "warning returned: %s\n", prefix, quoted_name, conv_error); |
---|
[159] | 92 | regfi_free_data(data); |
---|
[138] | 93 | } |
---|
[41] | 94 | |
---|
[111] | 95 | str_type = regfi_type_val2str(vk->type); |
---|
| 96 | if(print_security) |
---|
[41] | 97 | { |
---|
[111] | 98 | if(str_type == NULL) |
---|
| 99 | printf("%s/%s,0x%.8X,%s,,,,,\n", prefix, quoted_name, |
---|
| 100 | vk->type, quoted_value); |
---|
[66] | 101 | else |
---|
[111] | 102 | printf("%s/%s,%s,%s,,,,,\n", prefix, quoted_name, |
---|
| 103 | str_type, quoted_value); |
---|
[71] | 104 | } |
---|
[111] | 105 | else |
---|
| 106 | { |
---|
| 107 | if(str_type == NULL) |
---|
| 108 | printf("%s/%s,0x%.8X,%s,\n", prefix, quoted_name, |
---|
| 109 | vk->type, quoted_value); |
---|
| 110 | else |
---|
| 111 | printf("%s/%s,%s,%s,\n", prefix, quoted_name, |
---|
| 112 | str_type, quoted_value); |
---|
| 113 | } |
---|
[42] | 114 | |
---|
[111] | 115 | if(quoted_value != NULL) |
---|
| 116 | free(quoted_value); |
---|
| 117 | if(quoted_name != NULL) |
---|
| 118 | free(quoted_name); |
---|
| 119 | if(conv_error != NULL) |
---|
| 120 | free(conv_error); |
---|
[41] | 121 | } |
---|
| 122 | |
---|
| 123 | |
---|
[81] | 124 | char** splitPath(const char* s) |
---|
[30] | 125 | { |
---|
[81] | 126 | char** ret_val; |
---|
[38] | 127 | const char* cur = s; |
---|
[33] | 128 | char* next = NULL; |
---|
[38] | 129 | char* copy; |
---|
[81] | 130 | uint32 ret_cur = 0; |
---|
[38] | 131 | |
---|
[135] | 132 | ret_val = (char**)malloc((REGFI_MAX_DEPTH+1+1)*sizeof(char**)); |
---|
[81] | 133 | if (ret_val == NULL) |
---|
[38] | 134 | return NULL; |
---|
[81] | 135 | ret_val[0] = NULL; |
---|
| 136 | |
---|
| 137 | /* We return a well-formed, 0-length, path even when input is icky. */ |
---|
[37] | 138 | if (s == NULL) |
---|
[81] | 139 | return ret_val; |
---|
[38] | 140 | |
---|
| 141 | while((next = strchr(cur, '/')) != NULL) |
---|
[33] | 142 | { |
---|
[38] | 143 | if ((next-cur) > 0) |
---|
| 144 | { |
---|
| 145 | copy = (char*)malloc((next-cur+1)*sizeof(char)); |
---|
| 146 | if(copy == NULL) |
---|
[143] | 147 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Memory allocation problem.\n"); |
---|
[38] | 148 | |
---|
| 149 | memcpy(copy, cur, next-cur); |
---|
| 150 | copy[next-cur] = '\0'; |
---|
[81] | 151 | ret_val[ret_cur++] = copy; |
---|
[135] | 152 | if(ret_cur < (REGFI_MAX_DEPTH+1+1)) |
---|
[81] | 153 | ret_val[ret_cur] = NULL; |
---|
| 154 | else |
---|
[143] | 155 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: Registry maximum depth exceeded.\n"); |
---|
[38] | 156 | } |
---|
| 157 | cur = next+1; |
---|
[33] | 158 | } |
---|
[81] | 159 | |
---|
| 160 | /* Grab last element, if path doesn't end in '/'. */ |
---|
[33] | 161 | if(strlen(cur) > 0) |
---|
[38] | 162 | { |
---|
| 163 | copy = strdup(cur); |
---|
[81] | 164 | ret_val[ret_cur++] = copy; |
---|
[135] | 165 | if(ret_cur < (REGFI_MAX_DEPTH+1+1)) |
---|
[81] | 166 | ret_val[ret_cur] = NULL; |
---|
| 167 | else |
---|
[143] | 168 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: Registry maximum depth exceeded.\n"); |
---|
[38] | 169 | } |
---|
[33] | 170 | |
---|
| 171 | return ret_val; |
---|
| 172 | } |
---|
| 173 | |
---|
[81] | 174 | |
---|
[83] | 175 | void freePath(char** path) |
---|
| 176 | { |
---|
| 177 | uint32 i; |
---|
| 178 | |
---|
| 179 | if(path == NULL) |
---|
| 180 | return; |
---|
| 181 | |
---|
| 182 | for(i=0; path[i] != NULL; i++) |
---|
| 183 | free(path[i]); |
---|
| 184 | |
---|
| 185 | free(path); |
---|
| 186 | } |
---|
| 187 | |
---|
| 188 | |
---|
[81] | 189 | /* Returns a quoted path from an iterator's stack */ |
---|
| 190 | char* iter2Path(REGFI_ITERATOR* i) |
---|
[33] | 191 | { |
---|
[81] | 192 | const REGFI_ITER_POSITION* cur; |
---|
[37] | 193 | uint32 buf_left = 127; |
---|
| 194 | uint32 buf_len = buf_left+1; |
---|
| 195 | uint32 name_len = 0; |
---|
| 196 | uint32 grow_amt; |
---|
[81] | 197 | char* buf; |
---|
[31] | 198 | char* new_buf; |
---|
[66] | 199 | char* name; |
---|
[81] | 200 | const char* cur_name; |
---|
[31] | 201 | void_stack_iterator* iter; |
---|
| 202 | |
---|
| 203 | buf = (char*)malloc((buf_len)*sizeof(char)); |
---|
| 204 | if (buf == NULL) |
---|
| 205 | return NULL; |
---|
[54] | 206 | buf[0] = '\0'; |
---|
[30] | 207 | |
---|
[81] | 208 | iter = void_stack_iterator_new(i->key_positions); |
---|
[31] | 209 | if (iter == NULL) |
---|
[30] | 210 | { |
---|
[31] | 211 | free(buf); |
---|
| 212 | return NULL; |
---|
[30] | 213 | } |
---|
| 214 | |
---|
[33] | 215 | /* skip root element */ |
---|
[81] | 216 | if(void_stack_size(i->key_positions) < 1) |
---|
| 217 | { |
---|
| 218 | buf[0] = '/'; |
---|
| 219 | buf[1] = '\0'; |
---|
| 220 | return buf; |
---|
| 221 | } |
---|
[33] | 222 | cur = void_stack_iterator_next(iter); |
---|
| 223 | |
---|
[81] | 224 | do |
---|
[31] | 225 | { |
---|
[81] | 226 | cur = void_stack_iterator_next(iter); |
---|
| 227 | if (cur == NULL) |
---|
| 228 | cur_name = i->cur_key->keyname; |
---|
| 229 | else |
---|
| 230 | cur_name = cur->nk->keyname; |
---|
| 231 | |
---|
[33] | 232 | buf[buf_len-buf_left-1] = '/'; |
---|
| 233 | buf_left -= 1; |
---|
[81] | 234 | name = quote_string(cur_name, key_special_chars); |
---|
[66] | 235 | name_len = strlen(name); |
---|
[31] | 236 | if(name_len+1 > buf_left) |
---|
| 237 | { |
---|
[37] | 238 | grow_amt = (uint32)(buf_len/2); |
---|
[31] | 239 | buf_len += name_len+1+grow_amt-buf_left; |
---|
| 240 | if((new_buf = realloc(buf, buf_len)) == NULL) |
---|
| 241 | { |
---|
[136] | 242 | free(name); |
---|
[31] | 243 | free(buf); |
---|
| 244 | free(iter); |
---|
| 245 | return NULL; |
---|
| 246 | } |
---|
| 247 | buf = new_buf; |
---|
| 248 | buf_left = grow_amt + name_len + 1; |
---|
| 249 | } |
---|
[66] | 250 | strncpy(buf+(buf_len-buf_left-1), name, name_len); |
---|
[31] | 251 | buf_left -= name_len; |
---|
| 252 | buf[buf_len-buf_left-1] = '\0'; |
---|
[66] | 253 | free(name); |
---|
[81] | 254 | } while(cur != NULL); |
---|
[30] | 255 | |
---|
[31] | 256 | return buf; |
---|
| 257 | } |
---|
[30] | 258 | |
---|
[31] | 259 | |
---|
[137] | 260 | void printValueList(REGFI_ITERATOR* iter, char* prefix) |
---|
[32] | 261 | { |
---|
[150] | 262 | REGFI_VK_REC* value; |
---|
[80] | 263 | |
---|
[137] | 264 | value = regfi_iterator_first_value(iter); |
---|
[80] | 265 | while(value != NULL) |
---|
[81] | 266 | { |
---|
| 267 | if(!type_filter_enabled || (value->type == type_filter)) |
---|
[159] | 268 | printValue(iter, value, prefix); |
---|
[150] | 269 | regfi_free_value(value); |
---|
[137] | 270 | value = regfi_iterator_next_value(iter); |
---|
[138] | 271 | printMsgs(iter->f); |
---|
[81] | 272 | } |
---|
[33] | 273 | } |
---|
| 274 | |
---|
[37] | 275 | |
---|
[137] | 276 | void printKey(REGFI_ITERATOR* iter, char* full_path) |
---|
[33] | 277 | { |
---|
[43] | 278 | static char empty_str[1] = ""; |
---|
[42] | 279 | char* owner = NULL; |
---|
| 280 | char* group = NULL; |
---|
| 281 | char* sacl = NULL; |
---|
| 282 | char* dacl = NULL; |
---|
[125] | 283 | char* quoted_classname; |
---|
[126] | 284 | char* error_msg = NULL; |
---|
[42] | 285 | char mtime[20]; |
---|
| 286 | time_t tmp_time[1]; |
---|
| 287 | struct tm* tmp_time_s = NULL; |
---|
[135] | 288 | const REGFI_SK_REC* sk; |
---|
[137] | 289 | const REGFI_NK_REC* k = regfi_iterator_cur_key(iter); |
---|
[42] | 290 | |
---|
[43] | 291 | *tmp_time = nt_time_to_unix(&k->mtime); |
---|
| 292 | tmp_time_s = gmtime(tmp_time); |
---|
| 293 | strftime(mtime, sizeof(mtime), "%Y-%m-%d %H:%M:%S", tmp_time_s); |
---|
| 294 | |
---|
[137] | 295 | if(print_security && (sk=regfi_iterator_cur_sk(iter))) |
---|
[43] | 296 | { |
---|
[109] | 297 | owner = regfi_get_owner(sk->sec_desc); |
---|
| 298 | group = regfi_get_group(sk->sec_desc); |
---|
| 299 | sacl = regfi_get_sacl(sk->sec_desc); |
---|
| 300 | dacl = regfi_get_dacl(sk->sec_desc); |
---|
[43] | 301 | if(owner == NULL) |
---|
| 302 | owner = empty_str; |
---|
| 303 | if(group == NULL) |
---|
| 304 | group = empty_str; |
---|
| 305 | if(sacl == NULL) |
---|
| 306 | sacl = empty_str; |
---|
| 307 | if(dacl == NULL) |
---|
| 308 | dacl = empty_str; |
---|
| 309 | |
---|
[125] | 310 | if(k->classname != NULL) |
---|
[126] | 311 | { |
---|
| 312 | quoted_classname = quote_unicode((uint8*)k->classname, k->classname_length, |
---|
| 313 | key_special_chars, &error_msg); |
---|
| 314 | if(quoted_classname == NULL) |
---|
| 315 | { |
---|
| 316 | if(error_msg == NULL) |
---|
| 317 | fprintf(stderr, "ERROR: Could not quote classname" |
---|
| 318 | " for key '%s' due to unknown error.\n", full_path); |
---|
| 319 | else |
---|
| 320 | { |
---|
| 321 | fprintf(stderr, "ERROR: Could not quote classname" |
---|
| 322 | " for key '%s' due to error: %s\n", full_path, error_msg); |
---|
| 323 | free(error_msg); |
---|
| 324 | } |
---|
| 325 | } |
---|
| 326 | else if (error_msg != NULL) |
---|
| 327 | { |
---|
| 328 | if(print_verbose) |
---|
[138] | 329 | fprintf(stderr, "INFO: While converting classname" |
---|
[126] | 330 | " for key '%s': %s.\n", full_path, error_msg); |
---|
| 331 | free(error_msg); |
---|
| 332 | } |
---|
| 333 | } |
---|
[125] | 334 | else |
---|
| 335 | quoted_classname = empty_str; |
---|
[43] | 336 | |
---|
[138] | 337 | printMsgs(iter->f); |
---|
[125] | 338 | printf("%s,KEY,,%s,%s,%s,%s,%s,%s\n", full_path, mtime, |
---|
| 339 | owner, group, sacl, dacl, quoted_classname); |
---|
| 340 | |
---|
[43] | 341 | if(owner != empty_str) |
---|
| 342 | free(owner); |
---|
| 343 | if(group != empty_str) |
---|
| 344 | free(group); |
---|
| 345 | if(sacl != empty_str) |
---|
| 346 | free(sacl); |
---|
| 347 | if(dacl != empty_str) |
---|
| 348 | free(dacl); |
---|
[125] | 349 | if(quoted_classname != empty_str) |
---|
| 350 | free(quoted_classname); |
---|
[43] | 351 | } |
---|
| 352 | else |
---|
[66] | 353 | printf("%s,KEY,,%s\n", full_path, mtime); |
---|
[43] | 354 | } |
---|
| 355 | |
---|
| 356 | |
---|
[81] | 357 | void printKeyTree(REGFI_ITERATOR* iter) |
---|
[43] | 358 | { |
---|
[135] | 359 | const REGFI_NK_REC* root = NULL; |
---|
| 360 | const REGFI_NK_REC* cur = NULL; |
---|
[150] | 361 | REGFI_NK_REC* sub = NULL; |
---|
[43] | 362 | char* path = NULL; |
---|
[78] | 363 | int key_type = regfi_type_str2val("KEY"); |
---|
[81] | 364 | bool print_this = true; |
---|
| 365 | |
---|
| 366 | root = cur = regfi_iterator_cur_key(iter); |
---|
| 367 | sub = regfi_iterator_first_subkey(iter); |
---|
[138] | 368 | printMsgs(iter->f); |
---|
[137] | 369 | |
---|
[81] | 370 | if(root == NULL) |
---|
[143] | 371 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: root cannot be NULL.\n"); |
---|
[81] | 372 | |
---|
| 373 | do |
---|
[31] | 374 | { |
---|
[81] | 375 | if(print_this) |
---|
[54] | 376 | { |
---|
[81] | 377 | path = iter2Path(iter); |
---|
| 378 | if(path == NULL) |
---|
[143] | 379 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Could not construct iterator's path.\n"); |
---|
[137] | 380 | |
---|
[81] | 381 | if(!type_filter_enabled || (key_type == type_filter)) |
---|
[109] | 382 | printKey(iter, path); |
---|
[81] | 383 | if(!type_filter_enabled || (key_type != type_filter)) |
---|
| 384 | printValueList(iter, path); |
---|
| 385 | |
---|
| 386 | free(path); |
---|
[54] | 387 | } |
---|
[66] | 388 | |
---|
[81] | 389 | if(sub == NULL) |
---|
[31] | 390 | { |
---|
[81] | 391 | if(cur != root) |
---|
[31] | 392 | { |
---|
[81] | 393 | /* We're done with this sub-tree, going up and hitting other branches. */ |
---|
| 394 | if(!regfi_iterator_up(iter)) |
---|
[137] | 395 | { |
---|
[138] | 396 | printMsgs(iter->f); |
---|
[143] | 397 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: could not traverse iterator upward.\n"); |
---|
[137] | 398 | } |
---|
| 399 | |
---|
[81] | 400 | cur = regfi_iterator_cur_key(iter); |
---|
| 401 | if(cur == NULL) |
---|
[137] | 402 | { |
---|
[138] | 403 | printMsgs(iter->f); |
---|
[143] | 404 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: unexpected NULL for key.\n"); |
---|
[137] | 405 | } |
---|
[150] | 406 | |
---|
[81] | 407 | sub = regfi_iterator_next_subkey(iter); |
---|
[66] | 408 | } |
---|
[81] | 409 | print_this = false; |
---|
[31] | 410 | } |
---|
[81] | 411 | else |
---|
| 412 | { /* We have unexplored sub-keys. |
---|
| 413 | * Let's move down and print this first sub-tree out. |
---|
| 414 | */ |
---|
| 415 | if(!regfi_iterator_down(iter)) |
---|
[137] | 416 | { |
---|
[138] | 417 | printMsgs(iter->f); |
---|
[143] | 418 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: could not traverse iterator downward.\n"); |
---|
[137] | 419 | } |
---|
[81] | 420 | |
---|
[150] | 421 | cur = regfi_iterator_cur_key(iter); |
---|
| 422 | regfi_free_key(sub); |
---|
[81] | 423 | sub = regfi_iterator_first_subkey(iter); |
---|
| 424 | print_this = true; |
---|
| 425 | } |
---|
[138] | 426 | printMsgs(iter->f); |
---|
[81] | 427 | } while(!((cur == root) && (sub == NULL))); |
---|
| 428 | |
---|
[54] | 429 | if(print_verbose) |
---|
[138] | 430 | fprintf(stderr, "INFO: Finished printing key tree.\n"); |
---|
[30] | 431 | } |
---|
| 432 | |
---|
[81] | 433 | |
---|
[140] | 434 | /* XXX: What if there is BOTH a value AND a key with that name?? |
---|
| 435 | * What if there are multiple keys/values with the same name?? |
---|
| 436 | */ |
---|
[33] | 437 | /* |
---|
[80] | 438 | * Returns 0 if path was not found. |
---|
| 439 | * Returns 1 if path was found as value. |
---|
| 440 | * Returns 2 if path was found as key. |
---|
[33] | 441 | * Returns less than 0 on other error. |
---|
| 442 | */ |
---|
[80] | 443 | int retrievePath(REGFI_ITERATOR* iter, char** path) |
---|
[33] | 444 | { |
---|
[150] | 445 | REGFI_VK_REC* value; |
---|
[81] | 446 | char* tmp_path_joined; |
---|
| 447 | const char** tmp_path; |
---|
[80] | 448 | uint32 i; |
---|
| 449 | |
---|
| 450 | if(path == NULL) |
---|
[33] | 451 | return -1; |
---|
| 452 | |
---|
[80] | 453 | /* One extra for any value at the end, and one more for NULL */ |
---|
[135] | 454 | tmp_path = (const char**)malloc(sizeof(const char**)*(REGFI_MAX_DEPTH+1+1)); |
---|
[80] | 455 | if(tmp_path == NULL) |
---|
[33] | 456 | return -2; |
---|
| 457 | |
---|
[80] | 458 | /* Strip any potential value name at end of path */ |
---|
| 459 | for(i=0; |
---|
[136] | 460 | (path[i] != NULL) && (path[i+1] != NULL) && (i < REGFI_MAX_DEPTH+1); |
---|
[80] | 461 | i++) |
---|
[136] | 462 | { tmp_path[i] = path[i]; } |
---|
[80] | 463 | tmp_path[i] = NULL; |
---|
| 464 | |
---|
[54] | 465 | if(print_verbose) |
---|
[138] | 466 | fprintf(stderr, "INFO: Attempting to retrieve specified path: %s\n", |
---|
[54] | 467 | path_filter); |
---|
| 468 | |
---|
[82] | 469 | /* Special check for '/' path filter */ |
---|
| 470 | if(path[0] == NULL) |
---|
| 471 | { |
---|
| 472 | if(print_verbose) |
---|
[138] | 473 | fprintf(stderr, "INFO: Found final path element as root key.\n"); |
---|
[136] | 474 | free(tmp_path); |
---|
[82] | 475 | return 2; |
---|
| 476 | } |
---|
| 477 | |
---|
[80] | 478 | if(!regfi_iterator_walk_path(iter, tmp_path)) |
---|
[33] | 479 | { |
---|
[138] | 480 | printMsgs(iter->f); |
---|
[80] | 481 | free(tmp_path); |
---|
| 482 | return 0; |
---|
[33] | 483 | } |
---|
| 484 | |
---|
[80] | 485 | if(regfi_iterator_find_value(iter, path[i])) |
---|
| 486 | { |
---|
| 487 | if(print_verbose) |
---|
[138] | 488 | fprintf(stderr, "INFO: Found final path element as value.\n"); |
---|
[33] | 489 | |
---|
[80] | 490 | value = regfi_iterator_cur_value(iter); |
---|
[138] | 491 | printMsgs(iter->f); |
---|
[81] | 492 | tmp_path_joined = iter2Path(iter); |
---|
[54] | 493 | |
---|
[80] | 494 | if((value == NULL) || (tmp_path_joined == NULL)) |
---|
[143] | 495 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Unexpected error before printValue.\n"); |
---|
[54] | 496 | |
---|
[121] | 497 | if(!type_filter_enabled || (value->type == type_filter)) |
---|
[159] | 498 | printValue(iter, value, tmp_path_joined); |
---|
[54] | 499 | |
---|
[150] | 500 | regfi_free_value(value); |
---|
[80] | 501 | free(tmp_path); |
---|
| 502 | free(tmp_path_joined); |
---|
| 503 | return 1; |
---|
[33] | 504 | } |
---|
[80] | 505 | else if(regfi_iterator_find_subkey(iter, path[i])) |
---|
[33] | 506 | { |
---|
[138] | 507 | printMsgs(iter->f); |
---|
[80] | 508 | if(print_verbose) |
---|
[138] | 509 | fprintf(stderr, "INFO: Found final path element as key.\n"); |
---|
[82] | 510 | |
---|
| 511 | if(!regfi_iterator_down(iter)) |
---|
[137] | 512 | { |
---|
[138] | 513 | printMsgs(iter->f); |
---|
[143] | 514 | bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: Unexpected error on traversing path filter key.\n"); |
---|
[137] | 515 | } |
---|
[82] | 516 | |
---|
[80] | 517 | return 2; |
---|
[33] | 518 | } |
---|
[138] | 519 | printMsgs(iter->f); |
---|
[33] | 520 | |
---|
[54] | 521 | if(print_verbose) |
---|
[138] | 522 | fprintf(stderr, "INFO: Could not find last element of path.\n"); |
---|
[54] | 523 | |
---|
[80] | 524 | return 0; |
---|
[33] | 525 | } |
---|
| 526 | |
---|
| 527 | |
---|
[37] | 528 | static void usage(void) |
---|
| 529 | { |
---|
[61] | 530 | fprintf(stderr, "Usage: reglookup [-v] [-s]" |
---|
[40] | 531 | " [-p <PATH_FILTER>] [-t <TYPE_FILTER>]" |
---|
[39] | 532 | " <REGISTRY_FILE>\n"); |
---|
[111] | 533 | fprintf(stderr, "Version: %s\n", REGLOOKUP_VERSION); |
---|
[39] | 534 | fprintf(stderr, "Options:\n"); |
---|
| 535 | fprintf(stderr, "\t-v\t sets verbose mode.\n"); |
---|
[47] | 536 | fprintf(stderr, "\t-h\t enables header row. (default)\n"); |
---|
| 537 | fprintf(stderr, "\t-H\t disables header row.\n"); |
---|
[44] | 538 | fprintf(stderr, "\t-s\t enables security descriptor output.\n"); |
---|
| 539 | fprintf(stderr, "\t-S\t disables security descriptor output. (default)\n"); |
---|
[40] | 540 | fprintf(stderr, "\t-p\t restrict output to elements below this path.\n"); |
---|
| 541 | fprintf(stderr, "\t-t\t restrict results to this specific data type.\n"); |
---|
[37] | 542 | fprintf(stderr, "\n"); |
---|
| 543 | } |
---|
| 544 | |
---|
| 545 | |
---|
[30] | 546 | int main(int argc, char** argv) |
---|
| 547 | { |
---|
[80] | 548 | char** path = NULL; |
---|
| 549 | REGFI_ITERATOR* iter; |
---|
[33] | 550 | int retr_path_ret; |
---|
[44] | 551 | uint32 argi, arge; |
---|
[31] | 552 | |
---|
[37] | 553 | /* Process command line arguments */ |
---|
[30] | 554 | if(argc < 2) |
---|
| 555 | { |
---|
[37] | 556 | usage(); |
---|
[143] | 557 | bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: Requires at least one argument.\n"); |
---|
[30] | 558 | } |
---|
[37] | 559 | |
---|
[44] | 560 | arge = argc-1; |
---|
| 561 | for(argi = 1; argi < arge; argi++) |
---|
[37] | 562 | { |
---|
[40] | 563 | if (strcmp("-p", argv[argi]) == 0) |
---|
[37] | 564 | { |
---|
[44] | 565 | if(++argi >= arge) |
---|
[37] | 566 | { |
---|
| 567 | usage(); |
---|
[143] | 568 | bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: '-p' option requires parameter.\n"); |
---|
[37] | 569 | } |
---|
[40] | 570 | if((path_filter = strdup(argv[argi])) == NULL) |
---|
[143] | 571 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Memory allocation problem.\n"); |
---|
[38] | 572 | |
---|
[40] | 573 | path_filter_enabled = true; |
---|
[37] | 574 | } |
---|
| 575 | else if (strcmp("-t", argv[argi]) == 0) |
---|
| 576 | { |
---|
[44] | 577 | if(++argi >= arge) |
---|
[37] | 578 | { |
---|
| 579 | usage(); |
---|
[143] | 580 | bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: '-t' option requires parameter.\n"); |
---|
[37] | 581 | } |
---|
[78] | 582 | if((type_filter = regfi_type_str2val(argv[argi])) < 0) |
---|
[40] | 583 | { |
---|
| 584 | fprintf(stderr, "ERROR: Invalid type specified: %s.\n", argv[argi]); |
---|
[143] | 585 | bailOut(REGLOOKUP_EXIT_USAGE, ""); |
---|
[40] | 586 | } |
---|
[37] | 587 | type_filter_enabled = true; |
---|
| 588 | } |
---|
[47] | 589 | else if (strcmp("-h", argv[argi]) == 0) |
---|
| 590 | print_header = true; |
---|
| 591 | else if (strcmp("-H", argv[argi]) == 0) |
---|
| 592 | print_header = false; |
---|
[37] | 593 | else if (strcmp("-s", argv[argi]) == 0) |
---|
| 594 | print_security = true; |
---|
[44] | 595 | else if (strcmp("-S", argv[argi]) == 0) |
---|
| 596 | print_security = false; |
---|
[37] | 597 | else if (strcmp("-v", argv[argi]) == 0) |
---|
| 598 | print_verbose = true; |
---|
[44] | 599 | else |
---|
[37] | 600 | { |
---|
[38] | 601 | usage(); |
---|
[37] | 602 | fprintf(stderr, "ERROR: Unrecognized option: %s\n", argv[argi]); |
---|
[143] | 603 | bailOut(REGLOOKUP_EXIT_USAGE, ""); |
---|
[37] | 604 | } |
---|
| 605 | } |
---|
[44] | 606 | if((registry_file = strdup(argv[argi])) == NULL) |
---|
[143] | 607 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Memory allocation problem.\n"); |
---|
[30] | 608 | |
---|
[110] | 609 | f = regfi_open(registry_file); |
---|
[37] | 610 | if(f == NULL) |
---|
| 611 | { |
---|
| 612 | fprintf(stderr, "ERROR: Couldn't open registry file: %s\n", registry_file); |
---|
[143] | 613 | bailOut(REGLOOKUP_EXIT_NOINPUT, ""); |
---|
[37] | 614 | } |
---|
[38] | 615 | |
---|
[138] | 616 | if(print_verbose) |
---|
| 617 | regfi_set_message_mask(f, REGFI_MSG_INFO|REGFI_MSG_WARN|REGFI_MSG_ERROR); |
---|
| 618 | |
---|
[159] | 619 | /* XXX: add command line option to choose output encoding */ |
---|
| 620 | iter = regfi_iterator_new(f, 0); |
---|
[80] | 621 | if(iter == NULL) |
---|
[158] | 622 | { |
---|
| 623 | printMsgs(f); |
---|
[143] | 624 | bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Couldn't create registry iterator.\n"); |
---|
[158] | 625 | } |
---|
[30] | 626 | |
---|
[81] | 627 | if(print_header) |
---|
| 628 | { |
---|
| 629 | if(print_security) |
---|
[125] | 630 | printf("PATH,TYPE,VALUE,MTIME,OWNER,GROUP,SACL,DACL,CLASS\n"); |
---|
[81] | 631 | else |
---|
| 632 | printf("PATH,TYPE,VALUE,MTIME\n"); |
---|
| 633 | } |
---|
| 634 | |
---|
[80] | 635 | if(path_filter_enabled && path_filter != NULL) |
---|
| 636 | path = splitPath(path_filter); |
---|
[81] | 637 | |
---|
[80] | 638 | if(path != NULL) |
---|
[33] | 639 | { |
---|
[80] | 640 | retr_path_ret = retrievePath(iter, path); |
---|
[138] | 641 | printMsgs(iter->f); |
---|
[83] | 642 | freePath(path); |
---|
| 643 | |
---|
[80] | 644 | if(retr_path_ret == 0) |
---|
[141] | 645 | fprintf(stderr, "WARN: Specified path '%s' not found.\n", path_filter); |
---|
[80] | 646 | else if (retr_path_ret == 2) |
---|
[81] | 647 | printKeyTree(iter); |
---|
[93] | 648 | else if(retr_path_ret < 0) |
---|
| 649 | { |
---|
| 650 | fprintf(stderr, "ERROR: retrievePath() returned %d.\n", |
---|
| 651 | retr_path_ret); |
---|
[143] | 652 | bailOut(REGLOOKUP_EXIT_DATAERR, |
---|
| 653 | "ERROR: Unknown error occurred in retrieving path.\n"); |
---|
[93] | 654 | } |
---|
[33] | 655 | } |
---|
[37] | 656 | else |
---|
[81] | 657 | printKeyTree(iter); |
---|
[31] | 658 | |
---|
[80] | 659 | regfi_iterator_free(iter); |
---|
[78] | 660 | regfi_close(f); |
---|
[30] | 661 | |
---|
| 662 | return 0; |
---|
| 663 | } |
---|