java动态打包_Java服务器动态打包APK安装包(添加渠道等相关信息)-程序员宅基地

技术标签: java动态打包  

1 importjava.io.IOException;2 importjava.nio.BufferUnderflowException;3 importjava.nio.ByteBuffer;4 importjava.nio.ByteOrder;5 importjava.nio.channels.FileChannel;6 importjava.util.LinkedHashMap;7 importjava.util.Map;8

9 final classApkUtil {10 privateApkUtil() {11 super();12 }13

14 /**

15 * APK Signing Block Magic Code: magic “APK Sig Block 42” (16 bytes)16 * "APK Sig Block 42" : 41 50 4B 20 53 69 67 20 42 6C 6F 63 6B 20 34 3217 */

18 public static final long APK_SIG_BLOCK_MAGIC_HI = 0x3234206b636f6c42L; //LITTLE_ENDIAN, High

19 public static final long APK_SIG_BLOCK_MAGIC_LO = 0x20676953204b5041L; //LITTLE_ENDIAN, Low

20 private static final int APK_SIG_BLOCK_MIN_SIZE = 32;21

22 /*

23 The v2 signature of the APK is stored as an ID-value pair with ID 0x7109871a24 (https://source.android.com/security/apksigning/v2.html#apk-signing-block)25 */

26 public static final int APK_SIGNATURE_SCHEME_V2_BLOCK_ID = 0x7109871a;27

28 /**

29 * The padding in APK SIG BLOCK (V3 scheme introduced)30 * Seehttps://android.googlesource.com/platform/tools/apksig/+/master/src/main/java/com/android/apksig/internal/apk/ApkSigningBlockUtils.java31 */

32 public static final int VERITY_PADDING_BLOCK_ID = 0x42726577;33

34 public static final int ANDROID_COMMON_PAGE_ALIGNMENT_BYTES = 4096;35

36

37 //Our Channel Block ID

38 public static final int APK_CHANNEL_BLOCK_ID = 0x71777777;39

40 public static final String DEFAULT_CHARSET = "UTF-8";41

42 private static final int ZIP_EOCD_REC_MIN_SIZE = 22;43 private static final int ZIP_EOCD_REC_SIG = 0x06054b50;44 private static final int UINT16_MAX_VALUE = 0xffff;45 private static final int ZIP_EOCD_COMMENT_LENGTH_FIELD_OFFSET = 20;46

47 public static long getCommentLength(final FileChannel fileChannel) throwsIOException {48 //End of central directory record (EOCD)49 //Offset Bytes Description[23]50 //0 4 End of central directory signature = 0x06054b5051 //4 2 Number of this disk52 //6 2 Disk where central directory starts53 //8 2 Number of central directory records on this disk54 //10 2 Total number of central directory records55 //12 4 Size of central directory (bytes)56 //16 4 Offset of start of central directory, relative to start of archive57 //20 2 Comment length (n)58 //22 n Comment59 //For a zip with no archive comment, the60 //end-of-central-directory record will be 22 bytes long, so61 //we expect to find the EOCD marker 22 bytes from the end.

62

63

64 final long archiveSize =fileChannel.size();65 if (archiveSize

77 final long maxCommentLength = Math.min(archiveSize -ZIP_EOCD_REC_MIN_SIZE, UINT16_MAX_VALUE);78 final long eocdWithEmptyCommentStartPosition = archiveSize -ZIP_EOCD_REC_MIN_SIZE;79 for (int expectedCommentLength = 0; expectedCommentLength <=maxCommentLength;80 expectedCommentLength++) {81 final long eocdStartPos = eocdWithEmptyCommentStartPosition -expectedCommentLength;82

83 final ByteBuffer byteBuffer = ByteBuffer.allocate(4);84 fileChannel.position(eocdStartPos);85 fileChannel.read(byteBuffer);86 byteBuffer.order(ByteOrder.LITTLE_ENDIAN);87

88 if (byteBuffer.getInt(0) ==ZIP_EOCD_REC_SIG) {89 final ByteBuffer commentLengthByteBuffer = ByteBuffer.allocate(2);90 fileChannel.position(eocdStartPos +ZIP_EOCD_COMMENT_LENGTH_FIELD_OFFSET);91 fileChannel.read(commentLengthByteBuffer);92 commentLengthByteBuffer.order(ByteOrder.LITTLE_ENDIAN);93

94 final int actualCommentLength = commentLengthByteBuffer.getShort(0);95 if (actualCommentLength ==expectedCommentLength) {96 returnactualCommentLength;97 }98 }99 }100 throw new IOException("ZIP End of Central Directory (EOCD) record not found");101 }102

103 public static long findCentralDirStartOffset(final FileChannel fileChannel) throwsIOException {104 returnfindCentralDirStartOffset(fileChannel, getCommentLength(fileChannel));105 }106

107 public static long findCentralDirStartOffset(final FileChannel fileChannel, final long commentLength) throwsIOException {108 //End of central directory record (EOCD)109 //Offset Bytes Description[23]110 //0 4 End of central directory signature = 0x06054b50111 //4 2 Number of this disk112 //6 2 Disk where central directory starts113 //8 2 Number of central directory records on this disk114 //10 2 Total number of central directory records115 //12 4 Size of central directory (bytes)116 //16 4 Offset of start of central directory, relative to start of archive117 //20 2 Comment length (n)118 //22 n Comment119 //For a zip with no archive comment, the120 //end-of-central-directory record will be 22 bytes long, so121 //we expect to find the EOCD marker 22 bytes from the end.

122

123 final ByteBuffer zipCentralDirectoryStart = ByteBuffer.allocate(4);124 zipCentralDirectoryStart.order(ByteOrder.LITTLE_ENDIAN);125 fileChannel.position(fileChannel.size() - commentLength - 6); //6 = 2 (Comment length) + 4 (Offset of start of central directory, relative to start of archive)

126 fileChannel.read(zipCentralDirectoryStart);127 final long centralDirStartOffset = zipCentralDirectoryStart.getInt(0);128 returncentralDirStartOffset;129 }130

131 public static PairfindApkSigningBlock(132 final FileChannel fileChannel) throwsIOException, SignatureNotFoundException {133 final long centralDirOffset =findCentralDirStartOffset(fileChannel);134 returnfindApkSigningBlock(fileChannel, centralDirOffset);135 }136

137 public static PairfindApkSigningBlock(138 final FileChannel fileChannel, final long centralDirOffset) throwsIOException, SignatureNotFoundException {139

140 //Find the APK Signing Block. The block immediately precedes the Central Directory.141

142 //FORMAT:143 //OFFSET DATA TYPE DESCRIPTION144 //* @+0 bytes uint64: size in bytes (excluding this field)145 //* @+8 bytes payload146 //* @-24 bytes uint64: size in bytes (same as the one above)147 //* @-16 bytes uint128: magic

148

149 if (centralDirOffset

152 +centralDirOffset);153 }154 //Read the magic and offset in file from the footer section of the block:155 //* uint64: size of block156 //* 16 bytes: magic

157 fileChannel.position(centralDirOffset - 24);158 final ByteBuffer footer = ByteBuffer.allocate(24);159 fileChannel.read(footer);160 footer.order(ByteOrder.LITTLE_ENDIAN);161 if ((footer.getLong(8) !=APK_SIG_BLOCK_MAGIC_LO)162 || (footer.getLong(16) !=APK_SIG_BLOCK_MAGIC_HI)) {163 throw newSignatureNotFoundException(164 "No APK Signing Block before ZIP Central Directory");165 }166 //Read and compare size fields

167 final long apkSigBlockSizeInFooter = footer.getLong(0);168 if ((apkSigBlockSizeInFooter Integer.MAX_VALUE - 8)) {170 throw newSignatureNotFoundException(171 "APK Signing Block size out of range: " +apkSigBlockSizeInFooter);172 }173 final int totalSize = (int) (apkSigBlockSizeInFooter + 8);174 final long apkSigBlockOffset = centralDirOffset -totalSize;175 if (apkSigBlockOffset < 0) {176 throw newSignatureNotFoundException(177 "APK Signing Block offset out of range: " +apkSigBlockOffset);178 }179 fileChannel.position(apkSigBlockOffset);180 final ByteBuffer apkSigBlock =ByteBuffer.allocate(totalSize);181 fileChannel.read(apkSigBlock);182 apkSigBlock.order(ByteOrder.LITTLE_ENDIAN);183 final long apkSigBlockSizeInHeader = apkSigBlock.getLong(0);184 if (apkSigBlockSizeInHeader !=apkSigBlockSizeInFooter) {185 throw newSignatureNotFoundException(186 "APK Signing Block sizes in header and footer do not match: "

187 + apkSigBlockSizeInHeader + " vs " +apkSigBlockSizeInFooter);188 }189 returnPair.of(apkSigBlock, apkSigBlockOffset);190 }191

192 public static Map findIdValues(final ByteBuffer apkSigningBlock) throwsSignatureNotFoundException {193 checkByteOrderLittleEndian(apkSigningBlock);194 //FORMAT:195 //OFFSET DATA TYPE DESCRIPTION196 //* @+0 bytes uint64: size in bytes (excluding this field)197 //* @+8 bytes pairs198 //* @-24 bytes uint64: size in bytes (same as the one above)199 //* @-16 bytes uint128: magic

200 final ByteBuffer pairs = sliceFromTo(apkSigningBlock, 8, apkSigningBlock.capacity() - 24);201

202 final Map idValues = new LinkedHashMap(); //keep order

203

204 int entryCount = 0;205 while(pairs.hasRemaining()) {206 entryCount++;207 if (pairs.remaining() < 8) {208 throw newSignatureNotFoundException(209 "Insufficient data to read size of APK Signing Block entry #" +entryCount);210 }211 final long lenLong =pairs.getLong();212 if ((lenLong < 4) || (lenLong >Integer.MAX_VALUE)) {213 throw newSignatureNotFoundException(214 "APK Signing Block entry #" +entryCount215 + " size out of range: " +lenLong);216 }217 final int len = (int) lenLong;218 final int nextEntryPos = pairs.position() +len;219 if (len >pairs.remaining()) {220 throw newSignatureNotFoundException(221 "APK Signing Block entry #" + entryCount + " size out of range: " +len222 + ", available: " +pairs.remaining());223 }224 final int id =pairs.getInt();225 idValues.put(id, getByteBuffer(pairs, len - 4));226

227 pairs.position(nextEntryPos);228 }229

230 returnidValues;231 }232

233 /**

234 * Returns new byte buffer whose content is a shared subsequence of this buffer's content235 * between the specified start (inclusive) and end (exclusive) positions. As opposed to236 * {@linkByteBuffer#slice()}, the returned buffer's byte order is the same as the source237 * buffer's byte order.238 */

239 private static ByteBuffer sliceFromTo(final ByteBuffer source, final int start, final intend) {240 if (start < 0) {241 throw new IllegalArgumentException("start: " +start);242 }243 if (end source.capacity()) {248 throw new IllegalArgumentException("end > capacity: " + end + " > " +capacity);249 }250 final int originalLimit =source.limit();251 final int originalPosition =source.position();252 try{253 source.position(0);254 source.limit(end);255 source.position(start);256 final ByteBuffer result =source.slice();257 result.order(source.order());258 returnresult;259 } finally{260 source.position(0);261 source.limit(originalLimit);262 source.position(originalPosition);263 }264 }265

266 /**

267 * Relative get method for reading {@codesize} number of bytes from the current268 * position of this buffer.269 *

270 *

This method reads the next {@codesize} bytes at this buffer's current position,271 * returning them as a {@codeByteBuffer} with start set to 0, limit and capacity set to272 * {@codesize}, byte order set to this buffer's byte order; and then increments the position by273 * {@codesize}.274 */

275 private static ByteBuffer getByteBuffer(final ByteBuffer source, final intsize)276 throwsBufferUnderflowException {277 if (size < 0) {278 throw new IllegalArgumentException("size: " +size);279 }280 final int originalLimit =source.limit();281 final int position =source.position();282 final int limit = position +size;283 if ((limit < position) || (limit >originalLimit)) {284 throw newBufferUnderflowException();285 }286 source.limit(limit);287 try{288 final ByteBuffer result =source.slice();289 result.order(source.order());290 source.position(limit);291 returnresult;292 } finally{293 source.limit(originalLimit);294 }295 }296

297 private static void checkByteOrderLittleEndian(finalByteBuffer buffer) {298 if (buffer.order() !=ByteOrder.LITTLE_ENDIAN) {299 throw new IllegalArgumentException("ByteBuffer byte order must be little endian");300 }301 }302

303

304 }

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/weixin_29168675/article/details/114080240

智能推荐

分布式光纤传感器的全球与中国市场2022-2028年:技术、参与者、趋势、市场规模及占有率研究报告_预计2026年中国分布式传感器市场规模有多大-程序员宅基地

文章浏览阅读3.2k次。本文研究全球与中国市场分布式光纤传感器的发展现状及未来发展趋势,分别从生产和消费的角度分析分布式光纤传感器的主要生产地区、主要消费地区以及主要的生产商。重点分析全球与中国市场的主要厂商产品特点、产品规格、不同规格产品的价格、产量、产值及全球和中国市场主要生产商的市场份额。主要生产商包括:FISO TechnologiesBrugg KabelSensor HighwayOmnisensAFL GlobalQinetiQ GroupLockheed MartinOSENSA Innovati_预计2026年中国分布式传感器市场规模有多大

07_08 常用组合逻辑电路结构——为IC设计的延时估计铺垫_基4布斯算法代码-程序员宅基地

文章浏览阅读1.1k次,点赞2次,收藏12次。常用组合逻辑电路结构——为IC设计的延时估计铺垫学习目的:估计模块间的delay,确保写的代码的timing 综合能给到多少HZ,以满足需求!_基4布斯算法代码

OpenAI Manager助手(基于SpringBoot和Vue)_chatgpt网页版-程序员宅基地

文章浏览阅读3.3k次,点赞3次,收藏5次。OpenAI Manager助手(基于SpringBoot和Vue)_chatgpt网页版

关于美国计算机奥赛USACO,你想知道的都在这_usaco可以多次提交吗-程序员宅基地

文章浏览阅读2.2k次。USACO自1992年举办,到目前为止已经举办了27届,目的是为了帮助美国信息学国家队选拔IOI的队员,目前逐渐发展为全球热门的线上赛事,成为美国大学申请条件下,含金量相当高的官方竞赛。USACO的比赛成绩可以助力计算机专业留学,越来越多的学生进入了康奈尔,麻省理工,普林斯顿,哈佛和耶鲁等大学,这些同学的共同点是他们都参加了美国计算机科学竞赛(USACO),并且取得过非常好的成绩。适合参赛人群USACO适合国内在读学生有意向申请美国大学的或者想锻炼自己编程能力的同学,高三学生也可以参加12月的第_usaco可以多次提交吗

MySQL存储过程和自定义函数_mysql自定义函数和存储过程-程序员宅基地

文章浏览阅读394次。1.1 存储程序1.2 创建存储过程1.3 创建自定义函数1.3.1 示例1.4 自定义函数和存储过程的区别1.5 变量的使用1.6 定义条件和处理程序1.6.1 定义条件1.6.1.1 示例1.6.2 定义处理程序1.6.2.1 示例1.7 光标的使用1.7.1 声明光标1.7.2 打开光标1.7.3 使用光标1.7.4 关闭光标1.8 流程控制的使用1.8.1 IF语句1.8.2 CASE语句1.8.3 LOOP语句1.8.4 LEAVE语句1.8.5 ITERATE语句1.8.6 REPEAT语句。_mysql自定义函数和存储过程

半导体基础知识与PN结_本征半导体电流为0-程序员宅基地

文章浏览阅读188次。半导体二极管——集成电路最小组成单元。_本征半导体电流为0

随便推点

【Unity3d Shader】水面和岩浆效果_unity 岩浆shader-程序员宅基地

文章浏览阅读2.8k次,点赞3次,收藏18次。游戏水面特效实现方式太多。咱们这边介绍的是一最简单的UV动画(无顶点位移),整个mesh由4个顶点构成。实现了水面效果(左图),不动代码稍微修改下参数和贴图可以实现岩浆效果(右图)。有要思路是1,uv按时间去做正弦波移动2,在1的基础上加个凹凸图混合uv3,在1、2的基础上加个水流方向4,加上对雾效的支持,如没必要请自行删除雾效代码(把包含fog的几行代码删除)S..._unity 岩浆shader

广义线性模型——Logistic回归模型(1)_广义线性回归模型-程序员宅基地

文章浏览阅读5k次。广义线性模型是线性模型的扩展,它通过连接函数建立响应变量的数学期望值与线性组合的预测变量之间的关系。广义线性模型拟合的形式为:其中g(μY)是条件均值的函数(称为连接函数)。另外,你可放松Y为正态分布的假设,改为Y 服从指数分布族中的一种分布即可。设定好连接函数和概率分布后,便可以通过最大似然估计的多次迭代推导出各参数值。在大部分情况下,线性模型就可以通过一系列连续型或类别型预测变量来预测正态分布的响应变量的工作。但是,有时候我们要进行非正态因变量的分析,例如:(1)类别型.._广义线性回归模型

HTML+CSS大作业 环境网页设计与实现(垃圾分类) web前端开发技术 web课程设计 网页规划与设计_垃圾分类网页设计目标怎么写-程序员宅基地

文章浏览阅读69次。环境保护、 保护地球、 校园环保、垃圾分类、绿色家园、等网站的设计与制作。 总结了一些学生网页制作的经验:一般的网页需要融入以下知识点:div+css布局、浮动、定位、高级css、表格、表单及验证、js轮播图、音频 视频 Flash的应用、ul li、下拉导航栏、鼠标划过效果等知识点,网页的风格主题也很全面:如爱好、风景、校园、美食、动漫、游戏、咖啡、音乐、家乡、电影、名人、商城以及个人主页等主题,学生、新手可参考下方页面的布局和设计和HTML源码(有用点赞△) 一套A+的网_垃圾分类网页设计目标怎么写

C# .Net 发布后,把dll全部放在一个文件夹中,让软件目录更整洁_.net dll 全局目录-程序员宅基地

文章浏览阅读614次,点赞7次,收藏11次。之前找到一个修改 exe 中 DLL地址 的方法, 不太好使,虽然能正确启动, 但无法改变 exe 的工作目录,这就影响了.Net 中很多获取 exe 执行目录来拼接的地址 ( 相对路径 ),比如 wwwroot 和 代码中相对目录还有一些复制到目录的普通文件 等等,它们的地址都会指向原来 exe 的目录, 而不是自定义的 “lib” 目录,根本原因就是没有修改 exe 的工作目录这次来搞一个启动程序,把 .net 的所有东西都放在一个文件夹,在文件夹同级的目录制作一个 exe._.net dll 全局目录

BRIEF特征点描述算法_breif description calculation 特征点-程序员宅基地

文章浏览阅读1.5k次。本文为转载,原博客地址:http://blog.csdn.net/hujingshuang/article/details/46910259简介 BRIEF是2010年的一篇名为《BRIEF:Binary Robust Independent Elementary Features》的文章中提出,BRIEF是对已检测到的特征点进行描述,它是一种二进制编码的描述子,摈弃了利用区域灰度..._breif description calculation 特征点

房屋租赁管理系统的设计和实现,SpringBoot计算机毕业设计论文_基于spring boot的房屋租赁系统论文-程序员宅基地

文章浏览阅读4.1k次,点赞21次,收藏79次。本文是《基于SpringBoot的房屋租赁管理系统》的配套原创说明文档,可以给应届毕业生提供格式撰写参考,也可以给开发类似系统的朋友们提供功能业务设计思路。_基于spring boot的房屋租赁系统论文