2N/A * The contents of this file are subject to the terms of the 2N/A * Common Development and Distribution License, Version 1.0 only 2N/A * (the "License"). You may not use this file except in compliance 2N/A * See the License for the specific language governing permissions 2N/A * and limitations under the License. 2N/A * When distributing Covered Code, include this CDDL HEADER in each 2N/A * If applicable, add the following below this CDDL HEADER, with the 2N/A * fields enclosed by brackets "[]" replaced with your own identifying 2N/A * information: Portions Copyright [yyyy] [name of copyright owner] 2N/A * Copyright (c) 2000-2001 by Sun Microsystems, Inc. 2N/A * All rights reserved. 2N/A#
pragma ident "%Z%%M% %I% %E% SMI" 2N/A/* ========================================================================= */ 2N/A/* Ancestor object definitions. */ 2N/AAncestor::print(void) 2N/A fprintf(stderr, "Ancestor Information\n"); 2N/A fprintf(stderr, "Tag Name: %s\n", def->name); 2N/A fprintf(stderr, "Tag Type: %s\n", 2N/A get_tagtype_str(get_tag_type(&tag))); 2N/A fprintf(stderr, "Num instances: %d\n", numInstances); 2N/A fprintf(stderr, " offsets:\n"); 2N/A for (int i = 0; i < numInstances; i++) { 2N/A fprintf(stderr, " %d\n", offsets[i]); 2N/A // look through all the elements. 2N/A // ancestors have to be tagged. 2N/A if (f ==
1)
found =
1;
// found needs to latch at one. 2N/A if (f ==
1)
found =
1;
// found needs to latch at one.