Home
last modified time | relevance | path

Searched refs:item (Results 1 – 25 of 87) sorted by relevance

1234

/system/libcppbor/tests/
Dcppbor_test.cpp716 unique_ptr<Item> item = details::makeItem(10); in TEST() local
718 EXPECT_EQ(cppbor::UINT, item->type()); in TEST()
719 EXPECT_NE(nullptr, item->asInt()); in TEST()
720 EXPECT_NE(nullptr, item->asUint()); in TEST()
721 EXPECT_EQ(nullptr, item->asNint()); in TEST()
722 EXPECT_EQ(nullptr, item->asTstr()); in TEST()
723 EXPECT_EQ(nullptr, item->asBstr()); in TEST()
724 EXPECT_EQ(nullptr, item->asSimple()); in TEST()
725 EXPECT_EQ(nullptr, item->asBool()); in TEST()
726 EXPECT_EQ(nullptr, item->asNull()); in TEST()
[all …]
/system/core/libcutils/include_outside_system/cutils/
Dlist.h58 static inline void list_add_tail(struct listnode *head, struct listnode *item) in list_add_tail() argument
60 item->next = head; in list_add_tail()
61 item->prev = head->prev; in list_add_tail()
62 head->prev->next = item; in list_add_tail()
63 head->prev = item; in list_add_tail()
66 static inline void list_add_head(struct listnode *head, struct listnode *item) in list_add_head() argument
68 item->next = head->next; in list_add_head()
69 item->prev = head; in list_add_head()
70 head->next->prev = item; in list_add_head()
71 head->next = item; in list_add_head()
[all …]
/system/core/libcutils/include/cutils/
Dlist.h58 static inline void list_add_tail(struct listnode *head, struct listnode *item) in list_add_tail() argument
60 item->next = head; in list_add_tail()
61 item->prev = head->prev; in list_add_tail()
62 head->prev->next = item; in list_add_tail()
63 head->prev = item; in list_add_tail()
66 static inline void list_add_head(struct listnode *head, struct listnode *item) in list_add_head() argument
68 item->next = head->next; in list_add_head()
69 item->prev = head; in list_add_head()
70 head->next->prev = item; in list_add_head()
71 head->next = item; in list_add_head()
[all …]
/system/chre/util/tests/
Dintrusive_list_test.cc44 EXPECT_EQ(testLinkedList.front().item, nodeA.item); in TEST()
45 EXPECT_EQ(testLinkedList.back().item, nodeC.item); in TEST()
49 EXPECT_EQ(testLinkedList.front().item, nodeB.item); in TEST()
53 EXPECT_EQ(testLinkedList.back().item, nodeB.item); in TEST()
61 EXPECT_EQ(testLinkedList.back().item, nodeD.item); in TEST()
62 EXPECT_EQ(testLinkedList.front().item, nodeD.item); in TEST()
89 EXPECT_EQ(node.item, idx++); in TEST()
131 EXPECT_EQ(testLinkedList.front().item, nodeA.item); in TEST()
132 EXPECT_EQ(testLinkedList.back().item, nodeA.item); in TEST()
136 EXPECT_EQ(testLinkedList.front().item, nodeB.item); in TEST()
[all …]
/system/extras/perf_tools/
Dsbtpull.py47 def sortByDelta(item): argument
48 return item.delta
50 def sortByTimeStamp(item): argument
51 return item.timeStamp
86 def append(self, item): argument
87 self.list.append(item)
95 for item in self.list:
97 timeStart = item.timeStamp
98 timeOffset = item.timeStamp - timeStart
99 sumDelta += item.delta
[all …]
/system/libcppbor/src/
Dcppbor_parse.cpp69 std::unique_ptr<Item> item = std::make_unique<Uint>(value); in handleUint() local
71 parseClient->item(item, hdrBegin, hdrEnd /* valueBegin */, hdrEnd /* itemEnd */)}; in handleUint()
81 std::unique_ptr<Item> item = std::make_unique<Nint>(-1 - static_cast<int64_t>(value)); in handleNint() local
83 parseClient->item(item, hdrBegin, hdrEnd /* valueBegin */, hdrEnd /* itemEnd */)}; in handleNint()
89 std::unique_ptr<Item> item = std::make_unique<Bool>(value == TRUE); in handleBool() local
91 parseClient->item(item, hdrBegin, hdrEnd /* valueBegin */, hdrEnd /* itemEnd */)}; in handleBool()
96 std::unique_ptr<Item> item = std::make_unique<Null>(); in handleNull() local
98 parseClient->item(item, hdrBegin, hdrEnd /* valueBegin */, hdrEnd /* itemEnd */)}; in handleNull()
112 std::unique_ptr<Item> item = std::make_unique<T>(valueBegin, valueBegin + length); in handleString() local
114 parseClient->item(item, hdrBegin, valueBegin, valueBegin + length)}; in handleString()
[all …]
Dcppbor.cpp91 bool prettyPrintInternal(const Item* item, string& out, size_t indent, size_t maxBStrSize, in prettyPrintInternal() argument
93 if (!item) { in prettyPrintInternal()
102 size_t tagCount = item->semanticTagCount(); in prettyPrintInternal()
105 snprintf(buf, sizeof(buf), "tag %" PRIu64 " ", item->semanticTag(tagCount)); in prettyPrintInternal()
109 switch (item->type()) { in prettyPrintInternal()
115 snprintf(buf, sizeof(buf), "%" PRIu64, item->asUint()->unsignedValue()); in prettyPrintInternal()
120 snprintf(buf, sizeof(buf), "%" PRId64, item->asNint()->value()); in prettyPrintInternal()
127 const Bstr* bstr = item->asBstr(); in prettyPrintInternal()
133 const ViewBstr* viewBstr = item->asViewBstr(); in prettyPrintInternal()
169 if (item->asTstr() != nullptr) { in prettyPrintInternal()
[all …]
/system/extras/boottime_tools/bootanalyze/
Dbootanalyze.py83 for item in items:
84 kv = item.split("=")
191 for item in list(shutdown_event_all.items()):
192 num_runs = len(item[1])
194 item[0], sum(item[1])/num_runs, stddev(item[1]),\
195 "*time taken" if item[0].startswith("init.") else "",\
199 for item in list(shutdown_timing_event_all.items()):
200 num_runs = len(item[1])
202 item[0], sum(item[1])/num_runs, stddev(item[1]),\
203 "*time taken" if item[0].startswith("init.") else "",\
[all …]
/system/extras/simpleperf/
DSampleDisplayer.h211 Item item; in AddDisplayFunction() local
212 item.name = name; in AddDisplayFunction()
213 item.width = name.size(); in AddDisplayFunction()
214 item.func = func; in AddDisplayFunction()
215 item.func_with_info = nullptr; in AddDisplayFunction()
216 display_v_.push_back(item); in AddDisplayFunction()
221 Item item; in AddDisplayFunction() local
222 item.name = name; in AddDisplayFunction()
223 item.width = name.size(); in AddDisplayFunction()
224 item.func = nullptr; in AddDisplayFunction()
[all …]
/system/core/libutils/binder/include/utils/
DVectorImpl.h77 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1);
80 void push(const void* item);
82 ssize_t add(const void* item);
84 ssize_t replaceAt(const void* item, size_t index);
105 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
116 inline void _do_splat(void* dest, const void* item, size_t num) const;
141 ssize_t indexOf(const void* item) const;
144 size_t orderOf(const void* item) const;
147 ssize_t add(const void* item);
154 ssize_t remove(const void* item);
[all …]
DVector.h157 void push(const TYPE& item);
161 ssize_t add(const TYPE& item);
165 ssize_t replaceAt(const TYPE& item, size_t index);
203 inline void push_back(const TYPE& item) { insertAt(item, size(), 1); } in push_back() argument
204 inline void push_front(const TYPE& item) { insertAt(item, 0, 1); } in push_front() argument
214 virtual void do_splat(void* dest, const void* item, size_t num) const;
323 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) { in insertAt() argument
324 return VectorImpl::insertAt(&item, index, numItems); in insertAt()
328 void Vector<TYPE>::push(const TYPE& item) { in push() argument
329 return VectorImpl::push(&item); in push()
[all …]
/system/core/libutils/include/utils/
DVectorImpl.h77 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1);
80 void push(const void* item);
82 ssize_t add(const void* item);
84 ssize_t replaceAt(const void* item, size_t index);
105 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
116 inline void _do_splat(void* dest, const void* item, size_t num) const;
141 ssize_t indexOf(const void* item) const;
144 size_t orderOf(const void* item) const;
147 ssize_t add(const void* item);
154 ssize_t remove(const void* item);
[all …]
DSortedVector.h86 ssize_t indexOf(const TYPE& item) const;
89 size_t orderOf(const TYPE& item) const;
108 ssize_t add(const TYPE& item);
148 virtual void do_splat(void* dest, const void* item, size_t num) const;
220 ssize_t SortedVector<TYPE>::add(const TYPE& item) { in add() argument
221 return SortedVectorImpl::add(&item); in add()
225 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const { in indexOf() argument
226 return SortedVectorImpl::indexOf(&item); in indexOf()
230 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const { in orderOf() argument
231 return SortedVectorImpl::orderOf(&item); in orderOf()
[all …]
DVector.h157 void push(const TYPE& item);
161 ssize_t add(const TYPE& item);
165 ssize_t replaceAt(const TYPE& item, size_t index);
203 inline void push_back(const TYPE& item) { insertAt(item, size(), 1); } in push_back() argument
204 inline void push_front(const TYPE& item) { insertAt(item, 0, 1); } in push_front() argument
214 virtual void do_splat(void* dest, const void* item, size_t num) const;
323 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) { in insertAt() argument
324 return VectorImpl::insertAt(&item, index, numItems); in insertAt()
328 void Vector<TYPE>::push(const TYPE& item) { in push() argument
329 return VectorImpl::push(&item); in push()
[all …]
DKeyedVector.h86 ssize_t add(const KEY& key, const VALUE& item);
87 ssize_t replaceValueFor(const KEY& key, const VALUE& item);
88 ssize_t replaceValueAt(size_t index, const VALUE& item);
182 ssize_t KeyedVector<KEY,VALUE>::replaceValueAt(size_t index, const VALUE& item) { in replaceValueAt() argument
184 mVector.editItemAt(index).value = item; in replaceValueAt()
/system/core/libutils/binder/
DVectorImpl.cpp145 ssize_t VectorImpl::insertAt(const void* item, size_t index, size_t numItems) in insertAt() argument
151 if (item) { in insertAt()
152 _do_splat(where, item, numItems); in insertAt()
181 void* item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort() local
183 if (cmp(curr, item, state) > 0) { in sort()
191 item = reinterpret_cast<char*>(array) + mItemSize*(i); in sort()
197 _do_copy(temp, item, 1); in sort()
237 void VectorImpl::push(const void* item) in push() argument
239 insertAt(item, size()); in push()
247 ssize_t VectorImpl::add(const void* item) in add() argument
[all …]
/system/extras/boottime_tools/io_analysis/
Dcheck_io_trace_all.py101 key = lambda item: item[1], reverse = True))
108 key = lambda item: item[1], reverse = True))
190 key = lambda item: item[1].total_reads + item[1].total_writes, reverse = True))
199 key = lambda item: item[1].total_writes, reverse = True))
208 key = lambda item: item[1], reverse = True))
215 key = lambda item: item[1], reverse = True))
290 key = lambda item: item[0], reverse = False))
293 key = lambda item: item[1], reverse = True))
296 key = lambda item: item[1], reverse = True))
299 key = lambda item: item[0], reverse = False))
[all …]
/system/libhidl/base/
DSynchronizedQueue.h42 bool push(const T& item);
79 T item = mQueue.front(); in wait_pop() local
82 return item; in wait_pop()
86 bool SynchronizedQueue<T>::push(const T &item) { in push() argument
91 mQueue.push(item); in push()
/system/tools/hidl/c2hal/test/
Dbuild_all.py75 for item in listdir(path):
76 if not isfile(path_join(path, item)):
79 if not item.endswith(".h"):
82 yield item
/system/chre/chpp/test/fuzz/
Dchpp_wifi_scan_param_fuzzer.cpp39 struct chreWifiSsidListItem item = {}; in LLVMFuzzerTestOneInput() local
40 item.ssidLen = fdp.ConsumeIntegral<uint8_t>(); in LLVMFuzzerTestOneInput()
41 fdp.ConsumeData(item.ssid, item.ssidLen); in LLVMFuzzerTestOneInput()
/system/tools/hidl/c2hal/
DScope.h36 void enter(std::string name, T item);
48 void Scope<T>::enter(std::string name, T item) { in enter() argument
56 mScopeContents[name] = item; in enter()
/system/extras/perf_tools/bats/
Dlcan.py252 def add(item): argument
276 item = self.map.get(newItem.key)
277 if item==None:
280 item.add(newItem)
294 for index, item in other.map.items():
295 if item.key in self.map:
296 self.map[item.key].addValue(item)
298 self.map[item.key] = item
301 for index, item in self.map:
302 item.divideValue(number)
[all …]
/system/security/identity/
DCredentialData.cpp143 optional<SecureAccessControlProfile> parseSacp(const cppbor::Item& item) { in parseSacp() argument
144 const cppbor::Array* array = item.asArray(); in parseSacp()
174 optional<AuthKeyData> parseAuthKeyData(const cppbor::Item& item) { in parseAuthKeyData() argument
175 const cppbor::Array* array = item.asArray(); in parseAuthKeyData()
210 vector<int32_t> parseAccessControlProfileIds(const cppbor::Item& item) { in parseAccessControlProfileIds() argument
211 const cppbor::Array* array = item.asArray(); in parseAccessControlProfileIds()
229 optional<vector<vector<uint8_t>>> parseEncryptedChunks(const cppbor::Item& item) { in parseEncryptedChunks() argument
230 const cppbor::Array* array = item.asArray(); in parseEncryptedChunks()
265 auto [item, _ /* newPos */, message] = cppbor::parse(data.value()); in loadFromDisk()
266 if (item == nullptr) { in loadFromDisk()
[all …]
/system/libcppbor/include/cppbor/
Dcppbor_parse.h170 virtual ParseClient* item(std::unique_ptr<Item>& item, const uint8_t* hdrBegin,
184 virtual ParseClient* itemEnd(std::unique_ptr<Item>& item, const uint8_t* hdrBegin,
/system/tools/aidl/
Daidl.cpp294 for (const auto& item : items) { in CheckAndAssignMethodIDs() local
301 if (!item->IsUserDefined()) { in CheckAndAssignMethodIDs()
304 if (item->HasId()) { in CheckAndAssignMethodIDs()
307 item->SetId(newId++); in CheckAndAssignMethodIDs()
312 AIDL_ERROR(item) << "You must either assign id's to all methods or to none of them."; in CheckAndAssignMethodIDs()
317 if (usedIds.find(item->GetId()) != usedIds.end()) { in CheckAndAssignMethodIDs()
319 AIDL_ERROR(item) << "Found duplicate method id (" << item->GetId() << ") for method " in CheckAndAssignMethodIDs()
320 << item->GetName(); in CheckAndAssignMethodIDs()
323 usedIds.insert(item->GetId()); in CheckAndAssignMethodIDs()
326 if (item->GetId() < kMinUserSetMethodId || item->GetId() > kMaxUserSetMethodId) { in CheckAndAssignMethodIDs()
[all …]

1234