Searched refs:ACP_HASH_SIZE (Results 1 - 2 of 2) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/intel/compiler/
H A Dbrw_fs_copy_propagation.cpp35 #define ACP_HASH_SIZE 64 macro
99 exec_list *out_acp[ACP_HASH_SIZE]);
120 exec_list *out_acp[ACP_HASH_SIZE])
127 for (int i = 0; i < ACP_HASH_SIZE; i++) {
144 for (int i = 0; i < ACP_HASH_SIZE; i++) {
187 * approach even if we use a table of size ACP_HASH_SIZE though a
191 acp_table_size = MAX2(acp_table_size, ACP_HASH_SIZE);
979 foreach_in_list(acp_entry, entry, &acp[inst->src[i].nr % ACP_HASH_SIZE]) {
989 foreach_in_list_safe(acp_entry, entry, &acp[inst->dst.nr % ACP_HASH_SIZE]) {
998 for (int i = 0; i < ACP_HASH_SIZE;
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
H A Dbrw_fs_copy_propagation.cpp35 #define ACP_HASH_SIZE 16 macro
96 exec_list *out_acp[ACP_HASH_SIZE]);
117 exec_list *out_acp[ACP_HASH_SIZE])
124 for (int i = 0; i < ACP_HASH_SIZE; i++) {
141 for (int i = 0; i < ACP_HASH_SIZE; i++) {
799 foreach_in_list(acp_entry, entry, &acp[inst->src[i].nr % ACP_HASH_SIZE]) {
809 foreach_in_list_safe(acp_entry, entry, &acp[inst->dst.nr % ACP_HASH_SIZE]) {
818 for (int i = 0; i < ACP_HASH_SIZE; i++) {
841 acp[entry->dst.nr % ACP_HASH_SIZE].push_tail(entry);
858 acp[entry->dst.nr % ACP_HASH_SIZE]
[all...]

Completed in 4 milliseconds