Home
last modified time | relevance | path

Searched refs:curKey (Results 1 – 3 of 3) sorted by relevance

/system/bpf/libbpf_android/include/bpf/
DBpfMap.h193 base::Result<Key> curKey = getFirstKey(); in iterate() local
194 while (curKey.ok()) { in iterate()
195 const base::Result<Key>& nextKey = getNextKey(curKey.value()); in iterate()
196 base::Result<void> status = filter(curKey.value(), *this); in iterate()
198 curKey = nextKey; in iterate()
200 if (curKey.error().code() == ENOENT) return {}; in iterate()
201 return curKey.error(); in iterate()
208 base::Result<Key> curKey = getFirstKey(); in iterateWithValue() local
209 while (curKey.ok()) { in iterateWithValue()
210 const base::Result<Key>& nextKey = getNextKey(curKey.value()); in iterateWithValue()
[all …]
/system/netd/libnetdbpf/include/netdbpf/
DBpfNetworkStats.h76 const Key& curKey, int64_t* unknownIfaceBytesTotal) { in getIfaceNameFromMap() argument
79 maybeLogUnknownIface(ifaceIndex, statsMap, curKey, unknownIfaceBytesTotal); in getIfaceNameFromMap()
88 const Key& curKey, int64_t* unknownIfaceBytesTotal) { in maybeLogUnknownIface() argument
95 auto statsEntry = statsMap.readValue(curKey); in maybeLogUnknownIface()
/system/netd/libnetdbpf/
DBpfNetworkStatsTest.cpp373 StatsKey curKey = { in TEST_F() local
382 ifname, curKey, &unknownIfaceBytesTotal)); in TEST_F()
384 curKey.ifaceIndex = IFACE_INDEX2; in TEST_F()
386 ifname, curKey, &unknownIfaceBytesTotal)); in TEST_F()