/dports/security/cryptlib/cryptlib-3.4.3/kernel/ |
H A D | sendmsg.c | 1126 ORIGINAL_INT_VAR( queueEnd, krnlData->queueEnd ); in enqueueMessage() 1138 if( krnlData->queueEnd < 0 || \ in enqueueMessage() 1188 krnlData->queueEnd++; in enqueueMessage() 1194 ENSURES( krnlData->queueEnd == ORIGINAL_VALUE( queueEnd ) + 1 ); in enqueueMessage() 1212 ORIGINAL_INT_VAR( queueEnd, krnlData->queueEnd ); 1222 i < krnlData->queueEnd - 1 && \ 1228 krnlData->queueEnd--; 1232 ENSURES( krnlData->queueEnd == ORIGINAL_VALUE( queueEnd ) - 1 ); 1235 FORALL( i, 0, krnlData->queueEnd, 1292 FORALL( i, 0, krnlData->queueEnd, in getNextMessage() [all …]
|
H A D | kernel.h | 363 BUFFER( MESSAGE_QUEUE_SIZE, queueEnd ) \ 365 int queueEnd; /* Points past last queue element */ member
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/hxt/reparam/src/ |
H A D | hxt_linear_system_lu.c | 145 int queueEnd = 1; in reverseCuthillMckee() local 160 queue[queueEnd++] = o; in reverseCuthillMckee() 163 while(k < queueEnd && nodeDegree[queue[k]] < nodeDegree[o]) in reverseCuthillMckee() 165 for (int l = queueEnd; l > k; --l) in reverseCuthillMckee() 168 queueEnd++; in reverseCuthillMckee() 174 stageEnd = queueEnd; in reverseCuthillMckee()
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/d3xp/ai/ |
H A D | AAS_pathing.cpp | 610 int *areaQueue, curArea, queueStart, queueEnd; in GetWallEdges() local 627 queueEnd = 0; in GetWallEdges() 631 for ( curArea = areaNum; queueStart < queueEnd; curArea = areaQueue[++queueStart] ) { in GetWallEdges() 708 areaQueue[queueEnd++] = reach->toAreaNum; in GetWallEdges()
|
H A D | AI_pathing.cpp | 156 int i, j, k, n, bestObstacle, bestEdgeNum, queueStart, queueEnd, edgeNums[2]; in GetPointOutsideObstacles() local 212 queueEnd = 1; in GetPointOutsideObstacles() 219 for ( i = queue[0]; queueStart < queueEnd; i = queue[++queueStart] ) { in GetPointOutsideObstacles() 234 queue[queueEnd++] = j; in GetPointOutsideObstacles()
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/game/ai/ |
H A D | AAS_pathing.cpp | 610 int *areaQueue, curArea, queueStart, queueEnd; in GetWallEdges() local 627 queueEnd = 0; in GetWallEdges() 631 for ( curArea = areaNum; queueStart < queueEnd; curArea = areaQueue[++queueStart] ) { in GetWallEdges() 708 areaQueue[queueEnd++] = reach->toAreaNum; in GetWallEdges()
|
H A D | AI_pathing.cpp | 158 int i, j, k, n, bestObstacle, bestEdgeNum, queueStart, queueEnd, edgeNums[2]; in GetPointOutsideObstacles() local 214 queueEnd = 1; in GetPointOutsideObstacles() 221 for ( i = queue[0]; queueStart < queueEnd; i = queue[++queueStart] ) { in GetPointOutsideObstacles() 236 queue[queueEnd++] = j; in GetPointOutsideObstacles()
|
/dports/databases/casstcl/casstcl-2.15.0/generic/ |
H A D | casstcl_future.c | 107 int queueEnd = ((fcd->flags & CASSTCL_FUTURE_QUEUE_HEAD_FLAG) == CASSTCL_FUTURE_QUEUE_HEAD_FLAG) ? in casstcl_future_callback() local 109 Tcl_ThreadQueueEvent(fcd->ct->threadId, (Tcl_Event *)evPtr, queueEnd); in casstcl_future_callback()
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/game/ |
H A D | BrittleFracture.cpp | 897 int queueStart, queueEnd; in DropFloatingIslands() local 922 queueEnd = 1; in DropFloatingIslands() 931 for ( curShard = queue[queueStart]; queueStart < queueEnd; curShard = queue[++queueStart] ) { in DropFloatingIslands() 945 queue[queueEnd++] = nextShard; in DropFloatingIslands() 957 for ( j = 0; j < queueEnd; j++ ) { in DropFloatingIslands()
|
H A D | Pvs.cpp | 892 int queueStart, queueEnd; in GetConnectedAreas() local 897 queueEnd = 0; in GetConnectedAreas() 900 for ( curArea = srcArea; queueStart < queueEnd; curArea = areaQueue[++queueStart] ) { in GetConnectedAreas() 920 areaQueue[queueEnd++] = nextArea; in GetConnectedAreas()
|
/dports/biology/hyphy/hyphy-2.5.33/src/core/ |
H A D | likefuncocl.cpp | 120 struct timespec mainStart, mainEnd, bufferStart, bufferEnd, queueStart, queueEnd, setupStart, setup… variable 993 clock_gettime(CLOCK_MONOTONIC, &queueEnd); in oclmain() 994 …queueSecs += (queueEnd.tv_sec - queueStart.tv_sec)+(queueEnd.tv_nsec - queueStart.tv_nsec)/BILLION; in oclmain()
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/d3xp/ |
H A D | BrittleFracture.cpp | 927 int queueStart, queueEnd; in DropFloatingIslands() local 952 queueEnd = 1; in DropFloatingIslands() 961 for ( curShard = queue[queueStart]; queueStart < queueEnd; curShard = queue[++queueStart] ) { in DropFloatingIslands() 975 queue[queueEnd++] = nextShard; in DropFloatingIslands() 987 for ( j = 0; j < queueEnd; j++ ) { in DropFloatingIslands()
|
H A D | Pvs.cpp | 892 int queueStart, queueEnd; in GetConnectedAreas() local 897 queueEnd = 0; in GetConnectedAreas() 900 for ( curArea = srcArea; queueStart < queueEnd; curArea = areaQueue[++queueStart] ) { in GetConnectedAreas() 920 areaQueue[queueEnd++] = nextArea; in GetConnectedAreas()
|
/dports/games/dhewm3/dhewm3-1.5.1/neo/idlib/geometry/ |
H A D | Surface.cpp | 605 int queueStart, queueEnd; in IsConnected() local 623 queueEnd = 1; in IsConnected() 627 for ( curTri = queue[queueStart]; queueStart < queueEnd; curTri = queue[++queueStart] ) { in IsConnected() 646 queue[queueEnd++] = nextTri; in IsConnected()
|
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/peep/ |
H A D | GuestPathfinding.cpp | 1800 TileCoordsXY queueEnd = { 0, 0 }; in get_ride_queue_end() local 1837 queueEnd = nextTile; in get_ride_queue_end() 1928 loc.x = queueEnd.x; in get_ride_queue_end() 1929 loc.y = queueEnd.y; in get_ride_queue_end()
|
/dports/databases/akonadi/akonadi-21.12.3/src/agentbase/ |
H A D | resourcescheduler.cpp | 613 const QList<Task>::const_iterator queueEnd(queue.constEnd()); in dumpToString() local 614 for (QList<Task>::const_iterator it = queue.constBegin(); it != queueEnd; ++it) { in dumpToString()
|
/dports/databases/pgbackrest/pgbackrest-release-2.35/src/command/backup/ |
H A D | backup.c | 1431 int queueEnd = queueIdx; in backupJobCallback() local 1479 while (queueIdx != queueEnd); in backupJobCallback()
|
/dports/databases/pgbackrest/pgbackrest-release-2.35/src/command/restore/ |
H A D | restore.c | 2129 int queueEnd = queueIdx; in restoreJobCallback() local 2176 while (queueIdx != queueEnd); in restoreJobCallback()
|