Searched refs:max_jint (Results 1 - 25 of 35) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/oops/
H A DarrayOop.hpp117 if ((size_t)max_jint < max_elements_per_size_t) {
118 // It should be ok to return max_jint here, but parts of the code
122 return align_size_down(max_jint - header_size(type), MinObjAlignment);
H A DtypeArrayOop.hpp169 assert(size_in_words <= (julong)max_jint, "no overflow");
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsPromotionLAB.cpp89 assert( (array_length * (HeapWordSize/sizeof(jint))) < (size_t)max_jint, "array too big in PSPromotionLAB");
/openjdk7/hotspot/src/share/vm/libadt/
H A Dvectset.cpp375 mask = (mask & max_jint) << 1;// Next bit in word
382 mask = (mask & max_jint) << 1;
/openjdk7/hotspot/src/share/vm/runtime/
H A DinterfaceSupport.cpp107 _fullgc_alot_counter = 1+(long)((double)FullGCALotInterval*os::random()/(max_jint+1.0));
128 _scavenge_alot_counter = 1+(long)((double)ScavengeALotInterval*os::random()/(max_jint+1.0));
H A DsharedRuntime.cpp416 if (x >= (jfloat) max_jint)
417 return max_jint;
438 if (x >= (jdouble) max_jint)
439 return max_jint;
H A Dsafepoint.cpp339 assert(iterations < (uint)max_jint, "We have been iterating in the safepoint loop too long");
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DdirtyCardQueue.cpp291 _max_completed_queue = max_jint;
/openjdk7/hotspot/src/share/vm/opto/
H A Daddnode.hpp246 virtual const Type *add_id() const { return TypeInt::make(max_jint); }
H A Dparse2.cpp276 else if (hi() == max_jint)
320 if (highest != max_jint
321 && !ranges[rp].adjoinRange(highest+1, max_jint, default_dest, NullTableIndex)) {
322 ranges[++rp].setRange(highest+1, max_jint, default_dest, NullTableIndex);
376 if( highest != max_jint
377 && !ranges[rp].adjoinRange(highest+1, max_jint, default_dest, NullTableIndex) ) {
378 ranges[++rp].setRange(highest+1, max_jint, default_dest, NullTableIndex);
495 assert(hi->hi() == max_jint, "initial range must exhaust Type::INT");
518 jint max_val = max_jint;
H A Dtype.cpp254 TypeInt::POS = TypeInt::make(0,max_jint, WidenMin); // Non-neg values
255 TypeInt::POS1 = TypeInt::make(1,max_jint, WidenMin); // Positive values
256 TypeInt::INT = TypeInt::make(min_jint,max_jint, WidenMax); // 32-bit integers
257 TypeInt::SYMINT = TypeInt::make(-max_jint,max_jint,WidenMin); // symmetric range
272 TypeLong::INT = TypeLong::make((jlong)min_jint,(jlong)max_jint,WidenMin);
1091 const TypeInt *TypeInt::SYMINT; // symmetric range [-max_jint..max_jint]
1187 int max = max_jint;
1234 if (olo == min_jint && ohi == max_jint) retur
[all...]
H A Daddnode.cpp352 lo = min_jint; hi = max_jint; // Underflow on the low side
355 lo = min_jint; hi = max_jint; // Overflow on the high side
358 lo = min_jint; hi = max_jint;
H A Ddivnode.cpp524 // do not support holes, 'hi' must go to either min_jint or max_jint:
525 // [min_jint, -10]/[-1,-1] ==> [min_jint] UNION [10,max_jint]
526 hi = i1->_hi == min_jint ? min_jint : max_jint;
541 return TypeInt::make(min_jint, max_jint/2 + 1, widen);
862 if( con >= 0 && con < max_jint && is_power_of_2(con+1) ) {
H A Dconnode.cpp859 lo1 = min_jint; hi1 = max_jint;
862 lo1 = 0; hi1 = max_jint;
867 lo1 = min_jint; hi1 = max_jint;
1070 jint hi = max_jint;
H A DloopTransform.cpp117 float trip_cnt = (float)max_jint; // default is big
1279 Node* adj_max = _igvn.intcon((stride_con > 0) ? min_jint : max_jint);
1549 if (low_limit->get_int() == -max_jint) {
1601 if (low_limit->get_int() == -max_jint) {
1800 // Use symmetrical int range [-max_jint,max_jint]
1801 Node *mini = _igvn.intcon(-max_jint);
H A Dloopnode.cpp431 if (init_p > (jlong)max_jint || init_p > (jlong)limit_t->_hi)
453 // for (i=0; i <= max_jint; i++) {}
454 // for (i=0; i < max_jint; i+=2) {}
459 // for(;i != limit; i++) --> limit <= (max_jint)
460 // for(;i < limit; i+=stride) --> limit <= (max_jint - stride + 1)
461 // for(;i <= limit; i+=stride) --> limit <= (max_jint - stride )
478 if ((stride_con > 0 && limit_con > (max_jint - stride_m)) ||
483 } else if ((stride_con > 0 && limit_t->_hi <= (max_jint - stride_m)) ||
508 cmp_limit = new (C) CmpINode(limit, _igvn.intcon(max_jint - stride_m));
564 // The limit check guaranties that 'limit <= (max_jint
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A DthreadLocalAllocBuffer.cpp267 // header_size + ((sizeof(jint) * max_jint) / HeapWordSize)
275 ((juint) max_jint / (size_t) HeapWordSize);
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.cpp2359 non_oop_intervals->add_range(max_jint - 2, max_jint - 1);
3264 other_intervals->add_range(max_jint - 2, max_jint - 1);
4018 _end = new (arena) Range(max_jint, max_jint, NULL);
4267 return max_jint;
4278 return max_jint;
4289 return max_jint;
4815 _use_pos[i] = max_jint;
[all...]
H A Dc1_LinearScan.hpp470 static Range* _end; // sentinel (from == to == max_jint)
705 void walk() { walk_to(max_jint); }
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dc1_LinearScan_x86.cpp47 dummy_interval->add_range(max_jint - 2, max_jint - 1);
/openjdk7/hotspot/src/share/vm/services/
H A DmemTracker.cpp399 int per_seq_in_use = SequenceGenerator::peek() * 100 / max_jint;
/openjdk7/hotspot/src/share/vm/utilities/
H A Dtaskqueue.hpp778 assert(idx <= size_t(max_jint), "too big");
H A DglobalDefinitions.hpp165 const jint max_jint = (juint)min_jint - 1; // 0x7FFFFFFF == largest jint variable
/openjdk7/hotspot/src/share/vm/ci/
H A DciMethod.cpp135 _interpreter_invocation_count = invcnt < 0 ? max_jint : invcnt ;
H A DciTypeFlow.hpp762 bool is_root() const { return _tail->pre_order() == max_jint; }

Completed in 145 milliseconds

12