1 /* 2 * Copyright 2013, Google Inc. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: 8 * 9 * * Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * * Redistributions in binary form must reproduce the above 12 * copyright notice, this list of conditions and the following disclaimer 13 * in the documentation and/or other materials provided with the 14 * distribution. 15 * * Neither the name of Google Inc. nor the names of its 16 * contributors may be used to endorse or promote products derived from 17 * this software without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 package org.jf.baksmali; 33 34 import com.google.common.collect.Lists; 35 import org.jf.dexlib2.analysis.ClassPath; 36 import org.jf.dexlib2.analysis.InlineMethodResolver; 37 import org.jf.dexlib2.util.SyntheticAccessorResolver; 38 39 import java.util.Arrays; 40 import java.util.HashMap; 41 import java.util.List; 42 import java.util.Map; 43 44 public class baksmaliOptions { 45 // register info values 46 public static final int ALL = 1; 47 public static final int ALLPRE = 2; 48 public static final int ALLPOST = 4; 49 public static final int ARGS = 8; 50 public static final int DEST = 16; 51 public static final int MERGE = 32; 52 public static final int FULLMERGE = 64; 53 54 public int apiLevel = 15; 55 public String outputDirectory = "out"; 56 public List<String> bootClassPathDirs = Lists.newArrayList(); 57 58 public List<String> bootClassPathEntries = Lists.newArrayList(); 59 public List<String> extraClassPathEntries = Lists.newArrayList(); 60 61 public Map<String,String> resourceIdFileEntries = new HashMap<String,String>(); 62 public Map<Integer,String> resourceIds = new HashMap<Integer,String>(); 63 64 public boolean noParameterRegisters = false; 65 public boolean useLocalsDirective = false; 66 public boolean useSequentialLabels = false; 67 public boolean outputDebugInfo = true; 68 public boolean addCodeOffsets = false; 69 public boolean noAccessorComments = false; 70 public boolean allowOdex = false; 71 public boolean deodex = false; 72 public boolean ignoreErrors = false; 73 public boolean checkPackagePrivateAccess = false; 74 public InlineMethodResolver inlineResolver = null; 75 public int registerInfo = 0; 76 public ClassPath classPath = null; 77 public int jobs = -1; 78 79 public SyntheticAccessorResolver syntheticAccessorResolver = null; 80 setBootClassPath(String bootClassPath)81 public void setBootClassPath(String bootClassPath) { 82 bootClassPathEntries = Lists.newArrayList(bootClassPath.split(":")); 83 } 84 addExtraClassPath(String extraClassPath)85 public void addExtraClassPath(String extraClassPath) { 86 if (extraClassPath.startsWith(":")) { 87 extraClassPath = extraClassPath.substring(1); 88 } 89 extraClassPathEntries.addAll(Arrays.asList(extraClassPath.split(":"))); 90 } 91 setResourceIdFiles(String resourceIdFiles)92 public void setResourceIdFiles(String resourceIdFiles) { 93 for (String resourceIdFile: resourceIdFiles.split(":")) { 94 String[] entry = resourceIdFile.split("="); 95 resourceIdFileEntries.put(entry[1], entry[0]); 96 } 97 } 98 } 99