Lines Matching defs:labels

242 // When sorting by labels, __kmp_affinity_assign_child_nums() must first be
243 // called to renumber the labels from [0..n] and place them into the child_num
244 // vector of the address object. This is done in case the labels used for
250 // because we are paying attention to the labels themselves, not the ordinal
262 lastLabel[labCt] = address2os[0].first.labels[labCt];
267 if (address2os[i].first.labels[labCt] != lastLabel[labCt]) {
271 lastLabel[labCt2] = address2os[i].first.labels[labCt2];
274 lastLabel[labCt] = address2os[i].first.labels[labCt];
342 __kmp_str_buf_print(&buf, "%d ", address2os[proc].first.labels[level]);
360 addrP[proc].first.labels[0]);
363 int label = 1; // iterate over labels
368 addrP[proc].first.labels[label++]);
373 addrP[proc].first.labels[label++]);
377 addrP[proc].first.labels[label++]);
381 addrP[proc].first.labels[label++]);
395 // level if it offers no unique labels. So they are removed.
407 if (addrP[0].first.labels[level] != addrP[i].first.labels[level]) {
425 // For other levels, we move labels over and also reduce the depth
429 addrP[i].first.labels[j] = addrP[i].first.labels[j + 1];
492 int *labels) {
511 addr.labels[i] = labels[i]; // package, etc.
512 addr.labels[depth] = core_id; // core
513 addr.labels[depth + 1] = pu_id; // pu
604 int labels[3] = {0}; // package [,node] [,tile] - head of lables array
630 labels[0] = socket_id;
638 labels[1] = node_id;
647 labels[2] = tl_id;
650 n_active_cores, tile, 3, labels);
666 n_active_cores, node, 2, labels);
688 labels[1] = tl_id;
691 n_active_cores, tile, 2, labels);
707 socket, 1, labels);
747 addr.labels[0] = retval[0].first.labels[0];
933 addr.labels[0] = i;
984 addr.labels[0] = i / (CHAR_BIT * sizeof(DWORD_PTR));
985 addr.labels[1] = i % (CHAR_BIT * sizeof(DWORD_PTR));
989 KMP_INFORM(AffOSProcToGroup, "KMP_AFFINITY", i, addr.labels[0],
990 addr.labels[1]);
1291 addr.labels[0] = threadInfo[0].pkgId;
1449 addr.labels[d++] = threadInfo[i].pkgId;
1452 addr.labels[d++] = threadInfo[i].coreId;
1455 addr.labels[d++] = threadInfo[i].threadId;
1578 // thread) to the coarsest. The caller expects that we will place the labels
1579 // in (*address2os)[].first.labels[] in the inverse order, so we need to
1642 // Extract labels for each level in the machine topology map from Apic ID.
1655 addr.labels[depth - level - 1] = apicId >> prev_shift;
1661 addr.labels[depth - level - 1] = (apicId & mask) >> prev_shift;
1707 addr.labels[0] = retval[0].first.labels[pkgLevel];
1735 last[level] = retval[0].first.labels[level];
1740 // (*address2os)[].first.labels[] - in the previous loops, we iterated
1745 if (retval[proc].first.labels[level] != last[level]) {
1758 last[j] = retval[proc].first.labels[j];
1765 last[level] = retval[proc].first.labels[level];
1890 new_retval[proc].first.labels[new_level] =
1891 retval[proc].first.labels[level];
2355 addr.labels[0] = threadInfo[0][pkgIdIndex];
2626 addr.labels[dst_index] = threadInfo[i][src_index];
4011 if (address2os[i].first.labels[j] > 0) {
4032 if (address2os[i + 1].first.labels[j] > 0) {
4066 int percore = address2os[i].first.labels[core_level + 1] + 1;