Home
last modified time | relevance | path

Searched full:neighbour (Results 1 – 6 of 6) sorted by relevance

/arkcompiler/runtime_core/static_core/verification/
Dverification.yaml42 - neighbour
80 neighbour:
95 neighbour:
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
Dinterference_graph.h275 // The best case is to find color that is not in neighbour colors and not in biased in AssignColors()
318 // Collect neighbour color in MakeBusyBitmap()
323 // Collect biased neighbour color in MakeBusyBitmap()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
Dinterference_graph.h322 // The best case is to find color that is not in neighbour colors and not in biased in AssignColors()
368 // Collect neighbour color in MakeBusyBitmap()
373 // Collect biased neighbour color in MakeBusyBitmap()
/arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/
Dinterop_intrinsic_optimization.cpp390 for (auto *neighbour : neighbours) { in BlockBoundaryDfs() local
391 BlockBoundaryDfs<!IS_END>(neighbour); in BlockBoundaryDfs()
395 for (auto *neighbour : neighbours) { in BlockBoundaryDfs() local
396 BlockBoundaryDfs<!IS_END>(neighbour); in BlockBoundaryDfs()
/arkcompiler/runtime_core/static_core/compiler/tests/
Dlicm_conditions_test.cpp1201 * - two chains with neighbour blocks
/arkcompiler/runtime_core/static_core/libllvmbackend/lowering/
Dllvm_ir_constructor.cpp2575 …* - array loads and stores. If 32-bit version were used, then the neighbour array elements would b…