mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2025-08-21 05:43:48 -07:00
Merge branch 'master' of https://github.com/RfidResearchGroup/proxmark3
This commit is contained in:
commit
37423ed2ad
18 changed files with 1562 additions and 1562 deletions
|
@ -294,7 +294,7 @@ void RunMod() {
|
|||
Dbprintf("[+] Printing mf keys");
|
||||
for (uint8_t keycnt = 0; keycnt < mfKeysCnt; keycnt++)
|
||||
Dbprintf("[-] chk mf key[%2d] %02x%02x%02x%02x%02x%02x", keycnt,
|
||||
(keyBlock + 6*keycnt)[0],(keyBlock + 6*keycnt)[1], (keyBlock + 6*keycnt)[2],
|
||||
(keyBlock + 6*keycnt)[0], (keyBlock + 6*keycnt)[1], (keyBlock + 6*keycnt)[2],
|
||||
(keyBlock + 6*keycnt)[3], (keyBlock + 6*keycnt)[4], (keyBlock + 6*keycnt)[5], 6);
|
||||
DbpString("--------------------------------------------------------");
|
||||
}
|
||||
|
|
|
@ -1163,7 +1163,7 @@ local uInt longest_match(s, cur_match)
|
|||
register Bytef *match; /* matched string */
|
||||
register int len; /* length of current match */
|
||||
#ifdef ZLIB_PM3_TUNED
|
||||
int best_len = MIN_MATCH-1; // lift the restriction on prev-length
|
||||
int best_len = MIN_MATCH-1; /* lift the restriction on prev-length */
|
||||
#else
|
||||
int best_len = s->prev_length; /* best match length so far */
|
||||
#endif
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue