Searched refs:WidthFactor (Results 1 – 2 of 2) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | RewriteRope.cpp | 83 enum { WidthFactor = 8 }; enumerator
140 RopePiece Pieces[2 * WidthFactor];
156 bool isFull() const { return NumPieces == 2 * WidthFactor; } in isFull()
309 std::copy(&Pieces[WidthFactor], &Pieces[2 * WidthFactor], in insert()
312 std::fill(&Pieces[WidthFactor], &Pieces[2 * WidthFactor], RopePiece()); in insert()
315 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
398 RopePieceBTreeNode *Children[2 * WidthFactor];
416 bool isFull() const { return NumChildren == 2 * WidthFactor; } in isFull()
547 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
548 WidthFactor * sizeof(Children[0])); in HandleChildPiece()
[all …]
|
| H A D | DeltaTree.cpp | 68 enum { WidthFactor = 8 }; enumerator
71 SourceDelta Values[2 * WidthFactor - 1];
90 bool isFull() const { return NumValuesUsed == 2 * WidthFactor - 1; } in isFull()
124 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()
|