Searched defs:bottom (Results 51 - 75 of 75) sorted by relevance

123

/openjdk7/jdk/src/solaris/native/sun/java2d/loops/
H A Dvis_IntRgbx.c984 int right, bottom; local
996 bottom = top + height;
1008 if (bottom > clipBottom) {
1009 bottom = clipBottom;
1011 if (right <= left || bottom <= top) {
1015 height = bottom - top;
H A Dvis_FourByteAbgr.c1889 int right, bottom; local
1901 bottom = top + height;
1913 if (bottom > clipBottom) {
1914 bottom = clipBottom;
1916 if (right <= left || bottom <= top) {
1920 height = bottom - top;
/openjdk7/jdk/src/solaris/native/sun/xawt/
H A DXWindow.c1160 (Window window, int *left, int *top, int *right, int *bottom, int *border) {
1175 *bottom = topAttr.height - ((winAttr.height) + *top);
1180 (JNIEnv *env, jclass clazz, jlong window, jlong left, jlong top, jlong right, jlong bottom, jlong border) {
1185 (int*) jlong_to_ptr(bottom),
1159 getWMInsets(Window window, int *left, int *top, int *right, int *bottom, int *border) argument
1179 Java_sun_awt_X11_XWindow_getWMInsets(JNIEnv *env, jclass clazz, jlong window, jlong left, jlong top, jlong right, jlong bottom, jlong border) argument
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DconcurrentMarkSweepGeneration.cpp201 HeapWord* bottom = (HeapWord*) _virtual_space.low(); local
212 _cmsSpace = new CompactibleFreeListSpace(_bts, MemRegion(bottom, end),
1135 size_t delta = pointer_delta(addr, space->bottom());
3421 MemRegion mr(_cmsSpace->bottom(), new_word_size);
3823 assert(_cms_space->bottom() < _perm_space->bottom(),
3825 _restart_addr = _global_finger = _cms_space->bottom();
4013 HeapWord* aligned_start = sp->bottom();
5283 start = space->bottom();
5286 start = space->bottom();
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DheapRegion.cpp51 _r_bottom(r->bottom()), _r_end(r->end()), _oc(oc) { }
117 from->bottom(), from->end());
128 from->bottom(), from->end());
132 (void*) obj, to->bottom(), to->end());
214 HeapWord* bottom,
235 if (!g1h->is_obj_dead(oop(bottom), _hr)) {
236 oop_size = oop(bottom)->oop_iterate(cl2, mr);
238 oop_size = oop(bottom)->size();
241 bottom += oop_size;
243 if (bottom < to
213 walk_mem_region_with_cl(MemRegion mr, HeapWord* bottom, HeapWord* top, OopClosure* cl) argument
[all...]
H A DheapRegion.hpp62 (_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,
110 // Walk the given memory region from bottom to (actual) top
116 void walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top) { argument
117 Filtering_DCTOC::walk_mem_region(mr, bottom, top);
317 HeapWord* bot = bottom();
410 (prev_top_at_mark_start() - bottom()) * HeapWordSize;
645 bool is_marked() { return _prev_top_at_mark_start != bottom(); }
93 walk_mem_region_with_cl(MemRegion mr, HeapWord* bottom, HeapWord* top, FilteringClosure* cl) argument
[all...]
H A DconcurrentMark.cpp515 // Calculate the card number for the bottom of the heap. Used
1045 assert(hr->next_top_at_mark_start() == hr->bottom(), "invariant");
1049 HeapWord* curr = hr->bottom();
1299 HeapWord* start = hr->bottom();
1468 BitMap::idx_t start_idx = _cm->card_bitmap_index_for(hr->bottom());
1599 assert(hr->bottom() <= ntams && ntams <= hr->end(), "Preconditions.");
2610 HeapWord* b = hr->bottom();
2730 HeapWord* bottom = curr_region->bottom(); local
2738 task_num, curr_region, bottom, en
3323 HeapWord* bottom = hr->bottom(); local
4468 HeapWord* bottom = r->bottom(); local
[all...]
H A Dg1CollectedHeap.cpp250 curr->bottom(), curr->end(),
691 // The header of the new object will be placed at the bottom of
693 HeapWord* new_obj = first_hr->bottom();
718 // that there is a single object that starts at the bottom of the
735 // fields still point to bottom, so the intersection between
736 // [bottom,top] and [card_start,card_end] will be empty. Before we
744 assert(first_hr->bottom() < new_top && new_top <= first_hr->end(),
748 HeapWord* bottom = first_hr->bottom(); local
775 assert(hr->bottom() < new_to
6522 new_heap_region(uint hrs_index, HeapWord* bottom) argument
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A Dallocation.cpp350 if (ZapResourceArea) memset(k->bottom(), badResourceValue, k->length());
379 _hwm = _chunk->bottom(); // Save the cached hwm, max
387 _hwm = _chunk->bottom(); // Save the cached hwm, max
454 free_malloced_objects(_first, _first->bottom(), end, _hwm);
500 _hwm = _chunk->bottom(); // Save the cached hwm, max
562 char** bottom = (char**)_chunk->bottom(); local
563 for (char** p = (char**)_hwm - 1; p >= bottom; p--) {
568 char** bottom = (char**)c->bottom(); local
[all...]
H A Dallocation.hpp270 char* bottom() const { return ((char*) this) + aligned_overhead_size(); } function in class:Chunk
271 char* top() const { return bottom() + _len; }
272 bool contains(char* p) const { return bottom() <= p && p <= top(); }
H A Dspace.hpp104 // Invariant: bottom() and end() are on page_size boundaries and
105 // bottom() <= top() <= end()
129 HeapWord* bottom() const { return _bottom; } function in class:Space
147 virtual MemRegion used_region() const { return MemRegion(bottom(), end()); }
153 // such objects: the memregion will be from the bottom of the region to the
158 return MemRegion(bottom(), saved_mark_word());
205 size_t capacity() const { return byte_size(bottom(), end()); }
345 // Walk the given memory region from bottom to (actual) top
351 virtual void walk_mem_region(MemRegion mr, HeapWord* bottom, HeapWord* top);
415 assert(value == NULL || (value >= bottom()
[all...]
/openjdk7/hotspot/src/share/vm/oops/
H A DgenerateOopMap.hpp212 "check to make sure top/bottom info is not used");
238 static CellTypeState bottom; member in class:VALUE_OBJ_CLASS_SPEC
267 int _stack_top; // -1 indicates bottom stack value.
268 int _monitor_top; // -1 indicates bottom monitor stack value.
H A DgenerateOopMap.cpp74 // '@' bottom/unexecuted; initial state each bytecode.
117 virtual void do_void () { set(CellTypeState::bottom);};
146 set(CellTypeState::bottom); // Always terminate with a bottom state, so ppush works
171 virtual void do_void () { set(CellTypeState::bottom);};
200 set(CellTypeState::bottom); // Always terminate with a bottom state, so ppush works
283 CellTypeState CellTypeState::bottom = CellTypeState::make_bottom(); member in class:CellTypeState
292 static CellTypeState epsilonCTS[1] = { CellTypeState::bottom };
295 static CellTypeState vCTS[2] = { CellTypeState::value, CellTypeState::bottom };
[all...]
/openjdk7/jdk/src/solaris/native/sun/awt/
H A Dawt_p.h201 int bottom; member in struct:FrameData
H A Dawt_wm.c1688 * Read property of type CARDINAL[4] = { left, right, top, bottom }
1692 int32_t *top, int32_t *left, int32_t *bottom, int32_t *right)
1723 *bottom = (int32_t)insets[3];
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);
2789 * see a huge nagative bottom inset. There's no clean solution for
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
H A Dgtk2_interface.h336 gint bottom; member in struct:__anon989
/openjdk7/jdk/src/windows/native/sun/windows/
H A DThemeReader.cpp65 int cyBottomHeight; // height of bottom border that retains its size
455 rect.bottom = h;
479 jobject newInsets(JNIEnv *env, jint top, jint left, jint bottom, jint right) { argument
494 top, left, bottom, right);
789 boundingRect.bottom = boundingHeight;
796 boundingHeight - contentRect.bottom,
H A Dawt_MenuItem.cpp383 int y = (textRect.top+textRect.bottom-size.cy)/2;
569 int diff = max(rect.bottom - rect.top - width, 0) ;
570 int bottom = diff / 2; local
571 rect.bottom -= bottom;
572 rect.top += diff - bottom;
578 rect.right - rect.left, rect.bottom - rect.top,
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/
H A DXWindow.java124 native void getWMInsets(long window, long left, long top, long right, long bottom, long border); argument
/openjdk7/jaxp/src/org/w3c/dom/css/
H A DCSS2Properties.java295 * See the border-bottom property definition in CSS2.
299 * See the border-bottom property definition in CSS2.
351 * See the border-bottom-color property definition in CSS2.
355 * See the border-bottom-color property definition in CSS2.
407 * See the border-bottom-style property definition in CSS2.
411 * See the border-bottom-style property definition in CSS2.
463 * See the border-bottom-width property definition in CSS2.
467 * See the border-bottom-width property definition in CSS2.
505 * See the bottom property definition in CSS2.
509 * See the bottom propert
515 setBottom(String bottom) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/
H A DBasicTreeUI.java1463 int bottom = Math.min(lastChildBounds.y +
1466 if (top <= bottom) {
1468 paintVerticalLine(g, tree, lineX, top, bottom);
1566 int bottom) {
1568 drawDashedVerticalLine(g, x, top, bottom);
1570 g.drawLine(x, top, x, bottom);
1587 * The vertical element of legs between nodes starts at the bottom of the
1903 preferredSize.height += i.top + i.bottom;
1565 paintVerticalLine(Graphics g, JComponent c, int x, int top, int bottom) argument
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsParallelCompact.cpp212 tty->print_cr("space bottom top end new_top");
221 summary_data().addr_to_region_idx(space->bottom()),
277 print_generic_summary_data(summary_data, space->bottom(),
299 if (space->top() == space->bottom()) {
309 const size_t live_in_space = pointer_delta(end_addr, space->bottom());
313 size_t i = summary_data.addr_to_region_idx(space->bottom());
375 print_generic_summary_data(summary_data, space->bottom(), space->top());
983 HeapWord* const bot = space->bottom();
1123 const RegionData* const beg_cp = sd.addr_to_region_ptr(space->bottom());
1143 const size_t space_live = pointer_delta(new_top, space->bottom());
1364 reclaimed_ratio(const RegionData* const cp, HeapWord* const bottom, HeapWord* const top, HeapWord* const new_top) argument
1420 HeapWord* const bottom = space->bottom(); local
[all...]
/openjdk7/hotspot/src/os/bsd/vm/
H A Dos_bsd.cpp819 // Force Bsd kernel to expand current thread stack. If "bottom" is close
849 // There are two ways to expand thread stack to address "bottom", we used
851 // 1. adjust stack pointer first so that it is below "bottom", and then
852 // touch "bottom"
861 // The following code works by adjusting sp first, then accessing the "bottom"
874 static void _expand_stack_to(address bottom) NOINLINE;
876 static void _expand_stack_to(address bottom) { argument
881 // Adjust bottom to point to the largest address within the same page, it
883 bottom = (address)align_size_down((uintptr_t)bottom, o
3203 char* bottom = (char*)align_size_down((intptr_t)addr, os::Bsd::page_size()); local
[all...]
/openjdk7/hotspot/src/os/linux/vm/
H A Dos_linux.cpp693 // Force Linux kernel to expand current thread stack. If "bottom" is close
723 // There are two ways to expand thread stack to address "bottom", we used
725 // 1. adjust stack pointer first so that it is below "bottom", and then
726 // touch "bottom"
735 // The following code works by adjusting sp first, then accessing the "bottom"
748 static void _expand_stack_to(address bottom) NOINLINE;
750 static void _expand_stack_to(address bottom) { argument
755 // Adjust bottom to point to the largest address within the same page, it
757 bottom = (address)align_size_down((uintptr_t)bottom, o
3006 get_stack_bounds(uintptr_t *bottom, uintptr_t *top) argument
3131 char* bottom = (char*)align_size_down((intptr_t)addr, os::Linux::page_size()); local
[all...]
/openjdk7/hotspot/src/os/solaris/vm/
H A Dos_solaris.cpp378 address bottom = (address)align_size_up((intptr_t)(base - size), os::vm_page_size());; local
379 return (size_t)(base - bottom);
1517 address bottom = (address)align_size_up((intptr_t)(base - stack_size), os::vm_page_size());; local
1518 stack_size = (size_t)(base - bottom);
2983 int result_size = 0, top = 1, bottom = 0, cur = 0; local
2993 assert (bottom <= cur, "Sanity check");
2997 ids[bottom++] = ids[cur];
3003 if (bottom == 0) {
3009 return bottom;

Completed in 297 milliseconds

123