Categories:
Audio (13)
Biotech (29)
Bytecode (36)
Database (77)
Framework (7)
Game (7)
General (507)
Graphics (53)
I/O (35)
IDE (2)
JAR Tools (101)
JavaBeans (21)
JDBC (121)
JDK (426)
JSP (20)
Logging (108)
Mail (58)
Messaging (8)
Network (84)
PDF (97)
Report (7)
Scripting (84)
Security (32)
Server (121)
Servlet (26)
SOAP (24)
Testing (54)
Web (15)
XML (309)
Collections:
Other Resources:
JDK 17 jdk.incubator.vector.jmod - JDK Incubator Vector
JDK 17 jdk.incubator.vector.jmod is the JMOD file for JDK 17 HTTP Server module.
JDK 17 Incubator Vector module compiled class files are stored in \fyicenter\jdk-17.0.5\jmods\jdk.incubator.vector.jmod.
JDK 17 Incubator Vector module compiled class files are also linked and stored in the \fyicenter\jdk-17.0.5\lib\modules JImage file.
JDK 17 Incubator Vector module source code files are stored in \fyicenter\jdk-17.0.5\lib\src.zip\jdk.incubator.vector.
You can click and view the content of each source code file in the list below.
✍: FYIcenter
⏎ jdk/incubator/vector/IntMaxVector.java
/* * Copyright (c) 2017, 2021, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * * * * * * */ package jdk.incubator.vector; import java.nio.ByteBuffer; import java.util.Arrays; import java.util.Objects; import java.util.function.IntUnaryOperator; import jdk.internal.vm.annotation.ForceInline; import jdk.internal.vm.vector.VectorSupport; import static jdk.internal.vm.vector.VectorSupport.*; import static jdk.incubator.vector.VectorOperators.*; // -- This file was mechanically generated: Do not edit! -- // @SuppressWarnings("cast") // warning: redundant cast final class IntMaxVector extends IntVector { static final IntSpecies VSPECIES = (IntSpecies) IntVector.SPECIES_MAX; static final VectorShape VSHAPE = VSPECIES.vectorShape(); static final Class<IntMaxVector> VCLASS = IntMaxVector.class; static final int VSIZE = VSPECIES.vectorBitSize(); static final int VLENGTH = VSPECIES.laneCount(); // used by the JVM static final Class<Integer> ETYPE = int.class; // used by the JVM IntMaxVector(int[] v) { super(v); } // For compatibility as IntMaxVector::new, // stored into species.vectorFactory. IntMaxVector(Object v) { this((int[]) v); } static final IntMaxVector ZERO = new IntMaxVector(new int[VLENGTH]); static final IntMaxVector IOTA = new IntMaxVector(VSPECIES.iotaArray()); static { // Warm up a few species caches. // If we do this too much we will // get NPEs from bootstrap circularity. VSPECIES.dummyVector(); VSPECIES.withLanes(LaneType.BYTE); } // Specialized extractors @ForceInline final @Override public IntSpecies vspecies() { // ISSUE: This should probably be a @Stable // field inside AbstractVector, rather than // a megamorphic method. return VSPECIES; } @ForceInline @Override public final Class<Integer> elementType() { return int.class; } @ForceInline @Override public final int elementSize() { return Integer.SIZE; } @ForceInline @Override public final VectorShape shape() { return VSHAPE; } @ForceInline @Override public final int length() { return VLENGTH; } @ForceInline @Override public final int bitSize() { return VSIZE; } @ForceInline @Override public final int byteSize() { return VSIZE / Byte.SIZE; } /*package-private*/ @ForceInline final @Override int[] vec() { return (int[])getPayload(); } // Virtualized constructors @Override @ForceInline public final IntMaxVector broadcast(int e) { return (IntMaxVector) super.broadcastTemplate(e); // specialize } @Override @ForceInline public final IntMaxVector broadcast(long e) { return (IntMaxVector) super.broadcastTemplate(e); // specialize } @Override @ForceInline IntMaxMask maskFromArray(boolean[] bits) { return new IntMaxMask(bits); } @Override @ForceInline IntMaxShuffle iotaShuffle() { return IntMaxShuffle.IOTA; } @ForceInline IntMaxShuffle iotaShuffle(int start, int step, boolean wrap) { if (wrap) { return (IntMaxShuffle)VectorSupport.shuffleIota(ETYPE, IntMaxShuffle.class, VSPECIES, VLENGTH, start, step, 1, (l, lstart, lstep, s) -> s.shuffleFromOp(i -> (VectorIntrinsics.wrapToRange(i*lstep + lstart, l)))); } else { return (IntMaxShuffle)VectorSupport.shuffleIota(ETYPE, IntMaxShuffle.class, VSPECIES, VLENGTH, start, step, 0, (l, lstart, lstep, s) -> s.shuffleFromOp(i -> (i*lstep + lstart))); } } @Override @ForceInline IntMaxShuffle shuffleFromBytes(byte[] reorder) { return new IntMaxShuffle(reorder); } @Override @ForceInline IntMaxShuffle shuffleFromArray(int[] indexes, int i) { return new IntMaxShuffle(indexes, i); } @Override @ForceInline IntMaxShuffle shuffleFromOp(IntUnaryOperator fn) { return new IntMaxShuffle(fn); } // Make a vector of the same species but the given elements: @ForceInline final @Override IntMaxVector vectorFactory(int[] vec) { return new IntMaxVector(vec); } @ForceInline final @Override ByteMaxVector asByteVectorRaw() { return (ByteMaxVector) super.asByteVectorRawTemplate(); // specialize } @ForceInline final @Override AbstractVector<?> asVectorRaw(LaneType laneType) { return super.asVectorRawTemplate(laneType); // specialize } // Unary operator @ForceInline final @Override IntMaxVector uOp(FUnOp f) { return (IntMaxVector) super.uOpTemplate(f); // specialize } @ForceInline final @Override IntMaxVector uOp(VectorMask<Integer> m, FUnOp f) { return (IntMaxVector) super.uOpTemplate((IntMaxMask)m, f); // specialize } // Binary operator @ForceInline final @Override IntMaxVector bOp(Vector<Integer> v, FBinOp f) { return (IntMaxVector) super.bOpTemplate((IntMaxVector)v, f); // specialize } @ForceInline final @Override IntMaxVector bOp(Vector<Integer> v, VectorMask<Integer> m, FBinOp f) { return (IntMaxVector) super.bOpTemplate((IntMaxVector)v, (IntMaxMask)m, f); // specialize } // Ternary operator @ForceInline final @Override IntMaxVector tOp(Vector<Integer> v1, Vector<Integer> v2, FTriOp f) { return (IntMaxVector) super.tOpTemplate((IntMaxVector)v1, (IntMaxVector)v2, f); // specialize } @ForceInline final @Override IntMaxVector tOp(Vector<Integer> v1, Vector<Integer> v2, VectorMask<Integer> m, FTriOp f) { return (IntMaxVector) super.tOpTemplate((IntMaxVector)v1, (IntMaxVector)v2, (IntMaxMask)m, f); // specialize } @ForceInline final @Override int rOp(int v, FBinOp f) { return super.rOpTemplate(v, f); // specialize } @Override @ForceInline public final <F> Vector<F> convertShape(VectorOperators.Conversion<Integer,F> conv, VectorSpecies<F> rsp, int part) { return super.convertShapeTemplate(conv, rsp, part); // specialize } @Override @ForceInline public final <F> Vector<F> reinterpretShape(VectorSpecies<F> toSpecies, int part) { return super.reinterpretShapeTemplate(toSpecies, part); // specialize } // Specialized algebraic operations: // The following definition forces a specialized version of this // crucial method into the v-table of this class. A call to add() // will inline to a call to lanewise(ADD,), at which point the JIT // intrinsic will have the opcode of ADD, plus all the metadata // for this particular class, enabling it to generate precise // code. // // There is probably no benefit to the JIT to specialize the // masked or broadcast versions of the lanewise method. @Override @ForceInline public IntMaxVector lanewise(Unary op) { return (IntMaxVector) super.lanewiseTemplate(op); // specialize } @Override @ForceInline public IntMaxVector lanewise(Binary op, Vector<Integer> v) { return (IntMaxVector) super.lanewiseTemplate(op, v); // specialize } /*package-private*/ @Override @ForceInline IntMaxVector lanewiseShift(VectorOperators.Binary op, int e) { return (IntMaxVector) super.lanewiseShiftTemplate(op, e); // specialize } /*package-private*/ @Override @ForceInline public final IntMaxVector lanewise(VectorOperators.Ternary op, Vector<Integer> v1, Vector<Integer> v2) { return (IntMaxVector) super.lanewiseTemplate(op, v1, v2); // specialize } @Override @ForceInline public final IntMaxVector addIndex(int scale) { return (IntMaxVector) super.addIndexTemplate(scale); // specialize } // Type specific horizontal reductions @Override @ForceInline public final int reduceLanes(VectorOperators.Associative op) { return super.reduceLanesTemplate(op); // specialized } @Override @ForceInline public final int reduceLanes(VectorOperators.Associative op, VectorMask<Integer> m) { return super.reduceLanesTemplate(op, m); // specialized } @Override @ForceInline public final long reduceLanesToLong(VectorOperators.Associative op) { return (long) super.reduceLanesTemplate(op); // specialized } @Override @ForceInline public final long reduceLanesToLong(VectorOperators.Associative op, VectorMask<Integer> m) { return (long) super.reduceLanesTemplate(op, m); // specialized } @ForceInline public VectorShuffle<Integer> toShuffle() { return super.toShuffleTemplate(IntMaxShuffle.class); // specialize } // Specialized unary testing @Override @ForceInline public final IntMaxMask test(Test op) { return super.testTemplate(IntMaxMask.class, op); // specialize } // Specialized comparisons @Override @ForceInline public final IntMaxMask compare(Comparison op, Vector<Integer> v) { return super.compareTemplate(IntMaxMask.class, op, v); // specialize } @Override @ForceInline public final IntMaxMask compare(Comparison op, int s) { return super.compareTemplate(IntMaxMask.class, op, s); // specialize } @Override @ForceInline public final IntMaxMask compare(Comparison op, long s) { return super.compareTemplate(IntMaxMask.class, op, s); // specialize } @Override @ForceInline public IntMaxVector blend(Vector<Integer> v, VectorMask<Integer> m) { return (IntMaxVector) super.blendTemplate(IntMaxMask.class, (IntMaxVector) v, (IntMaxMask) m); // specialize } @Override @ForceInline public IntMaxVector slice(int origin, Vector<Integer> v) { return (IntMaxVector) super.sliceTemplate(origin, v); // specialize } @Override @ForceInline public IntMaxVector slice(int origin) { return (IntMaxVector) super.sliceTemplate(origin); // specialize } @Override @ForceInline public IntMaxVector unslice(int origin, Vector<Integer> w, int part) { return (IntMaxVector) super.unsliceTemplate(origin, w, part); // specialize } @Override @ForceInline public IntMaxVector unslice(int origin, Vector<Integer> w, int part, VectorMask<Integer> m) { return (IntMaxVector) super.unsliceTemplate(IntMaxMask.class, origin, w, part, (IntMaxMask) m); // specialize } @Override @ForceInline public IntMaxVector unslice(int origin) { return (IntMaxVector) super.unsliceTemplate(origin); // specialize } @Override @ForceInline public IntMaxVector rearrange(VectorShuffle<Integer> s) { return (IntMaxVector) super.rearrangeTemplate(IntMaxShuffle.class, (IntMaxShuffle) s); // specialize } @Override @ForceInline public IntMaxVector rearrange(VectorShuffle<Integer> shuffle, VectorMask<Integer> m) { return (IntMaxVector) super.rearrangeTemplate(IntMaxShuffle.class, (IntMaxShuffle) shuffle, (IntMaxMask) m); // specialize } @Override @ForceInline public IntMaxVector rearrange(VectorShuffle<Integer> s, Vector<Integer> v) { return (IntMaxVector) super.rearrangeTemplate(IntMaxShuffle.class, (IntMaxShuffle) s, (IntMaxVector) v); // specialize } @Override @ForceInline public IntMaxVector selectFrom(Vector<Integer> v) { return (IntMaxVector) super.selectFromTemplate((IntMaxVector) v); // specialize } @Override @ForceInline public IntMaxVector selectFrom(Vector<Integer> v, VectorMask<Integer> m) { return (IntMaxVector) super.selectFromTemplate((IntMaxVector) v, (IntMaxMask) m); // specialize } @ForceInline @Override public int lane(int i) { if (i < 0 || i >= VLENGTH) { throw new IllegalArgumentException("Index " + i + " must be zero or positive, and less than " + VLENGTH); } return laneHelper(i); } public int laneHelper(int i) { return (int) VectorSupport.extract( VCLASS, ETYPE, VLENGTH, this, i, (vec, ix) -> { int[] vecarr = vec.vec(); return (long)vecarr[ix]; }); } @ForceInline @Override public IntMaxVector withLane(int i, int e) { if (i < 0 || i >= VLENGTH) { throw new IllegalArgumentException("Index " + i + " must be zero or positive, and less than " + VLENGTH); } return withLaneHelper(i, e); } public IntMaxVector withLaneHelper(int i, int e) { return VectorSupport.insert( VCLASS, ETYPE, VLENGTH, this, i, (long)e, (v, ix, bits) -> { int[] res = v.vec().clone(); res[ix] = (int)bits; return v.vectorFactory(res); }); } // Mask static final class IntMaxMask extends AbstractMask<Integer> { static final int VLENGTH = VSPECIES.laneCount(); // used by the JVM static final Class<Integer> ETYPE = int.class; // used by the JVM IntMaxMask(boolean[] bits) { this(bits, 0); } IntMaxMask(boolean[] bits, int offset) { super(prepare(bits, offset)); } IntMaxMask(boolean val) { super(prepare(val)); } private static boolean[] prepare(boolean[] bits, int offset) { boolean[] newBits = new boolean[VSPECIES.laneCount()]; for (int i = 0; i < newBits.length; i++) { newBits[i] = bits[offset + i]; } return newBits; } private static boolean[] prepare(boolean val) { boolean[] bits = new boolean[VSPECIES.laneCount()]; Arrays.fill(bits, val); return bits; } @ForceInline final @Override public IntSpecies vspecies() { // ISSUE: This should probably be a @Stable // field inside AbstractMask, rather than // a megamorphic method. return VSPECIES; } @ForceInline boolean[] getBits() { return (boolean[])getPayload(); } @Override IntMaxMask uOp(MUnOp f) { boolean[] res = new boolean[vspecies().laneCount()]; boolean[] bits = getBits(); for (int i = 0; i < res.length; i++) { res[i] = f.apply(i, bits[i]); } return new IntMaxMask(res); } @Override IntMaxMask bOp(VectorMask<Integer> m, MBinOp f) { boolean[] res = new boolean[vspecies().laneCount()]; boolean[] bits = getBits(); boolean[] mbits = ((IntMaxMask)m).getBits(); for (int i = 0; i < res.length; i++) { res[i] = f.apply(i, bits[i], mbits[i]); } return new IntMaxMask(res); } @ForceInline @Override public final IntMaxVector toVector() { return (IntMaxVector) super.toVectorTemplate(); // specialize } /** * Helper function for lane-wise mask conversions. * This function kicks in after intrinsic failure. */ @ForceInline private final <E> VectorMask<E> defaultMaskCast(AbstractSpecies<E> dsp) { if (length() != dsp.laneCount()) throw new IllegalArgumentException("VectorMask length and species length differ"); boolean[] maskArray = toArray(); return dsp.maskFactory(maskArray).check(dsp); } @Override @ForceInline public <E> VectorMask<E> cast(VectorSpecies<E> dsp) { AbstractSpecies<E> species = (AbstractSpecies<E>) dsp; if (length() != species.laneCount()) throw new IllegalArgumentException("VectorMask length and species length differ"); if (VSIZE == species.vectorBitSize()) { Class<?> dtype = species.elementType(); Class<?> dmtype = species.maskType(); return VectorSupport.convert(VectorSupport.VECTOR_OP_REINTERPRET, this.getClass(), ETYPE, VLENGTH, dmtype, dtype, VLENGTH, this, species, IntMaxMask::defaultMaskCast); } return this.defaultMaskCast(species); } @Override @ForceInline public IntMaxMask eq(VectorMask<Integer> mask) { Objects.requireNonNull(mask); IntMaxMask m = (IntMaxMask)mask; return xor(m.not()); } // Unary operations @Override @ForceInline public IntMaxMask not() { return xor(maskAll(true)); } // Binary operations @Override @ForceInline public IntMaxMask and(VectorMask<Integer> mask) { Objects.requireNonNull(mask); IntMaxMask m = (IntMaxMask)mask; return VectorSupport.binaryOp(VECTOR_OP_AND, IntMaxMask.class, int.class, VLENGTH, this, m, (m1, m2) -> m1.bOp(m2, (i, a, b) -> a & b)); } @Override @ForceInline public IntMaxMask or(VectorMask<Integer> mask) { Objects.requireNonNull(mask); IntMaxMask m = (IntMaxMask)mask; return VectorSupport.binaryOp(VECTOR_OP_OR, IntMaxMask.class, int.class, VLENGTH, this, m, (m1, m2) -> m1.bOp(m2, (i, a, b) -> a | b)); } @ForceInline /* package-private */ IntMaxMask xor(VectorMask<Integer> mask) { Objects.requireNonNull(mask); IntMaxMask m = (IntMaxMask)mask; return VectorSupport.binaryOp(VECTOR_OP_XOR, IntMaxMask.class, int.class, VLENGTH, this, m, (m1, m2) -> m1.bOp(m2, (i, a, b) -> a ^ b)); } // Mask Query operations @Override @ForceInline public int trueCount() { return VectorSupport.maskReductionCoerced(VECTOR_OP_MASK_TRUECOUNT, IntMaxMask.class, int.class, VLENGTH, this, (m) -> trueCountHelper(((IntMaxMask)m).getBits())); } @Override @ForceInline public int firstTrue() { return VectorSupport.maskReductionCoerced(VECTOR_OP_MASK_FIRSTTRUE, IntMaxMask.class, int.class, VLENGTH, this, (m) -> firstTrueHelper(((IntMaxMask)m).getBits())); } @Override @ForceInline public int lastTrue() { return VectorSupport.maskReductionCoerced(VECTOR_OP_MASK_LASTTRUE, IntMaxMask.class, int.class, VLENGTH, this, (m) -> lastTrueHelper(((IntMaxMask)m).getBits())); } // Reductions @Override @ForceInline public boolean anyTrue() { return VectorSupport.test(BT_ne, IntMaxMask.class, int.class, VLENGTH, this, vspecies().maskAll(true), (m, __) -> anyTrueHelper(((IntMaxMask)m).getBits())); } @Override @ForceInline public boolean allTrue() { return VectorSupport.test(BT_overflow, IntMaxMask.class, int.class, VLENGTH, this, vspecies().maskAll(true), (m, __) -> allTrueHelper(((IntMaxMask)m).getBits())); } @ForceInline /*package-private*/ static IntMaxMask maskAll(boolean bit) { return VectorSupport.broadcastCoerced(IntMaxMask.class, int.class, VLENGTH, (bit ? -1 : 0), null, (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK)); } private static final IntMaxMask TRUE_MASK = new IntMaxMask(true); private static final IntMaxMask FALSE_MASK = new IntMaxMask(false); static boolean[] maskLowerHalf() { boolean[] a = new boolean[VLENGTH]; int len = a.length >> 1; for (int i = 0; i < len; i++) { a[i] = true; } return a; } static final IntMaxMask LOWER_HALF_TRUE_MASK = new IntMaxMask(maskLowerHalf()); } // Shuffle static final class IntMaxShuffle extends AbstractShuffle<Integer> { static final int VLENGTH = VSPECIES.laneCount(); // used by the JVM static final Class<Integer> ETYPE = int.class; // used by the JVM IntMaxShuffle(byte[] reorder) { super(VLENGTH, reorder); } public IntMaxShuffle(int[] reorder) { super(VLENGTH, reorder); } public IntMaxShuffle(int[] reorder, int i) { super(VLENGTH, reorder, i); } public IntMaxShuffle(IntUnaryOperator fn) { super(VLENGTH, fn); } @Override public IntSpecies vspecies() { return VSPECIES; } static { // There must be enough bits in the shuffle lanes to encode // VLENGTH valid indexes and VLENGTH exceptional ones. assert(VLENGTH < Byte.MAX_VALUE); assert(Byte.MIN_VALUE <= -VLENGTH); } static final IntMaxShuffle IOTA = new IntMaxShuffle(IDENTITY); @Override @ForceInline public IntMaxVector toVector() { return VectorSupport.shuffleToVector(VCLASS, ETYPE, IntMaxShuffle.class, this, VLENGTH, (s) -> ((IntMaxVector)(((AbstractShuffle<Integer>)(s)).toVectorTemplate()))); } @Override @ForceInline public <F> VectorShuffle<F> cast(VectorSpecies<F> s) { AbstractSpecies<F> species = (AbstractSpecies<F>) s; if (length() != species.laneCount()) throw new IllegalArgumentException("VectorShuffle length and species length differ"); int[] shuffleArray = toArray(); return s.shuffleFromArray(shuffleArray, 0).check(s); } @ForceInline @Override public IntMaxShuffle rearrange(VectorShuffle<Integer> shuffle) { IntMaxShuffle s = (IntMaxShuffle) shuffle; byte[] reorder1 = reorder(); byte[] reorder2 = s.reorder(); byte[] r = new byte[reorder1.length]; for (int i = 0; i < reorder1.length; i++) { int ssi = reorder2[i]; r[i] = reorder1[ssi]; // throws on exceptional index } return new IntMaxShuffle(r); } } // ================================================ // Specialized low-level memory operations. @ForceInline @Override final IntVector fromArray0(int[] a, int offset) { return super.fromArray0Template(a, offset); // specialize } @ForceInline @Override final IntVector fromByteArray0(byte[] a, int offset) { return super.fromByteArray0Template(a, offset); // specialize } @ForceInline @Override final IntVector fromByteBuffer0(ByteBuffer bb, int offset) { return super.fromByteBuffer0Template(bb, offset); // specialize } @ForceInline @Override final void intoArray0(int[] a, int offset) { super.intoArray0Template(a, offset); // specialize } @ForceInline @Override final void intoByteArray0(byte[] a, int offset) { super.intoByteArray0Template(a, offset); // specialize } // End of specialized low-level memory operations. // ================================================ }
⏎ jdk/incubator/vector/IntMaxVector.java
Or download all of them as a single archive file:
File name: jdk.incubator.vector-17.0.5-src.zip File size: 350622 bytes Release date: 2022-09-13 Download
⇒ JDK 17 jdk.internal.ed.jmod - Internal Editor Module
2023-10-04, 4056👍, 0💬
Popular Posts:
Old version of xml-apis.jar. JAR File Size and Download Location: File name: xmlParserAPIs.jar File ...
JDK 11 java.sql.rowset.jmod is the JMOD file for JDK 11 SQL Rowset module. JDK 11 SQL Rowset module ...
commons-io-1.4.jar is the JAR file for Commons IO 1.4, which is a library of utilities to assist wit...
JDK 11 jdk.aot.jmod is the JMOD file for JDK 11 Ahead-of-Time (AOT) Compiler module. JDK 11 AOT Comp...
What Is mail.jar of JavaMail 1.3? I got the JAR file from javamail-1_3.zip. mail.jar in javamail-1_3...