Lines Matching defs:queue
55 const ConstructQueue &queue,
1078 /// \param [in] queue - work queue with nested constructs.
1079 /// \param [in] item - item in the queue to generate body for.
1081 const ConstructQueue &queue,
1107 if (lower::omp::isLastItemInQueue(item, queue) &&
1123 Fortran::lower::omp::isLastItemInQueue(item, queue),
1139 next != queue.end()) {
1141 info.loc, queue, next);
1235 const mlir::Location ¤tLocation, const ConstructQueue &queue,
1263 next != queue.end()) {
1264 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
1310 const mlir::Location ¤tLocation, const ConstructQueue &queue,
1428 if (lower::omp::isLastItemInQueue(item, queue) &&
1450 next != queue.end()) {
1451 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
1462 const ConstructQueue &queue,
1466 createBodyOfOp(*op, info, queue, item);
1793 mlir::Location loc, const ConstructQueue &queue,
1802 const ConstructQueue &queue, ConstructQueue::const_iterator item,
1826 queue, item, nameAttr);
1833 const ConstructQueue &queue, ConstructQueue::const_iterator item) {
1845 mlir::Location loc, const ConstructQueue &queue,
1866 queue, item, clauseOps);
1873 const ConstructQueue &queue,
1898 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, item,
1906 mlir::Location loc, const ConstructQueue &queue,
1915 queue, item, clauseOps);
1921 mlir::Location loc, const ConstructQueue &queue,
1926 queue, item);
1932 mlir::Location loc, const ConstructQueue &queue,
1942 const ConstructQueue &queue,
1950 queue, item, clauseOps);
1957 const ConstructQueue &queue, ConstructQueue::const_iterator item,
1979 genOpWithBody<mlir::omp::ParallelOp>(genInfo, queue, item, clauseOps);
1991 const ConstructQueue &queue, ConstructQueue::const_iterator item,
2003 lower::omp::isLastItemInQueue(item, queue),
2113 const ConstructQueue &queue,
2121 mlir::Location loc, const ConstructQueue &queue,
2130 queue, item, clauseOps);
2136 mlir::Location loc, const ConstructQueue &queue,
2156 lower::omp::isLastItemInQueue(item, queue),
2271 queue, item, dsp);
2283 const ConstructQueue &queue,
2308 loc, queue, item);
2316 const ConstructQueue &queue, ConstructQueue::const_iterator item) {
2342 mlir::Location loc, const ConstructQueue &queue,
2353 queue, item, clauseOps);
2356 lower::omp::isLastItemInQueue(item, queue),
2378 queue, item, clauseOps);
2385 const ConstructQueue &queue,
2394 queue, item, clauseOps);
2401 const ConstructQueue &queue,
2413 const ConstructQueue &queue,
2422 const ConstructQueue &queue,
2433 queue, item, clauseOps);
2439 mlir::Location loc, const ConstructQueue &queue,
2465 queue, item, clauseOps);
2478 const ConstructQueue &queue,
2502 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, item,
2511 const ConstructQueue &queue,
2538 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, item,
2548 const ConstructQueue &queue,
2560 lower::omp::isLastItemInQueue(item, queue),
2571 genParallelOp(converter, symTable, semaCtx, eval, loc, queue, item,
2580 const ConstructQueue &queue,
2605 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, item,
2615 const ConstructQueue &queue,
2627 mlir::Location loc, const ConstructQueue &queue,
2631 assert(std::distance(item, queue.end()) == 3 && "Invalid leaf constructs");
2652 genParallelOp(converter, symTable, semaCtx, eval, loc, queue, parallelItem,
2685 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, doItem,
2694 mlir::Location loc, const ConstructQueue &queue,
2698 assert(std::distance(item, queue.end()) == 4 && "Invalid leaf constructs");
2720 genParallelOp(converter, symTable, semaCtx, eval, loc, queue, parallelItem,
2766 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, simdItem,
2779 const ConstructQueue &queue,
2783 assert(std::distance(item, queue.end()) == 2 && "Invalid leaf constructs");
2825 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, simdItem,
2835 const ConstructQueue &queue,
2839 assert(std::distance(item, queue.end()) == 2 && "Invalid leaf constructs");
2884 genLoopNestOp(converter, symTable, semaCtx, eval, loc, queue, simdItem,
2895 const ConstructQueue &queue,
2897 assert(std::distance(item, queue.end()) == 2 && "Invalid leaf constructs");
2910 const ConstructQueue &queue,
2919 if (matchLeafSequence(item, queue, Directive::OMPD_distribute_parallel_do))
2921 queue, item);
2922 else if (matchLeafSequence(item, queue,
2925 loc, queue, item);
2926 else if (matchLeafSequence(item, queue, Directive::OMPD_distribute_simd))
2927 genCompositeDistributeSimd(converter, symTable, semaCtx, eval, loc, queue,
2929 else if (matchLeafSequence(item, queue, Directive::OMPD_do_simd))
2930 genCompositeDoSimd(converter, symTable, semaCtx, eval, loc, queue, item);
2931 else if (matchLeafSequence(item, queue, Directive::OMPD_taskloop_simd))
2932 genCompositeTaskloopSimd(converter, symTable, semaCtx, eval, loc, queue,
2944 const ConstructQueue &queue,
2946 assert(item != queue.end());
2952 if (genOMPCompositeDispatch(converter, symTable, semaCtx, eval, loc, queue,
2961 genBarrierOp(converter, symTable, semaCtx, eval, loc, queue, item);
2964 genStandaloneDistribute(converter, symTable, semaCtx, eval, loc, queue,
2968 genStandaloneDo(converter, symTable, semaCtx, eval, loc, queue, item);
2971 genLoopOp(converter, symTable, semaCtx, eval, loc, queue, item);
2974 genMaskedOp(converter, symTable, semaCtx, eval, loc, queue, item);
2977 genMasterOp(converter, symTable, semaCtx, eval, loc, queue, item);
2981 genOrderedRegionOp(converter, symTable, semaCtx, eval, loc, queue, item);
2984 genStandaloneParallel(converter, symTable, semaCtx, eval, loc, queue, item);
2996 // This code path is still taken when iterating through the construct queue
3000 genStandaloneSimd(converter, symTable, semaCtx, eval, loc, queue, item);
3003 genScopeOp(converter, symTable, semaCtx, eval, loc, queue, item);
3006 genSingleOp(converter, symTable, semaCtx, eval, loc, queue, item);
3009 genTargetOp(converter, symTable, semaCtx, eval, loc, queue, item);
3012 genTargetDataOp(converter, symTable, semaCtx, eval, loc, queue, item);
3016 converter, symTable, semaCtx, loc, queue, item);
3020 converter, symTable, semaCtx, loc, queue, item);
3024 converter, symTable, semaCtx, loc, queue, item);
3027 genTaskOp(converter, symTable, semaCtx, eval, loc, queue, item);
3030 genTaskgroupOp(converter, symTable, semaCtx, eval, loc, queue, item);
3033 genStandaloneTaskloop(converter, symTable, semaCtx, eval, loc, queue, item);
3036 genTaskwaitOp(converter, symTable, semaCtx, eval, loc, queue, item);
3039 genTaskyieldOp(converter, symTable, semaCtx, eval, loc, queue, item);
3042 genTeamsOp(converter, symTable, semaCtx, eval, loc, queue, item);
3050 genWorkshareOp(converter, symTable, semaCtx, eval, loc, queue, item);
3054 // of leaf constructs when building the construct queue.
3168 ConstructQueue queue{
3173 genOrderedOp(converter, symTable, semaCtx, eval, currentLocation, queue,
3174 queue.begin());
3177 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
3178 queue.begin());
3200 ConstructQueue queue{buildConstructQueue(
3204 queue, queue.begin());
3370 ConstructQueue queue{
3373 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
3374 queue.begin());
3385 ConstructQueue queue{buildConstructQueue(
3391 genCriticalOp(converter, symTable, semaCtx, eval, currentLocation, queue,
3392 queue.begin(), name);
3438 ConstructQueue queue{
3441 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
3442 queue.begin());
3472 ConstructQueue queue{
3475 ConstructQueue::iterator next = queue.begin();
3477 while (next != queue.end() &&
3479 genOMPDispatch(converter, symTable, semaCtx, eval, currentLocation, queue,
3486 assert(next != queue.end());
3488 genSectionsOp(converter, symTable, semaCtx, eval, currentLocation, queue,
3490 assert(std::next(next) == queue.end());