xref: /openbmc/linux/net/hsr/hsr_framereg.c (revision 6197e5b7)
1 // SPDX-License-Identifier: GPL-2.0
2 /* Copyright 2011-2014 Autronica Fire and Security AS
3  *
4  * Author(s):
5  *	2011-2014 Arvid Brodin, arvid.brodin@alten.se
6  *
7  * The HSR spec says never to forward the same frame twice on the same
8  * interface. A frame is identified by its source MAC address and its HSR
9  * sequence number. This code keeps track of senders and their sequence numbers
10  * to allow filtering of duplicate frames, and to detect HSR ring errors.
11  * Same code handles filtering of duplicates for PRP as well.
12  */
13 
14 #include <linux/if_ether.h>
15 #include <linux/etherdevice.h>
16 #include <linux/slab.h>
17 #include <linux/rculist.h>
18 #include "hsr_main.h"
19 #include "hsr_framereg.h"
20 #include "hsr_netlink.h"
21 
22 /*	TODO: use hash lists for mac addresses (linux/jhash.h)?    */
23 
24 /* seq_nr_after(a, b) - return true if a is after (higher in sequence than) b,
25  * false otherwise.
26  */
27 static bool seq_nr_after(u16 a, u16 b)
28 {
29 	/* Remove inconsistency where
30 	 * seq_nr_after(a, b) == seq_nr_before(a, b)
31 	 */
32 	if ((int)b - a == 32768)
33 		return false;
34 
35 	return (((s16)(b - a)) < 0);
36 }
37 
38 #define seq_nr_before(a, b)		seq_nr_after((b), (a))
39 #define seq_nr_before_or_eq(a, b)	(!seq_nr_after((a), (b)))
40 
41 bool hsr_addr_is_self(struct hsr_priv *hsr, unsigned char *addr)
42 {
43 	struct hsr_node *node;
44 
45 	node = list_first_or_null_rcu(&hsr->self_node_db, struct hsr_node,
46 				      mac_list);
47 	if (!node) {
48 		WARN_ONCE(1, "HSR: No self node\n");
49 		return false;
50 	}
51 
52 	if (ether_addr_equal(addr, node->macaddress_A))
53 		return true;
54 	if (ether_addr_equal(addr, node->macaddress_B))
55 		return true;
56 
57 	return false;
58 }
59 
60 /* Search for mac entry. Caller must hold rcu read lock.
61  */
62 static struct hsr_node *find_node_by_addr_A(struct list_head *node_db,
63 					    const unsigned char addr[ETH_ALEN])
64 {
65 	struct hsr_node *node;
66 
67 	list_for_each_entry_rcu(node, node_db, mac_list) {
68 		if (ether_addr_equal(node->macaddress_A, addr))
69 			return node;
70 	}
71 
72 	return NULL;
73 }
74 
75 /* Helper for device init; the self_node_db is used in hsr_rcv() to recognize
76  * frames from self that's been looped over the HSR ring.
77  */
78 int hsr_create_self_node(struct hsr_priv *hsr,
79 			 unsigned char addr_a[ETH_ALEN],
80 			 unsigned char addr_b[ETH_ALEN])
81 {
82 	struct list_head *self_node_db = &hsr->self_node_db;
83 	struct hsr_node *node, *oldnode;
84 
85 	node = kmalloc(sizeof(*node), GFP_KERNEL);
86 	if (!node)
87 		return -ENOMEM;
88 
89 	ether_addr_copy(node->macaddress_A, addr_a);
90 	ether_addr_copy(node->macaddress_B, addr_b);
91 
92 	spin_lock_bh(&hsr->list_lock);
93 	oldnode = list_first_or_null_rcu(self_node_db,
94 					 struct hsr_node, mac_list);
95 	if (oldnode) {
96 		list_replace_rcu(&oldnode->mac_list, &node->mac_list);
97 		spin_unlock_bh(&hsr->list_lock);
98 		kfree_rcu(oldnode, rcu_head);
99 	} else {
100 		list_add_tail_rcu(&node->mac_list, self_node_db);
101 		spin_unlock_bh(&hsr->list_lock);
102 	}
103 
104 	return 0;
105 }
106 
107 void hsr_del_self_node(struct hsr_priv *hsr)
108 {
109 	struct list_head *self_node_db = &hsr->self_node_db;
110 	struct hsr_node *node;
111 
112 	spin_lock_bh(&hsr->list_lock);
113 	node = list_first_or_null_rcu(self_node_db, struct hsr_node, mac_list);
114 	if (node) {
115 		list_del_rcu(&node->mac_list);
116 		kfree_rcu(node, rcu_head);
117 	}
118 	spin_unlock_bh(&hsr->list_lock);
119 }
120 
121 void hsr_del_nodes(struct list_head *node_db)
122 {
123 	struct hsr_node *node;
124 	struct hsr_node *tmp;
125 
126 	list_for_each_entry_safe(node, tmp, node_db, mac_list)
127 		kfree(node);
128 }
129 
130 void prp_handle_san_frame(bool san, enum hsr_port_type port,
131 			  struct hsr_node *node)
132 {
133 	/* Mark if the SAN node is over LAN_A or LAN_B */
134 	if (port == HSR_PT_SLAVE_A) {
135 		node->san_a = true;
136 		return;
137 	}
138 
139 	if (port == HSR_PT_SLAVE_B)
140 		node->san_b = true;
141 }
142 
143 /* Allocate an hsr_node and add it to node_db. 'addr' is the node's address_A;
144  * seq_out is used to initialize filtering of outgoing duplicate frames
145  * originating from the newly added node.
146  */
147 static struct hsr_node *hsr_add_node(struct hsr_priv *hsr,
148 				     struct list_head *node_db,
149 				     unsigned char addr[],
150 				     u16 seq_out, bool san,
151 				     enum hsr_port_type rx_port)
152 {
153 	struct hsr_node *new_node, *node;
154 	unsigned long now;
155 	int i;
156 
157 	new_node = kzalloc(sizeof(*new_node), GFP_ATOMIC);
158 	if (!new_node)
159 		return NULL;
160 
161 	ether_addr_copy(new_node->macaddress_A, addr);
162 
163 	/* We are only interested in time diffs here, so use current jiffies
164 	 * as initialization. (0 could trigger an spurious ring error warning).
165 	 */
166 	now = jiffies;
167 	for (i = 0; i < HSR_PT_PORTS; i++)
168 		new_node->time_in[i] = now;
169 	for (i = 0; i < HSR_PT_PORTS; i++)
170 		new_node->seq_out[i] = seq_out;
171 
172 	if (san && hsr->proto_ops->handle_san_frame)
173 		hsr->proto_ops->handle_san_frame(san, rx_port, new_node);
174 
175 	spin_lock_bh(&hsr->list_lock);
176 	list_for_each_entry_rcu(node, node_db, mac_list,
177 				lockdep_is_held(&hsr->list_lock)) {
178 		if (ether_addr_equal(node->macaddress_A, addr))
179 			goto out;
180 		if (ether_addr_equal(node->macaddress_B, addr))
181 			goto out;
182 	}
183 	list_add_tail_rcu(&new_node->mac_list, node_db);
184 	spin_unlock_bh(&hsr->list_lock);
185 	return new_node;
186 out:
187 	spin_unlock_bh(&hsr->list_lock);
188 	kfree(new_node);
189 	return node;
190 }
191 
192 void prp_update_san_info(struct hsr_node *node, bool is_sup)
193 {
194 	if (!is_sup)
195 		return;
196 
197 	node->san_a = false;
198 	node->san_b = false;
199 }
200 
201 /* Get the hsr_node from which 'skb' was sent.
202  */
203 struct hsr_node *hsr_get_node(struct hsr_port *port, struct list_head *node_db,
204 			      struct sk_buff *skb, bool is_sup,
205 			      enum hsr_port_type rx_port)
206 {
207 	struct hsr_priv *hsr = port->hsr;
208 	struct hsr_node *node;
209 	struct ethhdr *ethhdr;
210 	struct prp_rct *rct;
211 	bool san = false;
212 	u16 seq_out;
213 
214 	if (!skb_mac_header_was_set(skb))
215 		return NULL;
216 
217 	ethhdr = (struct ethhdr *)skb_mac_header(skb);
218 
219 	list_for_each_entry_rcu(node, node_db, mac_list) {
220 		if (ether_addr_equal(node->macaddress_A, ethhdr->h_source)) {
221 			if (hsr->proto_ops->update_san_info)
222 				hsr->proto_ops->update_san_info(node, is_sup);
223 			return node;
224 		}
225 		if (ether_addr_equal(node->macaddress_B, ethhdr->h_source)) {
226 			if (hsr->proto_ops->update_san_info)
227 				hsr->proto_ops->update_san_info(node, is_sup);
228 			return node;
229 		}
230 	}
231 
232 	/* Everyone may create a node entry, connected node to a HSR/PRP
233 	 * device.
234 	 */
235 	if (ethhdr->h_proto == htons(ETH_P_PRP) ||
236 	    ethhdr->h_proto == htons(ETH_P_HSR)) {
237 		/* Use the existing sequence_nr from the tag as starting point
238 		 * for filtering duplicate frames.
239 		 */
240 		seq_out = hsr_get_skb_sequence_nr(skb) - 1;
241 	} else {
242 		rct = skb_get_PRP_rct(skb);
243 		if (rct && prp_check_lsdu_size(skb, rct, is_sup)) {
244 			seq_out = prp_get_skb_sequence_nr(rct);
245 		} else {
246 			if (rx_port != HSR_PT_MASTER)
247 				san = true;
248 			seq_out = HSR_SEQNR_START;
249 		}
250 	}
251 
252 	return hsr_add_node(hsr, node_db, ethhdr->h_source, seq_out,
253 			    san, rx_port);
254 }
255 
256 /* Use the Supervision frame's info about an eventual macaddress_B for merging
257  * nodes that has previously had their macaddress_B registered as a separate
258  * node.
259  */
260 void hsr_handle_sup_frame(struct hsr_frame_info *frame)
261 {
262 	struct hsr_node *node_curr = frame->node_src;
263 	struct hsr_port *port_rcv = frame->port_rcv;
264 	struct hsr_priv *hsr = port_rcv->hsr;
265 	struct hsr_sup_payload *hsr_sp;
266 	struct hsr_node *node_real;
267 	struct sk_buff *skb = NULL;
268 	struct list_head *node_db;
269 	struct ethhdr *ethhdr;
270 	int i;
271 
272 	/* Here either frame->skb_hsr or frame->skb_prp should be
273 	 * valid as supervision frame always will have protocol
274 	 * header info.
275 	 */
276 	if (frame->skb_hsr)
277 		skb = frame->skb_hsr;
278 	else if (frame->skb_prp)
279 		skb = frame->skb_prp;
280 	else if (frame->skb_std)
281 		skb = frame->skb_std;
282 	if (!skb)
283 		return;
284 
285 	ethhdr = (struct ethhdr *)skb_mac_header(skb);
286 
287 	/* Leave the ethernet header. */
288 	skb_pull(skb, sizeof(struct ethhdr));
289 
290 	/* And leave the HSR tag. */
291 	if (ethhdr->h_proto == htons(ETH_P_HSR))
292 		skb_pull(skb, sizeof(struct hsr_tag));
293 
294 	/* And leave the HSR sup tag. */
295 	skb_pull(skb, sizeof(struct hsr_sup_tag));
296 
297 	hsr_sp = (struct hsr_sup_payload *)skb->data;
298 
299 	/* Merge node_curr (registered on macaddress_B) into node_real */
300 	node_db = &port_rcv->hsr->node_db;
301 	node_real = find_node_by_addr_A(node_db, hsr_sp->macaddress_A);
302 	if (!node_real)
303 		/* No frame received from AddrA of this node yet */
304 		node_real = hsr_add_node(hsr, node_db, hsr_sp->macaddress_A,
305 					 HSR_SEQNR_START - 1, true,
306 					 port_rcv->type);
307 	if (!node_real)
308 		goto done; /* No mem */
309 	if (node_real == node_curr)
310 		/* Node has already been merged */
311 		goto done;
312 
313 	ether_addr_copy(node_real->macaddress_B, ethhdr->h_source);
314 	for (i = 0; i < HSR_PT_PORTS; i++) {
315 		if (!node_curr->time_in_stale[i] &&
316 		    time_after(node_curr->time_in[i], node_real->time_in[i])) {
317 			node_real->time_in[i] = node_curr->time_in[i];
318 			node_real->time_in_stale[i] =
319 						node_curr->time_in_stale[i];
320 		}
321 		if (seq_nr_after(node_curr->seq_out[i], node_real->seq_out[i]))
322 			node_real->seq_out[i] = node_curr->seq_out[i];
323 	}
324 	node_real->addr_B_port = port_rcv->type;
325 
326 	spin_lock_bh(&hsr->list_lock);
327 	list_del_rcu(&node_curr->mac_list);
328 	spin_unlock_bh(&hsr->list_lock);
329 	kfree_rcu(node_curr, rcu_head);
330 
331 done:
332 	/* PRP uses v0 header */
333 	if (ethhdr->h_proto == htons(ETH_P_HSR))
334 		skb_push(skb, sizeof(struct hsrv1_ethhdr_sp));
335 	else
336 		skb_push(skb, sizeof(struct hsrv0_ethhdr_sp));
337 }
338 
339 /* 'skb' is a frame meant for this host, that is to be passed to upper layers.
340  *
341  * If the frame was sent by a node's B interface, replace the source
342  * address with that node's "official" address (macaddress_A) so that upper
343  * layers recognize where it came from.
344  */
345 void hsr_addr_subst_source(struct hsr_node *node, struct sk_buff *skb)
346 {
347 	if (!skb_mac_header_was_set(skb)) {
348 		WARN_ONCE(1, "%s: Mac header not set\n", __func__);
349 		return;
350 	}
351 
352 	memcpy(&eth_hdr(skb)->h_source, node->macaddress_A, ETH_ALEN);
353 }
354 
355 /* 'skb' is a frame meant for another host.
356  * 'port' is the outgoing interface
357  *
358  * Substitute the target (dest) MAC address if necessary, so the it matches the
359  * recipient interface MAC address, regardless of whether that is the
360  * recipient's A or B interface.
361  * This is needed to keep the packets flowing through switches that learn on
362  * which "side" the different interfaces are.
363  */
364 void hsr_addr_subst_dest(struct hsr_node *node_src, struct sk_buff *skb,
365 			 struct hsr_port *port)
366 {
367 	struct hsr_node *node_dst;
368 
369 	if (!skb_mac_header_was_set(skb)) {
370 		WARN_ONCE(1, "%s: Mac header not set\n", __func__);
371 		return;
372 	}
373 
374 	if (!is_unicast_ether_addr(eth_hdr(skb)->h_dest))
375 		return;
376 
377 	node_dst = find_node_by_addr_A(&port->hsr->node_db,
378 				       eth_hdr(skb)->h_dest);
379 	if (!node_dst) {
380 		if (net_ratelimit())
381 			netdev_err(skb->dev, "%s: Unknown node\n", __func__);
382 		return;
383 	}
384 	if (port->type != node_dst->addr_B_port)
385 		return;
386 
387 	if (is_valid_ether_addr(node_dst->macaddress_B))
388 		ether_addr_copy(eth_hdr(skb)->h_dest, node_dst->macaddress_B);
389 }
390 
391 void hsr_register_frame_in(struct hsr_node *node, struct hsr_port *port,
392 			   u16 sequence_nr)
393 {
394 	/* Don't register incoming frames without a valid sequence number. This
395 	 * ensures entries of restarted nodes gets pruned so that they can
396 	 * re-register and resume communications.
397 	 */
398 	if (seq_nr_before(sequence_nr, node->seq_out[port->type]))
399 		return;
400 
401 	node->time_in[port->type] = jiffies;
402 	node->time_in_stale[port->type] = false;
403 }
404 
405 /* 'skb' is a HSR Ethernet frame (with a HSR tag inserted), with a valid
406  * ethhdr->h_source address and skb->mac_header set.
407  *
408  * Return:
409  *	 1 if frame can be shown to have been sent recently on this interface,
410  *	 0 otherwise, or
411  *	 negative error code on error
412  */
413 int hsr_register_frame_out(struct hsr_port *port, struct hsr_node *node,
414 			   u16 sequence_nr)
415 {
416 	if (seq_nr_before_or_eq(sequence_nr, node->seq_out[port->type]))
417 		return 1;
418 
419 	node->seq_out[port->type] = sequence_nr;
420 	return 0;
421 }
422 
423 static struct hsr_port *get_late_port(struct hsr_priv *hsr,
424 				      struct hsr_node *node)
425 {
426 	if (node->time_in_stale[HSR_PT_SLAVE_A])
427 		return hsr_port_get_hsr(hsr, HSR_PT_SLAVE_A);
428 	if (node->time_in_stale[HSR_PT_SLAVE_B])
429 		return hsr_port_get_hsr(hsr, HSR_PT_SLAVE_B);
430 
431 	if (time_after(node->time_in[HSR_PT_SLAVE_B],
432 		       node->time_in[HSR_PT_SLAVE_A] +
433 					msecs_to_jiffies(MAX_SLAVE_DIFF)))
434 		return hsr_port_get_hsr(hsr, HSR_PT_SLAVE_A);
435 	if (time_after(node->time_in[HSR_PT_SLAVE_A],
436 		       node->time_in[HSR_PT_SLAVE_B] +
437 					msecs_to_jiffies(MAX_SLAVE_DIFF)))
438 		return hsr_port_get_hsr(hsr, HSR_PT_SLAVE_B);
439 
440 	return NULL;
441 }
442 
443 /* Remove stale sequence_nr records. Called by timer every
444  * HSR_LIFE_CHECK_INTERVAL (two seconds or so).
445  */
446 void hsr_prune_nodes(struct timer_list *t)
447 {
448 	struct hsr_priv *hsr = from_timer(hsr, t, prune_timer);
449 	struct hsr_node *node;
450 	struct hsr_node *tmp;
451 	struct hsr_port *port;
452 	unsigned long timestamp;
453 	unsigned long time_a, time_b;
454 
455 	spin_lock_bh(&hsr->list_lock);
456 	list_for_each_entry_safe(node, tmp, &hsr->node_db, mac_list) {
457 		/* Don't prune own node. Neither time_in[HSR_PT_SLAVE_A]
458 		 * nor time_in[HSR_PT_SLAVE_B], will ever be updated for
459 		 * the master port. Thus the master node will be repeatedly
460 		 * pruned leading to packet loss.
461 		 */
462 		if (hsr_addr_is_self(hsr, node->macaddress_A))
463 			continue;
464 
465 		/* Shorthand */
466 		time_a = node->time_in[HSR_PT_SLAVE_A];
467 		time_b = node->time_in[HSR_PT_SLAVE_B];
468 
469 		/* Check for timestamps old enough to risk wrap-around */
470 		if (time_after(jiffies, time_a + MAX_JIFFY_OFFSET / 2))
471 			node->time_in_stale[HSR_PT_SLAVE_A] = true;
472 		if (time_after(jiffies, time_b + MAX_JIFFY_OFFSET / 2))
473 			node->time_in_stale[HSR_PT_SLAVE_B] = true;
474 
475 		/* Get age of newest frame from node.
476 		 * At least one time_in is OK here; nodes get pruned long
477 		 * before both time_ins can get stale
478 		 */
479 		timestamp = time_a;
480 		if (node->time_in_stale[HSR_PT_SLAVE_A] ||
481 		    (!node->time_in_stale[HSR_PT_SLAVE_B] &&
482 		    time_after(time_b, time_a)))
483 			timestamp = time_b;
484 
485 		/* Warn of ring error only as long as we get frames at all */
486 		if (time_is_after_jiffies(timestamp +
487 				msecs_to_jiffies(1.5 * MAX_SLAVE_DIFF))) {
488 			rcu_read_lock();
489 			port = get_late_port(hsr, node);
490 			if (port)
491 				hsr_nl_ringerror(hsr, node->macaddress_A, port);
492 			rcu_read_unlock();
493 		}
494 
495 		/* Prune old entries */
496 		if (time_is_before_jiffies(timestamp +
497 				msecs_to_jiffies(HSR_NODE_FORGET_TIME))) {
498 			hsr_nl_nodedown(hsr, node->macaddress_A);
499 			list_del_rcu(&node->mac_list);
500 			/* Note that we need to free this entry later: */
501 			kfree_rcu(node, rcu_head);
502 		}
503 	}
504 	spin_unlock_bh(&hsr->list_lock);
505 
506 	/* Restart timer */
507 	mod_timer(&hsr->prune_timer,
508 		  jiffies + msecs_to_jiffies(PRUNE_PERIOD));
509 }
510 
511 void *hsr_get_next_node(struct hsr_priv *hsr, void *_pos,
512 			unsigned char addr[ETH_ALEN])
513 {
514 	struct hsr_node *node;
515 
516 	if (!_pos) {
517 		node = list_first_or_null_rcu(&hsr->node_db,
518 					      struct hsr_node, mac_list);
519 		if (node)
520 			ether_addr_copy(addr, node->macaddress_A);
521 		return node;
522 	}
523 
524 	node = _pos;
525 	list_for_each_entry_continue_rcu(node, &hsr->node_db, mac_list) {
526 		ether_addr_copy(addr, node->macaddress_A);
527 		return node;
528 	}
529 
530 	return NULL;
531 }
532 
533 int hsr_get_node_data(struct hsr_priv *hsr,
534 		      const unsigned char *addr,
535 		      unsigned char addr_b[ETH_ALEN],
536 		      unsigned int *addr_b_ifindex,
537 		      int *if1_age,
538 		      u16 *if1_seq,
539 		      int *if2_age,
540 		      u16 *if2_seq)
541 {
542 	struct hsr_node *node;
543 	struct hsr_port *port;
544 	unsigned long tdiff;
545 
546 	node = find_node_by_addr_A(&hsr->node_db, addr);
547 	if (!node)
548 		return -ENOENT;
549 
550 	ether_addr_copy(addr_b, node->macaddress_B);
551 
552 	tdiff = jiffies - node->time_in[HSR_PT_SLAVE_A];
553 	if (node->time_in_stale[HSR_PT_SLAVE_A])
554 		*if1_age = INT_MAX;
555 #if HZ <= MSEC_PER_SEC
556 	else if (tdiff > msecs_to_jiffies(INT_MAX))
557 		*if1_age = INT_MAX;
558 #endif
559 	else
560 		*if1_age = jiffies_to_msecs(tdiff);
561 
562 	tdiff = jiffies - node->time_in[HSR_PT_SLAVE_B];
563 	if (node->time_in_stale[HSR_PT_SLAVE_B])
564 		*if2_age = INT_MAX;
565 #if HZ <= MSEC_PER_SEC
566 	else if (tdiff > msecs_to_jiffies(INT_MAX))
567 		*if2_age = INT_MAX;
568 #endif
569 	else
570 		*if2_age = jiffies_to_msecs(tdiff);
571 
572 	/* Present sequence numbers as if they were incoming on interface */
573 	*if1_seq = node->seq_out[HSR_PT_SLAVE_B];
574 	*if2_seq = node->seq_out[HSR_PT_SLAVE_A];
575 
576 	if (node->addr_B_port != HSR_PT_NONE) {
577 		port = hsr_port_get_hsr(hsr, node->addr_B_port);
578 		*addr_b_ifindex = port->dev->ifindex;
579 	} else {
580 		*addr_b_ifindex = -1;
581 	}
582 
583 	return 0;
584 }
585