HomeSort by: relevance | last modified time | path
    Searched defs:InsertNode (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Support/
FoldingSet.cpp 297 InsertNode(NodeInBucket,
348 /// InsertNode - Insert the specified node into the folding set, knowing that it
351 void FoldingSetBase::InsertNode(Node *N, void *InsertPos,
431 InsertNode(N, IP, Info);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
FoldingSet.h 89 /// should be inserted using InsertNode.
92 /// new node with InsertNode;
94 /// MyFoldingSet.InsertNode(M, InsertPoint);
218 /// InsertNode - Insert the specified node into the folding set, knowing that
221 void InsertNode(Node *N, void *InsertPos, const FoldingSetInfo &Info);
467 /// InsertNode - Insert the specified node into the folding set, knowing that
470 void InsertNode(T *N, void *InsertPos) {
471 FoldingSetBase::InsertNode(N, InsertPos, Derived::getFoldingSetInfo());
474 /// InsertNode - Insert the specified node into the folding set, knowing that
476 void InsertNode(T *N)
    [all...]
  /src/external/bsd/libarchive/dist/libarchive/
archive_ppmd7.c 152 static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
172 InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
174 InsertNode(p, ptr, i);
238 InsertNode(p, node, PPMD_NUM_INDEXES - 1);
242 InsertNode(p, node + k, nu - k - 1);
244 InsertNode(p, node, i);
309 InsertNode(p, oldPtr, i0);
563 InsertNode(p, oldPtr, i);
659 InsertNode(p, stats, U2I(((numStats + 1) >> 1)));
archive_ppmd8.c 117 static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
141 InsertNode(p, ((Byte *)ptr) + U2B(k), nu - k - 1);
143 InsertNode(p, ptr, i);
194 InsertNode(p, node, PPMD_NUM_INDEXES - 1);
198 InsertNode(p, node + k, nu - k - 1);
200 InsertNode(p, node, i);
264 InsertNode(p, oldPtr, i0);
273 InsertNode(p, ptr, U2I(nu));
279 InsertNode(p, ptr, 0);
298 InsertNode(p, oldPtr, indx)
    [all...]

Completed in 50 milliseconds