1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0-or-later
2*4882a593Smuzhiyun /* -*- mode: c; c-basic-offset: 8; -*-
3*4882a593Smuzhiyun * vim: noexpandtab sw=8 ts=8 sts=0:
4*4882a593Smuzhiyun *
5*4882a593Smuzhiyun * heartbeat.c
6*4882a593Smuzhiyun *
7*4882a593Smuzhiyun * Register ourselves with the heartbaet service, keep our node maps
8*4882a593Smuzhiyun * up to date, and fire off recovery when needed.
9*4882a593Smuzhiyun *
10*4882a593Smuzhiyun * Copyright (C) 2002, 2004 Oracle. All rights reserved.
11*4882a593Smuzhiyun */
12*4882a593Smuzhiyun
13*4882a593Smuzhiyun #include <linux/fs.h>
14*4882a593Smuzhiyun #include <linux/types.h>
15*4882a593Smuzhiyun #include <linux/highmem.h>
16*4882a593Smuzhiyun
17*4882a593Smuzhiyun #include <cluster/masklog.h>
18*4882a593Smuzhiyun
19*4882a593Smuzhiyun #include "ocfs2.h"
20*4882a593Smuzhiyun
21*4882a593Smuzhiyun #include "alloc.h"
22*4882a593Smuzhiyun #include "heartbeat.h"
23*4882a593Smuzhiyun #include "inode.h"
24*4882a593Smuzhiyun #include "journal.h"
25*4882a593Smuzhiyun #include "ocfs2_trace.h"
26*4882a593Smuzhiyun
27*4882a593Smuzhiyun #include "buffer_head_io.h"
28*4882a593Smuzhiyun
29*4882a593Smuzhiyun static inline void __ocfs2_node_map_set_bit(struct ocfs2_node_map *map,
30*4882a593Smuzhiyun int bit);
31*4882a593Smuzhiyun static inline void __ocfs2_node_map_clear_bit(struct ocfs2_node_map *map,
32*4882a593Smuzhiyun int bit);
33*4882a593Smuzhiyun
34*4882a593Smuzhiyun /* special case -1 for now
35*4882a593Smuzhiyun * TODO: should *really* make sure the calling func never passes -1!! */
ocfs2_node_map_init(struct ocfs2_node_map * map)36*4882a593Smuzhiyun static void ocfs2_node_map_init(struct ocfs2_node_map *map)
37*4882a593Smuzhiyun {
38*4882a593Smuzhiyun map->num_nodes = OCFS2_NODE_MAP_MAX_NODES;
39*4882a593Smuzhiyun memset(map->map, 0, BITS_TO_LONGS(OCFS2_NODE_MAP_MAX_NODES) *
40*4882a593Smuzhiyun sizeof(unsigned long));
41*4882a593Smuzhiyun }
42*4882a593Smuzhiyun
ocfs2_init_node_maps(struct ocfs2_super * osb)43*4882a593Smuzhiyun void ocfs2_init_node_maps(struct ocfs2_super *osb)
44*4882a593Smuzhiyun {
45*4882a593Smuzhiyun spin_lock_init(&osb->node_map_lock);
46*4882a593Smuzhiyun ocfs2_node_map_init(&osb->osb_recovering_orphan_dirs);
47*4882a593Smuzhiyun }
48*4882a593Smuzhiyun
ocfs2_do_node_down(int node_num,void * data)49*4882a593Smuzhiyun void ocfs2_do_node_down(int node_num, void *data)
50*4882a593Smuzhiyun {
51*4882a593Smuzhiyun struct ocfs2_super *osb = data;
52*4882a593Smuzhiyun
53*4882a593Smuzhiyun BUG_ON(osb->node_num == node_num);
54*4882a593Smuzhiyun
55*4882a593Smuzhiyun trace_ocfs2_do_node_down(node_num);
56*4882a593Smuzhiyun
57*4882a593Smuzhiyun if (!osb->cconn) {
58*4882a593Smuzhiyun /*
59*4882a593Smuzhiyun * No cluster connection means we're not even ready to
60*4882a593Smuzhiyun * participate yet. We check the slots after the cluster
61*4882a593Smuzhiyun * comes up, so we will notice the node death then. We
62*4882a593Smuzhiyun * can safely ignore it here.
63*4882a593Smuzhiyun */
64*4882a593Smuzhiyun return;
65*4882a593Smuzhiyun }
66*4882a593Smuzhiyun
67*4882a593Smuzhiyun ocfs2_recovery_thread(osb, node_num);
68*4882a593Smuzhiyun }
69*4882a593Smuzhiyun
__ocfs2_node_map_set_bit(struct ocfs2_node_map * map,int bit)70*4882a593Smuzhiyun static inline void __ocfs2_node_map_set_bit(struct ocfs2_node_map *map,
71*4882a593Smuzhiyun int bit)
72*4882a593Smuzhiyun {
73*4882a593Smuzhiyun set_bit(bit, map->map);
74*4882a593Smuzhiyun }
75*4882a593Smuzhiyun
ocfs2_node_map_set_bit(struct ocfs2_super * osb,struct ocfs2_node_map * map,int bit)76*4882a593Smuzhiyun void ocfs2_node_map_set_bit(struct ocfs2_super *osb,
77*4882a593Smuzhiyun struct ocfs2_node_map *map,
78*4882a593Smuzhiyun int bit)
79*4882a593Smuzhiyun {
80*4882a593Smuzhiyun if (bit==-1)
81*4882a593Smuzhiyun return;
82*4882a593Smuzhiyun BUG_ON(bit >= map->num_nodes);
83*4882a593Smuzhiyun spin_lock(&osb->node_map_lock);
84*4882a593Smuzhiyun __ocfs2_node_map_set_bit(map, bit);
85*4882a593Smuzhiyun spin_unlock(&osb->node_map_lock);
86*4882a593Smuzhiyun }
87*4882a593Smuzhiyun
__ocfs2_node_map_clear_bit(struct ocfs2_node_map * map,int bit)88*4882a593Smuzhiyun static inline void __ocfs2_node_map_clear_bit(struct ocfs2_node_map *map,
89*4882a593Smuzhiyun int bit)
90*4882a593Smuzhiyun {
91*4882a593Smuzhiyun clear_bit(bit, map->map);
92*4882a593Smuzhiyun }
93*4882a593Smuzhiyun
ocfs2_node_map_clear_bit(struct ocfs2_super * osb,struct ocfs2_node_map * map,int bit)94*4882a593Smuzhiyun void ocfs2_node_map_clear_bit(struct ocfs2_super *osb,
95*4882a593Smuzhiyun struct ocfs2_node_map *map,
96*4882a593Smuzhiyun int bit)
97*4882a593Smuzhiyun {
98*4882a593Smuzhiyun if (bit==-1)
99*4882a593Smuzhiyun return;
100*4882a593Smuzhiyun BUG_ON(bit >= map->num_nodes);
101*4882a593Smuzhiyun spin_lock(&osb->node_map_lock);
102*4882a593Smuzhiyun __ocfs2_node_map_clear_bit(map, bit);
103*4882a593Smuzhiyun spin_unlock(&osb->node_map_lock);
104*4882a593Smuzhiyun }
105*4882a593Smuzhiyun
ocfs2_node_map_test_bit(struct ocfs2_super * osb,struct ocfs2_node_map * map,int bit)106*4882a593Smuzhiyun int ocfs2_node_map_test_bit(struct ocfs2_super *osb,
107*4882a593Smuzhiyun struct ocfs2_node_map *map,
108*4882a593Smuzhiyun int bit)
109*4882a593Smuzhiyun {
110*4882a593Smuzhiyun int ret;
111*4882a593Smuzhiyun if (bit >= map->num_nodes) {
112*4882a593Smuzhiyun mlog(ML_ERROR, "bit=%d map->num_nodes=%d\n", bit, map->num_nodes);
113*4882a593Smuzhiyun BUG();
114*4882a593Smuzhiyun }
115*4882a593Smuzhiyun spin_lock(&osb->node_map_lock);
116*4882a593Smuzhiyun ret = test_bit(bit, map->map);
117*4882a593Smuzhiyun spin_unlock(&osb->node_map_lock);
118*4882a593Smuzhiyun return ret;
119*4882a593Smuzhiyun }
120*4882a593Smuzhiyun
121