/openjdk10/nashorn/test/script/basic/es6/ |
H A D | let-load-lib.js | 40 // block level function not visible outside script 42 function block() { 43 print("block function"); 47 block();
|
/openjdk10/jdk/src/java.base/share/classes/sun/security/ssl/ |
H A D | Authenticator.java | 56 private final byte[] block; field in class:Authenticator 58 // the block size of SSL v3.0: 62 // the block size of TLS v1.0 and later: 66 // the block size of DTLS v1.0 and later: 81 // the block is initialized for null MAC so that the 84 block = new byte[8]; 86 block = new byte[0]; 98 block = new byte[BLOCK_SIZE_DTLS]; 99 block[9] = protocolVersion.major; 100 block[1 [all...] |
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ir/ |
H A D | BlockStatement.java | 32 * Represents a block used as a statement. 38 private final Block block; field in class:BlockStatement 43 * @param block the block to execute 45 public BlockStatement(final Block block) { argument 46 this(block.getFirstStatementLineNumber(), block); 53 * @param block the block to execute 55 public BlockStatement(final int lineNumber, final Block block) { argument 60 BlockStatement(final BlockStatement blockStatement, final Block block) argument 129 setBlock(final Block block) argument [all...] |
/openjdk10/jaxws/src/jdk.xml.bind/share/classes/com/sun/tools/internal/xjc/generator/util/ |
H A D | LazyBlockReference.java | 31 * Lazy block reference. 38 private JBlock block = null; field in class:LazyBlockReference 41 * Called when a block needs to be created. 47 if(!create) return block; 48 if(block==null) 49 block = create(); 50 return block;
|
H A D | ExistingBlockReference.java | 36 private final JBlock block; field in class:ExistingBlockReference 39 this.block = _block; 43 return block;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.common/src/org/graalvm/compiler/core/common/cfg/ |
H A D | CFGVerifier.java | 32 for (T block : cfg.getBlocks()) { 33 assert block.getId() >= 0; 34 assert cfg.getBlocks()[block.getId()] == block; 36 for (T pred : block.getPredecessors()) { 37 assert Arrays.asList(pred.getSuccessors()).contains(block); 38 assert pred.getId() < block.getId() || pred.isLoopEnd(); 41 for (T sux : block.getSuccessors()) { 42 assert Arrays.asList(sux.getPredecessors()).contains(block); 43 assert sux.getId() > block [all...] |
H A D | BlockMap.java | 34 public T get(AbstractBlockBase<?> block) { argument 35 return data[block.getId()]; 38 public void put(AbstractBlockBase<?> block, T value) { argument 39 data[block.getId()] = value;
|
H A D | DominatorOptimizationProblem.java | 35 * @param <E> An enum that describes the flags that can be associated with a block. 36 * @param <C> An arbitrary cost type that is associated with a block. It is intended to carry 55 AbstractBlockBase<?> block = blocks[i]; 56 if (i != block.getId()) { 57 assert false : String.format("Id index mismatch @ %d vs. %s.getId()==%d", i, block, block.getId()); 69 AbstractBlockBase<?> block = blocks[id]; 70 assert block.getId() == id : "wrong block-to-id mapping"; 71 return block; 77 set(E flag, AbstractBlockBase<?> block) argument 89 get(E flag, AbstractBlockBase<?> block) argument 104 getCost(AbstractBlockBase<?> block) argument 112 setCost(AbstractBlockBase<?> block, C cost) argument 120 setDominatorPath(E flag, AbstractBlockBase<?> block) argument 135 getFlagsForBlock(AbstractBlockBase<?> block) argument [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.graphio/src/org/graalvm/graphio/ |
H A D | GraphBlocks.java | 31 * @param <B> the type that represents the block 44 * Unique id of a block. 46 * @param block the block 47 * @return the id of the block 49 int blockId(B block); argument 51 Collection<? extends N> blockNodes(G info, B block); argument 53 Collection<? extends B> blockSuccessors(B block); argument
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/constopt/ |
H A D | ConstantTreeAnalyzer.java | 66 * @param startBlock The start block of the dominator subtree. 73 AbstractBlockBase<?> block = worklist.pollLast(); 74 try (Indent i = debug.logAndIndent(DebugContext.VERBOSE_LEVEL, "analyze: %s", block)) { 75 assert block != null : "worklist is empty!"; 76 assert isMarked(block) : "Block not part of the dominator tree: " + block; 78 if (isLeafBlock(block)) { 79 debug.log(DebugContext.VERBOSE_LEVEL, "leaf block"); 80 leafCost(block); 84 if (!visited.get(block 109 process(AbstractBlockBase<?> block) argument 162 filteredPush(DebugContext debug, Deque<AbstractBlockBase<?>> worklist, AbstractBlockBase<?> block) argument 169 leafCost(AbstractBlockBase<?> block) argument 174 isMarked(AbstractBlockBase<?> block) argument 178 isLeafBlock(AbstractBlockBase<?> block) argument [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/ |
H A D | ControlFlowOptimizer.java | 62 * Checks whether a block can be deleted. Only blocks with exactly one successor and an 65 * @param block the block checked for deletion 66 * @return whether the block can be deleted 68 private boolean canDeleteBlock(AbstractBlockBase<?> block) { argument 69 if (block == null || block.getSuccessorCount() != 1 || block.getPredecessorCount() == 0 || block.getSuccessors()[0] == block) { 85 alignBlock(AbstractBlockBase<?> block) argument [all...] |
H A D | LabelRef.java | 34 * instructions is error prone. Therefore, we represent an edge to block B from block A via the 42 private final AbstractBlockBase<?> block; field in class:LabelRef 46 * Returns a new reference to a successor of the given block. 48 * @param block The base block that contains the successor list. 52 public static LabelRef forSuccessor(final LIR lir, final AbstractBlockBase<?> block, final int suxIndex) { argument 53 return new LabelRef(lir, block, suxIndex); 57 * Returns a new reference to a successor of the given block. 59 * @param block Th 62 LabelRef(final LIR lir, final AbstractBlockBase<?> block, final int suxIndex) argument [all...] |
H A D | LIR.java | 57 * Map from {@linkplain AbstractBlockBase block} to {@linkplain LIRInstruction}s. Note that we 106 public ArrayList<LIRInstruction> getLIRforBlock(AbstractBlockBase<?> block) { argument 107 return lirInstructions.get(block); 110 public void setLIRforBlock(AbstractBlockBase<?> block, ArrayList<LIRInstruction> list) { argument 111 assert getLIRforBlock(block) == null : "lir instruction list should only be initialized once"; 112 lirInstructions.put(block, list); 141 * Gets the next non-{@code null} block in a list. 144 * @param blockIndex index of the current block 145 * @return the next block in the list that is none {@code null} or {@code null} if there is no 146 * such block 184 verifyBlock(LIR lir, AbstractBlockBase<?> block) argument [all...] |
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/utils/ |
H A D | SuballocatedIntVector.java | 2 * reserved comment block 77 * block size is currently 2K, which may be overkill for 86 * Construct a IntVector, using the given block size and number 90 * @param blocksize Size of block to allocate 109 /** Construct a IntVector, using the given block size and 112 * @param blocksize Size of block to allocate 172 int[] block=m_map[index]; 173 if(null==block) 174 block=m_map[index]=new int[m_blocksize]; 175 block[offse [all...] |
H A D | SuballocatedByteVector.java | 2 * reserved comment block 64 * block size is very small, for small lists. 72 * Construct a ByteVector, using the given block size. 74 * @param blocksize Size of block to allocate 85 * Construct a ByteVector, using the given block size. 87 * @param blocksize Size of block to allocate 139 byte[] block=m_map[index]; 140 if(null==block) 141 block=m_map[index]=new byte[m_blocksize]; 142 block[offse [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/trace/ |
H A D | GlobalLivenessAnalysisPhase.java | 71 * Bit map specifying which operands are live upon entry to this block. These are values 72 * used in this block or any of its successors where such value are not defined in this 73 * block. The bit index of an operand is its {@linkplain #operandNumber operand number}. 78 * Bit map specifying which operands are live upon exit from this block. These are values 79 * used in a successor block that are either defined in this block or were live upon entry 80 * to this block. The bit index of an operand is its {@linkplain #operandNumber operand 103 private BitSet getLiveIn(final AbstractBlockBase<?> block) { argument 104 return liveIns[block.getId()]; 107 private BitSet getLiveOut(final AbstractBlockBase<?> block) { argument 111 setLiveIn(final AbstractBlockBase<?> block, final BitSet liveIn) argument 115 setLiveOut(final AbstractBlockBase<?> block, final BitSet liveOut) argument 204 mergeLiveSets(final AbstractBlockBase<?> block) argument 274 buildIncoming(AbstractBlockBase<?> block) argument 303 buildOutgoing(AbstractBlockBase<?> block) argument [all...] |
H A D | GlobalLivenessInfo.java | 42 * Stores live in/live out variables and locations for each basic block. 46 * <em>control-merge</em>. In other words the live sets at the end of the source block and the 47 * beginning of the target block of an edge are the same. 66 public void setIncoming(AbstractBlockBase<?> block, int[] varsIn) { argument 67 assert info.blockToVarIn[block.getId()] == null; 69 assert storesIncoming(block) || info.blockToVarOut[block.getPredecessors()[0].getId()] == varsIn; 70 info.blockToVarIn[block.getId()] = varsIn; 73 public void setOutgoing(AbstractBlockBase<?> block, int[] varsOut) { argument 74 assert info.blockToVarOut[block 114 getBlockOut(AbstractBlockBase<?> block) argument 118 getBlockIn(AbstractBlockBase<?> block) argument 122 setInLocations(AbstractBlockBase<?> block, Value[] values) argument 126 setOutLocations(AbstractBlockBase<?> block, Value[] values) argument 130 getInLocation(AbstractBlockBase<?> block) argument 134 getOutLocation(AbstractBlockBase<?> block) argument 138 storesIncoming(AbstractBlockBase<?> block) argument 143 storesOutgoing(AbstractBlockBase<?> block) argument 169 verifyBlock(AbstractBlockBase<?> block, LIR lir) argument [all...] |
H A D | TraceUtil.java | 39 public static AbstractBlockBase<?> getBestTraceInterPredecessor(TraceBuilderResult traceResult, AbstractBlockBase<?> block) { argument 41 int bestTraceId = traceResult.getTraceForBlock(block).getId(); 42 for (AbstractBlockBase<?> pred : block.getPredecessors()) { 73 * Merge blocks are in general not trivial block because variables defined by a PHI 78 * merge block should also contain one of the predecessors. For non-standard trace 79 * builders (e.g. the single block trace builder) this is not the true, though. 90 public static boolean hasInterTracePredecessor(TraceBuilderResult result, Trace trace, AbstractBlockBase<?> block) { argument 91 assert result.getTraceForBlock(block).equals(trace); 92 if (block.getPredecessorCount() == 0) { 93 // start block 102 hasInterTraceSuccessor(TraceBuilderResult result, Trace trace, AbstractBlockBase<?> block) argument [all...] |
/openjdk10/hotspot/src/share/vm/gc/parallel/ |
H A D | objectStartArray.inline.hpp | 31 // a given block. The blocks contain the offset of the last 32 // object in that block. Scroll backwards by one, and the first 33 // object hit should be at the beginning of the block 36 jbyte* block = block_for_addr(addr); local 37 HeapWord* scroll_forward = offset_addr_for_block(block--); 39 scroll_forward = offset_addr_for_block(block--);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/gen/ |
H A D | BlockValueMap.java | 31 void accessOperand(Value operand, AbstractBlockBase<?> block); argument 33 void defineOperand(Value operand, AbstractBlockBase<?> block); argument
|
/openjdk10/jdk/test/java/lang/ref/SoftReference/ |
H A D | Pin.java | 44 byte[] block; 51 block = new byte[BLOCK_SIZE]; 52 SoftReference ref = new SoftReference(block); 55 block = null; 64 block = (byte[]) blocks[i].get(); 66 block = null; 86 block = (byte[]) blocks[i].get(); 87 if (block == null) {
|
/openjdk10/hotspot/src/share/vm/c1/ |
H A D | c1_CFGPrinter.cpp | 129 void CFGPrinterOutput::print_state(BlockBegin* block) { argument 134 ValueStack* state = block->state(); 144 ip.print_phi(index, value, block); 156 ip.print_phi(index, value, block); 170 ip.print_phi(index, value, block); 208 void CFGPrinterOutput::print_HIR(BlockBegin* block) { argument 211 Value cur = block->next(); 220 void CFGPrinterOutput::print_LIR(BlockBegin* block) { argument 223 for (int i = 0; i < block->lir()->length(); i++) { 224 block 232 print_block(BlockBegin* block) argument [all...] |
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/api/tree/ |
H A D | CatchTreeImpl.java | 32 private final BlockTree block; field in class:CatchTreeImpl 37 final BlockTree block, 41 this.block = block; 57 return block; 35 CatchTreeImpl(final CatchNode node, final ExpressionTree param, final BlockTree block, final ExpressionTree condition) argument
|
H A D | TryTreeImpl.java | 32 private final BlockTree block; field in class:TryTreeImpl 36 final BlockTree block, 40 this.block = block; 52 return block; 35 TryTreeImpl(final TryNode node, final BlockTree block, final List<? extends CatchTree> catches, final BlockTree finallyBlock) argument
|
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 45 public InputBlock block; field in class:ServerCompilerScheduler.Node 87 InputBlock block = graph.addBlock(Integer.toString(blockCount)); 88 blocks.add(block); 90 rootBlock = block; 93 parent.block = block; 96 proj.block = block; 112 if (p.block == null) { 113 p.block 345 InputBlock block; field in class:ServerCompilerScheduler.BlockIntermediate [all...] |