Mercurial > hg > truffle
view graal/com.oracle.graal.replacements/src/com/oracle/graal/replacements/ArraysSubstitutions.java @ 21017:66d45b977e44
Add missing //JaCoCo Exclude directives.
author | Roland Schatz <roland.schatz@oracle.com> |
---|---|
date | Mon, 20 Apr 2015 14:00:22 +0200 |
parents | f2a357ee14e4 |
children |
line wrap: on
line source
/* * Copyright (c) 2013, 2014, 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.replacements; import com.oracle.graal.replacements.nodes.*; // JaCoCo Exclude /** * Substitutions for {@link java.util.Arrays} methods. */ public class ArraysSubstitutions { public static boolean equals(boolean[] a, boolean[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(byte[] a, byte[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(char[] a, char[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(short[] a, short[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(int[] a, int[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(long[] a, long[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(float[] a, float[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } public static boolean equals(double[] a, double[] a2) { if (a == a2) { return true; } if (a == null || a2 == null || a.length != a2.length) { return false; } return ArrayEqualsNode.equals(a, a2, a.length); } }