forked from olvid-io/olvid-android
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
128 changed files
with
7,824 additions
and
2,549 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
135 changes: 135 additions & 0 deletions
135
...ine/engine/src/main/java/io/olvid/engine/datatypes/NoDuplicatePriorityOperationQueue.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,135 @@ | ||
| /* | ||
| * Olvid for Android | ||
| * Copyright © 2019-2024 Olvid SAS | ||
| * | ||
| * This file is part of Olvid for Android. | ||
| * | ||
| * Olvid is free software: you can redistribute it and/or modify | ||
| * it under the terms of the GNU Affero General Public License, version 3, | ||
| * as published by the Free Software Foundation. | ||
| * | ||
| * Olvid 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 Affero General Public License for more details. | ||
| * | ||
| * You should have received a copy of the GNU Affero General Public License | ||
| * along with Olvid. If not, see <https://www.gnu.org/licenses/>. | ||
| */ | ||
|
|
||
| package io.olvid.engine.datatypes; | ||
|
|
||
|
|
||
| import java.util.HashSet; | ||
| import java.util.Set; | ||
| import java.util.concurrent.PriorityBlockingQueue; | ||
| import java.util.concurrent.locks.Lock; | ||
| import java.util.concurrent.locks.ReentrantLock; | ||
|
|
||
| import io.olvid.engine.Logger; | ||
|
|
||
| public class NoDuplicatePriorityOperationQueue { | ||
| private final PriorityBlockingQueue<PriorityOperation> operations; | ||
| private final Lock lockOnQueuedOperationUids; | ||
| private final Set<UID> queuedOperationUids; | ||
|
|
||
| private boolean executing = false; | ||
|
|
||
| public NoDuplicatePriorityOperationQueue() { | ||
| queuedOperationUids = new HashSet<>(); | ||
| lockOnQueuedOperationUids = new ReentrantLock(); | ||
| operations = new PriorityBlockingQueue<>(); | ||
| } | ||
|
|
||
| public void queue(PriorityOperation op) { | ||
| if (!op.getDependencies().isEmpty()) { | ||
| Logger.e("Cannot queue an operation with dependencies into a NoDuplicatePriorityOperationQueue."); | ||
| return; | ||
| } | ||
| UID uid = op.getUid(); | ||
| if (uid != null) { | ||
| lockOnQueuedOperationUids.lock(); | ||
| if (queuedOperationUids.contains(uid)) { | ||
| lockOnQueuedOperationUids.unlock(); | ||
| return; | ||
| } | ||
| queuedOperationUids.add(uid); | ||
| lockOnQueuedOperationUids.unlock(); | ||
| } | ||
| op.setPending(); | ||
| operations.add(op); | ||
| } | ||
|
|
||
| public void execute(int numberOfThreads) { | ||
| execute(numberOfThreads, null); | ||
| } | ||
|
|
||
| public void execute(int numberOfThreads, String tag) { | ||
| if (executing) { | ||
| Logger.e("You can only call execute once on a NoDuplicatePriorityOperationQueue."); | ||
| return; | ||
| } | ||
| executing = true; | ||
| for (int i=0; i<numberOfThreads; i++) { | ||
| new NoDuplicatePriorityOperationQueueThread(i, tag).start(); | ||
| } | ||
| } | ||
|
|
||
| class NoDuplicatePriorityOperationQueueThread extends Thread { | ||
| final int threadNumber; | ||
| NoDuplicatePriorityOperationQueueThread(int i, String tag) { | ||
| super(); | ||
| threadNumber = i; | ||
| if (tag != null) { | ||
| setName(tag + "-" + threadNumber); | ||
| } | ||
| } | ||
|
|
||
| @Override | ||
| public void run() { | ||
| //noinspection InfiniteLoopStatement | ||
| while (true) { | ||
| PriorityOperation op; | ||
| try { | ||
| op = operations.take(); | ||
| } catch (InterruptedException e) { | ||
| continue; | ||
| } | ||
|
|
||
| op.updateReadiness(); | ||
| op.processCancel(); | ||
|
|
||
| if (op.getTimestampOfLastExecution() != 0) { | ||
| long timeToWait = op.getTimestampOfLastExecution() - System.currentTimeMillis() + OperationQueue.MILLISECONDS_TO_WAIT_BETWEEN_TWO_OPERATION_EXECUTIONS; | ||
| if (timeToWait > 0) { | ||
| try { | ||
| sleep(timeToWait); | ||
| } catch (InterruptedException ignored) {} | ||
| } | ||
| } | ||
| op.setTimestampOfLastExecution(System.currentTimeMillis()); | ||
|
|
||
| if (op.isReady()) { | ||
| if (op.areConditionsFulfilled()) { | ||
| if (op.getUid() != null) { | ||
| lockOnQueuedOperationUids.lock(); | ||
| queuedOperationUids.remove(op.getUid()); | ||
| lockOnQueuedOperationUids.unlock(); | ||
| } | ||
| try { | ||
| op.execute(); | ||
| } catch (Exception e) { | ||
| Logger.e("Exception in operation that could have killed a queue!"); | ||
| Logger.x(e); | ||
| } | ||
| } else { | ||
| operations.add(op); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
|
|
||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.