Mercurial > hg > truffle
view graal/com.oracle.graal.snippets/src/com/oracle/graal/snippets/LongSubstitutions.java @ 7669:fae0b2f0279e
Bugfix: ControlSplitNode can have no successor, so check for successor count instead of class
author | Christian Wimmer <christian.wimmer@oracle.com> |
---|---|
date | Mon, 04 Feb 2013 05:41:14 -0800 |
parents | fe9f252f0d05 |
children |
line wrap: on
line source
/* * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.snippets; import com.oracle.graal.snippets.ClassSubstitution.*; import com.oracle.graal.snippets.nodes.*; @ClassSubstitution(Long.class) public class LongSubstitutions { @MethodSubstitution public static long reverseBytes(long i) { return ReverseBytesNode.reverse(i); } @MethodSubstitution public static int numberOfLeadingZeros(long i) { if (i == 0) { return 64; } return 63 - BitScanReverseNode.scan(i); } @MethodSubstitution public static int numberOfTrailingZeros(long i) { if (i == 0) { return 64; } return BitScanForwardNode.scan(i); } @MethodSubstitution public static int bitCount(long i) { return BitCountNode.bitCount(i); } }