Home | History | Annotate | Download | only in utils

Lines Matching full:pque

139 	TQueue *pQue;
142 pQue = os_memoryAlloc (hOs, sizeof(TQueue));
144 if (!pQue)
150 os_memoryZero (hOs, pQue, sizeof(TQueue));
153 pQue->tHead.pNext = pQue->tHead.pPrev = &pQue->tHead;
156 pQue->hOs = hOs;
157 pQue->hReport = hReport;
158 pQue->uLimit = uLimit;
159 pQue->uNodeHeaderOffset = uNodeHeaderOffset;
161 return (TI_HANDLE)pQue;
178 TQueue *pQue = (TQueue *)hQue;
181 if (pQue->uCount)
183 TRACE0(pQue->hReport, REPORT_SEVERITY_ERROR, "que_Destroy() Queue Not Empty!!");
186 os_memoryFree (pQue->hOs, pQue, sizeof(TQueue));
207 TQueue *pQue = (TQueue *)hQue;
209 pQue->hOs = hOs;
210 pQue->hReport = hReport;
230 TQueue *pQue = (TQueue *)hQue;
235 if(pQue->uCount < pQue->uLimit)
238 pQueNodeHdr = (TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset);
244 TRACE0(pQue->hReport, REPORT_SEVERITY_ERROR, "que_Enqueue(): Trying to enqueue an item that wasn't dequeued!");
250 AddToHead (pQueNodeHdr, &pQue->tHead);
251 pQue->uCount++;
254 if (pQue->uCount > pQue->uMaxCount)
256 pQue->uMaxCount = pQue->uCount;
258 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Enqueue(): Enqueued Successfully\n");
268 pQue->uOverflow++;
269 TRACE0(pQue->hReport, REPORT_SEVERITY_WARNING , "que_Enqueue(): Queue Overflow\n");
289 TQueue *pQue = (TQueue *)hQue;
292 if (pQue->uCount)
297 hItem = (TI_HANDLE)((TI_UINT8*)pQue->tHead.pPrev - pQue->uNodeHeaderOffset);
299 DelFromTail (pQue->tHead.pPrev); /* remove node from the queue */
300 pQue->uCount--;
304 ((TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset))->pNext = NULL;
311 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Dequeue(): Queue is empty\n");
330 TQueue *pQue = (TQueue *)hQue;
336 if (pQue->uCount < pQue->uLimit)
339 pQueNodeHdr = (TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset);
342 AddToTail (pQueNodeHdr, &pQue->tHead);
343 pQue->uCount++;
346 if (pQue->uCount > pQue->uMaxCount)
347 pQue->uMaxCount = pQue->uCount;
348 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Requeue(): Requeued successfully\n");
361 pQue->uOverflow++;
362 TRACE0(pQue->hReport, REPORT_SEVERITY_ERROR , "que_Requeue(): Queue Overflow\n");
382 TQueue *pQue = (TQueue *)hQue;
384 return (pQue->uCount);
405 TQueue *pQue = (TQueue *)hQue;
408 pQue->uCount, pQue->uMaxCount, pQue->uLimit, pQue->uOverflow,
409 pQue->uNodeHeaderOffset, pQue->tHead.pNext, pQue->tHead.pPrev));