Lines Matching refs:Head
120 MachineOperand *const Head = HeadRef;
122 // Head points to the first list element.
124 // Prev pointers are circular, so Head->Prev == Last.
126 // Head is NULL for an empty list.
127 if (!Head) {
133 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
135 // Insert MO between Last and Head in the circular Prev chain.
136 MachineOperand *Last = Head->Contents.Reg.Prev;
139 Head->Contents.Reg.Prev = MO;
146 MO->Contents.Reg.Next = Head;
159 MachineOperand *const Head = HeadRef;
160 assert(Head && "List already empty");
166 // Prev links are circular, next link is NULL instead of looping back to Head.
167 if (MO == Head)
172 (Next ? Next : Head)->Contents.Reg.Prev = Prev;
204 MachineOperand *&Head = getRegUseDefListHead(Src->getReg());
207 assert(Head && "List empty, but operand is chained");
211 // Head.
212 if (Src == Head)
213 Head = Dst;
218 // in a 1-element list. In that case Head == Dst.
219 (Next ? Next : Head)->Contents.Reg.Prev = Dst;
