source: trunk/test/lib-regfio.c @ 33

/*
 * A utility to test functionality of Gerald Carter''s regfio interface.
 *
 * Copyright (C) 2005 Timothy D. Morgan
 *
 * 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: lib-regfio.c 33 2005-07-17 19:03:02Z tim $
 */


#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <strings.h>
#include "../include/regfio.h"
#include "../include/void_stack.h"


void_stack* path2Stack(const char* s)
{
  void_stack* ret_val = void_stack_new(1024);
  char* cur = strdup(s);
  char* next = NULL;
  
  while((next = strrchr(cur, '/')) != NULL)
  {
    next[0] = '\0';
    if(strlen(next+1) > 0)
      void_stack_push(ret_val, next+1);
  }
  if(strlen(cur) > 0)
    void_stack_push(ret_val, cur);

  return ret_val;
}


char* stack2Path(void_stack* nk_stack)
{
  const REGF_NK_REC* cur;
  unsigned int buf_left = 127;
  unsigned int buf_len = buf_left+1;
  unsigned int name_len = 0;
  unsigned int 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] = '\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 = (unsigned int)(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)
{
  const char* str_type;
  
  str_type = type_val2str(vk->type);
  printf("%s/%s:%s=\n", prefix, vk->valuename, str_type);
}


void printValueList(REGF_NK_REC* nk, char* prefix)
{
  unsigned int i;
  
  for(i=0; i < nk->num_values; i++)
    printValue(&nk->values[i], prefix);
}

/* 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;
  char* val_path;

  if((cur = (REGF_NK_REC*)void_stack_cur(nk_stack)) != NULL)
  {
    cur->subkey_index = 0;
    path = stack2Path(nk_stack);
    
    if(strlen(path) > 0)
      printf("%s%s:KEY\n", prefix, path);
    printValueList(cur, 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);
          printf("%s:KEY\n", val_path);
          printValueList(sub, val_path);
          free(val_path);
          free(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;
  unsigned int i;
  unsigned short 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;
      }
    }

    if(!found_cur)
      return 0;
  }

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


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;
  char* path = "/ControlSet002/Services/Eventlog/";

  if(argc < 2)
  {
    printf("ERROR: Requires 1 argument.\n");
    return 1;
  }

  f = regfio_open( argv[1] );
  root = regfio_rootkey(f);

  nk_stack = void_stack_new(1024);
  if(void_stack_push(nk_stack, root))
  {
    path_stack = path2Stack(path);
    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)
        printf("WARNING: specified path not found.\n");
      else if(retr_path_ret != 0)
        printf("ERROR\n");
    }
  }
  void_stack_destroy(nk_stack);

  regfio_close(f);

  return 0;
}