aboutsummaryrefslogtreecommitdiffstats
path: root/hicn-light/src/hicn/processor/matchingRulesTable.c
blob: e572393212063c37c0eb35c2bc064c6c6420cbfb (plain)
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
/*
 * Copyright (c) 2017-2019 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include <hicn/hicn-light/config.h>
#include <stdio.h>

#include <parc/algol/parc_Hash.h>
#include <parc/algol/parc_Memory.h>

#include <parc/assert/parc_Assert.h>
#include <hicn/processor/hashTableFunction.h>
#include <hicn/processor/matchingRulesTable.h>

struct matching_rules_table {
  // using this wrapper we can manatain multiple hash tables indexed in
  // different ways
  // for now we use only a table indexed by name

  PARCHashCodeTable *tableByName;
  PARCHashCodeTable_Destroyer dataDestroyer;
};

static PARCHashCodeTable *matchingRulesTable_GetTableForMessage(
    const MatchingRulesTable *pit, const Message *interestMessage);

// ======================================================================

MatchingRulesTable *matchingRulesTable_Create(
    PARCHashCodeTable_Destroyer dataDestroyer) {
  size_t initialSize = 65535;

  MatchingRulesTable *table =
      parcMemory_AllocateAndClear(sizeof(MatchingRulesTable));
  parcAssertNotNull(table, "parcMemory_AllocateAndClear(%zu) returned NULL",
                    sizeof(MatchingRulesTable));
  table->dataDestroyer = dataDestroyer;

  table->tableByName = parcHashCodeTable_Create_Size(
      hashTableFunction_MessageNameEquals,
      hashTableFunction_MessageNameHashCode, NULL, dataDestroyer, initialSize);

  return table;
}

void matchingRulesTable_Destroy(MatchingRulesTable **tablePtr) {
  parcAssertNotNull(tablePtr, "Parameter must be non-null double pointer");
  parcAssertNotNull(*tablePtr,
                    "Parameter must dereference to non-null pointer");

  MatchingRulesTable *table = *tablePtr;

  parcHashCodeTable_Destroy(&table->tableByName);

  parcMemory_Deallocate((void **)&table);
  *tablePtr = NULL;
}

void *matchingRulesTable_Get(const MatchingRulesTable *rulesTable,
                             const Message *message) {
  parcAssertNotNull(rulesTable, "Parameter rulesTable must be non-null");
  parcAssertNotNull(message, "Parameter message must be non-null");

  PARCHashCodeTable *hashTable =
      matchingRulesTable_GetTableForMessage(rulesTable, message);
  return parcHashCodeTable_Get(hashTable, message);
}

PARCArrayList *matchingRulesTable_GetUnion(const MatchingRulesTable *table,
                                           const Message *message) {
  PARCArrayList *list = parcArrayList_Create_Capacity(NULL, NULL, 3);

  void *dataByName = parcHashCodeTable_Get(table->tableByName, message);
  if (dataByName) {
    parcArrayList_Add(list, dataByName);
  }

  return list;
}

void matchingRulesTable_RemoveFromBest(MatchingRulesTable *rulesTable,
                                       const Message *message) {
  parcAssertNotNull(rulesTable, "Parameter rulesTable must be non-null");
  parcAssertNotNull(message, "Parameter message must be non-null");

  PARCHashCodeTable *hashTable =
      matchingRulesTable_GetTableForMessage(rulesTable, message);
  parcHashCodeTable_Del(hashTable, message);
}

void matchingRulesTable_RemoveFromAll(MatchingRulesTable *rulesTable,
                                      const Message *message) {
  parcAssertNotNull(rulesTable, "Parameter rulesTable must be non-null");
  parcAssertNotNull(message, "Parameter message must be non-null");

  parcHashCodeTable_Del(rulesTable->tableByName, message);
}

bool matchingRulesTable_AddToBestTable(MatchingRulesTable *rulesTable,
                                       Message *key, void *data) {
  parcAssertNotNull(rulesTable, "Parameter rulesTable must be non-null");
  parcAssertNotNull(key, "Parameter key must be non-null");
  parcAssertNotNull(data, "Parameter data must be non-null");

  PARCHashCodeTable *hashTable =
      matchingRulesTable_GetTableForMessage(rulesTable, key);

  bool success = parcHashCodeTable_Add(hashTable, key, data);

  return success;
}

// ========================================================================================

static PARCHashCodeTable *matchingRulesTable_GetTableForMessage(
    const MatchingRulesTable *pit, const Message *interestMessage) {
  PARCHashCodeTable *table;
  table = pit->tableByName;

  return table;
}