Searched refs:req (Results 101 - 125 of 181) sorted by relevance

12345678

/openjdk7/langtools/test/tools/javac/scope/7017664/
H A DCompoundScopeTest.java228 void checkSameSymbols(Symbol found, Symbol req) { argument
229 if (found != req) {
231 " required : " + req + ":" + req.hashCode());
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/
H A DXWarningWindow.java283 XEvent req = new XEvent();
294 req.set_type(XConstants.UnmapNotify);
296 XUnmapEvent umev = req.get_xunmap();
308 req.pData);
314 req.dispose();
/openjdk7/hotspot/src/share/vm/opto/
H A DloopPredicate.cpp55 int req = out->as_CallStaticJava()->uncommon_trap_request(); local
56 if (req != 0) {
57 Deoptimization::DeoptReason trap_reason = Deoptimization::trap_request_reason(req);
173 for (; proj_index < rgn->req(); proj_index++)
175 assert(proj_index < rgn->req(), "sanity");
209 assert(rgn->in(rgn->req() -1) == if_uct, "new edge should be last");
220 assert(!has_phi || rgn->req() > 3, "no phis when region is created");
256 for (; proj_index < rgn->req(); proj_index++)
258 assert(proj_index < rgn->req(), "sanity");
281 assert(rgn->in(rgn->req()
[all...]
H A DidealKit.cpp231 while (slot < reg->req() && reg->in(slot) != NULL) slot++;
232 assert(slot < reg->req(), "too many gotos");
234 if (slot == reg->req() - 1) bind = false;
236 assert(first_var + _var_ct == _cvstate->req(), "bad _cvstate size");
237 for (uint i = first_var; i < _cvstate->req(); i++) {
321 for (uint i = 0; i < ns->req(); i++) ns->init_req(i, _cvstate->in(i));
329 for (uint i = 0; i < m->req(); i++) m->set_req(i, NULL);
430 for (slot = 1; slot < join_region->req() ; slot ++ ) {
433 assert(slot != join_region->req(), "edge must already exist");
H A Dloopopts.cpp61 for (uint i = 1; i < region->req(); i++) {
72 for (uint j = 1; j < n->req(); j++) {
141 for (uint i2 = 1; i2 < phi->req(); i2++) {
267 for( i = 1; i < n->req(); i++ ) {
272 if( i >= n->req() )
280 for( i = 1; i < n->req(); i++ ) {
312 if( n->req() < 3 || n->req() > 4 ) return NULL;
316 Node *n3_ctrl = get_ctrl(n->in(n->req() == 3 ? 2 : 3));
473 if (region->req() !
[all...]
H A DbuildOopMap.cpp161 assert( _callees[first] == _callees[regalloc->get_reg_first(n->in(n->req()-1))], "" );
162 assert( _callees[second] == _callees[regalloc->get_reg_second(n->in(n->req()-1))], "" );
297 for( i = jvms->oopoff(); i < n->req(); i+=2 )
299 if( i == n->req() ) { // Missed, try a more generous scan
301 for( i = jvms->oopoff(); i < n->req(); i+=2 ) {
424 if (UseCISCSpill && root->req() > 1) {
429 for( uint i=1; i<root->req(); i++ )
475 for( uint l=1; l<n->req(); l++ ) {
H A Dcallnode.cpp171 for (i = 0; i < req(); i++) { // For all required inputs
214 for (i = 0; i < req(); i++) { // For all required inputs
522 if (_map->len() > _map->req()) { // _map->has_exceptions()
523 Node* ex = _map->in(_map->req()); // _map->next_exception()
525 while (ex != NULL && ex->len() > ex->req()) {
526 ex = ex->in(ex->req()); // ex->next_exception()
589 for (i = 0; i < req(); i++) { // For all required inputs
839 if (!(call->req() > TypeFunc::Parms &&
939 if (len() == req()) {
942 set_prec(req(),
[all...]
H A DphaseX.cpp104 uint req = n->req(); local
106 if( k->req() == req && // Same count of inputs
108 for( uint i=0; i<req; i++ )
156 uint req = n->req(); local
158 if( k->req() == req && // Same count of inputs
160 for( uint i=0; i<req;
[all...]
H A Dlive.cpp100 uint cnt = n->req();
292 if (jvms->oopoff() < sfpt->req()) {
294 for (uint idx = jvms->oopoff(); idx < sfpt->req(); idx++) {
309 for (uint m = 1; m < check->req(); m++)
H A Difnode.cpp89 for( i4 = 1; i4 < phi->req(); i4++ ) {
98 if( i4 >= phi->req() ) return NULL; // Found no constants
160 // for( uint i = 1; i < r->req(); i++ )
188 for( uint l = 1; l < v->req(); l++ ) {
227 for (uint ii = 1; ii < r->req(); ii++) {
243 uint len = r->req();
346 for (uint i3 = 1; i3 < r->req(); i3++)
387 for( i = 1; i < v->req(); i++ )
410 for( uint j = 0; j < x->req(); j++ ) {
491 int req local
[all...]
H A Dreg_split.cpp55 for (uint i = 1; i < def->req(); ++i) {
326 if( def->req() > 1 ) {
327 for( uint i = 1; i < def->req(); i++ ) {
353 if( spill->req() > 1 ) {
354 for( uint i = 1; i < spill->req(); i++ ) {
443 for( uint j = 1; j < n->req(); j++ )
734 uint cnt = n->req();
810 for( i = 1; i < n->req(); i++ )
814 if( i < n->req() ) break;
953 assert(((n->req()
[all...]
H A Dlcm.cpp255 for( j = mach->req()-1; j > 0; j-- ) {
390 for (uint i3 = 0; i3 < old_tst->req(); i3++)
485 for (uint j = 0; j < n->req() ; j++) {
501 uint n_score = n->req(); // Many inputs get high score to break ties
713 for (uint prec = n->req(); prec < n->len(); prec++) {
725 if( n->is_Mach() && n->req() > TypeFunc::Parms &&
898 if (l < use->req()) {
1052 for( uint k = 1; k < use->req(); k++ )
H A Dloopnode.hpp97 return req() == 3 && in(0) != NULL &&
256 Node *cmp_node() const { return (in(TestValue)->req() >=2) ? in(TestValue)->in(1) : NULL; }
257 Node *incr() const { Node *tmp = cmp_node(); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
258 Node *limit() const { Node *tmp = cmp_node(); return (tmp && tmp->req()==3) ? tmp->in(2) : NULL; }
259 Node *stride() const { Node *tmp = incr (); return (tmp && tmp->req()==3) ? tmp->in(2) : NULL; }
260 Node *phi() const { Node *tmp = incr (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
261 Node *init_trip() const { Node *tmp = phi (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
695 assert( old_node->req() == 1, "use this for Projs" );
/openjdk7/jdk/test/com/sun/net/httpserver/
H A DFileServerHandler.java145 Headers req = t.getRequestHeaders();
148 String host = req.getFirst ("Host");
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/gui/
H A DSourceTool.java141 BreakpointRequest req = (BreakpointRequest)e.getEventRequest();
142 Location loc = req.location();
155 BreakpointRequest req = (BreakpointRequest)e.getEventRequest();
156 Location loc = req.location();
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/corba/
H A DServerRequestImpl.java72 public ServerRequestImpl (CorbaMessageMediator req, ORB orb) { argument
73 _opName = req.getOperationName();
74 _ins = (InputStream)req.getInputObject();
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DNode.java97 public int req() { method in class:Node
219 for (i = 0; i < req(); i++) {
229 if (len() != req()) {
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpMibGroup.java170 * @param req The sub-request that must be handled by this node.
177 abstract public void get(SnmpMibSubRequest req, int depth) argument
199 * @param req The sub-request that must be handled by this node.
206 abstract public void set(SnmpMibSubRequest req, int depth) argument
230 * @param req The sub-request that must be handled by this node.
237 abstract public void check(SnmpMibSubRequest req, int depth) argument
/openjdk7/jdk/src/windows/native/sun/nio/ch/
H A DNet.c419 struct my_group_source_req req; local
422 req.gsr_interface = (ULONG)index;
424 sin6 = (struct sockaddr_in6*)&(req.gsr_group);
428 sin6 = (struct sockaddr_in6*)&(req.gsr_source);
432 return setsockopt(fdval(env,fdo), IPPROTO_IPV6, opt, (void*)&req, sizeof(req));
/openjdk7/jdk/test/sun/security/ssl/sun/net/www/protocol/https/HttpsURLConnection/
H A DTunnelProxy.java237 String[] req = requestline.split (" ");
238 if (req.length < 2) {
242 String cmd = req[0];
249 uri = new URI("http://" + req[1]);
/openjdk7/jdk/src/share/classes/sun/awt/im/
H A DInputMethodContext.java151 InputMethodRequests req = client.getInputMethodRequests();
152 if (req != null) {
/openjdk7/jdk/test/com/sun/jdi/
H A DMultiBreakpointsTest.java242 BreakpointRequest req = (BreakpointRequest)event.request();
244 if (req == bkpts[ii]) {
/openjdk7/jdk/test/com/sun/jdi/redefine/
H A DRedefineTest.java294 EventRequest req = erm.createBreakpointRequest(loc);
295 req.enable();
/openjdk7/jdk/test/javax/print/attribute/
H A DServiceDialogTest.java251 OrientationRequested req[] = { OrientationRequested.PORTRAIT, OrientationRequested.LANDSCAPE };
252 return req;
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/
H A DConnection.java410 LdapRequest req =
412 addRequest(req);
438 return req;
522 synchronized void removeRequest(LdapRequest req) { argument
527 if (ldr == req) {
1026 //System.err.println("ldap.search: Caught " + ex + " building req");

Completed in 146 milliseconds

12345678