Searched refs:req (Results 126 - 150 of 181) sorted by relevance

12345678

/openjdk7/hotspot/src/share/vm/opto/
H A Dmemnode.cpp440 uint cnt = n->req();
694 for( uint i = 1; i < n->req(); i++ ) {
1186 if (base->is_Phi() && base->req() == 3) {
1190 for (uint i = 1; i < base->req(); i++) {
1308 uint cnt = mem->req();
1347 for (uint i = 1; i < region->req(); i++) {
1361 for (uint j = 1; j < this->req(); j++) {
2858 if (can_reshape && req() == (Precedent + 1) &&
2960 // The first one is at in(RawStores), the last at in(req()-1).
3043 return (req() > RawStore
[all...]
H A Dloopnode.cpp102 for (; i < n->req(); i++) {
253 for( i = 0; i < n->req(); ++i ) {
269 if (x->in(LoopNode::Self) == NULL || x->req() != 3)
333 if (incr->as_Phi()->region() != x || incr->req() != 3)
1007 if (expr == NULL || expr->req() != 3) return NULL;
1085 for (uint i = 1; i < phi->req(); i++) {
1194 uint oreq = _head->req();
1242 if (j < use->req()) use->set_req (j, id_old_phi);
1368 for( i = 2; i < _head->req(); i++ ) {
1391 for( i = 2; i < _head->req();
[all...]
H A Dmatcher.cpp168 for (uint j = 0; j < n->req(); j++) {
660 for( i=1; i < root->req(); i++ ) {
673 for( i=1; i < root->req(); i++ ) {
687 for( i=1; i < root->req(); i++ ) {
782 for( uint j=1; j < root->req(); j++ )
874 for (uint i = 1; i < n->req(); i++) {
1042 for (i = oldn->req(); (uint)i < oldn->len(); i++) {
1050 int cnt = n->req();
1393 uint cnt = n->req();
1402 if( i < m->req() )
[all...]
H A Dmacro.cpp52 uint req = use->req(); local
56 if (j < req)
61 } else if (j >= req && uin == NULL) {
73 assert (new_dbg_start == newcall->req(), "argument count mismatch");
76 for (uint i = old_dbg_start; i < oldcall->req(); i++) {
276 if (this_region->is_Region() && this_region->req() == 3) {
410 uint length = mem->req();
515 for (uint i = 1; i < mem->req(); i++) {
721 uint first_ind = sfpt->req();
[all...]
H A Dsuperword.cpp696 if (s1->req() != s2->req()) return false;
782 assert(s1->req() == s2->req(), "just checking");
790 int end = s1->is_Store() ? MemNode::ValueIn+1 : s1->req();
817 assert(s1->req() == s2->req(), "just checking");
858 uint ct = u1->req();
859 if (ct != u2->req()) return false;
883 for (uint i = 1; i < s1->req();
[all...]
H A DgraphKit.cpp139 assert(map()->req() <= jvms()->endoff(), "no extra garbage on map");
192 Node* ex_oop = ex_map->in(ex_map->req()-1);
193 if (clear_it) ex_map->del_req(ex_map->req()-1);
213 return ex_map->req() == ex_map->jvms()->endoff()+1;
295 for (uint i = 0; i < map()->req(); i++) map()->init_req(i, top());
297 while (map()->req() < jvms->endoff()) map()->add_req(top());
312 uint limit = srcphi->req();
336 assert(ex_map->req() == phi_map->req(), "matching maps");
368 uint orig_width = region->req();
[all...]
H A Dcompile.cpp303 if (j < use->req())
2366 if (mem->req() > MemNode::OopStore) {
2371 for (uint i = mem->req(); i < mem->len(); i++) {
2401 if( n->req() == 3 && // two-input instruction
2789 uint cnt = n->req();
2854 if (n->req()-1 > 2) {
2857 Node* btp = p->binary_tree_pack(this, 1, n->req());
2898 if (n->req() > MemBarNode::Precedent) {
2921 uint cnt = root->req();
2932 cnt = m->req();
[all...]
H A Ddomgraph.cpp108 for( uint j=1; j < whead->req(); j++ ) {
433 for( uint j=0; j < whead->req(); j++ ) { // For each predecessor
463 for( uint i = 1; i < whead->req(); i++ ) {
H A Doutput.cpp1453 for (uint prec = mach->req(); prec < mach->len(); prec++) {
2307 if( (op == Op_Node && n->req() == 0) || // anti-dependence node OR
2624 for( uint i=1; i<n->req(); i++ ) {
2649 assert( from->req() == 1 && (from->len() == 1 || from->in(1)==0), "no precedence edges on projections" );
2710 for( uint i=1; i<uses->req(); i++ ) {
2737 pinch->req() == 1 ) { // pinch not yet in block?
2834 for( uint j=0; j<n->req(); j++ ) {
2850 for (uint k = 1; k < m->req(); k++) {
2917 (pinch->req() == pinch->len() || pinch->in(pinch->req())
[all...]
H A Dparse1.cpp191 assert((int)jvms()->endoff() == (int)map()->req(), "sanity");
365 if (bad_type_exit->control()->req() > 1) {
575 assert(jvms()->endoff() == map()->req(), "map matches JVMS layout");
776 for (; i < map->req(); i++) {
1589 for (uint j = 1; j < newin->req(); j++) {
1783 uint pnum = r->req();
1786 for (uint i = 1; i < map->req(); i++) {
1793 assert(phi->req() == pnum, "must be same size as region");
1799 assert(n->req() == pnum, "must be same size as region");
1997 phi->del_req(phi->req()
[all...]
H A Daddnode.hpp150 Node *base_node() { assert( req() > Base, "Missing base"); return in(Base); }
H A Difg.cpp366 for( uint k = 1; k < n->req(); k++ )
388 // Checking req() and num_opnds() does NOT distinguish addI_cout from addI_cout_imm
389 if( (op == Op_AddI && mach->req() == 3 && mach->num_opnds() == 3) &&
400 for( uint k = 1; k < n->req(); k++ ) {
754 for( uint k = ((n->Opcode() == Op_SCMemProj) ? 0:1); k < n->req(); k++ ) {
H A Dpostaloc.cpp141 for (uint i = 1; i < old->req(); i++) {
507 for( k=1; k<phi->req(); k++ ) {
558 for( k = 1; k < n->req(); k++ ) {
593 for( k = 1; k < n->req(); k++ )
/openjdk7/jdk/src/solaris/classes/sun/awt/X11/
H A DXWindowPeer.java1261 XClientMessageEvent req = null;
1268 req = new XClientMessageEvent();
1269 req.set_type(XConstants.ClientMessage);
1270 req.set_window(getWindow());
1271 req.set_message_type(netStartupInfoBeginAtom.getAtom());
1272 req.set_format(8);
1278 XlibWrapper.unsafe.putByte(req.get_data() + i, message[pos + i]);
1281 XlibWrapper.unsafe.putByte(req.get_data() + i, (byte)0);
1287 req.pData);
1288 req
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DCheck.java266 * @param req The type that was required.
268 Type typeError(DiagnosticPosition pos, Object problem, Type found, Type req) { argument
269 log.error(pos, "prob.found.req",
270 problem, found, req);
274 Type typeError(DiagnosticPosition pos, String problem, Type found, Type req, Object explanation) { argument
275 log.error(pos, "prob.found.req.1", problem, found, req, explanation);
292 log.error(pos, "type.found.req", found, required);
427 * @param req The type that was required.
429 Type checkType(DiagnosticPosition pos, Type found, Type req) { argument
433 checkType(DiagnosticPosition pos, Type found, Type req, String errKey) argument
497 checkCastable(DiagnosticPosition pos, Type found, Type req) argument
[all...]
/openjdk7/jdk/test/sun/security/ssl/sun/net/www/httpstest/
H A DHttpServer.java448 String[] req = requestline.split (" ");
449 if (req.length < 2) {
453 String cmd = req[0];
456 uri = new URI (req[1]);
/openjdk7/jdk/test/sun/net/www/httptest/
H A DHttpServer.java263 String[] req = requestline.split (" ");
264 if (req.length < 2) {
268 String cmd = req[0];
271 uri = new URI (req[1]);
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orb/
H A DORBImpl.java666 public synchronized void send_multiple_requests_oneway(Request[] req) argument
671 for (int i = 0; i < req.length; i++) {
672 req[i].send_oneway();
679 * @param req an array of request objects.
681 public synchronized void send_multiple_requests_deferred(Request[] req) argument
686 for (int i = 0; i < req.length; i++) {
687 dynamicRequests.addElement(req[i]);
691 for (int i = 0; i < req.length; i++) {
693 (com.sun.corba.se.impl.corba.RequestImpl)req[i], true);
/openjdk7/hotspot/src/share/vm/asm/
H A DcodeBuffer.cpp329 relocInfo* req = end + relocInfo::length_limit; local
331 if (req >= locs_limit() || offset >= relocInfo::offset_limit()) {
332 req += (uint)offset / (uint)relocInfo::offset_limit();
333 if (req >= locs_limit()) {
335 expand_locs(locs_count() + (req - end));
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/modeler/wsdl/
H A DWSDLModeler.java1627 private List<Parameter> getDoclitParameters(Request req, Response res, List<MessagePart> parameterList) { argument
1646 req.addBodyBlock(block);
1650 req.addBodyBlock(block);
1655 req.addUnboundBlock(block);
1659 req.addUnboundBlock(block);
1683 req.addBodyBlock(block);
1687 req.addBodyBlock(block);
1692 req.addHeaderBlock(block);
1696 req.addHeaderBlock(block);
1707 req
1803 getRpcLitParameters(Request req, Response res, Block reqBlock, Block resBlock, List<MessagePart> paramList) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/jar/
H A DJarVerifier.java669 List req = new ArrayList(cs.length);
674 req.add(match);
681 final List signersReq = req;
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpRequestTree.java64 // @param req The SnmpMibRequest that will be segmented in this
76 SnmpRequestTree(SnmpMibRequest req, boolean creationflag, int pdutype) { argument
77 this.request = req;
78 this.version = req.getVersion();
/openjdk7/corba/src/share/classes/org/omg/CORBA/
H A DORB.java682 * @param req an array of request objects
684 abstract public void send_multiple_requests_oneway(Request[] req); argument
689 * @param req an array of <code>Request</code> objects
691 abstract public void send_multiple_requests_deferred(Request[] req); argument
/openjdk7/jdk/src/share/classes/sun/net/httpserver/
H A DServerImpl.java538 Request req = new Request (rawin, rawout);
539 requestLine = req.requestLine();
563 Headers headers = req.headers();
590 method, uri, req, clen, connection
/openjdk7/jdk/src/solaris/native/sun/awt/
H A Dawt_InputMethod.c468 setXICFocus(XIC ic, unsigned short req) argument
474 if (req == 1)
1683 jboolean req,
1693 jboolean req,
1705 if (req) {
1741 setXICFocus(pX11IMData->current_ic, req);
1755 setXICFocus(pX11IMData->current_ic, req);

Completed in 157 milliseconds

12345678