One Hat Cyber Team
Your IP :
10.30.1.1
Server IP :
103.148.201.5
Server :
Linux web-olt 5.15.0-161-generic #171-Ubuntu SMP Sat Oct 11 08:17:01 UTC 2025 x86_64
Server Software :
Apache/2.4.52 (Ubuntu)
PHP Version :
8.1.29
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
samba
/
kcc
/
__pycache__
/
View File Name :
graph.cpython-310.pyc
o �/a�n � @ sr d dl Z d dlZd dlmZmZmZ d dlmZ d dlm Z d dl m Z d dl m Z mZmZ dZG dd � d e�Zd d � Zd d � Zdd� Z d=dd�Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Z d d � Z d!d"� Z d#d$� Z d%d&� Z d'd(� Z!d)d*� Z"d+d,� Z#d-d.� Z$d/d0� Z%G d1d2� d2e�Z&G d3d4� d4e�Z'G d5d6� d6e�Z(G d7d8� d8e�Z)G d9d:� d:e�Z*G d;d<� d<e�Z+dS )>� N)�write_dot_file�verify_and_dot� verify_graph)�KCCError)�ndr_pack)�misc)�DEBUG�DEBUG_FN�WARN� �� c @ s e Zd ZdZdd� Zdd� ZdS )�ReplInfoz�Represents information about replication NTDSConnections use one representation a replication schedule, and graph vertices use another. This is the Vertex one. c C s" d| _ d| _d| _d | _d| _d S )Nr � )�cost�interval�options�schedule�duration��self� r �1/usr/lib/python3/dist-packages/samba/kcc/graph.py�__init__* s zReplInfo.__init__c C s t |�| _t| j�| _dS )zeConvert the schedule and calculate duration :param schdule: the schedule to convert N)� convert_schedule_to_repltimesr �total_scheduler )r r r r r �set_repltimes_from_schedule1 s z$ReplInfo.set_repltimes_from_scheduleN)�__name__� __module__� __qualname__�__doc__r r r r r r r # s r c C sB | du rdS d}| D ]}|dkr ||d@ 7 }|dL }|dksq |S )a Return 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�byter r r r : s ��r c C sp | du s | j d du rdgd S g }| j d j}td�D ]}|�||d d@ d> ||d d d@ B � q |S ) a2 Convert 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�ir r r r N s 0r c C s� t � }t| j|j�|_| j|j@ |_| jdu r dgd | _|jdu r(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# c S s g | ]\}}||@ �qS r r ��.0�a�br r r � <listcomp>� � z%combine_repl_info.<locals>.<listcomp>) r �maxr r r �zipr r �minr � MAX_DWORD)�info_a�info_b�info_cr r r �combine_repl_infou s r< Fc C s� t � }| jD ]�}d}| jD ]}g |_q |jD ]} | j}| jD ]}|j�| � q q|s.|durzdd� tjdd� |jD �� D �} dd� | jD �} |durUtd|f | | |d� |rzt | | d d �} | rzt d | � | D ] \} } }t d | | f � qht d ��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 �� d d� | jD �} d }td | | ||t |d|d � ||fS ) aw Find 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 Nc S s g | ] \}}|j j|j jf�qS r ��site� site_dnstrr/ r r r r3 � s �z+get_spanning_tree_edges.<locals>.<listcomp>c s s � | ] }t �|jd �V qdS )r$ N)� itertools� combinations�vertices)r0 �edger r r � <genexpr>� s � �z*get_spanning_tree_edges.<locals>.<genexpr>c S � g | ]}|j j�qS r r= �r0 �vr r r r3 � � z edgeset_%s)rB �label)�complete� connected)rB � propertiesz spanning tree edge set %s FAILEDz%18s: %szspanning tree failedFTc S � g | ] }|j jj|jjjf�qS r ��v1r> r? �v2�r0 �er r r r3 � � �c S rE r r= rF r r r r3 � rH )�multi_edge_forest� prekruskal)rI rL �debug�verify� dot_file_dir� EDGE_TYPE_ALLr c S rM r rN rQ r r r r3 � rS c S rE r r= rF r r r r3 � rH � postkruskalc S s g | ] }d d� |j D ��qS )c S rE r r= �r0 �xr r r r3 rH z6get_spanning_tree_edges.<locals>.<listcomp>.<listcomp>)rB rQ r r r r3 s �c s s* � | ]}|j sd d� t|j�D �V qdS )c S rE r r= r[ r r r r3 s �z5get_spanning_tree_edges.<locals>.<genexpr>.<listcomp>N)�directed�reversedrB rQ r r r rD s � ��c S rE r r= r[ r r r r3 rH r zpost-one-way-partial)rI rL rV rW r] rX )�set�edge_setrB �edges�con_typer* r@ �chainr r r r �dijkstra�process_edge_set�setup_verticesr �kruskal�is_red� dist_to_red� repl_infor r> �is_blackr8 r] �extend)�graph�my_siterI rW rX �internal_edges�e_set�edgeTyperG rR � graph_edges� graph_nodes�errors�p�doc�verify_properties� output_edges� components� edge_listrC �wr r r �get_spanning_tree_edges� s� � ��� �� � � �� �� ��r| c C s� t � }||_g |_|jD ]\}}t|�|v r!|j�|�t|��� q |j|j_|j |j_ |j |j_ |j� |j � | |_ d|_|S )a6 Set 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 �getr rj r r r r rb r] )rb r~ �guid_to_vertexrR � site_guid�site_dnr r r � create_edge s � r� c C s6 t � }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�guidra rb r* )rm �transport_guidrp r~ r r r �create_auto_edge_set5 s �r� c C sh | j D ].}|�� rt|j_d|_d|_n d|j_||_||_d|j_d|j_d|j_ d|j_ d|_ qdS )a Initialise 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 Nr r r F) rB �is_whiter8 rj r �root� component_idr r r r �demoted)rm rG r r r rf H s �rf c C sl t | ||�}t|�dkr4t�|�\}}}|jD ]}|jD ]}||ur*t| ||||� q qt|�dks dS dS )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 r N)�setup_dijkstra�len�heapq�heappopra rB � try_new_path) rm � edge_type� include_black�queuer r� �vertexrC rG r r r rd h s ���rd c C st g }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)rf rB r� rk � accept_black�accept_red_redr8 rj r r� r� r� �heappushr� )rm r� r� r� r� r r r r� z s r� c C s` t |j|j�}|j|jjk s|j|jjkr.|j|_|j|_||_t�||jj|j|f� dS dS )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< rj r r r� r� r� r� r� )rm r� �vfromrC �vto� new_repl_infor r r r� � s �r� c C s@ | � � rdS || jvr || jvr t| j_d| _d| _dS dS dS )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� r8 rj r r� r� )r� r� r r r �check_demote_vertex� s �r� c C s$ | � � rdS d| j_| | _d| _dS )z}Un-demote non-white vertices Set a vertex's to an undemoted state. :param vertex: a Vertex() :return: None Nr F)r� rj r r� r� )r� r r r �undemote_vertex� s r� c C sl |du r(| j D ] }|jD ]}t||j� q t| ||� |jD ]}t|� q qdS |j D ]}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)ra rB r� rb � process_edger� )rm rp ro rC r� r r r re � s �� �re c C s� g }|j D ]}|�|j|jj|j|f� qtd| � |�� |d \}}}}|j D ]/}|jdu s6|j du r7q*|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 %sr N) rB r* �colorrj r �ndrpacked_guidr �sortr� r� � add_int_edge) rm �examinero rB rG r� r r� �bestvr r r r� � s" ��r� c C s� |j }|j }|�� o |�� }|r |j|jvs |j|jvr dS n|j|jvs+|j|jvr-dS t|j|j�}|jdkr;dS t||j�} | jdkrHdS |j|jkrS||}}t |||| |j|j �} |� | � dS )aC Add 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� rh rb r� r� r< rj r r� � InternalEdger~ �add) rm ro r� rO rP �root1�root2�red_red�ri�ri2� newIntEdger r r r� s. � �r� c C s� | j D ]}g |_qtdd� | j D ��}t|�}|�� d}d}g }d}|t|�k rW|| }t|j�} t|j�} | | urM|d7 }t | ||� | | _ |� | � |d7 }|t|�k s)|t|�fS )aE Perform 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 c S s g | ]}|� � s|�qS r )r� r[ r r r r3 @ r4 zkruskal.<locals>.<listcomp>r r ) rB ra r_ �listr� r� �find_componentrO rP � add_out_edger� �discard) rm ra rG ry �expected_num_tree_edges� count_edgesrx �indexrR �parent1�parent2r r r rg 3 s* � rg c C s\ | j | u r| 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� �nr r r r� [ s � �r� c C sn |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) rO rP r} r] r~ rB r* �e_typerb rj ra )rm rx rR rO rP �eer r r r� r s r� c C s� 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� r r� r� rB r� � setdefaultr* r_ r� �updatera r r` r� �connected_vertices)�part� site_tabler� �sitelink_table�bridges_requiredr� �gr� r> r� � guid_verticesr� � site_link_dnr~ �new_edger r r � setup_graph� s* � r� c @ s" e Zd ZdZedd�\ZZZZdS )� VertexColorz Enumeration of vertex coloursr r& N) r r r r r) �red�black�white�unknownr r r r r� � s r� c @ s8 e Zd ZdZdd� 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. c C sV || _ || _tj| _g | _g | _g | _t� | _ | | _ d | _ | | _ d| _ d| _d| _d S )NFr )r> r� r� r� r� ra r� r� r rj r� r� r� r� r r )r r> r� r r r r � s zVertex.__init__c C sX t j| _| jj�� D ] \}}|�| jj�}|du rq |� � s%t j | _ dS t j | _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�repr r r � color_vertex� s �zVertex.color_vertexc C � | j tjksJ �| j tjkS �N)r� r� r� r� r r r r rh � � z Vertex.is_redc C r� r� )r� r� r� r� r r r r rk � r� zVertex.is_blackc C r� r� )r� r� r� r� r r r r r� � r� zVertex.is_whiteN) r r r r r r� rh rk r� r r r r r� � s r� c @ � e Zd ZdZdd� ZdS )r� z$Graph for representing the intersitec C s" t � | _t � | _t � | _d | _d S r� )r_ rB ra r` r� r r r r r s zIntersiteGraph.__init__N�r r r r r r r r r r� � r� c @ r� )r� zDefines a multi edge setc C s d| _ g | _d S )Nr )r� ra r r r r r s zMultiEdgeSet.__init__Nr� r r r r r� r� r� c @ r� )r} z#An "edge" between multiple verticesc C s$ d | _ g | _d | _t� | _d| _d S )NT)r~ rB rb r rj r] r r r r r s zMultiEdge.__init__Nr� r r r r r} r� r} c @ sP e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dd� Z dd� Z dS )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. c C s( || _ || _|| _|| _|| _|| _d S r� )rO rP r� rj r� r~ )r rO rP �redred�repl�eTyper~ r r r r $ s zInternalEdge.__init__c C s t | j| j| j| j| j| jf�S r� )�hashrO rP r� rj r� r~ r r r r �__hash__, s �zInternalEdge.__hash__c C s | |k o || k S r� r �r �otherr r r �__eq__1 s zInternalEdge.__eq__c C s | |k p|| k S r� r r� r r r �__ne__4 s zInternalEdge.__ne__c C s || k S r� r r� r r r �__gt__7 s zInternalEdge.__gt__c C s | |k S r� r r� r r r �__ge__: � zInternalEdge.__ge__c C s || k S r� r r� r r r �__le__= r� zInternalEdge.__le__c C s� | j |j kr | j S | jj|jjkr| jj|jjk S | jj|jjkr)| jj|jjkS | jj|jjkr9| jj|jjk S | jj|jjkrI| jj|jjk S | j|jk S )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� rj r r rO r� r� rP r� r� r r r �__lt__@ s zInternalEdge.__lt__N) r r r r r r� r� r� r� r� r� r� r r r r r� s r� )NFN),r@ r� �samba.kcc.graph_utilsr r r �samba.kcc.kcc_utilsr � samba.ndrr � samba.dcerpcr �samba.kcc.debugr r r r8 �objectr r r r< r| r� r� rf rd r� r� r� r� re r� r� rg r� r� r� r� r� r� r� r} r� r r r r �<module> sJ ' � 1( /?