| 摘要 |
Entries which become lookup objects and have variable length comparison conditions are divided into a plurality of groups, a representative lookup key is taken as lookup data for each group, and mask data that sets a range for matching with a match candidate, as well as comparison object data, is stored in masked lookup memory so that setting can be made for each of the entries. Information corresponding to the groups that match the lookup conditions is obtained from the masked lookup memory, and the lookup object entries are limited to the data within the object group. Further, the entries, which become lookup objects, are classified into a tree state, with nodes adopted at points where bit values are either "0" or "1", in order from the first bit, and lookup for matching entry is performed after the entries are limited to the data within the object groups.
|
