| /external/llvm/include/llvm/CodeGen/ |
| RegisterPressure.h | 144 bool insert(unsigned Reg) { function in struct:llvm::LiveRegSet
146 return VirtRegs.insert(Reg).second;
147 return PhysRegs.insert(Reg).second;
|
| /external/llvm/include/llvm/MC/ |
| MCInst.h | 177 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
178 return Operands.insert(I, Op);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_build_util.h | 45 inline void insert(Instruction *);
144 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v);
234 void BuildUtil::insert(Instruction *i) function in class:nv50_ir::BuildUtil
253 insert(insn);
300 BuildUtil::DataArray::insert(ValueMap &m, unsigned i, unsigned c, Value *v)
302 m.insert(Location(array, arrayIdx, i, c), v);
|
| nv50_ir_graph.cpp | 44 void Graph::insert(Node *node) function in class:nv50_ir::Graph
99 // insert head
121 graph->insert(node);
123 node->graph->insert(this);
|
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 156 // insert given points into the tree; return created node
158 int insert(__instype * first, __instype * last, __valuector ctor) { function in class:CvKDTree
174 node & n = *nodes.insert(nodes.end(), node());
185 // note that recursive insert may invalidate this ref
186 node & n = *nodes.insert(nodes.end(), node());
191 int left = insert(first, split, ctor);
193 int right = insert(split, last, ctor);
267 root_node = insert(first, last, ctor);
|
| /external/qemu/distrib/sdl-1.2.15/src/cdrom/bsdi/ |
| SDL_syscdrom.c | 301 char *insert; local
305 insert = SDL_strchr(drive, '?');
306 if ( insert != NULL ) {
307 *insert = j;
|
| /external/qemu/distrib/sdl-1.2.15/src/cdrom/linux/ |
| SDL_syscdrom.c | 340 char *insert; local
344 insert = SDL_strchr(drive, '?');
345 if ( insert != NULL ) {
346 *insert = j;
|
| /external/qemu/distrib/sdl-1.2.15/src/cdrom/qnx/ |
| SDL_syscdrom.c | 214 char* insert; local
220 insert = SDL_strchr(drive, '?');
221 if (insert != NULL)
223 *insert = j;
|
| /external/regex-re2/util/ |
| sparse_array.h | 79 // To insert a new entry, set sparse_to_dense_[i] to size_,
163 pair<iterator, bool> insert(const value_type& new_value);
321 pair<typename SparseArray<Value>::iterator, bool> SparseArray<Value>::insert( function in class:re2::SparseArray
|
| /external/skia/include/core/ |
| SkString.h | 167 void insert(size_t offset, const SkString& src) { this->insert(offset, src.c_str(), src.size()); } function in class:SkString
168 void insert(size_t offset, const char text[]);
169 void insert(size_t offset, const char text[], size_t len);
178 void append(const SkString& str) { this->insert((size_t)-1, str); }
179 void append(const char text[]) { this->insert((size_t)-1, text); }
180 void append(const char text[], size_t len) { this->insert((size_t)-1, text, len); }
189 void prepend(const SkString& str) { this->insert(0, str); }
190 void prepend(const char text[]) { this->insert(0, text); }
191 void prepend(const char text[], size_t len) { this->insert(0, text, len);
[all...] |
| SkTDArray.h | 193 T* insert(int index) { function
194 return this->insert(index, 1, NULL);
196 T* insert(int index, int count, const T* src = NULL) { function
|
| /external/skia/src/core/ |
| SkRTree.cpp | 47 void SkRTree::insert(void* data, const SkIRect& bounds, bool defer) { function in class:SkRTree
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
92 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0]);
131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) { function in class:SkRTree
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
476 // since we check for empty bounds on insert, we know we'll never have empty rects
|
| /external/skia/src/pdf/ |
| SkPDFTypes.cpp | 434 SkPDFObject* SkPDFDict::insert(SkPDFName* key, SkPDFObject* value) { function in class:SkPDFDict
443 SkPDFObject* SkPDFDict::insert(const char key[], SkPDFObject* value) { function in class:SkPDFDict
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 155 * @see ds.tree.RadixTree#insert(java.lang.String, java.lang.Object)
157 public void insert(String key, T value) throws DuplicateKeyException { method in class:RadixTreeImpl
159 insert(key, root, value); method
168 * Recursively insert the key in the radix tree.
175 private void insert(String key, RadixTreeNode<T> node, T value) method in class:RadixTreeImpl
188 insert(newText, child, value); method
|
| /external/stlport/stlport/stl/ |
| _deque.c | 115 insert(this->_M_finish, __mid, __x.end());
150 void deque<_Tp, _Alloc>::insert(iterator __pos, function in class:_Alloc
178 void deque<_Tp,_Alloc>::insert(iterator __pos, function in class:_Alloc
|
| _hash_map.h | 179 pair<iterator,bool> insert(const value_type& __obj) function in class:hash_map
183 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_map
186 void insert(const value_type* __f, const value_type* __l) function in class:hash_map
188 void insert(const_iterator __f, const_iterator __l) function in class:hash_map
371 iterator insert(const value_type& __obj) function in class:hash_multimap
375 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multimap
378 void insert(const value_type* __f, const value_type* __l) { function in class:hash_multimap
381 void insert(const_iterator __f, const_iterator __l) function in class:hash_multimap
458 container->insert(__val);
485 container->insert(__val)
[all...] |
| _hash_set.h | 181 pair<iterator, bool> insert(const value_type& __obj) function in class:hash_set
185 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_set
187 void insert(const_iterator __f, const_iterator __l)
189 void insert(const value_type* __f, const value_type* __l)
363 iterator insert(const value_type& __obj) { return _M_ht.insert_equal(__obj); } function in class:hash_multiset
366 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multiset
369 void insert(const value_type* __f, const value_type* __l) function in class:hash_multiset
371 void insert(const_iterator __f, const_iterator __l) function in class:hash_multiset
453 container->insert(__val);
480 container->insert(__val)
[all...] |
| _map.h | 179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
187 // insert/erase
188 pair<iterator,bool> insert(const value_type& __x) function in class:map
190 iterator insert(iterator __pos, const value_type& __x) function in class:map
194 void insert(_InputIterator __first, _InputIterator __last) function in class:map
197 void insert(const value_type* __first, const value_type* __last) function in class:map
199 void insert(const_iterator __first, const_iterator __last) function in class:map
365 // insert/erase
366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } function in class:multimap
367 iterator insert(iterator __pos, const value_type& __x) { return _M_t.insert_equal(__pos, __x); function in class:multimap
370 void insert(_InputIterator __first, _InputIterator __last) function in class:multimap
373 void insert(const value_type* __first, const value_type* __last) function in class:multimap
375 void insert(const_iterator __first, const_iterator __last) function in class:multimap
[all...] |
| _set.h | 167 // insert/erase
168 pair<iterator,bool> insert(const value_type& __x) function in class:set
170 iterator insert(iterator __pos, const value_type& __x) function in class:set
174 void insert(_InputIterator __first, _InputIterator __last) function in class:set
177 void insert(const_iterator __first, const_iterator __last) function in class:set
179 void insert(const value_type* __first, const value_type* __last) function in class:set
338 // insert/erase
339 iterator insert(const value_type& __x) function in class:multiset
341 iterator insert(iterator __pos, const value_type& __x) function in class:multiset
346 void insert(_InputIterator __first, _InputIterator __last function in class:multiset
349 void insert(const value_type* __first, const value_type* __last) function in class:multiset
351 void insert(const_iterator __first, const_iterator __last) function in class:multiset
[all...] |
| _string_workaround.h | 318 public: // Insert
319 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string
320 _Base::insert(__pos, __s);
324 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string
326 _Base::insert(__pos, __s, __beg, __n);
329 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string
331 _Base::insert(__pos, __s, __n);
335 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string
337 _Base::insert(__pos, __s);
341 _Self& insert(size_type __pos, size_type __n, _CharT __c) function in class:basic_string
346 iterator insert(iterator __p, _CharT __c) function in class:basic_string
349 void insert(iterator __p, size_t __n, _CharT __c) function in class:basic_string
355 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string
[all...] |
| _unordered_map.h | 133 pair<iterator,bool> insert(const value_type& __obj) function in class:unordered_map
135 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_map
139 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_map
141 void insert(const value_type* __f, const value_type* __l)
143 void insert(const_iterator __f, const_iterator __l)
301 iterator insert(const value_type& __obj) function in class:unordered_multimap
303 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multimap
307 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multimap
309 void insert(const value_type* __f, const value_type* __l)
311 void insert(const_iterator __f, const_iterator __l
[all...] |
| _unordered_set.h | 127 pair<iterator, bool> insert(const value_type& __obj) function in class:unordered_set
129 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_set
133 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_set
135 void insert(const_iterator __f, const_iterator __l)
137 void insert(const value_type* __f, const value_type* __l)
277 iterator insert(const value_type& __obj) function in class:unordered_multiset
279 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multiset
283 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multiset
285 void insert(const value_type* __f, const value_type* __l)
287 void insert(const_iterator __f, const_iterator __l
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _list.h | 206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) { function in class:list
208 iterator insert(iterator __pos, const _Tp& __x) {
211 return iterator(&_M_iter_list,_M_non_dbg_impl.insert(__pos._M_iterator, __x) );
215 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } function in class:list
220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list
223 _M_non_dbg_impl.insert(__pos._M_iterator,
229 void insert(iterator __pos, const _Tp* __first, const _Tp* __last) { function in class:list
232 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last);
237 void insert(iterator __pos function in class:list
246 void insert(iterator __pos, function in class:list
257 void insert(iterator __pos, size_type __n, const _Tp& __x) { function in class:list
[all...] |
| _slist.h | 290 void insert(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
294 _M_non_dbg_impl.insert(__pos._M_iterator,
313 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:slist
317 _M_non_dbg_impl.insert(__pos._M_iterator, __first._M_iterator, __last._M_iterator);
319 void insert(iterator __pos, const value_type* __first, function in class:slist
324 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last);
329 iterator insert(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
331 iterator insert(iterator __pos, const value_type& __x) {
335 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
339 iterator insert(iterator __pos) function in class:slist
344 void insert(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
[all...] |
| _string.h | 388 // Insert
389 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string
391 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl);
396 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string
399 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl, __beg, __n);
404 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string
408 _M_non_dbg_impl.insert(__pos, __s, __n);
413 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string
416 return insert(__pos, __s, _Traits::length(__s));
419 _Self& insert(size_type __pos, size_type __n, _CharT __c) function in class:basic_string
426 iterator insert(iterator __p, _CharT __c) { function in class:basic_string
434 void insert(iterator __p, size_t __n, _CharT __c) { function in class:basic_string
443 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string
468 void insert(iterator __p, const_iterator __f, const_iterator __l) { function in class:basic_string
478 void insert(iterator __p, iterator __f, iterator __l) { function in class:basic_string
[all...] |
