1 /* $NetBSD: lpkg.c,v 1.2 2017/04/20 13:18:23 joerg Exp $ */ 2 3 /* 4 * Copyright (c) 1999 Christian E. Hopps 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. The name of the author may not be used to endorse or promote products 16 * derived from this software without specific prior written permission 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 * 29 * Package-list auxiliary functions 30 */ 31 32 #if HAVE_CONFIG_H 33 #include "config.h" 34 #endif 35 #include <nbcompat.h> 36 #if HAVE_ERR_H 37 #include <err.h> 38 #endif 39 #include "lib.h" 40 41 /* 42 * Add a package to the (add/recursive delete) list 43 */ 44 lpkg_t * 45 alloc_lpkg(const char *pkgname) 46 { 47 lpkg_t *lpp; 48 49 lpp = xmalloc(sizeof(*lpp)); 50 lpp->lp_name = xstrdup(pkgname); 51 return (lpp); 52 } 53 54 void 55 free_lpkg(lpkg_t *lpp) 56 { 57 free(lpp->lp_name); 58 free(lpp); 59 } 60 61 lpkg_t * 62 find_on_queue(lpkg_head_t *qp, const char *name) 63 { 64 lpkg_t *lpp; 65 66 for (lpp = TAILQ_FIRST(qp); lpp; lpp = TAILQ_NEXT(lpp, lp_link)) 67 if (!strcmp(name, lpp->lp_name)) 68 return (lpp); 69 return (0); 70 } 71