| Server IP : 162.19.112.25 / Your IP : 216.73.216.88 Web Server : LiteSpeed System : Linux qamar.tasjeel.ae 5.14.0-611.55.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Tue May 19 15:19:29 EDT 2026 x86_64 User : archiart ( 1428) PHP Version : 8.2.33 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /lib64/python3.9/multiprocessing/__pycache__/ |
Upload File : |
a
�i�G � @ s� d Z ddgZddlmZ ddlZddlZddlZddlZddlZddl Z ej
dkr`ddl Z dZ n ddl
Z
dZ ejejB Zd Ze r�d
Znd Zd d
� ZG dd� d�ZdZG dd� d�ZdS )z�Provides shared memory for direct access across processes.
The API of this package is currently provisional. Refer to the
documentation for details.
� SharedMemory�
ShareableList� )�partialN�ntFT� z/psm_Zwnsm_c C sB t tt� d } | dks J d��tt�| � }t|�t ks>J �|S )z6Create a random filename for the shared memory object.� z_SHM_NAME_PREFIX too long)�_SHM_SAFE_NAME_LENGTH�len�_SHM_NAME_PREFIX�secretsZ token_hex)�nbytes�name� r �5/usr/lib64/python3.9/multiprocessing/shared_memory.py�_make_filename' s
r c @ s� e Zd ZdZdZdZdZdZej Z
dZ e r.dndZ
ddd �Zd
d � Zd d
� Zdd� Zedd� �Zedd� �Zedd� �Zdd� Zdd� ZdS )r a� Creates a new shared memory block or attaches to an existing
shared memory block.
Every shared memory block is assigned a unique name. This enables
one process to create a shared memory block with a particular name
so that a different process can attach to that same shared memory
block using that same name.
As a resource for sharing data across processes, shared memory blocks
may outlive the original process that created them. When one process
no longer needs access to a shared memory block that might still be
needed by other processes, the close() method should be called.
When a shared memory block is no longer needed by any process, the
unlink() method should be called to ensure proper cleanup.N���i� TFr c
C s� |dkst d��|r0ttjB | _|dkr0t d��|d u rL| jtj@ sLt d��t�rD|d u r�t� }ztj || j| j
d�| _ W n t y� Y qZY n0 || _
q�qZn.| jr�d| n|}tj || j| j
d�| _ || _
z<|r�|r�t�| j |� t�| j �}|j}t�| j |�| _W n t�y& | �� � Y n0 ddlm} || j
d � �n*|�r |d u �rZt� n|}t�tjtjtj |d
? d @ |d @ |�}zjt� � }|tj k�r�|d u�r�t t j t�!t j �|tj ��nW t�"|� �qJtjd ||d
�| _W t�"|� n t�"|� 0 || _
�qn�qJnb|| _
t�#tj$d|�}z"t�%|tj$ddd�} W t�"|� n t�"|� 0 t�&| �}tjd ||d
�| _|| _'t(| j�| _)d S )Nr z!'size' must be a positive integerz4'size' must be a positive number different from zeroz&'name' can only be None if create=True)�mode�/� )�register�
shared_memory� l �� r )ZtagnameF)*�
ValueError�_O_CREX�os�O_RDWR�_flags�O_EXCL�
_USE_POSIXr � _posixshmemZshm_open�_mode�_fd�FileExistsError�_name�_prepend_leading_slash� ftruncate�fstat�st_size�mmap�_mmap�OSError�unlink�resource_trackerr �_winapiZCreateFileMappingZINVALID_HANDLE_VALUEZNULLZPAGE_READWRITEZ GetLastErrorZERROR_ALREADY_EXISTS�errno�EEXIST�strerrorZ CloseHandleZOpenFileMappingZ
FILE_MAP_READZ
MapViewOfFileZVirtualQuerySize�_size�
memoryview�_buf)
�selfr
�create�sizeZstatsr Z temp_nameZh_mapZlast_error_codeZp_bufr r r �__init__J s� �
�
�
�
�
��
zSharedMemory.__init__c C s$ z | � � W n ty Y n0 d S �N)�closer* �r4 r r r �__del__� s zSharedMemory.__del__c C s | j | jd| jffS )NF)� __class__r
r6 r: r r r �
__reduce__� s ��zSharedMemory.__reduce__c C s | j j� d| j�d| j� d�S )N�(z, size=�))r< �__name__r
r6 r: r r r �__repr__� s zSharedMemory.__repr__c C s | j S )z4A memoryview of contents of the shared memory block.)r3 r: r r r �buf� s zSharedMemory.bufc C s. | j }tr*| jr*| j �d�r*| j dd� }|S )z4Unique name that identifies the shared memory block.r r N)r# r r$ �
startswith)r4 Z
reported_namer r r r
� s
zSharedMemory.namec C s | j S )zSize in bytes.)r1 r: r r r r6 � s zSharedMemory.sizec C sX | j dur| j �� d| _ | jdur4| j�� d| _trT| jdkrTt�| j� d| _dS )zkCloses access to the shared memory from this instance but does
not destroy the shared memory block.Nr r )r3 �releaser) r9 r r! r r: r r r r9 � s
zSharedMemory.closec C s2 t r.| jr.ddlm} t�| j� || jd� dS )z�Requests that the underlying shared memory block be destroyed.
In order to ensure proper cleanup of resources, unlink should be
called once (and only once) across all processes which have access
to the shared memory block.r )�
unregisterr N)r r# r, rE r Z
shm_unlink)r4 rE r r r r+ � s
zSharedMemory.unlink)NFr )r@ �
__module__� __qualname__�__doc__r# r! r) r3 r r r r r r$ r7 r; r= rA �propertyrB r
r6 r9 r+ r r r r r 1 s(
l
�utf8c @ s e Zd ZdZedededededdj diZ
dZ d d
� d d
� d d
� d
d
� d�Z e
dd� �Zd6dd�dd�Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zed$d%� �Zed&d'� �Zed(d)� �Zed*d+� �Z ed,d-� �Z ed.d/� �Z ed0d1� �Z d2d3� Z d4d5� Z!e"e#j$�Z%dS )7r a� Pattern for a mutable list-like object shareable via a shared
memory block. It differs from the built-in list type in that these
lists can not change their overall length (i.e. no append, insert,
etc.)
Because values are packed into a memoryview as bytes, the struct
packing format for any storable value must require no more than 8
characters to describe its format.�q�dzxxxxxxx?z%dsNzxxxxxx?x� c C s | S r8 r ��valuer r r �<lambda> � zShareableList.<lambda>c C s | � d��t�S �N� )�rstrip�decode� _encodingrN r r r rP rQ c C s
| � d�S rR )rT rN r r r rP rQ c C s d S r8 r )�_valuer r r rP rQ )r r r � c C s: t | ttdjf�sdS t | t�r$dS t | t�r2dS dS dS )z�Used in concert with _back_transforms_mapping to convert values
into the appropriate Python objects when retrieving them from
the list as well as when storing them.Nr r r rX )�
isinstance�str�bytesr< rN r r r �_extract_recreation_code s
z&ShareableList._extract_recreation_code�r
c s� |d u s|d ur�|pd}�fdd�|D �}t |��_tdd� |D ���jksPJ �d}dg�_|D ]6}||d dkrx�jnt|d d� �7 }�j�|� q`�fd d�|D �}t�d
�j d �
|� �j �j �}t
|d |d
��_n
t
|��_|d u�r�t� tjd
�j �jjd�jg�j�R � tjd �
|��jj�jg� fdd�|D ��R � tj�j �jj�jg� fdd�|D ��R � tj�j �jj�jg|�R � n$t ���_tt��j �jjd���_d S )Nr c sP g | ]H}t |ttf�s$� jt|� n&� jt|� � jt|�� j d f �qS )r )rY rZ r[ �_types_mapping�type�
_alignmentr ��.0�itemr: r r �
<listcomp>+ s � � �z*ShareableList.__init__.<locals>.<listcomp>c s s | ]}t |�d kV qdS )rM N)r )rb �fmtr r r � <genexpr>4 rQ z)ShareableList.__init__.<locals>.<genexpr>r r �sc s g | ]}� � |��qS r )r\ ra r: r r rd = s rK � T)r5 r6 c 3 s& | ] }t |t�r|�� �n|V qd S r8 )rY rZ �encode�rb �v��_encr r rf X rQ c 3 s | ]}|� � �V qd S r8 )ri rj rl r r rf ^ rQ rM )r � _list_len�sum�_allocated_offsetsr` �int�append�struct�calcsize�_format_size_metainfo�join�_format_packing_metainfo� _format_back_transform_codesr �shmrV � pack_intorB �_offset_data_start�_offset_packing_formats� _offset_back_transform_codes�list� unpack_from)r4 Zsequencer
Z_formats�offsetre Z_recreation_codesZrequested_sizer )rm r4 r r7 ( s�
�
&
�����
��������
��zShareableList.__init__c C sj |dkr |n|| j }|| j ks*| j dk r2td��t�d| jj| j|d �d }|�d�}|�t �}|S )z>Gets the packing format for a single value stored in the list.r � Requested position out of range.�8srM rS )
rn �
IndexErrorrs r ry rB r| rT rU rV )r4 �positionrk re �
fmt_as_strr r r �_get_packing_formatq s ��
z!ShareableList._get_packing_formatc C sF || j ks| j dk r td��t�d| jj| j| �d }| j| }|S )z9Gets the back transformation function for a single value.r r� �b)rn r� rs r ry rB r} �_back_transforms_mapping)r4 r� �transform_codeZtransform_functionr r r �_get_back_transform� s ��
z!ShareableList._get_back_transformc C sh || j ks| j dk r td��t�d| jj| j|d |�t�� | � |�}t�d| jj| j
| |� dS )zvSets the packing format and back transformation code for a
single value in the list at the specified position.r r� r� rM r� N) rn r� rs rz ry rB r| ri rV r\ r} )r4 r� r� rO r� r r r �!_set_packing_format_and_transform� s �
�z/ShareableList._set_packing_format_and_transformc C sv |dkr |n|| j }z.| j| j| }t�| �|�| jj|�\}W n ty^ td��Y n0 | � |�}||�}|S )Nr zindex out of range)
rn r{ rp rs r r� ry rB r� r� )r4 r� r� rk Zback_transformr r r � __getitem__� s �
zShareableList.__getitem__c C s� |dkr |n|| j }z"| j| }| j| }| �|�}W n tyR td��Y n0 t|ttf�sv| jt |� }|}n`| j|d | }t|t�r�|�
t �n|}t |�|kr�t
d��|d dkr�|}n| jt |f }| �|||� t�|| jj||� d S )Nr z assignment index out of ranger z(bytes/str item exceeds available storager rg )rn rp r{ r� r� rY rZ r[ r^ r_ ri rV r r r� rs rz ry rB ) r4 r� rO Z item_offsetr� Zcurrent_formatZ
new_formatZ
encoded_valueZallocated_lengthr r r � __setitem__� s8
� � ��zShareableList.__setitem__c C s t | j| jjd�dfS )Nr] r )r r< ry r
r: r r r r= � s zShareableList.__reduce__c C s t �d| jjd�d S )NrK r )rs r ry rB r: r r r �__len__� s zShareableList.__len__c C s" | j j� dt| �� d| jj�d�S )Nr> z, name=r? )r< r@ r~ ry r
r: r r r rA � s zShareableList.__repr__c s d� � fdd�t� j�D ��S )z=The struct packing format used by all currently stored items.rh c 3 s | ]}� � |�V qd S r8 )r� )rb �ir: r r rf � s z'ShareableList.format.<locals>.<genexpr>)rv �rangern r: r r: r �format� s �zShareableList.formatc C s d| j d S )z>The struct packing format used for the items' storage offsets.rK r �rn r: r r r ru � s z#ShareableList._format_size_metainfoc C s
d| j S )z>The struct packing format used for the items' packing formats.r� r� r: r r r rw � s z&ShareableList._format_packing_metainfoc C s
d| j S )z>The struct packing format used for the items' back transforms.r� r� r: r r r rx � s z*ShareableList._format_back_transform_codesc C s | j d d S )Nr rM r� r: r r r r{ � s z ShareableList._offset_data_startc C s | j | jd S )Nr )r{ rp r: r r r r| � s z%ShareableList._offset_packing_formatsc C s | j | jd S )NrM )r| rn r: r r r r} s z*ShareableList._offset_back_transform_codesc s t � fdd�| D ��S )zCL.count(value) -> integer -- return number of occurrences of value.c 3 s | ]}� |kV qd S r8 r )rb �entryrN r r rf rQ z&ShareableList.count.<locals>.<genexpr>)ro )r4 rO r rN r �count s zShareableList.countc C s4 t | �D ]\}}||kr| S qt|�d���dS )zpL.index(value) -> integer -- return first index of value.
Raises ValueError if the value is not present.z not in this containerN)� enumerater )r4 rO r� r� r r r �index
s
zShareableList.index)N)&r@ rF rG rH rq �float�boolrZ r[ r< r^ r` r� � staticmethodr\ r7 r� r� r� r� r� r= r� rA rI r� ru rw rx r{ r| r} r� r� � classmethod�types� GenericAlias�__class_getitem__r r r r r � sT ��
I!
)rH �__all__� functoolsr r( r r. rs r r� r
r- r r �O_CREATr r r r
r r rV r r r r r �<module> s.
E