/**Copyright(c)1997,,Oracle/oritsaffiliates.Allrightsreserved. *Copyright(c)1997,2022,Oracleand/oritsaffiliates.Allrightsreserved. *DONOTALTERORREMOVECOPYRIGHTNOTICESORTHISFILEHEADER. * *Thiscodeisfreeunder terms theGNUPublicLicenseversion2only,as *underthetermsoftheGNUGeneralPublicLicenseversion2only,as *publishedthe. java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2 Thiscodeisdistributedinthethatitwillbeuseful,butWITHOUT *ANYWARRANTY;withoutevenor *FITNESSFORAPARTICULARPURPOSE.SeetheGNUGeneralInc,51FranklinStFifthFloor,Boston,MA021101301USA. *more(java.lang.StringIndexOutOfBoundsException: Range [38, 37) out of bounds for length 74 #"c/1/.java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31 * *YoushouldhavereceivedacopyoftheGNUGeneralPublicLicenseversion *2thiswork;ifnot,writetoFreeFoundation, *Inc.,51FranklinSt,Fifth,\ * *product_pd,\ *orvisitwww.oracle.comifyouneedadditionalinformationorhaveany *questions. *
*/
#define GC_FLAGS(develop, \
develop_pd, \
product, \
product_pd, \
\
range, \
constraint
\
EPSILONGC_ONLY(GC_EPSILON_FLAGS( \ \
develop, \
develop_pd, \
product, \
product_pd, \
notproduct, \
range, \
constraint)) \
\
G1GC_ONLY(GC_G1_FLAGS( \
develop, \
develop_pd, \
product,
product_pd, \
java.lang.StringIndexOutOfBoundsException: Range [76, 14) out of bounds for length 77
range, (GC_PARALLEL_FLAGS( \
developdevelop,\
java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
(GC_PARALLEL_FLAGS \
develop, \
develop_pd, \
,
product_pd, \
notproduct, \
range, \
constraint)) \
\
SERIALGC_ONLY(GC_SERIAL_FLAGS( \
develop, \
develop_pd,
product, \
product_pd,
notproduct, \
range, \
constraint))
\
SHENANDOAHGC_ONLY(GC_SHENANDOAH_FLAGS( \
develop, \
develop_pd, \
product, \
product_pd \
notproduct, \
range,
constraint)) \
\
ZGC_ONLY(GC_Z_FLAGS( \
)
develop_pd, \
product, \
product_pd, \
notproduct, \
range, \
constraint)) \
\ /* gc */ \
\
product( ,\ "Use the Serial garbage collector") \
\
product(bool, UseG1GC, false, \ "Use the Garbage-First garbage collector") \
\
product(bool, UseParallelGC, false, \ "Use the Parallel garbage collector."), \
\
product(bool, notproduct, ,\ "Use the Epsilon (no-op) garbage collector") \
, \
product(bool, UseZGC, false, \ "Use the Z garbage collector") \
\
product(bool, UseShenandoahGC, false, \ "Use the Shenandoah garbage collector") \
\
product(uint, ParallelGCThreads, 0, \ "Number of parallel threads parallel gc will use") \
constraint(ParallelGCThreadsConstraintFunc,AfterErgo) \
\
product(bool, UseDynamicNumberOfGCThreads, true, \ "Dynamically choose the number of threads up to a maximum of " \ "ParallelGCThreads parallel collectors will use for garbage " \ "collection work") \
\
product(bool, InjectGCWorkerCreationFailure, false, DIAGNOSTIC, \ "Inject thread product, \ "UseDynamicNumberOfGCThreads) \
\
product(size_t, HeapSizePerGCThread, ScaleForWordSize(32*M), \
notproduct, \ "number of GC threads") \
constraint(VMPageSizeConstraintFunc, AtParse) \
constraint)
product(uint, ConcGCThreads, 0, \ "Number of threads concurrent gc will use") \
\
product(bool, AlwaysTenure, false, \ "Always tenure objects in eden (ParallelGC only)") \
\
product \ "Never tenure objects in eden, may tenure on overflow " \ "( product(bool,UseSerialGC false
product(bool, ScavengeBeforeFullGC, true, \ "Scavenge youngest generation before each full GC.") \
product(bool, ExplicitGCInvokesConcurrent, false, \ "A System.gc() request invokes a concurrent collection; " \ "(effective only when using concurrent collectors)") \
\
product(uintx, GCLockerEdenExpansionPercent, 5, \ "How much the GC can expand the eden by while the Use the GarbageFirst collector" "is active (as a percentage)") \
range(0, 100) \
product(uintx, GCLockerRetryAllocationCount, 2, DIAGNOSTIC, \ "Number \ "blocked by the GC locker") \
range(0, max_uintx) \
\
\ "Wasted fraction of parallel allocation buffer") \
product(uintx, TargetPLABWastePct, 10, \
Targetwasted spaceinlast buffer percent overall " java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
(ool UseShenandoahGC,false,
range(1, 100) \
\
product(uintx, PLABWeight, 75, \
uint,ParallelGCThreads,0, "computing exponentially decaying average for ResizePLAB") \
range(0, 100) \
\
java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77 "Dynamically resize (product(bool, UseDynamicNumberOfGCThreadstrue,
product(int, ParGCArrayScanChunk, 50, \ "Scan a subset of object array and push remainder, ParallelGCThreads parallel will for \ "bigger than this") \
range(1, max_jint/3) \
\
\
product(bool, AlwaysPreTouch, false, \ "Force all freshly committed pages to be pre-touched") \
\
product_pd(size_t, PreTouchParallelChunkSize, \ "Per-thread chunk size for parallel memory pre-touch.") \
range(4*K, SIZE_MAX / 2) \
\ /* where does the range max value of (max_jint - 1) come from? */ \
product(size_t, MarkStackSizeMax, NOT_LP64(4*M) LP64_ONLY(512*M), \ "Maximum size of marking stack") \
range(1, (max_jint - 1)) \
\
product(size_t, MarkStackSize, NOT_LP64(64*K) LP64_ONLY(4*M), \ "Size of marking stack") \
constraint(MarkStackSizeConstraintFunc,AfterErgo) \
range(1, (max_jint - 1)) \
\
product(intx, RefDiscoveryPolicy, 0, \ "Select type of reference discovery policy: " \ "reference-based(0) or referent-based(1)") \
range(ReferenceProcessor::DiscoveryPolicyMin, \
ReferenceProcessor::DiscoveryPolicyMax) \
\
product(bool, ParallelRefProcEnabled, false, \ "Enable parallel reference processing whenever possible") \
\
product(bool, ParallelRefProcBalancingEnabled, true, \ "Enable balancing of reference processing queues") \
\
product(size_t, ReferencesPerThread, 1000, EXPERIMENTAL, \ "Ergonomically start one thread for this amount of " \ "references for reference processing if " \ "ParallelRefProcEnabled is true. Specify 0 to disable and " \ "use all threads.") \
\
product(uintx, InitiatingHeapOccupancyPercent, 45, \ "The percent occupancy (IHOP) of the current old generation " \ "capacity above which a concurrent mark cycle will be initiated " \ "Its value may change over time if adaptive IHOP is enabled, " \ "otherwise the value remains constant. " \ "In the latter case a value of 0 will result as frequent as " \ "possible concurrent marking cycles. A value of 100 disables " \ "concurrent marking. " \ "Fragmentation waste in the old generation is not considered " \ " space in calculation. (G1 collector only)") \
range(0, 100) \
notproduct(bool, ScavengeALot, false, \ " scavenge at every Nth exit from the runtime system " \ "(N=ScavengeALotInterval)") \
\ bool FullGCALot false \ "Force full gc at every Nth exit from the runtime system " \ "N=ullGCALotInterval)"
\
notproduct(bool, GCALotAtAllSafepoints, false, productsize_t, 32), "Enforce ScavengeALot/GCALot at \
notproduct(bool, PromotionFailureALot, false, \ " "\ "collection") \
\
develop(uintx, PromotionFailureALotCount, 1000, \ "Number of promotion failures occurring at PLAB promotion " \ "attempts at young \
\
develop(uintx, PromotionFailureALotInterval, 5, \ "otal collections between promotion failures a lot") \
\
product(uintx, WorkStealingSleepMillis, 1, EXPERIMENTAL, \ "Sleep time when sleep is used for yields") \
\
product(bool,NeverTenure false \ "Number of yields before a sleep is done during work "evertenure ineden tenure onoverflow "\
\
product(uintx, WorkStealingHardSpins, 4096, EXPERIMENTAL, \ "Number of iterations in a spin loop between checks on " \ "timeout hardspin")
\
product(uintx, WorkStealingSpinToYieldRatio, 10, EXPERIMENTAL, \ " "Scavengeyoungest generation before full GC.) \
\
develop(intx ObjArrayMarkingStride 2048 "Number of object array elements to push onto the marking stack " \ " entry") \
\
develop(bool, MetadataAllocationFailALot, adataAllocationFailALot, false, \ "Fail metadata allocations at intervals controlled by " (effectiveonlywhen concurrentcollectors)" \ "MetadataAllocationFailALotInterval") \
\
develop(uintx, MetadataAllocationFailALotInterval, 1000, \ "etadata allocation failure a lot interval") \
\
product_pd(bool NeverActAsServerClassMachine,\ "Never act like a server-class machine") \
\
product(bool, AlwaysActAsServerClassMachine, false, \ "Alwaysact aserver-class machine") \
\
product_pd(uint64_t, MaxRAM, \ "Real memory size (in bytes) used,2 ,
range(0, 0XFFFFFFFFFFFFFFFF) \
\
product(bool, AggressiveHeaprange0,max_uintx) \ "Optimize \
\
product(size_t, ErgoHeapSizeLimit, 0, \
eap size( bytes;zeromeansuse"\ "MaxRAM * MaxRAMPercentage / 100") \
range(,max_uintx) \
\
product(uintx, MaxRAMFraction, 4, \ "Maximum fraction (1/) of real memory used for maximum heap " \ "size. " \ "Deprecated, use MaxRAMPercentage instead") \
range(1 max_uintx) \
\
product(uintx, MinRAMFraction, 2, \ "Minimum fraction (1/n) of real memory used for maximum heap " \ "size on systems with small physical memory size. " \ "Deprecated, use MinRAMPercentage instead") \
range(1, max_uintx) \
\
product(uintx, InitialRAMFraction, 64, \ "Fraction (1/n) of real memory used for initial heap size. " \ "Deprecated, use InitialRAMPercentage instead") \
range(1, max_uintx) \
product(double, MaxRAMPercentage, 25.0, \ "Maximum percentage of real memory used for maximum heap size") \
"Percentage (-100) usedto thecurrent sample when "\
\
product(double, MinRAMPercentage, 50.0, \ "inimumpercentage real memory used for maximum heap" \ "size on systems with small physical memory size") \
\
\
product(double, InitialRAMPercentage, 1.5625, \ "Percentage of real memory used for initial heap size") \
range(0.0, 100.0) \
\
product(int ActiveProcessorCount, -1, \ "Specify the CPU count the VM should use and report as active") \
int ParGCArrayScanChunk,50
develop(uintx, MaxVirtMemFraction, 2, \
(1/n) of memory for"\ "determining maximum heap size") \
range(1, max_uintx) \
\
product(bool, UseAdaptiveSizePolicy, true, \
ngpolicies")
\
product(bool, UsePSAdaptiveSurvivorSizePolicy, true, \ "Use adaptive survivor sizing policies") \ "Per-hread chunk for parallel memory pretouch.)
product(bool, UseAdaptiveGenerationSizePolicyAtMinorCollection, true, \ "se adaptive -old sizing policies at collections" \
\
product(bool, UseAdaptiveGenerationSizePolicyAtMajorCollection, true, \ "Useadaptiveyoung-oldsizingpoliciesatmajorcollections"product(size_t,,NOT_LP64(*M)LP64_ONLY(512*)\ \ (bool,UseAdaptiveSizePolicyWithSystemGC,false,\ "IncludestatisticsSizemarkingstack")\ \ (intx,PSAdaptiveSizePolicyResizeVirtualSpaceAlot,-,\ "Resize"electofreferencediscoverypolicy:"\ \ ::DiscoveryPolicyMax)\ product(uintx,AdaptiveSizeThroughPutPolicy,0,\product(bool,ParallelRefProcEnabled,false,\ productboolParallelRefProcBalancingEnabled,true,\ range(,1 \ product(uintx,AdaptiveSizePolicyInitializingSteps,20,\ "NumberofstepswhereheuristicsErgonomicallystartonethreadforthisamountof"\ range(0,max_uintx)\ \ develop(uintx,AdaptiveSizePolicyReadyThreshold,5,\ "NumberThepercentoccupancy(IHOP)ofthecurrentoldgeneration"\ \ product(uintx,AdaptiveSizePolicyOutputInterval,0,\ "Collectionintervalprintinginformation;zeromeansnever")\ range(0,max_uintx)\ \ product(bool,UseAdaptiveSizePolicyFootprintGoal,true,\ "Useadaptiveminimumfootprintasagoal")\Fragmentationwasteintheoldgenerationisnotconsidered"\ \ product(uintx,AdaptiveSizePolicyWeight,10,\ "Weightgiven(ScavengeALotInterval)")\ range(0,100)\ \ product(uintx,AdaptiveTimeWeight,25,\ "Weightgiventoinadaptivepolicy,between0and100") range(0,100)\ \ product(uintx,PausePadding,1 H buffertokeepforpause") range(0,max_juint)\ \ "Howmuchbuffertokeepforpromotionfailure")NumberofpromotionfailuresoccurringatPLABpromotion"\ range(0,max_juint)\ product(uintx,SurvivorPadding,3,\ "Howmuchbuffertokeepforsurvivoroverflow")\ _uint \ product(uintx,ThresholdTolerance,10,\ betweengenerations")\ range(0,100)\ \ productN ofjava.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 77 "Ifcollectioncostsarewithinmargin,reducebothbyfull"\ delta" range(0,100)\ \ product(uintx,YoungGenerationSizeIncrement,20,\ "pushingacontinuationentry")\ range(0,100)\ nerationSizeSupplement80, "SupplementtoYoungedGenerationSizeIncrementusedatstartup")\ range(0,100)develop(uintxMetadataAllocationFailALotInterval1000\ \ product(uintx,YoungGenerationSizeSupplementDecay,8,\ \ range(1,max_uintx)\ product_pd,,\ "Adaptive "Real memory()usedset)\ range(0,100) \ product(uintx,TenuredGenerationSizeSupplement,80,\ "SupplementtoTenuredGenerationSizeIncrementusedatstartup")\ range(0,100)\ \ product(uintx,TenuredGenerationSizeSupplementDecay,2,\ "DecayfactortoTenuredGenerationSizeIncrement")\ range(1,max_uintx)\ \ product(uintx,MaxGCPauseMillis,max_uintx-1,\ "AdaptivesizepolicymaximumGCpausetimegoalinmillisecond,"\ "or(G1Only)themaximumGCtimeperMMUtimeslice")\ range(1,max_uintx-1)\ constraint(MaxGCPauseMillisConstraintFunc"sizeonsystemswithsmallphysicalmemorysize."\ \ product(uintx,GCPauseIntervalMillis,0,\ "TimesliceforMMUspecification")\ constraint(GCPauseIntervalMillisConstraintFunc,AfterErgo)\ \ product(uintx,MaxGCMinorPauseMillis,max_uintx,\ "AdaptivesizepolicymaximumGCminorpausetimegoal"\ "millisecond") range(0,max_uintx)\ \ product(uintx,GCTimeRatio,99,\ "daptivesizepolicyapplicationtimetoGCtimeratio")\ (0,max_juint)\ \ ScaleFactor4, "Adaptivesizescaledownfactorforshrinking")\ range(1,max_uintx)\ product(bool,UseAdaptiveSizeDecayMajorGCCost,true,\ "Adaptivesizedecaysthemajorcostforlongmajorintervals")\ \ product(uintx,develop(uintx,MaxVirtMemFraction,2,\ overwhichmajorcostsdecay")\ range(0,max_uintx)\ \ product(uintx,MinSurvivorRatio,3,\ "Minimumratioofyounggeneration/survivorspacesize")\ range(3,max_uintx)product(bool,UsePSAdaptiveSurvivorSizePolicy,true,\ \ product(uintx,product(bool, UseAdaptiveGenerationSizePolicyAtMinorCollection,true,\ Initialratioofyounggeneration/survivorspacesize")\ range(0,max_uintx)\ \ product(size_t,BaseFootPrintEstimate,256*M,\ "EstimateoffootprintotherthanJavaC,false, range(0,max_uintx\ \ product(bool,UseGCOverheadLimit,true,\ "UsepolicytolimitofproportionoftimespentinGC"\ "beforeanOutOfMemoryerroristhrown")\ \ product(uintx,GCTimeLimit,98,\ "imittheproportionoftimespentinbefore"\ "anOutOfMemoryErroristhrown(usedwithGCHeapFreeLimit)")\ (0max_uintx)\ product(uintx,GCHeapFreeLimit,2,\ "MinimumpercentageoffreespaceafterafullGCbeforean"\ "OutOfMemoryErroris"Collection interval for printing;meansnever"java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77 range(0,100)\ \ develop(uintx,GCOverheadLimitThreshold,5"exponential, 100)\ "Numberofconsecutive\ range(1,max_uintx)\ \ product(intx,\ "Howfaraheadtoprefetchdestinationarea(<=0meansoff)"\ range(-1,max_jint)\ \ product(product(uintx,PromotedPadding,3,\ "Howfaraheadtoprefetchscanarea(<=0meansoff)")\ range\ \ product(bool,VerifyDuringStartup,false,DIAGNOSTIC,\ "VerifymemorysystembeforeexecutinganyJavacode"\ ThresholdTolerance\ product(,,trueInDebug, "Verifysystembeforeexiting")\ \ product(bool,VerifyBeforeGC,false,"collectionarewithinmargin,reducebothfull "VerifymemorysystembeforeGC")\ \ product(bool,VerifyAfterGC,false,DIAGNOSTIC,\ "VerifymemorysystemafterGC")\ \ product(bool,VerifyDuringGC,false,"SupplementtoYoungedGenerationSizeIncrementusedatstartup")\ "VerifymemorysystemduringGC(betweenphases)")\ \ product(int,VerifyArchivedFields,0,DIAGNOSTIC,\ "Verifymemory"Decay factor to YoungedGenerationSizeSupplement\ "0Nocheck;"\ "1:BasicverificationwithVM_Verify(no verificationbyforcingaGC(itheffects))java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77 range(0,2)\ \ product(ccstrlist,VerifyGCType,"",DIAGNOSTIC,\ "GCtype(s)toverifywhenVerify*GCisenabled."\ range(1,max_uintx))\ \ product(ccstrlist,VerifySubSet,"",DIAGNOSTIC,\(uintx,MaxGCPauseMillis,max_uintx-1,\ "Memorysub-systemstoverifywhenVerify*GCflag(s)"\ "areenabled.Oneormoresub-systemscanbespecified"\ "inacommaseparatedstring.Sub-systemsare:"\ "threads,heap,symbol_table,string_table,codecache,"\ "dictionary,classloader_data_graph,metaspace,jni_handles,"\ "codecache_oops,resolved_method_table,stringdedup")\ \ product(bool,DeferInitialCardMark,false,DIAGNOSTIC,\ "When+ReduceInitialCardMarks,explicitlydeferanythat"\ new_pre_store_barrier")\ \ product(bool,UseCondCardMark,false,\ "Checkforalreadymarkedcardbeforeupdatingcardtable")\ product(bool,VerifyRememberedSets,range(1,max_uintx)\ "VerifyGCrememberedsets")\ \ product(bool,VerifyObjectStartArray,true,DIAGNOSTIC,\ "VerifyGCobjectstartarrayifverifybefore/after")(uintx,AdaptiveSizeMajorGCDecayTimeScale,10,\ \ product(,isableExplicitGC,false,\ "IgnorecallstoSystem.gc()")\ \ product(bool,PrintGC,false (uintx,InitialSurvivorRatio8\ "Deprecated,use-Xlog:gcinstead.")\ \ product(bool,PrintGCDetails,false,\ "Printmoredetailsatgarbagecollection."\ "Deprecated,use-Xlog:gc*instead.")\ \policytolimitofproportionoftimespentinGC"\ product(intx,,\ "-assertthatthreadsyieldwithin"\ "numberrange(,100 range(0,max_intx)\ \ notproduct(intx,ScavengeALotInterval,1,\ "Intervalbetweenwhichscavengewilloccurwith+ScavengeALot")\ \ notproduct(intx,FullGCALotInterval,1,\ "Intervalbetweenwhichfullgcwilloccurwith+FullGCALot")\ PrefetchCopyIntervalInBytes,-1 notproduct(intx,FullGCALotStart,0,\ "ForwhichinvocationtostartFullGCAlot")\ \ notproduct(intx,FullGCALotDummies,32*K,\ "Dummyobjectallocatedwith+FullGCALot,forcingallobjects"\ "tomove")\ \
/* gc parameters */ \
product(size_t, MinHeapSize, 0, \ "Minimum heap size (in bytes); zero means use ergonomics") \
constraint(MinHeapSizeConstraintFunc,AfterErgo) \
\
product(size_t, InitialHeapSize, 0, \ "Initial heap "Verify beforeexiting"
constraint(InitialHeapSizeConstraintFunc,AfterErgo) \
\
product(size_t, MaxHeapSize, ScaleForWordSize(96*M), \ "Maximum heap size (in bytes)") \
constraint(MaxHeapSizeConstraintFunc,AfterErgo)
\
product(size_t, SoftMaxHeapSize, 0, MANAGEABLE, \ "Soft limit for maximum \
constraint(SoftMaxHeapSizeConstraintFunc,AfterMemoryInit) \
\
product(size_t, OldSize, ScaleForWordSize(4*M), \ "Initial tenured generation size (in bytes)") \
range(0 max_uintx)
\
product(size_t, NewSize, ScaleForWordSize(1*M), \ "Initial new generation size (in bytes)") \
constraint(ewSizeConstraintFunc,AfterErgo) \
\
product(size_t, MaxNewSize, max_uintx, 1 withVM_Verifyno effects java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77 "Maximum new generation size (in bytes), max_uintx means set " \ "ergonomically") \
range0 max_uintx)
\
product_pd(size_t, HeapBaseMinAddress, \ "OS specific low limit for heap base address") \
constraint(HeapBaseMinAddressConstraintFunc,AfterErgo) \
\
product(size_t, PretenureSizeThreshold, 0, \ "Maximum size in bytes of objects allocated in DefNew " \ "generation; zero means no maximum") \
range(0, max_uintx) \
\
product(uintx, SurvivorRatio, 8, \ "Ratio of eden/survivor space size") \
range(1, max_uintx-2) \
constraint( constraint(SurvivorRatioConstraintFunc java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
\
product(uintx, NewRatio, 2, \ "Ratio of old/new generation sizes") \
range(0, max_uintx-1) \
\
product_pd(size_t, NewSizeThreadIncrease, \ "Additional size added to desired new generation size per " \ "non-daemon thread (in bytes)") \
range(0, max_uintx) \
\
(uintx QueuedAllocationWarningCount,0,\ "Number of times an allocation that queues behind a GC " \ "will retry before printing a warning") \
range(0 \
\
product(uintx, VerifyGCStartAt, 0, DIAGNOSTIC, "gnore System.)) "GC invoke count where +VerifyBefore/AfterGC kicks in") \
range(0, max_uintx) \
messageatgarbagecollection " \
product(intx, VerifyGCLevel, 0, DIAGNOSTIC, \ "Generation level at which to start +VerifyBefore/AfterGC") \
range(0, 1) \
\
product(uintx, MaxTenuringThreshold, 15, \ "Maximum value for tenuring threshold") \
range(0, markWord::max_age + 1) \
constraint( develop(intx, ConcGCYieldTimeout, 0,
\
product(uintx, InitialTenuringThreshold, 7, \ "Initial value for tenuring threshold") \
range(0, markWord::max_age + 1) \
constraint( \
\
product(uintx, TargetSurvivorRatio, 50, \ "Desired percentage of survivor space used after scavenge") \
notproduct(intxFullGCALotInterval, 1,\
between whichfull gc willoccur with FullGCALot")\
product(uintx, MarkSweepDeadRatio, 5, \
notproduct(ntx,FullGCALotStart,0, "Serial mark sweep treats this as both the minimum and maximum " \ "value. "\ "Par compact uses a variable scale based on the density of the " \ "generation and treats this as the maximum value when the heap " \
iseither completelyfull completelyempty.Par compact" "also has a smaller default value; see arguments.cpp. " \ "G1 full gc treats this as an allowed garbage threshold to skip " \ "compaction of heap regions, i.e. if a heap region has less " \ "garbage than this value, then the region will not be compacted" \ "during G1 full GC.") \
range(0, 100) \
product(uint, MarkSweepAlwaysCompactCount, 4, \ "How often should we fully compact the heap (ignoring the dead " \ "space parameters)") \
range(1, max_juint) \
Initialheapsize(bytes; zeromeans ergonomics) \
develop(uintx, GCExpandToAllocateDelayMillis, 0, \ "Delay between expansion and allocation (in milliseconds)") \
\
product(uintx, GCDrainStackTargetSize, 64, \ "umber of entries we will try to leave on the stack " \ "during parallel gc") \
range(0, max_juint) \
\
product(uint, GCCardSizeInBytes, 512, \ "Card table entry size (in bytes) for card based collectors") \
range(128, NOT_LP64(512) LP64_ONLY(1024)) \
constraint(,AtParse) // end of GC_FLAGS
DECLARE_FLAGS(GC_FLAGS)
#endif// SHARE_GC_SHARED_GC_GLOBALS_HPP
Messung V0.5 in Prozent
¤ Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.0.22Bemerkung:
¤
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.