111 lines
3.1 KiB
C
111 lines
3.1 KiB
C
/*
|
|
* This file is part of the PikaScript project.
|
|
* http://github.com/pikastech/pikascript
|
|
*
|
|
* MIT License
|
|
*
|
|
* Copyright (c) 2021 lyon 李昂 liang6516@outlook.com
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*/
|
|
|
|
#include "dataLink.h"
|
|
#include "dataArg.h"
|
|
#include "dataLinkNode.h"
|
|
#include "dataMemory.h"
|
|
|
|
void link_deinit(Link* self) {
|
|
LinkNode* nowNode = self->firstNode;
|
|
while (NULL != nowNode) {
|
|
LinkNode* nodeNext = content_getNext(nowNode);
|
|
linkNode_deinit(nowNode);
|
|
nowNode = nodeNext;
|
|
}
|
|
// DynMemPut(self->mem);
|
|
pikaFree(self, sizeof(Link));
|
|
self = NULL;
|
|
}
|
|
|
|
void link_addNode(Link* self, void* content) {
|
|
// old first node become new second node
|
|
LinkNode* secondNode = self->firstNode;
|
|
|
|
self->firstNode = content;
|
|
// change the first node to new node
|
|
content_setNext(content, secondNode);
|
|
}
|
|
|
|
void link_removeNode(Link* self, void* content) {
|
|
LinkNode* nodeToDelete = NULL;
|
|
LinkNode* nodeNow = self->firstNode;
|
|
LinkNode* priorNode = NULL;
|
|
LinkNode* nextNode;
|
|
while (1) {
|
|
if (nodeNow == content) {
|
|
nodeToDelete = nodeNow;
|
|
break;
|
|
}
|
|
if (nodeNow == NULL) {
|
|
// error, node no found
|
|
goto exit;
|
|
}
|
|
priorNode = nodeNow;
|
|
nodeNow = content_getNext(nodeNow);
|
|
}
|
|
|
|
nextNode = content_getNext(nodeToDelete);
|
|
if (nodeToDelete == self->firstNode) {
|
|
self->firstNode = content_getNext(nodeToDelete);
|
|
}
|
|
|
|
if (NULL == priorNode) {
|
|
self->firstNode = nextNode;
|
|
goto exit;
|
|
}
|
|
|
|
content_setNext(priorNode, nextNode);
|
|
goto exit;
|
|
|
|
// deinit the node
|
|
exit:
|
|
linkNode_deinit(nodeToDelete);
|
|
return;
|
|
}
|
|
|
|
int32_t link_getSize(Link* self) {
|
|
LinkNode* NowNode;
|
|
int32_t size = 0;
|
|
NowNode = self->firstNode;
|
|
while (NULL != NowNode) {
|
|
size++;
|
|
NowNode = content_getNext(NowNode);
|
|
}
|
|
return size;
|
|
}
|
|
|
|
void link_init(Link* self, void* args) {
|
|
self->firstNode = NULL;
|
|
}
|
|
|
|
Link* New_link(void* args) {
|
|
Link* self = pikaMalloc(sizeof(Link));
|
|
link_init(self, args);
|
|
return self;
|
|
}
|