Name	Size	Mode	Actions
boolquery.cpython-36.opt-1.pyc	1848	0644	editdlrm
boolquery.cpython-36.pyc	1848	0644	editdlrm
boundsquery.cpython-36.opt-1.pyc	1709	0644	editdlrm
boundsquery.cpython-36.pyc	1709	0644	editdlrm
categoryquery.cpython-36.opt-1.pyc	1524	0644	editdlrm
categoryquery.cpython-36.pyc	1524	0644	editdlrm
commonquery.cpython-36.opt-1.pyc	1756	0644	editdlrm
commonquery.cpython-36.pyc	1756	0644	editdlrm
constraintquery.cpython-36.opt-1.pyc	4527	0644	editdlrm
constraintquery.cpython-36.pyc	4527	0644	editdlrm
defaultquery.cpython-36.opt-1.pyc	2170	0644	editdlrm
defaultquery.cpython-36.pyc	2170	0644	editdlrm
descriptors.cpython-36.opt-1.pyc	7533	0644	editdlrm
descriptors.cpython-36.pyc	7737	0644	editdlrm
devicetreeconquery.cpython-36.opt-1.pyc	2363	0644	editdlrm
devicetreeconquery.cpython-36.pyc	2363	0644	editdlrm
dta.cpython-36.opt-1.pyc	13550	0644	editdlrm
dta.cpython-36.pyc	13550	0644	editdlrm
exception.cpython-36.opt-1.pyc	8842	0644	editdlrm
exception.cpython-36.pyc	8842	0644	editdlrm
fsusequery.cpython-36.opt-1.pyc	2877	0644	editdlrm
fsusequery.cpython-36.pyc	2877	0644	editdlrm
genfsconquery.cpython-36.opt-1.pyc	3034	0644	editdlrm
genfsconquery.cpython-36.pyc	3034	0644	editdlrm
ibendportconquery.cpython-36.opt-1.pyc	3085	0644	editdlrm
ibendportconquery.cpython-36.pyc	3085	0644	editdlrm
ibpkeyconquery.cpython-36.opt-1.pyc	4318	0644	editdlrm
ibpkeyconquery.cpython-36.pyc	4318	0644	editdlrm
infoflow.cpython-36.opt-1.pyc	11597	0644	editdlrm
infoflow.cpython-36.pyc	11597	0644	editdlrm
initsidquery.cpython-36.opt-1.pyc	2465	0644	editdlrm
initsidquery.cpython-36.pyc	2465	0644	editdlrm
iomemconquery.cpython-36.opt-1.pyc	3758	0644	editdlrm
iomemconquery.cpython-36.pyc	3758	0644	editdlrm
ioportconquery.cpython-36.opt-1.pyc	3761	0644	editdlrm
ioportconquery.cpython-36.pyc	3761	0644	editdlrm
mixins.cpython-36.opt-1.pyc	6462	0644	editdlrm
mixins.cpython-36.pyc	6462	0644	editdlrm
mlsrulequery.cpython-36.opt-1.pyc	3025	0644	editdlrm
mlsrulequery.cpython-36.pyc	3025	0644	editdlrm
netifconquery.cpython-36.opt-1.pyc	2538	0644	editdlrm
netifconquery.cpython-36.pyc	2538	0644	editdlrm
nodeconquery.cpython-36.opt-1.pyc	3614	0644	editdlrm
nodeconquery.cpython-36.pyc	3614	0644	editdlrm
objclassquery.cpython-36.opt-1.pyc	2935	0644	editdlrm
objclassquery.cpython-36.pyc	2935	0644	editdlrm
pcideviceconquery.cpython-36.opt-1.pyc	2716	0644	editdlrm
pcideviceconquery.cpython-36.pyc	2716	0644	editdlrm
permmap.cpython-36.opt-1.pyc	11948	0644	editdlrm
permmap.cpython-36.pyc	12190	0644	editdlrm
pirqconquery.cpython-36.opt-1.pyc	2643	0644	editdlrm
pirqconquery.cpython-36.pyc	2643	0644	editdlrm
polcapquery.cpython-36.opt-1.pyc	1316	0644	editdlrm
polcapquery.cpython-36.pyc	1316	0644	editdlrm
portconquery.cpython-36.opt-1.pyc	4309	0644	editdlrm
portconquery.cpython-36.pyc	4309	0644	editdlrm
query.cpython-36.opt-1.pyc	1003	0644	editdlrm
query.cpython-36.pyc	1003	0644	editdlrm
rbacrulequery.cpython-36.opt-1.pyc	3835	0644	editdlrm
rbacrulequery.cpython-36.pyc	3835	0644	editdlrm
rolequery.cpython-36.opt-1.pyc	1988	0644	editdlrm
rolequery.cpython-36.pyc	1988	0644	editdlrm
sensitivityquery.cpython-36.opt-1.pyc	2166	0644	editdlrm
sensitivityquery.cpython-36.pyc	2166	0644	editdlrm
terulequery.cpython-36.opt-1.pyc	6280	0644	editdlrm
terulequery.cpython-36.pyc	6280	0644	editdlrm
typeattrquery.cpython-36.opt-1.pyc	2141	0644	editdlrm
typeattrquery.cpython-36.pyc	2141	0644	editdlrm
typequery.cpython-36.opt-1.pyc	2873	0644	editdlrm
typequery.cpython-36.pyc	2873	0644	editdlrm
userquery.cpython-36.opt-1.pyc	3723	0644	editdlrm
userquery.cpython-36.pyc	3723	0644	editdlrm
util.cpython-36.opt-1.pyc	4701	0644	editdlrm
util.cpython-36.pyc	4701	0644	editdlrm
__init__.cpython-36.opt-1.pyc	2392	0644	editdlrm
__init__.cpython-36.pyc	2392	0644	editdlrm

3 O+e�U� @s�dd
lZdd
l
Z
ddlmZmZ
ddlmZ
dd
lZddl m Z mZ
ddlm Z mZ
ddlmZ
dg
Zed d ddd dddg�Zed ddddg�ZGdd�d�ZGdd�d�Zd
S)�N)�defaultdict� namedtuple)
�suppress)� NetworkXError�NetworkXNoPath�
)�EdgeAttrDict�EdgeAttrList)
� TERuletype�DomainTransitionAnalysis�step�source�target� transition�entrypoints�setexec� dyntransition� setcurrent�name� entrypoint�execute�type_transitionc@s�eZ
dZd
Zd!dd�
Zedd��
Zejdd��
Zed d ��
Zejdd ��
Zdd �Z d"dd�
Z dd�Zdd�Zdd�Z edd��
Zdd�Zdd�Zdd�Zdd �ZdS)#rzDomain transition analysis.FNcCs>tj
t�
|_|
|_||_||_d
|_d
|_t j �|_d|_dS)zD Parameter: policy The policy to analyze. TN) �loggingZ getLogger�__name__�log�policy�exclude�reverse�rebuildgraph�rebuildsubgraph�nxZDiGraph�
G�subG)�selfrrr�r$�/usr/lib64/python3.6/dta.py�__init__6s





z!DomainTransitionAnalysis.__init__c


Cs|jS)
N)
�_reverse)
r#r$r$r%rEsz DomainTransitionAnalysis.reversecCst|
�
|_
d
|_dS)NT)�boolr'r)r#� directionr$r$r%rIs
c


Cs|jS)
N)
�_exclude)
r#r$r$r%rNsz DomainTransitionAnalysis.excludecs*|
r�f
d
d�|
D�
�_ng�_d�_
dS)Nc
sg|]}
�jj
|
�
�qSr$)r�lookup_type)�.0�
t)
r#r$r%� Usz4DomainTransitionAnalysis.exclude..T)r*r)r#�typesr$)
r#r%rRs
ccsj|jj
|
�
}|jj
|�
}|jr&|j�
|jjd
j||��

tt�
�
|j t j|j||��
V
WdQRXdS)a�
Generator which yields one shortest domain transition path between the source and target types (there may be more). Parameters: source The source type. target The target type. Yield: generator(steps) steps A generator that returns the tuple of source, target, and rules for each domain transition. z8Generating one domain transition path from {0} to {1}...N) rr+r�_build_subgraphr�info�formatrr�)_DomainTransitionAnalysis__generate_stepsr � shortest_pathr")r#r r�
sr-r$r$r%r4[s

 z&DomainTransitionAnalysis.shortest_path�ccs�|d
krtd�
�
|j
j|
�
}|j
j|�
}|jr6|j�
|jjdj|||��

tt �
�.
x&t j|j|||�D]}|j |�
V
qjWWdQRXdS)a�
Generator which yields all domain transition paths between the source and target up to the specified maximum path length. Parameters: source The source type. target The target type. maxlen Maximum length of paths. Yield: generator(steps) steps A generator that returns the tuple of source, target, and rules for each domain transition. rz%Maximum path length must be positive.zIGenerating all domain transition paths from {0} to {1}, max length {2}...N)� ValueErrorrr+rr0rr1r2rrr Zall_simple_pathsr"r3)r#r r�maxlenr5r-�pathr$r$r%� all_pathsxs



 
z"DomainTransitionAnalysis.all_pathsccsx|jj
|
�
}|jj
|�
}|jr&|j�
|jjd
j||��

tt�
�,
x$t j |j||�D]}|j|�
V
qVWWdQRXdS)a�
Generator which yields all shortest domain transition paths between the source and target types. Parameters: source The source type. target The target type. Yield: generator(steps) steps A generator that returns the tuple of source, target, and rules for each domain transition. zBGenerating all shortest domain transition paths from {0} to {1}...N) rr+rr0rr1r2rrr �all_shortest_pathsr"r3)r#r rr5r-r9r$r$r%r;�s


 
z+DomainTransitionAnalysis.all_shortest_pathsccs�|jj
|
�
}|jr|j�
|jjd
j||jr0dnd��

tt �
�n
xf|j j|�
D]V\}}t|j ||�}|jrx||}}n ||}}t |||j|j|�
|j|j|j�V
qPWWdQRXdS)aM
Generator which yields all domain transitions out of a specified source type. Parameters: type_ The starting type. Yield: generator(steps) steps A generator that returns the tuple of source, target, and rules for each domain transition. z)Generating all domain transitions {1} {0}zin tozout fromN)rr+rr0rr1r2rrrr"Z out_edges�Edge�step_outputr�/_DomainTransitionAnalysis__generate_entrypointsrrr)r#Ztype_r5r r�edge�real_source�real_targetr$r$r%�transitions�s"

 

 




z$DomainTransitionAnalysis.transitionsc

Cs|jr|j
�
tj|j�
S)
zR Get the domain transition graph statistics. Return: str )r�_build_graphr r1r!)
r#r$r$r%� get_stats�s
z"DomainTransitionAnalysis.get_statsc

s�f
d
d��jD�
S)a�
Creates a list of entrypoint, execute, and type_transition rules for each entrypoint. Parameter: data The dictionary of entrypoints. Return: list of tuple(type, entry, exec, trans) type The entrypoint type. entry The list of entrypoint rules. exec The list of execute rules. trans The list of type_transition rules. c
s,g|]$}
t|
�j
|
�j|
�j|
��qSr$)�entrypoint_outputrrr)r,�
e)
r?r$r%r.
s
zCDomainTransitionAnalysis.__generate_entrypoints..)
r)
r?r$)
r?r%Z__generate_entrypoints�s
z/DomainTransitionAnalysis.__generate_entrypointsc cs~xxtd
t
|
�
�D]f}|
|d
}|
|}t|j||�}|jrH||}}n ||}}t|||j|j|�
|j|j |j �V
qWdS)a Generator which yields the source, target, and associated rules for each domain transition. Parameter: path A list of graph node names representing an information flow path. Yield: tuple(source, target, transition, entrypoints, setexec, dyntransition, setcurrent) source The source type for this step of the domain transition. target The target type for this step of the domain transition. transition The list of transition rules. entrypoints Generator which yields entrypoint-related rules. setexec The list of setexec rules. dyntranstion The list of dynamic transition rules. setcurrent The list of setcurrent rules. rN)�range�lenr<r"rr=rr>rrr)r#r9r5r rr?r@rAr$r$r%Z__generate_steps
s



 




z)DomainTransitionAnalysis.__generate_stepsc
Cs�|jj
�
d
j|j�
|j_|jjdj|j�
�

tt�
}
tt�
}tdd��
}tdd��
}tdd��
}�x4|jj �D�]$}|j tjk�r8|j dkr�qp|j}|j dk�
r�d |kr�xJtj|jj�|jj��D].\}} || kr�t|j|| d d�} | jj|�

q�Wd|k�
rPxNtj|jj�|jj��D]2\}} || k�
rt|j|| d d�}|jj|�

�
qWd |k�
r~x"|jj�D]}|
|j|�

�
qfWd|k�r6x�|jj�D]}||j|�

�
q�Wn�d|k�
r�x8tj|jj�|jj��D]\}} ||| j|�

�
q�Wd|k�r�x�tj|jj�|jj��D]\}} ||| j|�

�qWqp|j tjkrp|j dk�rRqp|j}xn
sz7DomainTransitionAnalysis._build_graph..cSstt
�
S)
N)rrIr$r$r$r%rJo
scSstd
d��
S)NcSstt
�
S)
N)rrIr$r$r$r%rJr
szIDomainTransitionAnalysis._build_graph....)
rr$r$r$r%rJr
s�process�filerT)
�createrrrrrFz+Completed building domain transition graph.z$Graph stats: nodes: {0}, edges: {1}.)rKrL)*r!�clearr2rrrr1rrIZterulesZruletyper ZallowZtclass�perms� itertools�productr �expandrr<r�appendrr�default�edges�set�keys�intersectionrrr�extendr�remove_edges_fromrr�debugr �number_of_nodes�number_of_edges)r#rrrrZ type_transZrulerOr5r-r?rF�
dZinvalid_edgeZclear_transitionZclear_dyntransitionZ invalid_transZinvalid_dyntrans�entryZexe�match�
mr$r$r%rCa
s�








"


"










"



"







 

$




















z%DomainTransitionAnalysis._build_graphc
Cs�g}
x�|jj
�D]�\}}t|j||�}t|j�
}|j|j�

|sBqx8|D]0}|j|=|j|=tt �
�
|j |=WdQRXqHW|jr|jr|
j|�

qW|jj |
�

dS)
N)r"rUr<rVr�intersection_updaterrr�KeyErrorrrrSrZ)r#Z invalid_edgesr rr?rrFr$r$r%Z__remove_excluded_entrypoints�
s




 


z6DomainTransitionAnalysis.__remove_excluded_entrypointsc

Cs�|jr|j
�
|jjd
�

|jjdj|j�
�

|jjdj|j�
�

|jrZ|jjdd�
|_ n|jj �|_ |jr�|j j|j�

|j�
d|_ |jjd�

|jjdjtj|j �
tj|j �
��

dS) Nz$Building domain transition subgraph.z Excluding {0}zReverse {0}T)
�copyFz.Completed building domain transition subgraph.z'Subgraph stats: nodes: {0}, edges: {1}.)rrCrr1r[r2rrr!r"rdZremove_nodes_from�6_DomainTransitionAnalysis__remove_excluded_entrypointsrr r\r])
r#r$r$r%r0s








z(DomainTransitionAnalysis._build_subgraph)FN)
r6)r� __module__�__qualname__�__doc__r&�propertyr�setterrr4r:r;rBrD�staticmethodr>r3rCrer0r$r$r$r%r2s"   $'^c@sbeZ
dZd
Zed�
Zed�
Zed�
Zed�
Ze d�
Z e d�
Ze d�
Zdd d�
Z dd �Zdd�ZdS)r<aS
A graph edge. Also used for returning domain transition steps. Parameters: graph The NetworkX graph. source The source type of the edge. target The target tyep of the edge. Keyword Parameters: create (T/F) create the edge if it does not exist. The default is False. rrrrrrrFcCsj|
|_||_
||_|jj||�sf|s.td
�
�
n8|jj||�
d|_d|_d|_d|_ d|_ d|_d|_dS)NzEdge does not exist in graph) r!r rZhas_edger7Zadd_edgerrrrrrr)r#Zgraphr rrMr$r$r%r&Es











z Edge.__init__cs4t|
t
�r&�f
d
d�t|
jd�
�D�
S�j|
�
SdS)Nc
sg|]}
�j|
�
�qSr$)
�_index_to_item)r,�
i)
r#r$r%r.[sz$Edge.__getitem__..r6)� isinstance�slicerG�indicesrl)r#�keyr$)
r#r%�__getitem__Ws
zEdge.__getitem__cCs.|
d
kr|jS|
dkr|j
Stdj|
�
�
�
dS)z'Return source or target based on index.r
rz,Invalid index (edges only have 2 items): {0}N)r r� IndexErrorr2)r#�indexr$r$r%rl_s 


zEdge._index_to_itemN)
F)rrfrgrhr rrrrrrrrr&rrrlr$r$r$r%r<.s 





 r<)rPr�collectionsrr� contextlibrZnetworkxr Znetworkx.exceptionrrZdescriptorsrr Z policyrepr �__all__r=rErr<r$r$r$r%�s2