Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 71e6a7fd authored by Shubham Ajmera's avatar Shubham Ajmera
Browse files

Keep track of primary dexopt 

In commit ce543973, the results of both secondary dexopt and
primary dexopt were clubbed. This CL partially reverts the change
to not aggregate the two dexopt in single stat. A TODO has been
added to store stats for secondary dexopt.

Bug: 38413085
Test: build successful
Change-Id: I7ab437c694d5eb7df5f03706ace26380f513489e
parent 03d10163

services/core/java/com/android/server/pm/PackageManagerService.java

+15 −19
Original line number Diff line number Diff line
@@ -9346,17 +9346,16 @@ public class PackageManagerService extends IPackageManager.Stub 
                    false /* force */,

                    bootComplete);













            boolean secondaryDexOptStatus = true;















            if (pkg.isSystemApp()) {















                // Only dexopt shared secondary dex files belonging to system apps to not slow down















                // too much boot after an OTA.













                secondaryDexOptStatus = mDexManager.dexoptSecondaryDex(pkg.packageName,













                mDexManager.dexoptSecondaryDex(pkg.packageName,















                        compilerFilter,















                        false /* force */,















                        true /* compileOnlySharedDex */);















            }



























            if (secondaryDexOptStatus) {













            // TODO(shubhamajmera): Record secondary dexopt stats.















            switch (primaryDexOptStaus) {















                case PackageDexOptimizer.DEX_OPT_PERFORMED:















                    numberOfPackagesOptimized++;









@@ -9371,9 +9370,6 @@ public class PackageManagerService extends IPackageManager.Stub













                    Log.e(TAG, "Unexpected dexopt return code " + primaryDexOptStaus);















                    break;















            }













            } else {













                numberOfPackagesFailed++;













            }















        }





























        return new int[] { numberOfPackagesOptimized, numberOfPackagesSkipped,