Searched defs:right (Results 151 - 175 of 193) sorted by relevance

12345678

/openjdk7/jdk/src/share/demo/applets/WireFrame/
H A DThreeD.java212 private void quickSort(int a[], int left, int right) { argument
214 int rightIndex = right;
216 if (right > left) {
221 partionElement = a[(left + right) / 2];
228 while ((leftIndex < right) && (a[leftIndex] < partionElement)) {
247 /* If the right index has not reached the left side of array
254 /* If the left index has not reached the right side of array
255 * must now sort the right partition.
257 if (leftIndex < right) {
258 quickSort(a, leftIndex, right);
[all...]
/openjdk7/jdk/src/solaris/classes/sun/java2d/jules/
H A DJulesAATileGenerator.java52 int left, right, top, bottom, width, height; field in class:JulesAATileGenerator
104 right = traps.getRight();
112 bbox[2] = right;
115 width = right - left;
/openjdk7/jdk/src/share/classes/javax/swing/plaf/synth/
H A DSynthTreeUI.java496 int left, int right) {
498 paintContext, "Tree.horizontalLine", g, left, y, right, y, linesStyle);
495 paintHorizontalLine(Graphics g, JComponent c, int y, int left, int right) argument
/openjdk7/hotspot/src/share/vm/opto/
H A Dconnode.cpp110 // Move constants to the right.
164 return in(IfTrue); // Always pick right(true) input
195 CMoveNode *CMoveNode::make( Compile *C, Node *c, Node *bol, Node *left, Node *right, const Type *t ) { argument
197 case T_INT: return new (C) CMoveINode( bol, left, right, t->is_int() );
198 case T_FLOAT: return new (C) CMoveFNode( bol, left, right, t );
199 case T_DOUBLE: return new (C) CMoveDNode( bol, left, right, t );
200 case T_LONG: return new (C) CMoveLNode( bol, left, right, t->is_long() );
201 case T_OBJECT: return new (C) CMovePNode( c, bol, left, right, t->is_oopptr() );
202 case T_ADDRESS: return new (C) CMovePNode( c, bol, left, right, t->is_ptr() );
203 case T_NARROWOOP: return new (C) CMoveNNode( c, bol, left, right,
[all...]
H A DidealKit.cpp68 // Create: if(left relop right)
73 Node* right, float prob, float cnt, bool push_new_state) {
78 bol = Bool(CmpI(left, right), relop);
81 bol = Bool(CmpL(left, right), relop);
85 bol = Bool(CmpP(left, right), relop);
72 if_then(Node* left, BoolTest::mask relop, Node* right, float prob, float cnt, bool push_new_state) argument
H A Dloopopts.cpp1533 // with an optional truncation (left-shift followed by a right-shift)
1657 // * new_if(relop(cmp[IU](left,right)))
1663 ProjNode* PhaseIdealLoop::insert_if_before_proj(Node* left, bool Signed, BoolTest::mask relop, Node* right, ProjNode* proj) { argument
1676 Node* cmp = Signed ? (Node*) new (C)CmpINode(left, right) : (Node*) new (C)CmpUNode(left, right);
2080 // Ensure a use outside of loop is of the right form
2092 // Ensure that all uses outside of loop are of the right form
2467 // Result in right-most operand.
2751 // update is right at the bottom, uses of of the loop middle are ok.
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dc1_LinearScan_x86.cpp667 LIR_Opr right = op2->in_opr2(); local
670 LIR_Opr new_right = right;
673 assert(!left->is_xmm_register() && !right->is_xmm_register() && !res->is_xmm_register(), "not for xmm registers");
680 assert(right->is_fpu_register(), "invalid LIR");
683 // the right-hand side is never popped, even if is_last_use is set
686 new_right = to_fpu_stack(right);
706 // either the left-hand or the right-hand side must be on top of stack
707 // (if right is not a register, left must be on top)
708 if (!right->is_fpu_register()) {
712 // no exchange necessary if right i
[all...]
/openjdk7/jdk/src/share/classes/com/sun/crypto/provider/
H A DDESCrypt.java601 int left, right;
604 right = initialPermutationRight(in, inOffset);
620 temp = (right << 1) | ((right >> 31) & 1);
633 // make the last sbox input the last bit from right[0]
634 temp = ((right & 1) << 5) | ((right >> 27) & 0x1f);
637 left = right;
638 right = temp;
643 left = right;
648 perm(int left, int right, byte out[], int offset) argument
[all...]
/openjdk7/jdk/src/solaris/native/sun/java2d/loops/
H A Dvis_ByteGray_Mask.c649 int right, bottom; local
660 right = left + width;
670 if (right > clipRight) {
671 right = clipRight;
676 if (right <= left || bottom <= top) {
679 width = right - left;
H A Dvis_IntArgbPre.c1109 int right, bottom; local
1120 right = left + width;
1130 if (right > clipRight) {
1131 right = clipRight;
1136 if (right <= left || bottom <= top) {
1139 width = right - left;
H A Dvis_IntRgbx.c984 int right, bottom; local
995 right = left + width;
1005 if (right > clipRight) {
1006 right = clipRight;
1011 if (right <= left || bottom <= top) {
1014 width = right - left;
H A Dvis_FourByteAbgr.c1889 int right, bottom; local
1900 right = left + width;
1910 if (right > clipRight) {
1911 right = clipRight;
1916 if (right <= left || bottom <= top) {
1919 width = right - left;
/openjdk7/jdk/src/solaris/native/sun/xawt/
H A DXWindow.c114 * to choose the right one. Unfortunately, there are some keysyms that
762 * People say, it's right to use behavior and not Vendor tags to decide.
1160 (Window window, int *left, int *top, int *right, int *bottom, int *border) {
1174 *right = topAttr.width - ((winAttr.width) + *left);
1180 (JNIEnv *env, jclass clazz, jlong window, jlong left, jlong top, jlong right, jlong bottom, jlong border) {
1184 (int*) jlong_to_ptr(right),
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/langtools/src/share/classes/com/sun/tools/javac/code/
H A DSymtab.java233 * @param right The type of the left operand.
238 Type left, Type right, Type res,
243 new MethodType(List.of(left, right), res,
255 Type left, Type right, Type res,
258 name, left, right, res, (opcode1 << ByteCodes.preShift) | opcode2);
237 enterBinop(String name, Type left, Type right, Type res, int opcode) argument
254 enterBinop(String name, Type left, Type right, Type res, int opcode1, int opcode2) argument
/openjdk7/jdk/src/share/demo/applets/SpreadSheet/
H A DSpreadSheet.java212 val += evaluateFormula(n.right);
215 val *= evaluateFormula(n.right);
218 val -= evaluateFormula(n.right);
221 val /= evaluateFormula(n.right);
546 Node right;
576 subformula = parseValue(restFormula, right = new Node());
583 node.right = right;
768 Node right; field in class:Node
776 right
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/runtime/
H A DBasisLibrary.java579 public static boolean compare(DTMAxisIterator left, DTMAxisIterator right, argument
588 right.reset();
589 while ((rnode = right.next()) != DTMAxisIterator.END) {
729 public static boolean compare(Object left, Object right, argument
733 boolean hasSimpleArgs = hasSimpleType(left) && hasSimpleType(right);
737 if (left instanceof Node || right instanceof Node) {
739 right = new Boolean(booleanF(right));
742 if (right instanceof Boolean) {
751 return numberF(left, dom) > numberF(right, do
[all...]
/openjdk7/hotspot/src/cpu/sparc/vm/
H A Dc1_LIRGenerator_sparc.cpp461 LIRItem right(x->y(), this);
463 right.load_item();
465 arithmetic_op_fpu(x->op(), x->operand(), left.result(), right.result(), x->is_strictfp());
500 LIRItem right(x->y(), this);
501 right.load_item();
504 LIR_Opr item = right.result();
533 LIRItem right(x->y(), this);
535 right.load_item();
538 arithmetic_op_long(x->op(), x->operand(), left.result(), right.result(), NULL);
560 LIRItem right(
1082 LIR_Opr right = LIR_OprFact::illegalOpr; local
1109 __ cmp(lir_cond(cond), left, right); local
[all...]
/openjdk7/hotspot/src/share/vm/adlc/
H A DarchDesc.cpp368 // right child
393 //------------------------------right reduction--------------------------------
395 const char *right = NULL; local
399 right = mnode->_internalop ? mnode->_internalop : mnode->_opType;
401 return right;
/openjdk7/jdk/src/solaris/native/sun/awt/
H A Dawt_p.h203 int right; member in struct:FrameData
/openjdk7/jdk/src/windows/native/sun/windows/
H A DThemeReader.cpp63 int cxRightWidth; // width of right border that retains its size
456 rect.right = w;
479 jobject newInsets(JNIEnv *env, jint top, jint left, jint bottom, jint right) { argument
494 top, left, bottom, right);
788 boundingRect.right = boundingWidth;
797 boundingWidth - contentRect.right);
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/
H A DStroker.java147 // This is equivalent to detecting whether a point q is on the right side
276 // sort of assumption (right now it's true, but that may change).
535 float[] left, float[] right) {
541 right[0] = x1 - offset[0][0];
542 right[1] = y1 - offset[0][1];
543 right[2] = x2 - offset[0][0];
544 right[3] = y2 - offset[0][1];
625 // The right side of this is a 2D vector, and we know I(0.5), which gives us
626 // Bp(0.5), which gives us the value of the right side.
696 // return the kind of curve in the right an
533 getLineOffsets(float x1, float y1, float x2, float y2, float[] left, float[] right) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DDefaultStyledDocument.java863 // If there are right parents, then we generated starts
864 // down the right subtree and there will be an element to
868 // No right subtree, e.getElement(endOffset) is a
2053 Element join(Element p, Element left, Element right, int rmOffs0, int rmOffs1) { argument
2054 if (left.isLeaf() && right.isLeaf()) {
2056 right.getEndOffset());
2057 } else if ((!left.isLeaf()) && (!right.isLeaf())) {
2060 // range on the right element. The two elements on the edge
2064 int rjIndex = right.getElementIndex(rmOffs1);
2069 Element rj = right
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DTreeMap.java350 p = p.right;
373 p = p.right;
397 if (p.right != null) {
398 p = p.right;
402 while (parent != null && ch == parent.right) {
424 if (p.right != null)
425 p = p.right;
463 if (p.right != null) {
464 p = p.right;
468 while (parent != null && ch == parent.right) {
1893 Entry<K,V> right = null; field in class:TreeMap.Entry
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentSkipListMap.java109 * +-+ right +-+ +-+
314 * Index: q, r, d for index node, right, down.
543 volatile Index<K,V> right; field in class:ConcurrentSkipListMap.Index
548 Index(Node<K,V> node, Index<K,V> down, Index<K,V> right) { argument
551 this.right = right;
555 * compareAndSet right field
579 newSucc.right = succ;
584 * Tries to CAS right field to skip over apparent successor
591 return !indexesDeletedNode() && casRight(succ, succ.right);
616 HeadIndex(Node<K,V> node, Index<K,V> down, Index<K,V> right, int level) argument
[all...]
/openjdk7/jdk/src/share/classes/com/sun/java/swing/plaf/gtk/
H A DMetacity.java186 getIntAttr(child, "right", 0));
445 width-insets.right, titleHeight, insets.right, height-titleHeight, jif);
716 width += title_border.left + title_border.right;
788 x -= button_border.right;
1078 r.x -= button_border.right;
1082 r.width -= title_border.right;
1156 } else if ("right".equals(arrow)) {
1460 insets.right = getInt("right_width");
1870 tokenizer.nextToken(); // skip right pare
2010 classify(double coord, double left, double right, double arcsize) argument
[all...]

Completed in 537 milliseconds

12345678