| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/ |
| D | typePredicatesInUnion.ts | 22 pred(x: {}): x is boolean;
25 pred(x: {}): x is string; method
31 if (o.pred(x)) {
32 AssertType(o.pred(x), "boolean");
33 AssertType(o.pred, "union");
|
| D | typePredicatesInUnion_noMatch.ts | 22 pred(x: {}, y: {}): x is boolean;
25 pred(x: {}, y: {}): y is string; method
31 if (o.pred(x, y)) {
32 AssertType(o.pred(x, y), "boolean");
33 AssertType(o.pred, "union");
|
| D | genericTypeParameterEquivalence2.ts | 128 function countWhere_1<A>(pred: (a: A) => boolean): (a: A[]) => number {
129 AssertType(compose(length2, cfilter(pred)), "(A[]) => number");
132 AssertType(cfilter(pred), "(A[]) => A[]");
134 AssertType(pred, "(A) => boolean");
135 return compose(length2, cfilter(pred));
138 function countWhere_2<A>(pred: (a: A) => boolean): (a: A[]) => number {
139 let where = cfilter(pred);
141 AssertType(cfilter(pred), "(A[]) => A[]");
143 AssertType(pred, "(A) => boolean");
|
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
| D | cleanup.cpp | 148 for (auto pred : bb->GetPredsBlocks()) { in CheckSpecialTriangle() local
149 if (pred->GetSuccessor(0) == succ || in CheckSpecialTriangle()
150 (pred->GetSuccsBlocks().size() == MAX_SUCCS_NUM && pred->GetSuccessor(1) == succ)) { in CheckSpecialTriangle()
154 size_t index_pred = phi->CastToPhi()->GetPredBlockIndex(pred); in CheckSpecialTriangle()
169 saved_preds_.push_back(pred); in CheckSpecialTriangle()
186 for (auto pred : bb->GetPredsBlocks()) { in RemoveDeadPhi() local
187 if (pred->IsEmpty() && !SkipBasicBlock(pred)) { in RemoveDeadPhi()
188 COMPILER_LOG(DEBUG, CLEANUP) << "Would re-check empty block " << pred->GetId(); in RemoveDeadPhi()
189 new_empty_blocks->insert(pred); in RemoveDeadPhi()
204 for (auto pred : saved_preds_) { in ProcessBB() local
[all …]
|
| /arkcompiler/runtime_core/compiler/optimizer/ir/ |
| D | graph.cpp | 234 for (auto pred : block->GetPredsBlocks()) { in RemovePredecessors() local
235 if (remove_last_inst && !pred->IsTryBegin() && !pred->IsTryEnd()) { in RemovePredecessors()
236 if (pred->GetSuccsBlocks().size() == 2U) { in RemovePredecessors()
237 auto last = pred->GetLastInst(); in RemovePredecessors()
239 pred->RemoveInst(last); in RemovePredecessors()
241 ASSERT(pred->GetSuccsBlocks().size() == 1 && pred->GetSuccessor(0) == block); in RemovePredecessors()
244 if (std::find(pred->GetSuccsBlocks().begin(), pred->GetSuccsBlocks().end(), block) != in RemovePredecessors()
245 pred->GetSuccsBlocks().end()) { in RemovePredecessors()
246 pred->RemoveSucc(block); in RemovePredecessors()
309 for (auto pred : block->GetPredsBlocks()) { in DisconnectBlockRec() local
[all …]
|
| D | basicblock.cpp | 122 for (auto pred : preds_) { in InsertEmptyBlockBefore() local
123 pred->ReplaceSucc(this, block); in InsertEmptyBlockBefore()
124 this->RemovePred(pred); in InsertEmptyBlockBefore()
193 auto pred = preds_[0]; in RemoveEmptyBlock() local
194 pred->succs_[pred->GetSuccBlockIndex(this)] = succ; in RemoveEmptyBlock()
195 succ->preds_[succ->GetPredBlockIndex(this)] = pred; in RemoveEmptyBlock()
197 pred = preds_[i]; in RemoveEmptyBlock()
198 pred->succs_[pred->GetSuccBlockIndex(this)] = succ; in RemoveEmptyBlock()
199 succ->preds_.push_back(pred); in RemoveEmptyBlock()
226 auto pred = bb->GetPredBlockByIndex(i); in FixLoopInfoHelper() local
[all …]
|
| D | graph_checker.cpp | 168 for ([[maybe_unused]] auto pred : block->GetPredsBlocks()) { in CheckControlFlow() local
169 … ASSERT_PRINT(CheckBlockHasSuccessor(pred, block), "Block is not a successor to its predecessor"); in CheckControlFlow()
323 [[maybe_unused]] auto pred = phi_inst->CastToPhi()->GetPhiInputBb(index); in CheckPhiInputs() local
324 [[maybe_unused]] auto input_bb = phi_inst->CastToPhi()->GetPhiInput(pred)->GetBasicBlock(); in CheckPhiInputs()
325 ASSERT_DO(input_bb->IsDominate(pred) || IsTryCatchDomination(input_bb, pred), in CheckPhiInputs()
328 … << "Block " << input_bb->GetId() << " should dominate " << pred->GetId() << std::endl in CheckPhiInputs()
380 for (auto pred : block->GetPredsBlocks()) { in CheckBlockHasPredecessor() local
381 if (pred == predecessor) { in CheckBlockHasPredecessor()
425 for ([[maybe_unused]] auto pred : preds) { in CheckLoops() local
426 ASSERT(pred->GetLoop() != loop || loop->HasBackEdge(pred)); in CheckLoops()
[all …]
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationNoNewNames/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationCollidingNamesInAugmentation1/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationExtendFileModule1/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationDeclarationEmit1/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationExtendFileModule2/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationDeclarationEmit2/ |
| D | observable.ts | 23 filter(pred: (e:T) => boolean): Observable<T>;
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| D | liveness_analyzer.cpp | 107 for (auto pred : block->GetPredsBlocks()) { in AllForwardEdgesVisited() local
108 if (!pred->IsMarked(marker_)) { in AllForwardEdgesVisited()
118 for (auto pred : block->GetPredsBlocks()) { in AllForwardEdgesVisited() local
119 if (!block->IsDominate(pred) && !pred->IsMarked(marker_)) { in AllForwardEdgesVisited()
313 for (auto pred : inst->GetBasicBlock()->GetPredsBlocks()) { in ProcessBlockLiveInstructions() local
314 inst_life_number = std::min(inst_life_number, GetBlockLiveRange(pred).GetBegin()); in ProcessBlockLiveInstructions()
|
| D | loop_analyzer.cpp | 143 auto pred {header->GetPredBlockByIndex(idx)}; in MovePhiInputsToPreHeader() local
144 auto phi_idx {phi->CastToPhi()->GetPredBlockIndex(pred)}; in MovePhiInputsToPreHeader()
293 for (auto pred : block->GetPredsBlocks()) { in NaturalLoopSearch() local
294 NaturalLoopSearch(loop, pred); in NaturalLoopSearch()
|
| D | dominators_tree.cpp | 69 for (auto pred : block->GetPredsBlocks()) { in ComputeImmediateDominators() local
70 auto eval = Eval(pred); in ComputeImmediateDominators()
|
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/ |
| D | split_resolver.cpp | 99 for (auto pred : block->GetPredsBlocks()) { in ProcessBlock() local
100 ConnectSpiltFromPredBlock(pred, interval, block, succ_split); in ProcessBlock()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| D | state_split_linearizer.cpp | 212 auto pred = curRegion->preds_[i]; in ConnectStateDepend() local
213 auto &edge = map_.GetEdge(pred, curRegion); in ConnectStateDepend()
217 pendingEdges_.emplace_back(PendingGateRegionEdge(pred, curRegion, dependStart_, i)); in ConnectStateDepend()
|
| /arkcompiler/ets_runtime/tools/circuit_viewer/examples/ |
| D | log_loop.txt | 928 [compiler] pred=[
944 [compiler] pred=[
954 [compiler] pred=[
971 [compiler] pred=[
979 [compiler] pred=[
985 [compiler] pred=[
993 [compiler] pred=[
1007 [compiler] pred=[
1015 [compiler] pred=[
1022 [compiler] pred=[
[all …]
|
| /arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
| D | phi_resolver.h | 163 auto pred = phi_inst->GetBasicBlock()->GetPredBlockByIndex(index); in CheckPhiInputs() local
165 if (!input_bb->IsDominate(pred)) { in CheckPhiInputs()
|
| D | inst_builder.cpp | 228 auto pred = defs_[pred_bb->GetId()][inst->GetLinearNumber()]; in FixInstructions() local
229 if (pred == nullptr) { in FixInstructions()
234 inst->AppendInput(pred); in FixInstructions()
|
| /arkcompiler/runtime_core/libpandabase/utils/ |
| D | list.h | 273 bool RemoveIf(Predicate pred) in RemoveIf() argument
278 if (pred(*current)) { in RemoveIf()
603 void remove_if(Predicate pred) in remove_if() argument
607 if (pred(&(*it))) { in remove_if()
|
| /arkcompiler/runtime_core/libpandabase/events/ |
| D | events_gen.h.erb | 134 std::vector<const EventT*> Select([[maybe_unused]] F pred = false) {
139 EnumerateEvents<EventT>([&pred, &res](const auto& event) {
140 if (pred(&event)) {
|
| /arkcompiler/runtime_core/platforms/unix/libpandabase/futex/ |
| D | mutex.cpp | 55 static inline bool WaitBrieflyFor(std::atomic_int *addr, Pred pred) in WaitBrieflyFor() argument
63 if (pred(addr->load(std::memory_order_relaxed))) { in WaitBrieflyFor()
|
| /arkcompiler/runtime_core/compiler/docs/ |
| D | cleanup_doc.md | 168 for (auto pred : bb->GetPredsBlocks()) {
169 if (pred->IsEmpty() && !SkipBasicBlock(pred)) {
170 new_empty_blocks->insert(pred);
|