1*e824d57fSjohnlev /* 2*e824d57fSjohnlev * CDDL HEADER START 3*e824d57fSjohnlev * 4*e824d57fSjohnlev * The contents of this file are subject to the terms of the 5*e824d57fSjohnlev * Common Development and Distribution License (the "License"). 6*e824d57fSjohnlev * You may not use this file except in compliance with the License. 7*e824d57fSjohnlev * 8*e824d57fSjohnlev * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9*e824d57fSjohnlev * or http://www.opensolaris.org/os/licensing. 10*e824d57fSjohnlev * See the License for the specific language governing permissions 11*e824d57fSjohnlev * and limitations under the License. 12*e824d57fSjohnlev * 13*e824d57fSjohnlev * When distributing Covered Code, include this CDDL HEADER in each 14*e824d57fSjohnlev * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15*e824d57fSjohnlev * If applicable, add the following below this CDDL HEADER, with the 16*e824d57fSjohnlev * fields enclosed by brackets "[]" replaced with your own identifying 17*e824d57fSjohnlev * information: Portions Copyright [yyyy] [name of copyright owner] 18*e824d57fSjohnlev * 19*e824d57fSjohnlev * CDDL HEADER END 20*e824d57fSjohnlev */ 21*e824d57fSjohnlev /* 22*e824d57fSjohnlev * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 23*e824d57fSjohnlev * Use is subject to license terms. 24*e824d57fSjohnlev */ 25*e824d57fSjohnlev 26*e824d57fSjohnlev #pragma ident "%Z%%M% %I% %E% SMI" 27*e824d57fSjohnlev 28*e824d57fSjohnlev /* 29*e824d57fSjohnlev * Workarounds for stabs generation bugs in the compiler and general needed 30*e824d57fSjohnlev * fixups. 31*e824d57fSjohnlev */ 32*e824d57fSjohnlev 33*e824d57fSjohnlev #include <stdio.h> 34*e824d57fSjohnlev #include <strings.h> 35*e824d57fSjohnlev 36*e824d57fSjohnlev #include "ctf_headers.h" 37*e824d57fSjohnlev #include "ctftools.h" 38*e824d57fSjohnlev #include "hash.h" 39*e824d57fSjohnlev #include "memory.h" 40*e824d57fSjohnlev 41*e824d57fSjohnlev /* 42*e824d57fSjohnlev * Due to 4432619, the 6.1 compiler will sometimes incorrectly generate pointer 43*e824d57fSjohnlev * stabs. Given a struct foo, and a corresponding typedef struct foo foo_t. 44*e824d57fSjohnlev * In some cases, when faced with a pointer to a foo_t, the compiler will 45*e824d57fSjohnlev * sometimes generate a stab that describes a pointer to a struct foo. 46*e824d57fSjohnlev * Regardless of correctness, this breaks merges, as it occurs inconsistently 47*e824d57fSjohnlev * by file. The following two routines know how to recognize and repair foo_t * 48*e824d57fSjohnlev * and foo_t ** bugs in a specific set of cases. There is no general way to 49*e824d57fSjohnlev * solve this problem without a fix to the compiler. In general, cases should 50*e824d57fSjohnlev * only be added to these routines to fix merging problems in genunix. 51*e824d57fSjohnlev */ 52*e824d57fSjohnlev static void 53*e824d57fSjohnlev fix_ptrptr_to_struct(tdata_t *td) 54*e824d57fSjohnlev { 55*e824d57fSjohnlev char *strs[2] = { "as", "fdbuffer" }; 56*e824d57fSjohnlev char *mems[2] = { "a_objectdir", "fd_shadow" }; 57*e824d57fSjohnlev char *acts[2] = { "vnode", "page" }; 58*e824d57fSjohnlev char *tgts[2] = { "vnode_t", "page_t" }; 59*e824d57fSjohnlev tdesc_t *str; 60*e824d57fSjohnlev tdesc_t *act, *tgt; 61*e824d57fSjohnlev tdesc_t *p1, *p2; 62*e824d57fSjohnlev mlist_t *ml; 63*e824d57fSjohnlev int i; 64*e824d57fSjohnlev 65*e824d57fSjohnlev for (i = 0; i < sizeof (strs) / sizeof (strs[0]); i++) { 66*e824d57fSjohnlev if (!(str = lookupname(strs[i])) || str->t_type != STRUCT) 67*e824d57fSjohnlev continue; 68*e824d57fSjohnlev 69*e824d57fSjohnlev for (ml = str->t_members; ml; ml = ml->ml_next) { 70*e824d57fSjohnlev if (streq(ml->ml_name, mems[i])) 71*e824d57fSjohnlev break; 72*e824d57fSjohnlev } 73*e824d57fSjohnlev if (!ml) 74*e824d57fSjohnlev continue; 75*e824d57fSjohnlev 76*e824d57fSjohnlev if (ml->ml_type->t_type != POINTER || ml->ml_type->t_name || 77*e824d57fSjohnlev ml->ml_type->t_tdesc->t_type != POINTER || 78*e824d57fSjohnlev ml->ml_type->t_tdesc->t_name) 79*e824d57fSjohnlev continue; 80*e824d57fSjohnlev 81*e824d57fSjohnlev act = ml->ml_type->t_tdesc->t_tdesc; 82*e824d57fSjohnlev if (act->t_type != STRUCT || !streq(act->t_name, acts[i])) 83*e824d57fSjohnlev continue; 84*e824d57fSjohnlev 85*e824d57fSjohnlev if (!(tgt = lookupname(tgts[i])) || tgt->t_type != TYPEDEF) 86*e824d57fSjohnlev continue; 87*e824d57fSjohnlev 88*e824d57fSjohnlev /* We have an instance of the bug */ 89*e824d57fSjohnlev p2 = xcalloc(sizeof (*p2)); 90*e824d57fSjohnlev p2->t_type = POINTER; 91*e824d57fSjohnlev p2->t_id = td->td_nextid++; 92*e824d57fSjohnlev p2->t_tdesc = tgt; 93*e824d57fSjohnlev 94*e824d57fSjohnlev p1 = xcalloc(sizeof (*p1)); 95*e824d57fSjohnlev p1->t_type = POINTER; 96*e824d57fSjohnlev p1->t_id = td->td_nextid++; 97*e824d57fSjohnlev p1->t_tdesc = p2; 98*e824d57fSjohnlev 99*e824d57fSjohnlev ml->ml_type = p1; 100*e824d57fSjohnlev 101*e824d57fSjohnlev debug(3, "Fixed %s->%s => ptrptr struct %s bug\n", 102*e824d57fSjohnlev strs[i], mems[i], acts[i]); 103*e824d57fSjohnlev } 104*e824d57fSjohnlev } 105*e824d57fSjohnlev 106*e824d57fSjohnlev static void 107*e824d57fSjohnlev fix_ptr_to_struct(tdata_t *td) 108*e824d57fSjohnlev { 109*e824d57fSjohnlev char *strs[2] = { "vmem", "id_space" }; 110*e824d57fSjohnlev char *mems[2] = { NULL, "is_vmem" }; 111*e824d57fSjohnlev tdesc_t *ptr = NULL; 112*e824d57fSjohnlev tdesc_t *str, *vmt; 113*e824d57fSjohnlev mlist_t *ml; 114*e824d57fSjohnlev int i; 115*e824d57fSjohnlev 116*e824d57fSjohnlev if ((vmt = lookupname("vmem_t")) == NULL || vmt->t_type != TYPEDEF) 117*e824d57fSjohnlev return; 118*e824d57fSjohnlev 119*e824d57fSjohnlev for (i = 0; i < sizeof (strs) / sizeof (strs[0]); i++) { 120*e824d57fSjohnlev if (!(str = lookupname(strs[i])) || str->t_type != STRUCT) 121*e824d57fSjohnlev continue; 122*e824d57fSjohnlev 123*e824d57fSjohnlev for (ml = str->t_members; ml; ml = ml->ml_next) { 124*e824d57fSjohnlev if (mems[i] && !streq(ml->ml_name, mems[i])) 125*e824d57fSjohnlev continue; 126*e824d57fSjohnlev 127*e824d57fSjohnlev if (ml->ml_type->t_type != POINTER || 128*e824d57fSjohnlev ml->ml_type->t_name || 129*e824d57fSjohnlev (ml->ml_type->t_tdesc->t_type != STRUCT && 130*e824d57fSjohnlev ml->ml_type->t_tdesc->t_type != FORWARD) || 131*e824d57fSjohnlev !streq(ml->ml_type->t_tdesc->t_name, "vmem")) 132*e824d57fSjohnlev continue; 133*e824d57fSjohnlev 134*e824d57fSjohnlev debug(3, "Fixed %s->%s => ptr struct vmem bug\n", 135*e824d57fSjohnlev strs[i], ml->ml_name); 136*e824d57fSjohnlev 137*e824d57fSjohnlev if (!ptr) { 138*e824d57fSjohnlev ptr = xcalloc(sizeof (*ptr)); 139*e824d57fSjohnlev ptr->t_type = POINTER; 140*e824d57fSjohnlev ptr->t_id = td->td_nextid++; 141*e824d57fSjohnlev ptr->t_tdesc = vmt; 142*e824d57fSjohnlev } 143*e824d57fSjohnlev 144*e824d57fSjohnlev ml->ml_type = ptr; 145*e824d57fSjohnlev } 146*e824d57fSjohnlev } 147*e824d57fSjohnlev } 148*e824d57fSjohnlev 149*e824d57fSjohnlev /* 150*e824d57fSjohnlev * Fix stabs generation bugs. These routines must be run before the 151*e824d57fSjohnlev * post-conversion merge 152*e824d57fSjohnlev */ 153*e824d57fSjohnlev void 154*e824d57fSjohnlev cvt_fixstabs(tdata_t *td) 155*e824d57fSjohnlev { 156*e824d57fSjohnlev fix_ptrptr_to_struct(td); 157*e824d57fSjohnlev fix_ptr_to_struct(td); 158*e824d57fSjohnlev } 159*e824d57fSjohnlev 160*e824d57fSjohnlev struct match { 161*e824d57fSjohnlev tdesc_t *m_ret; 162*e824d57fSjohnlev const char *m_name; 163*e824d57fSjohnlev }; 164*e824d57fSjohnlev 165*e824d57fSjohnlev static int 166*e824d57fSjohnlev matching_iidesc(iidesc_t *iidesc, struct match *match) 167*e824d57fSjohnlev { 168*e824d57fSjohnlev if (!streq(iidesc->ii_name, match->m_name)) 169*e824d57fSjohnlev return (0); 170*e824d57fSjohnlev 171*e824d57fSjohnlev if (iidesc->ii_type != II_TYPE && iidesc->ii_type != II_SOU) 172*e824d57fSjohnlev return (0); 173*e824d57fSjohnlev 174*e824d57fSjohnlev match->m_ret = iidesc->ii_dtype; 175*e824d57fSjohnlev return (-1); 176*e824d57fSjohnlev } 177*e824d57fSjohnlev 178*e824d57fSjohnlev static tdesc_t * 179*e824d57fSjohnlev lookup_tdesc(tdata_t *td, const char *name) 180*e824d57fSjohnlev { 181*e824d57fSjohnlev struct match match = { NULL, name }; 182*e824d57fSjohnlev iter_iidescs_by_name(td, name, (int (*)())matching_iidesc, &match); 183*e824d57fSjohnlev return (match.m_ret); 184*e824d57fSjohnlev } 185*e824d57fSjohnlev 186*e824d57fSjohnlev /* 187*e824d57fSjohnlev * The cpu structure grows, with the addition of a machcpu member, if 188*e824d57fSjohnlev * _MACHDEP is defined. This means that, for example, the cpu structure 189*e824d57fSjohnlev * in unix is different from the cpu structure in genunix. As one might 190*e824d57fSjohnlev * expect, this causes merges to fail. Since everyone indirectly contains 191*e824d57fSjohnlev * a pointer to a CPU structure, the failed merges can cause massive amounts 192*e824d57fSjohnlev * of duplication. In the case of unix uniquifying against genunix, upwards 193*e824d57fSjohnlev * of 50% of the structures were unmerged due to this problem. We fix this 194*e824d57fSjohnlev * by adding a cpu_m member. If machcpu hasn't been defined in our module, 195*e824d57fSjohnlev * we make a forward node for it. 196*e824d57fSjohnlev */ 197*e824d57fSjohnlev static void 198*e824d57fSjohnlev fix_small_cpu_struct(tdata_t *td, size_t ptrsize) 199*e824d57fSjohnlev { 200*e824d57fSjohnlev tdesc_t *cput, *cpu; 201*e824d57fSjohnlev tdesc_t *machcpu; 202*e824d57fSjohnlev mlist_t *ml, *lml; 203*e824d57fSjohnlev mlist_t *cpum; 204*e824d57fSjohnlev int foundcpucyc = 0; 205*e824d57fSjohnlev 206*e824d57fSjohnlev /* 207*e824d57fSjohnlev * We're going to take the circuitous route finding the cpu structure, 208*e824d57fSjohnlev * because we want to make sure that we find the right one. It would 209*e824d57fSjohnlev * be nice if we could verify the header name too. DWARF might not 210*e824d57fSjohnlev * have the cpu_t, so we let this pass. 211*e824d57fSjohnlev */ 212*e824d57fSjohnlev if ((cput = lookup_tdesc(td, "cpu_t")) != NULL) { 213*e824d57fSjohnlev if (cput->t_type != TYPEDEF) 214*e824d57fSjohnlev return; 215*e824d57fSjohnlev cpu = cput->t_tdesc; 216*e824d57fSjohnlev } else { 217*e824d57fSjohnlev cpu = lookup_tdesc(td, "cpu"); 218*e824d57fSjohnlev } 219*e824d57fSjohnlev 220*e824d57fSjohnlev if (cpu == NULL) 221*e824d57fSjohnlev return; 222*e824d57fSjohnlev 223*e824d57fSjohnlev if (!streq(cpu->t_name, "cpu") || cpu->t_type != STRUCT) 224*e824d57fSjohnlev return; 225*e824d57fSjohnlev 226*e824d57fSjohnlev for (ml = cpu->t_members, lml = NULL; ml; 227*e824d57fSjohnlev lml = ml, ml = ml->ml_next) { 228*e824d57fSjohnlev if (strcmp(ml->ml_name, "cpu_cyclic") == 0) 229*e824d57fSjohnlev foundcpucyc = 1; 230*e824d57fSjohnlev } 231*e824d57fSjohnlev 232*e824d57fSjohnlev if (foundcpucyc == 0 || lml == NULL || 233*e824d57fSjohnlev strcmp(lml->ml_name, "cpu_m") == 0) 234*e824d57fSjohnlev return; 235*e824d57fSjohnlev 236*e824d57fSjohnlev /* 237*e824d57fSjohnlev * We need to derive the right offset for the fake cpu_m member. To do 238*e824d57fSjohnlev * that, we require a special unused member to be the last member 239*e824d57fSjohnlev * before the 'cpu_m', that we encode knowledge of here. ABI alignment 240*e824d57fSjohnlev * on all platforms is such that we only need to add a pointer-size 241*e824d57fSjohnlev * number of bits to get the right offset for cpu_m. This would most 242*e824d57fSjohnlev * likely break if gcc's -malign-double were ever used, but that option 243*e824d57fSjohnlev * breaks the ABI anyway. 244*e824d57fSjohnlev */ 245*e824d57fSjohnlev if (!streq(lml->ml_name, "cpu_m_pad") && 246*e824d57fSjohnlev getenv("CTFCONVERT_PERMISSIVE") == NULL) { 247*e824d57fSjohnlev terminate("last cpu_t member before cpu_m is %s; " 248*e824d57fSjohnlev "it must be cpu_m_pad.\n", lml->ml_name); 249*e824d57fSjohnlev } 250*e824d57fSjohnlev 251*e824d57fSjohnlev if ((machcpu = lookup_tdesc(td, "machcpu")) == NULL) { 252*e824d57fSjohnlev machcpu = xcalloc(sizeof (*machcpu)); 253*e824d57fSjohnlev machcpu->t_name = xstrdup("machcpu"); 254*e824d57fSjohnlev machcpu->t_id = td->td_nextid++; 255*e824d57fSjohnlev machcpu->t_type = FORWARD; 256*e824d57fSjohnlev } else if (machcpu->t_type != STRUCT) { 257*e824d57fSjohnlev return; 258*e824d57fSjohnlev } 259*e824d57fSjohnlev 260*e824d57fSjohnlev debug(3, "Adding cpu_m machcpu %s to cpu struct\n", 261*e824d57fSjohnlev (machcpu->t_type == FORWARD ? "forward" : "struct")); 262*e824d57fSjohnlev 263*e824d57fSjohnlev cpum = xmalloc(sizeof (*cpum)); 264*e824d57fSjohnlev cpum->ml_offset = lml->ml_offset + (ptrsize * NBBY); 265*e824d57fSjohnlev cpum->ml_size = 0; 266*e824d57fSjohnlev cpum->ml_name = xstrdup("cpu_m"); 267*e824d57fSjohnlev cpum->ml_type = machcpu; 268*e824d57fSjohnlev cpum->ml_next = NULL; 269*e824d57fSjohnlev 270*e824d57fSjohnlev lml->ml_next = cpum; 271*e824d57fSjohnlev } 272*e824d57fSjohnlev 273*e824d57fSjohnlev void 274*e824d57fSjohnlev cvt_fixups(tdata_t *td, size_t ptrsize) 275*e824d57fSjohnlev { 276*e824d57fSjohnlev fix_small_cpu_struct(td, ptrsize); 277*e824d57fSjohnlev } 278