| /third_party/rust/crates/bindgen/.github/workflows/ |
| D | sync-master-from-main.yml | 1 name: sync master from main
5 branches:
6 - main
9 sync-branches:
10 runs-on: ubuntu-latest
11 name: Keep master and main in sync until master is done
13 - name: Checkout
15 - name: Merge master <- main
16 uses: devmasx/merge-branch@master
|
| /third_party/exfatprogs/.github/workflows/ |
| D | c-cpp.yml | 5 branches:
6 - master
7 - exfat-next
9 branches:
10 - master
11 - exfat-next
16 runs-on: ubuntu-latest
19 - uses: actions/checkout@v4
20 - name: before test
22 sudo apt-get install linux-headers-$(uname -r) xz-utils \
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | LegacyDivergenceAnalysis.cpp | 1 //===- LegacyDivergenceAnalysis.cpp --------- Legacy Divergence Analysis
2 //Implementation -==//
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
8 //===----------------------------------------------------------------------===//
15 // in the same execution group have to execute in lock-step. Therefore, if the
16 // code contains divergent branches (i.e., threads in a group do not agree on
19 // they converge at the immediately post-dominating BB of the paths.
23 // divergent branches. Therefore, an analysis that computes which branches in a
28 // non-trivial approximation of all divergent branches in a GPU program. It
37 // data or sync dependent on a source of divergence as divergent.
[all …]
|
| D | DivergenceAnalysis.cpp | 1 //===- DivergenceAnalysis.cpp --------- Divergence Analysis Implementation -==//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // and GPU programs. It determines which branches and values in a loop or GPU
15 // in the same execution group have to execute in lock-step. Therefore, if the
16 // code contains divergent branches (i.e., threads in a group do not agree on
19 // they re-converge.
22 // threading and loop unswitching can interfere with thread re-convergence.
23 // Therefore, an analysis that computes which branches in a GPU program are
41 // or sync dependent on a source of divergence.
[all …]
|
| /third_party/skia/third_party/externals/angle2/doc/ |
| D | BuildingAngleForChromiumDevelopment.md | 16 * To sync all standalone dependencies run:
21 gclient sync
35 ninja -j 10 -k1 -C out/Debug
38 * For example, `ninja -j 10 -k1 -C out/Debug angle_gles2_deqp_tests`
40 * To go back to the Chromium-managed version, remove `third_party/angle/.gclient`.
60 …e and are responsible for running all git commands (pull, rebase, etc.) for managing your branches.
66 * `gclient sync` your Chromium workspace.
|
| /third_party/skia/third_party/externals/angle2/scripts/ |
| D | roll_chromium_deps.py | 4 # Use of this source code is governed by a BSD-style license
44 'third_party/abseil-cpp',
69 'third_party/Python-Markdown',
70 'third_party/qemu-linux-x64',
71 'third_party/qemu-mac-x64',
80 'tools/luci-go',
99 COMMIT_POSITION_RE = re.compile('^Cr-Commit-Position: .*#([0-9]+).*$')
100 CLANG_REVISION_RE = re.compile(r'^CLANG_REVISION = \'([-0-9a-z]+)\'')
113 NOTIFY_EMAIL = 'angle-wrangler@grotations.appspotmail.com'
175 sys.exit(-1)
[all …]
|
| D | export_targets.py | 5 To update ANGLE in Gecko, use Windows with git-bash, and setup depot_tools, python2, and
12 It has branches like 'firefox-60' which is the branch we use for pulling into
15 This script leaves a record of the merge-base and cherry-picks that we pull into
18 ANGLE<->Chrome version mappings are here: https://omahaproxy.appspot.com/
34 gclient sync
41 /path/to/gecko/gfx/angle/update-angle.py origin/chromium/XXXX
42 git push moz # Push the firefox-XX branch to github.com/mozilla/angle
59 # We need to set DEPOT_TOOLS_WIN_TOOLCHAIN to 0 for non-Googlers, but otherwise
75 # ------------------------------------------------------------------------------
113 # ------------------------------------------------------------------------------
[all …]
|
| /third_party/rust/rust/src/tools/miri/.github/workflows/ |
| D | ci.yml | 6 branches:
7 - 'auto'
8 - 'try'
10 branches:
11 - 'master'
13 - cron: '6 6 * * *' # At 6:06 UTC every day.
20 runs-on: ${{ matrix.os }}
25 fail-fast: false
28 - os: ubuntu-latest
29 host_target: x86_64-unknown-linux-gnu
[all …]
|
| /third_party/libbpf/ |
| D | SYNC.md | 2 …<source media="(prefers-color-scheme: dark)" srcset="assets/libbpf-logo-sideways-darkbg.png" width…
3 <img src="assets/libbpf-logo-sideways.png" width="40%">
6 Libbpf sync
9 Libbpf *authoritative source code* is developed as part of [bpf-next Linux source
10 tree](https://kernel.googlesource.com/pub/scm/linux/kernel/git/bpf/bpf-next) under
13 Most of the mundane mechanical things like bpf and bpf-next tree merge, Git
14 history transformation, cherry-picking relevant commits, re-generating
15 auto-generated headers, etc. are taken care by
16 [sync-kernel.sh script](https://github.com/libbpf/libbpf/blob/master/scripts/sync-kernel.sh).
25 ------------------
[all …]
|
| /third_party/skia/m133/third_party/externals/libyuv/tools_libyuv/autoroller/ |
| D | roll_deps.py | 5 # Use of this source code is governed by a BSD-style license
39 COMMIT_POSITION_RE = re.compile('^Cr-Commit-Position: .*#([0-9]+).*$')
40 CLANG_REVISION_RE = re.compile(r'^CLANG_REVISION = \'([0-9a-z-]+)\'$')
49 import find_depot_tools # pylint: disable=wrong-import-position
81 deps_content = f.read().decode('utf-8')
97 sys.exit(-1)
135 """Returns a tuple of active,branches.
137 The 'active' is the name of the currently active branch and 'branches' is a
138 list of all branches.
141 branches = []
[all …]
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/ |
| D | README.adoc | 1 // Copyright 2014-2024 The Khronos Group Inc.
2 // SPDX-License-Identifier: CC-BY-4.0
8 invoked from the top-level directory or from the API Registry in
13 * `genvk.py` - Python script to generate Vulkan headers and some other
15 * `reg.py` - Python tools to read a registry XML file and call into
17 * `conventions.py`, `vkconventions.py`, `apiconventions.py` - API-specific
19 * `generator.py` - output generator base class.
20 ** `cgenerator.py` - C header output generator.
21 ** `docgenerator.py` - Asciidoc interface language include generator.
22 ** `extensionmetadocgenerator.py` - Generator for Asciidoc extension
[all …]
|
| /third_party/ffmpeg/doc/ |
| D | git-howto.texi | 1 \input texinfo @c -*- texinfo -*-
2 @documentencoding UTF-8
21 git --help
28 git <command> --help
29 man git-<command>
38 @url{http://git-scm.com/, Git website}.
42 What follows now is a basic introduction to Git and some FFmpeg-specific
49 You can get Git from @url{http://git-scm.com/}
69 git clone gil@@ffmpeg.org:ffmpeg-web <target>
76 If you don't have write-access to the ffmpeg-web repository, you can
[all …]
|
| /third_party/rust/rust/tests/ui/layout/ |
| D | unsafe-cell-hides-niche.rs | 1 // For rust-lang/rust#68303: the contents of `UnsafeCell<T>` cannot
2 // participate in the niche-optimization for enum discriminants. This
6 // check-pass
7 // compile-flags: --crate-type=lib
8 // only-x86
15 use std::sync::{Mutex, RwLock};
39 // it from other branches and not accidentally match any.
|
| /third_party/littlefs/runners/ |
| D | test_runner.c | 5 * SPDX-License-Identifier: BSD-3-Clause
50 return &p_[(count_-1)*size]; in mappend()
53 // a quick self-terminating text-safe varint scheme
58 x = -x; in leb16_print()
63 printf("%c", (nibble < 10) ? '0'+nibble : 'a'+nibble-10); in leb16_print()
87 nibble = nibble - '0'; in leb16_parse()
89 nibble = nibble - 'a' + 10; in leb16_parse()
106 return neg ? -x : x; in leb16_parse()
144 ((size_t)(&__stop__test_suites - &__start__test_suites))
273 exit(-1); in test_define()
[all …]
|
| /third_party/rust/rust/library/std/src/sync/ |
| D | mutex.rs | 7 use crate::sync::{poison, LockResult, TryLockError, TryLockResult};
46 /// use std::sync::{Arc, Mutex};
48 /// use std::sync::mpsc::channel;
52 /// // Spawn a few threads to increment a shared variable (non-atomically), and
64 /// // Our non-atomic increment is safe because we're the only thread
84 /// use std::sync::{Arc, Mutex};
90 /// let _ = thread::spawn(move || -> () {
101 /// // pattern matched on to return the underlying guard on both branches.
114 /// use std::sync::{Arc, Mutex};
131 /// // This is the result of some important and long-ish work.
[all …]
|
| /third_party/skia/m133/src/sksl/codegen/ |
| D | SkSLRasterPipelineBuilder.h | 4 * Use of this source code is governed by a BSD-style license that can be
38 constexpr Slot NA = -1;
60 // native SkRasterPipelineOps op-list. It also has a few extra ops to indicate child-effect
77 // child-effect invocations.
80 // An in-flight program can contain all the native Raster Pipeline ops...
87 // ... and also has Builder-specific ops. These ops generally interface with the stack, and are
126 // If the extended ops are not in sync between enums, program creation will not work.
129 // Represents a single raster-pipeline SkSL instruction.
192 // These methods are used to split up multi-slot copies into multiple ops as needed.
217 // Appends a single-slot single-input math operation to the pipeline. The op `stage` will
[all …]
|
| /third_party/mesa3d/src/freedreno/ir3/ |
| D | ir3_legalize.c | 3 * SPDX-License-Identifier: MIT
18 * The legalize pass handles ensuring sufficient nop's and sync flags for
21 * 1) Iteratively determine where sync ((sy)/(ss)) flags are needed,
47 regmask_t needs_ss_scalar_full; /* half scalar ALU producer -> full scalar ALU consumer */
48 regmask_t needs_ss_scalar_half; /* full scalar ALU producer -> half scalar ALU consumer */
50 regmask_t needs_ss_or_sy_war; /* WAR for sy-producer sources */
51 regmask_t needs_ss_scalar_war; /* scalar ALU write -> ALU write */
69 /* When non-ALU (e.g. cat5) instructions reading the given full/half register
74 /* When p0.x-w, a0.x, and a1.x are ready. */
89 if (regmask_get(&state->needs_ss_war, dst)) in needs_ss_war()
[all …]
|
| /third_party/rust/rust/library/std/src/sys/unix/ |
| D | time.rs | 10 libc::timespec { tv_sec: <libc::time_t>::MAX, tv_nsec: 1_000_000_000 - 1 };
39 pub fn new(tv_sec: i64, tv_nsec: i64) -> SystemTime { in new()
43 pub fn sub_time(&self, other: &SystemTime) -> Result<Duration, Duration> { in sub_time()
47 pub fn checked_add_duration(&self, other: &Duration) -> Option<SystemTime> { in checked_add_duration()
51 pub fn checked_sub_duration(&self, other: &Duration) -> Option<SystemTime> { in checked_sub_duration()
57 fn from(t: libc::timespec) -> SystemTime { in from()
63 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { in fmt()
72 pub const fn zero() -> Timespec { in zero()
76 const fn new(tv_sec: i64, tv_nsec: i64) -> Timespec { in new()
82 pub fn sub_timespec(&self, other: &Timespec) -> Result<Duration, Duration> { in sub_timespec()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/base/ |
| D | optimization.h | 8 // https://www.apache.org/licenses/LICENSE-2.0
16 // -----------------------------------------------------------------------------
18 // -----------------------------------------------------------------------------
31 // Instructs the compiler to avoid optimizing tail-call recursion. This macro is
71 // See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0154r1.html
114 // See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0154r1.html
122 // to variables and types is always implementation-defined.
138 // 1) Consult compiler documentation; this comment is not kept in sync as
168 // the absence of better information (ie. compiling gcc with `-fprofile-arcs`).
173 // specific branches that are both hot and consistently mispredicted is likely
|
| /third_party/mesa3d/src/panfrost/compiler/bifrost/ |
| D | bi_pack.c | 29 * bits on the wire (as well as fixup branches) */
37 unsigned dependency_wait = next_1 ? next_1->dependencies : 0; in bi_pack_header()
38 dependency_wait |= next_2 ? next_2->dependencies : 0; in bi_pack_header()
43 if (clause->message_type == BIFROST_MESSAGE_BARRIER) in bi_pack_header()
46 bool staging_barrier = next_1 ? next_1->staging_barrier : false; in bi_pack_header()
47 staging_barrier |= next_2 ? next_2->staging_barrier : 0; in bi_pack_header()
51 : clause->flow_control, in bi_pack_header()
52 .terminate_discarded_threads = clause->td, in bi_pack_header()
53 .next_clause_prefetch = clause->next_clause_prefetch && next_1, in bi_pack_header()
55 .staging_register = clause->staging_register, in bi_pack_header()
[all …]
|
| /third_party/rust/rust/library/core/src/ |
| D | hint.rs | 16 /// happen, it will eliminate all branches in the surrounding code that it can
19 /// If the assumptions embedded in using this function turn out to be wrong -
21 /// reachable at runtime - the compiler may have generated nonsensical machine
23 /// causing difficult-to-debug problems.
38 /// // Note to future-self when making changes: The invariant established
45 /// /// All elements of `divisor` must be non-zero.
46 /// unsafe fn do_computation(i: u32, divisors: &[u32]) -> u32 {
60 /// // and removes the - now proven useless - check.
68 /// // Safety: prepare_inputs() guarantees that divisors is non-zero
82 /// fn div_1(a: u32, b: u32) -> u32 {
[all …]
|
| /third_party/skia/m133/third_party/externals/harfbuzz/src/ |
| D | hb-ot-shape-normalize.cc | 31 #include "hb-ot-shape-normalize.hh"
32 #include "hb-ot-shaper.hh"
33 #include "hb-ot-shape.hh"
54 * - Try to render all canonically equivalent strings similarly. To really
58 * don't touch 1-character clusters that are supported by the font, even
61 * - When a font has a precomposed character for a sequence but the 'ccmp'
65 * - When a font does not support a combining mark, but supports it precomposed
69 * - When a font does not support a character but supports its canonical
72 * - The shapers can customize the compose and decompose functions to
81 (void) font->get_nominal_glyph (info.codepoint, &info.glyph_index()); in set_glyph()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCReduceCRLogicals.cpp | 1 //===---- PPCReduceCRLogicals.cpp - Reduce CR Bit Logical operations ------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===---------------------------------------------------------------------===//
15 //===---------------------------------------------------------------------===//
26 #include "llvm/Config/llvm-config.h"
32 #define DEBUG_TYPE "ppc-reduce-cr-ops"
35 "Number of single-use binary CR logical ops contained in a block");
58 for (auto &MI : Successor->instrs()) { in updatePHIs()
61 // This is a really ugly-looking loop, but it was pillaged directly from in updatePHIs()
67 if (MI.getOperand(i - 1).isReg()) { in updatePHIs()
[all …]
|
| /third_party/protobuf/third_party/abseil-cpp/absl/base/ |
| D | optimization.h | 8 // https://www.apache.org/licenses/LICENSE-2.0
16 // -----------------------------------------------------------------------------
18 // -----------------------------------------------------------------------------
45 // Instructs the compiler to avoid optimizing tail-call recursion. This macro is
85 // See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0154r1.html
129 // See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0154r1.html
137 // to variables and types is always implementation-defined.
153 // 1) Consult compiler documentation; this comment is not kept in sync as
182 // the absence of better information (ie. compiling gcc with `-fprofile-arcs`).
187 // specific branches that are both hot and consistently mispredicted is likely
[all …]
|
| /third_party/rust/rust/ |
| D | triagebot.toml | 2 allow-unauthenticated = [
3 "A-*",
4 "C-*",
5 "D-*",
6 "E-*",
7 "F-*",
8 "I-*",
9 "NLL-*",
10 "O-*",
11 "S-*",
[all …]
|