| /xsrc/external/mit/MesaLib/dist/src/util/tests/vma/ |
| vma_random_test.cpp | 135 heap_holes.erase(i);
170 next = heap_holes.erase(next);
180 heap_holes.erase(prev);
181 next = heap_holes.erase(next);
195 next = heap_holes.erase(prev);
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/tests/vma/ |
| vma_random_test.cpp | 130 heap_holes.erase(i);
165 next = heap_holes.erase(next);
175 heap_holes.erase(prev);
176 next = heap_holes.erase(next);
190 next = heap_holes.erase(prev);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/ |
| sb_psi_ops.cpp | 87 ns.erase(ns.begin(), ns.begin() + i + 1);
104 ns.erase(ns.begin() + i - 2, ns.begin() + i + 1);
111 ns.erase(ns.begin() + i - 2, ns.begin() + i + 1);
|
| sb_ir.h | 145 unsigned erase(const V& v) { function in class:r600_sb::sb_set
149 vec.erase(P);
167 void erase(iterator I) { vec.erase(I); } function in class:r600_sb::sb_set
213 unsigned erase(const K& key) { function in class:r600_sb::sb_map
214 return set.erase(std::make_pair(key, V()));
217 void erase(iterator I) { function in class:r600_sb::sb_map
218 set.erase(I);
|
| sb_shader.h | 172 void erase(const T& t) { function in class:r600_sb::queue
177 cont.erase(F);
|
| sb_gcm.cpp | 185 ready.erase(I);
326 ready_above.erase(I);
573 cm.erase(n);
661 nuc_stk[ucs_level].erase(n);
|
| sb_if_conversion.cpp | 48 I = regions_vec::reverse_iterator(rv.erase((++I).base()));
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/ |
| sb_psi_ops.cpp | 87 ns.erase(ns.begin(), ns.begin() + i + 1);
104 ns.erase(ns.begin() + i - 2, ns.begin() + i + 1);
111 ns.erase(ns.begin() + i - 2, ns.begin() + i + 1);
|
| sb_ir.h | 145 unsigned erase(const V& v) { function in class:r600_sb::sb_set
149 vec.erase(P);
167 void erase(iterator I) { vec.erase(I); } function in class:r600_sb::sb_set
213 unsigned erase(const K& key) { function in class:r600_sb::sb_map
214 return set.erase(std::make_pair(key, V()));
217 void erase(iterator I) { function in class:r600_sb::sb_map
218 set.erase(I);
|
| sb_shader.h | 172 void erase(const T& t) { function in class:r600_sb::queue
177 cont.erase(F);
|
| sb_gcm.cpp | 185 ready.erase(I);
326 ready_above.erase(I);
573 cm.erase(n);
661 nuc_stk[ucs_level].erase(n);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/core/ |
| context.cpp | 72 svm_ptrs.erase(ptr);
|
| memory.cpp | 130 resources.erase(&q.device());
162 resources.erase(&q.device());
214 resources.erase(&q.device());
|
| printf.cpp | 119 print_str.erase(vec_pos - cur_tok, std::min(mod_pos, spec_pos) - vec_pos);
|
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_lower_to_cssa.cpp | 128 ctx.live_out[preds[i]].erase(op.tempId());
331 ctx.merge_node_table.erase(dst.id()); /* remove the temporary */
407 ltg.erase(it);
429 it = ltg.erase(it);
456 ctx.live_out[i].erase(cp.def.tempId());
517 renames.erase(it);
|
| aco_spill.cpp | 117 affinities.erase(std::next(affinities.begin(), found_second));
193 next_use_distances_start.erase(def.getTemp());
342 ctx.unused_remats.erase(ctx.remat[instr->operands[i].getTemp()].instr);
427 local_next_uses[idx].erase(it);
686 partial_spills.erase(pair.first);
717 partial_spills.erase(phi->definitions[0].getTemp());
745 partial_spills.erase(to_spill);
884 ctx.unused_remats.erase(ctx.remat[var].instr);
897 ctx.renames[pred_idx].erase(rename_it);
961 ctx.renames[pred_idx].erase(rename_it)
[all...] |
| aco_util.h | 234 * Cache-friendly set of 32-bit IDs with O(1) insert/erase/lookup and
300 size_t erase(uint32_t id) function in struct:aco::IDSet
|
| /xsrc/external/mit/libXaw/dist/src/ |
| TextSrc.c | 80 int erase; /* there are two types of erases */ member in struct:_XawTextUndo
683 * if the first erase was generated by a backward-kill-char and the
692 src->textSrc.undo->erase = value;
880 int erase = undo->right->length == 0 && undo->left->length == 1 && list local
883 if (erase) {
884 erase = list->left->position - 1 == undo->left->position ? -1 :
886 if (src->textSrc.undo->erase && erase != src->textSrc.undo->erase)
887 erase = 0
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 107 virtual void erase() = 0;
202 // caution: if you're at end-2 and erase it, then do next, you're at end
203 virtual void erase();
217 inline void erase(Iterator& pos) function in class:nv50_ir::DLList
219 pos.erase();
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sfn/ |
| sfn_liverange.cpp | 732 bool erase; member in class:r600::register_merge_record
935 r.erase = false;
977 src->erase = true;
991 if (!inp->erase)
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/util/ |
| algorithm.hpp | 199 /// Erase elements for which predicate \a f evaluates to true from
215 r.erase(i, e);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 107 virtual void erase() = 0;
202 // caution: if you're at end-2 and erase it, then do next, you're at end
203 virtual void erase();
217 inline void erase(Iterator& pos) function in class:nv50_ir::DLList
219 pos.erase();
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/clover/util/ |
| algorithm.hpp | 198 /// Erase elements for which predicate \a f evaluates to true from
214 r.erase(i, e);
|
| /xsrc/external/mit/xterm/dist/vttests/ |
| xtra-scroll.pl | 255 my $erase = shift;
259 if ($erase) {
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/state_tracker/ |
| st_glsl_to_tgsi_temprename.cpp | 1003 bool erase; member in class:__anon2685::register_merge_record
1347 reg_access[used_temps].erase = false;
1374 src->erase = true;
1388 if (!inp->erase)
|
