aboutsummaryrefslogtreecommitdiffstats
path: root/lib/snmp/doc/src/snmp_index.xml
blob: 646e9661a3935f8bb1a3ec23b6198fa7bd4db9c4 (plain) (blame)
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
<?xml version="1.0" encoding="utf-8" ?>
<!DOCTYPE erlref SYSTEM "erlref.dtd">

<erlref>
  <header>
    <copyright>
      <year>1997</year><year>2016</year>
      <holder>Ericsson AB. All Rights Reserved.</holder>
    </copyright>
    <legalnotice>
      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.
    
    </legalnotice>

    <title>snmp_index</title>
    <prepared></prepared>
    <responsible></responsible>
    <docno></docno>
    <approved></approved>
    <checked></checked>
    <date></date>
    <rev></rev>
    <file>snmp_index.xml</file>
  </header>
  <module>snmp_index</module>
  <modulesummary>Abstract Data Type for SNMP Indexing</modulesummary>
  <description>
    <p>The module <c>snmp_index</c> implements an Abstract
      Data Type (ADT) for an SNMP
      index structure for SNMP tables.  It is implemented as an ets
      table of the ordered_set data-type, which means that all operations are
      O(log n).  In the table, the key is an ASN.1 OBJECT
      IDENTIFIER.
      </p>
    <p>This index is used to separate the implementation of the SNMP
      ordering from the actual implementation of the table.  The SNMP
      ordering, that is implementation of GET NEXT, is implemented in this
      module.
      </p>
    <p>For example, suppose there is an SNMP table, which is best
      implemented in Erlang as one process per SNMP table row.  Suppose
      further that the INDEX in the SNMP table is an OCTET STRING.  The
      index structure would be created as follows:
      </p>
    <code type="none">
snmp_index:new(string)
    </code>
    <p>For each new process we create, we insert an item in an
      <c>snmp_index</c> structure:
      </p>
    <code type="none"><![CDATA[
new_process(Name, SnmpIndex) ->
  Pid = start_process(),
  NewSnmpIndex = 
    snmp_index:insert(SnmpIndex, Name, Pid),
  <...>
    ]]></code>
    <p>With this structure, we can now map an OBJECT IDENTIFIER in
      e.g. a GET NEXT request, to the correct process:
      </p>
    <code type="none">
get_next_pid(Oid, SnmpIndex) ->
  {ok, {_, Pid}} = snmp_index:get_next(SnmpIndex, Oid),
  Pid.
    </code>
  </description>

  <section>
    <title>Common data types</title>
    <p>The following data types are used in the functions below:
      </p>
    <list type="bulleted">
      <item>
        <p><c>index()</c></p>
      </item>
      <item>
        <p><c>oid() = [byte()]</c></p>
      </item>
      <item>
        <p><c>key_types = type_spec()  |  {type_spec(), type_spec(), ...}</c></p>
      </item>
      <item>
        <p><c>type_spec() = fix_string | string | integer</c></p>
      </item>
      <item>
        <p><c>key() = key_spec() | {key_spec(), key_spec(), ...}</c></p>
      </item>
      <item>
        <p><c>key_spec() = string() | integer()</c></p>
      </item>
    </list>
    <p>The <c>index()</c> type denotes an snmp index structure.
      </p>
    <p>The <c>oid()</c> type is used to represent an ASN.1 OBJECT
      IDENTIFIER.
      </p>
    <p>The <c>key_types()</c> type is used when creating the
      index structure, and the <c>key()</c> type is used when inserting
      and deleting items from the structure.
      </p>
    <p>The <c>key_types()</c> type defines the types of the SNMP INDEX
      columns for the table.  If the table has one single INDEX column,
      this type should be a single atom, but if the table has multiple
      INDEX columns, it should be a tuple with atoms.
      </p>
    <p>If the INDEX column is of type INTEGER, or derived from
      INTEGER, the corresponding type should be <c>integer</c>.  If it
      is a variable length type (e.g. OBJECT IDENTIFIER, OCTET STRING),
      the corresponding type should be <c>string</c>.  Finally, if the
      type is of variable length, but with a fixed size restriction
      (e.g. IpAddress), the corresponding type should be
      <c>fix_string</c>.
      </p>
    <p>For example, if the SNMP table has two INDEX columns, the first
      one an OCTET STRING with size 2, and the second one an OBJECT
      IDENTIFER, the corresponding <c>key_types</c> parameter would be
      <c>{fix_string, string}</c>.
      </p>
    <p>The <c>key()</c> type correlates to the <c>key_types()</c>
      type. If the <c>key_types()</c> is a single atom, the
      corresponding <c>key()</c> is a single type as well, but if the
      <c>key_types()</c> is a tuple, <c>key</c> must be a tuple of the
      same size.
      </p>
    <p>In the example above, valid <c>keys</c> could be <c>{"hi", "mom"}</c> and <c>{"no", "thanks"}</c>, whereas <c>"hi"</c>,
      <c>{"hi", 42}</c> and <c>{"hello", "there"}</c> would be invalid.</p>
    <warning>
      <marker id="1"></marker>
      <p>All API functions that update the index return a <c>NewIndex</c>
        term. This is for backward compatibility with a previous
        implementation that used a B+ tree written purely in Erlang for 
        the index. The <c>NewIndex</c> return value can now be ignored. 
        The return value is now the unchanged table identifier for the 
        ets table.</p>
      <p>The implementation using ets tables introduces a semantic
        incompatibility with older implementations. In those older 
        implementations, using pure Erlang terms, the index was garbage 
        collected like any other Erlang term and did not have to be 
        deleted when discarded. An ets table is deleted only when the 
        process creating it explicitly deletes it or when the creating 
        process terminates.</p>
      <p>A new interface <c>delete/1</c> is now added to
        handle the case when a process wants to discard an index table
        (i.e. to build a completely new). Any application using
        transient snmp indexes has to be modified to handle this.</p>
      <p>As an snmp adaption usually keeps the index for the whole of the
        systems lifetime, this is rarely a problem.</p>
    </warning>
  </section>
  <funcs>
    <func>
      <name>delete(Index) -> true</name>
      <fsummary>Delete an index table</fsummary>
      <type>
        <v>Index = NewIndex = index()</v>
        <v>Key = key()</v>
      </type>
      <desc>
        <p>Deletes a complete index structure (i.e. the ets table
          holding the index). The index can no longer be referenced
          after this call. See the <seealso marker="#1">warning note</seealso>
          above.</p>
      </desc>
    </func>
    <func>
      <name>delete(Index, Key) -> NewIndex</name>
      <fsummary>Delete an item from the index</fsummary>
      <type>
        <v>Index = NewIndex = index()</v>
        <v>Key = key()</v>
      </type>
      <desc>
        <p>Deletes a key and its value from the index structure.
          Returns a new structure.</p>
      </desc>
    </func>
    <func>
      <name>get(Index, KeyOid) -> {ok, {KeyOid, Value}} | undefined</name>
      <fsummary>Get the item with <c>KeyOid</c></fsummary>
      <type>
        <v>Index = index()</v>
        <v>KeyOid = oid()</v>
        <v>Value = term()</v>
      </type>
      <desc>
        <p>Gets the item with key <c>KeyOid</c>.  Could be used from
          within an SNMP instrumentation function.</p>
      </desc>
    </func>
    <func>
      <name>get_last(Index) -> {ok, {KeyOid, Value}} | undefined</name>
      <fsummary>Get the last item in the index structure</fsummary>
      <type>
        <v>Index = index()</v>
        <v>KeyOid = oid()</v>
        <v>Value = term()</v>
      </type>
      <desc>
        <p>Gets the last item in the index structure.</p>
      </desc>
    </func>
    <func>
      <name>get_next(Index, KeyOid) -> {ok, {NextKeyOid, Value}} | undefined</name>
      <fsummary>Get the next item</fsummary>
      <type>
        <v>Index = index()</v>
        <v>KeyOid = NextKeyOid = oid()</v>
        <v>Value = term()</v>
      </type>
      <desc>
        <p>Gets the next item in the SNMP lexicographic ordering,
          after <c>KeyOid</c> in the index structure.  <c>KeyOid</c>
          does not have to refer to an existing item in the index.</p>
      </desc>
    </func>
    <func>
      <name>insert(Index, Key, Value) -> NewIndex</name>
      <fsummary>Insert an item into the index</fsummary>
      <type>
        <v>Index = NewIndex = index()</v>
        <v>Key = key()</v>
        <v>Value = term()</v>
      </type>
      <desc>
        <p>Inserts a new key value tuple into the index structure.  If
          an item with the same key already exists, the new <c>Value</c>
          overwrites the old value.</p>
      </desc>
    </func>
    <func>
      <name>key_to_oid(Index, Key) -> KeyOid</name>
      <fsummary>Convert a key to an OBJECT IDENTIFIER</fsummary>
      <type>
        <v>Index = index()</v>
        <v>Key = key()</v>
        <v>KeyOid = NextKeyOid = oid()</v>
      </type>
      <desc>
        <p>Converts <c>Key</c> to an OBJECT IDENTIFIER.</p>
      </desc>
    </func>
    <func>
      <name>new(KeyTypes) -> Index</name>
      <fsummary>Create a new snmp index structure</fsummary>
      <type>
        <v>KeyTypes = key_types()</v>
        <v>Index = index()</v>
      </type>
      <desc>
        <p>Creates a new snmp index structure.  The <c>key_types()</c>
          type is described above.</p>
      </desc>
    </func>
  </funcs>
  
</erlref>