| /dports/lang/mono/mono-5.10.1.57/external/corefx/src/Common/src/System/Collections/Concurrent/ |
| H A D | SingleProducerConsumerQueue.cs | 84 int tail2 = (last + 1) & (array.Length - 1); in Enqueue()
85 if (tail2 != segment._state._firstCopy) in Enqueue()
88 segment._state._last = tail2; in Enqueue()
|
| /dports/games/supertux2/SuperTux-v0.6.3-Source/external/physfs/src/ |
| H A D | physfs_unicode.c | 522 int head1 = 0, tail1 = 0, head2 = 0, tail2 = 0; \
532 if (head2 != tail2) { \
533 cp2 = folded2[tail2++]; \
537 tail2 = 1; \
|
| /dports/devel/love/love-11.3/src/libraries/physfs/ |
| H A D | physfs_unicode.c | 522 int head1 = 0, tail1 = 0, head2 = 0, tail2 = 0; \
532 if (head2 != tail2) { \
533 cp2 = folded2[tail2++]; \
537 tail2 = 1; \
|
| /dports/games/vvvvvv/VVVVVV-cb3640e5/desktop_version/physfs/ |
| H A D | physfs_unicode.c | 522 int head1 = 0, tail1 = 0, head2 = 0, tail2 = 0; \
532 if (head2 != tail2) { \
533 cp2 = folded2[tail2++]; \
537 tail2 = 1; \
|
| /dports/devel/physfs/physfs-3.0.2/src/ |
| H A D | physfs_unicode.c | 522 int head1 = 0, tail1 = 0, head2 = 0, tail2 = 0; \
532 if (head2 != tail2) { \
533 cp2 = folded2[tail2++]; \
537 tail2 = 1; \
|
| /dports/graphics/libGLU/glu-9.0.2/src/libnurbs/nurbtess/ |
| H A D | partitionY.cc | 251 Real* tail2 = e2->tail(); in compEdges() local
292 if(head2[1]>tail2[1]) { in compEdges()
294 e2_Ymin= tail2[1]; in compEdges()
297 e2_Ymax = tail2[1]; in compEdges()
320 Real x2 = intersectHoriz(head2[0], head2[1], tail2[0], tail2[1], y); in compEdges()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 169 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
170 into.prev = tail2; in mergeClusters()
171 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm11/llvm-11.0.1.src/tools/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm10/llvm-10.0.1.src/tools/lld/ELF/ |
| H A D | CallGraphSort.cpp | 169 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
170 into.prev = tail2; in mergeClusters()
171 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lld/COFF/ |
| H A D | CallGraphSort.cpp | 140 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
141 into.prev = tail2; in mergeClusters()
142 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lld/COFF/ |
| H A D | CallGraphSort.cpp | 139 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
140 into.prev = tail2; in mergeClusters()
141 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/lld/ELF/ |
| H A D | CallGraphSort.cpp | 168 int tail1 = into.prev, tail2 = from.prev; in mergeClusters() local
169 into.prev = tail2; in mergeClusters()
170 cs[tail2].next = intoIdx; in mergeClusters()
|
| /dports/sysutils/kubectl/kubernetes-1.22.2/staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/testing/clock/ |
| H A D | event_clock.go | 87 tail2 := "(none)"
92 tail2 = fileParts2[len(fileParts2)-1]
95 …d(%d) from %s:%d from %s:%d", wgc, delta, fileParts1[len(fileParts1)-1], frame1.Line, tail2, line2)
|