1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099
|
/*
* JBoss, Home of Professional Open Source.
* Copyright 2006, Red Hat Middleware LLC, and individual contributors
* as indicated by the @author tags. See the copyright.txt file in the
* distribution for a full listing of individual contributors.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.jboss.ha.framework.server;
import java.util.Set;
import java.util.Vector;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.io.Serializable;
import javax.management.MBeanServer;
import javax.management.ObjectName;
import EDU.oswego.cs.dl.util.concurrent.Latch;
import java.util.concurrent.ConcurrentHashMap;
import org.jboss.logging.Logger;
import org.jboss.ha.framework.interfaces.ClusterMergeStatus;
import org.jboss.ha.framework.interfaces.ClusterNode;
import org.jboss.ha.framework.interfaces.DistributedReplicantManager;
import org.jboss.ha.framework.interfaces.HAPartition;
/**
* This class manages replicated objects.
*
* @author <a href="mailto:bill@burkecentral.com">Bill Burke</a>.
* @author <a href="mailto:sacha.labourey@cogito-info.ch">Sacha Labourey</a>.
* @author Scott.stark@jboss.org
* @version $Revision: 69143 $
*/
public class DistributedReplicantManagerImpl
implements DistributedReplicantManagerImplMBean,
HAPartition.HAMembershipExtendedListener,
HAPartition.HAPartitionStateTransfer,
AsynchEventHandler.AsynchEventProcessor
{
// Constants -----------------------------------------------------
protected final static String SERVICE_NAME = "DistributedReplicantManager";
// Attributes ----------------------------------------------------
protected static int threadID;
protected ConcurrentHashMap localReplicants = new ConcurrentHashMap();
protected ConcurrentHashMap replicants = new ConcurrentHashMap();
protected ConcurrentHashMap keyListeners = new ConcurrentHashMap();
protected HashMap intraviewIdCache = new HashMap();
protected HAPartition partition;
/** The handler used to send replicant change notifications asynchronously */
protected AsynchEventHandler asynchHandler;
protected Logger log;
protected MBeanServer mbeanserver;
protected ObjectName jmxName;
protected String nodeName = null;
protected Latch partitionNameKnown = new Latch ();
protected boolean trace;
protected Class[] add_types=new Class[]{String.class, String.class, Serializable.class};
protected Class[] remove_types=new Class[]{String.class, String.class};
// Static --------------------------------------------------------
// Constructors --------------------------------------------------
/**
* This class manages replicated objects through the given partition
*
* @param partition {@link HAPartition} through which replicated objects will be exchanged
*/
public DistributedReplicantManagerImpl(HAPartition partition, MBeanServer server)
{
this.partition = partition;
this.mbeanserver = server;
this.log = Logger.getLogger(DistributedReplicantManagerImpl.class.getName() + "." + partition.getPartitionName());
this.trace = log.isTraceEnabled();
// JBAS-5068 Create the handler early so we don't risk NPEs
this.asynchHandler = new AsynchEventHandler(this, "AsynchKeyChangeHandler");
}
// Public --------------------------------------------------------
public void init() throws Exception
{
log.debug("registerRPCHandler");
partition.registerRPCHandler(SERVICE_NAME, this);
log.debug("subscribeToStateTransferEvents");
partition.subscribeToStateTransferEvents(SERVICE_NAME, this);
log.debug("registerMembershipListener");
partition.registerMembershipListener(this);
// subscribed this "sub-service" of HAPartition with JMX
// TODO: In the future (when state transfer issues will be completed),
// we will need to redesign the way HAPartitions and its sub-protocols are
// registered with JMX. They will most probably be independant JMX services.
//
String name = "jboss:service=" + SERVICE_NAME +
",partitionName=" + this.partition.getPartitionName();
this.jmxName = new javax.management.ObjectName(name);
this.mbeanserver.registerMBean(this, jmxName);
}
public void start() throws Exception
{
this.nodeName = this.partition.getNodeName ();
asynchHandler.start();
partitionNameKnown.release (); // partition name is now known!
//log.info("mergemembers");
//mergeMembers();
}
public void stop() throws Exception
{
// BES 200604 -- implication of NR's JBLCUSTER-38 change. Moving to
// destroy allows restart of HAPartition while local registrations
// survive -- stopping partition does not stop all registered services
// e.g. ejbs; if we maintain their registrations we can pass them to
// the cluster when we restart. However, we are leaving all the remote
// replicants we have registered around, so they will still be included
// as targets if anyone contacts our EJB while partition is stopped.
// Probably OK; if they aren't valid the client will find this out.
// NR 200505 : [JBCLUSTER-38] move to destroy
// if (localReplicants != null)
// {
// synchronized(localReplicants)
// {
// while (! localReplicants.isEmpty ())
// {
// this.remove ((String)localReplicants.keySet().iterator().next ());
// }
// }
// }
// Stop the asynch handler thread
try
{
asynchHandler.stop();
}
catch( Exception e)
{
log.warn("Failed to stop asynchHandler", e);
}
// NR 200505 : [JBCLUSTER-38] move to destroy
// this.mbeanserver.unregisterMBean (this.jmxName);
}
// NR 200505 : [JBCLUSTER-38] unbind at destroy
public void destroy() throws Exception
{
// now partition can't be resuscitated, so remove local replicants
if (localReplicants != null)
{
synchronized(localReplicants)
{
String[] keys = new String[localReplicants.size()];
localReplicants.keySet().toArray(keys);
for(int n = 0; n < keys.length; n ++)
{
this.removeLocal(keys[n]); // channel is disconnected, so
// don't try to notify cluster
}
}
}
this.mbeanserver.unregisterMBean (this.jmxName);
partition.unregisterRPCHandler(SERVICE_NAME, this);
partition.unsubscribeFromStateTransferEvents(SERVICE_NAME, this);
partition.unregisterMembershipListener(this);
}
public String listContent () throws Exception
{
// we merge all replicants services: local only or not
//
java.util.Collection services = this.getAllServices ();
StringBuffer result = new StringBuffer ();
java.util.Iterator catsIter = services.iterator ();
result.append ("<pre>");
while (catsIter.hasNext ())
{
String category = (String)catsIter.next ();
HashMap content = (HashMap)this.replicants.get (category);
if (content == null)
content = new HashMap ();
java.util.Iterator keysIter = content.keySet ().iterator ();
result.append ("-----------------------------------------------\n");
result.append ("Service : ").append (category).append ("\n\n");
Serializable local = lookupLocalReplicant(category);
if (local == null)
result.append ("\t- Service is *not* available locally\n");
else
result.append ("\t- Service *is* also available locally\n");
while (keysIter.hasNext ())
{
String location = (String)keysIter.next ();
result.append ("\t- ").append(location).append ("\n");
}
result.append ("\n");
}
result.append ("</pre>");
return result.toString ();
}
public String listXmlContent () throws Exception
{
// we merge all replicants services: local only or not
//
java.util.Collection services = this.getAllServices ();
StringBuffer result = new StringBuffer ();
result.append ("<ReplicantManager>\n");
java.util.Iterator catsIter = services.iterator ();
while (catsIter.hasNext ())
{
String category = (String)catsIter.next ();
HashMap content = (HashMap)this.replicants.get (category);
if (content == null)
content = new HashMap ();
java.util.Iterator keysIter = content.keySet ().iterator ();
result.append ("\t<Service>\n");
result.append ("\t\t<ServiceName>").append (category).append ("</ServiceName>\n");
Serializable local = lookupLocalReplicant(category);
if (local != null)
{
result.append ("\t\t<Location>\n");
result.append ("\t\t\t<Name local=\"True\">").append (this.nodeName).append ("</Name>\n");
result.append ("\t\t</Location>\n");
}
while (keysIter.hasNext ())
{
String location = (String)keysIter.next ();
result.append ("\t\t<Location>\n");
result.append ("\t\t\t<Name local=\"False\">").append (location).append ("</Name>\n");
result.append ("\t\t</Location>\n");
}
result.append ("\t<Service>\n");
}
result.append ("<ReplicantManager>\n");
return result.toString ();
}
// HAPartition.HAPartitionStateTransfer implementation ----------------------------------------------
public Serializable getCurrentState ()
{
java.util.Collection services = this.getAllServices ();
HashMap result = new HashMap ();
java.util.Iterator catsIter = services.iterator ();
while (catsIter.hasNext ())
{
String category = (String)catsIter.next ();
HashMap content = (HashMap)this.replicants.get (category);
if (content == null)
content = new HashMap ();
else
content = (HashMap)content.clone ();
Serializable local = lookupLocalReplicant(category);
if (local != null)
content.put (this.nodeName, local);
result.put (category, content);
}
// we add the intraviewid cache to the global result
//
Object[] globalResult = new Object[] {result, intraviewIdCache};
return globalResult;
}
public void setCurrentState(Serializable newState)
{
Object[] globalState = (Object[])newState;
HashMap map = (HashMap)globalState[0];
this.replicants.putAll(map);
this.intraviewIdCache = (HashMap)globalState[1];
if( trace )
{
log.trace(nodeName + ": received new state, will republish local replicants");
}
MembersPublisher publisher = new MembersPublisher();
publisher.start();
}
public Collection getAllServices ()
{
HashSet services = new HashSet();
services.addAll (localReplicants.keySet ());
services.addAll (replicants.keySet ());
return services;
}
// HAPartition.HAMembershipListener implementation ----------------------------------------------
public void membershipChangedDuringMerge(Vector deadMembers, Vector newMembers, Vector allMembers, Vector originatingGroups)
{
// Here we only care about deadMembers. Purge all replicant lists of deadMembers
// and then notify all listening nodes.
//
log.info("Merging partitions...");
log.info("Dead members: " + deadMembers.size());
log.info("Originating groups: " + originatingGroups);
purgeDeadMembers(deadMembers);
if (newMembers.size() > 0)
{
new MergeMembers().start();
}
}
public void membershipChanged(Vector deadMembers, Vector newMembers, Vector allMembers)
{
// Here we only care about deadMembers. Purge all replicant lists of deadMembers
// and then notify all listening nodes.
//
log.info("I am (" + nodeName + ") received membershipChanged event:");
log.info("Dead members: " + deadMembers.size() + " (" + deadMembers + ")");
log.info("New Members : " + newMembers.size() + " (" + newMembers + ")");
log.info("All Members : " + allMembers.size() + " (" + allMembers + ")");
purgeDeadMembers(deadMembers);
// we don't need to merge members anymore
}
// AsynchEventHandler.AsynchEventProcessor implementation -----------------
public void processEvent(Object event)
{
KeyChangeEvent kce = (KeyChangeEvent) event;
notifyKeyListeners(kce.key, kce.replicants);
}
static class KeyChangeEvent
{
String key;
List replicants;
}
// DistributedReplicantManager implementation ----------------------------------------------
public void add(String key, Serializable replicant) throws Exception
{
if( trace )
log.trace("add, key="+key+", value="+replicant);
partitionNameKnown.acquire (); // we don't propagate until our name is known
Object[] args = {key, this.nodeName, replicant};
partition.callMethodOnCluster(SERVICE_NAME, "_add", args, add_types, true);
synchronized(localReplicants)
{
localReplicants.put(key, replicant);
notifyKeyListeners(key, lookupReplicants(key));
}
}
public void remove(String key) throws Exception
{
partitionNameKnown.acquire (); // we don't propagate until our name is known
// optimisation: we don't make a costly network call
// if there is nothing to remove
if (localReplicants.containsKey(key))
{
Object[] args = {key, this.nodeName};
partition.callAsynchMethodOnCluster(SERVICE_NAME, "_remove", args, remove_types, true);
removeLocal(key);
}
}
protected void removeLocal(String key)
{
synchronized(localReplicants)
{
localReplicants.remove(key);
List result = lookupReplicants(key);
if (result == null)
result = new ArrayList (); // don't pass null but an empty list
notifyKeyListeners(key, result);
}
}
public Serializable lookupLocalReplicant(String key)
{
return (Serializable)localReplicants.get(key);
}
public List lookupReplicants(String key)
{
Serializable local = lookupLocalReplicant(key);
HashMap replicant = (HashMap)replicants.get(key);
if (replicant == null && local == null)
return null;
ArrayList rtn = new ArrayList();
if (replicant == null)
{
if (local != null)
rtn.add(local);
}
else
{
// JBAS-2677. Put the replicants in view order.
ClusterNode[] nodes = partition.getClusterNodes();
String replNode;
Object replVal;
for (int i = 0; i < nodes.length; i++)
{
replNode = nodes[i].getName();
if (local != null && nodeName.equals(replNode))
{
rtn.add(local);
continue;
}
replVal = replicant.get(replNode);
if (replVal != null)
rtn.add(replVal);
}
}
return rtn;
}
public List lookupReplicantsNodeNames(String key)
{
boolean locallyReplicated = localReplicants.containsKey (key);
HashMap replicant = (HashMap)replicants.get(key);
if (replicant == null && !locallyReplicated)
return null;
ArrayList rtn = new ArrayList();
if (replicant == null)
{
if (locallyReplicated)
rtn.add(this.nodeName);
}
else
{
// JBAS-2677. Put the replicants in view order.
Set keys = replicant.keySet();
ClusterNode[] nodes = partition.getClusterNodes();
String keyOwner;
for (int i = 0; i < nodes.length; i++)
{
keyOwner = nodes[i].getName();
if (locallyReplicated && nodeName.equals(keyOwner))
{
rtn.add(this.nodeName);
continue;
}
if (keys.contains(keyOwner))
rtn.add(keyOwner);
}
}
return rtn;
}
public void registerListener(String key, DistributedReplicantManager.ReplicantListener subscriber)
{
synchronized(keyListeners)
{
ArrayList listeners = (ArrayList)keyListeners.get(key);
if (listeners == null)
{
listeners = new ArrayList();
keyListeners.put(key, listeners);
}
listeners.add(subscriber);
}
}
public void unregisterListener(String key, DistributedReplicantManager.ReplicantListener subscriber)
{
synchronized(keyListeners)
{
ArrayList listeners = (ArrayList)keyListeners.get (key);
if (listeners == null) return;
listeners.remove(subscriber);
if (listeners.size() == 0)
keyListeners.remove(key);
}
}
public int getReplicantsViewId(String key)
{
Integer result = (Integer)this.intraviewIdCache.get (key);
if (result == null)
return 0;
else
return result.intValue ();
}
public boolean isMasterReplica (String key)
{
if( trace )
log.trace("isMasterReplica, key="+key);
// if I am not a replicat, I cannot be the master...
//
if (!localReplicants.containsKey (key))
{
if( trace )
log.trace("no localReplicants, key="+key+", isMasterReplica=false");
return false;
}
Vector allNodes = this.partition.getCurrentView ();
HashMap repForKey = (HashMap)replicants.get(key);
if (repForKey==null)
{
if( trace )
log.trace("no replicants, key="+key+", isMasterReplica=true");
return true;
}
Vector replicaNodes = new Vector ((repForKey).keySet ());
boolean isMasterReplica = false;
for (int i=0; i<allNodes.size (); i++)
{
String aMember = (String)allNodes.elementAt (i);
if( trace )
log.trace("Testing member: "+aMember);
if (replicaNodes.contains (aMember))
{
if( trace )
log.trace("Member found in replicaNodes, isMasterReplica=false");
break;
}
else if (aMember.equals (this.nodeName))
{
if( trace )
log.trace("Member == nodeName, isMasterReplica=true");
isMasterReplica = true;
break;
}
}
return isMasterReplica;
}
// DistributedReplicantManager cluster callbacks ----------------------------------------------
/**
* Cluster callback called when a new replicant is added on another node
* @param key Replicant key
* @param nodeName Node that add the current replicant
* @param replicant Serialized representation of the replicant
*/
public void _add(String key, String nodeName, Serializable replicant)
{
if( trace )
log.trace("_add(" + key + ", " + nodeName);
try
{
addReplicant(key, nodeName, replicant);
// Notify listeners asynchronously
KeyChangeEvent kce = new KeyChangeEvent();
kce.key = key;
kce.replicants = lookupReplicants(key);
asynchHandler.queueEvent(kce);
}
catch (Exception ex)
{
log.error("_add failed", ex);
}
}
/**
* Cluster callback called when a replicant is removed by another node
* @param key Name of the replicant key
* @param nodeName Node that wants to remove its replicant for the give key
*/
public void _remove(String key, String nodeName)
{
try
{
if (removeReplicant (key, nodeName)) {
// Notify listeners asynchronously
KeyChangeEvent kce = new KeyChangeEvent();
kce.key = key;
kce.replicants = lookupReplicants(key);
asynchHandler.queueEvent(kce);
}
}
catch (Exception ex)
{
log.error("_remove failed", ex);
}
}
protected boolean removeReplicant (String key, String nodeName) throws Exception
{
synchronized(replicants)
{
HashMap replicant = (HashMap)replicants.get(key);
if (replicant == null) return false;
Object removed = replicant.remove(nodeName);
if (removed != null)
{
Collection values = replicant.values();
if (values.size() == 0)
{
replicants.remove(key);
}
return true;
}
}
return false;
}
/**
* Cluster callback called when a node wants to know our complete list of local replicants
* @throws Exception Thrown if a cluster communication exception occurs
* @return A java array of size 2 containing the name of our node in this cluster and the serialized representation of our state
*/
public Object[] lookupLocalReplicants() throws Exception
{
partitionNameKnown.acquire (); // we don't answer until our name is known
Object[] rtn = {this.nodeName, localReplicants};
if( trace )
log.trace ("lookupLocalReplicants called ("+ rtn[0] + "). Return: " + localReplicants.size ());
return rtn;
}
// Package protected ---------------------------------------------
// Protected -----------------------------------------------------
protected int calculateReplicantsHash (List members)
{
int result = 0;
Object obj = null;
for (int i=0; i<members.size (); i++)
{
obj = members.get (i);
if (obj != null)
result+= obj.hashCode (); // no explicit overflow with int addition
}
return result;
}
protected int updateReplicantsHashId (String key)
{
// we first get a list of all nodes names that replicate this key
//
List nodes = this.lookupReplicantsNodeNames (key);
int result = 0;
if ( (nodes == null) || (nodes.size () == 0) )
{
// no nore replicants for this key: we uncache our view id
//
this.intraviewIdCache.remove (key);
}
else
{
result = this.calculateReplicantsHash (nodes);
this.intraviewIdCache.put (key, new Integer (result));
}
return result;
}
///////////////
// DistributedReplicantManager API
///////////////
/**
* Add a replicant to the replicants map.
* @param key replicant key name
* @param nodeName name of the node that adds this replicant
* @param replicant Serialized representation of the replica
*/
protected void addReplicant(String key, String nodeName, Serializable replicant)
{
addReplicant(replicants, key, nodeName, replicant);
}
/**
* Logic for adding replicant to any map.
* @param map structure in which adding the new replicant
* @param key name of the replicant key
* @param nodeName name of the node adding the replicant
* @param replicant serialized representation of the replicant that is added
*/
protected void addReplicant(Map map, String key, String nodeName, Serializable replicant)
{
synchronized(map)
{
HashMap rep = (HashMap)map.get(key);
if (rep == null)
{
if( trace )
log.trace("_adding new HashMap");
rep = new HashMap();
map.put(key, rep);
}
rep.put(nodeName, replicant);
}
}
protected Vector getKeysReplicatedByNode (String nodeName)
{
Vector result = new Vector ();
synchronized (replicants)
{
Iterator keysIter = replicants.keySet ().iterator ();
while (keysIter.hasNext ())
{
String key = (String)keysIter.next ();
HashMap values = (HashMap)replicants.get (key);
if ( (values != null) && values.containsKey (nodeName) )
{
result.add (key);
}
}
}
return result;
}
/**
* Indicates if the a replicant already exists for a given key/node pair
* @param key replicant key name
* @param nodeName name of the node
* @return a boolean indicating if a replicant for the given node exists for the given key
*/
protected boolean replicantEntryAlreadyExists (String key, String nodeName)
{
return replicantEntryAlreadyExists (replicants, key, nodeName);
}
/**
* Indicates if the a replicant already exists for a given key/node pair in the give data structure
*/
protected boolean replicantEntryAlreadyExists (Map map, String key, String nodeName)
{
HashMap rep = (HashMap)map.get(key);
if (rep == null)
return false;
else
return rep.containsKey (nodeName);
}
/**
* Notifies, through a callback, the listeners for a given replicant that the set of replicants has changed
* @param key The replicant key name
* @param newReplicants The new list of replicants
*
*/
protected void notifyKeyListeners(String key, List newReplicants)
{
if( trace )
log.trace("notifyKeyListeners");
// we first update the intra-view id for this particular key
//
int newId = updateReplicantsHashId (key);
ArrayList listeners = (ArrayList)keyListeners.get(key);
if (listeners == null)
{
if( trace )
log.trace("listeners is null");
return;
}
// ArrayList's iterator is not thread safe
DistributedReplicantManager.ReplicantListener[] toNotify = null;
synchronized(listeners)
{
toNotify = new DistributedReplicantManager.ReplicantListener[listeners.size()];
toNotify = (DistributedReplicantManager.ReplicantListener[]) listeners.toArray(toNotify);
}
if( trace )
log.trace("notifying " + toNotify.length + " listeners for key change: " + key);
for (int i = 0; i < toNotify.length; i++)
{
if (toNotify[i] != null)
toNotify[i].replicantsChanged(key, newReplicants, newId);
}
}
protected void republishLocalReplicants()
{
try
{
if( trace )
log.trace("Start Re-Publish local replicants in DRM");
HashMap localReplicants;
synchronized (this.localReplicants)
{
localReplicants = new HashMap(this.localReplicants);
}
Iterator entries = localReplicants.entrySet().iterator();
while( entries.hasNext() )
{
Map.Entry entry = (Map.Entry) entries.next();
String key = (String) entry.getKey();
Object replicant = entry.getValue();
if (replicant != null)
{
if( trace )
log.trace("publishing, key=" + key + ", value=" + replicant);
Object[] args = {key, this.nodeName, replicant};
partition.callAsynchMethodOnCluster(SERVICE_NAME, "_add", args, add_types, true);
notifyKeyListeners(key, lookupReplicants(key));
}
}
if( trace )
log.trace("End Re-Publish local replicants");
}
catch (Exception e)
{
log.error("Re-Publish failed", e);
}
}
////////////////////
// Group membership API
////////////////////
protected void mergeMembers()
{
boolean isAlreadyMerging = ClusterMergeStatus.isMergeInProcess();
try
{
ClusterMergeStatus.startMergeProcess();
log.debug("Start merging members in DRM service...");
java.util.HashSet notifies = new java.util.HashSet ();
ArrayList rsp = partition.callMethodOnCluster(SERVICE_NAME,
"lookupLocalReplicants",
new Object[]{}, new Class[]{}, true);
if (rsp.size() == 0)
log.debug("No responses from other nodes during the DRM merge process.");
else
{
log.debug("The DRM merge process has received " + rsp.size() + " answers");
}
for (int i = 0; i < rsp.size(); i++)
{
Object o = rsp.get(i);
if (o == null)
{
log.warn("As part of the answers received during the DRM merge process, a NULL message was received!");
continue;
}
else if (o instanceof Throwable)
{
log.warn("As part of the answers received during the DRM merge process, a Throwable was received!", (Throwable) o);
continue;
}
Object[] objs = (Object[]) o;
String node = (String)objs[0];
Map replicants = (Map)objs[1];
Iterator keys = replicants.keySet().iterator();
//FIXME: We don't remove keys in the merge process but only add new keys!
while (keys.hasNext())
{
String key = (String)keys.next();
// done to reduce duplicate notifications
if (!replicantEntryAlreadyExists (key, node))
{
addReplicant(key, node, (Serializable)replicants.get(key));
notifies.add (key);
}
}
Vector currentStatus = getKeysReplicatedByNode (node);
if (currentStatus.size () > replicants.size ())
{
// The merge process needs to remove some (now)
// unexisting keys
//
for (int currentKeysId=0, currentKeysMax=currentStatus.size (); currentKeysId<currentKeysMax; currentKeysId++)
{
String theKey = (String)currentStatus.elementAt (currentKeysId);
if (!replicants.containsKey (theKey))
{
removeReplicant (theKey, node);
notifies.add(theKey);
}
}
}
}
Iterator notifIter = notifies.iterator ();
while (notifIter.hasNext ())
{
String key = (String)notifIter.next ();
notifyKeyListeners(key, lookupReplicants(key));
}
log.debug ("..Finished merging members in DRM service");
}
catch (Exception ex)
{
log.error("merge failed", ex);
}
finally
{
if (!isAlreadyMerging)
ClusterMergeStatus.endMergeProcess();
}
}
/**
* get rid of dead members from replicant list
* return true if anything was purged.
*/
protected void purgeDeadMembers(Vector deadMembers)
{
if (deadMembers.size() <= 0)
return;
log.debug("purgeDeadMembers, "+deadMembers);
try
{
synchronized(replicants)
{
Iterator keys = replicants.keySet().iterator();
while (keys.hasNext())
{
String key = (String)keys.next();
HashMap replicant = (HashMap)replicants.get(key);
boolean modified = false;
for (int i = 0; i < deadMembers.size(); i++)
{
String node = deadMembers.elementAt(i).toString();
log.debug("trying to remove deadMember " + node + " for key " + key);
Object removed = replicant.remove(node);
if (removed != null)
{
log.debug(node + " was removed");
modified = true;
}
else
{
log.debug(node + " was NOT removed!!!");
}
}
if (modified)
{
notifyKeyListeners(key, lookupReplicants(key));
}
}
}
}
catch (Exception ex)
{
log.error("purgeDeadMembers failed", ex);
}
}
/**
*/
protected void cleanupKeyListeners()
{
// NOT IMPLEMENTED YET
}
protected synchronized static int nextThreadID()
{
return threadID ++;
}
// Private -------------------------------------------------------
// Inner classes -------------------------------------------------
protected class MergeMembers extends Thread
{
public MergeMembers()
{
super("DRM Async Merger#"+nextThreadID());
}
/**
* Called when the service needs to merge with another partition. This
* process is performed asynchronously
*/
public void run()
{
log.debug("Sleeping for 50ms before mergeMembers");
try
{
// if this thread invokes a cluster method call before
// membershipChanged event completes, it could timeout/hang
// we need to discuss this with Bela.
Thread.sleep(50);
}
catch (Exception ignored)
{
}
mergeMembers();
}
}
protected class MembersPublisher extends Thread
{
public MembersPublisher()
{
super("DRM Async Publisher#"+nextThreadID());
}
/**
* Called when service needs to re-publish its local replicants to other
* cluster members after this node has joined the cluster.
*/
public void run()
{
log.debug("DRM: Sleeping before re-publishing for 50ms just in case");
try
{
// if this thread invokes a cluster method call before
// membershipChanged event completes, it could timeout/hang
// we need to discuss this with Bela.
Thread.sleep(50);
}
catch (Exception ignored)
{
}
republishLocalReplicants();
}
}
}
|