chains            781 src/Elf.cpp        uint32_t *chains = buckets + bucket_count;
chains            785 src/Elf.cpp            chains[i] = buckets[hash];
chains            292 src/LoopCarry.cpp         vector<vector<int>> chains;
chains            302 src/LoopCarry.cpp                     chains.push_back({j, i});
chains            310 src/LoopCarry.cpp         if (chains.empty()) {
chains            318 src/LoopCarry.cpp             for (size_t i = 0; i < chains.size(); i++) {
chains            319 src/LoopCarry.cpp                 if (chains[i].empty()) continue;
chains            320 src/LoopCarry.cpp                 for (size_t j = 0; j < chains.size(); j++) {
chains            321 src/LoopCarry.cpp                     if (chains[j].empty()) continue;
chains            322 src/LoopCarry.cpp                     if (chains[i].back() == chains[j].front()) {
chains            323 src/LoopCarry.cpp                         chains[i].insert(chains[i].end(), chains[j].begin()+1, chains[j].end());
chains            324 src/LoopCarry.cpp                         chains[j].clear();
chains            330 src/LoopCarry.cpp             for (size_t i = 0; i < chains.size(); i++) {
chains            331 src/LoopCarry.cpp                 while (i < chains.size() && chains[i].empty()) {
chains            332 src/LoopCarry.cpp                     chains[i].swap(chains.back());
chains            333 src/LoopCarry.cpp                     chains.pop_back();
chains            340 src/LoopCarry.cpp         std::sort(chains.begin(), chains.end(),
chains            343 src/LoopCarry.cpp         for (const vector<int> &c : chains) {
chains            355 src/LoopCarry.cpp         for (const vector<int> &c : chains) {
chains            366 src/LoopCarry.cpp         chains.swap(trimmed);
chains            385 src/LoopCarry.cpp         for (const vector<int> &c : chains) {
chains            158 src/runtime/hexagon_remote/dlib.cpp             return chains()[sym];