Package org.voltcore.messaging

Examples of org.voltcore.messaging.FaultMessage

472
473
474
475
476
477
478
479
480
481
482
            } else if (m.getSubject() == Subject.FAILURE.getId()) {
                /*
                 * If the fault distributor reports a new fault, ignore it if it is known , otherwise
                 * re-deliver the message to ourself and then abort so that the process can restart.
                 */
                FaultMessage fm = (FaultMessage)m;

                Discard ignoreIt = mayIgnore(hsIds,fm);
                if (Discard.DoNot == ignoreIt) {
                    m_mailbox.deliverFront(m);
                    m_recoveryLog.info("Agreement, Detected a concurrent failure from FaultDistributor, new failed site "
View Full Code Here
539
540
541
542
543
544
545
546
547
548
549
                            " data from failed initiatorSiteId: " + transactionState.initiatorHSId);
                }
            }

        } else if (message instanceof FaultMessage) {
            FaultMessage fm = (FaultMessage)message;
            discoverGlobalFaultData(fm);

        } else if (message instanceof RecoveryMessage) {
            RecoveryMessage rm = (RecoveryMessage)message;
            assert(m_recoverBeforeTxn == null);
View Full Code Here
728
729
730
731
732
733
734
735
736
        m_mailbox.deliverFront(lom);
        return sem;
    }

    public void reportFault(long faultingSite) {
        FaultMessage fm = new FaultMessage(m_hsId,faultingSite);
        fm.m_sourceHSId = m_hsId;
        m_mailbox.deliver(fm);
    }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 0L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 2L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 3L))))
            ;

        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(1L,11L));
    }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 0L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 2L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 3L))))
            ;

        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1),sfmSurvived(0,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(1L,11L));

        reset(mbox);
        when(mbox.recvBlocking(any(Subject[].class),eq(5L)))
            .thenReturn(make(siteTwoSfm.but(with(sfmSource,0L))))
            .thenReturn(make(siteTwoSfm.but(with(sfmSource,3L))))
        ;

        decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,2));

        verify(mbox,never()).deliverFront(any(VoltMessage.class));
        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(2), sfmSurvived(0,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(2L,22L));
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
        when(aide.getNewestSafeTransactionForInitiator(1L)).thenReturn(11L);
        when(aide.getNewestSafeTransactionForInitiator(2L)).thenReturn(22L);

        when(mbox.recv(any(Subject[].class)))
            .thenReturn(new FaultMessage(0,2))
            .thenReturn((VoltMessage)null);
        when(mbox.recvBlocking(any(Subject[].class), eq(5L)))
            .thenReturn(make(site12Sfm.but(with(sfmSource, 0L))))
            .thenReturn(make(site12Sfm.but(with(sfmSource, 3L))))
            ;

        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1,2), sfmSurvived(0,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(1L,11L,2L,22L));
    }
View Full Code Here
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
        when(aide.getNewestSafeTransactionForInitiator(1L)).thenReturn(11L);
        when(aide.getNewestSafeTransactionForInitiator(2L)).thenReturn(22L);
        when(mbox.recvBlocking(any(Subject[].class), eq(5L)))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 0L))))
            .thenReturn(new FaultMessage(0,2L))
            ;

        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(1)).deliverFront(any(VoltMessage.class));
        verify(mbox,times(1)).send(any(long[].class), any(VoltMessage.class));
        verify(mbox).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of());

        reset(mbox);
        when(mbox.recvBlocking(any(Subject[].class),eq(5L)))
            .thenReturn(make(siteOneSfm.but(with(sfmSource,3L))))
            .thenReturn(make(siteTwoSfm.but(with(sfmSource,0L))))
            .thenReturn(make(siteTwoSfm.but(with(sfmSource,3L))))
        ;

        decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,2));

        verify(mbox,never()).deliverFront(any(VoltMessage.class));
        verify(mbox,times(2)).send(any(long[].class), any(VoltMessage.class));
        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1,2),sfmSurvived(0,3))));
View Full Code Here
248
249
250
251
252
253
254
255
256
257
258
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 0L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 2L))))
            .thenReturn(make(siteOneSfm.but(with(sfmSource, 3L))))
            ;

        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,2,3))));
        verify(aide,atLeast(2)).sendHeartbeats(destinationCaptor.capture());
        assertEquals(destinationCaptor.getValue(), sfmSurvived(0,2,3));
View Full Code Here
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
        when(aide.getNewestSafeTransactionForInitiator(1L)).thenReturn(11L);

        when(mbox.recvBlocking(any(Subject[].class), eq(5L)))
            .thenReturn(make(um.but(with(sfmSource, 2L))))
            .thenReturn(new FaultMessage(0,1))
        ;
        Map<Long,Long> decision =
                arbiter.reconfigureOnFault(hsids, new FaultMessage(2,1,ImmutableSet.of(0L,2L,3L)));

        verify(mbox,times(1)).deliverFront(any(VoltMessage.class));
        verify(mbox,times(1)).send(any(long[].class), any(VoltMessage.class));
        verify(mbox).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,1,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of());

        reset(mbox);
        when(mbox.recvBlocking(any(Subject[].class), eq(5L)))
            .thenReturn(make(um.but(with(sfmSource, 0L))))
            .thenReturn(make(um.but(with(sfmSource, 3L))))
        ;
        decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,never()).deliverFront(any(VoltMessage.class));
        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(1L,11L));
View Full Code Here
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
        when(aide.getNewestSafeTransactionForInitiator(0L)).thenReturn(10L);
        when(aide.getNewestSafeTransactionForInitiator(1L)).thenReturn(11L);

        when(mbox.recvBlocking(any(Subject[].class), eq(5L)))
            .thenReturn(make(s23f.but(with(sfmSource,2L),with(sfmFailures,sfmFailed(0)))))
            .thenReturn(new FaultMessage(2L,0L,ImmutableSet.of(1L,2L,3L)))
            .thenReturn(make(s1f.but(with(sfmSource,0L))))
            .thenReturn(make(s23f.but(with(sfmSource,2L))))
            .thenReturn(make(s23f.but(with(sfmSource,3L))))
            .thenReturn(make(uf.but(with(fsfmSource,2L),with(fsfmMsg,s0f))))
            .thenReturn(make(uf.but(with(fsfmSource,3L),with(fsfmMsg,s0f))))
        ;
        Map<Long,Long> decision = arbiter.reconfigureOnFault(hsids, new FaultMessage(0,1));

        verify(mbox,times(0)).deliverFront(any(VoltMessage.class));
        verify(mbox,times(2)).send(any(long[].class), argThat(siteFailureIs(sfmFailed(1), sfmSurvived(0,2,3))));

        assertEquals(decision,ImmutableMap.<Long,Long>of(1L,11L));
View Full Code Here
TOP

Related Classes of org.voltcore.messaging.FaultMessage

  • org.voltcore.agreement.AgreementSite
  • org.voltcore.agreement.MeshArbiter
  • org.voltcore.agreement.MiniSite
  • org.voltcore.agreement.TestMeshArbiter
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.