/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dv/ |
H A D | SchemaDVFactory.java | 88 * is derived from anyType, and pass 'null' as the base of 111 * @param base base type of the new type 116 short finalSet, XSSimpleType base, 115 createTypeRestriction(String name, String targetNamespace, short finalSet, XSSimpleType base, XSObjectList annotations) argument
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dv/xs/ |
H A D | BaseDVFactory.java | 55 * is derived from anyType, and pass 'null' as the base of 82 * @param base base type of the new type 87 short finalSet, XSSimpleType base, XSObjectList annotations) { 88 return new XSSimpleTypeDecl((XSSimpleTypeDecl)base, name, targetNamespace, finalSet, false, annotations); 131 // base schema simple type names 86 createTypeRestriction(String name, String targetNamespace, short finalSet, XSSimpleType base, XSObjectList annotations) argument
|
H A D | BaseSchemaDVFactory.java | 33 * the base factory to create/return built-in schema DVs and create user-defined DVs 261 * @param base base type of the new type 266 short finalSet, XSSimpleType base, XSObjectList annotations) { 270 return st.setRestrictionValues((XSSimpleTypeDecl)base, name, targetNamespace, finalSet, annotations); 272 return new XSSimpleTypeDecl((XSSimpleTypeDecl)base, name, targetNamespace, finalSet, false, annotations); 265 createTypeRestriction(String name, String targetNamespace, short finalSet, XSSimpleType base, XSObjectList annotations) argument
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/resolver/helpers/ |
H A D | BootstrapResolver.java | 137 public Source resolve(String href, String base) argument 157 if (base==null) { 161 URL baseURL = new URL(base); 166 // try to make an absolute URI from the current base 167 String absBase = makeAbsolute(base); 168 if (!absBase.equals(base)) { 173 + href + "(base " + base + ")",
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/resolver/tools/ |
H A D | CatalogResolver.java | 230 public Source resolve(String href, String base) argument 253 if (base==null) { 257 URL baseURL = new URL(base); 262 // try to make an absolute URI from the current base 263 String absBase = makeAbsolute(base); 264 if (!absBase.equals(base)) { 269 + href + "(base " + base + ")",
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/utils/ |
H A D | SystemIDResolver.java | 278 * @param base The URI string used as the base for resolving the systemID 283 public static String getAbsoluteURI(String urlString, String base) argument 286 if (base == null) 289 String absoluteBase = getAbsoluteURI(base);
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/ |
H A D | SystemIDResolver.java | 271 * @param base The URI string used as the base for resolving the systemID 276 public static String getAbsoluteURI(String urlString, String base) argument 279 if (base == null) 282 String absoluteBase = getAbsoluteURI(base);
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/ui/ |
H A D | FindInCodeCachePanel.java | 55 Address base; field in class:FindInCodeCachePanel.Visitor 61 base = start; 82 iterated = end.minus(base);;
|
/openjdk7/jdk/src/share/classes/java/math/ |
H A D | BitSieve.java | 65 * Construct a "small sieve" with a base of 0. This constructor is 68 * constructor, BitSieve(BigInteger base, int searchLen). The length 94 * candidates. The new sieve begins at the specified base, which must 97 BitSieve(BigInteger base, int searchLen) { argument 112 // Construct the large sieve at an even offset specified by base 113 MutableBigInteger b = new MutableBigInteger(base); 116 // Calculate base mod convertedStep
|
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | objArrayOop.hpp | 42 return &((T*)base())[index]; 77 // base is the address following the header. 78 HeapWord* base() const { return (HeapWord*) arrayOopDesc::base(T_OBJECT); } function in class:objArrayOopDesc
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | addnode.hpp | 139 Address, // Actually address, derived from base 141 AddPNode( Node *base, Node *ptr, Node *off ) : Node(0,base,ptr,off) { argument 150 Node *base_node() { assert( req() > Base, "Missing base"); return in(Base); } 159 // Do not match base-ptr edge
|
H A D | macro.hpp | 45 Node* basic_plus_adr(Node* base, int offset) { argument 46 return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset)); 48 Node* basic_plus_adr(Node* base, Node* ptr, int offset) { argument 49 return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset)); 51 Node* basic_plus_adr(Node* base, Node* offset) { argument 52 return basic_plus_adr(base, base, offset); 54 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) { argument 55 Node* adr = new (C) AddPNode(base, pt [all...] |
/openjdk7/jdk/src/share/classes/com/sun/script/util/ |
H A D | BindingsEntrySet.java | 37 private BindingsBase base; field in class:BindingsEntrySet 40 public BindingsEntrySet(BindingsBase base) { argument 41 this.base = base; 42 keys = base.getNames(); 68 return base.get(key); 93 base.remove(keys[current - 1]);
|
/openjdk7/jdk/src/share/classes/java/awt/ |
H A D | Canvas.java | 46 private static final String base = "canvas"; field in class:Canvas 89 return base + nameCounter++;
|
H A D | Label.java | 101 private static final String base = "label"; field in class:Label 176 return base + nameCounter++;
|
/openjdk7/jdk/src/windows/native/sun/tools/attach/ |
H A D | WindowsAttachProvider.c | 166 char base[256]; local 167 BOOL res = GetModuleBaseName(hProcess, ptr[i], base, sizeof(base)); 169 if (strcmp(base, lib) == 0) {
|
/openjdk7/langtools/test/tools/javac/6400872/ |
H A D | T6400872.java | 86 static void jar(File jar, Iterable<File> classPath, File base, File... files) argument 97 add(j, base, files); 101 static void add(JarOutputStream j, File base, File... files) throws IOException { argument 106 add(j, base, f); 109 static void add(JarOutputStream j, File base, File file) throws IOException { argument 110 File f = new File(base, file.getPath()); 115 add(j, base, new File(file, c));
|
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/ |
H A D | inftrees.c | 79 const unsigned short FAR *base; /* base value table to use */ local 81 int end; /* use base and extra for symbol > end */ 84 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 90 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 208 base = extra = work; /* dummy value--not used */ 212 base = lbase; 213 base -= 257; 219 base = dbase; 249 this.val = base[wor [all...] |
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | Lookups.h | 61 inline le_int32 getGlyphCoverage(const LEReferenceTo<LookupSubtable> &base, LEGlyphID glyphID, LEErrorCode &success) const; 63 le_int32 getGlyphCoverage(const LEReferenceTo<LookupSubtable> &base, Offset tableOffset, LEGlyphID glyphID, LEErrorCode &success) const; 66 inline le_int32 getGlyphCoverage(const LETableReference &base, LEGlyphID glyphID, LEErrorCode &success) const; 68 inline le_int32 getGlyphCoverage(const LETableReference &base, Offset tableOffset, LEGlyphID glyphID, LEErrorCode &success) const; 78 const LEReferenceTo<LookupSubtable> getLookupSubtable(const LEReferenceTo<LookupTable> &base, le_uint16 subtableIndex, LEErrorCode &success) const; 87 const LEReferenceTo<LookupTable> getLookupTable(const LEReferenceTo<LookupListTable> &base, le_uint16 lookupTableIndex, LEErrorCode &success) const; 91 inline le_int32 LookupSubtable::getGlyphCoverage(const LEReferenceTo<LookupSubtable> &base, LEGlyphID glyphID, LEErrorCode &success) const argument 93 return getGlyphCoverage(base, coverageTableOffset, glyphID, success); 96 inline le_int32 LookupSubtable::getGlyphCoverage(const LETableReference &base, LEGlyphID glyphID, LEErrorCode &success) const { argument 97 LEReferenceTo<LookupSubtable> thisRef(base, succes 101 getGlyphCoverage(const LETableReference &base, Offset tableOffset, LEGlyphID glyphID, LEErrorCode &success) const argument [all...] |
H A D | MarkToBasePosnSubtables.cpp | 54 le_int32 MarkToBasePositioningSubtable::process(const LETableReference &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const argument 57 le_int32 markCoverage = getGlyphCoverage(base, (LEGlyphID) markGlyph, success); 79 // FIXME: We probably don't want to find a base glyph before a previous ligature... 82 le_int32 baseCoverage = getBaseCoverage(base, (LEGlyphID) baseGlyph, success); 87 // The base glyph isn't covered, or the coverage 123 //JK: adjustment needs to account for non-zero advance of any marks between base glyph and current mark 125 gi.next(); // point beyond the base glyph 130 pixels.fX += px.fX; // and add that to the base glyph's advance
|
H A D | MarkToMarkPosnSubtables.cpp | 54 le_int32 MarkToMarkPositioningSubtable::process(const LETableReference &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const argument 57 le_int32 markCoverage = getGlyphCoverage(base, (LEGlyphID) markGlyph, success); 81 le_int32 mark2Coverage = getBaseCoverage(base, (LEGlyphID) mark2Glyph, success);
|
H A D | MorphTables2.cpp | 45 void MorphTableHeader2::process(const LEReferenceTo<MorphTableHeader2> &base, LEGlyphStorage &glyphStorage, argument 51 LEReferenceTo<ChainHeader2> chainHeader(base, success, &chains[0]); 203 void MorphSubtableHeader2::process(const LEReferenceTo<MorphSubtableHeader2> &base, LEGlyphStorage &glyphStorage, LEErrorCode &success) const argument 210 processor = new IndicRearrangementProcessor2(base, success); 214 processor = new ContextualGlyphSubstitutionProcessor2(base, success); 218 processor = new LigatureSubstitutionProcessor2(base, success); 225 processor = NonContextualGlyphSubstitutionProcessor2::createInstance(base, success); 230 processor = new ContextualGlyphInsertionProcessor2(base, success);
|
H A D | PairPositioningSubtables.cpp | 44 le_uint32 PairPositioningSubtable::process(const LEReferenceTo<PairPositioningSubtable> &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const argument 53 const LEReferenceTo<PairPositioningFormat1Subtable> subtable(base, success, (const PairPositioningFormat1Subtable *) this); 63 const LEReferenceTo<PairPositioningFormat2Subtable> subtable(base, success, (const PairPositioningFormat2Subtable *) this); 75 le_uint32 PairPositioningFormat1Subtable::process(const LEReferenceTo<PairPositioningFormat1Subtable> &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const argument 78 le_int32 coverageIndex = getGlyphCoverage(base, firstGlyph, success); 87 LEReferenceTo<PairSetTable> pairSetTable(base, success, ((char *) this + pairSetTableOffset)); 99 pairValueRecord = findPairValueRecord(base, (TTGlyphID) LE_GET_GLYPH(secondGlyph), pairSetTable->pairValueRecordArray, pairValueCount, recordSize, success); 125 le_uint32 PairPositioningFormat2Subtable::process(const LEReferenceTo<PairPositioningFormat2Subtable> &base, GlyphIterator *glyphIterator, const LEFontInstance *fontInstance, LEErrorCode &success) const argument 128 le_int32 coverageIndex = getGlyphCoverage(base, firstGlyph, success); 169 LEReferenceTo<PairValueRecord> PairPositioningFormat1Subtable::findPairValueRecord(const LETableReference &base, TTGlyphI argument [all...] |
/openjdk7/jdk/src/share/classes/sun/security/provider/ |
H A D | DigestBase.java | 33 * Common base message digest implementation for the Sun provider. 89 DigestBase(DigestBase base) { argument 90 this.algorithm = base.algorithm; 91 this.digestLength = base.digestLength; 92 this.blockSize = base.blockSize; 93 this.buffer = base.buffer.clone(); 94 this.bufOfs = base.bufOfs; 95 this.bytesProcessed = base.bytesProcessed;
|
H A D | SHA2.java | 85 private SHA2(SHA2 base) { argument 86 super(base); 87 this.state = base.state.clone();
|