We're using now Ingo's new doubly linked list implementation.

git-svn-id: file:///srv/svn/repos/haiku/trunk/current@11557 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler 2005-03-03 06:15:16 +00:00
parent 8be9e1dbae
commit cc8aae32ee

View File

@ -1,7 +1,7 @@
/* /*
** Copyright 2003-2004, Axel Dörfler, axeld@pinc-software.de. All rights reserved. * Copyright 2003-2005, Axel Dörfler, axeld@pinc-software.de. All rights reserved.
** Distributed under the terms of the OpenBeOS License. * Distributed under the terms of the MIT License.
*/ */
#include "Handle.h" #include "Handle.h"
@ -132,7 +132,7 @@ status_t
platform_get_boot_partition(struct stage2_args *args, Node *device, platform_get_boot_partition(struct stage2_args *args, Node *device,
NodeList *list, boot::Partition **_partition) NodeList *list, boot::Partition **_partition)
{ {
NodeIterator iterator = list->Iterator(); NodeIterator iterator = list->GetIterator();
boot::Partition *partition = NULL; boot::Partition *partition = NULL;
while ((partition = (boot::Partition *)iterator.Next()) != NULL) { while ((partition = (boot::Partition *)iterator.Next()) != NULL) {
// ToDo: just take the first partition for now // ToDo: just take the first partition for now