summaryrefslogtreecommitdiffstats
path: root/build-root
AgeCommit message (Expand)AuthorFilesLines
2019-10-03ebuild: Unite default build platform to vppjuraj.linkes1-1/+1
2019-05-31tools: FEATURE.yaml meta-data infrastructureOle Troan1-0/+1
2019-01-26Run vpp-configure on change to cmake config files.Burt Silverman1-0/+4
2019-01-20Rework of debian packagingDamjan Marion23-588/+1
2018-12-01Delete shared memory segment files when vpp startsDave Barach2-3/+1
2018-10-25Add x86_64 perfmon tablesDave Barach1-2/+2
2018-10-22X86_64 perf counter pluginDave Barach1-0/+5
2018-09-12Always use 'lib' instead of 'lib64'Damjan Marion1-2/+2
2018-08-01Move java api to extras/Damjan Marion1-1/+1
2018-03-24allow specifying number of concurrent jobsKlement Sekera1-0/+4
2018-03-15remove bootstrap from top-level MakefileDamjan Marion1-46/+0
2018-03-15use system provided ccache linksDamjan Marion3-15/+4
2018-03-14Clean up vpp build bootstrap stepDave Barach5-60/+38
2018-03-12License text cleanupDave Barach18-1/+240
2018-02-21vpp-csit-verify: use latest verified CSIT branch by defaultJan Gelety1-1/+1
2018-01-30VPP-899: Run VPP under SELinuxBilly McFall1-0/+1
2018-01-25Update CSIT tests 180115 -> 180122Jan Gelety1-1/+1
2018-01-23VPPAPIGEN: vppapigen replacement in Python PLY.Ole Troan1-1/+1
2018-01-16Update CSIT tests 171218 -> 180115Jan Gelety1-1/+1
2018-01-10makefile set CXXFLAGS so they are propageted to sub-buildsNeale Ranns1-0/+4
2017-12-18Update CSIT tests 171204 -> 171218Jan Gelety1-1/+1
2017-12-04Update CSIT tests 171127 -> 171204Jan Gelety1-1/+1
2017-11-27Update CSIT tests 171030 -> 171127Jan Gelety1-1/+1
2017-11-22 Makefile: make_parallel_flags via env variableEd Kern1-1/+1
2017-11-13Reduce number of parallel buildsDamjan Marion1-1/+1
2017-11-06fix debian packages generation (invalid warning silencing)Gabriel Ganne1-2/+1
2017-11-01Clean up a few historical anomaliesDave Barach1-22/+6
2017-10-31Update CSIT tests 171017 -> 171030Jan Gelety1-1/+1
2017-10-17Update CSIT tests 171002 -> 171017Jan Gelety1-1/+1
2017-10-04checkstyle: add clang-format dependency, fix bugKlement Sekera1-1/+1
2017-10-04Update CSIT tests 170926 -> 171002Jan Gelety1-1/+1
2017-09-27Update CSIT tests 1700906 -> 170926Jan Gelety1-1/+1
2017-09-26checkstyle: ignore old clang-format (centos)Klement Sekera1-2/+9
2017-09-19Add C++ APIKlement Sekera1-12/+50
2017-09-07The missing variable (added with this patch) was causing the build on AARCH64Marco Varlese1-0/+1
2017-09-07Update CSIT tests 170814 -> 170906Jan Gelety1-1/+1
2017-08-18Update CSIT tests 170731 -> 170814Jan Gelety1-1/+1
2017-08-02Update CSIT tests 170724 -> 170731Jan Gelety1-1/+1
2017-07-24Update CSIT tests 170626 -> 170724Jan Gelety1-1/+1
2017-06-26Update CSIT tests 170622 -> 170626Jan Gelety1-1/+1
2017-06-24make: Fix parallel building with some container platforms (VPP-880)Chris Luke1-10/+7
2017-06-22Update CSIT tests 170612 -> 170622Jan Gelety1-1/+1
2017-06-12Update CSIT tests 170605 -> 170612Jan Gelety1-1/+1
2017-06-06Update CSIT tests 170529 -> 170605Jan Gelety1-1/+1
2017-06-02Update CSIT tests 170518 -> 170529Peter Mikus1-1/+1
2017-05-31Revert "Update CSIT tests 170518 -> 170529"Dave Wallace1-1/+1
2017-05-29Relocate Coverity scriptsChris Luke2-89/+0
2017-05-29Update CSIT tests 170518 -> 170529Jan Gelety1-1/+1
2017-05-24Simple script to 'git blame' on new Coverity issuesChris Luke1-0/+36
2017-05-18Update CSIT tests 170504 -> 170518Jan Gelety1-1/+1
> *i = *j; *i = c; } } } } /* * qst: Do a quicksort. First, find the median element, and put that one in * the first place as the discriminator. (This "median" is just the median * of the first, last and middle elements). (Using this median instead of * the first element is a big win). Then, the usual partitioning/swapping, * followed by moving the discriminator into the right place. Then, figure * out the sizes of the two partions, do the smaller one recursively and the * larger one via a repeat of this code. Stopping when there are less than * THRESH elements in a partition and cleaning up with an insertion sort (in * our caller) is a huge win. All data swaps are done in-line, which is * space-losing but time-saving. (And there are only three places where this * is done). */ static void qst (qst_t * q, char *base, char *max) { char *i; char *j; char *jj; char *mid; int ii; char c; char *tmp; int lo; int hi; int qsz = q->qsz; lo = (int) (max - base); /* number of elements as chars */ do { /* * At the top here, lo is the number of characters of elements in the * current partition. (Which should be max - base). Find the median * of the first, last, and middle element and make that the middle * element. Set j to largest of first and middle. If max is larger * than that guy, then it's that guy, else compare max with loser of * first and take larger. Things are set up to prefer the middle, * then the first in case of ties. */ mid = i = base + qsz * ((unsigned) (lo / qsz) >> 1); if (lo >= q->mthresh) { j = ((*q->qcmp) ((jj = base), i) > 0 ? jj : i); if ((*q->qcmp) (j, (tmp = max - qsz)) > 0) { /* switch to first loser */ j = (j == jj ? i : jj); if ((*q->qcmp) (j, tmp) < 0) j = tmp; } if (j != i) { ii = qsz; do { c = *i; *i++ = *j; *j++ = c; } while (--ii); } } /* Semi-standard quicksort partitioning/swapping */ for (i = base, j = max - qsz;;) { while (i < mid && (*q->qcmp) (i, mid) <= 0) i += qsz; while (j > mid) { if ((*q->qcmp) (mid, j) <= 0) { j -= qsz; continue; } tmp = i + qsz; /* value of i after swap */ if (i == mid) { /* j <-> mid, new mid is j */ mid = jj = j; } else { /* i <-> j */ jj = j; j -= qsz; } goto swap; } if (i == mid) { break; } else { /* i <-> mid, new mid is i */ jj = mid; tmp = mid = i; /* value of i after swap */ j -= qsz; } swap: ii = qsz; do { c = *i; *i++ = *jj; *jj++ = c; } while (--ii); i = tmp; } /* * Look at sizes of the two partitions, do the smaller one first by * recursion, then do the larger one by making sure lo is its size, * base and max are update correctly, and branching back. But only * repeat (recursively or by branching) if the partition is of at * least size THRESH. */ i = (j = mid) + qsz; if ((lo = (int) (j - base)) <= (hi = (int) (max - i))) { if (lo >= q->thresh) qst (q, base, j); base = i; lo = hi; } else { if (hi >= q->thresh) qst (q, i, max); max = j; } } while (lo >= q->thresh); } /* * fd.io coding-style-patch-verification: ON * * Local Variables: * eval: (c-set-style "gnu") * End: */