continue;\r
}\r
\r
- qsort(keylist, keycount, sizeof(*keylist), compare_uint64);\r
- keycount = intersection(last_keylist, keylist);\r
- if (keycount == 0) {\r
- free(last_keylist);\r
- last_keylist = keylist;\r
- continue;\r
+ if (par_list == 0) {\r
+ qsort(keylist, keycount, sizeof(*keylist), compare_uint64);\r
+ keycount = intersection(last_keylist, keylist);\r
+ if (keycount == 0) {\r
+ free(last_keylist);\r
+ last_keylist = keylist;\r
+ continue;\r
+ }\r
}\r
\r
if (keycount > 1) {\r
for (int i = 0; i < keycount; i += max_keys) {\r
int size = keycount - i > max_keys ? max_keys : keycount - i;\r
for (int j = 0; j < size; j++) {\r
- if (last_keylist == NULL) {\r
- num_to_bytes(keylist[i*max_keys + j], 6, keyBlock);\r
- } else {\r
+ if (par_list == 0) {\r
num_to_bytes(last_keylist[i*max_keys + j], 6, keyBlock);\r
+ } else {\r
+ num_to_bytes(keylist[i*max_keys + j], 6, keyBlock);\r
}\r
}\r
if (!mfCheckKeys(0, 0, false, size, keyBlock, key)) {\r
\r
\r
// wrapper function for multi-threaded lfsr_recovery32\r
-void* nested_worker_thread(void *arg)\r
+void\r
+#ifdef __has_attribute\r
+#if __has_attribute(force_align_arg_pointer)\r
+__attribute__((force_align_arg_pointer)) \r
+#endif\r
+#endif\r
+*nested_worker_thread(void *arg)\r
{\r
struct Crypto1State *p1;\r
StateList_t *statelist = arg;\r
return statelist->head.slhead;\r
}\r
\r
+\r
int mfnested(uint8_t blockNo, uint8_t keyType, uint8_t *key, uint8_t trgBlockNo, uint8_t trgKeyType, uint8_t *resultKey, bool calibrate)\r
{\r
uint16_t i;\r