| /external/mesa3d/src/vulkan/wsi/ |
| wsi_common_queue.h | 92 uint32_t *elem; local
99 elem = u_vector_add(&queue->vector);
100 *elem = index;
145 uint32_t *elem = u_vector_remove(&queue->vector); local
146 *index = *elem;
|
| /external/perfetto/src/traced/probes/filesystem/ |
| prefix_finder.cc | 89 std::pair<std::string, size_t>& elem = state_[i]; local
90 if (elem.first == token) {
91 elem.second++;
96 elem.first = token;
97 elem.second = 1;
|
| /external/skia/include/private/ |
| SkTSearch.h | 53 const T* elem = (const T*)((const char*)base + mid * elemSize); local
55 if (less(*elem, key))
61 const T* elem = (const T*)((const char*)base + hi * elemSize); local
62 if (less(*elem, key)) {
65 } else if (less(key, *elem)) {
|
| /external/skqp/include/private/ |
| SkTSearch.h | 53 const T* elem = (const T*)((const char*)base + mid * elemSize); local
55 if (less(*elem, key))
61 const T* elem = (const T*)((const char*)base + hi * elemSize); local
62 if (less(*elem, key)) {
65 } else if (less(key, *elem)) {
|
| /external/tensorflow/tensorflow/python/ops/ |
| functional_ops.py | 362 ops.convert_to_tensor(elem, name="elem") for elem in elems_flat]
364 dtype = dtype or input_pack([elem.dtype for elem in elems_flat])
372 tensor_array_ops.TensorArray(dtype=elem.dtype, size=n,
375 for elem in elems_flat]
378 elem_ta.unstack(elem) for elem_ta, elem in zip(elems_ta, elems_flat)]
417 for elem in elems_flat[1:]
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/ |
| HeapTable.java | 83 for (T elem : selector.selected()) {
84 T base = elem.getBaseline();
89 long size = config.getSize(elem, heap);
93 vals.add(DocString.size(size, elem.isPlaceHolder()));
94 vals.add(DocString.delta(elem.isPlaceHolder(), base.isPlaceHolder(), size, basesize));
96 vals.add(DocString.size(total, elem.isPlaceHolder()));
97 vals.add(DocString.delta(elem.isPlaceHolder(), base.isPlaceHolder(), total, basetotal));
100 vals.add(value.render(elem));
115 for (T elem : remaining) {
117 long size = config.getSize(elem, heap)
[all...] |
| /external/clang/test/SemaCXX/ |
| discrim-union.cpp | 42 void destroy(unsigned elem) {
43 if (elem)
44 rest.destroy(elem - 1);
68 unsigned elem; member in class:either
75 elem(impl_t::index(detail::type<U>())),
80 //~either() { impl.destroy(elem); }
82 constexpr unsigned index() noexcept { return elem; }
91 return (elem != N ? throw_<const_get_result<N>>("bad_either_get")
|
| /external/skia/src/core/ |
| SkTMultiMap.h | 177 void internalRemove(ValueList* prev, ValueList* elem, const Key& key) {
178 if (elem->fNext) {
179 ValueList* next = elem->fNext;
180 elem->fValue = next->fValue;
181 elem->fNext = next->fNext;
185 delete elem;
188 delete elem;
|
| /external/skqp/src/core/ |
| SkTMultiMap.h | 177 void internalRemove(ValueList* prev, ValueList* elem, const Key& key) {
178 if (elem->fNext) {
179 ValueList* next = elem->fNext;
180 elem->fValue = next->fValue;
181 elem->fNext = next->fNext;
185 delete elem;
188 delete elem;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag:
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag:
[all...] |
| /external/python/cpython2/Lib/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementTree.py | 107 for elem in element:
108 if elem.tag == tag:
109 return elem
112 elem = self.find(element, tag)
113 if elem is None:
115 return elem.text or ""
118 for elem in element.iter(tag[3:]):
119 yield elem
120 for elem in element:
121 if elem.tag == tag
[all...] |
| /external/python/cpython2/Lib/test/ |
| test_minidom.py | 77 elem = root.childNodes[0]
79 root.insertBefore(nelem, elem)
84 and root.childNodes[1] is elem
85 and root.childNodes.item(1) is elem
87 and root.lastChild is elem
94 and root.childNodes[1] is elem
95 and root.childNodes.item(1) is elem
99 and nelem.previousSibling is elem
174 elem = dom.createElement('element')
178 dom.appendChild(elem)
[all...] |
| /external/python/cpython3/Lib/test/ |
| test_minidom.py | 96 elem = root.childNodes[0]
98 root.insertBefore(nelem, elem)
103 and root.childNodes[1] is elem
104 and root.childNodes.item(1) is elem
106 and root.lastChild is elem
113 and root.childNodes[1] is elem
114 and root.childNodes.item(1) is elem
118 and nelem.previousSibling is elem
193 elem = dom.createElement('element')
197 dom.appendChild(elem)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_minidom.py | 70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_minidom.py | 70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | 70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | 70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_clock.cc | 120 if (src->elem(tid_).reused == reused_) {
125 u64 epoch = src->elem(tid).epoch;
144 u64 epoch = src->elem(i).epoch;
153 src->elem(tid_).reused = reused_;
179 // only dst->elem(tid_).
180 if (dst->elem(tid_).epoch > last_acquire_) {
196 ClockElem &ce = dst->elem(i);
204 dst->elem(i).reused = 0;
212 dst->elem(tid_).reused = reused_;
226 dst->elem(tid_).epoch > last_acquire_)
407 ClockElem &SyncClock::elem(unsigned tid) const { function in class:__tsan::SyncClock
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_minidom.py | 70 elem = root.childNodes[0]
72 root.insertBefore(nelem, elem)
77 and root.childNodes[1] is elem
78 and root.childNodes.item(1) is elem
80 and root.lastChild is elem
87 and root.childNodes[1] is elem
88 and root.childNodes.item(1) is elem
92 and nelem.previousSibling is elem
167 elem = dom.createElement('element')
171 dom.appendChild(elem)
[all...] |
| /external/python/cpython3/Lib/collections/ |
| __init__.py | 460 for elem in iterable:
461 mapping[elem] = mapping_get(elem, 0) + 1
486 >>> for elem in 'shazam': # update counts from an iterable
487 ... c[elem] += 1 # by adding 1 to each element's count
619 for elem, count in iterable.items():
620 self[elem] = count + self_get(elem, 0)
654 for elem, count in iterable.items():
655 self[elem] = self_get(elem, 0) - coun
[all...] |
