equal
deleted
inserted
replaced
1290 |
1290 |
1291 // The last entry is the null entry. |
1291 // The last entry is the null entry. |
1292 const size_t length = Flag::numFlags - 1; |
1292 const size_t length = Flag::numFlags - 1; |
1293 |
1293 |
1294 // Sort |
1294 // Sort |
1295 Flag** array = NEW_C_HEAP_ARRAY(Flag*, length, mtInternal); |
1295 Flag** array = NEW_C_HEAP_ARRAY(Flag*, length, mtArguments); |
1296 for (size_t i = 0; i < length; i++) { |
1296 for (size_t i = 0; i < length; i++) { |
1297 array[i] = &flagTable[i]; |
1297 array[i] = &flagTable[i]; |
1298 } |
1298 } |
1299 qsort(array, length, sizeof(Flag*), compare_flags); |
1299 qsort(array, length, sizeof(Flag*), compare_flags); |
1300 |
1300 |
1324 |
1324 |
1325 // The last entry is the null entry. |
1325 // The last entry is the null entry. |
1326 const size_t length = Flag::numFlags - 1; |
1326 const size_t length = Flag::numFlags - 1; |
1327 |
1327 |
1328 // Sort |
1328 // Sort |
1329 Flag** array = NEW_C_HEAP_ARRAY(Flag*, length, mtInternal); |
1329 Flag** array = NEW_C_HEAP_ARRAY(Flag*, length, mtArguments); |
1330 for (size_t i = 0; i < length; i++) { |
1330 for (size_t i = 0; i < length; i++) { |
1331 array[i] = &flagTable[i]; |
1331 array[i] = &flagTable[i]; |
1332 } |
1332 } |
1333 qsort(array, length, sizeof(Flag*), compare_flags); |
1333 qsort(array, length, sizeof(Flag*), compare_flags); |
1334 |
1334 |