File: qnetd-algorithm.c

package info (click to toggle)
corosync-qdevice 3.0.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 3,516 kB
  • sloc: ansic: 22,520; sh: 11,882; makefile: 391
file content (232 lines) | stat: -rw-r--r-- 8,482 bytes parent folder | download | duplicates (4)
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
/*
 * Copyright (c) 2015-2017 Red Hat, Inc.
 *
 * All rights reserved.
 *
 * Author: Jan Friesse (jfriesse@redhat.com)
 *
 * This software licensed under BSD license, the text of which follows:
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * - Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright notice,
 *   this list of conditions and the following disclaimer in the documentation
 *   and/or other materials provided with the distribution.
 * - Neither the name of the Red Hat, Inc. nor the names of its
 *   contributors may be used to endorse or promote products derived from this
 *   software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
 * THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <sys/types.h>

#include "log.h"
#include "qnet-config.h"
#include "qnetd-algorithm.h"
#include "qnetd-algo-test.h"
#include "qnetd-algo-ffsplit.h"
#include "qnetd-algo-2nodelms.h"
#include "qnetd-algo-lms.h"

static struct qnetd_algorithm *qnetd_algorithm_array[QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE];

enum tlv_reply_error_code
qnetd_algorithm_client_init(struct qnetd_client *client)
{
	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_client_init unhandled decision algorithm");

		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->init(client));
}

enum tlv_reply_error_code
qnetd_algorithm_config_node_list_received(struct qnetd_client *client,
    uint32_t msg_seq_num, int config_version_set, uint64_t config_version,
    const struct node_list *nodes, int initial, enum tlv_vote *result_vote)
{
	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_config_node_list_received unhandled "
		    "decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->config_node_list_received(
		client, msg_seq_num,
		config_version_set, config_version, nodes, initial, result_vote));
}

enum tlv_reply_error_code
qnetd_algorithm_membership_node_list_received(struct qnetd_client *client,
    uint32_t msg_seq_num, const struct tlv_ring_id *ring_id,
    const struct node_list *nodes, enum tlv_heuristics heuristics, enum tlv_vote *result_vote)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_membership_node_list_received unhandled "
		    "decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->membership_node_list_received(
		client, msg_seq_num,
		ring_id, nodes, heuristics, result_vote));
}

enum tlv_reply_error_code
qnetd_algorithm_quorum_node_list_received(struct qnetd_client *client,
    uint32_t msg_seq_num, enum tlv_quorate quorate,
    const struct node_list *nodes, enum tlv_vote *result_vote)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "algorithm_quorum_node_list_received unhandled "
		    "decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->quorum_node_list_received(
		client, msg_seq_num, quorate, nodes, result_vote));
}

void
qnetd_algorithm_client_disconnect(struct qnetd_client *client, int server_going_down)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_client_disconnect unhandled decision "
		    "algorithm");
		return;
	}

	qnetd_algorithm_array[client->decision_algorithm]->client_disconnect(client, server_going_down);
}

enum tlv_reply_error_code
qnetd_algorithm_ask_for_vote_received(struct qnetd_client *client, uint32_t msg_seq_num,
    enum tlv_vote *result_vote)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_ask_for_vote_received unhandled "
		    "decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->ask_for_vote_received(
		client, msg_seq_num, result_vote));
}

enum tlv_reply_error_code
qnetd_algorithm_vote_info_reply_received(struct qnetd_client *client, uint32_t msg_seq_num)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_vote_info_reply_received unhandled decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->vote_info_reply_received(
		client, msg_seq_num));

}

enum tlv_reply_error_code
qnetd_algorithm_heuristics_change_received(struct qnetd_client *client, uint32_t msg_seq_num,
    enum tlv_heuristics heuristics, enum tlv_vote *result_vote)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_ask_for_vote_received unhandled "
		    "decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->heuristics_change_received(
		client, msg_seq_num, heuristics, result_vote));
}

enum tlv_reply_error_code
qnetd_algorithm_timer_callback(struct qnetd_client *client, int *reschedule_timer,
    int *send_vote, enum tlv_vote *result_vote)
{

	if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
	    qnetd_algorithm_array[client->decision_algorithm] == NULL) {
		log(LOG_CRIT, "qnetd_algorithm_timer_callback unhandled decision algorithm");
		return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
	}

	return (qnetd_algorithm_array[client->decision_algorithm]->timer_callback(
		client, reschedule_timer, send_vote, result_vote));
}

int
qnetd_algorithm_register(enum tlv_decision_algorithm_type algorithm_number,
    struct qnetd_algorithm *algorithm)
{

	if (algorithm_number >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE) {
		log(LOG_CRIT, "Failed to register unsupported decision algorithm %u",
		    algorithm_number);
		return (-1);
	}

	if (qnetd_algorithm_array[algorithm_number] != NULL) {
		log(LOG_CRIT, "Failed to register decision algorithm %u, "
		"it's already registered.", algorithm_number);
		return (-1);
	}

	qnetd_algorithm_array[algorithm_number] = algorithm;

	return (0);
}

int
qnetd_algorithm_register_all(void)
{

	if (qnetd_algo_test_register() != 0) {
		log(LOG_CRIT, "Failed to register decision algorithm 'test'");
		return (-1);
	}
	if (qnetd_algo_ffsplit_register() != 0) {
		log(LOG_CRIT, "Failed to register decision algorithm 'ffsplit'");
		return (-1);
	}
	if (qnetd_algo_2nodelms_register() != 0) {
		log(LOG_CRIT, "Failed to register decision algorithm '2nodelms'");
		return (-1);
	}
	if (qnetd_algo_lms_register() != 0) {
		log(LOG_CRIT, "Failed to register decision algorithm 'lms'");
		return (-1);
	}

	return (0);
}