CURRENT PATH:
/
usr
/
lib
/
python3.9
/
site-packages
/
bcc
/
__pycache__
/
[ ⬅ KEMBALI ]
|
[ HOME ]
Upload File:
Upload Ke Sini
Dir Baru
File Baru
Editing:
table.cpython-39.pyc
a u*�h:� � : @ sD d dl mZ zd dlmZ W n ey: d dlmZ Y n0 d dlmZ d dlZ d dl m Z d dl Z d dl Z d dlZd dlZd dlZddlmZmZmZmZmZ ddlmZ dd lmZ dZd Zd Z d Z d Z dZ dZ dZ!dZ"dZ#dZ$dZ%dZ&dZ'dZ(dZ)dZ*dZ+dZ,d Z-d Z.d Z/d Z0d Z1d!Z2d"Z3d#Z4d$Z5d%Z6ed&ed'e d(e d)e d*e d+e d,e!d-e"d.e#d/e$d0e%d1e&d2e'd3e(d4e)d5e*d6e+d7e,d8e-d9e.d:e/d;e0d<e1d=e2d>e3d?e4d@e5dAe6dBi Z7dCa8dDZ9dEZ:dFdG� Z;d�dHdI�Z<d�dJdK�Z=dLdM� Z>dNdO� Z?dPdQ� Z@dRdS� ZAdTdU� ZBG dVdW� dWe�ZCG dXdY� dYeC�ZDG dZd[� d[eD�ZEG d\d]� d]eC�ZFG d^d_� d_eF�ZGG d`da� daeF�ZHG dbdc� dc�ZIG ddde� deeF�ZJG dfdg� dgeF�ZKG dhdi� dieD�ZLG djdk� dkeL�ZMG dldm� dmeF�ZNG dndo� doeC�ZOG dpdq� dqeC�ZPG drds� dseF�ZQG dtdu� dueF�ZRG dvdw� dweF�ZSG dxdy� dyeF�ZTG dzd{� d{eD�ZUG d|d}� d}eC�ZVG d~d� d�ZWdS )�� )�print_function)�MutableMapping)�strftimeN)�reduce� )�lib� _RAW_CB_TYPE� _LOST_CB_TYPE�_RINGBUF_CB_TYPE�bcc_perf_buffer_opts)�get_online_cpus)�get_possible_cpus� � � � � � � � � � � � � � � � � � � � � � � � � � � � ZHASHZARRAYZ PROG_ARRAYZPERF_EVENT_ARRAYZ PERCPU_HASHZ PERCPU_ARRAYZ STACK_TRACEZ CGROUP_ARRAYZLRU_HASHZLRU_PERCPU_HASHZLPM_TRIEZ ARRAY_OF_MAPSZ HASH_OF_MAPSZDEVMAPZSOCKMAPZCPUMAPZXSKMAPZSOCKHASHZCGROUP_STORAGEZREUSEPORT_SOCKARRAYZPERCPU_CGROUP_STORAGEZQUEUEZSTACKZ SK_STORAGEZ DEVMAP_HASHZ STRUCT_OPSZRINGBUFZ INODE_STORAGEZ TASK_STORAGE�( �A i c C sX d}d}||| | d ks<||d kr*q<|d7 }|d7 }q| |krT|d d� d }|S )Nr � r �*����+� )�val�val_max�width�i�textr0 r0 �-/usr/lib/python3.9/site-packages/bcc/table.py�_starsd s r7 c C s t | |d d�S )N)�section_bucket)�_get_json_hist)�vals�val_typer8 r0 r0 r6 � get_json_histp s r< c C s� g }d}t t| ��D ]}| | dkr|}qd}d}t t| ��D ]V}|dkr>||kr>|d }i }||d< t|�d |d< t| | �|d< |�|� |}q>td�||d�} |r�|d | |d < | S ) Nr r r zinterval-startz interval-end�countz%Y-%m-%d %H:%M:%S)�tsr; �data)�range�len�int�appendr ) r: r; r8 Z hist_listZmax_nonzero_idxr4 �index�prevZlist_objZ histogramr0 r0 r6 r9 s s( r9 c C s d}d}d}t | �D ] \}}|dkr(|}||kr|}q|dkrLd}d} t} nd}d} ttd �} |dkrtt|| � td |d �D ]~}d |> d ? } d |> d } | | kr�| d 8 } | | } |r�| r�t| | | | | t| || �f � d }q�t| | | | | t| || �f � q�d S ) N�@ r. r � z# %-19s : count distributionz%10d -> %-10d : %-8d |%-*s|z- %-29s : count distributionz%20d -> %-20d : %-8d |%-*s|r r F)� enumerate� stars_maxrB �printr@ r7 )r: r; �strip_leading_zero� log2_dist_max�idx_maxr2 r4 �v�header�body�starsZlowZhighr1 r0 r0 r6 �_print_log2_hist� s< � �rR c C s� d}d}d}t | �D ] \}}|dkr(|}||kr|}qd}d} t} |dkrVt|| � td|d �D ]R}| | } |r�| r�t| || | t| || �f � d}qdt| || | t| || �f � qdd S )NrF r. r z# %-13s : count distributionz %-10d : %-8d |%-*s|r F)rH rI rJ r@ r7 ) r: r; rK rL rM r2 r4 rN rO rP rQ r1 r0 r0 r6 �_print_linear_hist� s, � �rS c C s$ z t | W S ty Y dS 0 d S )Nz <unknown>)� map_type_name�KeyError)�ttyper0 r0 r6 �get_table_type_name� s rW c C s� t jt jt jt jt jt jt jt jt jt jt jt jt jt jt jt jt j t j t j t j t j t j d t j d t j d�}t �d�}g }t�| jj| j�}d}||k �rnt�| jj| j|��� }t �d|�}|�d�}|�d�} t �d| �r�d} |�| �}zD|�r |�|||�d� t|�d�� f� n|�||| f� W n0 t�yb td | t j d � t � d� Y n0 |d7 }q�t d t j fd |i�S ) Nr )�charZs8z unsigned char�u8zu8 *zchar *ZshortZs16zunsigned short�u16rB Zs32�enumz unsigned int�u32Zlongz unsigned longz long longZs64zunsigned long longZu64Z__int128zunsigned __int128zvoid *z (\S+(?: \S+)*) ?\[([0-9]+)\]$r z (.*)#(.*)r zenum .*r[ zGType: '%s' not recognized. Please define the data with ctypes manually.)�filer, �_fields_)!�ctZc_charZc_ubyteZc_char_pZc_shortZc_ushort�c_int�c_uintZc_longZc_ulongZ c_longlongZ c_ulonglongZc_void_p�re�compiler Zbpf_perf_event_fields�bpf�module�_nameZbpf_perf_event_field�decode�match�grouprC rB rU rJ �sys�stderr�exit�type� Structure) Z event_mapZ ct_mappingZ array_type�fields� num_fieldsr4 Zfield�m� field_nameZ field_typer0 r0 r6 �_get_event_class� sd � (�� rs c K sB t �| j|�}d}|tkr.t| ||||�}�n�|tkrJt| ||||�}�n�|tkrft| ||||�}�n�|t kr�t | |||||�}�n�|t kr�t | ||||fi |��}�n�|t kr�t| ||||fi |��}�n\|tkr�t| ||||�}�n@|tk�rt| ||||�}�n"|tk�r$t| ||||�}�n|tk�r@t| ||||�}n�|tk�r\t| ||||�}n�|tk�rxt| ||||�}n�|tk�r�t | ||||�}n�|t k�r�t | ||||�}nx|t k�r�t | ||||�}n\|t!k�r�t"| ||||�}n@|t#k�s�|t$k�r t%| |||�}n |t&k�r(t'| |||||�}|dk�r>t(d| ��|S )z|Table(bpf, map_id, map_fd, keytype, leaftype, **kwargs) Create a python object out of a reference to a bpf table handleNzUnknown table type %d))r �bpf_table_type_idre �BPF_MAP_TYPE_HASH� HashTable�BPF_MAP_TYPE_ARRAY�Array�BPF_MAP_TYPE_PROG_ARRAY� ProgArray� BPF_MAP_TYPE_PERF_EVENT_ARRAY�PerfEventArray�BPF_MAP_TYPE_PERCPU_HASH� PerCpuHash�BPF_MAP_TYPE_PERCPU_ARRAY� PerCpuArray�BPF_MAP_TYPE_LPM_TRIE�LpmTrie�BPF_MAP_TYPE_STACK_TRACE� StackTrace�BPF_MAP_TYPE_LRU_HASH�LruHash� BPF_MAP_TYPE_LRU_PERCPU_HASH� LruPerCpuHash�BPF_MAP_TYPE_CGROUP_ARRAY� CgroupArray�BPF_MAP_TYPE_DEVMAP�DevMap�BPF_MAP_TYPE_CPUMAP�CpuMap�BPF_MAP_TYPE_XSKMAP�XskMap�BPF_MAP_TYPE_ARRAY_OF_MAPS� MapInMapArray�BPF_MAP_TYPE_HASH_OF_MAPS� MapInMapHash�BPF_MAP_TYPE_QUEUE�BPF_MAP_TYPE_STACK� QueueStack�BPF_MAP_TYPE_RINGBUF�RingBuf� Exception) rd �map_id�map_fd�keytype�leaftype�name�kwargsrV �tr0 r0 r6 �Table sR r� c @ s e Zd ZdDdd�Zdd� Zdd� Zdd � Zd d � Zd d � Zdd� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zd d � ZdEd d �ZdFd!d"�Zd#d$� ZdGd%d&�Zd'd(� Zd)d*� ZdHd,d-�Zd.d/� Zd0d1� Zd2d3� Zd4d5� ZG d6d7� d7e �Z d8d9� Z e fd:d;�Z dId>d?�Z!dJd@dA�Z"dKdBdC�Z#dS )L� TableBaseNc C sn || _ || _|| _|| _|| _t�| j j| j�| _t� | j j| j�| _ i | _ || _ t t�| j j| j��| _d S �N)rd r� r� �Key�Leafr rt re rV �bpf_table_flags_id�flags�_cbsrf rB �bpf_table_max_entries_id� max_entries)�selfrd r� r� r� r� r� r0 r0 r6 �__init__C s �zTableBase.__init__c C s | j S r� )r� �r� r0 r0 r6 �get_fdP s zTableBase.get_fdc C sN t �t �| j�d �}t�| jj| j|t |�t � |��}|dk rHt d��|j S )Nr r zCould not printf key) r_ �create_string_buffer�sizeofr� r Zbpf_table_key_snprintfrd re r� rA �byrefr� �value)r� �key�buf�resr0 r0 r6 � key_sprintfS s �zTableBase.key_sprintfc C sN t �t �| j�d �}t�| jj| j|t |�t � |��}|dk rHt d��|j S �Nr r zCould not printf leaf� r_ r� r� r� r Zbpf_table_leaf_snprintfrd re r� rA r� r� r� �r� �leafr� r� r0 r0 r6 � leaf_sprintf[ s �zTableBase.leaf_sprintfc C s8 | � � }t�| jj| j|t�|��}|dk r4td��|S )Nr zCould not scanf key) r� r Zbpf_table_key_sscanfrd re r� r_ r� r� )r� Zkey_strr� r� r0 r0 r6 � key_scanfc s �zTableBase.key_scanfc C s8 | � � }t�| jj| j|t�|��}|dk r4td��|S �Nr zCould not scanf leaf� r� r Zbpf_table_leaf_sscanfrd re r� r_ r� r� �r� Zleaf_strr� r� r0 r0 r6 � leaf_scanfk s �zTableBase.leaf_scanfc C s4 | � � }t�| jt�|�t�|��}|dk r0t�|S �Nr �r� r Zbpf_lookup_elemr� r_ r� rU �r� r� r� r� r0 r0 r6 � __getitem__s s zTableBase.__getitem__c C sD t �| jt�|�t�|�d�}|dk r@t�t�� �}td| ��d S )Nr zCould not update table: %s� r �bpf_update_elemr� r_ r� �os�strerror� get_errnor� )r� r� r� r� �errstrr0 r0 r6 � __setitem__z s zTableBase.__setitem__c C s$ t �| jt�|��}|dk r t�d S r� )r Zbpf_delete_elemr� r_ r� rU )r� r� r� r0 r0 r6 � __delitem__� s zTableBase.__delitem__c c s0 | D ]&}z| | V W q t y( Y q0 qd S r� �rU �r� r� r0 r0 r6 � itervalues� s zTableBase.itervaluesc c s4 | D ]*}z|| | fV W q t y, Y q0 qd S r� r� r� r0 r0 r6 � iteritems� s zTableBase.iteritemsc C s dd� | � � D �S )Nc S s g | ]}|�qS r0 r0 )�.0�itemr0 r0 r6 � <listcomp>� � z#TableBase.items.<locals>.<listcomp>)r� r� r0 r0 r6 �items� s zTableBase.itemsc C s dd� | � � D �S )Nc S s g | ]}|�qS r0 r0 �r� r� r0 r0 r6 r� � r� z$TableBase.values.<locals>.<listcomp>�r� r� r0 r0 r6 �values� s zTableBase.valuesc C s | � � D ]}| �|� qd S r� )�keysr� �r� �kr0 r0 r6 �clear� s zTableBase.clearFc C sv d }}|s |s t �d�ddfS |s,| j}n|dk s>|| jkrFtd��|rV| j| � }|rf| j| � }t �|�||fS )a� Allocate keys and/or values arrays. Useful for in items_*_batch. Args: alloc_k (bool): True to allocate keys array, False otherwise. Default is False. alloc_v (bool): True to allocate values array, False otherwise. Default is False. count (int): number of elements in the array(s) to allocate. If count is None then it allocates the maximum number of elements i.e self.max_entries. Returns: tuple: (count, keys, values). Where count is ct.c_uint32, and keys and values an instance of ct.Array Raises: ValueError: If count is less than 1 or greater than self.max_entries. Nr r z Wrong count)r_ �c_uint32r� � ValueErrorr� r� )r� �alloc_k�alloc_vr= r� r� r0 r0 r6 �_alloc_keys_values� s z TableBase._alloc_keys_valuesc C sr d}||fD ]:}|r t |tj�s$t�t|�}|dk s>|| jkr td��q |rh|rht|�t|�krhtd��t�|�S )a� Check if the given keys or values have the right type and size. Args: keys (ct.Array): keys array to check values (ct.Array): values array to check Returns: ct.c_uint32 : the size of the array(s) Raises: ValueError: If length of arrays is less than 1 or greater than self.max_entries, or when both arrays length are different. TypeError: If the keys and values are not an instance of ct.Array r r zArray's length is wrongz(keys array length != values array length)� isinstancer_ rx � TypeErrorrA r� r� r� )r� r� r� Zarr_len�elemr0 r0 r6 �_sanity_check_keys_values� s z#TableBase._sanity_check_keys_valuesc c s$ | j dd�D ]\}}||fV q dS )a Look up all the key-value pairs in the map. Args: None Yields: tuple: The tuple of (key,value) for every entries that have been looked up. Notes: lookup batch on a keys subset is not supported by the kernel. F��deleteN��)_items_lookup_and_optionally_delete_batch�r� r� rN r0 r0 r6 �items_lookup_batch� s z TableBase.items_lookup_batchc C sf |durP| j |d�}t�| jt�|�t�|��}|dkrbtdt�t� � � ��n| � � D ]} dS dS )a� Delete the key-value pairs related to the keys given as parameters. Note that if no key are given, it is faster to call lib.bpf_lookup_and_delete_batch than create keys array and then call lib.bpf_delete_batch on these keys. Args: ct_keys (ct.Array): keys array to delete. If an array of keys is given then it deletes all the related keys-values. If keys is None (default) then it deletes all entries. Yields: tuple: The tuple of (key,value) for every entries that have been deleted. Raises: Exception: If bpf syscall return value indicates an error. N)r� r z#BPF_MAP_DELETE_BATCH has failed: %s) r� r Zbpf_delete_batchr� r_ r� r� r� r� r� � items_lookup_and_delete_batch)r� �ct_keys�ct_cntr� �_r0 r0 r6 �items_delete_batch� s � � z TableBase.items_delete_batchc C sT | j ||d�}t�| jt�|�t�|�t�|��}|dkrPtdt�t� � � ��dS )aq Update all the key-value pairs in the map provided. The arrays must be the same length, between 1 and the maximum number of entries. Args: ct_keys (ct.Array): keys array to update ct_values (ct.Array): values array to update Raises: Exception: If bpf syscall return value indicates an error. )r� r� r z#BPF_MAP_UPDATE_BATCH has failed: %sN) r� r Zbpf_update_batchr� r_ r� r� r� r� r� )r� r� � ct_valuesr� r� r0 r0 r6 �items_update_batch s � �z TableBase.items_update_batchc c s$ | j dd�D ]\}}||fV q dS )a? Look up and delete all the key-value pairs in the map. Args: None Yields: tuple: The tuple of (key,value) for every entries that have been looked up and deleted. Notes: lookup and delete batch on a keys subset is not supported by the kernel. Tr� Nr� r� r0 r0 r6 r� $ s z'TableBase.items_lookup_and_delete_batchTc c sj |du rt j}d}n t j}d}| jddd�\}}}t�d� }}d} |j| |_|| j| rdt�|�ndt�|�t�|t� | j �| �t�|t� | j �| �t�|��} t� � } | |j7 } | dkr�| t jkr�td|t�| �f ��| dkr�q | |jkr��q |jdkrD�q qDtd| �D ]P} || } || }t| tj��s@| � | �} t|tj��sX| � |�}| |fV �qdS )a� Look up and optionally delete all the key-value pairs in the map. Args: delete (bool) : look up and delete the key-value pairs when True, else just look up. Yields: tuple: The tuple of (key,value) for every entries that have been looked up and deleted. Raises: Exception: If bpf syscall return value indicates an error. Notes: lookup and delete batch on a keys subset is not supported by the kernel. TZ BPF_MAP_LOOKUP_AND_DELETE_BATCHZBPF_MAP_LOOKUP_BATCH)r� r� r Nz%s has failed: %s)r Zbpf_lookup_and_delete_batchZbpf_lookup_batchr� r_ r� r� r� r� r� r� r� r� �errno�ENOENTr� r� r� r@ r� rn )r� r� Z bpf_batchZbpf_cmdZ ct_buf_sizer� r� Z ct_out_batchr� �totalr� Zerrcoder4 r� rN r0 r0 r6 r� 3 sL � � � z3TableBase._items_lookup_and_optionally_delete_batchc C s" t | �� �D ]}| �� | |< q d S r� )�listr� r� r� r0 r0 r6 �zerop s zTableBase.zeroc C s t �| �S r� )r� �Iterr� r0 r0 r6 �__iter__x s zTableBase.__iter__c C s | � � S r� �r� r� r0 r0 r6 �iter{ r� zTableBase.iterc C s | � � S r� r� r� r0 r0 r6 r� | r� zTableBase.keysc @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S ) zTableBase.Iterc C s || _ d | _d S r� )�tabler� )r� r� r0 r0 r6 r� s zTableBase.Iter.__init__c C s | S r� r0 r� r0 r0 r6 r� � s zTableBase.Iter.__iter__c C s | � � S r� ��nextr� r0 r0 r6 �__next__� s zTableBase.Iter.__next__c C s | j �| j�| _| jS r� )r� r� r� r� r0 r0 r6 r� � s zTableBase.Iter.nextN��__name__� __module__� __qualname__r� r� r r� r0 r0 r0 r6 r� ~ s r� c C s^ | � � }|d u r0t�| jt�|�t�| j ��}n t�| jt�|�t�|��}|dk rZt� �|S r� ) r� r Zbpf_get_first_keyr� r_ r� r� Zbpf_get_next_key� StopIteration)r� r� Znext_keyr� r0 r0 r6 r� � s ��zTableBase.nextc C s� | j jd d }| j jd d }|dkrHt| j j�dkrH| j jd d }| �� D ]L\}} t||�} |rn|| �} |�| dg| � } || < t||�} | j| | < qPt|�� �} |r�|| �} | D ]} |� | � q�d S )Nr r Z__pad_1r r ) r� r^ rA r� �getattr�getr� r� r� rC )r� �tmp�buckets� bucket_fn�bucket_sort_fnZ index_max�f1�f2r� rN �bucketr: ZslotZ buckets_lstr0 r0 r6 �decode_c_struct� s zTableBase.decode_c_structr� � Bucket ptrc C s� t | �� tj�rfi }g }| �||||� |D ]6}|| } |rJ|||�f} n||f} tt| || �� q,n6dgt } | �� D ]\} } | j | | j < qxtt| |�� dS )a. print_json_hist(val_type="value", section_header="Bucket ptr", section_print_fn=None, bucket_fn=None, bucket_sort_fn=None): Prints a table as a json histogram. The table must be stored as log2. The val_type argument is optional, and is a column header. If the histogram has a secondary key, the dictionary will be split by secondary key If section_print_fn is not None, it will be passed the bucket value to format into a string as it sees fit. If bucket_fn is not None, it will be used to produce a bucket value for the histogram keys. If bucket_sort_fn is not None, it will be used to sort the buckets before iterating them, and it is useful when there are multiple fields in the secondary key. The maximum index allowed is log2_index_max (65), which will accommodate any 64-bit integer in the histogram. r N) r� r� r_ rn r rJ r9 �log2_index_maxr� r� ) r� r; �section_header�section_print_fnr r r r r r: r8 r� rN r0 r0 r6 �print_json_hist� s zTableBase.print_json_histc C s� t | �� tj�rri }g }| �||||� |D ]B} || } |rRtd||| �f � ntd|| f � t| ||� q,n4dgt } | �� D ]\} } | j | | j < q�t| ||� dS )a� print_log2_hist(val_type="value", section_header="Bucket ptr", section_print_fn=None, bucket_fn=None, strip_leading_zero=None, bucket_sort_fn=None): Prints a table as a log2 histogram. The table must be stored as log2. The val_type argument is optional, and is a column header. If the histogram has a secondary key, multiple tables will print and section_header can be used as a header description for each. If section_print_fn is not None, it will be passed the bucket value to format into a string as it sees fit. If bucket_fn is not None, it will be used to produce a bucket value for the histogram keys. If the value of strip_leading_zero is not False, prints a histogram that is omitted leading zeros from the beginning. If bucket_sort_fn is not None, it will be used to sort the buckets before iterating them, and it is useful when there are multiple fields in the secondary key. The maximum index allowed is log2_index_max (65), which will accommodate any 64-bit integer in the histogram. � %s = %s� %s = %rr N) r� r� r_ rn r rJ rR r r� r� � r� r; r r r rK r r r r r: r� rN r0 r0 r6 �print_log2_hist� s � zTableBase.print_log2_histc C s� t | �� tj�rti }g }| �||||t� |D ]B} || } |rTtd||| �f � ntd|| f � t| ||� q.n^dgt } | �� D ]>\} } z| j | | j < W q� t y� t d| j tf ��Y q�0 q�t| ||� dS )a� print_linear_hist(val_type="value", section_header="Bucket ptr", section_print_fn=None, bucket_fn=None, strip_leading_zero=None, bucket_sort_fn=None) Prints a table as a linear histogram. This is intended to span integer ranges, eg, from 0 to 100. The val_type argument is optional, and is a column header. If the histogram has a secondary key, multiple tables will print and section_header can be used as a header description for each. If section_print_fn is not None, it will be passed the bucket value to format into a string as it sees fit. If bucket_fn is not None, it will be used to produce a bucket value for the histogram keys. If the value of strip_leading_zero is not False, prints a histogram that is omitted leading zeros from the beginning. If bucket_sort_fn is not None, it will be used to sort the buckets before iterating them, and it is useful when there are multiple fields in the secondary key. The maximum index allowed is linear_index_max (1025), which is hoped to be sufficient for integer ranges spanned. r r r z5Index in print_linear_hist() of %d exceeds max of %d.N) r� r� r_ rn r �linear_index_maxrJ rS r� r� � IndexErrorr r0 r0 r6 �print_linear_hist� s* � �zTableBase.print_linear_hist)N)FFN)NN)N)T)r� r NNN)r� r NNNN)r� r NNNN)$r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �objectr� r� r r r r r r0 r0 r0 r6 r� A sN # = � $ � ( �r� c s$ e Zd Z� fdd�Zdd� Z� ZS )rv c s t t| �j|i |�� d S r� )�superrv r� �r� �argsr� �� __class__r0 r6 r� , s zHashTable.__init__c C s d}| D ] }|d7 }q|S �Nr r r0 �r� r4 r� r0 r0 r6 �__len__/ s zHashTable.__len__�r r r r� r$ � __classcell__r0 r0 r r6 rv + s rv c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� 5 s zLruHash.__init__�r r r r� r& r0 r0 r r6 r� 4 s r� c sp e Zd Z� fdd�Zdd� Zdd� Z� fdd�Z� fd d �Z� fd d �Zd d� Z dd� Z G dd� de �Z � Z S )� ArrayBasec s t t| �j|i |�� d S r� )r r( r� r r r0 r6 r� 9 s zArrayBase.__init__c C sV t |t�r(|dk r t| �| }| �|�}t |tj�s<td��|jt| �krRtd��|S )Nr z#Array index must be an integer typezArray index out of range)r� rB rA r� r_ Z _SimpleCDatar r� r� r0 r0 r6 �_normalize_key< s zArrayBase._normalize_keyc C s | j S r� )r� r� r0 r0 r6 r$ G s zArrayBase.__len__c s | � |�}tt| ��|�S r� )r) r r( r� r� r r0 r6 r� J s zArrayBase.__getitem__c s | � |�}tt| ��||� d S r� )r) r r( r� �r� r� r� r r0 r6 r� N s zArrayBase.__setitem__c s | � |�}tt| ��|� d S r� )r) r r( r� r� r r0 r6 r� R s zArrayBase.__delitem__c C sD | � |�}| �� }t�| jt�|�t�|�d�}|dk r@td��d S )Nr zCould not clear item)r) r� r r� r� r_ r� r� r� r0 r0 r6 � clearitemV s zArrayBase.clearitemc C s t �| | j�S r� )r( r� r� r� r0 r0 r6 r� ] s zArrayBase.__iter__c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S ) zArrayBase.Iterc C s || _ || _d| _d S �Nr. )r� r� r4 )r� r� r� r0 r0 r6 r� a s zArrayBase.Iter.__init__c C s | S r� r0 r� r0 r0 r6 r� f s zArrayBase.Iter.__iter__c C s | � � S r� r� r� r0 r0 r6 r h s zArrayBase.Iter.__next__c C s0 | j d7 _ | j t| j�kr$t� �| �| j �S �Nr )r4 rA r� r r� r� r0 r0 r6 r� j s zArrayBase.Iter.nextNr r0 r0 r0 r6 r� ` s r� )r r r r� r) r$ r� r� r� r+ r� r r� r& r0 r0 r r6 r( 8 s r( c s$ e Zd Z� fdd�Zdd� Z� ZS )rx c s t t| �j|i |�� d S r� )r rx r� r r r0 r6 r� q s zArray.__init__c C s | � |� d S r� �r+ r� r0 r0 r6 r� t s zArray.__delitem__)r r r r� r� r& r0 r0 r r6 rx p s rx c s( e Zd Z� fdd�Z� fdd�Z� ZS )rz c s t t| �j|i |�� d S r� )r rz r� r r r0 r6 r� y s zProgArray.__init__c sD t |t�r| �|�}t || jj�r.| �|j�}tt| ��||� d S r� ) r� rB r� rd ZFunction�fdr rz r� r* r r0 r6 r� | s zProgArray.__setitem__�r r r r� r� r& r0 r0 r r6 rz x s rz c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd S ) �FileDescc C s" |d u s|dk rt d��|| _d S )Nr zInvalid file descriptor)r� r/ )r� r/ r0 r0 r6 r� � s zFileDesc.__init__c C s* | j d ur&| j dkr&t�| j � d | _ d S r� )r/ r� �closer� r0 r0 r6 �clean_up� s zFileDesc.clean_upc C s | � � d S r� �r3 r� r0 r0 r6 �__del__� s zFileDesc.__del__c O s | S r� r0 r r0 r0 r6 � __enter__� s zFileDesc.__enter__c O s | � � d S r� r4 r r0 r0 r6 �__exit__� s zFileDesc.__exit__N)r r r r� r3 r5 r6 r7 r0 r0 r0 r6 r1 � s r1 c s( e Zd Z� fdd�Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zCgroupArray.__init__c s� t |t�r$tt| ��|| �|�� n`t |t�r|tt� |tj ���*}tt| ��|| �|j �� W d � q�1 sp0 Y nt d��d S )Nz1Cgroup array key must be either FD or cgroup path) r� rB r r� r� r� �strr1 r� �open�O_RDONLYr/ r� )r� r� r� �fr r0 r6 r� � s :zCgroupArray.__setitem__r0 r0 r0 r r6 r� � s r� c s^ e Zd Z� fdd�Zdd� Z� fdd�Zdd� Zdd d �Zdd� Zddd�Z ddd�Z � Z S )r| c s& t t| �j|i |�� i | _d | _d S r� )r r| r� � _open_key_fds� _event_classr r r0 r6 r� � s zPerfEventArray.__init__c C s" t | j�� �}|D ] }| |= qd S r� )r� r< r� )r� r� r� r0 r0 r6 r5 � s zPerfEventArray.__del__c sx || j vrd S tt| ��|� t| �|f}|| jjv r\t�| jj| � | jj|= | j |= nt� | j | � | j |= d S r� ) r< r r| r� �idrd � perf_buffersr Zperf_reader_freer� Zbpf_close_perf_event_fd)r� r� Zkey_idr r0 r6 r� � s zPerfEventArray.__delitem__c C s* | j dkrt| �| _ t�|t�| j ��jS )a event(data) When perf buffers are opened to receive custom perf event, the underlying event data struct which is defined in C in the BPF program can be deduced via this function. This avoids redundant definitions in Python. N�r= rs r_ �castZPOINTER�contents�r� r? r0 r0 r6 �event� s zPerfEventArray.eventr Nr c C s: ||d @ dkrt d��t� D ]}| �|||||� q dS )az open_perf_buffers(callback) Opens a set of per-cpu ring buffer to receive custom perf event data from the bpf program. The callback will be invoked for each event submitted from the kernel, up to millions per second. Use page_cnt to change the size of the per-cpu ring buffer. The value must be a power of two and defaults to 8. r r z+Perf buffer page_cnt must be a power of twoN)r� r �_open_perf_buffer)r� �callback�page_cnt�lost_cb� wakeup_eventsr4 r0 r0 r6 �open_perf_buffer� s z PerfEventArray.open_perf_bufferc s� � �fdd�}�fdd�}t |�}�r.t|�n t�d t�} t� } d| _�| _|| _t� || d |t� | ��} | svt d��t� | �} | � | �| | ���< | | jjt| ��f< || f| j�< d| j�< d S )Nc sR z� �||� W n< t yL } z$|jtjkr4t� n|�W Y d }~n d }~0 0 d S r� ��IOErrorr� �EPIPErl )r� r? �size�e)rF �cpur0 r6 �raw_cb_� s z1PerfEventArray._open_perf_buffer.<locals>.raw_cb_c sN z � |� W n< t yH } z$|jtjkr0t� n|�W Y d }~n d }~0 0 d S r� rK )r� ZlostrO )rH r0 r6 �lost_cb_� s z2PerfEventArray._open_perf_buffer.<locals>.lost_cb_r. zCould not open perf buffer)r r r_ rA r �pidrP rI r Zbpf_open_perf_buffer_optsr� r� Zperf_reader_fdr� r� rd r? r> r� r< ) r� rP rF rG rH rI rQ rR �fnZlost_fnZopts�readerr/ r0 )rF rP rH r6 rE � s z PerfEventArray._open_perf_bufferr. c C sB t �||||�}|dk r td��| �|�| | �|�< || j|< d S )Nr zbpf_open_perf_event failed)r Zbpf_open_perf_eventr� r� r� r< )r� rP �typ�configrS r/ r0 r0 r6 �_open_perf_event� s z PerfEventArray._open_perf_eventc C s t � D ]}| �||||� qdS )z�open_perf_event(typ, config) Configures the table such that calls from the bpf program to table.perf_read(CUR_CPU_IDENTIFIER) will return the hardware counter denoted by event ev on the local cpu. N)r rX )r� rV rW rS r4 r0 r0 r6 �open_perf_event s z PerfEventArray.open_perf_event)r Nr )r. )r. ) r r r r� r5 r� rD rJ rE rX rY r& r0 r0 r r6 r| � s " r| c sT e Zd Z� fdd�Z� fdd�Zdd� Z� fdd�Zd d � Zd d � Zd d� Z � Z S )r~ c s� |� dd �| _tt| �j|i |�� | j| _tt� �| _ t � | j�d | _ | j dkrd| j| j | _n@| jt j kr�t j| j | _n$| jt jkr�t j| j | _ntd��d S �N�reducerr r z Leaf must be aligned to 8 bytes)�popr[ r r~ r� r� �sLeafrA r � total_cpur_ r� � alignmentra �c_uint64r` �c_int64r r r r0 r6 r� s zPerCpuHash.__init__c sP t t| ��|�}| jdkr |}n,| j| j � }td| j�D ]}|| ||< q:|S r� )r r~ r� r_ r] r^ r@ �r� r� �result�retr4 r r0 r6 �getvalue$ s zPerCpuHash.getvaluec C s& | j rt| j | �|��S | �|�S d S r� �r[ r re r� r0 r0 r6 r� . s zPerCpuHash.__getitem__c s t t| ��||� d S r� )r r~ r� r* r r0 r6 r� 4 s zPerCpuHash.__setitem__c C s, t | �� tj�rtd��| �t| �|���S �Nz6Leaf must be an integer type for default sum functions�r� r� r_ rn r r] �sumre r� r0 r0 r6 ri 7 s zPerCpuHash.sumc C s, t | �� tj�rtd��| �t| �|���S �Nz6Leaf must be an integer type for default max functions�r� r� r_ rn r r] �maxre r� r0 r0 r6 rl < s zPerCpuHash.maxc C s | � |�}|j| j S r� �ri r� r^ �r� r� rc r0 r0 r6 �averageA s zPerCpuHash.average) r r r r� re r� r� ri rl ro r& r0 r0 r r6 r~ s r~ c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� F s zLruPerCpuHash.__init__r' r0 r0 r r6 r� E s r� c s\ e Zd Z� fdd�Z� fdd�Zdd� Z� fdd�Zd d � Zd d � Zd d� Z dd� Z � Z S )r� c s� |� dd �| _tt| �j|i |�� | j| _tt� �| _ t � | j�d | _ | j dkrd| j| j | _n@| jt j kr�t j| j | _n$| jt jkr�t j| j | _ntd��d S rZ )r\ r[ r r� r� r� r] rA r r^ r_ r� r_ ra r` r` ra r r r r0 r6 r� J s zPerCpuArray.__init__c sP t t| ��|�}| jdkr |}n,| j| j � }td| j�D ]}|| ||< q:|S r� )r r� r� r_ r] r^ r@ rb r r0 r6 re \ s zPerCpuArray.getvaluec C s& | j rt| j | �|��S | �|�S d S r� rf r� r0 r0 r6 r� f s zPerCpuArray.__getitem__c s t t| ��||� d S r� )r r� r� r* r r0 r6 r� l s zPerCpuArray.__setitem__c C s | � |� d S r� r. r� r0 r0 r6 r� o s zPerCpuArray.__delitem__c C s, t | �� tj�rtd��| �t| �|���S rg rh r� r0 r0 r6 ri s s zPerCpuArray.sumc C s, t | �� tj�rtd��| �t| �|���S rj rk r� r0 r0 r6 rl x s zPerCpuArray.maxc C s | � |�}|j| j S r� rm rn r0 r0 r6 ro } s zPerCpuArray.average) r r r r� re r� r� r� ri rl ro r& r0 r0 r r6 r� I s r� c s$ e Zd Z� fdd�Zdd� Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zLpmTrie.__init__c C s t �d S r� )�NotImplementedErrorr� r0 r0 r6 r$ � s zLpmTrie.__len__r% r0 r0 r r6 r� � s r� c sZ e Zd ZdZdZdZdZdZ� fdd�ZG dd � d e �Z dd d �Z d d� Z dd� Z � ZS )r� � rG r r r c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zStackTrace.__init__c @ s. e Zd Zd dd�Zdd� Zdd� Zdd � ZdS ) zStackTrace.StackWalkerNc C s || _ d| _|| _|| _d S r, )�stack�n�resolver� )r� rr r� rt r0 r0 r6 r� � s z StackTrace.StackWalker.__init__c C s | S r� r0 r� r0 r0 r6 r� � s z StackTrace.StackWalker.__iter__c C s | � � S r� r� r� r0 r0 r6 r � s z StackTrace.StackWalker.__next__c C s� | j d7 _ | j tjkr t� �| jtj@ rZ| jj| j }|jtj ksR|jtj krht� �n| jj | j }|dkr�t � � �d�r�| j dkr�| j dkr�t� �| jr�| �|�S |S )Nr r Zppcr )rs r� � MAX_DEPTHr r� �BPF_F_STACK_BUILD_IDrr Ztrace�status�BPF_STACK_BUILD_ID_IP�BPF_STACK_BUILD_ID_EMPTY�ip�platform�machine� startswithrt )r� �addrr0 r0 r6 r� � s �*zStackTrace.StackWalker.next)Nr r0 r0 r0 r6 � StackWalker� s r Nc C s t �| | �|� | j|�S r� )r� r r� r� )r� Zstack_idrt r0 r0 r6 �walk� s zStackTrace.walkc C s d}| D ] }|d7 }q|S r" r0 r# r0 r0 r6 r$ � s zStackTrace.__len__c C s d S r� r0 r� r0 r0 r6 r� � s zStackTrace.clear)N)r r r ru rv ry ZBPF_STACK_BUILD_ID_VALIDrx r� r r r� r$ r� r& r0 r0 r r6 r� � s r� c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zDevMap.__init__r' r0 r0 r r6 r� � s r� c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zCpuMap.__init__r' r0 r0 r r6 r� � s r� c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zXskMap.__init__r' r0 r0 r r6 r� � s r� c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zMapInMapArray.__init__r' r0 r0 r r6 r� � s r� c s e Zd Z� fdd�Z� ZS )r� c s t t| �j|i |�� d S r� )r r� r� r r r0 r6 r� � s zMapInMapHash.__init__r' r0 r0 r r6 r� � s r� c sF e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d � Zdd d �Z� Z S )r� c s& t t| �j|i |�� d | _d | _d S r� )r r� r� Z_ringbufr= r r r0 r6 r� � s zRingBuf.__init__c C s d S r� r0 r� r0 r0 r6 Z __delitem� s zRingBuf.__delitemc C s d S r� r0 r� r0 r0 r6 r5 � s zRingBuf.__del__c C s dS r� r0 r� r0 r0 r6 r$ � s zRingBuf.__len__c C s* | j dkrt| �| _ t�|t�| j ��jS )a event(data) When ring buffers are opened to receive custom event, the underlying event data struct which is defined in C in the BPF program can be deduced via this function. This avoids redundant definitions in Python. Nr@ rC r0 r0 r6 rD � s z RingBuf.eventNc s4 � fdd�}t |�}| j�| j||� || jd< dS )z�open_ring_buffer(callback) Opens a ring buffer to receive custom event data from the bpf program. The callback will be invoked for each event submitted from the kernel, up to millions per second. c sp z.� | ||�}z t |�}W n d}Y n0 W n< tyj } z$|jtjkrRt� n|�W Y d }~n d }~0 0 |S r� )rB rL r� rM rl )�ctxr? rN rd rO �rF r0 r6 � ringbuf_cb_� s z-RingBuf.open_ring_buffer.<locals>.ringbuf_cb_r N)r rd Z_open_ring_bufferr� r� )r� rF r� r� rT r0 r� r6 �open_ring_buffer� s zRingBuf.open_ring_buffer)N) r r r r� Z_RingBuf__delitemr5 r$ rD r� r& r0 r0 r r6 r� � s r� c @ sR e Zd ZdZdd� Zdd� Zdd� Zdd d �Zd d � Zd d� Z dd� Z dd� Z dS )r� r c C s\ || _ || _|| _|| _t�| j j| j�| _t�| j j| j�| _ t t� | j j| j��| _ d S r� ) rd r� r� r� r rt re rV r� r� rB r� r� )r� rd r� r� r� r0 r0 r6 r� s �zQueueStack.__init__c C sN t �t �| j�d �}t�| jj| j|t |�t � |��}|dk rHt d��|j S r� r� r� r0 r0 r6 r� s �zQueueStack.leaf_sprintfc C s8 | � � }t�| jj| j|t�|��}|dk r4td��|S r� r� r� r0 r0 r6 r� ! s �zQueueStack.leaf_scanfr c C s> t �| jd t�|�|�}|dk r:t�t�� �}td| ��d S )Nr zCould not push to table: %sr� )r� r� r� r� r� r0 r0 r6 �push) s zQueueStack.pushc C s2 | � � }t�| jd t�|��}|dk r.td��|S )Nr zCould not pop from table)r� r Zbpf_lookup_and_deleter� r_ r� rU �r� r� r� r0 r0 r6 r\ / s zQueueStack.popc C s2 | � � }t�| jd t�|��}|dk r.td��|S )Nr zCould not peek tabler� r� r0 r0 r6 �peek6 s zQueueStack.peekc c s< | j }|r8z| �� V |d8 }W q ty4 Y d S 0 qd S r- )r� r\ rU )r� Zcntr0 r0 r6 r� = s zQueueStack.itervaluesc C s dd� | � � D �S )Nc S s g | ]}|�qS r0 r0 r� r0 r0 r6 r� H r� z%QueueStack.values.<locals>.<listcomp>r� r� r0 r0 r6 r� G s zQueueStack.valuesN)r ) r r r Z BPF_EXISTr� r� r� r� r\ r� r� r� r0 r0 r0 r6 r� s r� )N)N)XZ __future__r �collections.abcr � ImportError� collections�timer Zctypesr_ � functoolsr r� r� rb rj r{ Zlibbccr r r r r Zutilsr r ru rw ry r{ r} r r� r� r� r� r� r� r� r� ZBPF_MAP_TYPE_SOCKMAPr� r� ZBPF_MAP_TYPE_SOCKHASHZBPF_MAP_TYPE_CGROUP_STORAGEZ BPF_MAP_TYPE_REUSEPORT_SOCKARRAYZ"BPF_MAP_TYPE_PERCPU_CGROUP_STORAGEr� r� ZBPF_MAP_TYPE_SK_STORAGEZBPF_MAP_TYPE_DEVMAP_HASHZBPF_MAP_TYPE_STRUCT_OPSr� ZBPF_MAP_TYPE_INODE_STORAGEZBPF_MAP_TYPE_TASK_STORAGErT rI r r r7 r< r9 rR rS rW rs r� r� rv r� r( rx rz r1 r� r| r~ r� r� r� r� r� r� r� r� r� r� r� r0 r0 r0 r6 �<module> s� � & ;0 m 8 l4859
SIMPAN
[ BATAL ]