Searched defs:use (Results 51 - 59 of 59) sorted by relevance

123

/openjdk7/jdk/src/windows/native/sun/nio/fs/
H A DWindowsNativeDispatcher.c151 account_use = (*env)->GetFieldID(env, clazz, "use", "I");
835 SID_NAME_USE use; local
839 if (LookupAccountSidW(NULL, sid, &name[0], &nameLen, &domain[0], &domainLen, &use) == 0) {
853 (*env)->SetIntField(env, obj, account_use, (jint)use);
865 SID_NAME_USE use; local
868 &domain[0], &domainLen, &use) == 0)
/openjdk7/hotspot/src/share/vm/opto/
H A DloopTransform.cpp158 // No exit count so use
534 Node* use = new_head->fast_out(j2); local
535 if (use->in(0) == new_head && use->req() == 3 && use->is_Phi()) {
536 _igvn.hash_delete(use);
537 use->set_req(LoopNode::LoopBackControl, C->top());
1072 // use by range check elimination.
1085 // main loop guard test to use lt or gt depending on stride
1087 // positive stride use <
2588 Node* use = iter.get(); local
[all...]
H A Dloopnode.cpp111 early != cin) { // If not equal, must use slower algorithm
686 // Clone code, as old values may be in use.
969 // bias >= 0 if stride >0, so if stride is 2^n we can use &(-stride)
1237 Node* use = old_phi->last_out(i); local
1238 igvn.rehash_node_delayed(use);
1240 for (uint j = 0; j < use->len(); j++) {
1241 if (use->in(j) == old_phi) {
1242 if (j < use->req()) use->set_req (j, id_old_phi);
1243 else use
3170 verify_dominance(Node* n, Node* use, Node* LCA, Node* early) argument
3203 Node *use = c->in(0)->in(j); local
3211 Node *use = has_ctrl(c) ? get_ctrl(c) : c->in(0); local
3387 Node* use = n->raw_out(i); local
[all...]
H A Dmacro.cpp47 // Replace any references to "oldref" in inputs to "use" with "newref".
50 int PhaseMacroExpand::replace_input(Node *use, Node *oldref, Node *newref) { argument
52 uint req = use->req();
53 for (uint j = 0; j < use->len(); j++) {
54 Node *uin = use->in(j);
57 use->set_req(j, newref);
59 use->set_prec(j, newref);
593 Node* use = res->fast_out(j); local
595 if (use->is_AddP()) {
596 const TypePtr* addp_type = _igvn.type(use)
856 Node *use = res->last_out(j); local
896 Node *use = _resproj->last_out(j); local
1441 Node *use = _memproj_fallthrough->fast_out(i); local
1456 Node *use = _memproj_catchall->fast_out(i); local
1473 Node *use = _ioproj_fallthrough->fast_out(i); local
1488 Node *use = _ioproj_catchall->fast_out(i); local
[all...]
H A Doutput.cpp88 // TODO: Should use a ShouldNotReachHereNode...
614 assert( local, "use _top instead of null" );
1279 assert(delay_slot == NULL, "no use of delay slot node");
1629 // We can use the same code as for the normal deopt handler, we
1900 Node *use = bb->_nodes[j]; local
1901 uint nlen = use->len();
1905 Node *def = use->in(k);
1909 uint l = _node_latency[def->_idx] + use->latency(k);
1914 _node_latency[use->_idx] = latency;
1919 use
2728 anti_do_use( Block *b, Node *use, OptoReg::Name use_reg ) argument
2820 Node* use = n->fast_out(i); local
2943 Node* use = pinch->last_out(i); local
[all...]
H A Dsuperword.cpp132 // 7) The set of pack pairs is extended by following use->def and def->use links.
175 // following use->def and def->use links. The align positions are
535 // If no dependency yet, use slice
629 // Do not use superword for non-primitives
674 // Do not use superword for non-primitives
756 // Extend packset by following use->def and def->use links from pack members.
856 // Is the use o
1118 Node* use = def->fast_out(j); local
1153 Node* use = current->out(i); local
1177 Node* use = insert_pt->out(i); local
1226 Node* use = current->out(i); local
1264 Node* use = upper_insert_pt->out(i); local
1282 Node* use = current->out(i); local
1522 Node* use = def->fast_out(j); local
1535 Node* use = _n_idx_list.node(); local
1557 is_vector_use(Node* use, int u_idx) argument
1665 Node *use = n->fast_out(i); local
1809 Node *use = in->fast_out(k); local
[all...]
H A Dcompile.cpp217 // This is the first use of this intrinsic as a virtual call.
223 // This is the first use of this intrinsic as a non-virtual
298 Node* use = n->last_out(i); local
299 bool is_in_table = initial_gvn()->hash_delete(use);
301 for (uint j = 0; j < use->len(); j++) {
302 if (use->in(j) == n) {
303 if (j < use->req())
304 use->set_req(j, nn);
306 use->set_prec(j, nn);
312 initial_gvn()->hash_find_insert(use);
2770 Node *use = i.get(); local
3224 Node* use = n->raw_out(i); local
[all...]
H A Dmemnode.cpp583 // Can't use optimize_simple_memory_chain() since it needs PhaseGVN.
899 "use LoadKlassNode instead");
902 "use LoadRangeNode instead");
1355 // Alter data node to use pre-phi inputs
1557 // to use one kind of load over the other. See AndINode::Ideal and 4965907.
1687 // Check for overflowing; use unsigned compare to handle the negative case.
1723 // Check for overflowing; use unsigned compare to handle the negative case.
1983 // %%% should use stronger assert_unique_concrete_subtype instead
2481 Node *use = adr->fast_out(i); local
2482 int opc = use
[all...]
/openjdk7/langtools/test/tools/javac/T5090006/
H A Dbroken.jarMETA-INF/ META-INF/MANIFEST.MF junit/ junit/framework/ junit/framework/Assert.class Assert. ...

Completed in 83 milliseconds

123