Lines Matching defs:pNode

31     DhcpOptionNode *pNode = (DhcpOptionNode *)calloc(1, sizeof(DhcpOptionNode));
32 if (pNode == nullptr) {
36 pNode->option.code = opt->code;
37 pNode->option.length = opt->length;
38 if (memcpy_s(pNode->option.data, sizeof(pNode->option.data), opt->data, opt->length) != EOK) {
40 free(pNode);
41 pNode = nullptr;
44 pNode->previous = pNode->next = 0;
45 return pNode;
71 DhcpOptionNode *pNode = (DhcpOptionNode *)calloc(1, sizeof(DhcpOptionNode));
72 if (!pNode) {
78 pOptions->first = pOptions->last = pNode;
99 DhcpOptionNode *pNode = CreateOptionNode(pOption);
100 if (!pNode) {
104 pNode->previous = pOptions->last;
105 pOptions->last->next = pNode;
106 pOptions->last = pNode;
122 PDhcpOptionNode pNode = CreateOptionNode(pOption);
123 if (!pNode) {
128 pNode->previous = pOptions->first;
129 pOptions->first->next = pNode;
130 pOptions->last = pNode;
132 pNode->next = pOptions->first->next;
133 pNode->next->previous = pNode;
134 pNode->previous = pOptions->first;
135 pOptions->first->next = pNode;
150 DhcpOptionNode *pNode = GetOptionNode(pOptions, code);
151 if (pNode == nullptr) {
154 if (pNode == pOptions->last) {
155 pOptions->last = pNode->previous;
158 pNode->next->previous = pNode->previous;
159 pNode->previous->next = pNode->next;
162 free(pNode);
163 pNode = nullptr;
172 PDhcpOptionNode pNode = pOptions->first->next;
173 while (pNode != nullptr && pNode->option.code != code) {
174 pNode = pNode->next;
176 return pNode;
181 PDhcpOptionNode pNode = GetOptionNode(pOptions, code);
182 if (pNode) {
183 return &pNode->option;
193 DhcpOptionNode *pNode = pOptions->first->next;
194 while (pNode != nullptr) {
195 if (pNode == pOptions->last) {
199 pNode->next->previous = pNode->previous;
200 pNode->previous->next = pNode->next;
202 free(pNode);
203 pNode = pOptions->first->next;
205 pNode = pOptions->first;
207 pOptions->first = pOptions->last = pNode;
220 DhcpOptionNode *pNode = pOptions->first->next;
221 while (pNode != nullptr) {
222 if (pNode == pOptions->last) {
226 pNode->next->previous = pNode->previous;
227 pNode->previous->next = pNode->next;
229 free(pNode);
230 pNode = pOptions->first->next;