├── .gitignore ├── .idea └── .gitignore ├── CMakeLists.txt ├── LICENSE ├── README.md ├── da.c ├── da.h ├── endianness.h ├── gpt.c ├── gpt.h ├── main.c └── sprd.h /.gitignore: -------------------------------------------------------------------------------- 1 | cmake-build-debug/ 2 | .idea/vcs.xml -------------------------------------------------------------------------------- /.idea/.gitignore: -------------------------------------------------------------------------------- 1 | # Default ignored files 2 | /shelf/ 3 | /workspace.xml 4 | # Editor-based HTTP Client requests 5 | /httpRequests/ 6 | # Datasource local storage ignored files 7 | /dataSources/ 8 | /dataSources.local.xml 9 | -------------------------------------------------------------------------------- /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required(VERSION 3.27) 2 | project(sprdclient C) 3 | 4 | set(CMAKE_C_STANDARD 11) 5 | 6 | add_executable(sprdclient main.c 7 | da.c 8 | gpt.c) 9 | # sudo apt install libusb-1.0-0-dev 10 | target_link_libraries(sprdclient usb-1.0) 11 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # sprdclient 2 | 3 | sprdclient aims to be a simple and easy to use tool to interact with Spreadtrum / Unisoc BootROM and FDLs. 4 | 5 | ## Goals 6 | 7 | - [x] Talk to the BootROM 8 | - [ ] Read flash memory 9 | - [ ] Write flash memory 10 | 11 | ## Supported chipsets 12 | 13 | - SC8541E 14 | - SC9832E 15 | - UMS512 16 | 17 | ## Build 18 | 19 | ### Linux 20 | 21 | ```sh 22 | git clone https://github.com/iscle/sprdclient 23 | cd sprdclient 24 | mkdir build 25 | cd build 26 | cmake .. 27 | make 28 | ``` 29 | 30 | ## License 31 | 32 | This project is licensed under the GPL-3.0 license - see the [LICENSE](LICENSE) file for details. 33 | 34 | ## Acknowledgments 35 | 36 | - [TomKing062](https://github.com/TomKing062): Provided dumps of the BootROM for various chipsets. 37 | - [Ilya Kurdyukov](https://github.com/ilyakurdyukov): Created the original tool that this project is inspired on. 38 | -------------------------------------------------------------------------------- /da.c: -------------------------------------------------------------------------------- 1 | #include "da.h" 2 | #include 3 | #include 4 | #include "endianness.h" 5 | 6 | #define EP_IN 0x85 // (0x80 | 0x05) 7 | #define EP_OUT 0x06 8 | #define TIMEOUT_MS 0 9 | 10 | #define DA_MAX_LENGTH 4096 11 | #define DA_MAX_DATA_LENGTH (DA_MAX_LENGTH - 4 - 2) 12 | static uint8_t da_buf[DA_MAX_LENGTH]; 13 | 14 | static uint16_t crc16(const void *data, size_t length) { 15 | const uint8_t *d = data; 16 | uint16_t crc = 0; 17 | for (size_t i = 0; i < length; i++) { 18 | crc ^= d[i] << 8; 19 | for (uint8_t j = 0; j < 8; j++) { 20 | if (crc & 0x8000) { 21 | crc = (crc << 1) ^ 0x1021; 22 | } else { 23 | crc = crc << 1; 24 | } 25 | } 26 | } 27 | return crc; 28 | } 29 | 30 | int da_receive(libusb_device_handle *handle, uint16_t *cmd, uint16_t *data_length, void **data) { 31 | int transferred; 32 | int ret = libusb_bulk_transfer( 33 | handle, 34 | EP_IN, 35 | da_buf, 36 | sizeof(da_buf), 37 | &transferred, 38 | TIMEOUT_MS 39 | ); 40 | if (ret) { 41 | printf("libusb_bulk_transfer failed: %s\n", libusb_error_name(ret)); 42 | return ret; 43 | } 44 | 45 | // printf("Received %d bytes\n", transferred); 46 | 47 | if (transferred < 3) { 48 | printf("transferred < 3\n"); 49 | return -1; 50 | } 51 | 52 | *cmd = READ_BE16(da_buf + 0); 53 | *data_length = READ_BE16(da_buf + 2); 54 | 55 | if (*data_length > DA_MAX_DATA_LENGTH) { 56 | printf("length too long\n"); 57 | return -1; 58 | } 59 | 60 | if (transferred != (4 + *data_length + 2)) { 61 | printf("transferred != (4 + *data_length + 2)\n"); 62 | return -1; 63 | } 64 | 65 | *data = da_buf + 4; 66 | 67 | uint16_t crc = READ_BE16(da_buf + 4 + *data_length); 68 | if (crc != crc16(da_buf, 4 + *data_length)) { 69 | printf("crc != crc16(da_buf, 4 + length)\n"); 70 | return -1; 71 | } 72 | 73 | return 0; 74 | } 75 | 76 | int da_receive_status(libusb_device_handle *handle, da_status_t *status) { 77 | uint16_t cmd; 78 | uint16_t data_length; 79 | void *data; 80 | int ret = da_receive(handle, &cmd, &data_length, &data); 81 | if (ret) { 82 | return ret; 83 | } 84 | 85 | if (cmd != CMD_STATUS) { 86 | printf("cmd != CMD_STATUS\n"); 87 | return -1; 88 | } 89 | 90 | if (data_length != 2) { 91 | printf("data_length != 2\n"); 92 | return -1; 93 | } 94 | 95 | *status = READ_BE16(data); 96 | return 0; 97 | } 98 | 99 | int da_check_status(libusb_device_handle *handle) { 100 | da_status_t status; 101 | int ret = da_receive_status(handle, &status); 102 | if (ret) { 103 | return ret; 104 | } 105 | 106 | if (status != STATUS_OK) { 107 | printf("status != STATUS_OK\n"); 108 | return -1; 109 | } 110 | 111 | return 0; 112 | } 113 | 114 | int da_send(libusb_device_handle *handle, uint16_t cmd, uint16_t data_length, const void *data) { 115 | if (data_length > DA_MAX_DATA_LENGTH) { 116 | printf("data_length too long\n"); 117 | return -1; 118 | } 119 | 120 | WRITE_BE16(da_buf + 0, cmd); 121 | WRITE_BE16(da_buf + 2, data_length); 122 | memcpy(da_buf + 4, data, data_length); 123 | uint16_t crc = crc16(da_buf, 4 + data_length); 124 | WRITE_BE16(da_buf + 4 + data_length, crc); 125 | 126 | int transferred; 127 | int ret = libusb_bulk_transfer( 128 | handle, 129 | EP_OUT, 130 | da_buf, 131 | 4 + data_length + 2, 132 | &transferred, 133 | TIMEOUT_MS 134 | ); 135 | if (ret) { 136 | printf("libusb_bulk_transfer failed: %s\n", libusb_error_name(ret)); 137 | return ret; 138 | } 139 | 140 | // printf("Sent %d bytes\n", transferred); 141 | 142 | if (transferred != (4 + data_length + 2)) { 143 | printf("transferred != (4 + data_length + 2)\n"); 144 | return -1; 145 | } 146 | 147 | return 0; 148 | } 149 | 150 | int da_emmc_init(libusb_device_handle *handle) { 151 | int ret = da_send(handle, CMD_EMMC_INIT, 0, NULL); 152 | if (ret) { 153 | return ret; 154 | } 155 | 156 | return da_check_status(handle); 157 | } 158 | 159 | int da_emmc_switch(libusb_device_handle *handle, uint8_t index, uint8_t value) { 160 | uint8_t buf[2]; 161 | buf[0] = index; 162 | buf[1] = value; 163 | int ret = da_send(handle, CMD_EMMC_SWITCH, 2, buf); 164 | if (ret) { 165 | return ret; 166 | } 167 | 168 | return da_check_status(handle); 169 | } 170 | 171 | int da_get_sec_count(libusb_device_handle *handle, uint32_t *sec_count) { 172 | int ret = da_send(handle, CMD_EMMC_GET_SEC_COUNT, 0, NULL); 173 | if (ret) { 174 | return ret; 175 | } 176 | 177 | uint16_t cmd; 178 | uint16_t data_length; 179 | void *data; 180 | ret = da_receive(handle, &cmd, &data_length, &data); 181 | if (ret) { 182 | return ret; 183 | } 184 | 185 | if (cmd != CMD_EMMC_GET_SEC_COUNT) { 186 | printf("cmd != CMD_EMMC_GET_SEC_COUNT (0x%04X)\n", cmd); 187 | return -1; 188 | } 189 | 190 | if (data_length != 4) { 191 | printf("data_length != 4\n"); 192 | return -1; 193 | } 194 | 195 | *sec_count = READ_BE32(data); 196 | return 0; 197 | } 198 | 199 | int da_read_single_block(libusb_device_handle *handle, uint32_t lba, void *data) { 200 | uint8_t buf[4]; 201 | WRITE_BE32(buf, lba); 202 | int ret = da_send(handle, CMD_EMMC_READ_SINGLE_BLOCK, 4, buf); 203 | if (ret) { 204 | return ret; 205 | } 206 | 207 | uint16_t cmd; 208 | uint16_t data_length; 209 | void *received_data; 210 | ret = da_receive(handle, &cmd, &data_length, &received_data); 211 | if (ret) { 212 | return ret; 213 | } 214 | 215 | if (cmd != CMD_EMMC_READ_SINGLE_BLOCK) { 216 | printf("cmd != CMD_EMMC_READ_SINGLE_BLOCK\n"); 217 | return -1; 218 | } 219 | 220 | if (data_length != EMMC_BLOCK_SIZE) { 221 | printf("data_length != EMMC_BLOCK_SIZE\n"); 222 | return -1; 223 | } 224 | 225 | memcpy(data, received_data, EMMC_BLOCK_SIZE); 226 | return 0; 227 | } -------------------------------------------------------------------------------- /da.h: -------------------------------------------------------------------------------- 1 | #ifndef DA_H 2 | #define DA_H 3 | 4 | #include 5 | #include 6 | 7 | #define EMMC_BLOCK_SIZE 512 8 | 9 | typedef enum { 10 | CMD_STATUS = 0x0000, 11 | CMD_VERSION = 0x0001, 12 | 13 | // EMMC 14 | CMD_EMMC_INIT = 0x0002, 15 | CMD_EMMC_SWITCH = 0x0003, 16 | CMD_EMMC_GET_SEC_COUNT = 0x0004, 17 | CMD_EMMC_READ_SINGLE_BLOCK = 0x0005, 18 | CMD_EMMC_WRITE_BLOCK = 0x0006, 19 | 20 | CMD_EXIT = 0xFFFF, 21 | } da_cmd_t; 22 | 23 | typedef enum { 24 | STATUS_OK = 0x00, 25 | STATUS_ERROR = 0x01, 26 | } da_status_t; 27 | 28 | int da_receive(libusb_device_handle *handle, uint16_t *cmd, uint16_t *data_length, void **data); 29 | int da_receive_status(libusb_device_handle *handle, da_status_t *status); 30 | int da_check_status(libusb_device_handle *handle); 31 | int da_send(libusb_device_handle *handle, uint16_t cmd, uint16_t data_length, const void *data); 32 | 33 | int da_emmc_init(libusb_device_handle *handle); 34 | int da_emmc_switch(libusb_device_handle *handle, uint8_t index, uint8_t value); 35 | int da_get_sec_count(libusb_device_handle *handle, uint32_t *sec_count); 36 | int da_read_single_block(libusb_device_handle *handle, uint32_t lba, void *data); 37 | int da_write_block(libusb_device_handle *handle, uint32_t lba, const void *data); 38 | 39 | #endif //DA_H 40 | -------------------------------------------------------------------------------- /endianness.h: -------------------------------------------------------------------------------- 1 | #ifndef ENDIANNESS_H 2 | #define ENDIANNESS_H 3 | 4 | #define WRITE_BE16(ptr, val) do { \ 5 | ((uint8_t *)(ptr))[0] = (uint8_t)((val) >> 8); \ 6 | ((uint8_t *)(ptr))[1] = (uint8_t)(val); \ 7 | } while (0) 8 | 9 | #define WRITE_BE32(ptr, val) do { \ 10 | ((uint8_t *)(ptr))[0] = (uint8_t)((val) >> 24); \ 11 | ((uint8_t *)(ptr))[1] = (uint8_t)((val) >> 16); \ 12 | ((uint8_t *)(ptr))[2] = (uint8_t)((val) >> 8); \ 13 | ((uint8_t *)(ptr))[3] = (uint8_t)(val); \ 14 | } while (0) 15 | 16 | #define READ_BE16(ptr) \ 17 | (((uint16_t)((const uint8_t *)(ptr))[0] << 8) | \ 18 | ((uint16_t)((const uint8_t *)(ptr))[1])) 19 | 20 | #define READ_BE32(ptr) \ 21 | (((uint32_t)((const uint8_t *)(ptr))[0] << 24) | \ 22 | ((uint32_t)((const uint8_t *)(ptr))[1] << 16) | \ 23 | ((uint32_t)((const uint8_t *)(ptr))[2] << 8) | \ 24 | ((uint32_t)((const uint8_t *)(ptr))[3])) 25 | 26 | #endif //ENDIANNESS_H 27 | -------------------------------------------------------------------------------- /gpt.c: -------------------------------------------------------------------------------- 1 | #include "gpt.h" 2 | -------------------------------------------------------------------------------- /gpt.h: -------------------------------------------------------------------------------- 1 | #ifndef GPT_H 2 | #define GPT_H 3 | 4 | #include 5 | 6 | #define PRIMARY_GPT_HEADER_LBA 1 7 | #define GPT_HEADER_SIGNATURE 0x5452415020494645 8 | 9 | typedef struct { 10 | uint64_t signature; 11 | uint32_t revision; 12 | uint32_t header_size; 13 | uint32_t header_crc32; 14 | uint32_t reserved; 15 | uint64_t my_lba; 16 | uint64_t alternate_lba; 17 | uint64_t first_usable_lba; 18 | uint64_t last_usable_lba; 19 | uint8_t disk_guid[16]; 20 | uint64_t partition_entry_lba; 21 | uint32_t number_of_partition_entries; 22 | uint32_t size_of_partition_entry; 23 | uint32_t partition_entry_array_crc32; 24 | } __attribute__((packed)) gpt_header_t; 25 | 26 | typedef struct { 27 | uint8_t partition_type_guid[16]; 28 | uint8_t unique_partition_guid[16]; 29 | uint64_t starting_lba; 30 | uint64_t ending_lba; 31 | uint64_t attributes; 32 | uint16_t partition_name[36]; 33 | } __attribute__((packed)) gpt_entry_t; 34 | 35 | #endif //GPT_H 36 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include "sprd.h" 11 | #include "da.h" 12 | #include "endianness.h" 13 | #include "gpt.h" 14 | 15 | #define VENDOR_ID 0x1782 16 | #define PRODUCT_ID 0x4d00 17 | #define EP_IN 0x85 // (0x80 | 0x05) 18 | #define EP_OUT 0x06 19 | #define TIMEOUT_MS 1000 20 | 21 | #define FRAME_HEADER_SIZE 4 22 | #define FRAME_MAX_DATA_SIZE 4096 23 | #define FRAME_CRC_SIZE 2 24 | #define FRAME_MAX_SIZE (1 + FRAME_HEADER_SIZE + FRAME_MAX_DATA_SIZE + FRAME_CRC_SIZE + 1) 25 | 26 | #define BSL_CMD_CONNECT 0x00 27 | #define BSL_CMD_START_DATA 0x01 28 | #define BSL_CMD_MIDST_DATA 0x02 29 | #define BSL_CMD_END_DATA 0x03 30 | #define BSL_CMD_EXEC_DATA 0x04 31 | 32 | #define BSL_REP_ACK 0x80 33 | #define BSL_REP_VER 0x81 34 | 35 | #define HDLC_FLAG 0x7e 36 | #define HDLC_ESCAPE 0x7d 37 | #define HDLC_ESCAPE_MASK 0x20 38 | #define HDLC_FRAME_MIN_SIZE 8 39 | 40 | /* 41 | * HDLC frame format: 42 | * 43 | * HDLC_FLAG (1 byte) 44 | * Type (2 bytes) 45 | * Length (2 bytes) 46 | * Data (Length bytes) 47 | * CRC (2 bytes) 48 | * HDLC_FLAG (1 byte) 49 | * 50 | */ 51 | 52 | enum packet_state { 53 | PACKET_STATE_START, 54 | PACKET_STATE_UNESCAPED, 55 | PACKET_STATE_ESCAPED, 56 | PACKET_STATE_END, 57 | }; 58 | 59 | typedef struct { 60 | libusb_device_handle *handle; 61 | uint16_t (*crc)(const uint8_t *buf, size_t len); 62 | uint8_t buffer[FRAME_MAX_SIZE]; 63 | int buffer_length; 64 | } SprdContext; 65 | 66 | static inline uint16_t sprd_get_frame_type(SprdContext *sprd_context) { 67 | return (sprd_context->buffer[0] << 8) | sprd_context->buffer[1]; 68 | } 69 | 70 | static inline uint16_t sprd_get_frame_data_size(SprdContext *sprd_context) { 71 | return (sprd_context->buffer[2] << 8) | sprd_context->buffer[3]; 72 | } 73 | 74 | static inline uint8_t *sprd_get_frame_data(SprdContext *sprd_context) { 75 | return sprd_context->buffer + 4; 76 | } 77 | 78 | #define CRC_16_L_SEED 0x80 79 | #define CRC_16_L_POLYNOMIAL 0x8000 80 | #define CRC_16_POLYNOMIAL 0x1021 81 | static uint16_t sprd_brom_crc(const uint8_t *buf, size_t len) { 82 | uint16_t crc = 0; 83 | 84 | while (len-- != 0) { 85 | for (uint8_t i = CRC_16_L_SEED; i != 0 ; i >>= 1) { 86 | if ((crc & CRC_16_L_POLYNOMIAL) != 0) { 87 | crc <<= 1; 88 | crc ^= CRC_16_POLYNOMIAL; 89 | } else { 90 | crc <<= 1; 91 | } 92 | 93 | if ((*buf & i) != 0) { 94 | crc ^= CRC_16_POLYNOMIAL; 95 | } 96 | } 97 | 98 | buf++; 99 | } 100 | 101 | return crc; 102 | } 103 | 104 | static uint16_t sprd_fdl_crc(const uint8_t *buf, size_t len) { 105 | uint32_t crc = 0; 106 | size_t i; 107 | 108 | for (i = 0; len - i > 1; i += 2) { 109 | crc += buf[i] << 8 | buf[i + 1]; 110 | } 111 | 112 | if (i != len) { 113 | crc += buf[i]; 114 | } 115 | 116 | crc = (crc >> 16) + (crc & 0x0FFFF); 117 | crc += (crc >> 16); 118 | 119 | return ~crc; 120 | } 121 | 122 | static int sprd_send(SprdContext *sprd_context) { 123 | uint8_t buffer[FRAME_MAX_SIZE]; 124 | int buffer_length = 0; 125 | 126 | buffer[buffer_length++] = HDLC_FLAG; 127 | for (int i = 0; i < sprd_context->buffer_length; i++) { 128 | if (buffer_length >= FRAME_MAX_SIZE) { 129 | printf("Payload too long\n"); 130 | return -1; 131 | } 132 | 133 | if (sprd_context->buffer[i] == HDLC_FLAG || sprd_context->buffer[i] == HDLC_ESCAPE) { 134 | buffer[buffer_length++] = HDLC_ESCAPE; 135 | buffer[buffer_length++] = sprd_context->buffer[i] ^ HDLC_ESCAPE_MASK; 136 | } else { 137 | buffer[buffer_length++] = sprd_context->buffer[i]; 138 | } 139 | } 140 | buffer[buffer_length++] = HDLC_FLAG; 141 | 142 | int transferred_total = 0; 143 | do { 144 | int transferred; 145 | int ret = libusb_bulk_transfer( 146 | sprd_context->handle, 147 | EP_OUT, 148 | buffer + transferred_total, 149 | buffer_length - transferred_total, 150 | &transferred, 151 | TIMEOUT_MS 152 | ); 153 | if (ret) { 154 | printf("libusb_bulk_transfer failed: %s\n", libusb_error_name(ret)); 155 | return ret; 156 | } 157 | 158 | transferred_total += transferred; 159 | } while (transferred_total < buffer_length); 160 | 161 | return 0; 162 | } 163 | 164 | static int sprd_receive(SprdContext *sprd_context) { 165 | uint8_t buffer[FRAME_MAX_SIZE]; 166 | 167 | int received = 0; 168 | enum packet_state packet_state = PACKET_STATE_START; 169 | do { 170 | int transferred; 171 | int ret = libusb_bulk_transfer( 172 | sprd_context->handle, 173 | EP_IN, 174 | buffer, 175 | FRAME_MAX_SIZE - received, 176 | &transferred, 177 | TIMEOUT_MS 178 | ); 179 | if (ret) { 180 | printf("libusb_bulk_transfer failed: %s\n", libusb_error_name(ret)); 181 | return ret; 182 | } 183 | 184 | printf("Received %d bytes\n", transferred); 185 | // print bytes as hex 186 | for (int i = 0; i < transferred; i++) { 187 | printf("%02x ", buffer[i]); 188 | } 189 | printf("\n"); 190 | 191 | for (int i = 0; i < transferred; i++) { 192 | if (received == FRAME_MAX_SIZE) { 193 | printf("Buffer too small\n"); 194 | return -1; 195 | } 196 | 197 | if (packet_state == PACKET_STATE_START) { 198 | if (buffer[i] == HDLC_FLAG) { 199 | packet_state = PACKET_STATE_UNESCAPED; 200 | } 201 | } else if (packet_state == PACKET_STATE_ESCAPED) { 202 | sprd_context->buffer[received++] = buffer[i] ^ HDLC_ESCAPE_MASK; 203 | } else { 204 | if (buffer[i] == HDLC_FLAG) { 205 | packet_state = PACKET_STATE_END; 206 | break; 207 | } else if (buffer[i] == HDLC_ESCAPE) { 208 | packet_state = PACKET_STATE_ESCAPED; 209 | } else { 210 | sprd_context->buffer[received++] = buffer[i]; 211 | } 212 | } 213 | } 214 | } while (packet_state != PACKET_STATE_END); 215 | 216 | sprd_context->buffer_length = received; 217 | 218 | uint16_t crc = sprd_context->crc(sprd_context->buffer, received - FRAME_CRC_SIZE); 219 | uint16_t received_crc = (sprd_context->buffer[received - 2] << 8) | sprd_context->buffer[received - 1]; 220 | if (crc != received_crc) { 221 | printf("CRC mismatch (0x%04x != 0x%04x)\n", crc, received_crc); 222 | return -1; 223 | } 224 | 225 | return 0; 226 | } 227 | 228 | static int sprd_send_frame(SprdContext *sprd_context, uint16_t type, uint16_t data_size, uint8_t *data) { 229 | if (data_size > FRAME_MAX_DATA_SIZE) { 230 | printf("Data too long\n"); 231 | return -1; 232 | } 233 | 234 | sprd_context->buffer[0] = (type >> 8) & 0xff; 235 | sprd_context->buffer[1] = type & 0xff; 236 | sprd_context->buffer[2] = (data_size >> 8) & 0xff; 237 | sprd_context->buffer[3] = data_size & 0xff; 238 | memcpy(sprd_context->buffer + 4, data, data_size); 239 | uint16_t crc = sprd_context->crc(sprd_context->buffer, FRAME_HEADER_SIZE + data_size); 240 | sprd_context->buffer[4 + data_size] = (crc >> 8) & 0xff; 241 | sprd_context->buffer[5 + data_size] = crc & 0xff; 242 | sprd_context->buffer_length = FRAME_HEADER_SIZE + data_size + FRAME_CRC_SIZE; 243 | 244 | return sprd_send(sprd_context); 245 | } 246 | 247 | static int sprd_send_and_check_frame(SprdContext *sprd_context, uint16_t type, uint16_t data_size, uint8_t *data) { 248 | int ret; 249 | 250 | ret = sprd_send_frame(sprd_context, type, data_size, data); 251 | if (ret) { 252 | return ret; 253 | } 254 | 255 | ret = sprd_receive(sprd_context); 256 | if (ret) { 257 | return ret; 258 | } 259 | 260 | if (sprd_get_frame_type(sprd_context) != BSL_REP_ACK) { 261 | printf("Unexpected frame type: 0x%04x\n", sprd_get_frame_type(sprd_context)); 262 | return -1; 263 | } 264 | 265 | return 0; 266 | } 267 | 268 | static int sprd_send_usb_hello(SprdContext *sprd_context) { 269 | int ret; 270 | 271 | // Trigger USB endpoint configuration 272 | ret = libusb_control_transfer( 273 | sprd_context->handle, 274 | 0x21, // bmRequestType: Host to device, class, interface 275 | 0, // bRequest: Don't care 276 | 1, // wValue: Bit 0 set 277 | 0, // wIndex: Don't care 278 | NULL, // data: Don't care 279 | 0, // wLength: Don't care 280 | TIMEOUT_MS 281 | ); 282 | if (ret) { 283 | printf("libusb_control_transfer failed: %s\n", libusb_error_name(ret)); 284 | return ret; 285 | } 286 | 287 | // Send HDLC_FLAG as a hello 288 | uint8_t data = HDLC_FLAG; 289 | ret = libusb_bulk_transfer( 290 | sprd_context->handle, 291 | EP_OUT, 292 | &data, 293 | 1, 294 | NULL, 295 | TIMEOUT_MS 296 | ); 297 | if (ret) { 298 | printf("libusb_bulk_transfer failed: %s\n", libusb_error_name(ret)); 299 | return ret; 300 | } 301 | 302 | // Get response 303 | ret = sprd_receive(sprd_context); 304 | if (ret) { 305 | // TODO: Do something about it? 306 | } 307 | 308 | // BSL_REP_VER 309 | if (sprd_get_frame_type(sprd_context) != BSL_REP_VER) { 310 | printf("Unexpected frame type: 0x%04x\n", sprd_get_frame_type(sprd_context)); 311 | return -1; 312 | } 313 | 314 | return 0; 315 | } 316 | 317 | static int sprd_check_connection(SprdContext *sprd_context) { 318 | return sprd_send_and_check_frame(sprd_context, BSL_CMD_CONNECT, 0, NULL); 319 | } 320 | 321 | /* 322 | * Execute a payload using the BootROM, jumps at (load_address + 0x200) 323 | */ 324 | static int sprd_execute_payload(SprdContext *sprd_context, uint32_t load_address, uint8_t *payload, uint32_t payload_size) { 325 | int ret; 326 | uint8_t buffer[8]; 327 | 328 | printf("Sending BSL_CMD_START_DATA...\n"); 329 | 330 | // Send BSL_CMD_START_DATA 331 | buffer[0] = (load_address >> 24) & 0xff; 332 | buffer[1] = (load_address >> 16) & 0xff; 333 | buffer[2] = (load_address >> 8) & 0xff; 334 | buffer[3] = load_address & 0xff; 335 | buffer[4] = (payload_size >> 24) & 0xff; 336 | buffer[5] = (payload_size >> 16) & 0xff; 337 | buffer[6] = (payload_size >> 8) & 0xff; 338 | buffer[7] = payload_size & 0xff; 339 | ret = sprd_send_and_check_frame(sprd_context, BSL_CMD_START_DATA, 8, buffer); 340 | if (ret) { 341 | printf("sprd_send_and_check_frame failed: %d\n", ret); 342 | return ret; 343 | } 344 | 345 | printf("Sending BSL_CMD_MIDST_DATA...\n"); 346 | 347 | // Send BSL_CMD_MIDST_DATA 348 | uint32_t offset = 0; 349 | while (offset < payload_size) { 350 | uint32_t chunk_size = payload_size - offset; 351 | // Worst case, all bytes have to be escaped 352 | if (chunk_size > 528) { 353 | chunk_size = 528; 354 | } 355 | printf("Sending %d bytes...\n", chunk_size); 356 | ret = sprd_send_and_check_frame(sprd_context, BSL_CMD_MIDST_DATA, chunk_size, payload + offset); 357 | if (ret) { 358 | printf("sprd_send_and_check_frame failed: %d\n", ret); 359 | return ret; 360 | } 361 | offset += chunk_size; 362 | } 363 | 364 | printf("Sending BSL_CMD_END_DATA...\n"); 365 | 366 | // Send BSL_CMD_END_DATA 367 | ret = sprd_send_and_check_frame(sprd_context, BSL_CMD_END_DATA, 0, NULL); 368 | if (ret) { 369 | printf("sprd_send_and_check_frame failed: %d\n", ret); 370 | return ret; 371 | } 372 | 373 | printf("Sending BSL_CMD_EXEC_DATA...\n"); 374 | ret = sprd_send_and_check_frame(sprd_context, BSL_CMD_EXEC_DATA, 0, NULL); 375 | if (ret) { 376 | printf("sprd_send_and_check_frame failed: %d\n", ret); 377 | return ret; 378 | } 379 | 380 | return 0; 381 | } 382 | 383 | static int mmap_file(const char *filename, uint8_t **fileptr, ssize_t *filesize) { 384 | int fd; 385 | 386 | fd = open(filename, O_RDONLY); 387 | if (fd < 0) { 388 | printf("open failed: %s\n", filename); 389 | return -1; 390 | } 391 | 392 | struct stat st; 393 | if (fstat(fd, &st) < 0) { 394 | printf("fstat failed: %s\n", filename); 395 | close(fd); 396 | return -1; 397 | } 398 | 399 | *fileptr = mmap(NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0); 400 | if (*fileptr == MAP_FAILED) { 401 | printf("mmap failed: %s\n", filename); 402 | close(fd); 403 | return -1; 404 | } 405 | 406 | *filesize = st.st_size; 407 | return 0; 408 | } 409 | 410 | static int munmap_file(uint8_t *fileptr, ssize_t filesize) { 411 | if (munmap(fileptr, filesize) < 0) { 412 | printf("munmap failed: %p, %ld\n", fileptr, filesize); 413 | return -1; 414 | } 415 | return 0; 416 | } 417 | 418 | static bool is_guid_zero(const uint8_t *guid) { 419 | for (int i = 0; i < 16; i++) { 420 | if (guid[i] != 0) { 421 | return false; 422 | } 423 | } 424 | return true; 425 | } 426 | 427 | static void print_utf16(const uint16_t *buf) { 428 | while (*buf) { 429 | printf("%c", *buf); 430 | buf++; 431 | } 432 | } 433 | 434 | static uint64_t get_time() { 435 | struct timespec ts; 436 | clock_gettime(CLOCK_MONOTONIC, &ts); 437 | return (uint64_t) ts.tv_sec * 1000 + (uint64_t) ts.tv_nsec / 1000000; 438 | } 439 | 440 | static void read_partition_to_file(libusb_device_handle *handle, gpt_entry_t *entry) { 441 | // file name from entry ".img" 442 | char filename[40]; 443 | int filename_length = 0; 444 | for (int i = 0; i < 36; i++) { 445 | if (entry->partition_name[i] == 0) { 446 | break; 447 | } 448 | filename[filename_length++] = (char) entry->partition_name[i]; 449 | } 450 | filename[filename_length++] = '.'; 451 | filename[filename_length++] = 'i'; 452 | filename[filename_length++] = 'm'; 453 | filename[filename_length++] = 'g'; 454 | filename[filename_length] = 0; 455 | 456 | printf("Writing partition to %s...\n", filename); 457 | 458 | int ret; 459 | int fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC, 0644); 460 | if (fd < 0) { 461 | printf("open failed: %s\n", filename); 462 | return; 463 | } 464 | 465 | uint8_t buffer[EMMC_BLOCK_SIZE]; 466 | uint32_t total_blocks = entry->ending_lba - entry->starting_lba + 1; 467 | for (uint32_t i = 0; i < total_blocks; i++) { 468 | uint64_t start_time = get_time(); 469 | ret = da_read_single_block(handle, entry->starting_lba + i, buffer); 470 | if (ret) { 471 | printf("da_read_single_block failed: %d\n", ret); 472 | close(fd); 473 | return; 474 | } 475 | 476 | ssize_t written = write(fd, buffer, EMMC_BLOCK_SIZE); 477 | if (written != EMMC_BLOCK_SIZE) { 478 | printf("write failed: %ld\n", written); 479 | close(fd); 480 | return; 481 | } 482 | uint64_t end_time = get_time(); 483 | 484 | // calculate also mb/s 485 | printf("Read block %u/%u (%u%%) in %lu ms (%.2f MB/s)\n", i + 1, total_blocks, (i + 1) * 100 / total_blocks, end_time - start_time, ((double) EMMC_BLOCK_SIZE / (double) (end_time - start_time)) * 1000 / (1024 * 1024)); 486 | } 487 | 488 | close(fd); 489 | printf("Done\n"); 490 | } 491 | 492 | static int sprd_do_work(SprdContext *sprd_context) { 493 | int ret; 494 | 495 | sprd_context->crc = sprd_brom_crc; 496 | 497 | printf("Sending USB hello...\n"); 498 | ret = sprd_send_usb_hello(sprd_context); 499 | if (ret) { 500 | printf("sprd_send_usb_init failed: %s\n", libusb_error_name(ret)); 501 | return ret; 502 | } 503 | 504 | printf("Received BSL_REP_VER: %.*s\n", sprd_get_frame_data_size(sprd_context), sprd_get_frame_data(sprd_context)); 505 | 506 | ret = sprd_check_connection(sprd_context); 507 | if (ret) { 508 | printf("sprd_check_connection failed: %d\n", ret); 509 | return ret; 510 | } 511 | 512 | printf("Connected to BootROM!\n"); 513 | 514 | // TODO: Everything's set up, now we can start real work! 515 | 516 | printf("Starting fdl1 execution...\n"); 517 | 518 | char *filename = "/home/iscle/Documents/sprd_test/app_with_gap.bin"; 519 | uint8_t *payload; 520 | ssize_t payload_size; 521 | ret = mmap_file(filename, &payload, &payload_size); 522 | if (ret) { 523 | printf("mmap_file failed: %d\n", ret); 524 | return ret; 525 | } 526 | 527 | ret = sprd_execute_payload(sprd_context, 0x00005500, payload, payload_size); 528 | if (ret) { 529 | printf("sprd_execute_payload failed: %d\n", ret); 530 | return ret; 531 | } 532 | 533 | ret = munmap_file(payload, payload_size); 534 | if (ret) { 535 | printf("munmap_file failed: %d\n", ret); 536 | return ret; 537 | } 538 | 539 | uint16_t cmd; 540 | uint16_t data_length; 541 | void *data; 542 | if (da_receive(sprd_context->handle, &cmd, &data_length, &data)) { 543 | printf("da_receive failed\n"); 544 | return -1; 545 | } 546 | 547 | if (cmd != CMD_VERSION) { 548 | printf("Unexpected command: 0x%02x\n", cmd); 549 | return -1; 550 | } 551 | 552 | printf("Received version: %.*s\n", data_length, (char *) data); 553 | 554 | ret = da_emmc_init(sprd_context->handle); 555 | if (ret) { 556 | printf("da_emmc_init failed: %d\n", ret); 557 | return -1; 558 | } 559 | 560 | uint32_t sec_count; 561 | ret = da_get_sec_count(sprd_context->handle, &sec_count); 562 | if (ret) { 563 | printf("da_get_sec_count failed: %d\n", ret); 564 | return -1; 565 | } 566 | 567 | printf("emmc sector count: %u\n", sec_count); 568 | 569 | uint8_t blk_buf[EMMC_BLOCK_SIZE]; 570 | ret = da_read_single_block(sprd_context->handle, 1, blk_buf); 571 | if (ret) { 572 | printf("da_read_single_block failed: %d\n", ret); 573 | return -1; 574 | } 575 | 576 | gpt_header_t gpt_header; 577 | memcpy(&gpt_header, blk_buf, sizeof(gpt_header_t)); 578 | if (gpt_header.signature != GPT_HEADER_SIGNATURE) { 579 | printf("Invalid GPT header signature: 0x%08lx\n", gpt_header.signature); 580 | return -1; 581 | } 582 | 583 | printf("GPT header:\n"); 584 | printf(" Header size: %u\n", gpt_header.header_size); 585 | printf(" MyLBA: %lu\n", gpt_header.my_lba); 586 | printf(" AlternateLBA: %lu\n", gpt_header.alternate_lba); 587 | printf(" FirstUsableLBA: %lu\n", gpt_header.first_usable_lba); 588 | printf(" LastUsableLBA: %lu\n", gpt_header.last_usable_lba); 589 | printf(" PartitionEntryLBA: %lu\n", gpt_header.partition_entry_lba); 590 | printf(" NumberOfPartitionEntries: %u\n", gpt_header.number_of_partition_entries); 591 | printf(" SizeOfPartitionEntry: %u\n", gpt_header.size_of_partition_entry); 592 | 593 | uint32_t partition_entries_per_block = EMMC_BLOCK_SIZE / gpt_header.size_of_partition_entry; 594 | uint32_t partition_entries_blocks = gpt_header.number_of_partition_entries / partition_entries_per_block; 595 | for (uint32_t i = 0; i < partition_entries_blocks; i++) { 596 | uint32_t lba = gpt_header.partition_entry_lba + i; 597 | ret = da_read_single_block(sprd_context->handle, lba, blk_buf); 598 | if (ret) { 599 | printf("da_read_single_block failed: %d\n", ret); 600 | return -1; 601 | } 602 | 603 | gpt_entry_t gpt_entry; 604 | for (uint32_t j = 0; j < partition_entries_per_block; j++) { 605 | memcpy(&gpt_entry, blk_buf + j * gpt_header.size_of_partition_entry, sizeof(gpt_entry_t)); 606 | if (is_guid_zero(gpt_entry.partition_type_guid)) { 607 | continue; 608 | } 609 | 610 | printf("Partition entry %u:\n", i + j); 611 | printf(" StartingLBA: %lu\n", gpt_entry.starting_lba); 612 | printf(" EndingLBA: %lu\n", gpt_entry.ending_lba); 613 | printf(" PartitionName: "); 614 | print_utf16(gpt_entry.partition_name); 615 | printf("\n"); 616 | 617 | read_partition_to_file(sprd_context->handle, &gpt_entry); 618 | } 619 | } 620 | 621 | return 0; 622 | } 623 | 624 | static int check_endpoints(SprdContext *sprd_context) { 625 | int ret; 626 | struct libusb_device_descriptor desc = {}; 627 | struct libusb_config_descriptor *config = NULL; 628 | bool has_config_descriptor = false; 629 | 630 | ret = libusb_get_device_descriptor(libusb_get_device(sprd_context->handle), &desc); 631 | if (ret) { 632 | printf("libusb_get_device_descriptor failed: %s\n", libusb_error_name(ret)); 633 | goto exit; 634 | } 635 | 636 | if (desc.bNumConfigurations != 1) { 637 | printf("Unexpected number of configurations: %d\n", desc.bNumConfigurations); 638 | ret = LIBUSB_ERROR_NO_DEVICE; 639 | goto exit; 640 | } 641 | 642 | ret = libusb_get_config_descriptor(libusb_get_device(sprd_context->handle), 0, &config); 643 | if (ret) { 644 | printf("libusb_get_config_descriptor failed: %s\n", libusb_error_name(ret)); 645 | goto exit; 646 | } 647 | 648 | has_config_descriptor = true; 649 | 650 | if (config->bNumInterfaces != 1) { 651 | printf("Unexpected number of interfaces: %d\n", config->bNumInterfaces); 652 | ret = LIBUSB_ERROR_NO_DEVICE; 653 | goto exit; 654 | } 655 | 656 | if (config->interface->num_altsetting != 1) { 657 | printf("Unexpected number of alternate settings: %d\n", config->interface->num_altsetting); 658 | ret = LIBUSB_ERROR_NO_DEVICE; 659 | goto exit; 660 | } 661 | 662 | if (config->interface->altsetting->bNumEndpoints != 2) { 663 | printf("Unexpected number of endpoints: %d\n", config->interface->altsetting->bNumEndpoints); 664 | ret = LIBUSB_ERROR_NO_DEVICE; 665 | goto exit; 666 | } 667 | 668 | bool found_in = false; 669 | bool found_out = false; 670 | 671 | for (uint8_t i = 0; i < config->interface->altsetting->bNumEndpoints; i++) { 672 | const struct libusb_endpoint_descriptor *endpoint = &config->interface->altsetting->endpoint[i]; 673 | if (endpoint->bEndpointAddress == 0x85) { 674 | found_in = true; 675 | } else if (endpoint->bEndpointAddress == 0x06) { 676 | found_out = true; 677 | } 678 | } 679 | 680 | if (!found_in || !found_out) { 681 | printf("Endpoints not found\n"); 682 | ret = LIBUSB_ERROR_NO_DEVICE; 683 | goto exit; 684 | } 685 | 686 | exit: 687 | if (has_config_descriptor) { 688 | libusb_free_config_descriptor(config); 689 | config = NULL; 690 | has_config_descriptor = false; 691 | } 692 | 693 | return ret; 694 | } 695 | 696 | int main() { 697 | int ret; 698 | SprdContext sprd_context = {0}; 699 | bool is_open = false; 700 | bool interface_claimed = false; 701 | 702 | printf("sprdclient v1.0 by iscle\n"); 703 | 704 | ret = libusb_init(NULL); 705 | if (ret) { 706 | printf("libusb_init failed: %s\n", libusb_error_name(ret)); 707 | goto exit; 708 | } 709 | 710 | printf("Waiting for connection..."); 711 | fflush(stdout); 712 | 713 | do { 714 | sprd_context.handle = libusb_open_device_with_vid_pid(NULL, VENDOR_ID, PRODUCT_ID); 715 | if (sprd_context.handle) { 716 | printf("\n"); 717 | break; 718 | } 719 | printf("."); 720 | fflush(stdout); 721 | sleep(1); 722 | } while (1); 723 | 724 | printf("Connected\n"); 725 | is_open = true; 726 | 727 | ret = check_endpoints(&sprd_context); 728 | if (ret) { 729 | ret = LIBUSB_ERROR_NO_DEVICE; 730 | goto exit; 731 | } 732 | 733 | printf("Endpoints found, claiming interface...\n"); 734 | 735 | ret = libusb_claim_interface(sprd_context.handle, 0); 736 | if (ret) { 737 | printf("libusb_claim_interface failed: %s\n", libusb_error_name(ret)); 738 | goto exit; 739 | } 740 | 741 | printf("Interface claimed\n"); 742 | interface_claimed = true; 743 | 744 | ret = sprd_do_work(&sprd_context); 745 | 746 | exit: 747 | if (interface_claimed) { 748 | libusb_release_interface(sprd_context.handle, 0); 749 | interface_claimed = false; 750 | } 751 | if (is_open) { 752 | libusb_close(sprd_context.handle); 753 | sprd_context.handle = NULL; 754 | libusb_exit(NULL); 755 | is_open = false; 756 | } 757 | 758 | return ret; 759 | } 760 | -------------------------------------------------------------------------------- /sprd.h: -------------------------------------------------------------------------------- 1 | // 2 | // Created by iscle on 2/27/24. 3 | // 4 | 5 | #ifndef SPRDCLIENT_SPRD_H 6 | #define SPRDCLIENT_SPRD_H 7 | 8 | #endif //SPRDCLIENT_SPRD_H 9 | --------------------------------------------------------------------------------