Home
last modified time | relevance | path

Searched refs:merge_op (Results 1 – 2 of 2) sorted by relevance

/external/v8/src/compiler/
Dsimplified-lowering.cc3018 const Operator* const merge_op = common()->Merge(2); in Int32Div() local
3050 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2); in Int32Div()
3054 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Div()
3058 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in Int32Div()
3096 const Operator* const merge_op = common()->Merge(2); in Int32Mod() local
3132 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2); in Int32Mod()
3136 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Mod()
3153 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1); in Int32Mod()
3157 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0); in Int32Mod()
3223 const Operator* const merge_op = common()->Merge(2); in Uint32Mod() local
[all …]
Dwasm-compiler.cc2415 const Operator* merge_op = common->Merge(2); in BuildChangeTaggedToFloat64() local
2437 if_true1 = graph()->NewNode(merge_op, if_true2, if_false2); in BuildChangeTaggedToFloat64()
2444 Node* merge1 = graph()->NewNode(merge_op, if_true1, if_false1); in BuildChangeTaggedToFloat64()