1*0Sstevel@tonic-gate /* 2*0Sstevel@tonic-gate * CDDL HEADER START 3*0Sstevel@tonic-gate * 4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the 5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only 6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance 7*0Sstevel@tonic-gate * with the License. 8*0Sstevel@tonic-gate * 9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing. 11*0Sstevel@tonic-gate * See the License for the specific language governing permissions 12*0Sstevel@tonic-gate * and limitations under the License. 13*0Sstevel@tonic-gate * 14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each 15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the 17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying 18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner] 19*0Sstevel@tonic-gate * 20*0Sstevel@tonic-gate * CDDL HEADER END 21*0Sstevel@tonic-gate */ 22*0Sstevel@tonic-gate /* 23*0Sstevel@tonic-gate * Copyright 2005 Sun Microsystems, Inc. All rights reserved. 24*0Sstevel@tonic-gate * Use is subject to license terms. 25*0Sstevel@tonic-gate */ 26*0Sstevel@tonic-gate 27*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI" 28*0Sstevel@tonic-gate 29*0Sstevel@tonic-gate #include <ctf_impl.h> 30*0Sstevel@tonic-gate 31*0Sstevel@tonic-gate /* 32*0Sstevel@tonic-gate * Simple doubly-linked list append routine. This implementation assumes that 33*0Sstevel@tonic-gate * each list element contains an embedded ctf_list_t as the first member. 34*0Sstevel@tonic-gate * An additional ctf_list_t is used to store the head (l_next) and tail 35*0Sstevel@tonic-gate * (l_prev) pointers. The current head and tail list elements have their 36*0Sstevel@tonic-gate * previous and next pointers set to NULL, respectively. 37*0Sstevel@tonic-gate */ 38*0Sstevel@tonic-gate void 39*0Sstevel@tonic-gate ctf_list_append(ctf_list_t *lp, void *new) 40*0Sstevel@tonic-gate { 41*0Sstevel@tonic-gate ctf_list_t *p = lp->l_prev; /* p = tail list element */ 42*0Sstevel@tonic-gate ctf_list_t *q = new; /* q = new list element */ 43*0Sstevel@tonic-gate 44*0Sstevel@tonic-gate lp->l_prev = q; 45*0Sstevel@tonic-gate q->l_prev = p; 46*0Sstevel@tonic-gate q->l_next = NULL; 47*0Sstevel@tonic-gate 48*0Sstevel@tonic-gate if (p != NULL) 49*0Sstevel@tonic-gate p->l_next = q; 50*0Sstevel@tonic-gate else 51*0Sstevel@tonic-gate lp->l_next = q; 52*0Sstevel@tonic-gate } 53*0Sstevel@tonic-gate 54*0Sstevel@tonic-gate /* 55*0Sstevel@tonic-gate * Prepend the specified existing element to the given ctf_list_t. The 56*0Sstevel@tonic-gate * existing pointer should be pointing at a struct with embedded ctf_list_t. 57*0Sstevel@tonic-gate */ 58*0Sstevel@tonic-gate void 59*0Sstevel@tonic-gate ctf_list_prepend(ctf_list_t *lp, void *new) 60*0Sstevel@tonic-gate { 61*0Sstevel@tonic-gate ctf_list_t *p = new; /* p = new list element */ 62*0Sstevel@tonic-gate ctf_list_t *q = lp->l_next; /* q = head list element */ 63*0Sstevel@tonic-gate 64*0Sstevel@tonic-gate lp->l_next = p; 65*0Sstevel@tonic-gate p->l_prev = NULL; 66*0Sstevel@tonic-gate p->l_next = q; 67*0Sstevel@tonic-gate 68*0Sstevel@tonic-gate if (q != NULL) 69*0Sstevel@tonic-gate q->l_prev = p; 70*0Sstevel@tonic-gate else 71*0Sstevel@tonic-gate lp->l_prev = p; 72*0Sstevel@tonic-gate } 73*0Sstevel@tonic-gate 74*0Sstevel@tonic-gate /* 75*0Sstevel@tonic-gate * Delete the specified existing element from the given ctf_list_t. The 76*0Sstevel@tonic-gate * existing pointer should be pointing at a struct with embedded ctf_list_t. 77*0Sstevel@tonic-gate */ 78*0Sstevel@tonic-gate void 79*0Sstevel@tonic-gate ctf_list_delete(ctf_list_t *lp, void *existing) 80*0Sstevel@tonic-gate { 81*0Sstevel@tonic-gate ctf_list_t *p = existing; 82*0Sstevel@tonic-gate 83*0Sstevel@tonic-gate if (p->l_prev != NULL) 84*0Sstevel@tonic-gate p->l_prev->l_next = p->l_next; 85*0Sstevel@tonic-gate else 86*0Sstevel@tonic-gate lp->l_next = p->l_next; 87*0Sstevel@tonic-gate 88*0Sstevel@tonic-gate if (p->l_next != NULL) 89*0Sstevel@tonic-gate p->l_next->l_prev = p->l_prev; 90*0Sstevel@tonic-gate else 91*0Sstevel@tonic-gate lp->l_prev = p->l_prev; 92*0Sstevel@tonic-gate } 93*0Sstevel@tonic-gate 94*0Sstevel@tonic-gate /* 95*0Sstevel@tonic-gate * Convert an encoded CTF string name into a pointer to a C string by looking 96*0Sstevel@tonic-gate * up the appropriate string table buffer and then adding the offset. 97*0Sstevel@tonic-gate */ 98*0Sstevel@tonic-gate const char * 99*0Sstevel@tonic-gate ctf_strraw(ctf_file_t *fp, uint_t name) 100*0Sstevel@tonic-gate { 101*0Sstevel@tonic-gate ctf_strs_t *ctsp = &fp->ctf_str[CTF_NAME_STID(name)]; 102*0Sstevel@tonic-gate 103*0Sstevel@tonic-gate if (ctsp->cts_strs != NULL && CTF_NAME_OFFSET(name) < ctsp->cts_len) 104*0Sstevel@tonic-gate return (ctsp->cts_strs + CTF_NAME_OFFSET(name)); 105*0Sstevel@tonic-gate 106*0Sstevel@tonic-gate /* string table not loaded or corrupt offset */ 107*0Sstevel@tonic-gate return (NULL); 108*0Sstevel@tonic-gate } 109*0Sstevel@tonic-gate 110*0Sstevel@tonic-gate const char * 111*0Sstevel@tonic-gate ctf_strptr(ctf_file_t *fp, uint_t name) 112*0Sstevel@tonic-gate { 113*0Sstevel@tonic-gate const char *s = ctf_strraw(fp, name); 114*0Sstevel@tonic-gate return (s != NULL ? s : "(?)"); 115*0Sstevel@tonic-gate } 116*0Sstevel@tonic-gate 117*0Sstevel@tonic-gate /* 118*0Sstevel@tonic-gate * Same strdup(3C), but use ctf_alloc() to do the memory allocation. 119*0Sstevel@tonic-gate */ 120*0Sstevel@tonic-gate char * 121*0Sstevel@tonic-gate ctf_strdup(const char *s1) 122*0Sstevel@tonic-gate { 123*0Sstevel@tonic-gate char *s2 = ctf_alloc(strlen(s1) + 1); 124*0Sstevel@tonic-gate 125*0Sstevel@tonic-gate if (s2 != NULL) 126*0Sstevel@tonic-gate (void) strcpy(s2, s1); 127*0Sstevel@tonic-gate 128*0Sstevel@tonic-gate return (s2); 129*0Sstevel@tonic-gate } 130*0Sstevel@tonic-gate 131*0Sstevel@tonic-gate /* 132*0Sstevel@tonic-gate * Store the specified error code into errp if it is non-NULL, and then 133*0Sstevel@tonic-gate * return NULL for the benefit of the caller. 134*0Sstevel@tonic-gate */ 135*0Sstevel@tonic-gate ctf_file_t * 136*0Sstevel@tonic-gate ctf_set_open_errno(int *errp, int error) 137*0Sstevel@tonic-gate { 138*0Sstevel@tonic-gate if (errp != NULL) 139*0Sstevel@tonic-gate *errp = error; 140*0Sstevel@tonic-gate return (NULL); 141*0Sstevel@tonic-gate } 142*0Sstevel@tonic-gate 143*0Sstevel@tonic-gate /* 144*0Sstevel@tonic-gate * Store the specified error code into the CTF container, and then return 145*0Sstevel@tonic-gate * CTF_ERR for the benefit of the caller. 146*0Sstevel@tonic-gate */ 147*0Sstevel@tonic-gate long 148*0Sstevel@tonic-gate ctf_set_errno(ctf_file_t *fp, int err) 149*0Sstevel@tonic-gate { 150*0Sstevel@tonic-gate fp->ctf_errno = err; 151*0Sstevel@tonic-gate return (CTF_ERR); 152*0Sstevel@tonic-gate } 153