Home | History | Annotate | Line # | Download | only in libpuffs
pnode.c revision 1.2 
      1 /*	$NetBSD: pnode.c,v 1.2 2007/01/11 01:01:55 pooka Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 2006 Antti Kantee.  All Rights Reserved.
      5  *
      6  * Redistribution and use in source and binary forms, with or without
      7  * modification, are permitted provided that the following conditions
      8  * are met:
      9  * 1. Redistributions of source code must retain the above copyright
     10  *    notice, this list of conditions and the following disclaimer.
     11  * 2. Redistributions in binary form must reproduce the above copyright
     12  *    notice, this list of conditions and the following disclaimer in the
     13  *    documentation and/or other materials provided with the distribution.
     14  * 3. The name of the company nor the name of the author may be used to
     15  *    endorse or promote products derived from this software without specific
     16  *    prior written permission.
     17  *
     18  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
     19  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
     20  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
     21  * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
     22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     24  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     25  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     28  * SUCH DAMAGE.
     29  */
     30 
     31 #include <sys/cdefs.h>
     32 #if !defined(lint)
     33 __RCSID("$NetBSD: pnode.c,v 1.2 2007/01/11 01:01:55 pooka Exp $");
     34 #endif /* !lint */
     35 
     36 #include <sys/types.h>
     37 
     38 #include <assert.h>
     39 #include <puffs.h>
     40 #include <stdlib.h>
     41 #include <stdio.h>
     42 #include <string.h>
     43 
     44 #include "puffs_priv.h"
     45 
     46 /*
     47  * Well, you're probably wondering why this isn't optimized.
     48  * The reason is simple: my available time is not optimized for
     49  * size ... so please be patient ;)
     50  */
     51 struct puffs_node *
     52 puffs_pn_new(struct puffs_usermount *pu, void *privdata)
     53 {
     54 	struct puffs_node *pn;
     55 
     56 	pn = calloc(1, sizeof(struct puffs_node));
     57 	if (pn == NULL)
     58 		return NULL;
     59 
     60 	pn->pn_mnt = pu;
     61 	pn->pn_data = privdata;
     62 	puffs_vattr_null(&pn->pn_va);
     63 
     64 	LIST_INSERT_HEAD(&pu->pu_pnodelst, pn, pn_entries);
     65 
     66 	return pn;
     67 }
     68 
     69 void
     70 puffs_pn_put(struct puffs_node *pn)
     71 {
     72 
     73 	if (pn == NULL)
     74 		return;
     75 
     76 	if (pn->pn_path) {
     77 		free(pn->pn_path);
     78 		pn->pn_path = (void *)0xdeadc0de;
     79 	}
     80 
     81 	LIST_REMOVE(pn, pn_entries);
     82 	free(pn);
     83 }
     84 
     85 /* walk list, rv can be used either to halt or to return a value */
     86 void *
     87 puffs_pn_nodewalk(struct puffs_usermount *pu,
     88 	void *(*fn)(struct puffs_node *, void *), void *arg)
     89 {
     90 	struct puffs_node *pn_cur, *pn_next;
     91 	void *rv;
     92 
     93 	pn_cur = LIST_FIRST(&pu->pu_pnodelst);
     94 	while (pn_cur) {
     95 		pn_next = LIST_NEXT(pn_cur, pn_entries);
     96 		rv = fn(pn_cur, arg);
     97 		if (rv)
     98 			return rv;
     99 		pn_cur = pn_next;
    100 	}
    101 
    102 	return NULL;
    103 }
    104