Searched refs:s1 (Results 176 - 200 of 312) sorted by relevance

1234567891011>>

/openjdk7/jdk/src/share/demo/jfc/TableExample/
H A DTableSorter.java144 String s1 = (String) data.getValueAt(row1, column);
146 int result = s1.compareTo(s2);
171 String s1 = v1.toString();
174 int result = s1.compareTo(s2);
/openjdk7/jdk/src/share/classes/sun/net/www/protocol/http/
H A DAuthenticationInfo.java433 String s1, s2; /* used for serialization of pw */ field in class:AuthenticationInfo
439 pw = new PasswordAuthentication (s1, s2.toCharArray());
440 s1 = null; s2= null;
446 s1 = pw.getUserName();
/openjdk7/jdk/src/solaris/native/sun/awt/medialib/
H A Dmlib_v_ImageLookUpS16S16Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
83 s1 = sp[1];
92 t1 = VIS_LD_U16_I(table1, 2 * s1);
99 s1 = sp[1];
107 t1 = VIS_LD_U16_I(table1, 2 * s1);
345 mlib_s32 s0, s1, s2, s3; /* source data */ local
367 s1 = sp[1];
376 t1 = VIS_LD_U16_I(table1, 2 * s1);
383 s1 = sp[1];
395 t1 = VIS_LD_U16_I(table1, 2 * s1);
[all...]
H A Dmlib_v_ImageLookUpS16U16Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
83 s1 = sp[1];
92 t1 = VIS_LD_U16_I(table1, 2 * s1);
99 s1 = sp[1];
107 t1 = VIS_LD_U16_I(table1, 2 * s1);
345 mlib_s32 s0, s1, s2, s3; /* source data */ local
367 s1 = sp[1];
376 t1 = VIS_LD_U16_I(table1, 2 * s1);
383 s1 = sp[1];
395 t1 = VIS_LD_U16_I(table1, 2 * s1);
[all...]
H A Dmlib_v_ImageLookUpS16U8Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
83 s1 = sp[1];
100 t1 = VIS_LD_U8_I(table1, s1);
111 s1 = sp[1];
127 t1 = VIS_LD_U8_I(table1, s1);
408 mlib_s32 s0, s1, s2, s3; /* source data */ local
430 s1 = sp[1];
447 t1 = VIS_LD_U8_I(table1, s1);
462 s1 = sp[1];
478 t1 = VIS_LD_U8_I(table1, s1);
[all...]
H A Dmlib_v_ImageLookUpS32S16Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
81 s1 = sp[1];
90 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
97 s1 = sp[1];
105 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
340 mlib_s32 s0, s1, s2, s3; /* source data */ local
360 s1 = sp[1];
369 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
376 s1 = sp[1];
388 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
[all...]
H A Dmlib_v_ImageLookUpS32U16Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
81 s1 = sp[1];
90 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
97 s1 = sp[1];
105 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
343 mlib_s32 s0, s1, s2, s3; /* source data */ local
363 s1 = sp[1];
372 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
379 s1 = sp[1];
391 t1 = VIS_LD_U16_I(table1, ((mlib_addr) 2 * s1));
[all...]
H A Dmlib_v_ImageLookUpS32U8Func.c62 mlib_s32 s0, s1, s2, s3; /* source data */ local
83 s1 = sp[1];
100 t1 = VIS_LD_U8_I(table1, s1);
111 s1 = sp[1];
127 t1 = VIS_LD_U8_I(table1, s1);
407 mlib_s32 s0, s1, s2, s3; /* source data */ local
429 s1 = sp[1];
446 t1 = VIS_LD_U8_I(table1, s1);
461 s1 = sp[1];
477 t1 = VIS_LD_U8_I(table1, s1);
[all...]
H A Dmlib_v_ImageLookUpU16S16Func.c61 mlib_s32 s0, s1, s2, s3; /* source data */ local
82 s1 = sp[1];
91 t1 = VIS_LD_U16_I(table1, 2 * s1);
98 s1 = sp[1];
106 t1 = VIS_LD_U16_I(table1, 2 * s1);
344 mlib_s32 s0, s1, s2, s3; /* source data */ local
366 s1 = sp[1];
375 t1 = VIS_LD_U16_I(table1, 2 * s1);
382 s1 = sp[1];
394 t1 = VIS_LD_U16_I(table1, 2 * s1);
[all...]
H A Dmlib_v_ImageLookUpU16U16Func.c61 mlib_s32 s0, s1, s2, s3; /* source data */ local
82 s1 = sp[1];
91 t1 = VIS_LD_U16_I(table1, 2*s1);
98 s1 = sp[1];
106 t1 = VIS_LD_U16_I(table1, 2*s1);
324 mlib_s32 s0, s1, s2, s3; /* source data */ local
346 s1 = sp[1];
355 t1 = VIS_LD_U16_I(table1, 2*s1);
362 s1 = sp[1];
372 t1 = VIS_LD_U16_I(table1, 2*s1);
[all...]
H A Dmlib_v_ImageLookUpU16U8Func.c61 mlib_s32 s0, s1, s2, s3; /* source data */ local
82 s1 = sp[1];
99 t1 = VIS_LD_U8_I(table1, s1);
110 s1 = sp[1];
126 t1 = VIS_LD_U8_I(table1, s1);
407 mlib_s32 s0, s1, s2, s3; /* source data */ local
429 s1 = sp[1];
446 t1 = VIS_LD_U8_I(table1, s1);
461 s1 = sp[1];
477 t1 = VIS_LD_U8_I(table1, s1);
[all...]
H A Dmlib_v_ImageChannelExtract_43.c172 s1 = sp[1]; \
176 sd0 = vis_faligndata(s0, s1); \
177 sd1 = vis_faligndata(s1, s2); \
266 mlib_d64 s0, s1, s2, s3, s4; /* 8-byte source row data */ local
480 s1 = sp[1]; \
484 sd0 = vis_faligndata(s0, s1); \
485 sd1 = vis_faligndata(s1, s2); \
572 mlib_d64 s0, s1, s2, s3, s4; /* 8-byte source row data */ local
822 s1 = sp[1]; \
826 sd0 = vis_faligndata(s0, s1); /* th
918 mlib_d64 s0, s1, s2, s3, s4; /* 8-byte source row data */ local
1196 mlib_d64 s0, s1, s2, s3, s4; /* 8-byte source row data */ local
[all...]
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/report/
H A DIIOComparator.java335 private static boolean compare(String s1, String s2) { argument
336 String sizestr1 = s1.substring(s1.indexOf('=')+1, s1.indexOf(','));
341 return (magic(s1) < magic(s2));
/openjdk7/jdk/src/share/classes/sun/awt/geom/
H A DCurve.java905 double s1 = this.TforY(y1);
906 if (this.YforT(s1) < y0) {
907 s1 = refineTforY(s1, this.YforT(s1), y0);
908 //System.out.println("s1 problem!");
962 System.out.println("s range = "+s0+" to "+s1);
965 while (s0 < s1 && t0 < t1) {
966 double sh = this.nextVertical(s0, s1);
1014 System.out.println("final this["+s0+", "+sh+", "+s1
1033 findIntersect(Curve that, double yrange[], double ymin, int slevel, int tlevel, double s0, double xs0, double ys0, double s1, double xs1, double ys1, double t0, double xt0, double yt0, double t1, double xt1, double yt1) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/
H A DSpringLayout.java426 private Spring sum(Spring s1, Spring s2) { argument
427 return (s1 == null || s2 == null) ? null : Spring.sum(s1, s2);
430 private Spring difference(Spring s1, Spring s2) { argument
431 return (s1 == null || s2 == null) ? null : Spring.difference(s1, s2);
497 private boolean defined(List history, String s1, String s2) { argument
498 return history.contains(s1) && history.contains(s2);
/openjdk7/hotspot/src/share/vm/opto/
H A Dsuperword.hpp52 // Definition 3.1 A Pack is an n-tuple, <s1, ...,sn>, where
53 // s1,...,sn are independent isomorphic statements in a basic
331 // Can s1 and s2 be in a pack with s1 immediately preceding s2 and s1 aligned at "align"
332 bool stmts_can_pack(Node* s1, Node* s2, int align);
335 // Is s1 immediately before s2 in memory?
336 bool are_adjacent_refs(Node* s1, Node* s2);
337 // Are s1 and s2 similar?
338 bool isomorphic(Node* s1, Nod
[all...]
/openjdk7/jdk/test/demo/zipfs/
H A DBasic.java88 long s1 = Files.readAttributes(source, BasicFileAttributes.class).size();
90 if (s2 != s1)
/openjdk7/jdk/src/share/native/sun/awt/medialib/
H A Dmlib_c_ImageCopy.c183 data_type s0, s1; \
189 s1 = ps[i * src_stride + j + 1]; \
191 pd[i * dst_stride + j + 1] = s1; \
657 TYPE *tmp, s0, s1; local
689 s1 = *tmp++;
691 *(TYPE *) dp = (s0 >> shl) | (s1 << shr);
693 *(TYPE *) dp = (s0 << shl) | (s1 >> shr);
695 s0 = s1;
/openjdk7/jdk/test/java/util/Collections/
H A DReverseOrder2.java71 public int compare(String s1, String s2) {
72 int i1 = Integer.parseInt(s1);
/openjdk7/jdk/test/java/lang/Double/
H A DParseHexFloatingPoint.java67 String s1 = input;
69 s1 = s1.replace('x', 'X');
72 String s2 = s1;
/openjdk7/jdk/test/java/util/ResourceBundle/
H A DBug4168625Test.java68 final String s1 = bundle.getString("name");
69 if (!s1.equals("Bug4168625Resource2_en_US")) {
323 String s1 = bundle.getString("Bug4168625Resource3_en_US");
326 if ((s1 == null) || (s2 == null) || (s3 == null)) {
/openjdk7/jdk/src/solaris/bin/
H A Djava_md_common.c407 * s1(environ) is name=value
412 match_noeq(const char *s1, const char *s2) argument
414 while (*s1 == *s2++) {
415 if (*s1++ == '=')
418 if (*s1 == '=' && s2[-1] == '\0')
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/tty/
H A DEnv.java220 char s1[] = new char[16];
227 s1[i++] = (char)((d < 10) ? ('0' + d) : ('a' + d - 10));
235 s2[j++] = s1[i];
/openjdk7/jdk/test/sun/security/provider/DSA/
H A DTestDSA.java133 byte[] s1 = s.sign();
137 if (!s.verify(s1)) {
146 if (!s.verify(s1)) {
/openjdk7/jdk/test/tools/pack200/pack200-verifier/src/sun/tools/pack/verify/
H A DJarFileCompare.java89 String s1 = (String) l1.get(i);
91 if (s1.compareTo(s2) != 0) {
93 Globals.log("Ordering differs at[" + i + "] = " + s1);

Completed in 59 milliseconds

1234567891011>>