One Hat Cyber Team
Your IP :
10.30.1.1
Server IP :
103.148.201.5
Server :
Linux web-olt 5.15.0-156-generic #166-Ubuntu SMP Sat Aug 9 00:02:46 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
/
__pycache__
/
View File Name :
graph.cpython-310.pyc
o �/a o � @ s8 d dl mZ d dlZd dlmZmZ dZdd� ZdAdd �ZdBd d �Z g dd dfdd�Z dCdd�Z ej ej fejejejejejd�ej ej fejejejejejd�e�d�e�d�fejddd�e�d�e�d�e�d�e�d �e�d �e�d�e�d �fejejd �e�d �e�d!�fejddd�ejddd�ejddd�ejddd�ejd dd�ejd dd�ejddd�ejd dd�fejejd �d"d#d#d#d#d#d�d$�Zd%d&d'd(d)d*d+�d,d)d-d.d)d/d+�d0�Zd1d2� Zd3d4� Z dDd5d6�ZdEd8d9�Z d:d;� Z < = > dFd?d@�Z dS )G� )�colourN)�cycle�groupby� c C s� t | �dk r| S | �dd�} g }| �d�D ]F}t |�dkrTd|dd� v r.|�dd�\}}nt |�d }t |�| }|d |� ||d � }}|�|d � t |�dks |r[|�|� qd �|�S ) z�Break DNs over multiple lines, for better shaped and arguably more readable nodes. We try to split after commas, and if necessary after hyphens or failing that in arbitrary places.� �,z, � � �-� � Nz\n)�len�replace�split�append�join)�s�pieces�p�q�n�b� r �-/usr/lib/python3/dist-packages/samba/graph.py�reformat_graph_label s" � � r Fc C s | � dd�} |r t| �} d| S )z%Escape a string as graphvis requires.�"z%s)r r )r �reformatr r r �quote_graph_label4 s r �,...c s� t dd� | D ��}g }t|�dkr�d� t|�� �}z t� fdd�|D ��}t|�dks0d|v r1n� d8 � qW n tyD ||f Y S w � d7 � |d }� t|�k ri|� d kri� d7 � � t|�k ri|� d ksY� t|� krt||fS |�||� d � f� |�� D ]\}} | d � � | ||< q�|r�|�� D ]} d | vr� nq�t d d� |�� D ��}|�d � |�� D ] } | �d�s� ||fS q�t dd� |�� D ��}|�d� ||fS )a~ Replace the common suffix (in practice, the base DN) of a number of vertices with a short string (default ",..."). If this seems pointless because the replaced string is very short or the results seem strange, the original vertices are retained. :param vertices: a sequence of vertices to shorten :param suffix: the replacement string [",..."] :param aggressive: replace certain common non-suffix strings :return: tuple of (rename map, replacements) The rename map is a dictionary mapping the old vertex names to their shortened versions. If no changes are made, replacements will be empty. c s s � | ]}||fV qd S �Nr ��.0�vr r r � <genexpr>N � � z'shorten_vertex_names.<locals>.<genexpr>r ���Tc 3 s � | ]}|� V qd S r r �r! �x��ir r r# X r$ �*r r N� ,CN=Servers,c s �& � | ]\}}||� d dd�fV qdS )r+ z,**,r N�r �r! �kr" r r r r# y � � �)z**z CN=Servers�CN=NTDS Settings,c s r, )r1 z*,r Nr- r. r r r r# � r0 )r* zCN=NTDS Settings) �dictr �list�values�set� IndexErrorr �items� startswith) �vertices�suffix� aggressive�vmap� replacements�vlist�cr' r/ r" r r( r �shorten_vertex_names> sZ � �� �� �� r@ �key_r c C s� g }g }g }g }g } t | �D ]r\} } | \} } }d|| f }t|�}d| }| r<| �|� |�|� |�d||| f � q|�|� d| }d| }| �|� |�d| � |�d||f � |�d||f � |�d ||| f � |�d |||f � |�d � qd }|r�t t|��D ]0\} }| �d | � |\}}|d dkr�|d dkr�|dd� }|dd� }|d| ||f 7 }q�g }| r�|D ] }|�d|| d f � q�dd�|�d�|�d�|�|d�|�d�| �f }|S )a� Generate a dot file snippet that acts as a legend for a graph. :param key_items: sequence of items (is_vertex, style, label) :param nodes_above: list of vertices (pushes key into right position) :param elision: tuple (short, full) indicating suffix replacement :param prefix: string used to generate key node names ["key_"] :param width: default width of node lines Each item in key_items is a tuple of (is_vertex, style, label). is_vertex is a boolean indicating whether the item is a vertex (True) or edge (False). Style is a dot style string for the edge or vertex. label is the text associated with the key item. z%s%d_z%s_labelz%s[label="%s"; %s]z%se1z%se2zsubgraph cluster_%s {z,%s[label=src; color="#000000"; group="%s_g"]z-%s[label=dest; color="#000000"; group="%s_g"]z!%s -> %s [constraint = false; %s]z8%s[shape=plaintext; style=solid; width=%f; label="%s\r"]�}� z elision%dr r r NuO elision%d[shape=plaintext; style=solid; label="\“%s” means “%s”\r"] z"%s" -> %s [style=invis]z�subgraph cluster_key { label="Key"; subgraph cluster_key_nodes { label=""; color = "invis"; %s } subgraph cluster_key_edges { label=""; color = "invis"; %s {%s} } %s } %s %s [style=invis; weight=9] z; r � z -> )� enumerater r �reversedr )� key_items� nodes_above�elisions�prefix�width� edge_lines� edge_names� vertex_lines� vertex_names� order_linesr) �item� is_vertex�style�label�tag�name�e1�e2� elision_str�elision�short�long� above_linesr r r r r �compile_graph_key� sz � �� �� � ���r^ Tc ! s$ g }|j }| du rtdd� |D ��tdd� |D ��B } | rNttdd� |D ��tdd� |D ��B t| �B �}t|�\� }� fdd�| D �} � fd d�|D �}nd}| du rVd } |r]d }d }nd }d}|d� |d|| f � |durx|d|f � |dt � |dt � d}d}g }t| �D ]z\}}t||�}|� |� g }| r�| | r�| | }||kr�|dur�|d� |}t|�}|r�|d| � |d7 }|d� |d� |d| � |r�|| r�|� || � |r�|| r�|� dt|| � � |�r|d |d �|�f � q�|d |f � q�|�r|d� t|�D ]f\}} | \} } | du �r#d } | du �r*d } t| |�} t| |�} g }|�rFt|| �} |� d!| � |�rT|� dt|| � � | �r^|� | | � |�rp|d"| || d �|�f � �q|d#| || f � �q| �r�t| ||d$�} || � |d%� d&�|�S )'a� Generate a Graphviz representation of a list of vertices and edges. :param vertices: list of vertex names (optional). :param edges: list of (vertex, vertex) pairs :param directed: bool: whether the graph is directed :param title: optional title for the graph :param reformat_labels: whether to wrap long vertex labels :param vertex_colors: if not None, a sequence of colours for the vertices :param edge_colors: if not None, colours for the edges :param edge_labels: if not None, labels for the edges :param vertex_styles: if not None, DOT style strings for vertices :param edge_styles: if not None, DOT style strings for edges :param graph_name: if not None, name of graph :param shorten_names: if True, remove common DN suffixes :param key: (is_vertex, style, description) tuples :param vertex_clusters: list of subgraph cluster names Colour, style, and label lists must be the same length as the corresponding list of edges or vertices (or None). Colours can be HTML RGB strings ("#FF0000") or common names ("red"), or some other formats you don't want to think about. If `vertices` is None, only the vertices mentioned in the edges are shown, and their appearance can be modified using the vertex_colors and vertex_styles arguments. Vertices appearing in the edges but not in the `vertices` list will be shown but their styles can not be modified. Nc s � � | ]}|d V qdS �r Nr r& r r r r# r$ z dot_graph.<locals>.<genexpr>c s r_ �r Nr r& r r r r# r$ c s r_ r` r r& r r r r# r$ c s r_ ra r r& r r r r# r$ c � g | ]}� | �qS r r r& �r< r r � <listcomp> � z dot_graph.<locals>.<listcomp>c � g | ] \}}� | � | f�qS r r �r! �ar rc r r rd � �A_samba_tool_production�digraphz->�graphz--z/* generated by samba */z%s %s {z label="%s";z fontsize=%s; z'node[fontname=Helvetica; fontsize=%s]; r rB zsubgraph cluster_%d {r zstyle = "rounded,dotted";z'node [style="filled"; fillcolor=white];z label = "%s";z color="%s"z "%s" [%s];z, z"%s";zMissing source valuezMissing destination valuez label="%s"z"%s" %s "%s" [%s];z "%s" %s "%s";)rH rI z} r ) r r5 r3 r@ � FONT_SIZErE r r r^ )!r9 �edges�directed�title�reformat_labels� vertex_colors� edge_colors� edge_labels� vertex_styles� edge_styles� graph_name� shorten_namesrG �vertex_clusters�out�writer> rI � graph_type� connector� prev_cluster� cluster_n�quoted_verticesr) r" �attrs�clusterr �edgerh r rT �keyr rc r � dot_graph� s� *$�� � r� )�alternate rows� disconnected� connected� transitive�header�reset�' �- �| )�bg�p �� � � �� �� )r� r� r� r� �transitive scaler� r� � �� �rC rC )�ansiz ansi-heatmapzxterm-256colorzxterm-256color-heatmapNu │u ─u ╭� ·r u ←)�vertical� horizontal�corner�diagonal�missing� right_arrow�|r �0z<-)�utf8�asciic C sv t | �t dd� |D ��B t dd� |D ��B }|t | �kr)td|t | � tjd� t|�}i }|D ]}|di||< q1|D ]\}}|| �|d�|| |< q<t|�D ]E}d} i } |�� D ]4\}} | �� } | | |< | �� D ]#\}} || �� D ]\}}| | }| �||�}||k r�|| |< d } quqkq[| }| s� nqQi }| D ] }i ||< | D ]}|| �||�}||k r�||| |< q�q�|S ) Nc s r_ r` r �r! �er r r r# � r$ z+find_transitive_distance.<locals>.<genexpr>c s r_ ra r r� r r r r# � r$ z there are unknown vertices: %s)�filer r FT) r5 �print�sys�stderrr �get�ranger7 �copy)r9 rn � all_vertices�inf� distancesr" �src�destr) �changed� new_distances�d�new_d�cost�leaf�cost2�new_cost�old_cost�answer�v2rh r r r �find_transitive_distance� s^ �� �� ���� ��r� c sL d� v r � d �t ���dt|d � ����fdd�}|S � fdd�}|S )Nr� r g �?c s( t | t�sdS �t| � � � d � S )NrC r )� isinstance�int�min��link)�mr �scaler r �f s z"get_transitive_colourer.<locals>.fc s � d S )Nr� r r� )�coloursr r r� s )r r� )r� � n_verticesr� r )r� r� r r� r �get_transitive_colourer� s �r� c + s, g }|j } t|r dnd } | d } | d } | d } | d }| d }| d }t| }t|�d d ���| d u rIttd d � |D ��td d � |D ��B �} |d urqt| |d�} g }t| |d�D ]\}}t��� |� � fdd �|D �� q[n �fdd�| D �}|r�t tdd � |D ��tdd � |D ��B t| �B �}t |ddd�\�}�fdd�| D �} �fdd�|D �}t dt dd � | D ���}|�dd �}|�d d �}|�d d �}|�d d �}t |t| ��} d | } d } | d!|d d t| � ||f � t| �D ]7\} }t| �| } || � | d"k�rd#| d d$� ||f }!n| }!| d%|!| |� | | | ||f � | � | 7 } q�t| |�}"t| �D ]�\} }|| � |"| }#g }$| D ]O}%|#�|%�}&|&d u �r[|$� d&||f � �qD|&d'k�rm|$� d(|� ||f � �qD|&d"k�r}|$� d)||f � �qD| |&�}'|&d*k�r�d+}&|$� d,|'|&|f � �qD|d u�r�|| �r�|$� d-|||| f � | d.� |||d �|$�|f � �q4t��}(|�r�| d � t|�D ]\})}*| d/|(|)||(|*|f � �q�|�r| d � | d0||||f � | d1|(||f � | d2||f � | d3| d4�|f � | d5|||f � d6�|�S )7Nr� r� r� r� r� r� r� r� r� r� c s r_ r` r r& r r r r# $ r$ z"distance_matrix.<locals>.<genexpr>c s r_ ra r r& r r r r# $ r$ �r� c 3 � � | ]}� V qd S r r r& �r? r r r# - � � c � g | ]}t � ��qS r ��nextr �� colour_cycler r rd / re z#distance_matrix.<locals>.<listcomp>c s r_ r` r r& r r r r# 2 r$ c s r_ ra r r& r r r r# 3 r$ �+T�r; c rb r r r& rc r r rd 7 re c rf r r rg rc r r rd 8 ri � c s � � | ]}t |�V qd S r �r r r r r r# : r$ r� rC r� r� r� rD z%*s %s %sdestination%sr z %s%ssource%si�����%s %s%s%s%s%s %s%s�%s%sr �%s%s%s%sz%s1%s� �>�%s%s%s�%s %s %s� %s%*s%s %s%s� '%s%s%s' stands for '%s%s%s'zQData can get from %ssource%s to %sdestination%s in the indicated number of steps.z+%s%s%s means zero steps (it is the same DC)z%s1%s means a direct linkzL%s2%s means a transitive link involving two steps (i.e. one intermediate DC)r z;%s%s%s means there is no connection, even through other DCsr )r �CHARSETS� COLOUR_SETSr r� �sortedr5 r r� �extendr3 r@ �maxr� r rE r� r rF )+r9 rn r� r rx � generate_key�grouping_function� row_comments�linesr{ �charsetr� r� r� r� r� r� r� � colour_listr/ r" r> r= �vlen�c_header� c_disconn�c_conn�c_reset�colour_transitive�vspace� verticalsr) �j�start� connections�links�rowr� r� �ct� example_c� substitute�originalr �r? r� r< r �distance_matrix s� ( ��� � � � � ���� �� r� rD c C s |dkrd}d|d | | S )Nr rC rD r )�char�digits�paddingr r r �pad_char� s r c C s< i }| � � D ]\}}|� � D ] \}}||�|i �|< qq|S r )r7 � setdefault)r� �m2�k1r� �k2�distr r r �transpose_dict_matrix� s �r r �source� destinationc 6 sZ g } | j } | r t| �} |dk}t|rdnd }t|d |�}|d || }t|d ||d �}t|d |�}t|d |�}td |�}|d }td |�}t| }t|�d d ���t| �� �}|d ur�|j |d� g }t ||d�D ]\}} t ��� |� � fdd�| D �� qpn �fdd�|D �}|r�t |ddd�\�} i } | �� D ]\} } t�fdd�| �� D ��| �| < q�| } t| �� �}tdt| �tdd� |D ���}!|�dd�}"|�dd�}#|�d d�}$|�d d�}%|d u r�t| �}t||�}&d |! }'d}(| d |'|t| �d |"| |%f � t|�D ]>\})} t| �|) }*||) � |*dk�r0d |'d t| � � |"| |%f }+n|'}+| d |+|(|%� |||* | |%f � |(d!� |f 7 }(�q d!d | |%f },d"}-t|�D ]�\})} | | }.||) � g }/|D ]Z}0|0|.v�r}|/� d#|#||%f � �qj| |0k�r�|/� d |%� ||%f � �qj|.|0 }1|1d$| k�r�|&|1�}2|/� d#|2||%f � d}-�qj|1d%k�r�|$}2n|&|1�}2|/� d&|2||1|,f � �qj|d u�r�||) �r�|/� d'|%|||) f � | d(� |!| |%d�|/�|%f � �qZ|-�s�|�r�| d� |-�r | d)|&d$| �||%d$| d f � |�r(t ��}3t| �D ]\}4}5| d*|3|4|%|3|5|%f � �qd+�| �S ),Nr r� r� r� r� r� r� r� r� r� rD r� r� r� c 3 r� r r r& r� r r r# � r� z full_matrix.<locals>.<genexpr>c r� r r� r r� r r rd � re z full_matrix.<locals>.<listcomp>r� Tr� c 3 s � | ] \}}� | |fV qd S r r r. rc r r r# � s � r� c s r� r r� r r r r r# � r$ r� rC r� r� r� z %s %s %s%s%sr� r� r� Fr� r r z%s%*s%sr� r� z '%s%s%s' means greater than %d r� r )r r r� r r� r r� r3 �keys�sortr r� r� r@ r7 r2 r� r r� rE r rF )6�rowsr� r rx r� r� r� � colour_scaler �ylabel�xlabel� transposer� r{ � use_paddingr� r� r� r� r� r� �toobigr� �emptyr� r9 r� r/ r" r= �rows2�vert�rr� r� r� r� r� r� r� r� r) r� r� �end_cell�overflowr� r� r� r� r� r� r� r� r r� r � full_matrix� s� � � �$ � �� � �� � r )F)r F) FNTNNNNNNFNN)FNFFNN)rD ) FNFFNNNr r r T) �sambar r� � itertoolsr r rm r r r@ r^ r� � DARK_WHITE�BLACK�RED�GREEN� DARK_YELLOW� UNDERLINE�C_NORMAL�REV_RED� REV_GREEN�REV_DARK_YELLOW�xterm_256_colourr� r� r� r� r� r r r r r r r �<module> s� J �` � � � � ��� ����?� ��4 � �