All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.infinispan.commons.jdkspecific.ProcessorInfo Maven / Gradle / Ivy

package org.infinispan.commons.jdkspecific;

import java.io.IOException;
import java.nio.charset.StandardCharsets;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.Locale;
import java.util.stream.Stream;

/**
 * Provides general information about the processors on this host.
 *
 * @author Jason T. Greene
 * @author Tristan Tarrant
 */
public class ProcessorInfo {
   private static final byte[] BITS = new byte[]{0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4};
   private static final String CPUS_ALLOWED = "Cpus_allowed:";
   private static final String CGROUP_STATUS_FILE = "/proc/cgroups";
   private static final String CPU_CFS_PERIOD_US = "/sys/fs/cgroup/cpu/cpu.cfs_period_us";
   private static final String CPU_CFS_QUOTA_US = "/sys/fs/cgroup/cpu/cpu.cfs_quota_us";
   private static final String CPU_SHARES = "/sys/fs/cgroup/cpu/cpu.shares";
   private static final String PROC_SELF_STATUS = "/proc/self/status";

   private ProcessorInfo() {
   }

   public static int availableProcessors() {
      int javaProcs = Runtime.getRuntime().availableProcessors();
      int userProcs = Integer.getInteger("infinispan.activeprocessorcount", javaProcs);
      if (!isLinux()) {
         return Math.min(userProcs, javaProcs);
      }

      // Obtain the CPU Mask
      int maskProcs = readCPUMask();
      if (maskProcs < 0)
         maskProcs = userProcs;

      // Obtain the CPU shares
      int cpuShares = readCPUShares();
      if (cpuShares == 1024)
         cpuShares = userProcs;

      // Obtain the CFS quota/period ratio
      long cpuQuota = readCPUCFSQuotaUS();
      double cpuRatio = cpuQuota < 0 ? userProcs : Math.ceil((float) cpuQuota / (float) readCPUCFSPeriodUS());

      return Math.min(userProcs, Math.min(maskProcs, Math.min(cpuShares, (int) cpuRatio)));
   }

   private static int readCPUMask() {
      try (Stream lines = Files.lines(Paths.get(PROC_SELF_STATUS), StandardCharsets.US_ASCII)) {
         return lines.filter(line -> line.startsWith(CPUS_ALLOWED))
               .findFirst().map(line -> {
            int count = 0;
            int start = CPUS_ALLOWED.length();
            for (int i = start; i < line.length(); i++) {
               char ch = line.charAt(i);
               if (ch >= '0' && ch <= '9') {
                  count += BITS[ch - '0'];
               } else if (ch >= 'a' && ch <= 'f') {
                  count += BITS[ch - 'a' + 10];
               } else if (ch >= 'A' && ch <= 'F') {
                  count += BITS[ch - 'A' + 10];
               }
            }
            return count;
         }).orElse(-1);
      } catch (IOException e) {
         return -1;
      }
   }


   private static long readCPUCFSQuotaUS() {
      if (!hasCGroups())
         return -1l;
      try (Stream lines = Files.lines(Paths.get(CPU_CFS_QUOTA_US), StandardCharsets.US_ASCII)) {
         return lines.findFirst()
               .map(line -> Long.parseLong(line)).orElse(-1l);
      } catch (IOException e) {
         return -1l;
      }
   }

   private static long readCPUCFSPeriodUS() {
      try (Stream lines = Files.lines(Paths.get(CPU_CFS_PERIOD_US), StandardCharsets.US_ASCII)) {
         return lines.findFirst()
               .map(line -> Long.parseLong(line)).orElse(100_000l);
      } catch (IOException e) {
         return 100_000l;
      }
   }

   private static int readCPUShares() {
      try (Stream lines = Files.lines(Paths.get(CPU_SHARES), StandardCharsets.US_ASCII)) {
         return lines.findFirst()
               .map(line -> Integer.parseInt(line)).orElse(1024);
      } catch (IOException e) {
         return 1024;
      }
   }

   private static boolean isLinux() {
      String osArch = System.getProperty("os.name", "unknown").toLowerCase(Locale.US);
      return (osArch.contains("linux"));
   }

   private static boolean hasCGroups() {
      return Files.exists(Paths.get(CGROUP_STATUS_FILE));
   }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy