src/mem/stack_dist_calc.cc

48     : index(0),
79             // each map entry contains an index and a node
124                  "Error in sum left of level %ul, node index %ull, "
128                  "Error in sum right of level %ul, node index %ull, "
243 // index%2 == 0 (i.e. every alternate cycle)
245 // OP1. moving the root node one layer up if index counter
254     if (isPowerOf2(index)) {
255         // OP1. moving the root node one layer up if index counter
257         // If index counter crosses a power of 2, then add a
310         // At layer 1 a new INode is added whenever index%(2^1)==0
313         // At layer 2 a new INode is added whenever index%(2^2)==0
316         // At layer 3 a new INode is added whenever index%(2^3)==0
320         // At layer N a new INode is added whenever index%(2^N)==0
327             if ((index % (1 << i)) == 0) {
328                 // Checks if current (index % 2^treeDepth) == 0 if true
374     // Update tree from leaves by making B(found index) = 0
379         // save the index counter value when this address was
380         // encountered before and update it to the current index value
384             // Update aiMap aiMap(Address) = current index
385             ai->second   = index;
401             // Update aiMap aiMap(Address) = current index
402             aiMap[r_address] = index;
410         // If index%2 == 0 then update tree
411         if (index % 2 == 0) {
414             // At odd values of index counter, a new right-type node is
420         // set n_index = current index
423         newLeafNode->nodeIndex=index;
427         tree[0][index] = newLeafNode;
430         updateSumsLeavesToRoot(tree[0][index], true);
438             sanityCheckTree(tree[0][index]);
449         // The index counter is updated at the end of each transaction
451         ++index;
477         // save the index counter value when this address was
578         // Lookup aiMap using the index returned by the leaf iterator