/* * A utility to read a Windows NT/2K/XP/2K3 registry file, using * Gerald Carter''s regfio interface. * * Copyright (C) 2005 Timothy D. Morgan * Copyright (C) 2002 Richard Sharpe, rsharpe@richardsharpe.com * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; version 2 of the License. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * * $Id: reglookup.c 44 2005-08-06 13:47:07Z tim $ */ #include #include #include #include #include #include "../include/regfio.h" #include "../include/void_stack.h" /* Globals, influenced by command line parameters */ bool print_verbose = false; bool print_security = false; bool print_header = true; bool path_filter_enabled = false; bool type_filter_enabled = false; char* path_filter = NULL; int type_filter; char* registry_file = NULL; /* Other globals */ const char* special_chars = ",\"\\"; void bailOut(int code, char* message) { fprintf(stderr, message); exit(code); } /* Returns a newly malloc()ed string which contains original buffer, * except for non-printable or special characters are quoted in hex * with the syntax '\xQQ' where QQ is the hex ascii value of the quoted * character. A null terminator is added, as only ascii, not binary, * is returned. */ static char* quote_buffer(const unsigned char* str, unsigned int len, const char* special) { unsigned int i; unsigned int num_written=0; unsigned int out_len = sizeof(char)*len+1; char* ret_val = malloc(out_len); if(ret_val == NULL) return NULL; for(i=0; i 126 || strchr(special, str[i]) != NULL) { out_len += 3; /* XXX: may not be the most efficient way of getting enough memory. */ ret_val = realloc(ret_val, out_len); if(ret_val == NULL) break; num_written += snprintf(ret_val+num_written, (out_len)-num_written, "\\x%.2X", str[i]); } else ret_val[num_written++] = str[i]; } ret_val[num_written] = '\0'; return ret_val; } /* Returns a newly malloc()ed string which contains original string, * except for non-printable or special characters are quoted in hex * with the syntax '\xQQ' where QQ is the hex ascii value of the quoted * character. */ static char* quote_string(const char* str, const char* special) { unsigned int len; if(str == NULL) return NULL; len = strlen(str); return quote_buffer((const unsigned char*)str, len, special); } /* * Convert from UniCode to Ascii ... Does not take into account other lang * Restrict by ascii_max if > 0 */ static int uni_to_ascii(unsigned char *uni, unsigned char *ascii, int ascii_max, int uni_max) { int i = 0; while (i < ascii_max && (uni[i*2] || uni[i*2+1])) { if (uni_max > 0 && (i*2) >= uni_max) break; ascii[i] = uni[i*2]; i++; } ascii[i] = '\0'; return i; } /* * Convert a data value to a string for display */ static unsigned char* data_to_ascii(unsigned char *datap, int len, int type) { unsigned char *asciip; unsigned int i; unsigned short num_nulls; unsigned char* ascii; unsigned char* cur_str; unsigned char* cur_ascii; char* cur_quoted; unsigned int cur_str_len; unsigned int ascii_max, cur_str_max; unsigned int str_rem, cur_str_rem, alen; switch (type) { case REG_SZ: if (print_verbose) fprintf(stderr, "Len: %d\n", len); ascii_max = sizeof(char)*len; ascii = malloc(ascii_max+4); if(ascii == NULL) return NULL; /* XXX: This has to be fixed. It has to be UNICODE */ uni_to_ascii(datap, ascii, len, ascii_max); cur_quoted = quote_string((char*)ascii, special_chars); free(ascii); return (unsigned char*)cur_quoted; break; case REG_EXPAND_SZ: ascii_max = sizeof(char)*len; ascii = malloc(ascii_max+2); if(ascii == NULL) return NULL; uni_to_ascii(datap, ascii, len, ascii_max); cur_quoted = quote_string((char*)ascii, special_chars); free(ascii); return (unsigned char*)cur_quoted; break; case REG_DWORD: ascii_max = sizeof(char)*10; ascii = malloc(ascii_max+1); if(ascii == NULL) return NULL; if (*(int *)datap == 0) snprintf((char*)ascii, ascii_max, "0"); else snprintf((char*)ascii, ascii_max, "0x%x", *(int *)datap); return ascii; break; /* XXX: this MULTI_SZ parser is pretty inefficient. Should be * redone with fewer malloc and better string concatenation. */ case REG_MULTI_SZ: ascii_max = sizeof(char)*len*4; cur_str_max = sizeof(char)*len+1; cur_str = malloc(cur_str_max); cur_ascii = malloc(cur_str_max); ascii = malloc(ascii_max+4); if(ascii == NULL || cur_str == NULL || cur_ascii == NULL) return NULL; /* Reads until it reaches 4 consecutive NULLs, * which is two nulls in unicode, or until it reaches len, or until we * run out of buffer. The latter should never happen, but we shouldn't * trust our file to have the right lengths/delimiters. */ asciip = ascii; num_nulls = 0; str_rem = ascii_max; cur_str_rem = cur_str_max; cur_str_len = 0; for(i=0; (i < len) && str_rem > 0; i++) { *(cur_str+cur_str_len) = *(datap+i); if(*(cur_str+cur_str_len) == 0) num_nulls++; else num_nulls = 0; cur_str_len++; if(num_nulls == 2) { uni_to_ascii(cur_str, cur_ascii, cur_str_max, 0); cur_quoted = quote_string((char*)cur_ascii, ",|\"\\"); alen = snprintf((char*)asciip, str_rem, "%s", cur_quoted); asciip += alen; str_rem -= alen; free(cur_quoted); if(*(datap+i+1) == 0 && *(datap+i+2) == 0) break; else { alen = snprintf((char*)asciip, str_rem, "%c", '|'); asciip += alen; str_rem -= alen; memset(cur_str, 0, cur_str_max); cur_str_len = 0; num_nulls = 0; /* To eliminate leading nulls in subsequent strings. */ i++; } } } *asciip = 0; free(cur_str); free(cur_ascii); return ascii; break; /* XXX: Dont know what to do with these yet, just print as binary... */ case REG_RESOURCE_LIST: case REG_FULL_RESOURCE_DESCRIPTOR: case REG_RESOURCE_REQUIREMENTS_LIST: case REG_BINARY: return (unsigned char*)quote_buffer(datap, len, special_chars); break; default: return NULL; break; } return NULL; } /* Security descriptor print functions */ /* XXX: these functions should be moved out into regfio library */ const char* ace_type2str(uint8 type) { static const char* map[7] = {"ALLOW", "DENY", "AUDIT", "ALARM", "ALLOW CPD", "OBJ ALLOW", "OBJ DENY"}; if(type < 7) return map[type]; else return "UNKNOWN"; } char* ace_flags2str(uint8 flags) { char* flg_output = malloc(21*sizeof(char)); int some = 0; if(flg_output == NULL) return NULL; flg_output[0] = '\0'; if (!flags) return flg_output; if (flags & 0x01) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "OI"); } if (flags & 0x02) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "CI"); } if (flags & 0x04) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "NP"); } if (flags & 0x08) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "IO"); } if (flags & 0x10) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "IA"); } if (flags == 0xF) { if (some) strcat(flg_output, " "); some = 1; strcat(flg_output, "VI"); } return flg_output; } char* ace_perms2str(uint32 perms) { char* ret_val = malloc(9*sizeof(char)); sprintf(ret_val, "%.8X", perms); return ret_val; } char* sid2str(DOM_SID* sid) { uint32 i, size = MAXSUBAUTHS*11 + 24; uint32 left = size; uint8 comps = sid->num_auths; char* ret_val = malloc(size); if(ret_val == NULL) return NULL; if(comps > MAXSUBAUTHS) comps = MAXSUBAUTHS; left -= sprintf(ret_val, "S-%u-%u", sid->sid_rev_num, sid->id_auth[5]); for (i = 0; i < comps; i++) left -= snprintf(ret_val+(size-left), left, "-%u", sid->sub_auths[i]); return ret_val; } char* get_acl(SEC_ACL* acl) { uint32 i, extra, size = 0; const char* type_str; char* flags_str; char* perms_str; char* sid_str; char* ret_val = NULL; char* ace_delim = ""; char field_delim = ':'; printf("acl: %.8X\n", (uint32)acl); for (i = 0; i < acl->num_aces; i++) { /* XXX: check for NULL */ sid_str = sid2str(&acl->ace[i].trustee); type_str = ace_type2str(acl->ace[i].type); perms_str = ace_perms2str(acl->ace[i].info.mask); flags_str = ace_flags2str(acl->ace[i].flags); /* XXX: this is slow */ extra = strlen(sid_str) + strlen(type_str) + strlen(perms_str) + strlen(flags_str)+5; ret_val = realloc(ret_val, size+extra); if(ret_val == NULL) return NULL; size += snprintf(ret_val+size, extra, "%s%s%c%s%c%s%c%s", ace_delim,sid_str, field_delim,type_str, field_delim,perms_str, field_delim,flags_str); ace_delim = "|"; free(sid_str); free(perms_str); free(flags_str); } return ret_val; } char* get_sacl(SEC_DESC *sec_desc) { if (sec_desc->sacl) return get_acl(sec_desc->sacl); else return NULL; } char* get_dacl(SEC_DESC *sec_desc) { if (sec_desc->dacl) return get_acl(sec_desc->dacl); else return NULL; } char* get_owner(SEC_DESC *sec_desc) { return sid2str(sec_desc->owner_sid); } char* get_group(SEC_DESC *sec_desc) { return sid2str(sec_desc->grp_sid); } void_stack* path2Stack(const char* s) { void_stack* ret_val; void_stack* rev_ret = void_stack_new(1024); const char* cur = s; char* next = NULL; char* copy; if (rev_ret == NULL) return NULL; if (s == NULL) return rev_ret; while((next = strchr(cur, '/')) != NULL) { if ((next-cur) > 0) { copy = (char*)malloc((next-cur+1)*sizeof(char)); if(copy == NULL) bailOut(2, "ERROR: Memory allocation problem.\n"); memcpy(copy, cur, next-cur); copy[next-cur] = '\0'; void_stack_push(rev_ret, copy); } cur = next+1; } if(strlen(cur) > 0) { copy = strdup(cur); void_stack_push(rev_ret, copy); } ret_val = void_stack_copy_reverse(rev_ret); void_stack_destroy(rev_ret); return ret_val; } char* stack2Path(void_stack* nk_stack) { const REGF_NK_REC* cur; uint32 buf_left = 127; uint32 buf_len = buf_left+1; uint32 name_len = 0; uint32 grow_amt; char* buf; char* new_buf; void_stack_iterator* iter; buf = (char*)malloc((buf_len)*sizeof(char)); if (buf == NULL) return NULL; buf[0] = '/'; buf[1] = '\0'; iter = void_stack_iterator_new(nk_stack); if (iter == NULL) { free(buf); return NULL; } /* skip root element */ cur = void_stack_iterator_next(iter); while((cur = void_stack_iterator_next(iter)) != NULL) { buf[buf_len-buf_left-1] = '/'; buf_left -= 1; name_len = strlen(cur->keyname); if(name_len+1 > buf_left) { grow_amt = (uint32)(buf_len/2); buf_len += name_len+1+grow_amt-buf_left; if((new_buf = realloc(buf, buf_len)) == NULL) { free(buf); free(iter); return NULL; } buf = new_buf; buf_left = grow_amt + name_len + 1; } strncpy(buf+(buf_len-buf_left-1), cur->keyname, name_len); buf_left -= name_len; buf[buf_len-buf_left-1] = '\0'; } return buf; } void printValue(REGF_VK_REC* vk, char* prefix) { uint32 size; uint8 tmp_buf[4]; unsigned char* quoted_value; char* quoted_prefix; char* quoted_name; /* Thanks Microsoft for making this process so straight-forward!!! */ size = (vk->data_size & ~VK_DATA_IN_OFFSET); if(vk->data_size & VK_DATA_IN_OFFSET) { tmp_buf[0] = (uint8)((vk->data_off >> 3) & 0xFF); tmp_buf[1] = (uint8)((vk->data_off >> 2) & 0xFF); tmp_buf[2] = (uint8)((vk->data_off >> 1) & 0xFF); tmp_buf[3] = (uint8)(vk->data_off & 0xFF); if(size > 4) size = 4; quoted_value = data_to_ascii(tmp_buf, 4, vk->type); } else { /* XXX: This is a safety hack. No data fields have yet been found * larger, but length limits are probably better got from fields * in the registry itself, within reason. */ if(size > 16384) { fprintf(stderr, "WARNING: key size %d larger than " "16384, truncating...\n", size); size = 16384; } quoted_value = data_to_ascii(vk->data, vk->data_size, vk->type); } /* XXX: Sometimes value names can be NULL in registry. Need to * figure out why and when, and generate the appropriate output * for that condition. */ quoted_prefix = quote_string(prefix, special_chars); quoted_name = quote_string(vk->valuename, special_chars); if(print_security) printf("%s/%s,%s,%s,,,,,\n", quoted_prefix, quoted_name, regfio_type_val2str(vk->type), quoted_value); else printf("%s/%s,%s,%s,\n", quoted_prefix, quoted_name, regfio_type_val2str(vk->type), quoted_value); if(quoted_value != NULL) free(quoted_value); if(quoted_prefix != NULL) free(quoted_prefix); if(quoted_name != NULL) free(quoted_name); } void printValueList(REGF_NK_REC* nk, char* prefix) { uint32 i; for(i=0; i < nk->num_values; i++) if(!type_filter_enabled || (nk->values[i].type == type_filter)) printValue(&nk->values[i], prefix); } void printKey(REGF_NK_REC* k, char* full_path) { static char empty_str[1] = ""; char* owner = NULL; char* group = NULL; char* sacl = NULL; char* dacl = NULL; char mtime[20]; time_t tmp_time[1]; struct tm* tmp_time_s = NULL; *tmp_time = nt_time_to_unix(&k->mtime); tmp_time_s = gmtime(tmp_time); strftime(mtime, sizeof(mtime), "%Y-%m-%d %H:%M:%S", tmp_time_s); if(print_security) { owner = get_owner(k->sec_desc->sec_desc); group = get_group(k->sec_desc->sec_desc); sacl = get_sacl(k->sec_desc->sec_desc); dacl = get_dacl(k->sec_desc->sec_desc); if(owner == NULL) owner = empty_str; if(group == NULL) group = empty_str; if(sacl == NULL) sacl = empty_str; if(dacl == NULL) dacl = empty_str; printf("%s,KEY,,%s,%s,%s,%s,%s\n", full_path, mtime, owner, group, sacl, dacl); if(owner != empty_str) free(owner); if(group != empty_str) free(group); if(sacl != empty_str) free(sacl); if(dacl != empty_str) free(dacl); } else printf("%s,KEY,,%s\n", full_path, mtime); } /* XXX: this function is god-awful. Needs to be re-designed. */ void printKeyTree(REGF_FILE* f, void_stack* nk_stack, char* prefix) { REGF_NK_REC* cur; REGF_NK_REC* sub; char* path = NULL; char* val_path = NULL; int key_type = regfio_type_str2val("KEY"); if((cur = (REGF_NK_REC*)void_stack_cur(nk_stack)) != NULL) { cur->subkey_index = 0; path = stack2Path(nk_stack); val_path = (char*)malloc(strlen(prefix)+strlen(path)+1); sprintf(val_path, "%s%s", prefix, path); if(!type_filter_enabled || (key_type == type_filter)) printKey(cur, val_path); if(!type_filter_enabled || (key_type != type_filter)) printValueList(cur, val_path); if(val_path != NULL) free(val_path); while((cur = (REGF_NK_REC*)void_stack_cur(nk_stack)) != NULL) { if((sub = regfio_fetch_subkey(f, cur)) != NULL) { sub->subkey_index = 0; void_stack_push(nk_stack, sub); path = stack2Path(nk_stack); if(path != NULL) { val_path = (char*)malloc(strlen(prefix)+strlen(path)+1); sprintf(val_path, "%s%s", prefix, path); if(!type_filter_enabled || (key_type == type_filter)) printKey(sub, val_path); if(!type_filter_enabled || (key_type != type_filter)) printValueList(sub, val_path); if(val_path != NULL) free(val_path); } } else { cur = void_stack_pop(nk_stack); /* XXX: This is just a shallow free. Need to write deep free * routines to replace the Samba code for this. */ if(cur != NULL) free(cur); } } } } /* * Returns 0 if path was found. * Returns 1 if path was not found. * Returns less than 0 on other error. */ int retrievePath(REGF_FILE* f, void_stack* nk_stack, void_stack* path_stack) { REGF_NK_REC* sub; REGF_NK_REC* cur; void_stack* sub_nk_stack; char* prefix; char* cur_str = NULL; bool found_cur = true; uint32 i; uint16 path_depth; if(path_stack == NULL) return -1; path_depth = void_stack_size(path_stack); if(path_depth < 1) return -2; if(void_stack_size(nk_stack) < 1) return -3; cur = (REGF_NK_REC*)void_stack_cur(nk_stack); while(void_stack_size(path_stack) > 1) { /* Search key records only */ cur_str = (char*)void_stack_pop(path_stack); found_cur = false; while(!found_cur && (sub = regfio_fetch_subkey(f, cur)) != NULL) { if(strcasecmp(sub->keyname, cur_str) == 0) { cur = sub; void_stack_push(nk_stack, sub); found_cur = true; } } free(cur_str); if(!found_cur) return 1; } /* Last round, search value and key records */ cur_str = (char*)void_stack_pop(path_stack); for(i=0; (i < cur->num_values); i++) { if(strcasecmp(sub->values[i].valuename, cur_str) == 0) { /* XXX: fix mem leak with stack2Path return value */ printValue(&sub->values[i], stack2Path(nk_stack)); return 0; } } while((sub = regfio_fetch_subkey(f, cur)) != NULL) { if(strcasecmp(sub->keyname, cur_str) == 0) { sub_nk_stack = void_stack_new(1024); void_stack_push(sub_nk_stack, sub); void_stack_push(nk_stack, sub); prefix = stack2Path(nk_stack); printKeyTree(f, sub_nk_stack, prefix); return 0; } } return 1; } static void usage(void) { fprintf(stderr, "Usage: readreg [-v] [-s]" " [-p ] [-t ]" " \n"); /* XXX: replace version string with Subversion property? */ fprintf(stderr, "Version: 0.2\n"); fprintf(stderr, "Options:\n"); fprintf(stderr, "\t-v\t sets verbose mode.\n"); fprintf(stderr, "\t-s\t enables security descriptor output.\n"); fprintf(stderr, "\t-S\t disables security descriptor output. (default)\n"); fprintf(stderr, "\t-p\t restrict output to elements below this path.\n"); fprintf(stderr, "\t-t\t restrict results to this specific data type.\n"); fprintf(stderr, "\n"); } int main(int argc, char** argv) { void_stack* nk_stack; void_stack* path_stack; REGF_FILE* f; REGF_NK_REC* root; int retr_path_ret; uint32 argi, arge; /* Process command line arguments */ if(argc < 2) { usage(); bailOut(1, "ERROR: Requires at least one argument.\n"); } arge = argc-1; for(argi = 1; argi < arge; argi++) { if (strcmp("-p", argv[argi]) == 0) { if(++argi >= arge) { usage(); bailOut(1, "ERROR: '-p' option requires parameter.\n"); } if((path_filter = strdup(argv[argi])) == NULL) bailOut(2, "ERROR: Memory allocation problem.\n"); path_filter_enabled = true; } else if (strcmp("-t", argv[argi]) == 0) { if(++argi >= arge) { usage(); bailOut(1, "ERROR: '-t' option requires parameter.\n"); } if((type_filter = regfio_type_str2val(argv[argi])) == 0) { fprintf(stderr, "ERROR: Invalid type specified: %s.\n", argv[argi]); bailOut(1, ""); } type_filter_enabled = true; } else if (strcmp("-s", argv[argi]) == 0) print_security = true; else if (strcmp("-S", argv[argi]) == 0) print_security = false; else if (strcmp("-v", argv[argi]) == 0) print_verbose = true; else { usage(); fprintf(stderr, "ERROR: Unrecognized option: %s\n", argv[argi]); bailOut(1, ""); } } if((registry_file = strdup(argv[argi])) == NULL) bailOut(2, "ERROR: Memory allocation problem.\n"); f = regfio_open(registry_file); if(f == NULL) { fprintf(stderr, "ERROR: Couldn't open registry file: %s\n", registry_file); bailOut(3, ""); } root = regfio_rootkey(f); nk_stack = void_stack_new(1024); if(void_stack_push(nk_stack, root)) { if(print_header) { if(print_security) printf("PATH,TYPE,VALUE,MTIME,OWNER,GROUP,SACL,DACL\n"); else printf("PATH,TYPE,VALUE,MTIME\n"); } path_stack = path2Stack(path_filter); if(void_stack_size(path_stack) < 1) printKeyTree(f, nk_stack, ""); else { retr_path_ret = retrievePath(f, nk_stack, path_stack); if(retr_path_ret == 1) fprintf(stderr, "WARNING: specified path not found.\n"); else if(retr_path_ret != 0) bailOut(4, "ERROR:\n"); } } else bailOut(2, "ERROR: Memory allocation problem.\n"); void_stack_destroy_deep(nk_stack); regfio_close(f); return 0; }