/* * MIT License * * Copyright (c) 2025 Open Media Transport Contributors * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. * */ using System; using System.Collections.Generic; namespace libomtnet { internal class OMTFramePool : OMTBase { Queue pool; public OMTFramePool(int count, int maxDataLength, bool resizable) { pool = new Queue(); for (int i = 0; i < count; i++) { pool.Enqueue(new OMTFrame(maxDataLength, resizable)); } } protected override void DisposeInternal() { if (pool != null) { foreach (OMTFrame frame in pool) { if (frame != null) { frame.Dispose(); } } pool.Clear(); } base.DisposeInternal(); } public OMTFrame Get() { lock (pool) { if (pool.Count > 0) { return pool.Dequeue(); } } return null; } public void Return(OMTFrame frame) { lock (pool) { pool.Enqueue(frame); } } public int Count { get { lock (pool) { return pool.Count; } } } } }