Searched refs:WidthFactor (Results 1 – 2 of 2) sorted by relevance
| /external/clang/lib/Rewrite/ |
| D | RewriteRope.cpp | 81 enum { WidthFactor = 8 }; enumerator
142 RopePiece Pieces[2*WidthFactor];
156 bool isFull() const { return NumPieces == 2*WidthFactor; } in isFull()
311 std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor], in insert()
314 std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece()); in insert()
317 NewNode->NumPieces = NumPieces = WidthFactor; in insert()
395 RopePieceBTreeNode *Children[2*WidthFactor];
412 bool isFull() const { return NumChildren == 2*WidthFactor; } in isFull()
544 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece()
545 WidthFactor*sizeof(Children[0])); in HandleChildPiece()
[all …]
|
| D | DeltaTree.cpp | 67 enum { WidthFactor = 8 }; enumerator
71 SourceDelta Values[2*WidthFactor-1];
90 bool isFull() const { return NumValuesUsed == 2*WidthFactor-1; } in isFull()
123 DeltaTreeNode *Children[2*WidthFactor];
307 memcpy(&New->Children[0], &IN->Children[WidthFactor], in DoSplit()
308 WidthFactor*sizeof(IN->Children[0])); in DoSplit()
316 memcpy(&NewNode->Values[0], &Values[WidthFactor], in DoSplit()
317 (WidthFactor-1)*sizeof(Values[0])); in DoSplit()
320 NewNode->NumValuesUsed = NumValuesUsed = WidthFactor-1; in DoSplit()
328 InsertRes.Split = Values[WidthFactor-1]; in DoSplit()
|