+ ,iGcsaR t)0t^RIt^RIt^RIt^RIHtHt^RIHt^RI H t H t ^RI t ^RI t^RIHtHtHt^RIHtHtHtHtHt^RIH t H!t!H"t"]R ,t#Rt$]^k!R R ]PJ4t&] !R R ]PN44t(R# ]d9t]P*!]4P/]P0 R24RtALRtAii;i)iN)IterableMapping)suppress) dataclassInitVar) NetworkXErrorNetworkXNoPath NodeNotFoundz failed to import.) exceptionmixinspermmap policyrepquery)CriteriaDescriptorEdgeAttrIntMax EdgeAttrList InfoFlowStepInfoFlowAnalysiscs(aa]tRt^toRt!RR]P 4t]P]P3t ]P]P3t ]]P ,!RR7t]]P ,!RR7t]PtR^RRR RR ]PR ^R RR R/V3RlV3Rlllt]V3RlRl4t]P.V3RlRl4t]V3RlRl4t]P.V3RlRl4t]V3RlRl4t]P.V3RlRl4t]V3RlRl4t]P.V3RlRl4tV3R lR!ltV3R"lR#ltV3R$lR%ltV3R&lR'ltV3R(lR)ltV3R*lR+lt V3R,lt!R-t"Vt#V;t$#).ra  Information flow analysis. Parameters: policy The policy to analyze. perm_map The permission map or path to the permission map file. Keyword Parameters source The source type of the analysis. target The target type of the analysis. mode The analysis mode (see InfoFlowAnalysisMode) min_weight 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. cs*]tRt^4tRtRtRtRtRtRt R#)InfoFlowAnalysis.ModezInformation flow analysis modeszAll shortest pathszAll paths up tozFlows out of the source type.zFlows into the target type.N) __name__ __module__ __qualname____firstlineno____doc__ ShortestPathsAllPathsFlowsOutFlowsIn__static_attributes__r7/usr/lib64/python3.14/site-packages/setools/infoflow.pyModer4s-, $2/rr lookup_type)Zlookup_function min_weightsourceNtargetmode depth_limitexcludebooleanscsT<V^8dQhRS[PRS[PRS[RS[P S[,R,RS[P S[,R,RS[RS[R,R S[S[P S[,,R,R S[ S[S[ 3,R,R R/ #) policyperm_mapr"r#Nr$r%r&r'r(return) r Z SELinuxPolicyr PermissionMapintTypestrr rrboolformat __classdict__"r __annotate__InfoFlowAnalysis.__annotate__Esy66'BWBW "#-4##-4  "Dj  #9>>C#784? #39-4AErc sX<\S V`WW4WVVWR7 VVVRVnRVn\P !4VnVP P4VnR# \d9TPPR4TPPR4hi;i))r+r"r#r$r%r&r'r(TzKNetworkX is not available. This is required for Information Flow Analysis.z2This is typically in the python3-networkx package.N) super__init__ rebuildgraphrebuildsubgraphnxDiGraphGcopysubGZ NameErrorlogZcritical) selfr*r+r"r#r$r%r&r'r( __class__s """$$$$$$$rr9ZInfoFlowAnalysis.__init__Es z &{!(  =    # ZZ\DF DI  HH  H I HH  R S   s 9A&&AB)cs.<V^8dQhRS[R,/#r)r,Nr.r2r5rr6r7cs!!S4Z!rcVP#N) _depth_limitrB&rr&InfoFlowAnalysis.depth_limitbs   rcs2<V^8dQhRS[R,RR/#)r)valueNr,rEr2r5rr6r7gs""t""rcs>VeV^8d \R4hWnR#)Nz,Information flow max depth must be positive.) ValueErrorrH)rBrL&&rr&rKfs  KL L!rc <V^8dQhRS[/#r)r,rEr2r5rr6r7os  C rcrFrG) _min_weightrIrJrr"InfoFlowAnalysis.min_weightnsrcs$<V^8dQhRS[RR/#)r)weightr,NrEr2r5rr6r7ss$$$$rcsX^Tu;8:d^ 8:gM\R4hWnRVnR#)z4Min information flow weight must be an integer 1-10.TN)rMrQr;)rBrSrNrr"rRrs1F b FH H"#rcs4<V^8dQhRS[P/#rPr r-r2r5rr6r7|s'//rcrFrG) _perm_maprIrJrr+InfoFlowAnalysis.perm_map{s ~~rcs8<V^8dQhRS[PRR/#)r)r+r,NrUr2r5rr6r7s!$$!6!6$4$rcs.WnRVnRVnR#TN)rVr:r;)rBr+rNrr+rWs! #rcsD<V^8dQhRS[S[P,/#rP)listr r/r2r5rr6r7sinn-rcrFrG)_excluderIrJrr'InfoFlowAnalysis.excludes }}rcsf<V^8dQhRS[S[PS[,,R,RR/#)r)typesNr,)rr r/r0r2r5rr6r7s.$$Xinns&:;dB$t$rcsV'd1VUu.uFq PPV4NK upVnM.VnRVnR#uupirX)r*r!rZr;)rBr\ts&& rr'r[s@ W\2]W\RS;;3J3J13MW\2]DMDM# 3^s#A csN<V^8dQhRS[S[,S[R,,/#)r)r,r)r InfoFlowPathr2r5rr6r7s&9L9L,/(>2JJ9Lrc #s a"SP'dSP4SPPRSP 24SPP RSP : 24SPP RSP: 24SPP RSP: RSP: 24\\\\4;_uu_4SP;\PP 8Xd\#SP SP34'g \%R4hSPPRSP RSP R24\&P(!SP*SP SP4F8pV3R l\&P,P.P1V44xK: EM;\PP28Xd\#SP SP34'g \%R4hSPPR SP RSP R SP R24\&P4!SP*SP SPSPR 7F8pV3R l\&P,P.P1V44xK: EM;\PP68XdSP 'g \%R4hSPPRSP RSP 24\&P8!SP*SP SPR7Fwr#\;SP*W#4xK M\PP<8XdSP'g \%R4hSPPRSP R2RSP 24\&P8!SP*SPRSPR7Fwr2\;SP*W#4xK M\%RSP 24hRRR4R# +'giR#;i5i)z)Generating information flow results from self.source= self.target= self.mode=, self.depth_limit=*Source and target types must be specified.4Generating all shortest information flow paths from  to ...c3T<"TFwr\SPW4xK R#5irGrr@.0r#r$rB& r +InfoFlowAnalysis.results..)S5Q>6 ,DIIvFF5Q%(+Generating all information flow paths from , max length Zcutoffc3rgrGrhrirkrrlrmrnroSource type must be specified.(Generating all information flows out of , max depth r&Target type must be specified.&Generating all information flows into  max depth Treverser&Unknown analysis mode: N)r;_build_subgraphrAinfor*debugr#r$r%r&rrrrrr rallrMr<all_shortest_pathsr@utilsmiscpairwiserall_simple_pathsrZ bfs_edgesrrrBpathr#r$sf rresultsZInfoFlowAnalysis.resultss      "  A$++OP ,$++() ,$++() *$))%9(8(8':;< nlM B B))8%**88 T[[9::()UVVHHMM"X%)[[Mdkk]##GH!# 5 5diidkk ZS57XX]]5K5KD5QSS![4%**33 T[[9::()UVVHHMM"O%)[[Mdkk]C0040@0@/A#FG!# 3 3DIIt{{DKK;?;K;K!MS57XX]]5K5KD5QSS!M 4%**33;;;()IJJHHMM$LT[[MZ//3/?/?.@#BC*,,,tyy$++CGCSCS+U*499fEE+U&**22;;;()IJJHHMM$J4;;-WX"Y$.t/?/?.@"AC+-,,tyy$++W[CGCSCS+U*499fEE+U$'>tyyk%JKKaC B B Bs-C5S#8ISCSB5S S# S  S#c<V^8dQhRR/#)r)r, nx.DiGraphrr2r5rr6r7sJGJG<JGrc  s VP'dVP4VPPRVP 24VPP RVP : 24VPP RVP: 24VPP RVP: RVP: 24VP;\PP8XEd \VP VP34'g \R4hVPPRVP RVP R 24\P !VP"VP VP4pVUUu.uF4p\P$P&P)V4Fq3NK K6 ppp\P*!4pVP-V4V#;\PP.8XEd#\VP VP34'g \R4hVPPR VP RVP R VP R 24\P0!VP"VP VPVPR 7pVUUu.uF4p\P$P&P)V4Fq3NK K6 ppp\P*!4pVP-V4V#;\PP28XdVP 'g \R 4hVPPRVP RVP 24\P4!VP"VP VPR7#\PP68XdVP'g \R4hVPPRVP R2RVP 24\P4!VP"VPRVPR7p\P8!VRR7#\RVP 24huuppiuuppi \:d p\<P>!RT 24ThRp?ii;i)a Return the results of the analysis as a NetworkX directed graph. Caller has the responsibility of converting the graph to a visualization. For example, to convert to a pygraphviz graph: pgv = nx.nx_agraph.to_agraph(g.graphical_results()) pgv.layout(prog="dot") z3Generating graphical information flow results from r_r`rarbrcrdrerfrprqrrrsrtrurvrwrxryrzTr{F)r?r}z&Unable to generate graphical results: N) r;r~rArr*rr#r$r%r&rr rrrMr<rr@rrrr=Zadd_edges_fromrrrZbfs_treerr|Z ExceptionrZAnalysisException)rBZpathsrZpairedgesZoutZexs& rgraphical_resultsZ"InfoFlowAnalysis.graphical_resultss      "  KDKK=YZ ,$++() ,$++() *$))%9(8(8':;<6 G))8%**88 T[[9::()UVVHHMM"X%)[[Mdkk]##GH11$))T[[$++VE.3]ed @V@VW[@\T@\TeE]**,C&&u-J3%**33 T[[9::()UVVHHMM"O%)[[Mdkk]C0040@0@/A#FG// 4;; 7;7G7GIE.3]ed @V@VW[@\T@\TeE]**,C&&u-J3%**33;;;()IJJHHMM$LT[[MZ//3/?/?.@#BC;;tyy$++4K[K[\\%**22;;;()IJJHHMM$J4;;-WX"Y$.t/?/?.@"AC++diid262B2BDC::c66$'>tyyk%JKKS^^8 G--8=?DF G GsXCS$:S*S CS&:S *S 1S=A6S4/S$BS6%S T&TTcrOrPr0r2r5rr6r7s # #3 #rc sVP'dVP4R\P!VP4: R\P !VP4: R\ VP4: R2#)z9 Get the information flow graph statistics. Return: str znx.number_of_nodes(self.G)=z nx.number_of_edges(self.G)=z len(self.G)= )r: _build_graphr<number_of_nodesr>number_of_edgesZlenrIrJr get_statsZInfoFlowAnalysis.get_statssk        -"$$TVV,./.$$TVV,./dff+r# #rcsJ<V^8dQhRS[S[P,RS[/#)r)rr,)rYr r/r^r2r5rr6r7*s$::D$8:\:rc# s"\PPPV4Fwr#\ VP W#4xK R#5i)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. N)r<rrrrr@rs&& r_generate_stepsZ InfoFlowAnalysis._generate_steps*s7!hhmm44T:NFtyy&9 9;sA AcrrDrr2r5rr6r7Js!@!@d!@rc sVPP4RVP R2VPnVPP VP4VP PRVP R24VP PRVP: 24VPP4EFspVP\PP8wdK/VPP\P !\P"V44p\$P&!VP(P+4VP,P+44Fwr4W48wgK VP.'dE\1VPW4RR7pVP2P5V4VP.VnVP8'gKw\1VPWCRR7pVP2P5V4VP8VnK EKv RVnRVnVP PR4VP PR \>P@!VP4 R \>PB!VP4 R24R #) zInformation flow graph for .z%Building information flow graph from rfzself.perm_map=T)createFz*Completed building information flow graph.zGraph stats: nodes: , edges: N)"r>Zclearr*namer+Z map_policyrArrZterulesZruletyper Z TERuletypeZallowZ rule_weighttypingZcastZAVRule itertoolsZproductr#Zexpandr$ZwriterrulesappendrSZreadr:r;r<rr)rBrulerSsr]edges& rrZInfoFlowAnalysis._build_graphJs  3DKK=B    -  =dkk]#NO .$--)*+KK'')D}} 4 4 : ::]]..v{{9;K;KT/RSF!))$++*<*<*> @R@R@TU6|||+DFFAF ))$/&,ll {{{+DFFAF ))$/&,kk V *("#  BC -b.@.@.H-IJ!!#!3!3DFF!; nodesZsubgraphr?r@rrrSrZremove_edges_fromrZenabledZremover;r<rr) rBZnrZ delete_listrr]rZ rule_listrZ deleted_ruless & rr~Z InfoFlowAnalysis._build_subgraphmsq          => *$//+,- -$,,)* .$--)*+!FFLLNDNqt||.CNDFFOOE*//1 ??Q K )#DIIq4;;0&&t,* II ' ' 4 == $K )#DIIq4  JJD<<8$--88!((.'9; %D0 ))$/%,,T2& zzz&&t,#*& II ' ' 4$  EF 01C1CDII1N0OP!!#!3!3DII!> ?qB CQEs M ,M cs<V^8dQh/S[PS[S[R3,,;R&S[PS[S[R3,,;R&S[S[S[3,R,;R&#)r). DIRECT_MODESTRANSITIVE_MODESNr()rFinaltupler rr0r1r2r5rr6r7sdB,,uT3Y/0PCDll5s#34ZENc4i 4''Or)r>rHrZrQrVr:r;r@)%rrrrrenumZEnumr rrrrrrr r r/r#r$r%r9Zpropertyr&Zsetterr"r+r'rrrrrr~__annotate_func__r__classdictcell__ __classcell__rCr4@@rrrs,0tyy059LL$--3PL8<8J8JDMM7Z   / NF   / NF   D#$7;8<#00  ,-  CG 8<:!!""  $$__$$  ^^$$9L9LvJGJGX # #"::@!@!@F3C3Cc rcsaa]tRtRtoRtRt]!4t]!R4t V3RlRlt V3RlV3Rllt R t V3R lt R tVtV;t#) ria. 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. FZcapacitycrrDrr2r5rr6InfoFlowStep.__annotate__sIItIrcsVPPVPVP4'gVV'dCVPP VPVP^R7RVnRVnR#\R4hR#)rT)rSNz$InfoFlowStep does not exist in graph)r>Zhas_edger#r$Zadd_edgerrSrM)rBrrNr __post_init__ZInfoFlowStep.__post_init__s_vvt{{DKK88 T[[C! "  !GHH 9rcs&<V^8dQhRS[RS[/#)r)specr,rr2r5rr6rs,,s,s,rcs<VR8XdJRPR\VP444pVP RVP RV 2#V'gVP RVP 2#\ SV`V4#)fullrc3s,"TF pRV 2xK R#5i)z Nr)rjZrs& rrlZ*InfoFlowStep.__format__..sD1CAA3i1Csz -> )ZjoinZsortedrr#r$r8 __format__)rBrrrCs&& rrZInfoFlowStep.__format__sr 6>IID 1CDDEkk]$t{{m2eW= =kk]$t{{m4 47%d+ +rcs$VPR4#)r)rrIrJr__str__ZInfoFlowStep.__str__sv&&rcs<V^8dQh/R;R&S[P;R&S[P;R&S[S[,;R&#)r)rr>r#r$r)r r/rr1r2r5rr6rsD O!" NN#$ NN%& DM!'r)rrS)rrrrrrrrrrSrrrrrrrrrrrrsG  "F NEJ 'FII,,'_rcsV^8dQh/^\9d,\P\\R3,,;R&#)r).__all__)__conditional_annotations__rrrr0)r3s"rr6r6s* (^]eCHo &]) r)rrr^)*rrrZloggingZcollections.abcrrZ contextlibrZ dataclassesrrrZnetworkxr<Znetworkx.exceptionrrrZ ImportErrorZiexZ getLoggerrrrZrr r r r Z descriptorsr rrr^rZDirectedGraphAnalysisrZNetworkXGraphEdgerr6)rs@rrs  -* GNN ;:II' )]]DCu22DCN  /'6++/' /'g G h%% 2D&EFFGsBC.CC