- Timestamp:
- Apr 8, 2021, 3:14:56 PM (3 years ago)
- Branches:
- ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum
- Children:
- 56c8b86
- Parents:
- e07b589
- Location:
- doc/theses/thierry_delisle_PhD/code/readyQ_proto
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/theses/thierry_delisle_PhD/code/readyQ_proto/relaxed_list.cpp
re07b589 r7530049d 691 691 692 692 for(const auto & n : nodes) { 693 local.valmax = max(local.valmax, size_t(n.value));694 local.valmin = min(local.valmin, size_t(n.value));693 local.valmax = std::max(local.valmax, size_t(n.value)); 694 local.valmin = std::min(local.valmin, size_t(n.value)); 695 695 } 696 696 … … 773 773 try { 774 774 arg = optarg = argv[optind]; 775 nnodes = st oul(optarg, &len);775 nnodes = std::stoul(optarg, &len); 776 776 if(len != arg.size()) { throw std::invalid_argument(""); } 777 777 } catch(std::invalid_argument &) { … … 792 792 try { 793 793 arg = optarg = argv[optind]; 794 nnodes = st oul(optarg, &len);794 nnodes = std::stoul(optarg, &len); 795 795 if(len != arg.size()) { throw std::invalid_argument(""); } 796 796 } catch(std::invalid_argument &) { … … 812 812 try { 813 813 arg = optarg = argv[optind]; 814 nnodes = st oul(optarg, &len);814 nnodes = std::stoul(optarg, &len); 815 815 if(len != arg.size()) { throw std::invalid_argument(""); } 816 816 nslots = nnodes; … … 823 823 try { 824 824 arg = optarg = argv[optind]; 825 nnodes = st oul(optarg, &len);825 nnodes = std::stoul(optarg, &len); 826 826 if(len != arg.size()) { throw std::invalid_argument(""); } 827 827 } catch(std::invalid_argument &) { … … 831 831 try { 832 832 arg = optarg = argv[optind + 1]; 833 nslots = st oul(optarg, &len);833 nslots = std::stoul(optarg, &len); 834 834 if(len != arg.size()) { throw std::invalid_argument(""); } 835 835 } catch(std::invalid_argument &) { … … 884 884 case 'd': 885 885 try { 886 duration = st od(optarg, &len);886 duration = std::stod(optarg, &len); 887 887 if(len != arg.size()) { throw std::invalid_argument(""); } 888 888 } catch(std::invalid_argument &) { … … 893 893 case 't': 894 894 try { 895 nthreads = st oul(optarg, &len);895 nthreads = std::stoul(optarg, &len); 896 896 if(len != arg.size()) { throw std::invalid_argument(""); } 897 897 } catch(std::invalid_argument &) { … … 902 902 case 'q': 903 903 try { 904 nqueues = st oul(optarg, &len);904 nqueues = std::stoul(optarg, &len); 905 905 if(len != arg.size()) { throw std::invalid_argument(""); } 906 906 } catch(std::invalid_argument &) { -
doc/theses/thierry_delisle_PhD/code/readyQ_proto/snzi-packed.hpp
re07b589 r7530049d 168 168 for(int i = 0; i < width; i++) { 169 169 int idx = i % hwdith; 170 std::cout << i << " -> " << idx + width << std::endl;171 170 leafs[i].parent = &nodes[ idx ]; 172 171 } … … 174 173 for(int i = 0; i < root; i++) { 175 174 int idx = (i / 2) + hwdith; 176 std::cout << i + width << " -> " << idx + width << std::endl;177 175 nodes[i].parent = &nodes[ idx ]; 178 176 } -
doc/theses/thierry_delisle_PhD/code/readyQ_proto/snzi.hpp
re07b589 r7530049d 159 159 std::cout << "SNZI: " << depth << "x" << width << "(" << mask - 1 << ") " << (sizeof(snzi_t::node) * (root + 1)) << " bytes" << std::endl; 160 160 for(int i = 0; i < root; i++) { 161 std::cout << i << " -> " << (i / base) + width << std::endl;162 161 nodes[i].parent = &nodes[(i / base) + width]; 163 162 }
Note: See TracChangeset
for help on using the changeset viewer.