Searched refs:Block (Results 1 - 25 of 75) sorted by relevance

123

/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/dtd/
H A DTerm.java34 abstract void normalize( List<Block> r, boolean optional );
36 abstract void addAllElements(Block b);
48 void normalize(List<Block> r, boolean optional) {
51 void addAllElements(Block b) {
H A DBlock.java34 final class Block { class
46 Block(boolean optional, boolean repeated) { method in class:Block
H A DOccurence.java62 void normalize(List<Block> r, boolean optional) {
64 Block b = new Block(isOptional||optional,true);
72 void addAllElements(Block b) {
H A DModelGroup.java46 void normalize(List<Block> r, boolean optional) {
53 Block b = new Block(isOptional()||optional,isRepeated());
60 void addAllElements(Block b) {
H A DElement.java103 private final List<Block> normalizedBlocks = new ArrayList<Block>();
123 void normalize(List<Block> r, boolean optional) {
124 Block o = new Block(optional,false);
129 void addAllElements(Block b) {
152 for( Block b : normalizedBlocks ) {
248 List<Block> n = new ArrayList<Block>();
256 for( Block
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.hpp35 class Block;
63 IndexSet *getset( Block *p );
65 void freeset( const Block *p );
66 void add_liveout( Block *p, uint r, VectorSet &first_pass );
67 void add_liveout( Block *p, IndexSet *lo, VectorSet &first_pass );
78 IndexSet *live( const Block * b ) { return &_live[b->_pre_order-1]; }
81 void dump( const Block *b ) const;
H A Dblock.hpp34 class Block;
44 // Abstractly provides an infinite array of Block*'s, initialized to NULL.
52 Block **_blocks;
60 _blocks = NEW_ARENA_ARRAY( a, Block *, OptoBlockListSize );
65 Block *lookup( uint i ) const // Lookup, or NULL for not mapped
66 { return (i<Max()) ? _blocks[i] : (Block*)NULL; }
67 Block *operator[] ( uint i ) const // Lookup, or assert for not mapped
69 // Extend the mapping: index i maps to Block *n.
70 void map( uint i, Block *n ) { if( i>=Max() ) grow(i); _blocks[i] = n; }
80 void push( Block *
107 class Block : public CFGElement { class in inherits:CFGElement
240 Block( Arena *a, Node *headnode ) function in class:Block
[all...]
H A Dcoalesce.hpp52 virtual void coalesce( Block *b ) = 0;
80 virtual void coalesce( Block *b );
86 void insert_copy_with_overlap( Block *b, Node *copy, uint dst_name, uint src_name );
104 virtual void coalesce( Block *b );
107 bool copy_copy( Node *dst_copy, Node *src_copy, Block *b, uint bindex );
109 void union_helper( Node *lr1_node, Node *lr2_node, uint lr1, uint lr2, Node *src_def, Node *dst_copy, Node *src_copy, Block *b, uint bindex );
111 uint compute_separating_interferences(Node *dst_copy, Node *src_copy, Block *b, uint bindex, RegMask &rm, uint rm_size, uint reg_degree, uint lr1, uint lr2);
H A Doutput.hpp51 class Block;
180 void ComputeLocalLatenciesForward(const Block *bb);
183 void ComputeRegisterAntidependencies(Block *bb);
185 void verify_good_schedule( Block *b, const char *msg );
186 void anti_do_def( Block *b, Node *def, OptoReg::Name def_reg, int is_def );
187 void anti_do_use( Block *b, Node *use, OptoReg::Name use_reg );
190 void AddNodeToBundle(Node *n, const Block *bb);
197 void ComputeUseCount(const Block *bb);
206 void DecrementUseCounts(Node *n, const Block *bb);
H A Dblock.cpp48 _blocks = (Block**)_arena->Amalloc( _size * sizeof(Block*) );
53 _blocks = (Block**)_arena->Arealloc( _blocks, old*sizeof(Block*),_size*sizeof(Block*));
54 Copy::zero_to_bytes( &_blocks[old], (_size-old)*sizeof(Block*) );
60 Copy::conjoint_words_to_lower((HeapWord*)&_blocks[i+1], (HeapWord*)&_blocks[i], ((_cnt-i-1)*sizeof(Block*)));
64 void Block_List::insert(uint i, Block *b) {
66 Copy::conjoint_words_to_higher((HeapWord*)&_blocks[i], (HeapWord*)&_blocks[i+1], ((_cnt-i-1)*sizeof(Block*)));
81 uint Block
[all...]
H A Dparse.hpp151 class Block { class in class:Parse
153 ciTypeFlow::Block* _flow;
165 Block** _successors;
168 // Block() : _live_locals((uintptr_t*)NULL,0) { ShouldNotReachHere(); }
169 Block() : _live_locals(NULL,0) { ShouldNotReachHere(); } function in class:Parse::Block
178 ciTypeFlow::Block* flow() const { return _flow; }
195 void mark_merged_backedge(Block* pred) {
209 Block* successor_at(int i) const {
213 Block* successor_for_bci(int bci);
222 bool is_SEL_backedge(Block* pre
[all...]
H A Dgcm.cpp67 void PhaseCFG::schedule_node_into_block( Node *n, Block *b ) {
78 Block* buse = _bbs[use->_idx];
100 Block *pb = _bbs[in0->_idx]; // Block-projection already has basic block
137 Block *b = _bbs[input->_idx]; // Basic block of controlling input
152 static void assert_dom(Block* b1, Block* b2, Node* n, Block_Array &bbs) {
155 Block* tmp = b2;
165 Block* inb = bbs[inn->_idx];
177 static Block* find_deepest_inpu
[all...]
H A Dchaitin.hpp348 uint split_DEF( Node *def, Block *b, int loc, uint max, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx );
349 uint split_USE( Node *def, Block *b, Node *use, uint useidx, uint max, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx );
350 int clone_projs( Block *b, uint idx, Node *con, Node *copy, uint &maxlrg );
351 Node *split_Rematerialize(Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits,
354 bool prompt_use( Block *b, uint lidx );
359 void insert_proj( Block *b, uint i, Node *spill, uint maxlrg );
361 bool is_high_pressure( Block *b, LRG *lrg, uint insidx );
365 Block **_blks; // Array of blocks sorted by frequency for coalescing
490 Block *current_block, Node_List& value, Node_List& regnd ) {
497 int yank_if_dead( Node *old, Block *current_bloc
[all...]
H A Dlcm.cpp61 void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons) {
76 Block* not_null_block; // this one goes with the proj
77 Block* null_block;
86 while (null_block->is_Empty() == Block::empty_with_goto) {
237 Block *cb = cfg->_bbs[mach->_idx];
261 // Block of memory-op input
262 Block *inb = cfg->_bbs[mach->in(j)->_idx];
263 Block *b = this; // Start from nul check
272 Block *mb = cfg->_bbs[mach->_idx];
276 Block *
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/model/
H A DMessage.java46 public void addBodyBlock(Block b) {
52 b.setLocation(Block.BODY);
55 public Iterator<Block> getBodyBlocks() {
64 public Map<QName, Block> getBodyBlocksMap() {
69 public void setBodyBlocksMap(Map<QName, Block> m) {
80 Block bodyBlock = (Block) iter.next();
88 public void addHeaderBlock(Block b) {
94 b.setLocation(Block.HEADER);
97 public Iterator<Block> getHeaderBlock
[all...]
H A DExtendedModelVisitor.java55 Block block = (Block) iter4.next();
61 Block block = (Block) iter4.next();
79 Block block = (Block) iter4.next();
85 Block block = (Block) iter4.next();
134 protected void visitBodyBlock(Block block) throws Exception {}
135 protected void visitHeaderBlock(Block bloc
[all...]
H A DBlock.java38 public class Block extends ModelObject { class in inherits:ModelObject
45 public Block(QName name, AbstractType type, Entity entity) { method in class:Block
H A DModelVisitor.java40 public void visit(Block block) throws Exception;
H A DFault.java63 public Block getBlock() {
67 public void setBlock(Block b) {
161 private Block block;
H A DParameter.java93 public Block getBlock() {
97 public void setBlock(Block d) {
124 private Block block;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DBlock.java36 public class Block implements Cluster { class in inherits:Cluster
42 public Block(InputBlock inputBlock, Diagram diagram) { method in class:Block
56 Set<Block> succs = new HashSet<Block>();
64 Set<Block> succs = new HashSet<Block>();
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DBlock_Array.java61 public Block at(int i) {
62 return new Block(blocksField.getValue(getAddress()).getAddressAt(i * (int)VM.getVM().getAddressSize()));
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp59 class Block;
510 Block* _pred;
512 Block* _succ;
515 SuccIter(Block* pred) : _pred(pred), _index(-1), _succ(NULL) { next(); }
517 Block* pred() { return _pred; } // Return predecessor
519 Block* succ() { return _succ; } // Return current successor
521 void set_succ(Block* succ); // Update current successor
526 class Block : public ResourceObj { class in class:ciTypeFlow
529 GrowableArray<Block*>* _exceptions;
531 GrowableArray<Block*>* _successor
[all...]
H A DciTypeFlow.cpp371 Block* non_osr_block = non_osr_flow->existing_block_at(start_bci(), jsrs);
384 Block* block = block_at(non_osr_start, jsrs);
1565 void ciTypeFlow::SuccIter::set_succ(Block* succ) {
1575 // ciTypeFlow::Block
1580 // ciTypeFlow::Block::Block
1581 ciTypeFlow::Block::Block(ciTypeFlow* outer, function in class:ciTypeFlow::Block
1611 // ciTypeFlow::Block::df_init
1612 void ciTypeFlow::Block
[all...]
/openjdk7/hotspot/src/os/windows/vm/
H A Dchaitin_windows.cpp36 Block *block = _cfg._blocks[block_num];
61 Block *block = _cfg._blocks[block_num];

Completed in 90 milliseconds

123