gnxSSKrSSKrSSKJrJrJr SSKJr SSKJ r SSK J r SSK J r JrJr Sr"SS \5rS rS rS rS)S jrSrSrSrSrSrSrSrSrSrSr Sr!Sr"Sr#Sr$Sr%"SS\5r&"SS \5r'"S!S"\5r("S#S$\5r)"S%S&\5r*"S'S(\5r+g)*N)write_dot_fileverify_and_dot verify_graph)KCCError)ndr_pack)misc)DEBUGDEBUG_FNWARNc$\rSrSrSrSrSrSrg)ReplInfo#zRepresents information about replication NTDSConnections use one representation a replication schedule, and graph vertices use another. This is the Vertex one. cJSUlSUlSUlSUlSUlg)Nr)costintervaloptionsscheduledurationselfs 1/usr/lib/python3/dist-packages/samba/kcc/graph.py__init__ReplInfo.__init__*s%     cX[U5Ul[UR5Ulg)zVConvert the schedule and calculate duration :param schedule: the schedule to convert N)convert_schedule_to_repltimesrtotal_scheduler)rrs rset_repltimes_from_schedule$ReplInfo.set_repltimes_from_schedule1s 6h? &t}}5 r)rrrrrN)__name__ __module__ __qualname____firstlineno____doc__rr __static_attributes__rrrr#s 6rrc\UcgSnUHnUS:wdM XS-- nUS-nUS:waMM! U$)zReturn 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. rrr()rtotalbytes rrr:sH Eai AX E QJDai LrcUbURScS/S-$/nURSRn[S5H-nURX#S-S-S-X#S-S-S--5 M/ U$)aConvert 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. rTr*) dataArrayslotsrangeappend)rtimesdatais rrrNs68--a08v{ E   a & &D 2Y dq5kC'A-!eai31FGH Lrc[5n[URUR5UlURUR-UlURc S/S-UlURc S/S-Ul[ URUR5VVs/sH up4X4-PM snnUl[ UR5Ul[URUR-[5Ul U$s snnf)aGenerate 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 r/) rmaxrrrziprrminr MAX_DWORD)info_ainfo_binfo_cabs rcombine_repl_inforEusZF&//6??;FO^^fnn4FN&2+ &2+),V__foo)NO)Nqu)NOFO$V__5FOfkkFKK/;FK M Ps!Dc  [5nURGHnSnURH n/UlM URH=n U RnU RHnURR U 5 M M? U(dUb[ R"SUR56V V s/sH1upU RRU RR4PM3 n n n URVs/sHoRRPM n nUb[SU<3U XS9 U(aI[XSS9nU(a8[SU-5 UHupn[U<SS U <35 M [S 5e[XS 5 [XU5 [XS 5 [XU5 GM [!U5 [USU5 U(dUbUV s/sHCn U R"RRU R$RR4PME n n URVs/sHoRRPM n nS n['SXUU[X4S9 [)X5unn[USS 5 URH<nUR+5(a SUlM!UR.R0UlM> U(dUbUV s/sHCn U R"RRU R$RR4PME n n URVs/sHoRRPM n nS n['SXUU[UUS9 /nUHnURunnURULdURULdM2UR35(dUR35(aFUR,[4:wa2S UlUR,UR,:aUU4URSS&UR U5 M U(dUbUV Vs/sH4n U RVs/sHnURRPM snPM6 n n nU R9SU55 URVs/sHnURRPM n nSn['SXUU[US US9 UU4$s sn n fs snfs sn fs snfs sn fs snfs snfs snn fs snf)a[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 Nc3d# UH&n[R"URS5v M( g7f)r0N) itertools combinationsvertices).0edges r *get_spanning_tree_edges..s+!:-8T"+!7!7 q!I!I-8s.0edgeset_)rJlabel)complete connected)rJ propertiesz spanning tree edge set %s FAILEDz>18z: zspanning tree failedFT)multi_edge_forest prekruskal)rPrSdebugverify dot_file_dir EDGE_TYPE_ALLr postkruskalc3# UHQoR(aM[UR5Vs/sHnURRPM snv MS gs snf7fN)directedreversedrJsite site_dnstr)rKexs rrMrN sOA$-qZZ;%-ajj%9;%9FF--%9;$-;sA A  AA r(zpost-one-way-partial)rPrSrVrWr]rX)setedge_setrJedgescon_typer6rHchainr_r`rrr rdijkstraprocess_edge_setsetup_verticesv1v2rkruskalis_red dist_to_red repl_inforis_blackr?r]extend)graphmy_siterPrWrXinternal_edgese_setedgeTypevrarCrD graph_edges graph_nodeserrorspdocverify_properties output_edges components edge_listrLwrbs rget_spanning_tree_edgesrs{UNAAG AzzHZZq!  \-%??!:-2[[!:;<; $qFF--qvv/@/@A; < 7:a)):> ) + A$-A A38..A.Qqvv((. A-{"/@"6 $$0  2 j  O< FD0A*0A0?+ BsD58S>S A S%6S* A S/:S4:S> S9 .S> T9S>c[5nXl/UlURHIupE[ U5U;dMURR UR [ U555 MK URURlURURl URURl URRUR5 Xl SUlU$)aSet 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_linkrJ site_liststrrrgetrrprrr rrfr])rfrguid_to_vertexra site_guidsite_dns r create_edgers  AKAJ'11 y>^ + JJ  n00Y@ A2!~~AKK#++AKK$--AKKKK++I,>,>?JAJ Hrc[5n[R"5UlURH0nUR U:XdMURR U5 M2 U$)zSet 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 ) MultiEdgeSetrGUIDguidrerfr6)rstransport_guidrvrs rcreate_auto_edge_setr5sM NEEJ[[    / KK  y )! LrclURHnUR5(a$[URlSUlSUlOSURlXlXlSURlSURlSURl SURl SUl M g)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 Nrr rF) rJis_whiter?rprroot component_idrrrrdemoted)rsrxs rrjrjHs^^ ::<<(AKK AF!AN AKK FN  ( # %  rc [XU5n[U5S:ad[R"U5upEnURH)nUR HnXLdM [ XXgU5 M M+ [U5S:aMcgg)zPerform 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_dijkstralenheapqheappoprerJ try_new_path) rs edge_type include_blackqueuerrvertexrLrxs rrhrhhsh 5] ;E e*q."]]51FLLD]]? vQ?#! e*q.rc/n[U5 URHnUR5(aMUR5(aU(aXR;dXR ;a%[ URlSUl SUl My[R"X4RRURU45 M U$)zCreate 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)rjrJrrq accept_blackaccept_red_redr?rprrrrheappushr)rsrrrrs rrrzs E5.. ??   oo !4!44!6!66$-F   !FK!FN NN5#3#3#8#8&++v"N O! Lrc[URUR5nURURR:d$URURR:a`URUlUR UlXTl[ R"XRRURU45 gg)zHelper 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) rErprrrrrrr)rsrvfromrLvto new_repl_infos rrrs&eoot~~FM S]]///!7!77:: --%  u}}11388SAB 8rcUR5(agXR;a4XR;a$[URlSUlSUlggg)zDemote 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)rrrr?rprrr)rrs rcheck_demote_vertexrsT -- - // / )  0 .rclUR5(agSURlXlSUlg)zmUn-demote non-white vertices Set a vertex's to an undemoted state. :param vertex: a Vertex() :return: None NrF)rrprrr)rs rundemote_vertexrs.FKFNrcUcfURHUnURHn[XCR5 M [ XU5 URHn[ U5 M MW gURHn[ XU5 M g)zFind 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)rerJrrf process_edger)rsrvrurLrs rririsk }KKD--#FMM:( n 5--'(  KKD n 5 rc/nURH@nURURURRUR U45 MB [ SU-5 UR5 USupVpxURHnURb URcMURcM.URcM=URcMLURcM[URUR:wdMw[XXU5 M g)zFind 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) rJr6colorrprndrpacked_guidr sortrr add_int_edge) rsexaminerurJrxrrrbestvs rrrsH   !++"2"2A4D4DaHI X %& MMO'{E    >> !QVV^    + ZZ # ^^ ' VV    1>> 1  BrcURnURnUR5=(a UR5nU(a6URUR;dURUR;agO5URUR;dURUR;ag[ UR UR 5nURS:Xag[ XR 5n U RS:XagURUR:aXepe[XVXyURUR5n URU 5 g)aAdd 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) rrnrfrrrErprr InternalEdgeradd) rsrurrkrlroot1root2red_redriri2 newIntEdges rrrs" GGE GGElln/G   E$8$8 8u';';; <   %"4"4 4   U%7%7 7 2<< 6B {{a B 1 1 2C ||q e222ueG':J:J%//1Jz"rcURH n/UlM [URVs/sHo3R5(aMUPM sn5n[ U5nUR 5 SnSn/nSnU[ U5:apXn [U R5n [U R5n XLa(US- n[XU 5 Xl URU 5 US- nU[ U5:aMpU[ U54$s snf)a-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 rr*) rJrercrlistrrfind_componentrkrl add_out_edgerdiscard) rsrerxrbrexpected_num_tree_edges count_edgesrindexraparent1parent2s rrmrm3s^^DAzz|aDEJ KE JJL KL E #e*  L & &  ! 1 K a 0#*   w '   #e*  Z ((1Es D DcURULaU$UnURULaURnURULaMUnUnURULa%URnX!lUnURULaM%U$)zKruskal helper to find the component a vertex belongs to. :param vertex: a Vertex :return: the Vertex object representing the component )r)rcurrentrns rrr[s f$ G   g -&&   g - DG   d *  #   d * KrcURnURn[5nSUlURUlUR R U5 UR R U5 URUlURUl UR U5 URR U5 URR U5 g)zKruskal 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) rkrlrr]rrJr6e_typerfrpre)rsrrarkrlees rrrrs B B BBK;;BLKKrKKr((BK;;BLHHOOBHHOOBrcd0n[5nUR5Hnupx[X5n Xyl[ UR 5U lURRU 5 URU/5n U RU 5 Mp [5n UR5HGup[X-U5nU RUR5 URRU5 MI U(a [S5 UR R[#Xb55 XlU$)a2Set 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)IntersiteGraphitemsVertexrrrrrJr setdefaultr6rcrupdaterer rdrconnected_vertices)part site_tablersitelink_tablebridges_requiredrgrr_r guid_verticesr site_link_dnrnew_edges r setup_graphrs NA%++- # ( 8 v&11)R@ V$ .#1#7#7#9 ~-/!!("3"34  H $: <=JJNN':;- Hrc4\rSrSrSr\"SS5urrrr Sr g) VertexColorizEnumeration of vertex coloursrr2r(N) r"r#r$r%r&r5redblackwhiteunknownr'r(rrrrs'#(A; S%rrc6\rSrSrSrSrSrSrSrSr Sr g ) rizintersite 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. cXlX l[RUl/Ul/Ul/Ul[5Ul Xl SUl Xl SUl SUlSUlg)NFr)r_rrrrrerrrrprrrrrr)rr_rs rrVertex.__init__s`   ((   !      rc^[RUlURRR 5HpupUR URR5nUcM/UR5(d[RUl g[RUlMr g)zGColor to indicate which kind of NC replica the vertex contains N) rrrr_ dsa_tablerget_current_replicarnc_dnstr is_partialrr)rdnstrdsareps r color_vertexVertex.color_vertexs|!&& ))--335JE))$))*<*<=C{>>##(__ (.. 6rc|UR[R:wdeUR[R:H$r\)rrrrrs rrn Vertex.is_reds-zz[00010 koo-.rc|UR[R:wdeUR[R:H$r\)rrrrrs rrqVertex.is_black/zz[00010 k///0rc|UR[R:wdeUR[R:H$r\)rrrrrs rrVertex.is_whiterr) rrrrrrerrrrrprr_N) r"r#r$r%r&rrrnrqrr'r(rrrrs  /6/11rrc\rSrSrSrSrSrg)riz$Graph for representing the intersitecl[5Ul[5Ul[5UlSUlgr\)rcrJrerdrrs rrIntersiteGraph.__init__s% U  "&r)rrdrerJNr"r#r$r%r&rr'r(rrrrs .'rrc\rSrSrSrSrSrg)ri zDefines a multi edge setc SUl/Ulg)Nr)rrers rrMultiEdgeSet.__init__s  r)rerNrr(rrrr s "rrc\rSrSrSrSrSrg)riz#An "edge" between multiple verticescZSUl/UlSUl[5UlSUlg)NT)rrJrfrrpr]rs rrMultiEdge.__init__s'  ! r)rfr]rprrJNrr(rrrrs -rrcH\rSrSrSrSrSrSrSrSr Sr S r S r S r g ) rizAn 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. cLXlX lX0lX@lXPlX`lgr\)rkrlrrprr)rrkrlredredrepleTypers rrInternalEdge.__init__$s   "rc[URURURURUR UR 45$r\)hashrkrlrrprrrs r__hash__InternalEdge.__hash__,s: GGTWWdllDNNDKK NN rc$X:+=(a X:+$r\r(rothers r__eq__InternalEdge.__eq__1s4$44rc X:=(d X:$r\r(rs r__ne__InternalEdge.__ne__4s|+u|+rc X:$r\r(rs r__gt__InternalEdge.__gt__7s |rc X:+$r\r(rs r__ge__InternalEdge.__ge__:s rc X:+$r\r(rs r__le__InternalEdge.__le__=s rcXURUR:wa UR$URRURR:wa-URRURR:$URRURR:wa-URRURR:$URR URR :wa-URR URR :$URR URR :wa-URR URR :$URUR:$)aZHere "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) ) rrprrrkrrrlrrs r__lt__InternalEdge.__lt__@s <<5== (<<  >>  %//"6"6 6>>&&)=)== = >> " "eoo&>&> >>>**U__-E-EE E 77<<588== (77))EHH,C,CC C 77<<588== (77))EHH,C,CC C{{U\\))r)rrrprrkrlN)r"r#r$r%r&rr rrrrrr!r'r(rrrrs/ # 5,  *rr)NFN),rHrsamba.kcc.graph_utilsrrrsamba.kcc.kcc_utilsr samba.ndrr samba.dcerpcrsamba.kcc.debugr r r r?objectrrrrErrrrjrhrrrrrirrrmrrrrrrrrrr(rrr)s, NN(11  6v6.($N<@E)-D!N 6&@@$4C,(  6(C@.#b%)P.:, ^/&/ <1V<1~'V'6>*6>*r