Current Path : /compat/linux/proc/self/root/usr/src/bin/sh/ |
FreeBSD hs32.drive.ne.jp 9.1-RELEASE FreeBSD 9.1-RELEASE #1: Wed Jan 14 12:18:08 JST 2015 root@hs32.drive.ne.jp:/sys/amd64/compile/hs32 amd64 |
Current File : //compat/linux/proc/self/root/usr/src/bin/sh/nodes.c.pat |
/*- * Copyright (c) 1991, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Kenneth Almquist. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)nodes.c.pat 8.2 (Berkeley) 5/4/95 * $FreeBSD: release/9.1.0/bin/sh/nodes.c.pat 213811 2010-10-13 22:18:03Z obrien $ */ #include <sys/param.h> #include <stdlib.h> #include <stddef.h> /* * Routine for dealing with parsed shell commands. */ #include "shell.h" #include "nodes.h" #include "memalloc.h" #include "mystring.h" static int funcblocksize; /* size of structures in function */ static int funcstringsize; /* size of strings in node */ static pointer funcblock; /* block to allocate function from */ static char *funcstring; /* block to allocate strings from */ %SIZES static void calcsize(union node *); static void sizenodelist(struct nodelist *); static union node *copynode(union node *); static struct nodelist *copynodelist(struct nodelist *); static char *nodesavestr(char *); struct funcdef { unsigned int refcount; union node n; }; /* * Make a copy of a parse tree. */ struct funcdef * copyfunc(union node *n) { struct funcdef *fn; if (n == NULL) return NULL; funcblocksize = offsetof(struct funcdef, n); funcstringsize = 0; calcsize(n); fn = ckmalloc(funcblocksize + funcstringsize); fn->refcount = 1; funcblock = (char *)fn + offsetof(struct funcdef, n); funcstring = (char *)fn + funcblocksize; copynode(n); return fn; } union node * getfuncnode(struct funcdef *fn) { return fn == NULL ? NULL : &fn->n; } static void calcsize(union node *n) { %CALCSIZE } static void sizenodelist(struct nodelist *lp) { while (lp) { funcblocksize += ALIGN(sizeof(struct nodelist)); calcsize(lp->n); lp = lp->next; } } static union node * copynode(union node *n) { union node *new; %COPY return new; } static struct nodelist * copynodelist(struct nodelist *lp) { struct nodelist *start; struct nodelist **lpp; lpp = &start; while (lp) { *lpp = funcblock; funcblock = (char *)funcblock + ALIGN(sizeof(struct nodelist)); (*lpp)->n = copynode(lp->n); lp = lp->next; lpp = &(*lpp)->next; } *lpp = NULL; return start; } static char * nodesavestr(char *s) { char *p = s; char *q = funcstring; char *rtn = funcstring; while ((*q++ = *p++) != '\0') continue; funcstring = q; return rtn; } void reffunc(struct funcdef *fn) { if (fn) fn->refcount++; } /* * Decrement the reference count of a function definition, freeing it * if it falls to 0. */ void unreffunc(struct funcdef *fn) { if (fn) { fn->refcount--; if (fn->refcount > 0) return; ckfree(fn); } }