Home
last modified time | relevance | path

Searched refs:users (Results 1 - 15 of 15) sorted by relevance

/arkcompiler/ets_runtime/test/moduletest/regexpflagd/
H A Dregexpflagd.js23 var users = `姓氏：李，名字：雷\n姓氏：韩，名字：梅梅`; variable
24 var result = regexpNames.exec(users);
35 result = regexpNames.exec(users);
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dredundant_loop_elimination.cpp58 auto users = inst->GetUsers(); in IsRedundant() local
59 auto it = std::find_if(users.begin(), users.end(), in IsRedundant()
61 if (it != users.end()) { in IsRedundant()
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
H A Dinst_builder.cpp219 // Phi may not have type if all it users are pseudo instructions, like SaveState in FixInstructions()
298 auto users = const_inst->GetUsers(); in SplitConstant() local
299 auto curr_it = users.begin(); in SplitConstant()
300 while (curr_it != users.end()) { in SplitConstant()
326 // Remove catch-phis without real users in CleanupCatchPhis()
335 auto users = inst->GetUsers(); in CleanupCatchPhis() local
336 while (!users.Empty()) { in CleanupCatchPhis()
337 auto &user = users.Front(); in CleanupCatchPhis()
/arkcompiler/runtime_core/libark_defect_scan_aux/
H A Dgraph.cpp107 std::vector<Inst> users; in GetUserInsts() local
111 users.emplace_back(user.GetInst()); in GetUserInsts()
114 return users; in GetUserInsts()
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A Dgraph_checker.cpp582 * Regalloc propagates catch-phi's inputs to the users and can broke user's domination. In this case:
626 void PrepareUsers(Inst *inst, ArenaVector<User *> *users) in PrepareUsers() argument
629 users->push_back(&user); in PrepareUsers()
636 ArenaVector<User *> users(GetLocalAllocator()->Adapter()); in CheckSaveStateInputs()
653 PrepareUsers(inst, &users); in CheckSaveStateInputs()
657 for (auto &it : users) { in CheckSaveStateInputs()
674 users.clear(); in CheckSaveStateInputs()
H A Dinst.h362 * User is a intrusive list node, thus it stores pointers to next and previous users.
478 * List of users. Intended for range loop.
567 std::array<User, N> users;
596 /// Reallocate inputs/users storage to a new one with specified capacity.
1019 * Remove instruction from users.
1131 * Remove all users
1136 auto users = GetUsers(); in RemoveUsers() local
1137 while (!users.Empty()) { in RemoveUsers()
1140 auto &user = users.Front(); in RemoveUsers()
1144 RemoveUser(&users in RemoveUsers()
[all...]
/arkcompiler/runtime_core/static_core/libllvmbackend/transforms/passes/
H A Dgc_intrusion_check.cpp223 for (auto user : ref->users()) { in IsHiddenGcRef()
228 for (auto zextUser : zext->users()) { in IsHiddenGcRef()
H A Dinline_devirt.cpp150 for (auto user : func->users()) { in run()
H A Dgc_intrusion.cpp151 for (auto user : inst.users()) { in PopulateLiveInByUsers()
210 for (auto user : arg.users()) { in ComputeLiveSets()
/arkcompiler/ets_runtime/ecmascript/compiler/
H A Descape_analysis.cpp259 auto& users = vObj->GetUsers(); in RevisitUser() local
260 for (auto user : users) { in RevisitUser()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir_builder/
H A Dinst_builder.cpp480 // Phi may not have type if all it users are pseudo instructions, like SaveState
655 auto users = constInst->GetUsers(); in SplitConstant() local
656 auto currIt = users.begin(); in SplitConstant()
657 while (currIt != users.end()) { in SplitConstant()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dgraph_checker.cpp886 * Regalloc propagates catch-phi's inputs to the users and can broke user's domination. In this case: in CheckUserOfInt32()
957 // The correct state when all users of Object(is "*it") between SaveState and RuntimeCall(is in CheckUserOfInt32()
971 void GraphChecker::PrepareUsers(Inst *inst, ArenaVector<User *> *users) in CheckUserOfInt32() argument
974 users->push_back(&user); in CheckUserOfInt32()
976 auto i = std::find_if(users->begin(), users->end(), [](User *user) { return user->GetInst()->IsCheck(); }); in CheckUserOfInt32()
977 while (i != users->end()) { in CheckUserOfInt32()
980 users->erase(i); in CheckUserOfInt32()
984 users->push_back(&u); in CheckUserOfInt32()
987 i = std::find_if(users in CheckUserOfInt32()
1117 CheckSaveStateInputs(Inst *inst, ArenaVector<User *> *users) CheckUserOfInt32() argument
[all...]
H A Dgraph_checker.h110 void PrepareUsers(Inst *inst, ArenaVector<User *> *users);
113 void CheckSaveStateInputs(Inst *inst, ArenaVector<User *> *users);
471 (std::cerr << "Control flow instruction has users\n", inst->Dump(&std::cerr))); in CheckContrlFlowInst()
494 std::cerr << "Throw inst doesn't have any users from the list:" << opcs << std::endl)); in CheckThrows()
H A Dinst.h410 * User is a intrusive list node, thus it stores pointers to next and previous users.
527 * List of users. Intended for range loop.
628 std::array<User, N> users;
659 /// Reallocate inputs/users storage to a new one with specified capacity.
1277 * Remove instruction from users.
1341 * NB! Don't swap inputs while iterating over instruction's users:
1403 /// Remove all users
1407 auto users = GetUsers(); in RemoveUsers() local
1408 while (!users.Empty()) { in RemoveUsers()
1411 auto &user = users in RemoveUsers()
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/code_generator/
H A Dcodegen.cpp892 auto users = inst->GetUsers(); in CreateStackMap() local
893 auto it = std::find_if(users.begin(), users.end(), in CreateStackMap()

Completed in 22 milliseconds