_tc_lookup_node.c

Go to the documentation of this file.

/*
** Copyright (C) 2004, 2005 by Kevin L. Mitchell <klmitch@mit.edu>
**
** 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; either version 2 of the License, or
** (at your option) any later version.
**
** 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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
**
** @(#)$Id: _tc_lookup_node.c,v 1.4 2005/06/07 04:53:50 klmitch Exp $
*/
#include <errno.h>
#include <stdlib.h>
#include <string.h>

#include "treeconf_int.h"

RCSTAG("@(#)$Id: _tc_lookup_node.c,v 1.4 2005/06/07 04:53:50 klmitch Exp $");

unsigned int
_tc_lookup_node(treeconf_ctx_t *ctx, const char *name, treeconf_node_t *node,
            struct result *res)
{
  unsigned int err;
  int i;

  /* break up the name into its components */
  if ((err = tc_break(&res->r_comps, &res->r_count, name, "./")))
    return err;

  /* Initialize result */
  res->r_startnew = 0;
  res->r_node = node;

  /* Now go through each component... */
  for (i = 0; i < res->r_count && (!i || node); i++) {
    if (node && (tn_type(node) & TC_NODETYPE_MASK) != TC_NODETYPE_NODE)
      return ENOENT; /* don't descend through a variable node */

    /* Walk through all the current node's children... */
    for (node = node ? node->tn_down : tx_config(ctx); node;
       node = node->tn_next) {
      if (strlen(tn_name(node)) != res->r_comps[i].ts_length ||
        strncmp(tn_name(node), res->r_comps[i].ts_string,
              res->r_comps[i].ts_length))
      continue; /* well, it's not that one... */

      res->r_startnew = i + 1; /* new nodes start at the next index */
      res->r_node = node; /* and this is the current node */
      break; /* break out of the inner loop */
    }
  }

  return 0;
}

---