관리-도구
편집 파일: _queue.cpython-38.pyc
U �Mg�+ � @ s| d Z ddlZddlmZ ddlmZ ddlmZ er@ddlmZ ddd gZG d d� de �Z G d d� de �Z G d d � d �Z dS ) a� A fork of Python 3.6's stdlib queue (found in Pythons 'cpython/Lib/queue.py') with Lock swapped out for RLock to avoid a deadlock while garbage collecting. https://github.com/python/cpython/blob/v3.6.12/Lib/queue.py See also https://codewithoutrules.com/2017/08/16/concurrency-python/ https://bugs.python.org/issue14976 https://github.com/sqlalchemy/sqlalchemy/blob/4eb747b61f0c1b1c25bdee3856d7195d10a0c227/lib/sqlalchemy/queue.py#L1 We also vendor the code to evade eventlet's broken monkeypatching, see https://github.com/getsentry/sentry-python/pull/484 Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software Foundation; All Rights Reserved PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2 -------------------------------------------- 1. This LICENSE AGREEMENT is between the Python Software Foundation ("PSF"), and the Individual or Organization ("Licensee") accessing and otherwise using this software ("Python") in source or binary form and its associated documentation. 2. Subject to the terms and conditions of this License Agreement, PSF hereby grants Licensee a nonexclusive, royalty-free, world-wide license to reproduce, analyze, test, perform and/or display publicly, prepare derivative works, distribute, and otherwise use Python alone or in any derivative version, provided, however, that PSF's License Agreement and PSF's notice of copyright, i.e., "Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software Foundation; All Rights Reserved" are retained in Python alone or in any derivative version prepared by Licensee. 3. In the event Licensee prepares a derivative work that is based on or incorporates Python or any part thereof, and wants to make the derivative work available to others as provided herein, then Licensee hereby agrees to include in any such work a brief summary of the changes made to Python. 4. PSF is making Python available to Licensee on an "AS IS" basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT INFRINGE ANY THIRD PARTY RIGHTS. 5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. 6. This License Agreement will automatically terminate upon a material breach of its terms and conditions. 7. Nothing in this License Agreement shall be deemed to create any relationship of agency, partnership, or joint venture between PSF and Licensee. This License Agreement does not grant permission to use PSF trademarks or trade name in a trademark sense to endorse or promote products or services of Licensee, or any third party. 8. By copying, installing or otherwise using Python, Licensee agrees to be bound by the terms and conditions of this License Agreement. � N)�deque)�time)� TYPE_CHECKING)�Any� EmptyError� FullError�Queuec @ s e Zd ZdZdS )r z4Exception raised by Queue.get(block=0)/get_nowait().N��__name__� __module__� __qualname__�__doc__� r r �?/opt/hc_python/lib/python3.8/site-packages/sentry_sdk/_queue.pyr W s c @ s e Zd ZdZdS )r z4Exception raised by Queue.put(block=0)/put_nowait().Nr r r r r r \ s c @ s� e Zd ZdZd!dd�Zdd� Zdd� Zd d � Zd d � Zd d� Z d"dd�Z d#dd�Z dd� Z dd� Z dd� Zdd � Zd d � Zd d � ZdS )$r zjCreate a queue object with a given maximum size. If maxsize is <= 0, the queue size is infinite. r c C sN || _ | �|� t�� | _t�| j�| _t�| j�| _t�| j�| _d| _ d S )Nr ) �maxsize�_init� threading�RLock�mutex� Condition� not_empty�not_full�all_tasks_done�unfinished_tasks��selfr r r r �__init__g s zQueue.__init__c C sH | j �8 | jd }|dkr4|dk r*td��| j �� || _W 5 Q R X dS )a. Indicate that a formerly enqueued task is complete. Used by Queue consumer threads. For each get() used to fetch a task, a subsequent call to task_done() tells the queue that the processing on the task is complete. If a join() is currently blocking, it will resume when all items have been processed (meaning that a task_done() call was received for every item that had been put() into the queue). Raises a ValueError if called more times than there were items placed in the queue. � r z!task_done() called too many timesN)r r � ValueError� notify_all)r � unfinishedr r r � task_done~ s zQueue.task_donec C s( | j � | jr| j �� qW 5 Q R X dS )a� Blocks until all items in the Queue have been gotten and processed. The count of unfinished tasks goes up whenever an item is added to the queue. The count goes down whenever a consumer thread calls task_done() to indicate the item was retrieved and all work on it is complete. When the count of unfinished tasks drops to zero, join() unblocks. N)r r �wait�r r r r �join� s z Queue.joinc C s& | j � | �� W 5 Q R � S Q R X dS )z9Return the approximate size of the queue (not reliable!).N�r �_qsizer# r r r �qsize� s z Queue.qsizec C s( | j � | �� W 5 Q R � S Q R X dS )a� Return True if the queue is empty, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() == 0 as a direct substitute, but be aware that either approach risks a race condition where a queue can grow before the result of empty() or qsize() can be used. To create code that needs to wait for all queued tasks to be completed, the preferred technique is to use the join() method. Nr% r# r r r �empty� s z Queue.emptyc C s< | j �, d| j k o | �� kn W 5 Q R � S Q R X dS )aO Return True if the queue is full, False otherwise (not reliable!). This method is likely to be removed at some point. Use qsize() >= n as a direct substitute, but be aware that either approach risks a race condition where a queue can shrink before the result of full() or qsize() can be used. r N)r r r& r# r r r �full� s z Queue.fullTNc C s� | j �� | jdkr�|s,| �� | jkr�t� �nt|dkrP| �� | jkr�| j �� q4nP|dk rbtd��n>t� | }| �� | jkr�|t� }|dkr�t� �| j �|� ql| �|� | jd7 _| j � � W 5 Q R X dS )a Put an item into the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until a free slot is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the FullError exception if no free slot was available within that time. Otherwise ('block' is false), put an item on the queue if a free slot is immediately available, else raise the FullError exception ('timeout' is ignored in that case). r N�''timeout' must be a non-negative number� r ) r r r& r r" r r �_putr r �notify)r �item�block�timeout�endtime� remainingr r r �put� s& z Queue.putc C s� | j �� |s | �� s�t� �nh|dkr:| �� s�| j �� q$nJ|dk rLtd��n8t� | }| �� s�|t� }|dkrvt� �| j �|� qV| �� }| j�� |W 5 Q R � S Q R X dS )a Remove and return an item from the queue. If optional args 'block' is true and 'timeout' is None (the default), block if necessary until an item is available. If 'timeout' is a non-negative number, it blocks at most 'timeout' seconds and raises the EmptyError exception if no item was available within that time. Otherwise ('block' is false), return an item if one is immediately available, else raise the EmptyError exception ('timeout' is ignored in that case). Nr r* r+ ) r r& r r" r r �_getr r- )r r/ r0 r1 r2 r. r r r �get� s$ z Queue.getc C s | j |dd�S )z�Put an item into the queue without blocking. Only enqueue the item if a free slot is immediately available. Otherwise raise the FullError exception. F�r/ )r3 �r r. r r r � put_nowait� s zQueue.put_nowaitc C s | j dd�S )z�Remove and return an item from the queue without blocking. Only get an item if one is immediately available. Otherwise raise the EmptyError exception. Fr6 )r5 r# r r r � get_nowait s zQueue.get_nowaitc C s t � | _d S �N)r �queuer r r r r s z Queue._initc C s t | j�S r: )�lenr; r# r r r r& s z Queue._qsizec C s | j �|� d S r: )r; �appendr7 r r r r, s z Queue._putc C s | j �� S r: )r; �popleftr# r r r r4 s z Queue._get)r )TN)TN)r r r r r r! r$ r' r( r) r3 r5 r8 r9 r r& r, r4 r r r r r a s ) r r � collectionsr r �typingr r �__all__� Exceptionr r r r r r r �<module> s I