├── LICENSE ├── Makefile ├── README.md ├── dtimgextract ├── dtimgextract.c ├── dtimgextract.h ├── qcdt_v1.c ├── qcdt_v2.c ├── qcdt_v3.c ├── qcdt_v3_coolpad.c └── qcdt_v3_motorola_athena.c /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 2, June 1991 3 | 4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc., 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | Preamble 10 | 11 | The licenses for most software are designed to take away your 12 | freedom to share and change it. By contrast, the GNU General Public 13 | License is intended to guarantee your freedom to share and change free 14 | software--to make sure the software is free for all its users. This 15 | General Public License applies to most of the Free Software 16 | Foundation's software and to any other program whose authors commit to 17 | using it. (Some other Free Software Foundation software is covered by 18 | the GNU Lesser General Public License instead.) You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | this service if you wish), that you receive source code or can get it 25 | if you want it, that you can change the software or use pieces of it 26 | in new free programs; and that you know you can do these things. 27 | 28 | To protect your rights, we need to make restrictions that forbid 29 | anyone to deny you these rights or to ask you to surrender the rights. 30 | These restrictions translate to certain responsibilities for you if you 31 | distribute copies of the software, or if you modify it. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must give the recipients all the rights that 35 | you have. You must make sure that they, too, receive or can get the 36 | source code. And you must show them these terms so they know their 37 | rights. 38 | 39 | We protect your rights with two steps: (1) copyright the software, and 40 | (2) offer you this license which gives you legal permission to copy, 41 | distribute and/or modify the software. 42 | 43 | Also, for each author's protection and ours, we want to make certain 44 | that everyone understands that there is no warranty for this free 45 | software. If the software is modified by someone else and passed on, we 46 | want its recipients to know that what they have is not the original, so 47 | that any problems introduced by others will not reflect on the original 48 | authors' reputations. 49 | 50 | Finally, any free program is threatened constantly by software 51 | patents. We wish to avoid the danger that redistributors of a free 52 | program will individually obtain patent licenses, in effect making the 53 | program proprietary. To prevent this, we have made it clear that any 54 | patent must be licensed for everyone's free use or not licensed at all. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | GNU GENERAL PUBLIC LICENSE 60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 | 62 | 0. This License applies to any program or other work which contains 63 | a notice placed by the copyright holder saying it may be distributed 64 | under the terms of this General Public License. The "Program", below, 65 | refers to any such program or work, and a "work based on the Program" 66 | means either the Program or any derivative work under copyright law: 67 | that is to say, a work containing the Program or a portion of it, 68 | either verbatim or with modifications and/or translated into another 69 | language. (Hereinafter, translation is included without limitation in 70 | the term "modification".) Each licensee is addressed as "you". 71 | 72 | Activities other than copying, distribution and modification are not 73 | covered by this License; they are outside its scope. The act of 74 | running the Program is not restricted, and the output from the Program 75 | is covered only if its contents constitute a work based on the 76 | Program (independent of having been made by running the Program). 77 | Whether that is true depends on what the Program does. 78 | 79 | 1. You may copy and distribute verbatim copies of the Program's 80 | source code as you receive it, in any medium, provided that you 81 | conspicuously and appropriately publish on each copy an appropriate 82 | copyright notice and disclaimer of warranty; keep intact all the 83 | notices that refer to this License and to the absence of any warranty; 84 | and give any other recipients of the Program a copy of this License 85 | along with the Program. 86 | 87 | You may charge a fee for the physical act of transferring a copy, and 88 | you may at your option offer warranty protection in exchange for a fee. 89 | 90 | 2. You may modify your copy or copies of the Program or any portion 91 | of it, thus forming a work based on the Program, and copy and 92 | distribute such modifications or work under the terms of Section 1 93 | above, provided that you also meet all of these conditions: 94 | 95 | a) You must cause the modified files to carry prominent notices 96 | stating that you changed the files and the date of any change. 97 | 98 | b) You must cause any work that you distribute or publish, that in 99 | whole or in part contains or is derived from the Program or any 100 | part thereof, to be licensed as a whole at no charge to all third 101 | parties under the terms of this License. 102 | 103 | c) If the modified program normally reads commands interactively 104 | when run, you must cause it, when started running for such 105 | interactive use in the most ordinary way, to print or display an 106 | announcement including an appropriate copyright notice and a 107 | notice that there is no warranty (or else, saying that you provide 108 | a warranty) and that users may redistribute the program under 109 | these conditions, and telling the user how to view a copy of this 110 | License. (Exception: if the Program itself is interactive but 111 | does not normally print such an announcement, your work based on 112 | the Program is not required to print an announcement.) 113 | 114 | These requirements apply to the modified work as a whole. If 115 | identifiable sections of that work are not derived from the Program, 116 | and can be reasonably considered independent and separate works in 117 | themselves, then this License, and its terms, do not apply to those 118 | sections when you distribute them as separate works. But when you 119 | distribute the same sections as part of a whole which is a work based 120 | on the Program, the distribution of the whole must be on the terms of 121 | this License, whose permissions for other licensees extend to the 122 | entire whole, and thus to each and every part regardless of who wrote it. 123 | 124 | Thus, it is not the intent of this section to claim rights or contest 125 | your rights to work written entirely by you; rather, the intent is to 126 | exercise the right to control the distribution of derivative or 127 | collective works based on the Program. 128 | 129 | In addition, mere aggregation of another work not based on the Program 130 | with the Program (or with a work based on the Program) on a volume of 131 | a storage or distribution medium does not bring the other work under 132 | the scope of this License. 133 | 134 | 3. You may copy and distribute the Program (or a work based on it, 135 | under Section 2) in object code or executable form under the terms of 136 | Sections 1 and 2 above provided that you also do one of the following: 137 | 138 | a) Accompany it with the complete corresponding machine-readable 139 | source code, which must be distributed under the terms of Sections 140 | 1 and 2 above on a medium customarily used for software interchange; or, 141 | 142 | b) Accompany it with a written offer, valid for at least three 143 | years, to give any third party, for a charge no more than your 144 | cost of physically performing source distribution, a complete 145 | machine-readable copy of the corresponding source code, to be 146 | distributed under the terms of Sections 1 and 2 above on a medium 147 | customarily used for software interchange; or, 148 | 149 | c) Accompany it with the information you received as to the offer 150 | to distribute corresponding source code. (This alternative is 151 | allowed only for noncommercial distribution and only if you 152 | received the program in object code or executable form with such 153 | an offer, in accord with Subsection b above.) 154 | 155 | The source code for a work means the preferred form of the work for 156 | making modifications to it. For an executable work, complete source 157 | code means all the source code for all modules it contains, plus any 158 | associated interface definition files, plus the scripts used to 159 | control compilation and installation of the executable. However, as a 160 | special exception, the source code distributed need not include 161 | anything that is normally distributed (in either source or binary 162 | form) with the major components (compiler, kernel, and so on) of the 163 | operating system on which the executable runs, unless that component 164 | itself accompanies the executable. 165 | 166 | If distribution of executable or object code is made by offering 167 | access to copy from a designated place, then offering equivalent 168 | access to copy the source code from the same place counts as 169 | distribution of the source code, even though third parties are not 170 | compelled to copy the source along with the object code. 171 | 172 | 4. You may not copy, modify, sublicense, or distribute the Program 173 | except as expressly provided under this License. Any attempt 174 | otherwise to copy, modify, sublicense or distribute the Program is 175 | void, and will automatically terminate your rights under this License. 176 | However, parties who have received copies, or rights, from you under 177 | this License will not have their licenses terminated so long as such 178 | parties remain in full compliance. 179 | 180 | 5. You are not required to accept this License, since you have not 181 | signed it. However, nothing else grants you permission to modify or 182 | distribute the Program or its derivative works. These actions are 183 | prohibited by law if you do not accept this License. Therefore, by 184 | modifying or distributing the Program (or any work based on the 185 | Program), you indicate your acceptance of this License to do so, and 186 | all its terms and conditions for copying, distributing or modifying 187 | the Program or works based on it. 188 | 189 | 6. Each time you redistribute the Program (or any work based on the 190 | Program), the recipient automatically receives a license from the 191 | original licensor to copy, distribute or modify the Program subject to 192 | these terms and conditions. You may not impose any further 193 | restrictions on the recipients' exercise of the rights granted herein. 194 | You are not responsible for enforcing compliance by third parties to 195 | this License. 196 | 197 | 7. If, as a consequence of a court judgment or allegation of patent 198 | infringement or for any other reason (not limited to patent issues), 199 | conditions are imposed on you (whether by court order, agreement or 200 | otherwise) that contradict the conditions of this License, they do not 201 | excuse you from the conditions of this License. If you cannot 202 | distribute so as to satisfy simultaneously your obligations under this 203 | License and any other pertinent obligations, then as a consequence you 204 | may not distribute the Program at all. For example, if a patent 205 | license would not permit royalty-free redistribution of the Program by 206 | all those who receive copies directly or indirectly through you, then 207 | the only way you could satisfy both it and this License would be to 208 | refrain entirely from distribution of the Program. 209 | 210 | If any portion of this section is held invalid or unenforceable under 211 | any particular circumstance, the balance of the section is intended to 212 | apply and the section as a whole is intended to apply in other 213 | circumstances. 214 | 215 | It is not the purpose of this section to induce you to infringe any 216 | patents or other property right claims or to contest validity of any 217 | such claims; this section has the sole purpose of protecting the 218 | integrity of the free software distribution system, which is 219 | implemented by public license practices. Many people have made 220 | generous contributions to the wide range of software distributed 221 | through that system in reliance on consistent application of that 222 | system; it is up to the author/donor to decide if he or she is willing 223 | to distribute software through any other system and a licensee cannot 224 | impose that choice. 225 | 226 | This section is intended to make thoroughly clear what is believed to 227 | be a consequence of the rest of this License. 228 | 229 | 8. If the distribution and/or use of the Program is restricted in 230 | certain countries either by patents or by copyrighted interfaces, the 231 | original copyright holder who places the Program under this License 232 | may add an explicit geographical distribution limitation excluding 233 | those countries, so that distribution is permitted only in or among 234 | countries not thus excluded. In such case, this License incorporates 235 | the limitation as if written in the body of this License. 236 | 237 | 9. The Free Software Foundation may publish revised and/or new versions 238 | of the General Public License from time to time. Such new versions will 239 | be similar in spirit to the present version, but may differ in detail to 240 | address new problems or concerns. 241 | 242 | Each version is given a distinguishing version number. If the Program 243 | specifies a version number of this License which applies to it and "any 244 | later version", you have the option of following the terms and conditions 245 | either of that version or of any later version published by the Free 246 | Software Foundation. If the Program does not specify a version number of 247 | this License, you may choose any version ever published by the Free Software 248 | Foundation. 249 | 250 | 10. If you wish to incorporate parts of the Program into other free 251 | programs whose distribution conditions are different, write to the author 252 | to ask for permission. For software which is copyrighted by the Free 253 | Software Foundation, write to the Free Software Foundation; we sometimes 254 | make exceptions for this. Our decision will be guided by the two goals 255 | of preserving the free status of all derivatives of our free software and 256 | of promoting the sharing and reuse of software generally. 257 | 258 | NO WARRANTY 259 | 260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 | REPAIR OR CORRECTION. 269 | 270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 | POSSIBILITY OF SUCH DAMAGES. 279 | 280 | END OF TERMS AND CONDITIONS 281 | 282 | How to Apply These Terms to Your New Programs 283 | 284 | If you develop a new program, and you want it to be of the greatest 285 | possible use to the public, the best way to achieve this is to make it 286 | free software which everyone can redistribute and change under these terms. 287 | 288 | To do so, attach the following notices to the program. It is safest 289 | to attach them to the start of each source file to most effectively 290 | convey the exclusion of warranty; and each file should have at least 291 | the "copyright" line and a pointer to where the full notice is found. 292 | 293 | {description} 294 | Copyright (C) {year} {fullname} 295 | 296 | This program is free software; you can redistribute it and/or modify 297 | it under the terms of the GNU General Public License as published by 298 | the Free Software Foundation; either version 2 of the License, or 299 | (at your option) any later version. 300 | 301 | This program is distributed in the hope that it will be useful, 302 | but WITHOUT ANY WARRANTY; without even the implied warranty of 303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 | GNU General Public License for more details. 305 | 306 | You should have received a copy of the GNU General Public License along 307 | with this program; if not, write to the Free Software Foundation, Inc., 308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 309 | 310 | Also add information on how to contact you by electronic and paper mail. 311 | 312 | If the program is interactive, make it output a short notice like this 313 | when it starts in an interactive mode: 314 | 315 | Gnomovision version 69, Copyright (C) year name of author 316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 | This is free software, and you are welcome to redistribute it 318 | under certain conditions; type `show c' for details. 319 | 320 | The hypothetical commands `show w' and `show c' should show the appropriate 321 | parts of the General Public License. Of course, the commands you use may 322 | be called something other than `show w' and `show c'; they could even be 323 | mouse-clicks or menu items--whatever suits your program. 324 | 325 | You should also get your employer (if you work as a programmer) or your 326 | school, if any, to sign a "copyright disclaimer" for the program, if 327 | necessary. Here is a sample; alter the names: 328 | 329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 | `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 | 332 | {signature of Ty Coon}, 1 April 1989 333 | Ty Coon, President of Vice 334 | 335 | This General Public License does not permit incorporating your program into 336 | proprietary programs. If your program is a subroutine library, you may 337 | consider it more useful to permit linking proprietary applications with the 338 | library. If this is what you want to do, use the GNU Lesser General 339 | Public License instead of this License. 340 | 341 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | CC=clang 2 | CFLAGS=-c -Wall 3 | LDFLAGS= 4 | TARGET=dtimgextract 5 | SOURCES=dtimgextract.c \ 6 | qcdt_v1.c \ 7 | qcdt_v2.c \ 8 | qcdt_v3.c \ 9 | qcdt_v3_coolpad.c \ 10 | qcdt_v3_motorola_athena.c 11 | OBJECTS=$(SOURCES:.c=.o) 12 | 13 | all: $(SOURCES) $(TARGET) 14 | 15 | $(TARGET): $(OBJECTS) 16 | $(CC) $(LDFLAGS) $(OBJECTS) -o $@ 17 | 18 | .c.o: 19 | $(CC) $(CFLAGS) $< -o $@ 20 | 21 | clean: 22 | rm $(OBJECTS) $(TARGET) 23 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # dtimgextract 2 | Tool to decompile a qualcomm dt.img into its split dtb files for the supported boards. 3 | 4 | Currently only dt.img v2 tested 5 | 6 | ``` 7 | Compile: 8 | gcc dtimgextract.c -o dtimgextract 9 | Usage: 10 | ./dtimgextract dt.img 11 | ``` 12 | 13 | # Example usage and output 14 | 15 | ``` 16 | $ ./dtimgextract dt.img 17 | qc_magic: QCDT 18 | version: 2 19 | count: 3 20 | 21 | Pid Vid Srev Unknown Offset len 22 | 239 8 0 0 800 32800 23 | 241 8 0 0 800 32800 24 | 263 8 0 0 800 32800 25 | 26 | Writing 239_8_0.dtb(32800 bytes) 27 | Writing 241_8_0.dtb(32800 bytes) 28 | Writing 263_8_0.dtb(32800 bytes) 29 | ``` 30 | 31 | # Decompiling the output 32 | ``` 33 | $ dtc -I dtb -O dts 239_8_0.dtb -o 239_8_0.dts 34 | ``` 35 | -------------------------------------------------------------------------------- /dtimgextract: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/s0be/dtimgextract/db133c13a9c5b4c2e0511a22a400e0600baa75af/dtimgextract -------------------------------------------------------------------------------- /dtimgextract.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include "dtimgextract.h" 9 | 10 | dt_parser **dt_parsers; 11 | int dt_parser_cnt = 0; 12 | 13 | void add_dt_parser(dt_parser *dtp) { 14 | if (!dt_parsers) 15 | dt_parsers = malloc(sizeof(dt_parser *)); 16 | else 17 | dt_parsers = realloc(dt_parsers, (dt_parser_cnt + 1) * sizeof(dt_parser *)); 18 | 19 | if (!dt_parsers) { 20 | printf("Failed to allocate memory for %i device tree parsers\n", 21 | dt_parser_cnt); 22 | exit(1); 23 | } 24 | dt_parsers[dt_parser_cnt] = dtp; 25 | dt_parser_cnt++; 26 | } 27 | 28 | uint32_t align(uint32_t datalen, uint32_t page) { 29 | uint32_t seekamt; 30 | seekamt = datalen / page; 31 | seekamt += datalen % page ? 1 : 0; 32 | seekamt *= page; 33 | return seekamt; 34 | } 35 | 36 | void splitFile(char *file, int offs, int usealt){ 37 | 38 | FILE *fd = NULL; 39 | int headerat = offs; 40 | qca_head header; 41 | 42 | if ( (fd=fopen(file,"rb")) == NULL ) { 43 | printf ( "Extract dt.img file, open %s failure!\n", file ); 44 | exit(1); 45 | } 46 | fseek(fd, headerat, SEEK_SET); 47 | retry: 48 | fread(&header, sizeof(qca_head), 1, fd); 49 | 50 | if(strncmp("QCDT", (char *)header.qc_magic, 4)) 51 | { 52 | boot_head bheader; 53 | printf("Not a dt.img, processing as boot.img(got %.4s, wanted %s)\n", header.qc_magic, "QCDT"); 54 | fseek(fd, headerat, SEEK_SET); 55 | fread(&bheader, sizeof(boot_head), 1, fd); 56 | if(strncmp("ANDROID!", (char *)bheader.hd_magic, 8)) { 57 | printf("Not a boot.img, aborting (got %.8s, wanted %s)\n", bheader.hd_magic, "ANDROID!"); 58 | return; 59 | } // 0x1037800/0x106A800 0x33000 60 | printf("hd_magic: %.8s\n", bheader.hd_magic); 61 | printf("k_size: 0x%x\n", bheader.k_size); 62 | printf("k_addr: 0x%x\n", bheader.k_addr); 63 | printf("r_size: 0x%x\n", bheader.r_size); 64 | printf("r_addr: 0x%x\n", bheader.r_addr); 65 | printf("s_size: 0x%x\n", bheader.s_size); 66 | printf("s_addr: 0x%x\n", bheader.s_addr); 67 | printf("t_addr: 0x%x\n", bheader.t_addr); 68 | printf("p_size: 0x%x\n", bheader.p_size); 69 | printf("unused: 0x%x\n", bheader.unused1); 70 | printf("unused: 0x%x\n", bheader.unused2); 71 | printf("pname: %.16s\n", bheader.pname); 72 | printf("cmdline: %.512s\n", bheader.cmdline); 73 | printf("id: %u\n", bheader.id); 74 | 75 | uint32_t seekamt; 76 | fseek (fd, headerat, SEEK_SET); 77 | 78 | seekamt = align(sizeof(boot_head), bheader.p_size); 79 | printf("Skipping android boot header 0x%lx(0x%x)\n", sizeof(boot_head), seekamt); 80 | fseek (fd, seekamt, SEEK_CUR); 81 | 82 | seekamt = align(bheader.k_size, bheader.p_size); 83 | printf("Skipping kernel 0x%x(0x%x)\n", bheader.k_size, seekamt); 84 | fseek (fd, seekamt, SEEK_CUR); 85 | 86 | seekamt = align(bheader.r_size, bheader.p_size); 87 | printf("Skipping ramdisk 0x%x(0x%x)\n", bheader.r_size, seekamt); 88 | fseek (fd, seekamt, SEEK_CUR); 89 | 90 | seekamt = align(bheader.s_size, bheader.p_size); 91 | printf("Skinning secondary image 0x%x(0x%x)\n", bheader.s_size, seekamt); 92 | fseek (fd, seekamt, SEEK_CUR); 93 | 94 | headerat = ftell(fd); 95 | printf("Trying header at 0x%x\n", headerat); 96 | if(fseek(fd, headerat , SEEK_SET)) return; 97 | goto retry; 98 | return; 99 | } 100 | 101 | printf("qc_magic: %.4s\n", header.qc_magic); 102 | printf("version: %u\n", header.version); 103 | printf("count: %u\n", header.num); 104 | 105 | bool dumped = 0; 106 | 107 | for (int i = 0; i < dt_parser_cnt; i++) { 108 | if (dt_parsers[i]->version == header.version && 109 | dt_parsers[i]->extended == usealt) { 110 | dt_parsers[i]->dt_file_dumper(fd, header, headerat); 111 | dumped = 1; 112 | } 113 | } 114 | 115 | if (!dumped) 116 | printf("header v%u format not implemented\n", header.version); return; 117 | 118 | fclose(fd); 119 | } 120 | 121 | void usage(char *name) { 122 | printf("usage:%s [-a] [-o 0xOFFSET] dt.img\n", name); 123 | } 124 | 125 | int main ( int argc, char *argv[] ) 126 | { 127 | int offset = 0; 128 | char *offset_arg = NULL; 129 | int usealt = 0; 130 | char *dtb = NULL; 131 | int c; 132 | 133 | static struct option long_options[] = { 134 | {"offset", required_argument, NULL, 'o'}, 135 | {"usealt", no_argument, NULL, 'a'}, 136 | {NULL, 0, NULL, 0} 137 | }; 138 | 139 | int option_index = 0; 140 | 141 | while ( (c = getopt_long (argc, argv, "-ao:", 142 | long_options, &option_index)) != -1) { 143 | switch(c) { 144 | case 'o': offset_arg = optarg; break; 145 | case 'a': usealt = 1; break; 146 | case 1: 147 | if (dtb == NULL) { 148 | dtb = optarg; 149 | } else { 150 | usage(argv[0]); 151 | exit(1); 152 | } 153 | break; 154 | case '?': 155 | default: 156 | printf("usage\n"); 157 | usage(argv[0]); 158 | exit(1); 159 | break; 160 | } 161 | } 162 | 163 | if (dtb == NULL || argc == 1) { 164 | usage(argv[0]); 165 | exit(1); 166 | } 167 | 168 | if (offset_arg) { 169 | printf("Trying offset of %s\n", offset_arg); 170 | sscanf(offset_arg, "%x", &offset); 171 | } 172 | 173 | splitFile(dtb, offset, usealt); 174 | 175 | return EXIT_SUCCESS; 176 | } 177 | -------------------------------------------------------------------------------- /dtimgextract.h: -------------------------------------------------------------------------------- 1 | #ifndef dtimgextract_h 2 | #define dtimgextract_h 3 | 4 | typedef struct { 5 | uint8_t hd_magic[8]; 6 | uint32_t k_size; 7 | uint32_t k_addr; 8 | uint32_t r_size; 9 | uint32_t r_addr; 10 | uint32_t s_size; 11 | uint32_t s_addr; 12 | uint32_t t_addr; 13 | uint32_t p_size; 14 | uint32_t unused1; 15 | uint32_t unused2; 16 | uint8_t pname[16]; 17 | uint8_t cmdline[512]; 18 | uint32_t id; 19 | } boot_head; 20 | 21 | typedef struct { 22 | uint8_t qc_magic[4]; 23 | uint32_t version; 24 | uint32_t num; 25 | } qca_head; 26 | 27 | typedef struct { 28 | void (*dt_file_dumper)(FILE *fd, qca_head header, uint32_t headerat); 29 | uint32_t version; 30 | bool extended; 31 | } dt_parser; 32 | 33 | void add_dt_parser(dt_parser *dtp); 34 | 35 | #endif 36 | -------------------------------------------------------------------------------- /qcdt_v1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "dtimgextract.h" 8 | 9 | typedef struct { 10 | uint32_t platform_id; 11 | uint32_t variant_id; 12 | uint32_t sec_rev; 13 | uint32_t offset; 14 | uint32_t len; 15 | } dtb_entry_v1; 16 | 17 | void dump_files_v1(FILE *fd, qca_head header, uint32_t headerat) { 18 | int i; 19 | dtb_entry_v1 *images = malloc(header.num * sizeof(dtb_entry_v1)); 20 | 21 | printf("\nPid\tVid\tSrev\tOffset\tlen\n"); 22 | for ( i = 0; i < header.num ; i++ ){ 23 | fread(&images[i], sizeof(dtb_entry_v1), 1, fd); 24 | printf("%x\t%x\t%x\t%x\t%x\n", images[i].platform_id, images[i].variant_id, 25 | images[i].sec_rev, 26 | images[i].offset, images[i].len); 27 | } 28 | printf("\n"); 29 | fseek(fd, headerat, SEEK_SET); 30 | for ( i = 0; i < header.num; i++ ){ 31 | char dtbname[256]; 32 | char *dtb; 33 | FILE *out_fd = NULL; 34 | sprintf(dtbname, "%x_%x_%x.dtb", images[i].platform_id, images[i].variant_id, 35 | images[i].sec_rev); 36 | printf("Writing %s(%x bytes)\n", dtbname, images[i].len); 37 | dtb = malloc(images[i].len); 38 | fseek(fd, images[i].offset + headerat, SEEK_SET); 39 | fread(dtb, images[i].len, 1, fd); 40 | out_fd = fopen(dtbname, "wb"); 41 | fwrite(dtb, images[i].len, 1, out_fd); 42 | free(dtb); 43 | fclose(out_fd); 44 | } 45 | free(images); 46 | } 47 | 48 | dt_parser v1_parser = { 49 | .dt_file_dumper = &dump_files_v1, 50 | .version = 1, 51 | .extended = 0, 52 | }; 53 | 54 | int __attribute__((constructor)) register_v1_parser(void) { 55 | add_dt_parser(&v1_parser); 56 | return 0; 57 | } 58 | -------------------------------------------------------------------------------- /qcdt_v2.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "dtimgextract.h" 8 | 9 | typedef struct { 10 | uint32_t platform_id; 11 | uint32_t variant_id; 12 | uint32_t sec_rev; 13 | uint32_t unknown; 14 | uint32_t offset; 15 | uint32_t len; 16 | } dtb_entry_v2; 17 | 18 | void dump_files_v2(FILE *fd, qca_head header, uint32_t headerat) { 19 | int i; 20 | dtb_entry_v2 *images = malloc(header.num * sizeof(dtb_entry_v2)); 21 | 22 | printf("\nPid\tVid\tSrev\tUnknown\tOffset\tlen\n"); 23 | for ( i = 0; i < header.num ; i++ ){ 24 | fread(&images[i], sizeof(dtb_entry_v2), 1, fd); 25 | printf("%x\t%x\t%x\t%x\t%x\t%x\n", images[i].platform_id, images[i].variant_id, 26 | images[i].sec_rev, images[i].unknown, 27 | images[i].offset, images[i].len); 28 | } 29 | printf("\n"); 30 | fseek(fd, headerat, SEEK_SET); 31 | for ( i = 0; i < header.num; i++ ){ 32 | char dtbname[256]; 33 | char *dtb; 34 | FILE *out_fd = NULL; 35 | sprintf(dtbname, "%x_%x_%x.dtb", images[i].platform_id, images[i].variant_id, 36 | images[i].sec_rev); 37 | printf("Writing %s(%x bytes)\n", dtbname, images[i].len); 38 | dtb = malloc(images[i].len); 39 | fseek(fd, images[i].offset + headerat, SEEK_SET); 40 | fread(dtb, images[i].len, 1, fd); 41 | out_fd = fopen(dtbname, "wb"); 42 | fwrite(dtb, images[i].len, 1, out_fd); 43 | free(dtb); 44 | fclose(out_fd); 45 | } 46 | free(images); 47 | } 48 | 49 | dt_parser v2_parser = { 50 | .dt_file_dumper = &dump_files_v2, 51 | .version = 2, 52 | .extended = 0, 53 | }; 54 | 55 | int __attribute__((constructor)) register_v2_parser(void) { 56 | add_dt_parser(&v2_parser); 57 | return 0; 58 | } 59 | -------------------------------------------------------------------------------- /qcdt_v3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "dtimgextract.h" 8 | 9 | typedef struct { 10 | uint32_t platform_id; 11 | uint32_t variant_id; 12 | uint32_t sec_rev; 13 | uint32_t msm_id2; 14 | uint32_t pmic1; 15 | uint32_t pmic2; 16 | uint32_t pmic3; 17 | uint32_t pmic4; 18 | uint32_t offset; 19 | uint32_t len; 20 | } dtb_entry_v3; 21 | 22 | void dump_files_v3(FILE *fd, qca_head header, uint32_t headerat) { 23 | int i; 24 | dtb_entry_v3 *images = malloc(header.num * sizeof(dtb_entry_v3)); 25 | 26 | printf("\nPid\tVid\tSrev\tmsm_id2\tpmic1\tpmic2\tpmic3\tpmic4\toffset\tlen\n"); 27 | for ( i = 0; i < header.num ; i++ ){ 28 | fread(&images[i], sizeof(dtb_entry_v3), 1, fd); 29 | printf("%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\n", 30 | images[i].platform_id, images[i].variant_id, 31 | images[i].sec_rev, images[i].msm_id2, 32 | images[i].pmic1, images[i].pmic2, 33 | images[i].pmic3, images[i].pmic4, 34 | images[i].offset, images[i].len); 35 | printf(" qcom,msm-id=<0x%x 0x%x>;\n",images[i].platform_id, images[i].msm_id2); 36 | printf(" qcom,pmic-id=<0x%x 0x%x 0x%x 0x%x>;\n", images[i].pmic1, images[i].pmic2, images[i].pmic3, images[i].pmic4); 37 | printf(" qcom,board-id=<0x%x 0x%x>;\n", images[i].variant_id, images[i].sec_rev); 38 | } 39 | printf("\n"); 40 | fseek(fd, headerat, SEEK_SET); 41 | for ( i = 0; i < header.num; i++ ){ 42 | char dtbname[256]; 43 | char *dtb; 44 | FILE *out_fd = NULL; 45 | sprintf(dtbname, "%x_%x_%x_%x.dtb", images[i].platform_id, images[i].variant_id, 46 | images[i].sec_rev, images[i].msm_id2); 47 | printf("Writing %s(%x bytes)\n", dtbname, images[i].len); 48 | dtb = malloc(images[i].len); 49 | fseek(fd, images[i].offset + headerat, SEEK_SET); 50 | fread(dtb, images[i].len, 1, fd); 51 | out_fd = fopen(dtbname, "wb"); 52 | fwrite(dtb, images[i].len, 1, out_fd); 53 | free(dtb); 54 | fclose(out_fd); 55 | } 56 | free(images); 57 | } 58 | 59 | dt_parser v3_parser = { 60 | .dt_file_dumper = &dump_files_v3, 61 | .version = 3, 62 | .extended = 0, 63 | }; 64 | 65 | int __attribute__((constructor)) register_v3_parser(void) { 66 | add_dt_parser(&v3_parser); 67 | return 0; 68 | } 69 | -------------------------------------------------------------------------------- /qcdt_v3_coolpad.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "dtimgextract.h" 8 | 9 | typedef struct { 10 | uint32_t platform_id; 11 | uint32_t variant_id; 12 | uint32_t sec_rev; 13 | uint32_t msm_id2; 14 | uint32_t pmic1; 15 | uint32_t pmic2; 16 | uint32_t pmic3; 17 | uint32_t pmic4; 18 | uint32_t unknown1; 19 | char unknown2[8]; 20 | uint32_t offset; 21 | uint32_t len; 22 | } dtb_entry_v3_coolpad; 23 | 24 | void dump_files_v3_coolpad(FILE *fd, qca_head header, uint32_t headerat) { 25 | int i; 26 | dtb_entry_v3_coolpad *images = malloc(header.num * sizeof(dtb_entry_v3_coolpad)); 27 | 28 | printf("\nPid\tVid\tSrev\tmsm_id2\tpmic1\tpmic2\tpmic3\tpmic4\tunk1\tunk2\tunk3\toffset\tlen\n"); 29 | for ( i = 0; i < header.num ; i++ ){ 30 | fread(&images[i], sizeof(dtb_entry_v3_coolpad), 1, fd); 31 | printf("%x\t%x\t" 32 | "%x\t%x\t" 33 | "%x\t%x\t" 34 | "%x\t%x\t" 35 | "%x\t%s\t" 36 | "%x\t%x\n", 37 | images[i].platform_id, images[i].variant_id, 38 | images[i].sec_rev, images[i].msm_id2, 39 | images[i].pmic1, images[i].pmic2, 40 | images[i].pmic3, images[i].pmic4, 41 | images[i].unknown1, images[i].unknown2, 42 | images[i].offset, images[i].len); 43 | // printf(" qcom,msm-id=<0x%x 0x%x>;\n",images[i].platform_id, images[i].msm_id2); 44 | // printf(" qcom,pmic-id=<0x%x 0x%x 0x%x 0x%x>;\n", images[i].pmic1, images[i].pmic2, images[i].pmic3, images[i].pmic4); 45 | // printf(" qcom,board-id=<0x%x 0x%x>;\n", images[i].variant_id, images[i].sec_rev); 46 | } 47 | printf("\n"); 48 | fseek(fd, headerat, SEEK_SET); 49 | for ( i = 0; i < header.num; i++ ){ 50 | char dtbname[256]; 51 | char *dtb; 52 | FILE *out_fd = NULL; 53 | sprintf(dtbname, "%x_%x_%x_%x_%x.dtb", images[i].platform_id, images[i].variant_id, 54 | images[i].sec_rev, images[i].msm_id2, images[i].unknown1); 55 | printf("Writing %s(%x bytes)\n", dtbname, images[i].len); 56 | dtb = malloc(images[i].len); 57 | fseek(fd, images[i].offset + headerat, SEEK_SET); 58 | fread(dtb, images[i].len, 1, fd); 59 | out_fd = fopen(dtbname, "wb"); 60 | fwrite(dtb, images[i].len, 1, out_fd); 61 | free(dtb); 62 | fclose(out_fd); 63 | } 64 | free(images); 65 | } 66 | 67 | dt_parser v3_parser_coolpad = { 68 | .dt_file_dumper = &dump_files_v3_coolpad, 69 | .version = 3, 70 | .extended = 1, 71 | }; 72 | 73 | int __attribute__((constructor)) register_v3_parser_coolpad(void) { 74 | add_dt_parser(&v3_parser_coolpad); 75 | return 0; 76 | } 77 | -------------------------------------------------------------------------------- /qcdt_v3_motorola_athena.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | #include "dtimgextract.h" 8 | 9 | typedef struct { 10 | uint32_t platform_id; 11 | uint32_t variant_id; 12 | uint32_t sec_rev; 13 | uint32_t msm_id2; 14 | uint32_t pmic1; 15 | uint32_t pmic2; 16 | uint32_t pmic3; 17 | uint32_t pmic4; 18 | uint32_t offset; 19 | uint32_t len; 20 | char something[30]; 21 | } dtb_entry_v3_moto; 22 | 23 | void dump_files_v3_moto(FILE *fd, qca_head header, uint32_t headerat) { 24 | int i; 25 | dtb_entry_v3_moto *images = malloc(header.num * sizeof(dtb_entry_v3_moto)); 26 | 27 | printf("\nPid\tVid\tSrev\tmsm_id2\tpmic1\tpmic2\tpmic3\tpmic4\toffset\tlen\tsomething\n"); 28 | for ( i = 0; i < header.num ; i++ ){ 29 | fread(&images[i], sizeof(dtb_entry_v3_moto), 1, fd); 30 | printf("%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\t%x\t%s\n", 31 | images[i].platform_id, images[i].variant_id, 32 | images[i].sec_rev, images[i].msm_id2, 33 | images[i].pmic1, images[i].pmic2, 34 | images[i].pmic3, images[i].pmic4, 35 | images[i].offset, images[i].len, images[i].something); 36 | printf(" qcom,msm-id=<0x%x 0x%x>;\n",images[i].platform_id, images[i].msm_id2); 37 | printf(" qcom,pmic-id=<0x%x 0x%x 0x%x 0x%x>;\n", images[i].pmic1, images[i].pmic2, images[i].pmic3, images[i].pmic4); 38 | printf(" qcom,board-id=<0x%x 0x%x>;\n", images[i].variant_id, images[i].sec_rev); 39 | } 40 | printf("\n"); 41 | fseek(fd, headerat, SEEK_SET); 42 | for ( i = 0; i < header.num; i++ ){ 43 | char dtbname[256]; 44 | char *dtb; 45 | FILE *out_fd = NULL; 46 | sprintf(dtbname, "%x_%x_%x_%x.dtb", images[i].platform_id, images[i].variant_id, 47 | images[i].sec_rev, images[i].msm_id2); 48 | printf("Writing %s(%x bytes)\n", dtbname, images[i].len); 49 | dtb = malloc(images[i].len); 50 | fseek(fd, images[i].offset + headerat, SEEK_SET); 51 | fread(dtb, images[i].len, 1, fd); 52 | out_fd = fopen(dtbname, "wb"); 53 | fwrite(dtb, images[i].len, 1, out_fd); 54 | free(dtb); 55 | fclose(out_fd); 56 | } 57 | free(images); 58 | } 59 | 60 | dt_parser v3_parser_moto = { 61 | .dt_file_dumper = &dump_files_v3_moto, 62 | .version = 259, 63 | .extended = 1, 64 | }; 65 | 66 | 67 | int __attribute__((constructor)) register_v3_parser_moto(void) { 68 | add_dt_parser(&v3_parser_moto); 69 | return 0; 70 | } 71 | --------------------------------------------------------------------------------