Lines Matching defs:Head
176 MachineOperand *const Head = HeadRef;
178 // Head points to the first list element.
180 // Prev pointers are circular, so Head->Prev == Last.
182 // Head is NULL for an empty list.
183 if (!Head) {
189 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!");
191 // Insert MO between Last and Head in the circular Prev chain.
192 MachineOperand *Last = Head->Contents.Reg.Prev;
195 Head->Contents.Reg.Prev = MO;
202 MO->Contents.Reg.Next = Head;
215 MachineOperand *const Head = HeadRef;
216 assert(Head && "List already empty");
222 // Prev links are circular, next link is NULL instead of looping back to Head.
223 if (MO == Head)
228 (Next ? Next : Head)->Contents.Reg.Prev = Prev;
260 MachineOperand *&Head = getRegUseDefListHead(Src->getReg());
263 assert(Head && "List empty, but operand is chained");
267 // Head.
268 if (Src == Head)
269 Head = Dst;
274 // in a 1-element list. In that case Head == Dst.
275 (Next ? Next : Head)->Contents.Reg.Prev = Dst;