equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2014, 2015, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
394 JavaValue v; |
394 JavaValue v; |
395 v.set_jdouble(td->getd()); |
395 v.set_jdouble(td->getd()); |
396 return TypeLong::make( v.get_jlong() ); |
396 return TypeLong::make( v.get_jlong() ); |
397 } |
397 } |
398 |
398 |
|
399 #ifndef PRODUCT |
|
400 //----------------------------BinaryNode--------------------------------------- |
|
401 // The set of related nodes for a BinaryNode is all data inputs and all outputs |
|
402 // till level 2 (i.e., one beyond the associated CMoveNode). In compact mode, |
|
403 // it's the inputs till level 1 and the outputs till level 2. |
|
404 void BinaryNode::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const { |
|
405 if (compact) { |
|
406 this->collect_nodes(in_rel, 1, false, true); |
|
407 } else { |
|
408 this->collect_nodes_in_all_data(in_rel, false); |
|
409 } |
|
410 this->collect_nodes(out_rel, -2, false, false); |
|
411 } |
|
412 #endif |