| /openjdk7/jdk/test/sun/nio/cs/ |
| H A D | EucJpLinux0212.java | 47 List<ByteBuffer> bbs = Arrays.asList(
52 for (ByteBuffer bb : bbs) {
|
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | lcm.cpp | 525 void Block::set_next_call( Node *n, VectorSet &next_call, Block_Array &bbs ) {
530 if( bbs[m->_idx] == this )
531 set_next_call( m, next_call, bbs );
541 void Block::needed_for_next_call(Node *this_call, VectorSet &next_call, Block_Array &bbs) { argument
546 if( bbs[m->_idx] == this && // Local-block user
554 set_next_call(call, next_call, bbs);
574 uint Block::sched_call( Matcher &matcher, Block_Array &bbs, uint node_cnt, Node_List &worklist, GrowableArray<int> &ready_cnt, MachCallNode *mcall, VectorSet &next_call ) { argument
593 needed_for_next_call(n, next_call, bbs);
598 if( bbs[m->_idx] != this ) continue;
616 bbs
910 catch_cleanup_find_cloned_def(Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) argument
998 catch_cleanup_inter_block(Node *use, Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) argument
1008 call_catch_cleanup(Block_Array &bbs, Compile* C) argument
[all...] |
| H A D | block.hpp | 287 uint sched_call(Matcher &matcher, Block_Array &bbs, uint node_cnt, Node_List &worklist, GrowableArray<int> &ready_cnt, MachCallNode *mcall, VectorSet &next_call);
291 void set_next_call( Node *n, VectorSet &next_call, Block_Array &bbs );
292 void needed_for_next_call(Node *this_call, VectorSet &next_call, Block_Array &bbs);
295 void call_catch_cleanup(Block_Array &bbs, Compile *C);
334 bool is_uncommon( Block_Array &bbs ) const;
339 void dump_pred(const Block_Array *bbs, Block* orig, outputStream* st = tty) const;
340 void dump_head( const Block_Array *bbs, outputStream* st = tty ) const;
342 void dump( const Block_Array *bbs ) const;
|
| H A D | block.cpp | 224 bool Block::is_uncommon( Block_Array &bbs ) const {
241 Block* guard = bbs[pred(i)->_idx];
288 void Block::dump_pred(const Block_Array *bbs, Block* orig, outputStream* st) const {
291 Block *p = ((*bbs)[pred(i)->_idx]);
292 p->dump_pred(bbs, orig, st);
300 void Block::dump_head( const Block_Array *bbs, outputStream* st ) const {
314 if (bbs) {
315 Block *p = (*bbs)[s->_idx];
316 p->dump_pred(bbs, p, st);
329 if( bbs
[all...] |
| H A D | gcm.cpp | 152 static void assert_dom(Block* b1, Block* b2, Node* n, Block_Array &bbs) { argument
165 Block* inb = bbs[inn->_idx];
177 static Block* find_deepest_input(Node* n, Block_Array &bbs) { argument
184 Block* inb = bbs[inn->_idx];
190 DEBUG_ONLY(assert_dom(deepb, inb, n, bbs));
316 static Block* raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) { argument
317 Block* buse = bbs[use->_idx];
332 Block* pred = bbs[buse->pred(j)->_idx];
346 Block* early, Block_Array &bbs) {
369 Block* mid_parent = bbs[ mi
345 raise_LCA_above_marks(Block* LCA, node_idx_t mark, Block* early, Block_Array &bbs) argument
387 memory_early_block(Node* load, Block* early, Block_Array &bbs) argument
[all...] |
| H A D | output.cpp | 72 Block_Array& bbs = _cfg->_bbs; local
81 bbs.map( prolog->_idx, entry );
82 bbs.map( start->_idx, NULL ); // start is no longer in any block
121 bbs.map(epilog->_idx, b);
|
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/oops/ |
| H A D | GenerateOopMap.java | 729 BasicBlock[] bbs = _basic_blocks;
734 int mbci = bbs[m]._bci;
741 return bbs[m];
743 nbci = bbs[m+1]._bci;
747 return bbs[m];
|
| /openjdk7/hotspot/src/share/vm/oops/ |
| H A D | generateOopMap.cpp | 597 BasicBlock *bbs = _basic_blocks; local
602 int mbci = bbs[m]._bci;
607 return bbs+m;
609 nbci = bbs[m+1]._bci;
613 return bbs+m;
|