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

Commit 4301df6f authored by TreeHugger Robot's avatar TreeHugger Robot Committed by Automerger Merge Worker
Browse files

Merge "USB MIDI: Multijack MIDI 1.0 for MIDI 2.0 devices" into udc-dev am: 3b4472fc

parents 39aabc4d 3b4472fc
Loading
Loading
Loading
Loading
+37 −16
Original line number Diff line number Diff line
@@ -16,7 +16,6 @@

package com.android.internal.midi;

import java.util.Iterator;
import java.util.SortedMap;
import java.util.TreeMap;

@@ -26,11 +25,11 @@ import java.util.TreeMap;
 * And only one Thread can read from the buffer.
 */
public class EventScheduler {
    private static final long NANOS_PER_MILLI = 1000000;
    public static final long NANOS_PER_MILLI = 1000000;

    private final Object mLock = new Object();
    volatile private SortedMap<Long, FastEventQueue> mEventBuffer;
    private FastEventQueue mEventPool = null;
    protected volatile SortedMap<Long, FastEventQueue> mEventBuffer;
    protected FastEventQueue mEventPool = null;
    private int mMaxPoolSize = 200;
    private boolean mClosed;

@@ -38,9 +37,13 @@ public class EventScheduler {
        mEventBuffer = new TreeMap<Long, FastEventQueue>();
    }

    // If we keep at least one node in the list then it can be atomic
    // and non-blocking.
    private class FastEventQueue {
    /**
     * Class for a fast event queue.
     *
     * If we keep at least one node in the list then it can be atomic
     * and non-blocking.
     */
    public static class FastEventQueue {
        // One thread takes from the beginning of the list.
        volatile SchedulableEvent mFirst;
        // A second thread returns events to the end of the list.
@@ -48,7 +51,7 @@ public class EventScheduler {
        volatile long mEventsAdded;
        volatile long mEventsRemoved;

        FastEventQueue(SchedulableEvent event) {
        public FastEventQueue(SchedulableEvent event) {
            mFirst = event;
            mLast = mFirst;
            mEventsAdded = 1;
@@ -149,7 +152,8 @@ public class EventScheduler {
     * @param event
     */
    public void add(SchedulableEvent event) {
        synchronized (mLock) {
        Object lock = getLock();
        synchronized (lock) {
            FastEventQueue list = mEventBuffer.get(event.getTimestamp());
            if (list == null) {
                long lowestTime = mEventBuffer.isEmpty() ? Long.MAX_VALUE
@@ -159,7 +163,7 @@ public class EventScheduler {
                // If the event we added is earlier than the previous earliest
                // event then notify any threads waiting for the next event.
                if (event.getTimestamp() < lowestTime) {
                    mLock.notify();
                    lock.notify();
                }
            } else {
                list.add(event);
@@ -167,7 +171,7 @@ public class EventScheduler {
        }
    }

    private SchedulableEvent removeNextEventLocked(long lowestTime) {
    protected SchedulableEvent removeNextEventLocked(long lowestTime) {
        SchedulableEvent event;
        FastEventQueue list = mEventBuffer.get(lowestTime);
        // Remove list from tree if this is the last node.
@@ -186,7 +190,8 @@ public class EventScheduler {
     */
    public SchedulableEvent getNextEvent(long time) {
        SchedulableEvent event = null;
        synchronized (mLock) {
        Object lock = getLock();
        synchronized (lock) {
            if (!mEventBuffer.isEmpty()) {
                long lowestTime = mEventBuffer.firstKey();
                // Is it time for this list to be processed?
@@ -209,7 +214,8 @@ public class EventScheduler {
     */
    public SchedulableEvent waitNextEvent() throws InterruptedException {
        SchedulableEvent event = null;
        synchronized (mLock) {
        Object lock = getLock();
        synchronized (lock) {
            while (!mClosed) {
                long millisToWait = Integer.MAX_VALUE;
                if (!mEventBuffer.isEmpty()) {
@@ -231,7 +237,7 @@ public class EventScheduler {
                        }
                    }
                }
                mLock.wait((int) millisToWait);
                lock.wait((int) millisToWait);
            }
        }
        return event;
@@ -242,10 +248,25 @@ public class EventScheduler {
        mEventBuffer = new TreeMap<Long, FastEventQueue>();
    }

    /**
     * Stops the EventScheduler.
     * The subscriber calling waitNextEvent() will get one final SchedulableEvent returning null.
     */
    public void close() {
        synchronized (mLock) {
        Object lock = getLock();
        synchronized (lock) {
            mClosed = true;
            mLock.notify();
            lock.notify();
        }
    }

    /**
     * Gets the lock. This doesn't lock it in anyway.
     * Subclasses can override this.
     *
     * @return Object
     */
    protected Object getLock() {
        return mLock;
    }
}
+128 −0
Original line number Diff line number Diff line
/*
 * Copyright (C) 2023 The Android Open Source Project
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.android.internal.midi;

/**
 * Uses multiple MidiEventSchedulers for waiting for events.
 *
 */
public class MidiEventMultiScheduler {
    private MultiLockMidiEventScheduler[] mMidiEventSchedulers;
    private int mNumEventSchedulers;
    private int mNumClosedSchedulers = 0;
    private final Object mMultiLock = new Object();

    private class MultiLockMidiEventScheduler extends MidiEventScheduler {
        @Override
        public void close() {
            synchronized (mMultiLock) {
                mNumClosedSchedulers++;
            }
            super.close();
        }

        @Override
        protected Object getLock() {
            return mMultiLock;
        }

        public boolean isEventBufferEmptyLocked() {
            return mEventBuffer.isEmpty();
        }

        public long getLowestTimeLocked() {
            return mEventBuffer.firstKey();
        }
    }

    /**
     * MidiEventMultiScheduler constructor
     *
     * @param numSchedulers the number of schedulers to create
     */
    public MidiEventMultiScheduler(int numSchedulers) {
        mNumEventSchedulers = numSchedulers;
        mMidiEventSchedulers = new MultiLockMidiEventScheduler[numSchedulers];
        for (int i = 0; i < numSchedulers; i++) {
            mMidiEventSchedulers[i] = new MultiLockMidiEventScheduler();
        }
    }

    /**
     * Waits for the next MIDI event. This will return true when it receives it.
     * If all MidiEventSchedulers have been closed, this will return false.
     *
     * @return true if a MIDI event is received and false if all schedulers are closed.
     */
    public boolean waitNextEvent() throws InterruptedException {
        synchronized (mMultiLock) {
            while (true) {
                if (mNumClosedSchedulers >= mNumEventSchedulers) {
                    return false;
                }
                long lowestTime = Long.MAX_VALUE;
                long now = System.nanoTime();
                for (MultiLockMidiEventScheduler eventScheduler : mMidiEventSchedulers) {
                    if (!eventScheduler.isEventBufferEmptyLocked()) {
                        lowestTime = Math.min(lowestTime,
                                eventScheduler.getLowestTimeLocked());
                    }
                }
                if (lowestTime <= now) {
                    return true;
                }
                long nanosToWait = lowestTime - now;
                // Add 1 millisecond so we don't wake up before it is
                // ready.
                long millisToWait = 1 + (nanosToWait / EventScheduler.NANOS_PER_MILLI);
                // Clip 64-bit value to 32-bit max.
                if (millisToWait > Integer.MAX_VALUE) {
                    millisToWait = Integer.MAX_VALUE;
                }
                mMultiLock.wait(millisToWait);
            }
        }
    }

    /**
     * Gets the number of MidiEventSchedulers.
     *
     * @return the number of MidiEventSchedulers.
     */
    public int getNumEventSchedulers() {
        return mNumEventSchedulers;
    }

    /**
     * Gets a specific MidiEventScheduler based on the index.
     *
     * @param index the zero indexed index of a MIDI event scheduler
     * @return a MidiEventScheduler
     */
    public MidiEventScheduler getEventScheduler(int index) {
        return mMidiEventSchedulers[index];
    }

    /**
     * Closes all event schedulers.
     */
    public void close() {
        for (MidiEventScheduler eventScheduler : mMidiEventSchedulers) {
            eventScheduler.close();
        }
    }
}
+1 −1
Original line number Diff line number Diff line
@@ -79,7 +79,7 @@ public class MidiEventScheduler extends EventScheduler {
    /**
     * Create an event that contains the message.
     */
    private MidiEvent createScheduledEvent(byte[] msg, int offset, int count,
    public MidiEvent createScheduledEvent(byte[] msg, int offset, int count,
            long timestamp) {
        MidiEvent event;
        if (count > POOL_EVENT_SIZE) {
Loading