Searched defs:cnt (Results 1 - 25 of 72) sorted by relevance

123

/openjdk7/hotspot/test/compiler/6775880/
H A DTest.java35 int cnt; field in class:Test
41 for (int i=0; i < cnt; i++) {
52 t.cnt = 3;
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/
H A DMachIfNode.java56 float cnt() { method in class:MachIfNode
65 out.print("P=" + prob() + ", C=" + cnt());
/openjdk7/hotspot/src/share/vm/utilities/
H A Darray.cpp90 size_t cnt = (length() - i)*esize; local
91 memmove(dst, src, cnt);
99 size_t cnt = (length() - i)*esize; local
100 memmove(dst, src, cnt);
H A DintHisto.cpp50 int cnt = _elements->at(i); local
51 if (cnt != 0) {
53 i, cnt, (double)cnt/tot_d);
58 int cnt = _elements->at(_max); local
60 _max, cnt, (double)cnt/tot_d);
H A Dxmlstream.cpp384 uint cnt; local
385 cnt = mdo->decompile_count();
386 if (cnt != 0) print(" decompiles='%d'", cnt);
388 cnt = mdo->trap_count(reason);
389 if (cnt != 0) print(" %s_traps='%d'", Deoptimization::trap_reason_name(reason), cnt);
391 cnt = mdo->overflow_trap_count();
392 if (cnt != 0) print(" overflow_traps='%d'", cnt);
[all...]
/openjdk7/hotspot/agent/src/os/bsd/
H A Dsalibelf.c107 int cnt; local
117 for (phdr = phbuf, cnt = 0; cnt < ehdr->e_phnum; cnt++, phdr++) {
H A Dps_proc.c322 int i, cnt; local
324 freep = kinfo_getvmmap(ph->pid, &cnt);
330 for (i = 0; i < cnt; i++) {
H A Dsymtab.c64 int cnt = 0; local
92 for (cursct = shbuf, cnt = 0; cnt < ehdr.e_shnum; cnt++) {
93 scn_cache[cnt].c_shdr = cursct;
97 if ( (scn_cache[cnt].c_data = read_section_data(fd, &ehdr, cursct)) == NULL) {
114 for (cnt = 1; cnt < ehdr.e_shnum; cnt++) {
115 ELF_SHDR *shdr = scn_cache[cnt]
[all...]
/openjdk7/hotspot/agent/src/os/linux/
H A Dsalibelf.c106 int cnt; local
116 for (phdr = phbuf, cnt = 0; cnt < ehdr->e_phnum; cnt++, phdr++) {
H A Dsymtab.c170 int cnt; local
181 for (cursct = shbuf, cnt = 0;
182 cnt < ehdr->e_shnum;
183 cnt++, cursct++) {
185 scn_cache[cnt].c_data = read_section_data(fd, ehdr, cursct);
186 return &scn_cache[cnt];
330 int cnt = 0; local
358 for (cursct = shbuf, cnt = 0; cnt < ehdr.e_shnum; cnt
[all...]
/openjdk7/jdk/test/java/awt/FontClass/CreateFont/
H A DBigFont.java44 int cnt = 0; field in class:BigFont.SizedInputStream
51 if (cnt < size) {
52 cnt++;
60 return cnt;
/openjdk7/hotspot/src/share/vm/runtime/
H A Drframe.cpp156 int cnt = top_method()->interpreter_invocation_count(); local
158 int cnt = top_method()->invocation_count();
162 tty->print_cr(": inv=%5d(%d) cst=%4d", _invocations, cnt, cost());
H A DcompilationPolicy.cpp541 int cnt = 0; // Call site counts local
547 cnt = data->as_CounterData()->count();
552 int freq = (invcnt) ? cnt/invcnt : cnt;
555 if ((msg = shouldInline(m, freq, cnt)) != NULL) {
599 const char* StackWalkCompPolicy::shouldInline(methodHandle m, float freq, int cnt) { argument
612 if ((freq >= InlineFrequencyRatio) || (cnt >= InlineFrequencyCount)) {
/openjdk7/jdk/test/java/net/Socket/
H A DDeadlockTest.java81 public void ping(int cnt) { argument
82 Message.write(out, new PingMessage(cnt));
85 private int cnt = 1; field in class:ServerThread
122 if (dbg) System.out.println("read " + cnt);
124 if (dbg) System.out.println("read done " + cnt++);
163 private int cnt = 1; field in class:ClientThread
172 System.out.println("read " + cnt);
174 System.out.println("read done " + cnt++);
205 private static int cnt = 1; field in class:Message
209 System.out.println("write message " + cnt);
227 PingMessage(int cnt) argument
235 int cnt; field in class:PingMessage
[all...]
/openjdk7/jdk/src/solaris/classes/sun/java2d/xr/
H A DGrowableEltArray.java48 public final void setCharCnt(int index, int cnt) { argument
49 array[getCellIndex(index) + 0] = cnt;
/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.cpp100 uint cnt = n->req(); local
101 for( uint k=1; k<cnt; k++ ) {
268 uint cnt = b->_nodes.size(); local
269 for( uint i=0; i<cnt; i++ ) {
H A Dvectornode.cpp326 VectorNode* VectorNode::shift_count(Compile* C, Node* shift, Node* cnt, uint vlen, BasicType bt) { argument
327 assert(VectorNode::is_shift(shift) && !cnt->is_Con(), "only variable shift count");
333 return new (C) LShiftCntVNode(cnt, vt);
338 return new (C) RShiftCntVNode(cnt, vt);
H A DgenerateOptoStub.cpp57 uint parm_cnt = jdomain->cnt();
58 uint max_map = MAX2(2*parm_cnt+1, jrange->cnt());
119 uint cnt = TypeFunc::Parms; local
122 for( ; cnt<parm_cnt; cnt++ )
123 fields[cnt] = jdomain->field_at(cnt);
124 fields[cnt++] = TypeRawPtr::BOTTOM; // Thread-local storage
127 fields[cnt++] = TypeRawPtr::BOTTOM; // Return PC
129 const TypeTuple* domain = TypeTuple::make(cnt,field
[all...]
H A DbuildOopMap.cpp284 uint cnt = mcall->tf()->domain()->cnt(); local
286 for( j = TypeFunc::Parms; j < cnt; j++)
289 if( j < cnt ) // arg oops dont go in GC map
354 uint cnt = mcall->tf()->domain()->cnt(); local
356 for( j = TypeFunc::Parms; j < cnt; j++)
359 if( j < cnt ) // arg oops dont go in GC map
H A Difg.cpp414 uint cnt = 0; local
421 cnt += lrgs(lidx).reg_pressure();
423 return cnt;
430 uint cnt = 0; local
435 cnt += lrgs(lidx).reg_pressure();
437 return cnt;
H A Dcoalesce.cpp208 uint cnt = b->_nodes.size(); local
209 for( j=0; j<cnt; j++ ) {
383 uint cnt = b->num_preds(); // Number of inputs to the Phi local
419 for( uint j = 1; j<cnt; j++ ) {
580 uint cnt = b->end_idx(); local
581 for( i = 1; i<cnt; i++ ) {
/openjdk7/hotspot/src/share/vm/libadt/
H A Dvectset.cpp154 register uint cnt = ((size<s.size)?size:s.size); local
157 for( uint i=0; i<cnt; i++) // Copy and OR the two sets
162 memcpy(&data[cnt], u2, (s.size - cnt)*sizeof(uint32));
179 register uint cnt = ((size<s.size)?size:s.size); local
182 for( uint i=0; i<cnt; i++ ) // For data in set
206 register uint cnt = ((size<s.size)?size:s.size); local
210 for( i=0; i<cnt; i++ ) { // For data in BOTH sets
/openjdk7/hotspot/src/share/vm/adlc/
H A Dforms.cpp97 int cnt = 0; local
100 if(!strcmp(entry,name)) return cnt;
101 cnt++;
/openjdk7/jdk/src/share/back/
H A DVirtualMachineImpl.c766 int cnt = 1; /* always have one */ local
775 ++cnt;
778 return cnt;
/openjdk7/hotspot/src/share/vm/oops/
H A Dklass.cpp66 int cnt = secondary_supers()->length(); local
67 for (int i = 0; i < cnt; i++) {

Completed in 6498 milliseconds

123