Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:value_array (Results 1 - 10 of 10) sorted by null

/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/darwin-x86/mips/mipsel-linux-android-4.6/lib/gcc/mipsel-linux-android/4.6/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/darwin-x86/x86/i686-linux-android-4.6/lib/gcc/i686-linux-android/4.6/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/lib/gcc/i686-linux/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/lib/gcc/x86_64-linux/4.6.x-google/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/mips/mipsel-linux-android-4.6/lib/gcc/mipsel-linux-android/4.6/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]
/prebuilts/gcc/linux-x86/x86/i686-linux-android-4.6/lib/gcc/i686-linux-android/4.6/gcov-src/
libgcov.c	442 /* Sort N entries in VALUE_ARRAY in descending order. 443 Each entry in VALUE_ARRAY has two values. The sorting 447 gcov_sort_n_vals (gcov_type *value_array, int n) 453 cur_ent[0] = value_array[j]; 454 cur_ent[1] = value_array[j + 1]; 456 while (k >= 0 && value_array[k + 1] < cur_ent[1]) 458 value_array[k + 2] = value_array[k]; 459 value_array[k + 3] = value_array[k+1] 482 gcov_type *value_array = &values[i + 1]; local 1342 gcov_type *value_array = &counters[i + 1]; local 1550 gcov_type *value_array = &counters[1]; local     [all...]

Completed in 6613 milliseconds