HEX
Server: Apache/2.4.52 (Ubuntu)
System: Linux spn-python 5.15.0-89-generic #99-Ubuntu SMP Mon Oct 30 20:42:41 UTC 2023 x86_64
User: arjun (1000)
PHP: 8.1.2-1ubuntu2.20
Disabled: NONE
$ pwd: /lib/python3/dist-packages/samba/kcc/__pycache__/
Upload Files
File: //lib/python3/dist-packages/samba/kcc/__pycache__/graph.cpython-310.pyc
o

�/a�n�@srddlZddlZddlmZmZmZddlmZddlm	Z	ddl
mZddlm
Z
mZmZdZGdd	�d	e�Zd
d�Zdd
�Zdd�Z		d=dd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�Zd%d&�Z d'd(�Z!d)d*�Z"d+d,�Z#d-d.�Z$d/d0�Z%Gd1d2�d2e�Z&Gd3d4�d4e�Z'Gd5d6�d6e�Z(Gd7d8�d8e�Z)Gd9d:�d:e�Z*Gd;d<�d<e�Z+dS)>�N)�write_dot_file�verify_and_dot�verify_graph)�KCCError)�ndr_pack)�misc)�DEBUG�DEBUG_FN�WARN���c@s eZdZdZdd�Zdd�ZdS)�ReplInfoz�Represents information about replication

    NTDSConnections use one representation a replication schedule, and
    graph vertices use another. This is the Vertex one.

    cCs"d|_d|_d|_d|_d|_dS)Nr�)�cost�interval�options�schedule�duration��self�r�1/usr/lib/python3/dist-packages/samba/kcc/graph.py�__init__*s

zReplInfo.__init__cCst|�|_t|j�|_dS)zeConvert the schedule and calculate duration

        :param schdule: the schedule to convert
        N)�convert_schedule_to_repltimesr�total_scheduler)rrrrr�set_repltimes_from_schedule1s
z$ReplInfo.set_repltimes_from_scheduleN)�__name__�
__module__�__qualname__�__doc__rrrrrrr#srcCsB|durdSd}|D]}|dkr||d@7}|dL}|dksq
|S)aReturn the total number of 15 minute windows in which the schedule
    is set to replicate in a week. If the schedule is None it is
    assumed that the replication will happen in every 15 minute
    window.

    This is essentially a bit population count.
    Nr
r�r)r�total�byterrrr:s	��rcCsp|dus|jddurdgdSg}|jdj}td�D]}|�||dd@d>||ddd@B�q|S)	a2Convert NTDS Connection schedule to replTime schedule.

    Schedule defined in  MS-ADTS 6.1.4.5.2
    ReplTimes defined in MS-DRSR 5.164.

    "Schedule" has 168 bytes but only the lower nibble of each is
    significant. There is one byte per hour. Bit 3 (0x08) represents
    the first 15 minutes of the hour and bit 0 (0x01) represents the
    last 15 minutes. The first byte presumably covers 12am - 1am
    Sunday, though the spec doesn't define the start of a week.

    "ReplTimes" has 84 bytes which are the 168 lower nibbles of
    "Schedule" packed together. Thus each byte covers 2 hours. Bits 7
    (i.e. 0x80) is the first 15 minutes and bit 0 is the last. The
    first byte covers Sunday 12am - 2am (per spec).

    Here we pack two elements of the NTDS Connection schedule slots
    into one element of the replTimes list.

    If no schedule appears in NTDS Connection then a default of 0x11
    is set in each replTimes slot as per behaviour noted in a Windows
    DC. That default would cause replication within the last 15
    minutes of each hour.
    Nr��T���r)�	dataArray�slots�range�append)r�times�data�irrrrNs
0rcCs�t�}t|j|j�|_|j|j@|_|jdurdgd|_|jdur(dgd|_dd�t|j|j�D�|_t|j�|_t|j	|j	t
�|_	|S)a�Generate an repl_info combining two others

    The schedule is set to be the intersection of the two input schedules.
    The duration is set to be the duration of the new schedule.
    The cost is the sum of the costs (saturating at a huge value).
    The options are the intersection of the input options.
    The interval is the maximum of the two intervals.

    :param info_a: An input replInfo object
    :param info_b: An input replInfo object
    :return: a new ReplInfo combining the other 2
    N�r#cSsg|]\}}||@�qSrr��.0�a�brrr�
<listcomp>��z%combine_repl_info.<locals>.<listcomp>)r�maxrrr�ziprr�minr�	MAX_DWORD)�info_a�info_b�info_crrr�combine_repl_infous


r<FcCs�t�}|jD]�}d}|jD]}g|_q
|jD]}	|	j}|	jD]}|j�|	�qq|s.|durzdd�tjdd�|jD��D�}
dd�|jD�}|durUtd|f|
||d�|rzt	|
|d	d
�}|rzt
d|�|D]
\}
}	}t
d|
|	f�qhtd
��t||d�t
|||�t||d�t
|||�qt|�t
|d|�|s�|dur�dd�|D�}
dd�|jD�}d}td|
|||t
||d�t||�\}}t|dd�|jD]}|��r�d|_q�|jj|_q�|s�|du�rdd�|D�}
dd�|jD�}d}td|
|||t
||d�g}|D]<}|j\}}|j|u�s|j|u�rC|���s%|���r>|jtk�r>d|_|j|jk�r>||f|jdd�<|�|��q|�sM|du�rudd�|D�}
|
�dd�|D��dd�|jD�}d}td|
|||t
|d|d�	||fS) awFind edges for the intersite graph

    From MS-ADTS 6.2.2.3.4.4

    :param graph: a kcc.kcc_utils.Graph object
    :param my_site: the topology generator's site
    :param label: a label for use in dot files and verification
    :param verify: if True, try to verify that graph properties are correct
    :param dot_file_dir: if not None, write Graphviz dot files here
    NcSs g|]\}}|jj|jjf�qSr��site�
site_dnstrr/rrrr3�s�z+get_spanning_tree_edges.<locals>.<listcomp>css�|]
}t�|jd�VqdS)r$N)�	itertools�combinations�vertices)r0�edgerrr�	<genexpr>�s��z*get_spanning_tree_edges.<locals>.<genexpr>cS�g|]}|jj�qSrr=�r0�vrrrr3��z
edgeset_%s)rB�label)�complete�	connected)rB�
propertiesz spanning tree edge set %s FAILEDz%18s: %szspanning tree failedFTcS� g|]}|jjj|jjjf�qSr��v1r>r?�v2�r0�errrr3���cSrErr=rFrrrr3�rH)�multi_edge_forest�
prekruskal)rIrL�debug�verify�dot_file_dir�
EDGE_TYPE_ALLrcSrMrrNrQrrrr3�rScSrErr=rFrrrr3�rH�postkruskalcSsg|]
}dd�|jD��qS)cSrErr=�r0�xrrrr3rHz6get_spanning_tree_edges.<locals>.<listcomp>.<listcomp>)rBrQrrrr3s�css*�|]}|jsdd�t|j�D�VqdS)cSrErr=r[rrrr3s�z5get_spanning_tree_edges.<locals>.<genexpr>.<listcomp>N)�directed�reversedrBrQrrrrDs���cSrErr=r[rrrr3rHrzpost-one-way-partial)rIrLrVrWr]rX)�set�edge_setrB�edges�con_typer*r@�chainrrrr�dijkstra�process_edge_set�setup_verticesr�kruskal�is_red�dist_to_red�	repl_inforr>�is_blackr8r]�extend)�graph�my_siterIrWrX�internal_edges�e_set�edgeTyperGrR�graph_edges�graph_nodes�errors�p�doc�verify_properties�output_edges�
components�	edge_listrC�wrrr�get_spanning_tree_edges�s�



�������
�
��

��
��r|cCs�t�}||_g|_|jD]\}}t|�|vr!|j�|�t|���q|j|j_|j	|j_	|j
|j_
|j�|j�||_
d|_|S)a6Set up a MultiEdge for the intersite graph

    A MultiEdge can have multiple vertices.

    From MS-ADTS 6.2.2.3.4.4

    :param con_type: a transport type GUID
    :param  site_link: a kcc.kcc_utils.SiteLink object
    :param guid_to_vertex: a mapping between GUIDs and vertices
    :return: a MultiEdge
    F)�	MultiEdge�	site_linkrB�	site_list�strrl�getrrjrrrrrbr])rbr~�guid_to_vertexrR�	site_guid�site_dnrrr�create_edges�


r�cCs6t�}t��|_|jD]
}|j|kr|j�|�q|S)z�Set up an automatic MultiEdgeSet for the intersite graph

    From within MS-ADTS 6.2.2.3.4.4

    :param graph: the intersite graph object
    :param transport_guid: a transport type GUID
    :return: a MultiEdgeSet
    )�MultiEdgeSetr�GUID�guidrarbr*)rm�transport_guidrpr~rrr�create_auto_edge_set5s	


�r�cCsh|jD].}|��rt|j_d|_d|_n
d|j_||_||_d|j_d|j_d|j_	d|j_
d|_qdS)aInitialise vertices in the graph for the Dijkstra's run.

    Part of MS-ADTS 6.2.2.3.4.4

    The schedule and options are set to all-on, so that intersections
    with real data defer to that data.

    Refer to the convert_schedule_to_repltimes() docstring for an
    explanation of the repltimes schedule values.

    :param graph: an IntersiteGraph object
    :return: None
    Nrrr
F)rB�is_whiter8rjr�root�component_idrrrr�demoted)rmrGrrrrfHs
�rfc	Cslt|||�}t|�dkr4t�|�\}}}|jD]}|jD]}||ur*t|||||�qqt|�dksdSdS)z�Perform Dijkstra's algorithm on an intersite graph.

    :param graph: an IntersiteGraph object
    :param edge_type: a transport type GUID
    :param include_black: boolean, whether to include black vertices
    :return: None
    rN)�setup_dijkstra�len�heapq�heappoprarB�try_new_path)	rm�	edge_type�
include_black�queuerr��vertexrCrGrrrrdhs

���rdcCstg}t|�|jD].}|��rq	|��r|r ||jvs ||jvr+t|j_d|_	d|_
q	t�||jj|j
|f�q	|S)z�Create a vertex queue for Dijksta's algorithm.

    :param graph: an IntersiteGraph object
    :param edge_type: a transport type GUID
    :param include_black: boolean, whether to include black vertices
    :return: A heap queue of vertices
    NT)rfrBr�rk�accept_black�accept_red_redr8rjrr�r�r��heappushr�)rmr�r�r�r�rrrr�zs


r�cCs`t|j|j�}|j|jjks|j|jjkr.|j|_|j|_||_t�||jj|j|f�dSdS)a	Helper function for Dijksta's algorithm.

    :param graph: an IntersiteGraph object
    :param queue: the empty queue to initialise.
    :param vfrom: Vertex we are coming from
    :param edge: an edge to try
    :param vto: the other Vertex
    :return: None
    N)	r<rjrrr�r�r�r�r�)rmr��vfromrC�vto�
new_repl_inforrrr��s
�r�cCs@|��rdS||jvr||jvrt|j_d|_d|_dSdSdS)z�Demote non-white vertices that accept only white edges

    This makes them seem temporarily like white vertices.

    :param vertex: a Vertex()
    :param edge_type: a transport type GUID
    :return: None
    NT)r�r�r�r8rjrr�r�)r�r�rrr�check_demote_vertex�s	


�r�cCs$|��rdSd|j_||_d|_dS)z}Un-demote non-white vertices

    Set a vertex's to an undemoted state.

    :param vertex: a Vertex()
    :return: None
    NrF)r�rjrr�r�)r�rrr�undemote_vertex�s

r�cCsl|dur(|jD]}|jD]}t||j�qt|||�|jD]}t|�qqdS|jD]}t|||�q+dS)z�Find internal edges to pass to Kruskal's algorithm

    :param graph: an IntersiteGraph object
    :param e_set: an edge set
    :param internal_edges: a set that internal edges get added to
    :return: None
    N)rarBr�rb�process_edger�)rmrprorCr�rrrre�s



��
�rec	Cs�g}|jD]}|�|j|jj|j|f�qtd|�|��|d\}}}}|jD]/}|jdus6|j	dur7q*|jdurY|j	durY|jdurY|j	durY|j|jkrYt
|||||�q*dS)z�Find the set of all vertices touching an edge to examine

    :param graph: an IntersiteGraph object
    :param examine: an edge
    :param internal_edges: a set that internal edges get added to
    :return: None
    zvertices is %srN)rBr*�colorrjr�ndrpacked_guidr�sortr�r��add_int_edge)	rm�examinerorBrGr�rr��bestvrrrr��s"





��r�cCs�|j}|j}|��o
|��}|r|j|jvs|j|jvrdSn|j|jvs+|j|jvr-dSt|j|j�}|jdkr;dSt||j�}	|	jdkrHdS|j|jkrS||}}t	||||	|j|j
�}
|�|
�dS)aCAdd edges between compatible red and black vertices

    Internal edges form the core of the tree -- white and RODC
    vertices attach to it as leaf nodes. An edge needs to have black
    or red endpoints with compatible replication schedules to be
    accepted as an internal edge.

    Here we examine an edge and add it to the set of internal edges if
    it looks good.

    :param graph: the graph object.
    :param internal_edges: a set of internal edges
    :param examine: an edge to examine for suitability.
    :param v1: a Vertex
    :param v2: the other Vertex
    Nr)r�rhrbr�r�r<rjrr��InternalEdger~�add)rmror�rOrP�root1�root2�red_red�ri�ri2�
newIntEdgerrrr�s.�


�r�cCs�|jD]}g|_qtdd�|jD��}t|�}|��d}d}g}d}|t|�krW||}t|j�}	t|j�}
|	|
urM|d7}t	|||�|
|	_
|�|	�|d7}|t|�ks)|t|�fS)aEPerform Kruskal's algorithm using the given set of edges

    The input edges are "internal edges" -- between red and black
    nodes. The output edges are a minimal spanning tree.

    :param graph: the graph object.
    :param edges: a set of edges
    :return: a tuple of a list of edges, and the number of components
    cSsg|]}|��s|�qSr)r�r[rrrr3@r4zkruskal.<locals>.<listcomp>rr)rBrar_�listr�r��find_componentrOrP�add_out_edger��discard)rmrarGry�expected_num_tree_edges�count_edgesrx�indexrR�parent1�parent2rrrrg3s*




�rgcCs\|j|ur|S|}|j|ur|j}|j|us|}|}|j|ur,|j}||_|}|j|us|S)z�Kruskal helper to find the component a vertex belongs to.

    :param vertex: a Vertex
    :return: the Vertex object representing the component
    )r�)r��currentr��nrrrr�[s


�

�r�cCsn|j}|j}t�}d|_|j|_|j�|�|j�|�|j|_|j	|_	|�|�|j
�|�|j
�|�dS)z�Kruskal helper to add output edges

    :param graph: the InterSiteGraph
    :param output_edges: the list of spanning tree edges
    :param e: the edge to be added
    :return: None
    FN)rOrPr}r]r~rBr*�e_typerbrjra)rmrxrRrOrP�eerrrr�rs
r�cCs�i}t�}|��D]#\}}t||�}	||	_t|j�|	_|j�|	�|�	|g�}
|
�
|	�q	t�}|��D]\}}
t||
|�}|�
|j�|j�|�q4|rQtd�|j�t||��||_|S)a^Set up an IntersiteGraph based on intersite topology

    The graph will have a Vertex for each site, a MultiEdge for each
    siteLink object, and a MultiEdgeSet for each siteLinkBridge object
    (or implied siteLinkBridge).

    :param part: the partition we are dealing with
    :param site_table: a mapping of guids to sites (KCC.site_table)
    :param transport_guid: the GUID of the IP transport
    :param sitelink_table: a mapping of dnstrs to sitelinks
    :param bridges_required: boolean, asking in vain for something to do
         with site link bridges
    :return: a new IntersiteGraph
    z-Samba KCC ignores the bridges required option)�IntersiteGraph�items�Vertexr�rr�r�rBr��
setdefaultr*r_r��updaterar
r`r��connected_vertices)�part�
site_tabler��sitelink_table�bridges_requiredr��gr�r>r��
guid_verticesr��site_link_dnr~�new_edgerrr�setup_graph�s*
�r�c@s"eZdZdZedd�\ZZZZdS)�VertexColorzEnumeration of vertex coloursrr&N)	rrrrr)�red�black�white�unknownrrrrr��sr�c@s8eZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�ZdS)
r�z�intersite graph representation of a Site.

    There is a separate vertex for each partition.

    :param site: the site to make a vertex of.
    :param part: the partition.
    cCsV||_||_tj|_g|_g|_g|_t�|_	||_
d|_||_d|_
d|_d|_dS)NFr)r>r�r�r�r�rar�r�rrjr�r�r�r�rr)rr>r�rrrr�s
zVertex.__init__cCsXtj|_|jj��D]\}}|�|jj�}|durq
|�	�s%tj
|_dStj|_q
dS)zGColor to indicate which kind of NC replica the vertex contains
        N)r�r�r�r>�	dsa_tabler��get_current_replicar��nc_dnstr�
is_partialr�r�)r�dnstr�dsa�reprrr�color_vertex�s
�zVertex.color_vertexcC�|jtjksJ�|jtjkS�N)r�r�r�r�rrrrrh��z
Vertex.is_redcCr�r�)r�r�r�r�rrrrrk�r�zVertex.is_blackcCr�r�)r�r�r�r�rrrrr��r�zVertex.is_whiteN)	rrrrrr�rhrkr�rrrrr��sr�c@�eZdZdZdd�ZdS)r�z$Graph for representing the intersitecCs"t�|_t�|_t�|_d|_dSr�)r_rBrar`r�rrrrrs
zIntersiteGraph.__init__N�rrrrrrrrrr��r�c@r�)r�zDefines a multi edge setcCsd|_g|_dS)Nr)r�rarrrrrs
zMultiEdgeSet.__init__Nr�rrrrr�r�r�c@r�)r}z#An "edge" between multiple verticescCs$d|_g|_d|_t�|_d|_dS)NT)r~rBrbrrjr]rrrrrs

zMultiEdge.__init__Nr�rrrrr}r�r}c@sPeZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�Zdd
�Z	dd�Z
dd�ZdS)r�z�An edge that forms part of the minimal spanning tree

    These are used in the Kruskal's algorithm. Their interesting
    feature isa that they are sortable, with the good edges sorting
    before the bad ones -- lower is better.
    cCs(||_||_||_||_||_||_dSr�)rOrPr�rjr�r~)rrOrP�redred�repl�eTyper~rrrr$s
zInternalEdge.__init__cCs t|j|j|j|j|j|jf�Sr�)�hashrOrPr�rjr�r~rrrr�__hash__,s�zInternalEdge.__hash__cCs||ko	||kSr�r�r�otherrrr�__eq__1szInternalEdge.__eq__cCs||kp||kSr�rr�rrr�__ne__4szInternalEdge.__ne__cCs||kSr�rr�rrr�__gt__7szInternalEdge.__gt__cCs
||kSr�rr�rrr�__ge__:�
zInternalEdge.__ge__cCs
||kSr�rr�rrr�__le__=r�zInternalEdge.__le__cCs�|j|jkr	|jS|jj|jjkr|jj|jjkS|jj|jjkr)|jj|jjkS|jj|jjkr9|jj|jjkS|jj|jjkrI|jj|jjkS|j|jkS)a�Here "less than" means "better".

        From within MS-ADTS 6.2.2.3.4.4:

        SORT internalEdges by (descending RedRed,
                               ascending ReplInfo.Cost,
                               descending available time in ReplInfo.Schedule,
                               ascending V1ID,
                               ascending V2ID,
                               ascending Type)
        )	r�rjrrrOr�r�rPr�r�rrr�__lt__@szInternalEdge.__lt__N)rrrrrr�r�r�r�r�r�r�rrrrr�sr�)NFN),r@r��samba.kcc.graph_utilsrrr�samba.kcc.kcc_utilsr�	samba.ndrr�samba.dcerpcr�samba.kcc.debugrr	r
r8�objectrrrr<r|r�r�rfrdr�r�r�r�rer�r�rgr�r�r�r�r�r�r�r}r�rrrr�<module>sJ'
�  1(/?

@ Telegram