| | 1 | // -*- mode: c++; c-basic-offset: 4 -*- |
| | 2 | /* |
| | 3 | * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. |
| | 4 | * |
| | 5 | * Redistribution and use in source and binary forms, with or without |
| | 6 | * modification, are permitted provided that the following conditions |
| | 7 | * are met: |
| | 8 | * 1. Redistributions of source code must retain the above copyright |
| | 9 | * notice, this list of conditions and the following disclaimer. |
| | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
| | 11 | * notice, this list of conditions and the following disclaimer in the |
| | 12 | * documentation and/or other materials provided with the distribution. |
| | 13 | * |
| | 14 | * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
| | 15 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| | 16 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| | 17 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
| | 18 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| | 19 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| | 20 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| | 21 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| | 22 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| | 23 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| | 24 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| | 25 | */ |
| | 26 | |
| | 27 | #include "NodeList.h" |
| | 28 | |
| | 29 | #include <stdlib.h> |
| | 30 | |
| | 31 | extern NodeList* NodeList_new(Node* parentNode) |
| | 32 | { |
| | 33 | Node_ref(parentNode); |
| | 34 | |
| | 35 | NodeList* nodeList = (NodeList*)malloc(sizeof(NodeList)); |
| | 36 | nodeList->parentNode = parentNode; |
| | 37 | nodeList->refCount = 0; |
| | 38 | return nodeList; |
| | 39 | } |
| | 40 | |
| | 41 | extern unsigned NodeList_length(NodeList* nodeList) |
| | 42 | { |
| | 43 | // Linear count from tail -- good enough for our purposes here |
| | 44 | unsigned i = 0; |
| | 45 | NodeLink* n = nodeList->parentNode->childNodesTail; |
| | 46 | while (n) { |
| | 47 | n = n->prev; |
| | 48 | ++i; |
| | 49 | } |
| | 50 | |
| | 51 | return i; |
| | 52 | } |
| | 53 | |
| | 54 | extern Node* NodeList_item(NodeList* nodeList, unsigned index) |
| | 55 | { |
| | 56 | unsigned length = NodeList_length(nodeList); |
| | 57 | if (index >= length) |
| | 58 | return NULL; |
| | 59 | |
| | 60 | // Linear search from tail -- good enough for our purposes here |
| | 61 | NodeLink* n = nodeList->parentNode->childNodesTail; |
| | 62 | unsigned i = 0; |
| | 63 | unsigned count = length - 1 - index; |
| | 64 | while (i < count) { |
| | 65 | ++i; |
| | 66 | n = n->prev; |
| | 67 | } |
| | 68 | return n->node; |
| | 69 | } |
| | 70 | |
| | 71 | extern void NodeList_ref(NodeList* nodeList) |
| | 72 | { |
| | 73 | ++nodeList->refCount; |
| | 74 | } |
| | 75 | |
| | 76 | extern void NodeList_deref(NodeList* nodeList) |
| | 77 | { |
| | 78 | if (--nodeList->refCount == 0) { |
| | 79 | Node_deref(nodeList->parentNode); |
| | 80 | free(nodeList); |
| | 81 | } |
| | 82 | } |
projects / apple / javascriptcore.git / blame_incremental