Lines Matching refs: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;
180 if (pQue)
183 if (pQue->uCount)
185 TRACE0(pQue->hReport, REPORT_SEVERITY_WARNING, "que_Destroy() Queue Not Empty!!");
188 os_memoryFree (pQue->hOs, pQue, sizeof(TQueue));
210 TQueue *pQue = (TQueue *)hQue;
212 pQue->hOs = hOs;
213 pQue->hReport = hReport;
233 TQueue *pQue = (TQueue *)hQue;
236 if (pQue)
239 if(pQue->uCount < pQue->uLimit)
242 pQueNodeHdr = (TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset);
248 TRACE0(pQue->hReport, REPORT_SEVERITY_WARNING, "que_Enqueue(): Trying to enqueue an item that is already enqueued!!");
253 AddToHead (pQueNodeHdr, &pQue->tHead);
254 pQue->uCount++;
257 if (pQue->uCount > pQue->uMaxCount)
259 pQue->uMaxCount = pQue->uCount;
261 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Enqueue(): Enqueued Successfully\n");
271 pQue->uOverflow++;
272 TRACE0(pQue->hReport, REPORT_SEVERITY_WARNING , "que_Enqueue(): Queue Overflow\n");
292 TQueue *pQue = (TQueue *)hQue;
295 if (pQue)
297 if (pQue->uCount)
302 hItem = (TI_HANDLE)((TI_UINT8*)pQue->tHead.pPrev - pQue->uNodeHeaderOffset);
304 DelFromTail (pQue->tHead.pPrev); /* remove node from the queue */
305 pQue->uCount--;
309 ((TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset))->pNext = NULL;
317 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Dequeue(): Queue is empty\n");
336 TQueue *pQue = (TQueue *)hQue;
342 if (pQue->uCount < pQue->uLimit)
345 pQueNodeHdr = (TQueNodeHdr *)((TI_UINT8*)hItem + pQue->uNodeHeaderOffset);
350 TRACE0(pQue->hReport, REPORT_SEVERITY_ERROR, "que_Requeue(): Trying to Requeue an item that is already enqueued!!");
355 AddToTail (pQueNodeHdr, &pQue->tHead);
356 pQue->uCount++;
359 if (pQue->uCount > pQue->uMaxCount)
360 pQue->uMaxCount = pQue->uCount;
361 TRACE0(pQue->hReport, REPORT_SEVERITY_INFORMATION , "que_Requeue(): Requeued successfully\n");
374 pQue->uOverflow++;
375 TRACE0(pQue->hReport, REPORT_SEVERITY_ERROR , "que_Requeue(): Queue Overflow\n");
395 TQueue *pQue = (TQueue *)hQue;
397 return (pQue->uCount);
418 TQueue *pQue = (TQueue *)hQue;
421 pQue->uCount, pQue->uMaxCount, pQue->uLimit, pQue->uOverflow,
422 pQue->uNodeHeaderOffset, pQue->tHead.pNext, pQue->tHead.pPrev));
