Searched refs:new_head (Results 1 – 8 of 8) sorted by relevance
252 void LinkedSet::UpdateHead(PacketIdentifierNode* new_head) { in UpdateHead() argument253 list_.push_front(new_head); in UpdateHead()254 map_[new_head->sequence_number] = list_.begin(); in UpdateHead()
105 void UpdateHead(PacketIdentifierNode* new_head);
247 new_head = marshal.loads(data)249 self.assertEqual(len(new_head), len(head))250 self.assertEqual(len(new_head[0]), len(head[0]))251 self.assertEqual(len(new_head[-1]), len(head[-1]))
212 new_head = marshal.loads(data)214 self.assertEqual(len(new_head), len(head))215 self.assertEqual(len(new_head[0]), len(head[0]))216 self.assertEqual(len(new_head[-1]), len(head[-1]))
273 BranchCondition* new_head = new (zone->New(sizeof(BranchCondition))) in AddCondition() local278 ControlPathConditions(new_head, condition_count_ + 1); in AddCondition()
480 inline void truncate (void *new_head) in truncate()482 assert (this->start < new_head && new_head <= this->head); in truncate()483 this->head = (char *) new_head; in truncate()
673 PartitionFreelistEntry* new_head = in PartitionBucketAlloc() local675 page->freelist_head = new_head; in PartitionBucketAlloc()
840 PartitionFreelistEntry* new_head = PartitionFreelistMask(entry->next); in PartitionAllocSlowPath() local841 new_page->freelist_head = new_head; in PartitionAllocSlowPath()