Searched refs:insn_queue (Results 1 - 3 of 3) sorted by relevance
/haiku-buildtools/gcc/gcc/ |
H A D | haifa-sched.c | 321 The "Queued" set (Q) is implemented by the variable `insn_queue'. 340 static rtx_insn_list **insn_queue; 2885 rtx_insn_list *link = alloc_INSN_LIST (insn, insn_queue[next_q]); 2891 insn_queue[next_q] = link; 2925 remove_free_INSN_LIST_elem (insn, &insn_queue[QUEUE_INDEX (insn)]); 3331 for (link = insn_queue[q]; link; link = link->next ()) 4339 rtx_insn_list **insn_queue; 4390 save->insn_queue = XNEWVEC (rtx_insn_list *, max_insn_queue_index + 1); 4395 save->insn_queue[i] = copy_INSN_LIST (insn_queue[ 339 static rtx_insn_list **insn_queue; variable 4324 rtx_insn_list **insn_queue; member in struct:haifa_saved_data [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | sched.c | 269 The "Queued" set (Q) is implemented by the variable `insn_queue'. 288 static rtx insn_queue[INSN_QUEUE_SIZE]; 1921 NEXT_INSN (insn) = insn_queue[next_q]; 1922 insn_queue[next_q] = insn; 3147 bzero ((char *) insn_queue, sizeof (insn_queue)); 3166 for (insn = insn_queue[q_ptr]; insn; insn = NEXT_INSN (insn)) 3174 insn_queue[q_ptr] = 0; 3183 if ((insn = insn_queue[NEXT_Q_AFTER (q_ptr, stalls)])) 3193 insn_queue[NEXT_Q_AFTE 287 static rtx insn_queue[INSN_QUEUE_SIZE]; variable [all...] |
H A D | haifa-sched.c | 383 The "Queued" set (Q) is implemented by the variable `insn_queue'. 402 static rtx insn_queue[INSN_QUEUE_SIZE]; 4264 rtx link = alloc_INSN_LIST (insn, insn_queue[next_q]); 4265 insn_queue[next_q] = link; 5618 for (link = insn_queue[q_ptr]; link; link = XEXP (link, 1)) 5634 insn_queue[q_ptr] = 0; 5644 if ((link = insn_queue[NEXT_Q_AFTER (q_ptr, stalls)])) 5661 insn_queue[NEXT_Q_AFTER (q_ptr, stalls)] = 0; 6886 bzero ((char *) insn_queue, sizeof (insn_queue)); 401 static rtx insn_queue[INSN_QUEUE_SIZE]; variable [all...] |
Completed in 130 milliseconds