Searched refs:blocks (Results 1 - 25 of 32) sorted by relevance

12

/openjdk7/jdk/src/share/demo/jvmti/hprof/
H A Dhprof_blocks.c41 /* Allocations from large blocks, no individual free's */
47 * to have space allocated via larger blocks of space.
48 * The only free allowed is of all the blocks and all the elements.
71 add_block(Blocks *blocks, int nbytes) argument
77 HPROF_ASSERT(blocks!=NULL);
80 header_size = real_size(blocks->alignment, sizeof(BlockHeader));
81 block_size = blocks->elem_size*blocks->population;
83 block_size = real_size(blocks->alignment, nbytes);
91 if ( blocks
104 Blocks *blocks; local
121 blocks_alloc(Blocks *blocks, int nbytes) argument
148 blocks_term(Blocks *blocks) argument
[all...]
H A Dhprof_blocks.h59 void * blocks_alloc(Blocks *blocks, int nbytes);
60 void blocks_term(Blocks *blocks);
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/common/
H A DBitFile.java43 boolean blocks = false; field in class:BitFile
47 * @param blocks GIF LZW requires block counts for output data
49 public BitFile(ImageOutputStream output, boolean blocks) { argument
51 this.blocks = blocks;
60 if (blocks) {
76 if (blocks) {
88 if (blocks) { // GIF
100 if (blocks) { // GIF
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_CFGPrinter.hpp47 static void print_cfg(BlockList* blocks, const char* name, bool do_print_HIR, bool do_print_LIR);
48 static void print_cfg(IR* blocks, const char* name, bool do_print_HIR, bool do_print_LIR);
H A Dc1_CFGPrinter.cpp74 void print_cfg(BlockList* blocks, const char* name);
75 void print_cfg(IR* blocks, const char* name);
91 void CFGPrinter::print_cfg(BlockList* blocks, const char* name, bool do_print_HIR, bool do_print_LIR) { argument
93 output()->print_cfg(blocks, name);
96 void CFGPrinter::print_cfg(IR* blocks, const char* name, bool do_print_HIR, bool do_print_LIR) { argument
98 output()->print_cfg(blocks, name);
346 void CFGPrinterOutput::print_cfg(BlockList* blocks, const char* name) { argument
351 blocks->iterate_forward(&print_block);
357 void CFGPrinterOutput::print_cfg(IR* blocks, const char* name) { argument
362 blocks
[all...]
H A Dc1_ValueMap.cpp353 BlockList* blocks = ir->linear_scan_order(); local
354 int num_blocks = blocks->length();
356 BlockBegin* start_block = blocks->at(0);
364 BlockBegin* block = blocks->at(i);
H A Dc1_IR.cpp280 BlockPairList blocks; member in class:CriticalEdgeFinder
292 blocks.append(new BlockPair(bb, sux));
300 blocks.sort(sort_pairs);
301 for (int i = 0; i < blocks.length(); i++) {
302 BlockPair* pair = blocks.at(i);
330 // start of basic blocks are not added to the instruction list
399 static void compute(BlockList* blocks) { argument
401 blocks->iterate_backward(&ucc);
419 int _num_blocks; // total number of blocks (smaller than _max_block_id)
423 BlockList* _linear_scan_order; // the resulting list of blocks i
[all...]
H A Dc1_Optimizer.cpp174 // true and false blocks can't have phis
346 // merge the two blocks
470 // merge blocks if possible
547 BlockList* _work_list; // Basic blocks to visit
567 ValueSetList _block_states; // BlockBegin null-check states for all processed blocks
641 // the instruction. We make multiple passes over some basic blocks
820 // visiting instructions which are references in other blocks or
1148 BlockList blocks(nblocks);
1151 blocks.push(ir()->start());
1153 for (int i = 0; i < blocks
[all...]
/openjdk7/jdk/test/java/lang/ref/SoftReference/
H A DPin.java42 SoftReference[] blocks = new SoftReference[NUM_BLOCKS];
47 " SoftReferences to blocks of " +
53 blocks[i] = ref;
64 block = (byte[]) blocks[i].get();
85 block = (byte[]) blocks[i].get();
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java62 private Vector<InputBlock> blocks; field in class:ServerCompilerScheduler
75 blocks = new Vector<InputBlock>();
97 blocks.add(block);
178 for (InputBlock b : blocks) {
214 return blocks;
345 commonDominator = new InputBlock[this.blocks.size()][this.blocks.size()];
346 for (int i = 0; i < blocks.size(); i++) {
347 for (int j = 0; j < blocks.size(); j++) {
354 InputBlock ba = blocks
494 compress(int index, Vector<BlockIntermediate> blocks) argument
517 eval(int index, Vector<BlockIntermediate> blocks) argument
527 link(int index1, int index2, Vector<BlockIntermediate> blocks) argument
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DPhaseCFG.java63 Block_List blocks = new Block_List(getAddress().addOffsetTo(blocksField.getOffset()));
66 blocks.at(i).dump(out);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/
H A DInputGraph.java43 private HashMap<String, InputBlock> blocks; field in class:InputGraph
56 blocks.clear();
65 blocks = new HashMap<String, InputBlock>();
169 return Collections.unmodifiableCollection(blocks.values());
221 blocks.put(b.getName(), b);
228 for (InputBlock b : blocks.values()) {
238 return blocks.get(s);
/openjdk7/jdk/test/com/sun/management/OperatingSystemMXBean/
H A DTestTotalSwap.sh68 for i in `/usr/sbin/swap -l | awk '{print $4}' | grep -v blocks`
70 # swap -l returns size in blocks of 512 bytes.
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/cdbg/basic/
H A DBasicCDebugInfoDataBase.java61 // List of blocks in increasing order by starting address. These can
63 private List blocks; field in class:BasicCDebugInfoDataBase
93 blocks = new ArrayList();
131 for (Iterator iter = blocks.iterator(); iter.hasNext(); ) {
138 // Sort blocks in ascending order of starting address (but do not
139 // change ordering among blocks with the same starting address)
140 Collections.sort(blocks, new Comparator() {
215 blocks (for example, the parent scope) should be made with
223 blocks.add(block);
231 return searchBlocks(pc, 0, blocks
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/model/
H A DMessage.java220 Set<Block> blocks = new HashSet<Block>();
221 blocks.addAll(_bodyBlocks.values());
222 blocks.addAll(_headerBlocks.values());
223 blocks.addAll(_attachmentBlocks.values());
224 return blocks;
H A DOperation.java157 Set<Block> blocks = new HashSet<Block>();
161 blocks.add(f.getBlock());
163 return blocks;
/openjdk7/jdk/src/share/classes/sun/font/
H A DFontResolver.java66 // blocks[c>>SHIFT][c&MASK]
74 private int[][] blocks = new int[1<<SHIFT][]; field in class:FontResolver
166 int[] block = blocks[blockIndex];
169 blocks[blockIndex] = block;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DDiagram.java50 private Map<InputBlock, Block> blocks; field in class:Diagram
62 blocks = new HashMap<InputBlock, Block>();
68 return blocks.get(b);
81 blocks.clear();
84 blocks.put(b, curBlock);
93 return Collections.unmodifiableCollection(blocks.values());
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DpromotionInfo.cpp251 // Count the number of blocks and slots in the free pool
253 size_t blocks = 0; local
262 blocks++;
266 blocks++;
269 worker_id, blocks, slots);
283 // this linked list of blocks holding displaced headers.
356 st->print_cr(" " SIZE_FORMAT " header spooling blocks", i);
/openjdk7/hotspot/src/share/vm/runtime/
H A DjniHandles.cpp309 tty->print_cr("JNIHandleBlock " INTPTR_FORMAT " allocated (%d total blocks)",
314 // Link new block to list of all allocated blocks
356 // Return blocks to free list
372 // As a sanity check we release blocks pointed to by the pop_frame_link.
382 // Iterate over chain of blocks, followed by chains linked through the
388 "only blocks first in chain should have pop frame link set");
412 "blocks holding weak global JNI handles should not have pop frame link set");
448 // entering a native function. If we have any following blocks they are
506 int blocks = 0; local
519 blocks
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ControlFlow/src/com/sun/hotspot/igv/controlflow/
H A DControlFlowScene.java100 ArrayList<InputBlock> blocks = new ArrayList<InputBlock>(this.getNodes());
101 for (InputBlock b : blocks) {
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp590 // 1) C2 uses do_null_assert() and continues compilation for later blocks
1607 assert(!outer->have_block_count(), "must not have mapped blocks yet");
1879 // Don't print 'dummy' blocks (i.e. blocks with limit() '-1')
1972 _block_map = NULL; // until all blocks are seen
2293 // basic blocks.
2650 // Too many basic blocks. Bail out.
2655 record_failure("too many basic blocks");
2748 assert (max_block == _next_pre_order, "no new blocks");
2756 // Create the block map, which indexes blocks i
2802 GrowableArray<Block*>* blocks = _idx_to_blocklist[ciBlockIndex]; local
2836 GrowableArray<Block*>* blocks = _idx_to_blocklist[ciBlockIndex]; local
2920 GrowableArray<Block*>* blocks = _idx_to_blocklist[blk->index()]; local
[all...]
H A DciMethodData.cpp267 void ciMethodData::set_compilation_stats(short loops, short blocks) { argument
272 mdo->set_num_blocks(blocks);
H A DciMethodData.hpp251 // Also set the numer of loops and blocks in the method.
253 void set_compilation_stats(short loops, short blocks);
/openjdk7/jdk/src/share/classes/com/sun/media/sound/
H A DDLSInstrument.java395 List<ModelConnectionBlock> blocks = performer.getConnectionBlocks();
399 blocks.add(p);

Completed in 106 milliseconds

12