Message query method and device

Abstract

The embodiment of the invention provides a message query method and device. The message query method comprises the steps: receiving a message and writing the message into a cache; sending a message query request which comprises the address information of a message header of the message in the cache; receiving a feedback query result, and acquiring the address information of the message header of the message in the cache in the query result; and reading the message from the cache according to the address information of the message header of the message in the cache. The embodiment of the invention supports a bybass scene in multi-flow cache management and simplifies the complexity of logic design. Compared with linked list management, the invention removes the idle address cache and linked list pointer cache, thus saving resources, reducing the read-write operation of an internal memory and being in accordance with the demand of low power consumption.

Description

A message query method and device technical field The invention relates to the field of communication technology, in particular to a message query method and device. Background technique A basic object processed by the router chip is the message. In many cases, the message is divided into multiple streams according to different priorities or different message types. All types of messages will share the same internal cache. When the message is written into the cache, the message type is parsed and the query request is processed differently according to the type. After the query request returns the result, the message can be read from the cache for corresponding deal with. Hereinafter, we refer to different types of packets as different streams for short, the query request as REQ, and the returned query result as RES. Initiate REQ according to the order in which the messages are written into the cache. REQ processing takes a while before returning to RES. The processing ...

AI Technical Summary

Problems solved by technology

In the process of realizing the present invention, the inventor found that there are at least the following problems in the prior art: the biggest shortcoming of the linked list management scheme is that it cannot handle the forced conversion of stream types

The message processing module of stream 1 obtains REQ1 and REQ2 in sequence, but REQ2 is bypassed as stream 2, and the processing flow of stream 2 follows. Since the REQ_RES between different streams is out of order, the response RES2 of REQ2 may be returned before RES1. The head pointer of the flow 1 linked list does not correspond to the message of RES2, and the linked list management cannot handle this scenario

Another disadvantage of the linked list management scheme is that it takes up a lot of resources. It needs to maintain an additional Free_addr_list (storage of free addresses) and the shared cache of the linked list (storage of linked list pointers), which relatively increases the read and write operations of Memory (memory), increasing the power consumption

Images