mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-12-29 22:14:41 +08:00
328970de0e
Based on 1 normalized pattern(s): this program is free software you can redistribute it and or modify it under the terms of the gnu general public license as published by the free software foundation either version 2 of the license or at your option any later version this program 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 general public license for more details you should have received a copy of the gnu general public license along with this program if not write to the free software foundation inc 59 temple place suite 330 boston ma 021110 1307 usa extracted by the scancode license scanner the SPDX license identifier GPL-2.0-or-later has been chosen to replace the boilerplate/reference in 84 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Richard Fontana <rfontana@redhat.com> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190524100844.756442981@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
121 lines
2.8 KiB
C
121 lines
2.8 KiB
C
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
/* -*- mode: c; c-basic-offset: 8; -*-
|
|
* vim: noexpandtab sw=8 ts=8 sts=0:
|
|
*
|
|
* heartbeat.c
|
|
*
|
|
* Register ourselves with the heartbaet service, keep our node maps
|
|
* up to date, and fire off recovery when needed.
|
|
*
|
|
* Copyright (C) 2002, 2004 Oracle. All rights reserved.
|
|
*/
|
|
|
|
#include <linux/fs.h>
|
|
#include <linux/types.h>
|
|
#include <linux/highmem.h>
|
|
|
|
#include <cluster/masklog.h>
|
|
|
|
#include "ocfs2.h"
|
|
|
|
#include "alloc.h"
|
|
#include "heartbeat.h"
|
|
#include "inode.h"
|
|
#include "journal.h"
|
|
#include "ocfs2_trace.h"
|
|
|
|
#include "buffer_head_io.h"
|
|
|
|
static inline void __ocfs2_node_map_set_bit(struct ocfs2_node_map *map,
|
|
int bit);
|
|
static inline void __ocfs2_node_map_clear_bit(struct ocfs2_node_map *map,
|
|
int bit);
|
|
|
|
/* special case -1 for now
|
|
* TODO: should *really* make sure the calling func never passes -1!! */
|
|
static void ocfs2_node_map_init(struct ocfs2_node_map *map)
|
|
{
|
|
map->num_nodes = OCFS2_NODE_MAP_MAX_NODES;
|
|
memset(map->map, 0, BITS_TO_LONGS(OCFS2_NODE_MAP_MAX_NODES) *
|
|
sizeof(unsigned long));
|
|
}
|
|
|
|
void ocfs2_init_node_maps(struct ocfs2_super *osb)
|
|
{
|
|
spin_lock_init(&osb->node_map_lock);
|
|
ocfs2_node_map_init(&osb->osb_recovering_orphan_dirs);
|
|
}
|
|
|
|
void ocfs2_do_node_down(int node_num, void *data)
|
|
{
|
|
struct ocfs2_super *osb = data;
|
|
|
|
BUG_ON(osb->node_num == node_num);
|
|
|
|
trace_ocfs2_do_node_down(node_num);
|
|
|
|
if (!osb->cconn) {
|
|
/*
|
|
* No cluster connection means we're not even ready to
|
|
* participate yet. We check the slots after the cluster
|
|
* comes up, so we will notice the node death then. We
|
|
* can safely ignore it here.
|
|
*/
|
|
return;
|
|
}
|
|
|
|
ocfs2_recovery_thread(osb, node_num);
|
|
}
|
|
|
|
static inline void __ocfs2_node_map_set_bit(struct ocfs2_node_map *map,
|
|
int bit)
|
|
{
|
|
set_bit(bit, map->map);
|
|
}
|
|
|
|
void ocfs2_node_map_set_bit(struct ocfs2_super *osb,
|
|
struct ocfs2_node_map *map,
|
|
int bit)
|
|
{
|
|
if (bit==-1)
|
|
return;
|
|
BUG_ON(bit >= map->num_nodes);
|
|
spin_lock(&osb->node_map_lock);
|
|
__ocfs2_node_map_set_bit(map, bit);
|
|
spin_unlock(&osb->node_map_lock);
|
|
}
|
|
|
|
static inline void __ocfs2_node_map_clear_bit(struct ocfs2_node_map *map,
|
|
int bit)
|
|
{
|
|
clear_bit(bit, map->map);
|
|
}
|
|
|
|
void ocfs2_node_map_clear_bit(struct ocfs2_super *osb,
|
|
struct ocfs2_node_map *map,
|
|
int bit)
|
|
{
|
|
if (bit==-1)
|
|
return;
|
|
BUG_ON(bit >= map->num_nodes);
|
|
spin_lock(&osb->node_map_lock);
|
|
__ocfs2_node_map_clear_bit(map, bit);
|
|
spin_unlock(&osb->node_map_lock);
|
|
}
|
|
|
|
int ocfs2_node_map_test_bit(struct ocfs2_super *osb,
|
|
struct ocfs2_node_map *map,
|
|
int bit)
|
|
{
|
|
int ret;
|
|
if (bit >= map->num_nodes) {
|
|
mlog(ML_ERROR, "bit=%d map->num_nodes=%d\n", bit, map->num_nodes);
|
|
BUG();
|
|
}
|
|
spin_lock(&osb->node_map_lock);
|
|
ret = test_bit(bit, map->map);
|
|
spin_unlock(&osb->node_map_lock);
|
|
return ret;
|
|
}
|
|
|