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

org.neo4j.kernel.impl.scheduler.ThreadPoolManager Maven / Gradle / Ivy

Go to download

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

There is a newer version: 5.26.0
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [https://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.neo4j.kernel.impl.scheduler;

import static java.util.Objects.requireNonNullElseGet;

import java.util.concurrent.ConcurrentHashMap;
import java.util.function.BiConsumer;
import java.util.function.LongSupplier;
import org.neo4j.internal.helpers.Exceptions;
import org.neo4j.scheduler.Group;
import org.neo4j.time.SystemNanoClock;

final class ThreadPoolManager {
    private final ConcurrentHashMap pools;
    private final ThreadGroup topLevelGroup;
    private final SystemNanoClock clock;
    private final FailedJobRunsStore failedJobRunsStore;
    private final LongSupplier jobIdSupplier;
    private boolean shutdown;

    ThreadPoolManager(
            ThreadGroup topLevelGroup,
            SystemNanoClock clock,
            FailedJobRunsStore failedJobRunsStore,
            LongSupplier jobIdSupplier) {
        this.topLevelGroup = topLevelGroup;
        pools = new ConcurrentHashMap<>();
        this.clock = clock;
        this.failedJobRunsStore = failedJobRunsStore;
        this.jobIdSupplier = jobIdSupplier;
    }

    ThreadPool getThreadPool(Group group) {
        return getThreadPool(group, null);
    }

    ThreadPool getThreadPool(Group group, ThreadPool.ThreadPoolParameters parameters) {
        return pools.computeIfAbsent(group, g -> createThreadPool(g, parameters));
    }

    boolean isStarted(Group group) {
        return pools.containsKey(group);
    }

    void assumeNotStarted(Group group) {
        if (isStarted(group)) {
            throw new IllegalStateException(group.groupName() + " is already been started. ");
        }
    }

    synchronized void forEachStarted(BiConsumer consumer) {
        assertNotShutDown();
        pools.forEach(consumer);
    }

    private synchronized ThreadPool createThreadPool(Group group, ThreadPool.ThreadPoolParameters parameters) {
        assertNotShutDown();
        ThreadPool.ThreadPoolParameters effectiveParameters = requireNonNullElseGet(parameters, () -> {
            ThreadPool.ThreadPoolParameters newParameters = new ThreadPool.ThreadPoolParameters();
            group.defaultParallelism().ifPresent(parallelism -> newParameters.desiredParallelism = parallelism);
            return newParameters;
        });
        return new ThreadPool(group, topLevelGroup, effectiveParameters, clock, failedJobRunsStore, jobIdSupplier);
    }

    private void assertNotShutDown() {
        if (shutdown) {
            throw new IllegalStateException("ThreadPoolManager is shutdown.");
        }
    }

    synchronized InterruptedException shutDownAll() {
        shutdown = true;
        pools.forEach((group, pool) -> pool.cancelAllJobs());
        pools.forEach((group, pool) -> pool.shutDown());
        return pools.values().stream().map(ThreadPool::getShutdownException).reduce(null, Exceptions::chain);
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy