NetBSD Cross-Reference & Source Code Search Engine

Home	Sort by: relevance \| last modified time \| path

Full Search

in project(s):

Definition

Symbol

File Path

History

| | Help

Searched refs:convert_table (Results 1 - 8 of 8) sorted by relevancy

/src/external/gpl3/gcc/dist/libgcc/config/libbid/
bid128_div.c	`32 extern UINT32 convert_table[5][128][2]; 270 tdigit[0] += convert_table[j][k][0]; 271 tdigit[1] += convert_table[j][k][1]; 328 tdigit[0] += convert_table[j][k][0]; 329 tdigit[1] += convert_table[j][k][1]; 733 tdigit[0] += convert_table[j][k][0]; 734 tdigit[1] += convert_table[j][k][1]; 792 tdigit[0] += convert_table[j][k][0]; 793 tdigit[1] += convert_table[j][k][1]; 1187 tdigit[0] += convert_table[j][k][0] [all...]`
bid64_div.c	`64 extern UINT32 convert_table[5][128][2]; 378 tdigit[0] += convert_table[j][k][0]; 379 tdigit[1] += convert_table[j][k][1]; 769 tdigit[0] += convert_table[j][k][0]; 770 tdigit[1] += convert_table[j][k][1]; 1197 tdigit[0] += convert_table[j][k][0]; 1198 tdigit[1] += convert_table[j][k][1]; 1364 extern UINT32 convert_table[5][128][2]; 1631 tdigit[0] += convert_table[j][k][0]; 1632 tdigit[1] += convert_table[j][k][1] [all...]`
bid_convert_data.c	`26 // convert_table[j][k][i] = digit i (base 10^8) of k2^(26+7j) 27 const UINT32 convert_table[5][128][2] = { variable 814 // for j>=min_j[i+1], there is k s.t. convert_table[i][j][k]>0`
bid_conf.h	`101 #define convert_table __bid_convert_table macro`
/src/external/gpl3/gcc.old/dist/libgcc/config/libbid/
bid128_div.c	`32 extern UINT32 convert_table[5][128][2]; 270 tdigit[0] += convert_table[j][k][0]; 271 tdigit[1] += convert_table[j][k][1]; 328 tdigit[0] += convert_table[j][k][0]; 329 tdigit[1] += convert_table[j][k][1]; 733 tdigit[0] += convert_table[j][k][0]; 734 tdigit[1] += convert_table[j][k][1]; 792 tdigit[0] += convert_table[j][k][0]; 793 tdigit[1] += convert_table[j][k][1]; 1187 tdigit[0] += convert_table[j][k][0] [all...]`
bid64_div.c	`64 extern UINT32 convert_table[5][128][2]; 378 tdigit[0] += convert_table[j][k][0]; 379 tdigit[1] += convert_table[j][k][1]; 769 tdigit[0] += convert_table[j][k][0]; 770 tdigit[1] += convert_table[j][k][1]; 1197 tdigit[0] += convert_table[j][k][0]; 1198 tdigit[1] += convert_table[j][k][1]; 1364 extern UINT32 convert_table[5][128][2]; 1631 tdigit[0] += convert_table[j][k][0]; 1632 tdigit[1] += convert_table[j][k][1] [all...]`
bid_convert_data.c	`26 // convert_table[j][k][i] = digit i (base 10^8) of k2^(26+7j) 27 const UINT32 convert_table[5][128][2] = { variable 814 // for j>=min_j[i+1], there is k s.t. convert_table[i][j][k]>0`
bid_conf.h	`101 #define convert_table __bid_convert_table macro`

Completed in 24 milliseconds