1 /*
   2  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   3  *
   4  * This code is free software; you can redistribute it and/or modify it
   5  * under the terms of the GNU General Public License version 2 only, as
   6  * published by the Free Software Foundation.  Oracle designates this
   7  * particular file as subject to the "Classpath" exception as provided
   8  * by Oracle in the LICENSE file that accompanied this code.
   9  *
  10  * This code is distributed in the hope that it will be useful, but WITHOUT
  11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  13  * version 2 for more details (a copy is included in the LICENSE file that
  14  * accompanied this code).
  15  *
  16  * You should have received a copy of the GNU General Public License version
  17  * 2 along with this work; if not, write to the Free Software Foundation,
  18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  19  *
  20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  21  * or visit www.oracle.com if you need additional information or have any
  22  * questions.
  23  */
  24 
  25 /*
  26  * This file is available under and governed by the GNU General Public
  27  * License version 2 only, as published by the Free Software Foundation.
  28  * However, the following notice accompanied the original version of this
  29  * file:
  30  *
  31  * ASM: a very small and fast Java bytecode manipulation framework
  32  * Copyright (c) 2000-2011 INRIA, France Telecom
  33  * All rights reserved.
  34  *
  35  * Redistribution and use in source and binary forms, with or without
  36  * modification, are permitted provided that the following conditions
  37  * are met:
  38  * 1. Redistributions of source code must retain the above copyright
  39  *    notice, this list of conditions and the following disclaimer.
  40  * 2. Redistributions in binary form must reproduce the above copyright
  41  *    notice, this list of conditions and the following disclaimer in the
  42  *    documentation and/or other materials provided with the distribution.
  43  * 3. Neither the name of the copyright holders nor the names of its
  44  *    contributors may be used to endorse or promote products derived from
  45  *    this software without specific prior written permission.
  46  *
  47  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  48  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  49  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  50  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  51  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  52  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  53  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  54  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  55  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  56  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  57  * THE POSSIBILITY OF SUCH DAMAGE.
  58  */
  59 
  60 package jdk.internal.org.objectweb.asm.commons;
  61 
  62 import java.util.ArrayList;
  63 import java.util.List;
  64 
  65 import jdk.internal.org.objectweb.asm.Attribute;
  66 import jdk.internal.org.objectweb.asm.ByteVector;
  67 import jdk.internal.org.objectweb.asm.ClassReader;
  68 import jdk.internal.org.objectweb.asm.ClassWriter;
  69 import jdk.internal.org.objectweb.asm.Label;
  70 
  71 /**
  72  * ModuleHashes attribute.
  73  * This attribute is specific to the OpenJDK and may change in the future.
  74  *
  75  * @author Remi Forax
  76  */
  77 public final class ModuleHashesAttribute extends Attribute {
  78     public String algorithm;
  79     public List<String> modules;
  80     public List<byte[]> hashes;
  81 
  82     /**
  83      * Creates an attribute with a hashing algorithm, a list of module names,
  84      * and a list of the same length of hashes.
  85      * @param algorithm the hashing algorithm name.
  86      * @param modules a list of module name
  87      * @param hashes a list of hash, one for each module name.
  88      */
  89     public ModuleHashesAttribute(final String algorithm,
  90             final List<String> modules, final List<byte[]> hashes) {
  91         super("ModuleHashes");
  92         this.algorithm = algorithm;
  93         this.modules = modules;
  94         this.hashes = hashes;
  95     }
  96 
  97     /**
  98      * Creates an empty attribute that can be used as prototype
  99      * to be passed as argument of the method
 100      * {@link ClassReader#accept(org.objectweb.asm.ClassVisitor, Attribute[], int)}.
 101      */
 102     public ModuleHashesAttribute() {
 103         this(null, null, null);
 104     }
 105 
 106     @Override
 107     protected Attribute read(ClassReader cr, int off, int len, char[] buf,
 108             int codeOff, Label[] labels) {
 109         String hashAlgorithm = cr.readUTF8(off, buf);
 110 
 111         int count = cr.readUnsignedShort(off + 2);
 112         ArrayList<String> modules = new ArrayList<String>(count);
 113         ArrayList<byte[]> hashes = new ArrayList<byte[]>(count);
 114         off += 4;
 115 
 116         for (int i = 0; i < count; i++) {
 117             String module = cr.readModule(off, buf);
 118             int hashLength = cr.readUnsignedShort(off + 2);
 119             off += 4;
 120 
 121             byte[] hash = new byte[hashLength];
 122             for (int j = 0; j < hashLength; j++) {
 123                 hash[j] = (byte) (cr.readByte(off + j) & 0xff);
 124             }
 125             off += hashLength;
 126 
 127             modules.add(module);
 128             hashes.add(hash);
 129         }
 130         return new ModuleHashesAttribute(hashAlgorithm, modules, hashes);
 131     }
 132 
 133     @Override
 134     protected ByteVector write(ClassWriter cw, byte[] code, int len,
 135             int maxStack, int maxLocals) {
 136         ByteVector v = new ByteVector();
 137         int index = cw.newUTF8(algorithm);
 138         v.putShort(index);
 139 
 140         int count = (modules == null)? 0: modules.size();
 141         v.putShort(count);
 142 
 143         for(int i = 0; i < count; i++) {
 144             String module = modules.get(i);
 145             v.putShort(cw.newModule(module));
 146 
 147             byte[] hash = hashes.get(i);
 148             v.putShort(hash.length);
 149             for(byte b: hash) {
 150                 v.putByte(b);
 151             }
 152         }
 153         return v;
 154     }
 155 }