/openjdk7/hotspot/src/share/vm/opto/ |
H A D | callGenerator.cpp | 76 assert(jvms->depth() == 1, "no inline OSR"); 86 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) { 300 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), msg);
|
H A D | loopnode.hpp | 342 uint8 _nest; // Nesting depth 365 // Set loop nesting depth. Accumulate has_call bits. 366 int set_nest( uint depth ); 568 // when a node has many uses and dominator depth is deep. 720 GrowableArray<uint>* _dom_stk; // For recomputation of dom depth 873 bool is_scaled_iv_plus_offset(Node* exp, Node* iv, int* p_scale, Node** p_offset, int depth = 0);
|
H A D | macro.cpp | 382 // Note: this function is recursive, its depth is limied by the "level" argument 1865 int max_depth = youngest_jvms->depth(); 1866 for (int depth = 1; depth <= max_depth; depth++) { 1867 JVMState* jvms = youngest_jvms->of_depth(depth);
|
H A D | block.hpp | 133 // used to find loops, loop nesting depth, dominators, etc. 557 void compute_loop_depth(int depth);
|
H A D | matcher.cpp | 2402 void State::dump(int depth) { 2403 for( int j = 0; j < depth; j++ ) 2411 for( int j = 0; j < depth; j++ ) 2422 _kids[i]->dump(depth+1);
|
H A D | parse2.cpp | 902 for (int depth = 4; depth > 0; depth--) { 957 int bc_depth = - Bytecodes::depth(iter().cur_bc());
|
H A D | node.hpp | 421 // Strip away casting. (It is depth-limited.) 506 // Classes with the same hierarchy depth are sorted by usage frequency. 994 void dump(int depth) const; // Print this node, recursively to depth d 995 void dump_ctrl(int depth) const; // Print control nodes, to depth d
|
H A D | memnode.cpp | 1686 juint depth = (tkls->offset() - in_bytes(Klass::primary_supers_offset())) / sizeof(klassOop); local 1688 if( depth < ciKlass::primary_super_limit() ) { 1692 ciKlass *ss = klass->super_of_depth(depth); 1713 // shallow enough depth. Even though the klass is not exact, entries less 1714 // than or equal to its super depth are correct. 1722 juint depth = (tkls->offset() - in_bytes(Klass::primary_supers_offset())) / sizeof(klassOop); local 1724 if( depth < ciKlass::primary_super_limit() && 1725 depth <= klass->super_depth() ) { // allow self-depth checks to handle self-check case 1729 ciKlass *ss = klass->super_of_depth(depth); [all...] |
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | jvm.cpp | 679 JVM_ENTRY(jclass, JVM_GetCallerClass(JNIEnv* env, int depth)) 681 klassOop k = thread->security_get_caller_class(depth); 3189 int depth = 0; variable 3196 depth++; 3208 objArrayOop result = oopFactory::new_objArray(SystemDictionary::Class_klass(), depth, CHECK_NULL); 3215 assert(index == depth, "just checking"); 3233 int depth = 0; variable 3240 return depth; 3242 depth++; 3252 int depth variable [all...] |
H A D | jvmtiRedefineClasses.cpp | 2843 // Branch at each depth in the binary tree is: 2846 // where 'prefix' is the prefix at that 'depth' (first prefix, second prefix,...) 2847 methodOop search_prefix_name_space(int depth, char* name_str, size_t name_len, argument 2858 if (depth < prefix_count) { 2860 method = search_prefix_name_space(depth+1, name_str, name_len, signature); 2867 char* prefix = prefixes[depth]; 2873 method = search_prefix_name_space(depth+1, trial_name_str, trial_len,
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | thread.hpp | 1429 // Returns method at 'depth' java or native frames down the stack 1431 klassOop security_get_caller_class(int depth); 1444 void print_frame_layout(int depth = 0, bool validate_only = false) NOT_DEBUG_RETURN; 1450 int depth() const; 1763 address low_addr; // Limit on the address for deepest stack depth
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/ |
H A D | XMLDTDScannerImpl.java | 176 /** Markup depth. */ 693 int depth = fPEDepth; 703 if (depth != fPEDepth && fEntityScanner.isExternal()) { 1620 // store at which depth of entities we start 2032 int depth = fPEDepth; 2035 return !spaceRequired || sawSpace || (depth != fPEDepth); 2074 private final void pushPEStack(int depth, boolean report) { argument 2086 fPEStack[fPEDepth++] = depth;
|
/openjdk7/jdk/src/share/classes/javax/swing/plaf/synth/ |
H A D | SynthTreeUI.java | 683 protected int getRowX(int row, int depth) { argument 684 return super.getRowX(row, depth) + padding;
|
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/ |
H A D | VirtualMachineImpl.java | 744 void printReceiveTrace(int depth, String string) { argument 746 for (int i = depth; i > 0; --i) {
|
/openjdk7/jdk/src/solaris/native/sun/java2d/x11/ |
H A D | XRBackendNative.c | 306 jint drawable, jint depth, 309 width, height, depth); 305 Java_sun_java2d_xr_XRBackendNative_createPixmap(JNIEnv *env, jobject this, jint drawable, jint depth, jint width, jint height) argument
|
/openjdk7/jdk/src/share/native/sun/awt/libpng/ |
H A D | pngset.c | 976 to->depth = from->depth;
|
H A D | pngrutil.c | 1385 /* A sample depth should follow the separator, and we should be on it */ 1394 new_palette.depth = *entry_start++; 1395 entry_size = (new_palette.depth == 8 ? 6 : 10); 1437 if (new_palette.depth == 8) 1461 if (new_palette.depth == 8)
|
H A D | pngwutil.c | 706 "Invalid bit depth for grayscale image"); 716 png_error(png_ptr, "Invalid bit depth for RGB image"); 732 png_error(png_ptr, "Invalid bit depth for paletted image"); 738 png_error(png_ptr, "Invalid bit depth for grayscale+alpha image"); 749 png_error(png_ptr, "Invalid bit depth for RGBA image"); 1198 png_size_t entry_size = (spalette->depth == 8 ? 6 : 10); 1217 png_write_chunk_data(png_ptr, &spalette->depth, (png_size_t)1); 1223 if (spalette->depth == 8) 1247 if (spalette->depth == 8) 1297 png_warning(png_ptr, "Invalid sBIT depth specifie [all...] |
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/ |
H A D | XBaseWindow.java | 48 DEPTH = "visual depth", // depth, Integer 336 Integer depth = (Integer)params.get(DEPTH); 371 depth.intValue(), // depth
|
/openjdk7/hotspot/src/share/vm/services/ |
H A D | management.cpp | 1146 max_depth, /* stack depth */ 1159 // maxDepth - the maximum depth of stack traces to be dumped: 1324 // Create int[] filled with the stack depth where a monitor was locked 1339 // Constructs Object[] and int[] to contain the object monitor and the stack depth 1351 for (int depth = 0; depth < num_frames; depth++) { 1352 StackFrameInfo* frame = stacktrace->stack_frame_at(depth); 1359 depths_array->int_at_put(count, depth); 1369 // Monitor locked via JNI MonitorEnter call doesn't have stack depth inf [all...] |
/openjdk7/hotspot/src/share/vm/adlc/ |
H A D | adlparse.cpp | 2432 int lparen = 0; // keep track of parenthesis nesting depth 2433 int rparen = 0; // position of instruction at this depth 2645 int lparen = 0; // keep track of parenthesis nesting depth 2646 int rparen = 0; // keep track of parenthesis nesting depth 3532 int depth = 0; // Counter for matching parentheses local 3536 MatchNode *mnode = matchNode_parse(operands, depth, numleaves, true); 3552 match = new MatchRule(_AD, mnode, depth, cnstr, numleaves); 4003 MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) { argument 4004 // Count depth of parenthesis nesting for both left and right children 4005 int lParens = depth; [all...] |
H A D | formssel.hpp | 988 int _depth; // Expression tree depth 996 MatchRule(ArchDesc &ad, MatchNode* mroot, int depth, char* construct, int numleaves);
|
/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | awt_InputMethod.c | 672 unsigned int w, h, bw, depth; local 686 XGetGeometry(dpy, parent, &rootWindow, &x, &y, &w, &h, &bw, &depth); 754 xwa.depth,
|
/openjdk7/jdk/make/common/ |
H A D | Release.gmk | 818 $(CD) $(OUTPUTDIR) && $(FIND) bin -depth | $(CPIO) -pdum $(JRE_IMAGE_DIR) 822 $(CD) $(OUTPUTDIR) && $(FIND) lib -depth | $(CPIO) -pdum $(JRE_IMAGE_DIR) 977 ($(CD) $(JRE_IMAGE_DIR) && $(FIND) . -depth -print \
|
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.cpp | 2574 int depth1 = depth(); 2575 int depth2 = lp->depth(); 2586 // ciTypeFlow::Loop::depth 2588 // Loop depth 2589 int ciTypeFlow::Loop::depth() const { function in class:ciTypeFlow::Loop 2616 // Perform the depth first type flow analysis. Helper for flow_types. 2651 // This can happen when try/finally constructs are nested to depth N,
|