Searched defs:be (Results 1 - 7 of 7) sorted by relevance

/openjdk7/jdk/test/java/nio/Buffer/
H A DOrder.java9 * This code is distributed in the hope that it will be useful, but WITHOUT
34 static final ByteOrder be = ByteOrder.BIG_ENDIAN; field in class:Order
54 bb.order(be);
55 ckViews(bb, be);
62 ck(ByteBuffer.allocate(10).order(), be);
63 ck(ByteBuffer.allocateDirect(10).order(), be);
64 ck(ByteBuffer.allocate(10).order(be).order(), be);
/openjdk7/jdk/make/tools/src/build/tools/spp/
H A DSpp.java11 * This code is distributed in the hope that it will be useful, but WITHOUT
35 * Usage: java build.tools.spp.Spp [-be] [-Kkey] -Dvar=value ... <in >out
43 * #end[key] may be negated by prefixing !, e.g., #if[!key]
45 * #begin If -be is specified then lines up to and including
69 boolean be = false;
77 } else if ("-be".equals(arg)) {
78 be = true;
80 System.err.println("Usage: java build.tools.spp.Spp [-be] [-Kkey] -Dvar=value ... <in >out");
88 keys, vars, be,
138 boolean be, boolea
136 spp(Scanner in, StringBuffer buf, String key, Set<String> keys, Map<String, String> vars, boolean be, boolean skip) argument
[all...]
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmserr.c10 * This code is distributed in the hope that it will be useful, but WITHOUT
42 // The above copyright notice and this permission notice shall be included in
58 // that hopefully would be fully portable.
94 // amount of memoy that can be reclaimed. This is mostly as a safety feature to
103 // required to be implemented: malloc, realloc and free, although the user may want to
280 // this way have be freed at once. Next function allocates a single chunk for linked list
282 // memory is being swapped to disk. This approach is safer (although that may not be true on all platforms)
389 // It may be interesting, for the developer, to know why the function is failing.
448 cmsUInt32Number be; local
451 be
[all...]
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/tty/
H A DTTY.java11 * This code is distributed in the hope that it will be useful, but WITHOUT
30 * input validation and proper error handling, might not be present in
90 public void breakpointEvent(BreakpointEvent be) { argument
135 * These can be very numerous, so be as efficient as possible.
140 // We are stopping; the name will be shown by the normal mechanism
153 * These can be very numerous, so be as efficient as possible.
163 // We will be stopping here, so do a newline
173 // We won't be stoppin
[all...]
/openjdk7/jdk/test/java/lang/Class/getEnclosingClass/
H A DEnclosingClass.java9 * This code is distributed in the hope that it will be useful, but WITHOUT
237 public Class<?> be = (new Nested()).nestedAnonymous; field in class:EnclosingClass
/openjdk7/hotspot/src/share/vm/opto/
H A Dreg_split.cpp9 * This code is distributed in the hope that it will be useful, but WITHOUT
162 Node *be = b->end(); local
163 if( be->is_MachNullCheck() && be->in(1) == def && def == b->_nodes[loc] ) {
321 // The input live ranges will be stretched to the site of the new
322 // instruction. They might be stretched past a def and will thus
441 // Ignore PHI use, these can be up or down
562 // be either the phi's or the reaching def, as appropriate.
640 // must be looking at a phi
665 // Reset new phi's mapping to be th
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_IR.cpp9 * This code is distributed in the hope that it will be useful, but WITHOUT
58 // Returns whether a particular exception type can be caught. Also
61 // is known to be exactly that class or it might throw a subtype.
63 // the type is unknown so be conservative
75 // if it's unknown it might be catchable
80 // then it can be caught.
85 // If the type isn't exactly known then it can also be caught by
89 // throw bar can be caught by catch foo, catch bar, and catch
90 // Exception, however it can't be caught by any handlers without
119 assert(entry_block() == other->entry_block(), "entry_block must be equa
286 BlockEnd* be = bb->end(); local
1222 BlockEnd* be = block->end(); local
[all...]

Completed in 359 milliseconds