/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/common/ |
H A D | BitFile.java | 43 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/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_blocks.c | 41 /* 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...] |
/openjdk7/jdk/src/share/classes/sun/font/ |
H A D | FontResolver.java | 66 // 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/vm/gc_implementation/concurrentMarkSweep/ |
H A D | promotionInfo.cpp | 251 // 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/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/ |
H A D | Diagram.java | 50 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/agent/src/share/classes/sun/jvm/hotspot/debugger/cdbg/basic/ |
H A D | BasicCDebugInfoDataBase.java | 61 // 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/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | InputGraph.java | 43 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/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 62 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/src/share/vm/c1/ |
H A D | c1_CFGPrinter.cpp | 74 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 D | c1_ValueMap.cpp | 353 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 D | c1_IR.cpp | 280 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 D | c1_LIR.cpp | 1483 void print_LIR(BlockList* blocks) { argument 1620 void print_LIR(BlockList* blocks) { argument 1623 for (i = 0; i < blocks->length(); i++) { 1624 BlockBegin* bb = blocks->at(i);
|
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciMethodData.cpp | 267 void ciMethodData::set_compilation_stats(short loops, short blocks) { argument 272 mdo->set_num_blocks(blocks);
|
H A D | ciTypeFlow.cpp | 590 // 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...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | jniHandles.cpp | 309 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/vm/memory/ |
H A D | space.cpp | 592 // last allocated block yet there may be still be blocks 985 int blocks = 0; local 995 if (blocks == BLOCK_SAMPLE_INTERVAL) { 998 blocks = 0; 1000 blocks++;
|
/openjdk7/jdk/src/share/classes/java/lang/ |
H A D | Character.java | 640 * A family of character subsets representing the character blocks in the 641 * Unicode specification. Character blocks generally define characters 2713 private static final UnicodeBlock[] blocks = { field in class:Character.UnicodeBlock 3014 return blocks[current]; 3020 * Blocks-<version>.txt defines blocks for a particular
|
/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | gtk2_interface.h | 570 guint blocks; member in struct:_GtkProgressBar
|