All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.sun.tools.xjc.reader.relaxng.RELAXNGCompiler Maven / Gradle / Ivy

There is a newer version: 4.0.5
Show newest version
/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright (c) 1997-2011 Oracle and/or its affiliates. All rights reserved.
 *
 * The contents of this file are subject to the terms of either the GNU
 * General Public License Version 2 only ("GPL") or the Common Development
 * and Distribution License("CDDL") (collectively, the "License").  You
 * may not use this file except in compliance with the License.  You can
 * obtain a copy of the License at
 * https://glassfish.dev.java.net/public/CDDL+GPL_1_1.html
 * or packager/legal/LICENSE.txt.  See the License for the specific
 * language governing permissions and limitations under the License.
 *
 * When distributing the software, include this License Header Notice in each
 * file and include the License file at packager/legal/LICENSE.txt.
 *
 * GPL Classpath Exception:
 * Oracle designates this particular file as subject to the "Classpath"
 * exception as provided by Oracle in the GPL Version 2 section of the License
 * file that accompanied this code.
 *
 * Modifications:
 * If applicable, add the following below the License Header, with the fields
 * enclosed by brackets [] replaced by your own identifying information:
 * "Portions Copyright [year] [name of copyright owner]"
 *
 * Contributor(s):
 * If you wish your version of this file to be governed by only the CDDL or
 * only the GPL Version 2, indicate your decision by adding "[Contributor]
 * elects to include this software in this distribution under the [CDDL or GPL
 * Version 2] license."  If you don't indicate a single choice of license, a
 * recipient has the option to distribute your version of this file under
 * either the CDDL, the GPL Version 2 or to extend the choice of license to
 * its licensees as provided above.  However, if you add GPL Version 2 code
 * and therefore, elected the GPL Version 2 license, then the option applies
 * only if the new code is made subject to such option by the copyright
 * holder.
 */

package com.sun.tools.xjc.reader.relaxng;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;

import javax.xml.namespace.QName;

import com.sun.codemodel.JCodeModel;
import com.sun.codemodel.JPackage;
import com.sun.tools.xjc.Options;
import com.sun.tools.xjc.model.CBuiltinLeafInfo;
import com.sun.tools.xjc.model.CClassInfo;
import com.sun.tools.xjc.model.CClassInfoParent;
import com.sun.tools.xjc.model.CEnumConstant;
import com.sun.tools.xjc.model.CEnumLeafInfo;
import com.sun.tools.xjc.model.CNonElement;
import com.sun.tools.xjc.model.CTypeInfo;
import com.sun.tools.xjc.model.Model;
import com.sun.tools.xjc.model.TypeUse;
import com.sun.xml.bind.api.impl.NameConverter;

import org.kohsuke.rngom.digested.DChoicePattern;
import org.kohsuke.rngom.digested.DDefine;
import org.kohsuke.rngom.digested.DElementPattern;
import org.kohsuke.rngom.digested.DPattern;
import org.kohsuke.rngom.digested.DPatternWalker;
import org.kohsuke.rngom.digested.DRefPattern;
import org.kohsuke.rngom.digested.DValuePattern;
import org.kohsuke.rngom.nc.NameClass;
import org.kohsuke.rngom.xml.util.WellKnownNamespaces;

/**
 * @author Kohsuke Kawaguchi
 */
public final class RELAXNGCompiler {
    /**
     * Schema to compile.
     */
    final DPattern grammar;

    /**
     * All named patterns in this schema.
     */
    final Set defs;

    final Options opts;

    final Model model;

    /**
     * The package to which we generate the code into.
     */
    final JPackage pkg;

    final Map datatypes = new HashMap();

    /**
     * Patterns that are mapped to Java concepts.
     *
     * 

* The value is an array because we map elements with finite names * to multiple classes. * * TODO: depending on the type of the key, the type of the values can be further * restricted. Make this into its own class to represent those constraints better. */ final Map classes = new HashMap(); /** * Classes that need to be bound. * * The value is the content model to be bound. */ final Map bindQueue = new HashMap(); final TypeUseBinder typeUseBinder = new TypeUseBinder(this); public static Model build(DPattern grammar, JCodeModel codeModel, Options opts ) { RELAXNGCompiler compiler = new RELAXNGCompiler(grammar, codeModel, opts); compiler.compile(); return compiler.model; } public RELAXNGCompiler(DPattern grammar, JCodeModel codeModel, Options opts) { this.grammar = grammar; this.opts = opts; this.model = new Model(opts,codeModel, NameConverter.smart,opts.classNameAllocator,null); datatypes.put("",DatatypeLib.BUILTIN); datatypes.put(WellKnownNamespaces.XML_SCHEMA_DATATYPES,DatatypeLib.XMLSCHEMA); // find all defines DefineFinder deff = new DefineFinder(); grammar.accept(deff); this.defs = deff.defs; if(opts.defaultPackage2!=null) pkg = codeModel._package(opts.defaultPackage2); else if(opts.defaultPackage!=null) pkg = codeModel._package(opts.defaultPackage); else pkg = codeModel.rootPackage(); } private void compile() { // decide which patterns to map to classes promoteElementDefsToClasses(); promoteTypeSafeEnums(); // TODO: promote patterns with to classes // TODO: promote 'type' patterns to classes promoteTypePatternsToClasses(); for (Map.Entry e : bindQueue.entrySet()) bindContentModel(e.getKey(),e.getValue()); } private void bindContentModel(CClassInfo clazz, DPattern pattern) { // first we decide which patterns in it map to properties // then we process each of them by using RawTypeSetBuilder. // much like DefaultParticleBinder in XSD pattern.accept(new ContentModelBinder(this,clazz)); } private void promoteTypeSafeEnums() { // we'll be trying a lot of choices, // and most of them will not be type-safe enum. // using the same list improves the memory efficiency. List members = new ArrayList(); OUTER: for( DDefine def : defs ) { DPattern p = def.getPattern(); if (p instanceof DChoicePattern) { DChoicePattern cp = (DChoicePattern) p; members.clear(); // check if the choice consists of all value patterns // and that they are of the same datatype DValuePattern vp = null; for( DPattern child : cp ) { if(child instanceof DValuePattern) { DValuePattern c = (DValuePattern) child; if(vp==null) vp=c; else { if(!vp.getDatatypeLibrary().equals(c.getDatatypeLibrary()) || !vp.getType().equals(c.getType()) ) continue OUTER; // different type name } members.add(new CEnumConstant( model.getNameConverter().toConstantName(c.getValue()), null, c.getValue(), null, null/*TODO*/, c.getLocation() )); } else continue OUTER; // not a value } if(members.isEmpty()) continue; // empty choice CNonElement base = CBuiltinLeafInfo.STRING; DatatypeLib lib = datatypes.get(vp.getNs()); if(lib!=null) { TypeUse use = lib.get(vp.getType()); if(use instanceof CNonElement) base = (CNonElement)use; } CEnumLeafInfo xducer = new CEnumLeafInfo(model, null, new CClassInfoParent.Package(pkg), def.getName(), base, new ArrayList(members), null, null/*TODO*/, cp.getLocation()); classes.put(cp,new CTypeInfo[]{xducer}); } } } private void promoteElementDefsToClasses() { // look for elements among named patterns for( DDefine def : defs ) { DPattern p = def.getPattern(); if (p instanceof DElementPattern) { DElementPattern ep = (DElementPattern) p; mapToClass(ep); } } // also look for root elements grammar.accept(new DPatternWalker() { public Void onRef(DRefPattern p) { return null; // stop recursion } public Void onElement(DElementPattern p) { mapToClass(p); return null; } }); } private void mapToClass(DElementPattern p) { NameClass nc = p.getName(); if(nc.isOpen()) return; // infinite name. can't map to a class. Set names = nc.listNames(); CClassInfo[] types = new CClassInfo[names.size()]; int i=0; for( QName n : names ) { // TODO: read class names from customization String name = model.getNameConverter().toClassName(n.getLocalPart()); bindQueue.put( types[i++] = new CClassInfo(model,pkg,name,p.getLocation(),null,n,null,null/*TODO*/), p.getChild() ); } classes.put(p,types); } /** * Looks for named patterns that are not bound to classes so far, * but that can be bound to classes. */ private void promoteTypePatternsToClasses() { // for( DDefine def : defs ) { // ; // // def.getPattern().accept(new InheritanceChecker()); // } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy