HomeSort by relevance Sort by last modified time
    Searched full:newn (Results 1 - 6 of 6) sorted by null

  /external/icu4c/test/perf/howExpensiveIs/
sieve.cpp 122 int newN = n;
126 for(int i=0;i<newN;i++) {
131 times[i--] = times[--newN]; // bring down a new value
139 if(newN<n) {
142 printf("removed %d outlier(s), recalculating IQR..\n", n-newN);
144 n = newN;
  /external/openssh/openbsd-compat/
glob.c 754 size_t newn, len; local
759 newn = 2 + pglob->gl_pathc + pglob->gl_offs;
762 newn >= INT_MAX ||
763 SIZE_MAX / sizeof(*pathv) <= newn ||
764 SIZE_MAX / sizeof(*statv) <= newn) {
766 for (i = pglob->gl_offs; i < (ssize_t)(newn - 2); i++) {
784 pathv = realloc(pglob->gl_pathv, newn * sizeof(*pathv));
796 statv = realloc(pglob->gl_statv, newn * sizeof(*statv));
838 (newn * sizeof(*pathv)) + limitp->glim_malloc >
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 400 ExplodedNode *NewN = G->getNode(N->getLocation(), N->State, N->isSink(), 0);
401 Pass2[N] = NewN;
404 if (InverseMap) (*InverseMap)[NewN] = N;
408 G->addRoot(NewN);
410 // In the case that some of the intended predecessors of NewN have already
421 NewN->addPredecessor(const_cast<ExplodedNode *>(PI->second), *G);
424 // In the case that some of the intended successors of NewN have already
432 const_cast<ExplodedNode *>(PI->second)->addPredecessor(NewN, *G);
ExprEngineCXX.cpp 410 ExplodedNode *NewN = Bldr.generateNode(CNE, Pred, State);
411 if (!NewN)
419 Bldr.takeNodes(NewN);
420 evalBind(Dst, CNE, NewN, Result, State->getSVal(Init, LCtx),
BugReporter.cpp     [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.h 387 void setValue(const Value *V, SDValue NewN) {
390 N = NewN;
393 void setUnusedArgValue(const Value *V, SDValue NewN) {
396 N = NewN;

Completed in 809 milliseconds