• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-12-stable/contrib/llvm-project/openmp/runtime/src/

Lines Matching defs:init

343     T ntc, init;
358 init = id * small_chunk + (id < extras ? id : extras);
359 pr->u.p.count = init;
360 pr->u.p.ub = init + small_chunk + (id < extras ? 1 : 0);
394 T init, limit;
406 init = id;
417 init = id * small_chunk + (id < extras ? id : extras);
418 limit = init + small_chunk - (id < extras ? 0 : 1);
423 init = 0;
437 *cur_chunk = limit - init + 1;
440 pr->u.p.lb = lb + init;
445 pr->u.p.lb = lb + init * st;
455 pr->u.p.ordered_lower = init;
1153 UT limit, trip, init;
1203 init = (pr->u.p.count)++;
1204 status = (init < (UT)pr->u.p.ub);
1258 init = (victim->u.p.ub -= (remaining >> 2));
1262 init = (victim->u.p.ub -= 1);
1266 KMP_DEBUG_ASSERT(init + 1 <= limit);
1270 // now update own count and ub with stolen range but init chunk
1272 pr->u.p.count = init + 1;
1303 init = vnew.p.count;
1304 status = (init < (UT)vnew.p.ub);
1366 init = vnew.p.ub;
1367 vold.p.count = init + 1;
1387 init *= chunk;
1388 limit = chunk + init - 1;
1392 KMP_DEBUG_ASSERT(init <= trip);
1399 *p_lb = start + init;
1402 *p_lb = start + init * incr;
1407 pr->u.p.ordered_lower = init;
1443 init = parm1 * (pr->u.p.count + tid);
1445 if ((status = (init <= trip)) != 0) {
1448 limit = parm1 + init - 1;
1459 *p_lb = start + init;
1462 *p_lb = start + init * incr;
1467 pr->u.p.ordered_lower = init;
1482 init = chunk * test_then_inc_acq<ST>((volatile ST *)&sh->u.s.iteration);
1485 if ((status = (init <= trip)) == 0) {
1492 limit = chunk + init - 1;
1502 *p_lb = start + init;
1505 *p_lb = start + init * incr;
1510 pr->u.p.ordered_lower = init;
1526 init = sh->u.s.iteration; // shared value
1527 remaining = trip - init;
1537 init = test_then_add<ST>(RCAST(volatile ST *, &sh->u.s.iteration),
1539 remaining = trip - init;
1546 limit = init + chunkspec - 1;
1549 limit = init + remaining - 1;
1554 limit = init +
1557 (ST)init, (ST)limit)) {
1569 *p_lb = start + init * incr;
1572 pr->u.p.ordered_lower = init;
1595 init = sh->u.s.iteration; // shared value
1596 remaining = trip - init;
1601 KMP_DEBUG_ASSERT(init % chunk == 0);
1606 init = test_then_add<ST>(RCAST(volatile ST *, &sh->u.s.iteration),
1608 remaining = trip - init;
1615 limit = init + chunk - 1;
1618 limit = init + remaining - 1;
1628 limit = init + span;
1630 (ST)init, (ST)limit)) {
1642 *p_lb = start + init * incr;
1645 pr->u.p.ordered_lower = init;
1681 init = chunkIdx * chunkspec + pr->u.p.count;
1682 /* need to verify init > 0 in case of overflow in the above
1684 if ((status = (init > 0 && init <= trip)) != 0) {
1685 limit = init + chunkspec - 1;
1695 This check works around the possible effect that init != 0 for chunkIdx == 0.
1708 init = __kmp_dispatch_guided_remaining<T>(
1710 KMP_DEBUG_ASSERT(init);
1711 init = trip - init;
1713 init = 0;
1716 KMP_ASSERT(init <= limit);
1717 if (init < limit) {
1737 *p_lb = start + init * incr;
1740 pr->u.p.ordered_lower = init;
1763 init = (index * ((2 * parm2) - (index - 1) * parm4)) / 2;
1766 if ((status = ((T)index < parm3 && init <= trip)) == 0) {
1783 *p_lb = start + init;
1786 *p_lb = start + init * incr;
1791 pr->u.p.ordered_lower = init;
1932 UT limit, trip, init;
1939 init = chunk * pr->u.p.count++;
1942 if ((status = (init <= trip)) == 0) {
1956 limit = chunk + init - 1;
1970 *p_lb = start + init;
1973 *p_lb = start + init * incr;
1978 pr->u.p.ordered_lower = init;