| /freebsd-12-stable/contrib/bmake/lst.lib/ |
| D | lstConcat.c | 102 list2->lastPtr->nextPtr = NULL; in Lst_Concat()
113 list1->lastPtr->nextPtr = list2->firstPtr; in Lst_Concat()
126 list1->lastPtr->nextPtr = list1->firstPtr; in Lst_Concat()
142 list2->lastPtr->nextPtr = NULL; in Lst_Concat()
145 ln = ln->nextPtr) in Lst_Concat()
150 last->nextPtr = nln; in Lst_Concat()
172 list1->lastPtr->nextPtr = list1->firstPtr; in Lst_Concat()
175 last->nextPtr = NULL; in Lst_Concat()
179 list2->lastPtr->nextPtr = list2->firstPtr; in Lst_Concat()
|
| D | lstAppend.c | 101 nLNode->nextPtr = nLNode->prevPtr = nLNode; in Lst_InsertAfter()
103 nLNode->nextPtr = nLNode->prevPtr = NULL; in Lst_InsertAfter()
108 nLNode->nextPtr = lNode->nextPtr; in Lst_InsertAfter()
110 lNode->nextPtr = nLNode; in Lst_InsertAfter()
111 if (nLNode->nextPtr != NULL) { in Lst_InsertAfter()
112 nLNode->nextPtr->prevPtr = nLNode; in Lst_InsertAfter()
|
| D | lstRemove.c | 83 if (lNode->nextPtr != NULL) { in Lst_Remove()
84 lNode->nextPtr->prevPtr = lNode->prevPtr; in Lst_Remove()
87 lNode->prevPtr->nextPtr = lNode->nextPtr; in Lst_Remove()
95 list->firstPtr = lNode->nextPtr; in Lst_Remove()
|
| D | lstInsert.c | 101 nLNode->prevPtr = nLNode->nextPtr = nLNode; in Lst_InsertBefore()
103 nLNode->prevPtr = nLNode->nextPtr = NULL; in Lst_InsertBefore()
108 nLNode->nextPtr = lNode; in Lst_InsertBefore()
111 nLNode->prevPtr->nextPtr = nLNode; in Lst_InsertBefore()
|
| D | lstDestroy.c | 81 list->lastPtr->nextPtr = NULL; in Lst_Destroy()
89 tln = ln->nextPtr; in Lst_Destroy()
95 tln = ln->nextPtr; in Lst_Destroy()
|
| D | lstForEachFrom.c | 92 next = tln->nextPtr; in Lst_ForEachFrom()
112 if (next != tln->nextPtr) { in Lst_ForEachFrom()
113 next = tln->nextPtr; in Lst_ForEachFrom()
|
| D | lstSucc.c | 76 return ln->nextPtr; in Lst_Succ()
|
| D | lstMember.c | 73 lNode = lNode->nextPtr; in Lst_Member()
|
| D | lstFindFrom.c | 85 tln = tln->nextPtr; in Lst_FindFrom()
|
| D | lstInt.h | 49 struct ListNode *nextPtr; /* next in list */ member
|
| D | lstDupl.c | 102 ln = ln->nextPtr; in Lst_Duplicate()
|
| D | lstNext.c | 102 tln = list->curPtr->nextPtr; in Lst_Next()
|
| /freebsd-12-stable/sys/contrib/zstd/lib/compress/ |
| D | zstd_opt.c | 312 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBt1() local
322 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
323 …matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */ in ZSTD_insertBt1()
330 largerPtr = nextPtr; in ZSTD_insertBt1()
331 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
363 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertBt1()
364 …matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to curren… in ZSTD_insertBt1()
370 largerPtr = nextPtr; in ZSTD_insertBt1()
371 matchIndex = nextPtr[0]; in ZSTD_insertBt1()
506 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertBtAndGetAllMatches() local
[all …]
|
| D | zstd_lazy.c | 91 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_insertDUBT1() local
123 matchIndex, btLow, nextPtr[1]); in ZSTD_insertDUBT1()
124 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertDUBT1()
125 …matchIndex = nextPtr[1]; /* new matchIndex, larger than previous and closer to curren… in ZSTD_insertDUBT1()
132 matchIndex, btLow, nextPtr[0]); in ZSTD_insertDUBT1()
133 largerPtr = nextPtr; in ZSTD_insertDUBT1()
134 matchIndex = nextPtr[0]; in ZSTD_insertDUBT1()
220 U32* const nextPtr = bt + 2*(matchIndex & btMask); in ZSTD_DUBT_findBestMatch() local
249 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_DUBT_findBestMatch()
250 …matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) */ in ZSTD_DUBT_findBestMatch()
[all …]
|
| /freebsd-12-stable/contrib/sqlite3/tea/win/ |
| D | nmakehlp.c | 556 struct list_item_t *nextPtr; member
569 itemPtr->nextPtr = NULL; in list_insert()
572 listPtrPtr = &(*listPtrPtr)->nextPtr; in list_insert()
585 listPtr = listPtr->nextPtr; in list_free()
648 for (p = substPtr; p != NULL; p = p->nextPtr, ++n) { in SubstituteFile()
660 for (p = substPtr; p != NULL; p = p->nextPtr) { in SubstituteFile()
|
| /freebsd-12-stable/contrib/expat/lib/ |
| D | xmlparse.c | 458 const char *next, const char **nextPtr,
469 const char **nextPtr, XML_Bool haveMore,
474 const char **nextPtr, XML_Bool haveMore);
2749 const char *s, const char *end, const char **nextPtr, in doContent() argument
2783 *nextPtr = s; in doContent()
2799 *nextPtr = end; in doContent()
2803 *nextPtr = s; in doContent()
2809 *nextPtr = s; in doContent()
2818 *nextPtr = s; in doContent()
2824 *nextPtr = s; in doContent()
[all …]
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/XCore/ |
| D | XCoreISelLowering.cpp | 748 SDValue nextPtr = DAG.getNode(ISD::ADD, dl, PtrVT, VAList, in LowerVAARG() local
752 InChain = DAG.getStore(VAList.getValue(1), dl, nextPtr, VAListPtr, in LowerVAARG()
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| D | PPCISelLowering.cpp | 3794 SDValue nextPtr = DAG.getNode(ISD::ADD, dl, PtrVT, Op.getOperand(1), in LowerVASTART() local
3799 DAG.getTruncStore(firstStore, dl, ArgFPR, nextPtr, in LowerVASTART()
3802 nextPtr = DAG.getNode(ISD::ADD, dl, PtrVT, nextPtr, ConstStackOffset); in LowerVASTART()
3805 SDValue thirdStore = DAG.getStore(secondStore, dl, StackOffsetFI, nextPtr, in LowerVASTART()
3808 nextPtr = DAG.getNode(ISD::ADD, dl, PtrVT, nextPtr, ConstFrameOffset); in LowerVASTART()
3811 return DAG.getStore(thirdStore, dl, FR, nextPtr, in LowerVASTART()
|