/openjdk7/jdk/src/share/classes/javax/swing/text/html/ |
H A D | FrameSetView.java | 159 * @param targetSpan the total span given to the view, which 165 * @param spans the span of each child view; this is a return 167 * @return the offset and span for each child view in the 183 int span[] = new int[children.length]; 185 spread(targetSpan, span); 192 span[sIndex], 209 * This method is responsible for returning in span[] the 210 * span for each child view along the major axis. it 214 private void spread(int targetSpan, int span[]) { argument 226 for (int i = 0; i < span [all...] |
H A D | TableView.java | 82 * Fetches the span (width) of the given column. 101 * Fetch the span of multiple rows. This includes 110 int span = getOffset(Y_AXIS, index1) - getOffset(Y_AXIS, index0) + 112 return span; 118 * Fetches the span (height) of the given row. 356 * Layout the columns to fit within the given target span. 358 * @param targetSpan the given span for total of all the table 362 * maximum requested span 367 * @return the offset from the origin and the span for each column 384 * give axis. Table cells that span multipl 1014 updatePercentagesAndAdjustmentWeights(int span) argument 1081 setSpan(int span) argument 1228 setSpan(int span) argument [all...] |
H A D | CSS.java | 819 v.span = (v.span < 0) ? 0 : v.span; 2255 * Returns the length (span) to use. 2266 * Returns the length (span) to use. If the value represents 2274 return span * currentValue; 2276 return LengthUnit.getValue(span, units, isW3CLengthUnits); 2293 lv.span = absolute; 2306 lv.span = 2313 lv.span 2366 float span; field in class:CSS.LengthValue 3289 setSpan(int span) argument [all...] |
/openjdk7/jaxp/src/org/w3c/dom/html/ |
H A D | HTMLTableColElement.java | 73 * See the span attribute definition in HTML 4.0. 76 public void setSpan(int span); argument
|
/openjdk7/jdk/src/share/native/sun/java2d/loops/ |
H A D | Blit.c | 99 SurfaceDataBounds span; local 103 while (Region_NextIteration(&clipInfo, &span)) { 105 srcx + span.x1, srcInfo.pixelStride, 106 srcy + span.y1, srcInfo.scanStride); 108 span.x1, dstInfo.pixelStride, 109 span.y1, dstInfo.scanStride); 113 * way to give the span coordinates to the 117 srcInfo.bounds.x1 = srcx + span.x1; 118 dstInfo.bounds.x1 = span.x1; 120 span [all...] |
H A D | BlitBg.c | 103 SurfaceDataBounds span; local 107 while (Region_NextIteration(&clipInfo, &span)) { 109 srcx + span.x1, srcInfo.pixelStride, 110 srcy + span.y1, srcInfo.scanStride); 112 span.x1, dstInfo.pixelStride, 113 span.y1, dstInfo.scanStride); 117 * way to give the span coordinates to the 121 srcInfo.bounds.x1 = srcx + span.x1; 122 dstInfo.bounds.x1 = span.x1; 124 span [all...] |
H A D | MaskBlit.c | 94 SurfaceDataBounds span; local 102 while (Region_NextIteration(&clipInfo, &span)) { 104 srcx + span.x1, srcInfo.pixelStride, 105 srcy + span.y1, srcInfo.scanStride); 107 span.x1, dstInfo.pixelStride, 108 span.y1, dstInfo.scanStride); 109 maskoff += ((span.y1 - dsty) * maskscan + (span.x1 - dstx)); 113 * way to give the span coordinates to the 117 srcInfo.bounds.x1 = srcx + span [all...] |
H A D | ScaledBlit.c | 434 SurfaceDataBounds span; local 447 while (Region_NextIteration(&clipInfo, &span)) { 452 if (span.y1 > idy1) { 453 tsyloc += syinc * (span.y1 - idy1); 455 if (span.x1 > idx1) { 456 tsxloc += sxinc * (span.x1 - idx1); 460 span.x1, dstInfo.pixelStride, 461 span.y1, dstInfo.scanStride); 463 span.x2-span [all...] |
H A D | TransformHelper.c | 437 SurfaceDataBounds span; local 453 while (Region_NextIteration(&clipInfo, &span)) { 457 dy1 = span.y1; 458 dy2 = span.y2; 469 if (dx1 < span.x1) dx1 = span.x1; 470 if (dx2 > span.x2) dx2 = span.x2; 551 SurfaceDataBounds span; local 570 while (Region_NextIteration(pClipInfo, &span)) { [all...] |
/openjdk7/jdk/src/share/native/sun/java2d/pipe/ |
H A D | Region.c | 247 SurfaceDataBounds span; local 273 for (i = 0; Region_NextIteration(&clipInfo, &span); i++) { 274 RECT_SET((*pRect)[i], span.x1, span.y1, span.x2 - span.x1, span.y2 - span.y1);
|
/openjdk7/jdk/src/solaris/native/sun/java2d/x11/ |
H A D | X11PMBlitLoops.c | 43 SurfaceDataBounds span, srcBounds; local 81 span.x1 = dstx; 82 span.y1 = dsty; 83 span.x2 = dstx + width; 84 span.y2 = dsty + height; 87 SurfaceData_IntersectBlitBounds(&srcBounds, &span, 91 dstx = span.x1; 92 dsty = span.y1; 99 Region_IntersectBounds(&clipInfo, &span); 104 while (Region_NextIteration(&clipInfo, &span)) { [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/text/ |
H A D | BoxView.java | 170 * will have an offset and span of 0. 245 // have changed their span along the major axis. If there 266 * preferred span has changed. This is implemented to 319 * @param span the span to layout to >= 0 321 void setSpanOnAxis(int axis, float span) { argument 323 if (majorSpan != (int) span) { 328 majorSpan = (int) span; 337 if (((int) span) != minorSpan) { 342 minorSpan = (int) span; [all...] |
H A D | AsyncBoxView.java | 153 * Fetch the span along an axis that is taken up by the insets. 167 * major span should be treated as being estimated. If this 183 * Is the major span currently estimated? 236 * the major axis. If the span along the major axis is 239 * major span is estimated. 284 float span = 0f; 296 span += cs.getMajorSpan(); 305 majorSpan = span; 526 * the children if the minor span changes. 541 * @return the current span o 561 setSpanOnAxis(int axis, float span) argument 1401 private float span; field in class:AsyncBoxView.ChildState [all...] |
/openjdk7/jdk/src/windows/native/sun/java2d/windows/ |
H A D | GDIWindowSurfaceData.cpp | 1021 SurfaceDataBounds span; local 1071 while (Region_NextIteration(&clipInfo, &span)) { 1072 pRect->left = span.x1 - leftInset; 1073 pRect->top = span.y1 - topInset; 1074 pRect->right = span.x2 - leftInset; 1075 pRect->bottom = span.y2 - topInset;
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | referenceProcessor.cpp | 91 ReferenceProcessor::ReferenceProcessor(MemRegion span, argument 107 _span = span; 1135 // (or part of the heap being collected, indicated by our "span" 1139 // referent is also in the same span. This is the simplest, 1143 // #1: the reference object may be in any generation (span), but if 1144 // the referent is in the generation (span) being currently collected 1231 // .. reference is in our span, OR 1232 // .. we are an atomic collector and referent is in our span
|
H A D | referenceProcessor.hpp | 41 // by using only a heap interval (called "span" below), thus allowing 46 // itself with ("weak") reference processing in a specific "span" 48 // the span is a convex interval of the heap, but, efficiency 445 ReferenceProcessor(MemRegion span, 471 // get and set span 472 MemRegion span() { return _span; } function in class:ReferenceProcessor 473 void set_span(MemRegion span) { _span = span; } argument 558 // A utility class to temporarily mutate the span of the 567 MemRegion span) 566 ReferenceProcessorSpanMutator(ReferenceProcessor* rp, MemRegion span) argument [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/formats/html/ |
H A D | HtmlDocletWriter.java | 1457 * Prine table header information about color, column span and the font. 1460 * @param span Column span. 1462 public void tableHeaderStart(String color, int span) { argument 1464 thAlignColspan("left", span); 1480 * Print "Use" table header. Print the background color and the column span. 1490 * Print table header with the background color with default column span 2. 1499 * Print table header with the column span, with the default color #CCCCFF. 1501 * @param span Column span 1503 tableHeaderStart(int span) argument [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | compactibleFreeListSpace.cpp | 2350 MemRegion span) : _sp(sp), _span(span), 2444 const CompactibleFreeListSpace* sp, MemRegion span, 2446 OopClosure(), _collector(collector), _sp(sp), _span(span), 2456 MemRegion span = _collector->_span; local 2471 VerifyAllBlksClosure cl(this, span); 2479 VerifyAllOopsClosure cl(_collector, this, span, past_remark, 3006 MemRegion span = _gen->reserved(); 3008 if (span.contains(low)) { 3010 // we can use block_offset_careful() on span boundarie 2349 VerifyAllBlksClosure(const CompactibleFreeListSpace* sp, MemRegion span) argument 2443 VerifyAllOopsClosure(const CMSCollector* collector, const CompactibleFreeListSpace* sp, MemRegion span, bool past_remark, CMSBitMap* bit_map) argument [all...] |
H A D | concurrentMarkSweepGeneration.hpp | 483 CMSIsAliveClosure(MemRegion span, argument 485 _span(span), 487 assert(!span.is_empty(), "Empty span could spell trouble"); 634 MemRegion _span; // span covering above two 1394 MarkFromRootsClosure(CMSCollector* collector, MemRegion span, 1429 MemRegion span, 1460 MemRegion span, 1479 MarkFromRootsVerifyClosure(CMSCollector* collector, MemRegion span, 1527 MemRegion span, 1526 ScanMarkedObjectsAgainClosure(CMSCollector* collector, MemRegion span, ReferenceProcessor* rp, CMSBitMap* bit_map, CMSMarkStack* mark_stack, CMSMarkStack* revisit_stack, MarkRefsIntoAndScanClosure* cl) argument 1542 ScanMarkedObjectsAgainClosure(CMSCollector* collector, MemRegion span, ReferenceProcessor* rp, CMSBitMap* bit_map, OopTaskQueue* work_queue, CMSMarkStack* revisit_stack, Par_MarkRefsIntoAndScanClosure* cl) argument 1580 MarkFromDirtyCardsClosure(CMSCollector* collector, MemRegion span, CompactibleFreeListSpace* space, CMSBitMap* bit_map, CMSMarkStack* mark_stack, CMSMarkStack* revisit_stack, MarkRefsIntoAndScanClosure* cl) argument 1592 MarkFromDirtyCardsClosure(CMSCollector* collector, MemRegion span, CompactibleFreeListSpace* space, CMSBitMap* bit_map, OopTaskQueue* work_queue, CMSMarkStack* revisit_stack, Par_MarkRefsIntoAndScanClosure* cl) argument 1632 ScanMarkedObjectsAgainCarefullyClosure(CMSCollector* collector, MemRegion span, CMSBitMap* bitMap, CMSMarkStack* markStack, CMSMarkStack* revisitStack, MarkRefsIntoAndScanClosure* cl, bool should_yield) argument 1679 SurvivorSpacePrecleanClosure(CMSCollector* collector, MemRegion span, CMSBitMap* bit_map, CMSMarkStack* mark_stack, PushAndMarkClosure* cl, unsigned int before_count, bool should_yield) argument 1837 CMSDrainMarkingStackClosure(CMSCollector* collector, MemRegion span, CMSBitMap* bit_map, CMSMarkStack* mark_stack, CMSKeepAliveClosure* keep_alive, bool cpc) argument 1863 CMSParDrainMarkingStackClosure(CMSCollector* collector, MemRegion span, CMSBitMap* bit_map, CMSMarkStack* revisit_stack, OopTaskQueue* work_queue) argument [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | loopTransform.cpp | 1369 Node *span = new (C) SubINode( limit, init ); local 1370 register_new_node( span, ctrl ); 1371 Node *trip = new (C) DivINode( 0, span, stride ); 1990 Node *span = new (C) SubINode(main_limit,init); local 1991 register_new_node(span,ctrl); 1993 Node *add = new (C) AddINode(span,rndup);
|
H A D | loopnode.cpp | 666 Node *span = gvn->transform(new (C) MulINode(trip_count,stride)); local 667 set_subtree_ctrl( span ); 668 hook->init_req(5, span); 670 limit = gvn->transform(new (C) AddINode(span,init_trip)); 951 Node *span = phase->transform(new (phase->C) MulINode(trip, in(Stride))); local 952 return new (phase->C) AddINode(span, in(Init)); // exact limit 967 Node *span; local 977 span = phase->transform(new (phase->C) AndLNode(bias, neg_stride)); 980 span = phase->transform(new (phase->C) MulLNode(trip, stride)); 983 Node *span_int = phase->transform(new (phase->C) ConvL2INode(span)); [all...] |
H A D | superword.cpp | 447 int span = preloop_stride * p.scale_in_bytes(); local 450 if (ABS(span) == p.memory_size()) 457 if (vw % span == 0) { 465 if (span > 0) { 466 return (vw - (init_offset % vw)) % span == 0; 468 assert(span < 0, "nonzero stride * scale"); 469 return (init_offset % vw) % -span == 0;
|