/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegion.hpp | 62 (_hr_)->bottom(), (_hr_)->top(), (_hr_)->end() 87 HeapWord* bottom, HeapWord* top, 94 HeapWord* bottom, HeapWord* top, 96 HeapRegionDCTOC::walk_mem_region_with_cl(mr, bottom, top, 100 // Get the actual top of the area on which the closure will 101 // operate, given where the top is assumed to be (the end of the 103 // at the top is assumed to start. For example, an object may 104 // start at the top but actually extend past the assumed top, 105 // in which case the top become 93 walk_mem_region_with_cl(MemRegion mr, HeapWord* bottom, HeapWord* top, FilteringClosure* cl) argument 106 get_actual_top(HeapWord* top, HeapWord* top_obj) argument 116 walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top) argument [all...] |
H A D | concurrentMark.cpp | 1050 const HeapWord* end = hr->top(); 1340 HeapWord* top = hr->top(); local 1341 if (ntams < top) { 1343 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(top); 1345 // Note: if we're looking at the last region in heap - top 1349 if (_g1h->is_in_g1_reserved(top) && !_ct_bs->is_card_aligned(top)) { 1469 BitMap::idx_t end_idx = _cm->card_bitmap_index_for(hr->top()); 1571 // Sets the bits corresponding to the interval [NTAMS, top] 1597 HeapWord* top = hr->top(); local [all...] |
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | dump.cpp | 168 MoveSymbols(char* top, char* end) : argument 169 _start(top), _end(end), _top(top), _count(0) { } 720 oop* top; member in class:WriteClosure 724 if ((char*)top + sizeof(oop) > end) { 732 top = (oop*)md_top; 736 char* get_top() { return (char*)top; } 744 *top = obj; 745 ++top; 752 *top [all...] |
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | generateOopMap.cpp | 69 // '#' top, result of conflict merge 288 CellTypeState CellTypeState::top = CellTypeState::make_top(); member in class:CellTypeState 685 // If the top bit is set, we don't need to do any more work. 688 "only addresses and references have non-top info"); 691 // The two values being merged are different. Raise to top. 1804 // on the top of our monitor stack. This causes a monitor 2484 // Return true iff the top of the operand stack holds a return address at
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | callnode.cpp | 919 // If current local idx is top then local idx - 1 could 920 // be a long/double that needs to be killed since top could 924 // set other (low index) half to top 1018 Node* top = Compile::current()->top(); local 1020 ins_req(monoff, top); 1038 Node* top = Compile::current()->top(); local 1039 add_req(top); 1040 add_req(top); [all...] |
H A D | cfgnode.cpp | 97 r->set_req(j, phase->C->top()); 109 region->set_req(i, phase->C->top()); 369 // cmpP with 1 top input 381 // the Region stays in the graph. The top input from the cmpP is 525 Node *top = phase->C->top(); local 536 // Eagerly replace phis with top to avoid phis copies generation. 537 igvn->replace_node(n, top); 566 // Also set other user's input to top. 567 parent_ctrl = phase->C->top(); [all...] |
H A D | graphKit.hpp | 96 Node* top() const { return C->top(); } function in class:GraphKit 149 void clean_stack(int from_sp); // clear garbage beyond from_sp to top 187 // Tell if _map is NULL, or control is top. 379 // If never_see_null, use an uncommon trap (*null_control sees a top). 403 push(top()); // the halfword is merely a placeholder 408 assert(local(i+1) == top(), ""); 409 push(top()); // halfword placeholder 414 assert(halfword == top(), ""); 421 set_local(i+1, top()); [all...] |
H A D | node.cpp | 272 // The value NULL is reserved for the top node only. 533 // Call this when changing the top node, to reassert the invariants 536 if (this == (Node*)Compile::current()->top()) { 537 // This node has just become top. Kill its out array. 539 _out = NULL; // marker value for top 540 assert(is_top(), "must be top"); 543 assert(!is_top(), "must not be top"); 662 assert(!is_top(), "cannot grow a top node's out array"); 1226 Node *top = igvn->C->top(); local [all...] |
H A D | node.hpp | 413 // Quickly, return true if and only if I am Compile::current()->top(). 415 assert((this == (Node*) Compile::current()->top()) == (_out == NULL), ""); 1438 INode *top = _inode_top; // optimization local 1439 top->node = n; 1440 top->indx = i;
|
H A D | loopTransform.cpp | 278 while( test != _head ) { // Scan till run off top of loop 307 while( test != loop->_head ) { // Scan till run off top of loop 532 new_head->set_req(LoopNode::LoopBackControl, C->top()); 537 use->set_req(LoopNode::LoopBackControl, C->top()); 784 if( limit_c == phase->C->top() ) 1422 phi ->set_req(LoopNode::LoopBackControl, C->top()); 1429 loop_head ->set_req(LoopNode::LoopBackControl, C->top()); 2042 uint top = test->Opcode(); local 2043 if( top == Op_IfTrue || top [all...] |
H A D | macro.cpp | 291 if (adr->is_AddP() && adr->in(AddPNode::Base) == top() && 302 _igvn.replace_node(p2x, top()); 514 Node *top = C->top(); local 517 if (n == NULL || n == top || n == mem) { 522 unique_input = top; 526 if (unique_input != NULL && unique_input != top) { 551 _igvn.replace_node(n, C->top()); 921 _igvn.replace_node(use, C->top()); 935 _igvn.replace_node(_memproj_catchall, C->top()); [all...] |
H A D | compile.hpp | 86 // This class defines a top-level Compiler invocation. 222 // Returns the offset of the last entry (the top) of the constant table. 223 int top_offset() const { assert(_constants.top().offset() != -1, "not bound yet"); return _constants.top().offset(); } 319 Node* _top; // Unique top node. (Reset by various phases.) 716 Node* top() const { return _top; } function in class:Compile 718 // these are used by guys who need to know about creation and transformation of top:
|
H A D | memnode.cpp | 301 // Note: raw address has TOP base and top->higher_equal(TypePtr::NULL_PTR) is true. 618 // Helper function. Notices when the given type of address hits top or bottom. 764 // one, that is, if in a loop, the one closest to the top. 1350 if (region->in(i) == phase->C->top()) { 1351 x = phase->C->top(); // Dead path? Use a dead data op 2819 Node* top = C->top(); local 2820 init_req(TypeFunc::I_O,top); 2821 init_req(TypeFunc::FramePtr,top); 2822 init_req(TypeFunc::ReturnAdr,top); [all...] |
H A D | graphKit.cpp | 77 Node* top = this->top(); local 79 if (map->in(stkoff + i) != top) { 80 map->set_req(stkoff + i, top); 163 // Tell if _map is NULL, or control is top. 166 else if (control() == top()) return true; 230 if (ex_map == NULL || ex_map->control() == top()) { 244 if (ex_oop == top()) { 295 for (uint i = 0; i < map()->req(); i++) map()->init_req(i, top()); 296 set_all_memory(top()); [all...] |
H A D | library_call.cpp | 833 set_control(top()); // No fast path instrinsic 853 // The return value is never 'top'; it is either a valid control 873 if (if_slow == top()) { 969 Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset())); 1554 "Sin", NULL, arg, top()); 1559 "Cos", NULL, arg, top()); 1564 "Tan", NULL, arg, top()); 1620 x, top(), y, y ? top() : NULL); 1624 assert(value_top == top(), "secon 5101 assert(end_con < 0, �); end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale), BytesPerLong); } if (start_con >= 0 && end_con >= 0) { mem = ClearArrayNode::clear_memory(control(), mem, dest, start_con, end_con, &_gvn); } else if (start_con >= 0 && dest_size != top()) argument [all...] |
/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | awt_wm.c | 1175 * top level shells. 1688 * Read property of type CARDINAL[4] = { left, right, top, bottom } 1692 int32_t *top, int32_t *left, int32_t *bottom, int32_t *right) 1722 *top = (int32_t)insets[2]; 1727 DTRACE_PRINTLN4("[top=%d,left=%d,bottom=%d,right=%d]", 1728 *top, *left, *bottom, *right); 1738 int32_t *top, int32_t *left, int32_t *bottom, int32_t *right) 1745 top, left, bottom, right); 1758 top, left, bottom, right); 2785 * If WM exits while the top 1691 awt_wm_readInsetsArray(Window shell_win, Atom insets_property, int32_t *top, int32_t *left, int32_t *bottom, int32_t *right) argument 1737 awt_wm_getInsetsFromProp(Window shell_win, int32_t *top, int32_t *left, int32_t *bottom, int32_t *right) argument [all...] |
H A D | gtk2_interface.h | 335 gint top; member in struct:__anon989
|
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/ |
H A D | XWindow.java | 76 private int savedState; // Holds last known state of the top-level window 124 native void getWMInsets(long window, long left, long top, long right, long bottom, long border); argument 1263 * Override this methods to get notifications when top-level window state changes. The state is
|
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | systemDictionary.cpp | 2537 void SystemDictionary::copy_buckets(char** top, char* end) { argument 2538 dictionary()->copy_buckets(top, end); 2542 void SystemDictionary::copy_table(char** top, char* end) { argument 2543 dictionary()->copy_table(top, end);
|
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_GraphBuilder.cpp | 792 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) { argument 793 assert(worklist->top() == top, ""); 795 const int dfn = top->depth_first_number(); 807 if (i >= -1) worklist->at_put(i + 1, top); 2959 assert(state->caller_state() == NULL, "should be top scope"); 3679 IRScope* top = scope(); local 3680 while (top->caller() != NULL) { 3681 top = top [all...] |
/openjdk7/jdk/test/java/lang/invoke/indify/ |
H A D | Indify.java | 101 * A version of this transformation built on top of <a href="http://asm.ow2.org/">http://asm.ow2.org/</a> would be welcome. 631 Object top() { return stack.get(sp()-1); } method in class:Indify.Logic.JVMState 643 case opc_dup: push(top()); break; 644 case opc_dup_x1: pushAt(-2, top()); break; 645 case opc_dup_x2: pushAt(-3, top()); break; 700 jvm.push(jvm.top()); break; 953 arg = jvm.top();
|
/openjdk7/jaxp/src/org/w3c/dom/css/ |
H A D | CSS2Properties.java | 267 * See the border-top property definition in CSS2. 271 * See the border-top property definition in CSS2. 323 * See the border-top-color property definition in CSS2. 327 * See the border-top-color property definition in CSS2. 379 * See the border-top-style property definition in CSS2. 383 * See the border-top-style property definition in CSS2. 435 * See the border-top-width property definition in CSS2. 439 * See the border-top-width property definition in CSS2. 981 * See the margin-top property definition in CSS2. 985 * See the margin-top propert 1663 setTop(String top) argument [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/ |
H A D | BasicTreeUI.java | 536 bounds.y += insets.top; 576 y -= tree.getInsets().top; 1116 return baseline + tree.getInsets().top; 1293 insets.top, 1437 int top; 1440 top = Math.max(insets.top + getVerticalLegBuffer(), 1444 top = Math.max(parentBounds.y + parentBounds.height + 1456 top = Math.max(insets.top 1565 paintVerticalLine(Graphics g, JComponent c, int x, int top, int bottom) argument [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psParallelCompact.cpp | 212 tty->print_cr("space bottom top end new_top"); 222 summary_data().addr_to_region_idx(space->top()), 278 MAX2(space->top(), space_info[id].new_top())); 299 if (space->top() == space->bottom()) { 305 HeapWord* const top_aligned_up = summary_data.region_align_up(space->top()); 333 const size_t used_to_right = pointer_delta(space->top(), region_addr); 375 print_generic_summary_data(summary_data, space->bottom(), space->top()); 613 // max(top, max(new_top, clear_top)) 932 _space_info[perm_space_id].set_min_dense_prefix(perm_space->top()); 978 // At this point, top i 984 HeapWord* const top = space->top(); local 1364 reclaimed_ratio(const RegionData* const cp, HeapWord* const bottom, HeapWord* const top, HeapWord* const new_top) argument 1416 HeapWord* const top = space->top(); local [all...] |
/openjdk7/hotspot/src/cpu/sparc/vm/ |
H A D | assembler_sparc.cpp | 2653 // store ptr_reg as the new top value 2665 // store ptr_reg as the new top value 2763 // yes, got lock. do we have the same top? 2767 // yes, same top. 3922 STOP("assert(top >= start)"); 3930 STOP("assert(top <= end)"); 3965 // note: we need both top & top_addr! 3979 // make sure eden top is properly aligned 3985 STOP("eden top is not properly aligned"); 4012 // make sure eden top i 4087 Register top = O0; local [all...] |