1 /*
2  * Copyright (C) 2014 The Android Open Source Project
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  *      http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  */
16 
17 package dexfuzz.rawdex;
18 
19 import java.io.IOException;
20 
21 public class TypeList implements RawDexObject {
22   public int size;
23   public TypeItem[] list;
24 
25   @Override
read(DexRandomAccessFile file)26   public void read(DexRandomAccessFile file) throws IOException {
27     file.alignForwards(4);
28     file.getOffsetTracker().getNewOffsettable(file, this);
29     size = file.readUInt();
30     list = new TypeItem[size];
31     for (int i = 0; i < size; i++) {
32       (list[i] = new TypeItem()).read(file);
33     }
34   }
35 
36   @Override
write(DexRandomAccessFile file)37   public void write(DexRandomAccessFile file) throws IOException {
38     file.alignForwards(4);
39     file.getOffsetTracker().updatePositionOfNextOffsettable(file);
40     file.writeUInt(size);
41     for (TypeItem typeItem : list) {
42       typeItem.write(file);
43     }
44   }
45 
46   @Override
incrementIndex(IndexUpdateKind kind, int insertedIdx)47   public void incrementIndex(IndexUpdateKind kind, int insertedIdx) {
48     for (TypeItem type : list) {
49       type.incrementIndex(kind, insertedIdx);
50     }
51   }
52 
53   /**
54    * Returns if this TypeList comes before the provided TypeList, considering the legal
55    * ordering of TypeLists in DEX files.
56    */
comesBefore(TypeList other)57   public boolean comesBefore(TypeList other) {
58     int checkSize = Math.min(size, other.size);
59     for (int i = 0; i < checkSize; i++) {
60       if (list[i].typeIdx < other.list[i].typeIdx) {
61         return true;
62       } else if (list[i].typeIdx > other.list[i].typeIdx) {
63         return false;
64       }
65     }
66     if (size == other.size) {
67       return false;
68     }
69     return true;
70   }
71 }