Data enqueue and dequeue method an queue management unit

Abstract

An embodiment of the invention discloses a data enqueue and dequeue method and a queue management unit, and is used for realizing slice dequeue and transmission in the same communication port according to priorities on the basis of dequeue of a whole packet. The data enqueue method provided by the invention includes: receiving a data packet that needs enqueuing, dividing the data packet into a plurality of slices, obtaining slice information of the slices, and marking a tail slice of the data packet with a tail slice identifier; enqueuing the corresponding slice information according to a sequence of the slices in the data packet, and in a process of enqueuing the corresponding slice information, if the slice is marked with the tail slice identifier, determining the slice to be the tail slice of the data packet, and generating nodes of the first kind; judging whether a target queue is empty, if yes, writing the slice information of the tail slice into the target queue, and updating a head pointer of a queue head table according to the nodes of the first kind, and if no, writing the slice information of the tail slice into the target queue, and adding the nodes of the first kind at the tail of a corresponding queue sub chain table of the target queue.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to a method for enqueueing and dequeueing data and a queue management unit. Background technique [0002] Queue Manager (QM for short) is a common function in communication processing chips, and manages data packets mainly by caching addresses. Since the communication processing chip handles many services, in queue management, a queue is generally established in the shared cache according to the business classification. When the data packet arrives, a cache address is assigned to the arriving data packet in the memory, and then the cache address is included in the queue. The package descriptor (PackageCellDescriptor, referred to as PCD) in the cell is managed by writing queues according to classification. Due to the staggered arrival of data packets belonging to different categories, the cache addresses of a classified data packet in the memory cannot be guaranteed to be cont...

AI Technical Summary

Problems solved by technology

When dequeuing data packets, the priority scheduling strategy is that each data packet can be prioritized and switched after dequeuing. The strategy is to judge and switch the priority after each slice is dequeued, which is contrary to the dequeue of the whole package. If it is necessary to dequeue based on the whole package, the existing priority scheduling strategy cannot be realized. Therefore, when dequeueing by slice When queued, it is difficult to perform priority processing based on the existing priority scheduling policy in the same MAC port

Images