sync_raft_node_map.c 2.6 KB
Newer Older
L
lichuang 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
/*
 * Copyright (c) 2019 TAOS Data, Inc. <cli@taosdata.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * 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.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

#include "sync_raft_node_map.h"
#include "sync_type.h"
18
#include "sync_raft_progress.h"
L
lichuang 已提交
19

20 21 22
void syncRaftInitNodeMap(SSyncRaftNodeMap* nodeMap) {
  nodeMap->nodeIdMap = taosHashInit(TSDB_MAX_REPLICA, taosGetDefaultHashFunction(TSDB_DATA_TYPE_INT), true, HASH_ENTRY_LOCK);
}
L
lichuang 已提交
23

24 25 26 27
void syncRaftFreeNodeMap(SSyncRaftNodeMap* nodeMap) {
  taosHashCleanup(nodeMap->nodeIdMap);
}

28 29 30
void syncRaftClearNodeMap(SSyncRaftNodeMap* nodeMap) {
  taosHashClear(nodeMap->nodeIdMap);
}
L
lichuang 已提交
31

32 33 34 35 36 37
bool syncRaftIsInNodeMap(const SSyncRaftNodeMap* nodeMap, SyncNodeId nodeId) {
  SyncNodeId** ppId = (SyncNodeId**)taosHashGet(nodeMap->nodeIdMap, &nodeId, sizeof(SyncNodeId*));
  if (ppId == NULL) {
    return false;
  }
  return true;
L
lichuang 已提交
38 39
}

40 41
void syncRaftCopyNodeMap(const SSyncRaftNodeMap* from, SSyncRaftNodeMap* to) {
  SyncNodeId** ppId = (SyncNodeId**)taosHashIterate(from->nodeIdMap, NULL);
42 43
  while (ppId) {
    taosHashPut(to->nodeIdMap, ppId, sizeof(SyncNodeId*), ppId, sizeof(SyncNodeId*));
44
    ppId = taosHashIterate(from->nodeIdMap, ppId);
45
  }
L
lichuang 已提交
46 47
}

48 49 50 51 52
bool syncRaftIterateNodeMap(const SSyncRaftNodeMap* nodeMap, SyncNodeId *pId) {
  SyncNodeId **ppId = taosHashIterate(nodeMap->nodeIdMap, pId);
  if (ppId == NULL) {
    return true;
  }
L
lichuang 已提交
53

54 55 56
  *pId = *(*ppId);
  return false;
}
L
lichuang 已提交
57

58
bool syncRaftIsAllNodeInProgressMap(SSyncRaftNodeMap* nodeMap, SSyncRaftProgressMap* progressMap) {
59 60 61 62 63 64 65 66 67 68
  SyncNodeId *pId = NULL;
  while (!syncRaftIterateNodeMap(nodeMap, pId)) {
    if (!syncRaftIsInProgressMap(progressMap, *pId)) {
      return false;
    }
  }

  return true;
}

69 70
void syncRaftUnionNodeMap(const SSyncRaftNodeMap* nodeMap, SSyncRaftNodeMap* to) {
  syncRaftCopyNodeMap(nodeMap, to);
L
lichuang 已提交
71 72 73
}

void syncRaftAddToNodeMap(SSyncRaftNodeMap* nodeMap, SyncNodeId nodeId) {
74 75
  taosHashPut(nodeMap->nodeIdMap, &nodeId, sizeof(SyncNodeId*), &nodeId, sizeof(SyncNodeId*));
}
L
lichuang 已提交
76

77 78 79
void syncRaftRemoveFromNodeMap(SSyncRaftNodeMap* nodeMap, SyncNodeId nodeId) {
  taosHashRemove(nodeMap->nodeIdMap, &nodeId, sizeof(SyncNodeId*));
}
L
lichuang 已提交
80

81
int32_t syncRaftNodeMapSize(const SSyncRaftNodeMap* nodeMap) {
82
  return taosHashGetSize(nodeMap->nodeIdMap);
L
lichuang 已提交
83
}