Google
Edit File: infoflow.cpython-39.pyc
a q�qe)> � @ s� d dl Z d dlZd dlmZ d dlmZmZmZmZm Z m Z z d dl Z d dl mZmZmZ W n" ey~ e�e��d� Y n0 ddlmZmZ ddlmZ dd lmZm Z m Z m Z d gZ ed Z G d d � d �Z!G d d � d �Z"dS )� N)�suppress)�cast�Iterable�List�Mapping�Optional�Union)� NetworkXError�NetworkXNoPath� NodeNotFoundzNetworkX failed to import.� )�EdgeAttrIntMax� EdgeAttrList)� PermissionMap)�AVRule� SELinuxPolicy� TERuletype�Type�InfoFlowAnalysis� InfoFlowStepc @ s� e Zd ZU dZee ed< eed< eed< d.e eee e e ee f e ee ef dd�dd �Zeed �d d ��Zejedd �dd ��Zeed �dd��Zejedd�dd��Zeee d �dd��Zeje e e ee f dd�dd��Zeee e d�dd�Zd/e ee f e ee f ee e d�d d �Ze ee f e ee f e e d�d d �Zd0e ee f ee d! d"�d#d$�Ze d �d%d&�Zee ed'�d(d)�Z dd �d*d+�Z dd �d,d-�Z dS )1r zInformation flow analysis.�_exclude� _min_weight� _perm_mapr N)�policy�perm_map� min_weight�exclude�booleans�returnc C s� t �t�| _|| _|| _|| _|| _|| _d| _ d| _ zt � � | _ | j �� | _W n, ty| | j�d� | j�d� � Y n0 dS )a� Parameters: policy The policy to analyze. perm_map The permission map or path to the permission map file. minweight The minimum permission weight to include in the analysis. (default is 1) exclude The types excluded from the information flow analysis. (default is none) booleans If None, all rules will be added to the analysis (default). otherwise it should be set to a dict with keys corresponding to boolean names and values of True/False. Any unspecified booleans will use the policy's default values. TzKNetworkX is not available. This is requried for Information Flow Analysis.z2This is typically in the python3-networkx package.N)�logging� getLogger�__name__�logr r r r r � rebuildgraph�rebuildsubgraph�nxZDiGraph�G�copy�subG� NameErrorZcritical)�selfr r r r r � r+ �6/usr/lib64/python3.9/site-packages/setools/infoflow.py�__init__! s zInfoFlowAnalysis.__init__)r c C s | j S �N)r �r* r+ r+ r, r E s zInfoFlowAnalysis.min_weight)�weightr c C s. d| krdks n t d��|| _d| _d S )Nr � z4Min information flow weight must be an integer 1-10.T)� ValueErrorr r$ )r* r0 r+ r+ r, r I s �c C s | j S r. )r r/ r+ r+ r, r R s zInfoFlowAnalysis.perm_map)r r c C s || _ d| _d| _d S )NT)r r# r$ )r* r r+ r+ r, r V s c C s | j S r. )r r/ r+ r+ r, r \ s zInfoFlowAnalysis.exclude)�typesr c s* |r� fdd�|D �� _ ng � _ d� _d S )Nc s g | ]}� j �|��qS r+ )r � lookup_type)�.0�tr/ r+ r, � <listcomp>c � z,InfoFlowAnalysis.exclude.<locals>.<listcomp>T)r r$ )r* r3 r+ r/ r, r ` s )�source�targetr c c s� | j �|�}| j �|�}| jr&| �� | j�d�||�� ttt ��* | � t j | j ||d��V W d � n1 st0 Y dS )a Generator which yields one shortest path between the source and target types (there may be more). Parameters: source The source type. target The target type. Yield: generator(steps) steps Yield: tuple(source, target, rules) source The source type for this step of the information flow. target The target type for this step of the information flow. rules The list of rules creating this information flow step. z@Generating one shortest information flow path from {0} to {1}...)r9 r: N)r r4 r$ �_build_subgraphr" �info�formatr r r �!_InfoFlowAnalysis__generate_stepsr% � shortest_pathr( )r* r9 r: �sr6 r+ r+ r, r? i s � z InfoFlowAnalysis.shortest_path� )r9 r: �maxlenr c c s� |dk rt d��| j�|�}| j�|�}| jr6| �� | j�d�|||�� tt t ��4 t � | j |||�D ]}| �|�V qjW d � n1 s�0 Y dS )a� Generator which yields all paths between the source and target up to the specified maximum path length. This algorithm tends to get very expensive above 3-5 steps, depending on the policy complexity. Parameters: source The source type. target The target type. maxlen Maximum length of paths. Yield: generator(steps) steps Yield: tuple(source, target, rules) source The source type for this step of the information flow. target The target type for this step of the information flow. rules The list of rules creating this information flow step. r z%Maximum path length must be positive.zHGenerating all information flow paths from {0} to {1}, max length {2}...N)r2 r r4 r$ r; r" r< r= r r r r% Zall_simple_pathsr( r> )r* r9 r: rB r@ r6 �pathr+ r+ r, � all_paths� s � zInfoFlowAnalysis.all_pathsc c s� | j �|�}| j �|�}| jr&| �� | j�d�||�� ttt ��2 t � | j ||�D ]}| � |�V qVW d � n1 s|0 Y dS )a� Generator which yields all shortest paths between the source and target types. Parameters: source The source type. target The target type. Yield: generator(steps) steps Yield: tuple(source, target, rules) source The source type for this step of the information flow. target The target type for this step of the information flow. rules The list of rules creating this information flow step. zAGenerating all shortest information flow paths from {0} to {1}...N)r r4 r$ r; r" r< r= r r r r% �all_shortest_pathsr( r> )r* r9 r: r@ r6 rC r+ r+ r, rE � s � z#InfoFlowAnalysis.all_shortest_pathsTr )�type_�outr c c s� | j �|�}| jr| �� | j�d�|r,dnd|�� tt��L |rR| j � |�}n | j � |�}|D ]\}}t | j ||�V qbW d � n1 s�0 Y dS )a( Generator which yields all information flows in/out of a specified source type. Parameters: source The starting type. Keyword Parameters: out If true, information flows out of the type will be returned. If false, information flows in to the type will be returned. Default is true. Yield: generator(steps) steps A generator that returns the tuple of source, target, and rules for each information flow. z(Generating all information flows {0} {1}zout ofZintoN) r r4 r$ r; r" r< r= r r r( Z out_edgesZin_edgesr )r* rF rG r@ Zflowsr9 r: r+ r+ r, � infoflows� s � zInfoFlowAnalysis.infoflowsc C s. | j r| �� dt�| j�� dt�| j�� �S )zQ Get the information flow graph statistics. Return: str z Graph nodes: z Graph edges: )r# � _build_graphr% �number_of_nodesr& �number_of_edgesr/ r+ r+ r, � get_stats� s �zInfoFlowAnalysis.get_stats)rC r c c s4 t dt|��D ] }t| j||d || �V qdS )a� Generator which returns the source, target, and associated rules for each information flow step. Parameter: path A list of graph node names representing an information flow path. Yield: tuple(source, target, rules) source The source type for this step of the information flow. target The target type for this step of the information flow. rules The list of rules creating this information flow step. r N)�range�lenr r( )r* rC r@ r+ r+ r, Z__generate_steps s z!InfoFlowAnalysis.__generate_stepsc C s* | j �� d�| j�| j _| j�| j� | j�d�| j�� | j� � D ]�}|j t j krXqF| j� tt|��\}}t�|j�� |j�� �D ]`\}}||kr�|r�t| j ||dd�}|j�|� ||_|r�t| j ||dd�}|j�|� ||_q�qFd| _d| _| j�d� | j�d�t � | j �t � | j ��� d S )Nz Information flow graph for {0}.z+Building information flow graph from {0}...T)�createFz*Completed building information flow graph.z$Graph stats: nodes: {0}, edges: {1}.) r& �clearr= r �namer Z map_policyr" r< ZterulesZruletyper ZallowZ rule_weightr r � itertools�productr9 �expandr: r �rules�appendr0 r# r$ �debugr% rJ rK )r* �ruleZrweightZwweightr@ r6 �edger+ r+ r, rI . s2 �z InfoFlowAnalysis._build_graphc s� � j r� �� � j�d� � j�d�� j�� � j�d�� j�� � j�d�� jd u�� � fdd�� j � � D �}� j � |�� � � _ � jdkr�g }� j �� D ],\}}t� j ||�}|j� jk r�|�|� q�� j �|� � jd u�r�g }� j �� D ]�\}}t� j ||�}g }|jD ]$}|jf i � j���s|�|� �qg }|D ]&}||v�r>|j�|� |�|� �q>|js�|�|� q� j �|� d� _� j�d � � j�d �t�� j �t�� j ��� d S ) Nz%Building information flow subgraph...zExcluding {0!r}zMin weight {0}z(Exclude disabled conditional policy: {0}c s g | ]}|� j vr|�qS r+ )r )r5 �nr/ r+ r, r7 \ r8 z4InfoFlowAnalysis._build_subgraph.<locals>.<listcomp>r Fz-Completed building information flow subgraph.z'Subgraph stats: nodes: {0}, edges: {1}.)r# rI r" r< rW r= r r r r& �nodesZsubgraphr' r( Zedgesr r0 rV Zremove_edges_fromrU Zenabled�remover$ r% rJ rK ) r* r[ Z delete_listr@ r6 rY Z rule_listrX Z deleted_rulesr+ r/ r, r; Q sN � �z InfoFlowAnalysis._build_subgraph)r NN)rA )T) r! � __module__� __qualname__�__doc__r r �__annotations__�intr r r r r �strr �boolr- �propertyr �setterr r � InfoFlowPathr? rD rE rH rL r> rI r; r+ r+ r+ r, r sF �� $""� )� # ' #c @ sF e Zd ZdZed�Zed�Zd eee dd�dd�Z d d � Z d d � Z dS )r aR A graph edge. Also used for returning information flow steps. Parameters: graph The NetworkX graph. source The source type of the edge. target The target type of the edge. Keyword Parameters: create (T/F) create the edge if it does not exist. The default is False. rU ZcapacityFN)r9 r: rO r c C sP || _ || _|| _| j �||�sL|rD| j j||dd� d | _d | _ntd��d S )Nr )r0 z$InfoFlowStep does not exist in graph)r& r9 r: Zhas_edgeZadd_edgerU r0 r2 )r* Zgraphr9 r: rO r+ r+ r, r- � s zInfoFlowStep.__init__c s4 t |t�r&� fdd�t|�d�� D �S � �|�S d S )Nc s g | ]}� � |��qS r+ )�_index_to_item)r5 �ir/ r+ r, r7 � r8 z,InfoFlowStep.__getitem__.<locals>.<listcomp>rA )� isinstance�slicerM �indicesrg )r* �keyr+ r/ r, � __getitem__� s zInfoFlowStep.__getitem__c C s. |dkr| j S |dkr | jS td�|���dS )z'Return source or target based on index.r r z,Invalid index (edges only have 2 items): {0}N)r9 r: � IndexErrorr= )r* �indexr+ r+ r, rg � s zInfoFlowStep._index_to_item)F) r! r] r^ r_ r rU r r0 r rc r- rm rg r+ r+ r+ r, r � s )#rR r � contextlibr �typingr r r r r r Znetworkxr% Znetworkx.exceptionr r r � ImportErrorr r! rW Z descriptorsr r Zpermmapr Z policyrepr r r r �__all__rf r r r+ r+ r+ r, �<module> s" r