Searched refs:depth (Results 51 - 75 of 320) sorted by relevance

1234567891011>>

/openjdk7/jdk/make/tools/src/build/tools/jdwpgen/
H A DArrayRegionTypeNode.java41 public void genJavaWrite(PrintWriter writer, int depth, argument
H A DConstantNode.java50 void genJava(PrintWriter writer, int depth) { argument
51 indent(writer, depth);
H A DRootNode.java54 void genJava(PrintWriter writer, int depth) { argument
61 genJavaClass(writer, depth);
/openjdk7/jdk/src/solaris/javavm/export/
H A Djawt_md.h47 int depth; member in struct:jawt_X11DrawingSurfaceInfo
/openjdk7/jdk/src/share/classes/sun/tools/asm/
H A DLabel.java43 int depth; field in class:Label
56 * labels that are immediately folowed by another label. The depth
61 if ((next != null) && (next != this) && (depth == 0)) {
62 depth = 1;
106 depth = 0;
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/
H A DObjArrayCalls.java54 Node(Object parent, int depth) { argument
56 if (depth > 0) {
57 left = new Node(this, depth - 1);
58 right = new Node(this, depth - 1);
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/marshaller/
H A DDataWriter.java194 depth = 0;
231 if (depth > 0) {
236 depth++;
261 depth--;
303 // if (depth > 0) {
346 if (depth > 0) {
348 for( int i=0; i<depth; i++ )
373 private int depth = 0; field in class:DataWriter
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/txw2/output/
H A DIndentingXMLStreamWriter.java44 private int depth = 0; field in class:IndentingXMLStreamWriter
92 if (depth > 0) {
96 depth++;
100 depth--;
110 if (depth > 0) {
124 if (depth > 0) {
125 for (int i = 0; i < depth; i++)
/openjdk7/hotspot/test/compiler/5091921/
H A DTest6890943.java71 if (depth(q) != (digDown)) continue;
124 if (depth(m.getKey()) == r-1) result = Math.min(m.getValue(), result);
150 private int depth(int q) { method in class:Test6890943
162 private int calcWalkingRange(int depth, int pos) { argument
163 return calcWalkingRange(depth, pos, Integer.MAX_VALUE, Integer.MIN_VALUE);
166 private int calcWalkingRange(int depth, int pos, int airOverrideStart, int airOverrideEnd) { argument
168 if (depth >= r) return (c-1)*50 + depth;
171 if (grid[depth][left-1] == ROCK && (left-1 < airOverrideStart || left-1 > airOverrideEnd)) break;
172 if (depth <
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/stream/buffer/stax/
H A DStreamWriterBufferProcessor.java184 int depth = 0; // used to determine when we are done with a tree.
198 depth ++;
203 writeAttributes(writer, isInscope(depth));
207 depth ++;
212 writeAttributes(writer, isInscope(depth));
216 depth ++;
220 writeAttributes(writer, isInscope(depth));
224 depth ++;
227 writeAttributes(writer, isInscope(depth));
281 depth
400 isInscope(int depth) argument
[all...]
/openjdk7/jdk/test/java/beans/XMLDecoder/
H A DTest4864117.java96 private int depth; field in class:Test4864117
112 if (this.depth > 0) {
117 this.depth++;
122 this.depth--;
124 if (this.depth > 0) {
142 for (int i = 0; i < this.depth; i++) sb.append(' ');
/openjdk7/jdk/src/share/classes/sun/misc/
H A DRegexpPool.java105 if (p.result != null && p.depth < BIG
117 if (p.result != null && p.depth < BIG) {
202 if (p.result != null && p.depth < lastMatchDepth
204 lastDepth = p.depth;
216 if (p.result != null && p.depth < lastMatchDepth) {
217 lastDepth = p.depth;
265 int depth; field in class:RegexpNode
272 depth = 0;
274 RegexpNode (char C, int depth) { argument
276 this.depth
[all...]
/openjdk7/jdk/src/share/back/
H A DstepControl.h35 jint depth; member in struct:__anon508
39 jboolean frameExited; /* for depth == STEP_OVER or STEP_OUT */
61 jint size, jint depth, HandlerNode *node);
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/serial/
H A DCustomObjTrees.java54 Node(Object parent, int depth) { argument
56 if (depth > 0) {
57 left = new Node(this, depth - 1);
58 right = new Node(this, depth - 1);
100 * Arguments: <tree depth> <# batches> <# cycles per batch>
103 int depth = Integer.parseInt(args[0]);
106 Node[] trees = genTrees(depth, ncycles);
123 Node[] genTrees(int depth, int ntrees) { argument
126 trees[i] = new Node(null, depth);
H A DExternObjTrees.java56 Node(Object parent, int depth) { argument
58 if (depth > 0) {
59 left = new Node(this, depth - 1);
60 right = new Node(this, depth - 1);
105 * Arguments: <tree depth> <# batches> <# cycles per batch>
108 int depth = Integer.parseInt(args[0]);
111 Node[] trees = genTrees(depth, ncycles);
128 Node[] genTrees(int depth, int ntrees) { argument
131 trees[i] = new Node(null, depth);
H A DGetPutFieldTrees.java55 Node(Object parent, int depth) { argument
57 if (depth > 0) {
58 left = new Node(this, depth - 1);
59 right = new Node(this, depth - 1);
104 * Arguments: <tree depth> <# batches> <# cycles per batch>
107 int depth = Integer.parseInt(args[0]);
110 Node[] trees = genTrees(depth, ncycles);
127 Node[] genTrees(int depth, int ntrees) { argument
130 trees[i] = new Node(null, depth);
/openjdk7/jdk/src/share/classes/sun/management/snmp/jvmmib/
H A DJvmMemGCTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmMemManagerTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmMemMgrPoolRelTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmMemPoolTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmRTBootClassPathTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmRTClassPathTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmRTInputArgsTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmRTLibraryPathTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);
H A DJvmThreadInstanceTableMeta.java108 public void createNewEntry(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
111 factory.createNewEntry(req, rowOid, depth, this);
162 public void get(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
167 node.get(req,depth);
178 public void set(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
185 node.set(req,depth);
196 public void check(SnmpMibSubRequest req, SnmpOid rowOid, int depth) argument
203 node.check(req,depth);

Completed in 73 milliseconds

1234567891011>>