Searched refs:good (Results 1 – 2 of 2) sorted by relevance
217 int good_srcs, good, i; in __2data_recov_5() local220 good = -1; in __2data_recov_5()226 good = i; in __2data_recov_5()235 g = blocks[good]; in __2data_recov_5()236 g_off = offs[good]; in __2data_recov_5()251 raid6_gfexp[good], bytes, submit); in __2data_recov_5()483 int good_srcs, good, i; in async_raid6_datap_recov() local512 good = -1; in async_raid6_datap_recov()517 good = i; in async_raid6_datap_recov()543 struct page *g = blocks[good]; in async_raid6_datap_recov()[all …]
1102 Rijndael appears to be consistently a very good performer in1106 good. Rijndael's very low memory requirements make it very well1148 Rijndael appears to be consistently a very good performer in1152 good. Rijndael's very low memory requirements make it very well1176 Rijndael appears to be consistently a very good performer in1180 good. Rijndael's very low memory requirements make it very well1452 an algorithm optimized for 64-bit processors with good performance