Searched defs:idx (Results 76 - 100 of 126) sorted by relevance

123456

/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiImpl.cpp623 int idx; local
624 for (idx = 0; idx < super_depth; idx++) {
625 if (Klass::cast(klass->primary_super_of_depth(idx))->name() == ty_sym) {
631 for (idx = 0; idx < sec_supers->length(); idx++) {
632 if (Klass::cast((klassOop) sec_supers->obj_at(idx))->name() == ty_sym) {
/openjdk7/hotspot/src/share/vm/utilities/
H A Dostream.cpp284 size_t idx = i + j - 15; local
285 if (idx < len) {
286 char c = ((char*)data)[idx];
/openjdk7/jdk/src/solaris/native/java/net/
H A DPlainDatagramSocketImpl.c2408 jint idx = (*env)->GetIntField(env, niObj, ni_indexID); local
2409 mname6.ipv6mr_interface = idx;
/openjdk7/jdk/src/windows/native/sun/windows/
H A Dawt_MenuItem.cpp630 int idx; local
631 for (idx = 0; (idx < nMenuItemCount); idx++) {
635 ::GetMenuItemInfo(hMenu, idx, TRUE, &mii1);
639 ::RemoveMenu(hMenu, idx, MF_BYPOSITION);
640 ::InsertMenuItem(hMenu, idx, TRUE, &mii);
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dcoding.cpp961 coding* coding::findByIndex(int idx) { argument
967 if (idx >= _meta_canon_min && idx <= _meta_canon_max)
968 return basic_codings[idx].init();
/openjdk7/jdk/src/share/native/java/util/zip/
H A Dzip_util.c1119 jint idx; local
1127 idx = zip->table[hsh % zip->tablelen];
1151 while (idx != ZIP_ENDCHAIN) {
1152 jzcell *zc = &zip->entries[idx];
1176 idx = zc->next;
1198 idx = zip->table[hsh % zip->tablelen];
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/oops/
H A DGenerateOopMap.java572 int idx = currentBC.hasIndexU4() ? currentBC.getIndexU4() : currentBC.getIndexU2();
573 tty.print(" idx " + idx);
575 int idx = currentBC.getIndexU2();
577 int nameAndTypeIdx = cp.name_and_type_ref_index_at(idx);
612 int idx = currentBC.hasIndexU4() ? currentBC.getIndexU4() : currentBC.getIndexU2();
613 tty.print(" idx " + idx);
615 int idx = currentBC.getIndexU2();
617 int nameAndTypeIdx = cp.name_and_type_ref_index_at(idx);
1677 doAstore(int idx) argument
1692 doField(boolean is_get, boolean is_static, int idx, int bci) argument
1728 doMethod(boolean is_static, boolean is_interface, int idx, int bci) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentSkipListMap.java921 Index<K,V> idx = null;
923 idx = new Index<K,V>(z, idx, null);
924 addIndex(idx, h, level);
937 Index<K,V> idx = null;
939 idxs[i] = idx = new Index<K,V>(z, idx, null);
965 * @param idx the topmost index node being inserted
970 private void addIndex(Index<K,V> idx, HeadIndex<K,V> h, int indexLevel) { argument
973 Comparable<? super K> key = comparable(idx
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp1570 int idx = _index - succ_ct; local
1571 _pred->exceptions()->at_put(idx, succ);
/openjdk7/hotspot/src/share/vm/oops/
H A DconstantPoolOop.cpp1370 for (jint idx = 1; idx < cnt; idx++) {
1375 printf("const #%03d, tag: %02d ", idx, tag);
1413 idx++; // Long takes two cpool slots
1420 idx++; // Double takes two cpool slots
1495 jint constantPoolOopDesc::cpool_entry_size(jint idx) { argument
1496 switch(tag_at(idx).value()) {
1502 return 3 + symbol_at(idx)->utf8_length();
1545 for (u2 idx
[all...]
H A DgenerateOopMap.cpp1283 int idx = currentBC->has_index_u4() ? currentBC->get_index_u4() : currentBC->get_index_u2_cpcache(); local
1285 int nameAndTypeIdx = cp->name_and_type_ref_index_at(idx);
1315 int idx = currentBC->has_index_u4() ? currentBC->get_index_u4() : currentBC->get_index_u2_cpcache(); local
1317 int nameAndTypeIdx = cp->name_and_type_ref_index_at(idx);
1688 int idx = push_ch - '1';
1689 assert(idx >= 0 && idx < poplen, "wrong arguments");
1690 push(actual[idx]);
1877 void GenerateOopMap::do_astore(int idx) { argument
1885 set_var(idx, r_or_
1891 int idx = 0; local
1899 do_field(int is_get, int is_static, int idx, int bci) argument
1929 do_method(int is_static, int is_interface, int idx, int bci) argument
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dcallnode.cpp162 uint ReturnNode::match_edge(uint idx) const {
206 uint RethrowNode::match_edge(uint idx) const {
224 uint TailCallNode::match_edge(uint idx) const {
225 return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1;
230 uint TailJumpNode::match_edge(uint idx) const {
231 return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1;
653 uint CallNode::match_edge(uint idx) const {
915 void SafePointNode::set_local(JVMState* jvms, uint idx, Nod argument
[all...]
H A Dcallnode.hpp127 virtual uint match_edge(uint idx) const;
147 virtual uint match_edge(uint idx) const;
166 virtual uint match_edge(uint idx) const;
180 virtual uint match_edge(uint idx) const;
273 int monitor_box_offset(int idx) const { return monoff() + (idx << logMonitorEdges) + 0; }
274 int monitor_obj_offset(int idx) const { return monoff() + (idx << logMonitorEdges) + 1; }
348 void verify_input(JVMState* jvms, uint idx) const {
350 Node* n = in(idx);
380 set_stack(JVMState* jvms, uint idx, Node *c) argument
384 set_argument(JVMState* jvms, uint idx, Node *c) argument
[all...]
H A Dcfgnode.cpp249 static bool check_convf2i_clipping( PhiNode *phi, uint idx, ConvF2INode * &convf2i, Node *min, Node *max) { argument
253 Node *rshift = phi->in(idx);
H A Dchaitin.cpp566 uint idx = n->is_Copy(); local
574 if( idx ) {
576 uint clidx = n2lidx(n->in(idx));
1679 uint idx = n->is_Copy(); local
1680 if( idx ) liveout.remove( n2lidx(n->in(idx)) );
H A Descape.cpp1950 uint idx = n->_idx; local
1951 if (idx >= nodes_size()) {
1954 PointsToNode* ptn = ptnode_adr(idx);
2003 uint idx = n->_idx; local
2004 if (idx >= nodes_size()) {
2007 PointsToNode* ptn = ptnode_adr(idx);
2358 uint idx = 1; local
2361 while (idx < phi->req()) {
2362 Node *mem = find_inst_mem(phi->in(idx), alias_idx, orig_phi_worklist);
2369 cur_input.push(idx);
2483 int idx = C->get_alias_index(tp); local
2490 int idx = C->get_alias_index(tp); local
2523 int idx = C->get_alias_index(at->is_ptr()); local
2587 int idx = C->get_alias_index(at->is_ptr()); local
3052 uint idx = (uint)_compile->get_alias_index(at->is_ptr()); local
[all...]
H A DgraphKit.hpp443 Node* local(uint idx) const { map_not_null(); return _map->local( _map->_jvms, idx); }
444 Node* stack(uint idx) const { map_not_null(); return _map->stack( _map->_jvms, idx); }
445 Node* argument(uint idx) const { map_not_null(); return _map->argument( _map->_jvms, idx); }
446 Node* monitor_box(uint idx) const { map_not_null(); return _map->monitor_box(_map->_jvms, idx); }
447 Node* monitor_obj(uint idx) const { map_not_null(); return _map->monitor_obj(_map->_jvms, idx); }
451 set_local(uint idx, Node* c) argument
452 set_stack(uint idx, Node* c) argument
453 set_argument(uint idx, Node* c) argument
[all...]
H A Dloopopts.cpp1416 uint idx = 0; local
1417 while( use->in(idx) != old ) idx++;
1424 cfg = prev->in(idx); // NOT in block of Phi itself
1426 _igvn.replace_input_of(use, idx, C->top());
1442 if( idx == 0 ) { // Updating control edge?
1455 if( idx == 0 ) { // Updating control edge?
1464 if( idx != 0 ) {
1476 _igvn.replace_input_of(use, idx, phi);
1852 uint idx local
2020 insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp ) argument
[all...]
H A Dmachnode.hpp81 virtual int reg(PhaseRegAlloc *ra_, const Node *node, int idx) const;
87 Register as_Register(PhaseRegAlloc *ra_, const Node *node, int idx) const {
88 return ::as_Register(reg(ra_, node, idx));
93 FloatRegister as_FloatRegister(PhaseRegAlloc *ra_, const Node *node, int idx) const {
94 return ::as_FloatRegister(reg(ra_, node, idx));
101 XMMRegister as_XMMRegister(PhaseRegAlloc *ra_, const Node *node, int idx) const {
102 return ::as_XMMRegister(reg(ra_, node, idx));
115 virtual int base (PhaseRegAlloc *ra_, const Node *node, int idx) const;
116 virtual int index(PhaseRegAlloc *ra_, const Node *node, int idx) const;
119 virtual int disp (PhaseRegAlloc *ra_, const Node *node, int idx) cons
690 set_local(const JVMState* jvms, uint idx, Node *c) argument
694 set_stack(const JVMState* jvms, uint idx, Node *c) argument
698 set_monitor(const JVMState* jvms, uint idx, Node *c) argument
890 ext_format(PhaseRegAlloc *ra, const MachNode *node, int idx, outputStream *st) const argument
917 ext_format(PhaseRegAlloc *ra, const MachNode *node, int idx, outputStream *st) const argument
[all...]
H A Dnode.cpp137 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range");
290 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) { argument
291 C->set_node_notes_at(idx, nn);
297 int idx = C->next_unique(); local
309 if (nn != NULL) init_node_notes(C, idx, nn);
319 return idx;
765 void Node::del_req( uint idx ) {
766 assert( idx < _cnt, "oob");
770 Node *n = in(idx);
772 _in[idx]
778 ins_req( uint idx, Node *n ) argument
1430 find_recur(Compile* C, Node* &result, Node *n, int idx, bool only_ctrl, VectorSet* old_space, VectorSet* new_space ) argument
1469 find_node(Node* n, int idx) argument
1478 find_recur(Compile::current(), result, (Node*) this, idx, false, &old_space, &new_space ); local
1488 find_recur(Compile::current(), result, (Node*) this, idx, true, &old_space, &new_space ); local
1748 uint i, j, idx; local
[all...]
H A Dnode.hpp383 void del_req( uint idx ); // Delete required edge & compact
907 virtual uint match_edge(uint idx) const;
990 Node* find(int idx) const; // Search the graph for the given idx.
991 Node* find_ctrl(int idx) const; // Search control ancestors for the given idx.
1009 void dump_in_regmask(int idx) { in_RegMask(idx).dump(); } argument
1469 Node* find(uint idx) const;
1527 int idx, boo
1526 locate_node_notes(GrowableArray<Node_Notes*>* arr, int idx, bool can_grow) argument
1540 set_node_notes_at(int idx, Node_Notes* value) argument
[all...]
H A Dparse1.cpp1809 // Turn the idx'th entry of the current map into a Phi
1810 PhiNode *Parse::ensure_phi(int idx, bool nocreate) { argument
1815 Node* o = map->in(idx);
1828 if (jvms->is_loc(idx)) {
1829 t = block()->local_type_at(idx - jvms->locoff());
1830 } else if (jvms->is_stk(idx)) {
1831 t = block()->stack_type_at(idx - jvms->stkoff());
1832 } else if (jvms->is_mon(idx)) {
1833 assert(!jvms->is_monitor_box(idx), "no phis for boxes");
1835 } else if ((uint)idx < TypeFun
1865 ensure_memory_phi(int idx, bool nocreate) argument
[all...]
H A Dparse2.cpp72 Node *idx = peek(0+vals); // Get from stack without popping local
98 const TypeInt* idxtype = _gvn.type(idx)->is_int();
99 // See if the highest idx value is less than the lowest array bound,
100 // and if the idx value cannot be negative:
131 Node* chk = _gvn.transform( new (C) CmpUNode(idx, len) );
150 builtin_throw(Deoptimization::Reason_range_check, idx);
157 Node* ptr = array_element_address(ary, idx, type, sizetype);
/openjdk7/jdk/src/share/classes/com/sun/rowset/internal/
H A DSyncResolverImpl.java2481 * @param idx the index identifier of the column that may be have been updated.
2489 public boolean columnUpdated(int idx) throws SQLException { argument
/openjdk7/hotspot/src/os/posix/launcher/
H A Djava_md.c1821 long idx; /* index into environ */ local
1828 for (idx = 0; environ[idx] != NULL; idx++) {
1829 if (match_noeq(environ[idx], name))
1832 if (environ[idx] == NULL) {
1838 environ[idx] = environ[idx+1];
1839 } while (environ[++idx] != NULL);

Completed in 545 milliseconds

123456