source: trunk/src/reglookup.c @ 160

Last change on this file since 160 was 160, checked in by tim, 15 years ago

reorganized classname parsing and interpretation code

  • Property svn:keywords set to Id
File size: 16.6 KB
RevLine 
[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 160 2009-12-07 01:00:58Z 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 */
33bool print_verbose = false;
34bool print_security = false;
[42]35bool print_header = true;
[40]36bool path_filter_enabled = false;
37bool type_filter_enabled = false;
38char* path_filter = NULL;
39int type_filter;
40char* registry_file = NULL;
41
[42]42/* Other globals */
[135]43REGFI_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]52void 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]124char** 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]175void 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 */
190char* 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]260void 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]276void 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;
[42]284  char mtime[20];
285  time_t tmp_time[1];
286  struct tm* tmp_time_s = NULL;
[135]287  const REGFI_SK_REC* sk;
[137]288  const REGFI_NK_REC* k = regfi_iterator_cur_key(iter);
[160]289  REGFI_CLASSNAME* classname;
[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
[160]310    classname = regfi_iterator_fetch_classname(iter, k);
311    printMsgs(iter->f);
312    if(classname != NULL)
[126]313    {
[160]314      if(classname->interpreted == NULL)
[126]315      {
[160]316        fprintf(stderr, "WARN: Could not convert class name"
317                " charset for key '%s'.  Quoting raw...\n", full_path);
318        quoted_classname = quote_buffer(classname->raw, classname->size,
319                                        key_special_chars);
[126]320      }
[160]321      else
322        quoted_classname = quote_string(classname->interpreted, 
323                                        key_special_chars);
324
325      if(quoted_classname == NULL)
[126]326      {
[160]327        fprintf(stderr, "ERROR: Could not quote classname"
328                " for key '%s' due to unknown error.\n", full_path);
329        quoted_classname = empty_str;
[126]330      }
331    }
[125]332    else
333      quoted_classname = empty_str;
[160]334    regfi_free_classname(classname);
[43]335
[138]336    printMsgs(iter->f);
[125]337    printf("%s,KEY,,%s,%s,%s,%s,%s,%s\n", full_path, mtime, 
338           owner, group, sacl, dacl, quoted_classname);
339
[43]340    if(owner != empty_str)
341      free(owner);
342    if(group != empty_str)
343      free(group);
344    if(sacl != empty_str)
345      free(sacl);
346    if(dacl != empty_str)
347      free(dacl);
[125]348    if(quoted_classname != empty_str)
349      free(quoted_classname);
[43]350  }
351  else
[66]352    printf("%s,KEY,,%s\n", full_path, mtime);
[43]353}
354
355
[81]356void printKeyTree(REGFI_ITERATOR* iter)
[43]357{
[135]358  const REGFI_NK_REC* root = NULL;
359  const REGFI_NK_REC* cur = NULL;
[150]360  REGFI_NK_REC* sub = NULL;
[43]361  char* path = NULL;
[78]362  int key_type = regfi_type_str2val("KEY");
[81]363  bool print_this = true;
364
365  root = cur = regfi_iterator_cur_key(iter);
366  sub = regfi_iterator_first_subkey(iter);
[138]367  printMsgs(iter->f);
[137]368
[81]369  if(root == NULL)
[143]370    bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: root cannot be NULL.\n");
[81]371 
372  do
[31]373  {
[81]374    if(print_this)
[54]375    {
[81]376      path = iter2Path(iter);
377      if(path == NULL)
[143]378        bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Could not construct iterator's path.\n");
[137]379
[81]380      if(!type_filter_enabled || (key_type == type_filter))
[109]381        printKey(iter, path);
[81]382      if(!type_filter_enabled || (key_type != type_filter))
383        printValueList(iter, path);
384     
385      free(path);
[54]386    }
[66]387   
[81]388    if(sub == NULL)
[31]389    {
[81]390      if(cur != root)
[31]391      {
[81]392        /* We're done with this sub-tree, going up and hitting other branches. */
393        if(!regfi_iterator_up(iter))
[137]394        {
[138]395          printMsgs(iter->f);
[143]396          bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: could not traverse iterator upward.\n");
[137]397        }
398
[81]399        cur = regfi_iterator_cur_key(iter);
400        if(cur == NULL)
[137]401        {
[138]402          printMsgs(iter->f);
[143]403          bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: unexpected NULL for key.\n");
[137]404        }
[150]405       
[81]406        sub = regfi_iterator_next_subkey(iter);
[66]407      }
[81]408      print_this = false;
[31]409    }
[81]410    else
411    { /* We have unexplored sub-keys. 
412       * Let's move down and print this first sub-tree out.
413       */
414      if(!regfi_iterator_down(iter))
[137]415      {
[138]416        printMsgs(iter->f);
[143]417        bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: could not traverse iterator downward.\n");
[137]418      }
[81]419
[150]420      cur = regfi_iterator_cur_key(iter);
421      regfi_free_key(sub);
[81]422      sub = regfi_iterator_first_subkey(iter);
423      print_this = true;
424    }
[138]425    printMsgs(iter->f);
[81]426  } while(!((cur == root) && (sub == NULL)));
427
[54]428  if(print_verbose)
[138]429    fprintf(stderr, "INFO: Finished printing key tree.\n");
[30]430}
431
[81]432
[140]433/* XXX: What if there is BOTH a value AND a key with that name??
434 *      What if there are multiple keys/values with the same name??
435 */
[33]436/*
[80]437 * Returns 0 if path was not found.
438 * Returns 1 if path was found as value.
439 * Returns 2 if path was found as key.
[33]440 * Returns less than 0 on other error.
441 */
[80]442int retrievePath(REGFI_ITERATOR* iter, char** path)
[33]443{
[150]444  REGFI_VK_REC* value;
[81]445  char* tmp_path_joined;
446  const char** tmp_path;
[80]447  uint32 i;
448 
449  if(path == NULL)
[33]450    return -1;
451
[80]452  /* One extra for any value at the end, and one more for NULL */
[135]453  tmp_path = (const char**)malloc(sizeof(const char**)*(REGFI_MAX_DEPTH+1+1));
[80]454  if(tmp_path == NULL)
[33]455    return -2;
456
[80]457  /* Strip any potential value name at end of path */
458  for(i=0; 
[136]459      (path[i] != NULL) && (path[i+1] != NULL) && (i < REGFI_MAX_DEPTH+1);
[80]460      i++)
[136]461  { tmp_path[i] = path[i]; }
[80]462  tmp_path[i] = NULL;
463
[54]464  if(print_verbose)
[138]465    fprintf(stderr, "INFO: Attempting to retrieve specified path: %s\n",
[54]466            path_filter);
467
[82]468  /* Special check for '/' path filter */
469  if(path[0] == NULL)
470  {
471    if(print_verbose)
[138]472      fprintf(stderr, "INFO: Found final path element as root key.\n");
[136]473    free(tmp_path);
[82]474    return 2;
475  }
476
[80]477  if(!regfi_iterator_walk_path(iter, tmp_path))
[33]478  {
[138]479    printMsgs(iter->f);
[80]480    free(tmp_path);
481    return 0;
[33]482  }
483
[80]484  if(regfi_iterator_find_value(iter, path[i]))
485  {
486    if(print_verbose)
[138]487      fprintf(stderr, "INFO: Found final path element as value.\n");
[33]488
[80]489    value = regfi_iterator_cur_value(iter);
[138]490    printMsgs(iter->f);
[81]491    tmp_path_joined = iter2Path(iter);
[54]492
[80]493    if((value == NULL) || (tmp_path_joined == NULL))
[143]494      bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Unexpected error before printValue.\n");
[54]495
[121]496    if(!type_filter_enabled || (value->type == type_filter))
[159]497      printValue(iter, value, tmp_path_joined);
[54]498
[150]499    regfi_free_value(value);
[80]500    free(tmp_path);
501    free(tmp_path_joined);
502    return 1;
[33]503  }
[80]504  else if(regfi_iterator_find_subkey(iter, path[i]))
[33]505  {
[138]506    printMsgs(iter->f);
[80]507    if(print_verbose)
[138]508      fprintf(stderr, "INFO: Found final path element as key.\n");
[82]509
510    if(!regfi_iterator_down(iter))
[137]511    {
[138]512      printMsgs(iter->f);
[143]513      bailOut(REGLOOKUP_EXIT_DATAERR, "ERROR: Unexpected error on traversing path filter key.\n");
[137]514    }
[82]515
[80]516    return 2;
[33]517  }
[138]518  printMsgs(iter->f);
[33]519
[54]520  if(print_verbose)
[138]521    fprintf(stderr, "INFO: Could not find last element of path.\n");
[54]522
[80]523  return 0;
[33]524}
525
526
[37]527static void usage(void)
528{
[61]529  fprintf(stderr, "Usage: reglookup [-v] [-s]"
[40]530          " [-p <PATH_FILTER>] [-t <TYPE_FILTER>]"
[39]531          " <REGISTRY_FILE>\n");
[111]532  fprintf(stderr, "Version: %s\n", REGLOOKUP_VERSION);
[39]533  fprintf(stderr, "Options:\n");
534  fprintf(stderr, "\t-v\t sets verbose mode.\n");
[47]535  fprintf(stderr, "\t-h\t enables header row. (default)\n");
536  fprintf(stderr, "\t-H\t disables header row.\n");
[44]537  fprintf(stderr, "\t-s\t enables security descriptor output.\n");
538  fprintf(stderr, "\t-S\t disables security descriptor output. (default)\n");
[40]539  fprintf(stderr, "\t-p\t restrict output to elements below this path.\n");
540  fprintf(stderr, "\t-t\t restrict results to this specific data type.\n");
[37]541  fprintf(stderr, "\n");
542}
543
544
[30]545int main(int argc, char** argv)
546{
[80]547  char** path = NULL;
548  REGFI_ITERATOR* iter;
[33]549  int retr_path_ret;
[44]550  uint32 argi, arge;
[31]551
[37]552  /* Process command line arguments */
[30]553  if(argc < 2)
554  {
[37]555    usage();
[143]556    bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: Requires at least one argument.\n");
[30]557  }
[37]558 
[44]559  arge = argc-1;
560  for(argi = 1; argi < arge; argi++)
[37]561  {
[40]562    if (strcmp("-p", argv[argi]) == 0)
[37]563    {
[44]564      if(++argi >= arge)
[37]565      {
566        usage();
[143]567        bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: '-p' option requires parameter.\n");
[37]568      }
[40]569      if((path_filter = strdup(argv[argi])) == NULL)
[143]570        bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Memory allocation problem.\n");
[38]571
[40]572      path_filter_enabled = true;
[37]573    }
574    else if (strcmp("-t", argv[argi]) == 0)
575    {
[44]576      if(++argi >= arge)
[37]577      {
578        usage();
[143]579        bailOut(REGLOOKUP_EXIT_USAGE, "ERROR: '-t' option requires parameter.\n");
[37]580      }
[78]581      if((type_filter = regfi_type_str2val(argv[argi])) < 0)
[40]582      {
583        fprintf(stderr, "ERROR: Invalid type specified: %s.\n", argv[argi]);
[143]584        bailOut(REGLOOKUP_EXIT_USAGE, "");
[40]585      }
[37]586      type_filter_enabled = true;
587    }
[47]588    else if (strcmp("-h", argv[argi]) == 0)
589      print_header = true;
590    else if (strcmp("-H", argv[argi]) == 0)
591      print_header = false;
[37]592    else if (strcmp("-s", argv[argi]) == 0)
593      print_security = true;
[44]594    else if (strcmp("-S", argv[argi]) == 0)
595      print_security = false;
[37]596    else if (strcmp("-v", argv[argi]) == 0)
597      print_verbose = true;
[44]598    else
[37]599    {
[38]600      usage();
[37]601      fprintf(stderr, "ERROR: Unrecognized option: %s\n", argv[argi]);
[143]602      bailOut(REGLOOKUP_EXIT_USAGE, "");
[37]603    }
604  }
[44]605  if((registry_file = strdup(argv[argi])) == NULL)
[143]606    bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Memory allocation problem.\n");
[30]607
[110]608  f = regfi_open(registry_file);
[37]609  if(f == NULL)
610  {
611    fprintf(stderr, "ERROR: Couldn't open registry file: %s\n", registry_file);
[143]612    bailOut(REGLOOKUP_EXIT_NOINPUT, "");
[37]613  }
[38]614
[138]615  if(print_verbose)
616    regfi_set_message_mask(f, REGFI_MSG_INFO|REGFI_MSG_WARN|REGFI_MSG_ERROR);
617
[159]618  /* XXX: add command line option to choose output encoding */
619  iter = regfi_iterator_new(f, 0);
[80]620  if(iter == NULL)
[158]621  {
622    printMsgs(f);
[143]623    bailOut(REGLOOKUP_EXIT_OSERR, "ERROR: Couldn't create registry iterator.\n");
[158]624  }
[30]625
[81]626  if(print_header)
627  {
628    if(print_security)
[125]629      printf("PATH,TYPE,VALUE,MTIME,OWNER,GROUP,SACL,DACL,CLASS\n");
[81]630    else
631      printf("PATH,TYPE,VALUE,MTIME\n");
632  }
633
[80]634  if(path_filter_enabled && path_filter != NULL)
635    path = splitPath(path_filter);
[81]636
[80]637  if(path != NULL)
[33]638  {
[80]639    retr_path_ret = retrievePath(iter, path);
[138]640    printMsgs(iter->f);
[83]641    freePath(path);
642
[80]643    if(retr_path_ret == 0)
[141]644      fprintf(stderr, "WARN: Specified path '%s' not found.\n", path_filter);
[80]645    else if (retr_path_ret == 2)
[81]646      printKeyTree(iter);
[93]647    else if(retr_path_ret < 0)
648    {
649      fprintf(stderr, "ERROR: retrievePath() returned %d.\n", 
650              retr_path_ret);
[143]651      bailOut(REGLOOKUP_EXIT_DATAERR,
652              "ERROR: Unknown error occurred in retrieving path.\n");
[93]653    }
[33]654  }
[37]655  else
[81]656    printKeyTree(iter);
[31]657
[80]658  regfi_iterator_free(iter);
[78]659  regfi_close(f);
[30]660
661  return 0;
662}
Note: See TracBrowser for help on using the repository browser.