45 void LRUCache::AddCallChain(pid_t tid, std::vector<uint64_t>& ips, std::vector<uint64_t>& sps) {  in AddCallChain()  argument
49     CacheNode* node = GetNode(tid, ips[i], sps[i]);  in AddCallChain()
92           sps.resize(chain.size());  in AddCallChain()
97       sps.push_back(top->sp);  in AddCallChain()
179                            const std::vector<uint64_t>& sps,  in WriteCallChain()  argument
197   MoveToBinaryFormat(sps.data(), ip_count, p);  in WriteCallChain()
207                           std::vector<uint64_t>& ips, std::vector<uint64_t>& sps) {  in ReadCallChain()  argument
227   sps.resize(ip_count);  in ReadCallChain()
228   MoveFromBinaryFormat(sps.data(), ip_count, p);  in ReadCallChain()
235                                         std::vector<uint64_t>& sps) {  in ReadCallChainInReverseOrder()  argument
256   sps.resize(ip_count);  in ReadCallChainInReverseOrder()
257   MoveFromBinaryFormat(sps.data(), ip_count, p);  in ReadCallChainInReverseOrder()
292                                    const std::vector<uint64_t>& sps) {  in AddCallChain()  argument
293   CHECK_EQ(ips.size(), sps.size());  in AddCallChain()
299     if (sps[i] < sps[i - 1]) {  in AddCallChain()
302     } else if (sps[i] == sps[i - 1]) {  in AddCallChain()
304       for (size_t j = i; j > 0 && sps[j - 1] == sps[i]; --j) {  in AddCallChain()
324   return WriteCallChain(original_chains_fp_, pid, tid, type, ips, sps, ip_count);  in AddCallChain()
344   std::vector<uint64_t> sps;  in JoinCallChains()  local
356       if (!ReadCallChainInReverseOrder(pair.first, pid, tid, type, ips, sps)) {  in JoinCallChains()
368       cache.AddCallChain(tid, ips, sps);  in JoinCallChains()
375       if (!WriteCallChain(pair.second, pid, tid, type, ips, sps, ips.size())) {  in JoinCallChains()
386                                        std::vector<uint64_t>& sps) {  in GetNextCallChain()  argument
406   return ReadCallChain(fp, pid, tid, type, ips, sps);  in GetNextCallChain()