Searched refs:WidthFactor (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/clang/lib/Rewrite/ |
| H A D | RewriteRope.cpp | 84 enum { WidthFactor = 8 }; enumerator
141 RopePiece Pieces[2*WidthFactor];
157 bool isFull() const { return NumPieces == 2*WidthFactor; } in isFull()
312 std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor], in insert()
315 std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece()); in insert()
318 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
400 RopePieceBTreeNode *Children[2*WidthFactor];
418 bool isFull() const { return NumChildren == 2*WidthFactor; } in isFull()
551 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
552 WidthFactor*sizeof(Children[0])); in HandleChildPiece()
[all …]
|
| H A D | DeltaTree.cpp | 69 enum { WidthFactor = 8 }; enumerator
72 SourceDelta Values[2*WidthFactor-1];
91 bool isFull() const { return NumValuesUsed == 2*WidthFactor-1; } in isFull()
126 DeltaTreeNode *Children[2*WidthFactor];
312 memcpy(&New->Children[0], &IN->Children[WidthFactor], in DoSplit()
313 WidthFactor*sizeof(IN->Children[0])); in DoSplit()
321 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
322 (WidthFactor-1)*sizeof(Values[0])); in DoSplit()
325 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
333 InsertRes.Split = Values[WidthFactor-1]; in DoSplit()
|