| /linux/rust/syn/ |
| H A D | fixup.rs | 357 Precedence::Assign | Precedence::Let | Precedence::Prefix => { in rightmost_subexpression_precedence()
381 || ((self.stmt || self.leftmost_subexpression_in_stmt) && matches!(expr, Expr::Let(_))) in parenthesize()
426 | Expr::Let(_) in precedence()
705 Expr::Let(e) => { in scan_right()
709 let right_fixup = fixup.rightmost_subexpression_fixup(false, false, Precedence::Let); in scan_right()
713 Precedence::Let, in scan_right()
715 if fixup.next_operator < Precedence::Let { in scan_right()
722 Scan::Fail | Scan::Bailout if fixup.next_operator < Precedence::Let => { in scan_right()
728 if right_fixup.rightmost_subexpression_precedence(&e.expr) < Precedence::Let { in scan_right()
769 _ if precedence == Precedence::Let && fixup.next_operator < Precedence::Let => { in scan_right()
|
| H A D | precedence.rs | 33 Let, enumerator
122 Expr::Let(_) => Precedence::Let, in of()
|
| H A D | classify.rs | 52 | Expr::Let(_) in requires_comma_to_be_match_arm()
163 | Expr::Let(_) in expr_leading_label()
209 Expr::Let(e) => expr = &e.expr, in expr_trailing_brace()
|
| H A D | token.rs | 718 "let" pub struct Let
897 [let] => { $crate::token::Let };
|
| /linux/Documentation/trace/ |
| H A D | events-nmi.rst | 22 Let's say you suspect that perf_event_nmi_handler() is causing
29 Let's also say you are only interested in when that function is
|
| /linux/Documentation/userspace-api/ |
| H A D | mfd_noexec.rst | 31 - Let memfd_create() set X bit at creation time.
32 - Let memfd be sealed for modifying X bit when NX is set.
|
| /linux/Documentation/filesystems/ |
| H A D | sharedsubtree.rst | 42 Let's say /mnt has a mount that is shared::
89 Let's say /mnt has a mount which is shared::
93 Let's bind mount /mnt to /tmp::
142 Let's try to bind mount this mount somewhere else::
451 Let's say all the mount except the mount C in the tree are
570 Example: Let's say 'B1', 'B2', 'B3' are shared mounts that propagate to
597 Let's say 'A' and 'B' are the corresponding mounts in the parent and the
653 its root dentry is 1. Let's call this mount 'A'
655 dentry 2. Let's call this mount 'B'
657 mnt. Let's call this mount 'C'
[all …]
|
| H A D | propagate_umount.txt | 109 Let's call a mount m in a set S forbidden in that set if there is a
133 Let's say that mount x in a set S is forbidden by mount y, if
213 Let's start with naive algorithm for Trim():
242 the entire descent chain from them to m is contained in S. Let
272 to iterate through. Let's represent it as a subset in a cyclic list,
399 Let (x_0, ..., x_n = m) be the maximal chain of descent of m within S.
478 to set in the end. Let's set MNT_UMOUNT at the time we add an element
|
| H A D | idmappings.rst | 234 Let's assume the filesystem was mounted with an idmapping of
244 So the kernel will map the id back up in the idmapping of the caller. Let's
256 Let's look at an example. We are given the following two idmappings::
384 Let's see some examples with caller/filesystem idmapping but without mount
578 idmapping. Let's assume they change ownership so it is compatible with the
765 we create a new file. Let's say the user is creating a file with ``u1000``.
794 Let's now briefly reconsider the failing examples from earlier in the context
972 Let's assume they want all files on disk to belong to ``u1000``. When the user
|
| /linux/Documentation/driver-api/iio/ |
| H A D | triggers.rst | 45 Let's see a simple example of how to setup a trigger to be used by a driver::
|
| /linux/Documentation/filesystems/ext4/ |
| H A D | journal.rst | 697 Let's consider this rename operation: 'mv /a /b'. Let's assume dirent '/a'
709 Let's take an example of a procedure that is not idempotent and see how fast
717 Let's say while in replay, we crash after (2). During the second replay,
724 (Let's assume dirent A was linked to inode 10 and dirent B was linked to
|
| /linux/Documentation/kbuild/ |
| H A D | Kconfig.recursion-issue-02 | 25 # have. Let's assume we have some CORE functionality, then the kernel has a
|
| /linux/Documentation/admin-guide/ |
| H A D | workload-tracing.rst | 76 or a virtual machine. Most distributions will include strace command. Let’s
88 cscope is a good tool to browse kernel sources. Let's install it now::
102 subsystems used by these workloads. Let's start with an overview of these
192 Let’s checkout the latest Linux repository and build cscope database::
|
| /linux/arch/m68k/fpsp040/ |
| H A D | stwotox.S | 64 | 4. Let AdjFact := 2**(M'). Return
|
| /linux/Documentation/gpu/amdgpu/display/ |
| H A D | programming-model-dcn.rst | 86 Let's start with the central block in the image, `dc`. The `dc` struct is
126 basic hardware/software operations. Let's start with the `dc_create()`
|
| H A D | mpo-overview.rst | 190 Let's discuss some of the hardware limitations we have when dealing with
220 Let's briefly explore how userspace can handle these two display configurations
|
| /linux/Documentation/sound/cards/ |
| H A D | pcmtest.rst | 45 data generation. Let's look at the second mode.
|
| /linux/Documentation/devicetree/ |
| H A D | overlay-notes.rst | 21 Let's take an example where we have a foo board with the following base tree::
|
| /linux/Documentation/dev-tools/ |
| H A D | checkuapi.rst | 81 Let's add another change that *might* break userspace::
163 Let's commit the breaking change, then commit the innocuous change::
327 This script removes a UAPI header file from the install list. Let's run
|
| /linux/Documentation/driver-api/mtd/ |
| H A D | nand_ecc.rst | 42 Let's give a small figure:
61 Let's start to explain column parity.
313 Let's give it a try...
680 This makes things worse. Let's stick with attempt 6 and continue from there.
|
| /linux/arch/arm/boot/dts/arm/ |
| H A D | integratorcp.dts | 25 * cannot define a proper compatible here. Let the
|
| H A D | integratorap.dts | 23 * cannot define a proper compatible here. Let the
|
| /linux/Documentation/w1/ |
| H A D | w1-generic.rst | 37 Let's see how one can read EEPROM context:
|
| /linux/Documentation/driver-api/media/drivers/ |
| H A D | zoran.rst | 477 Let's do some math using a width of 704 pixels. I'm not sure whether the Buz
486 Let's say that we specify d1q50. We thus want 256 bits per block; times 3168
498 examples. Let's do some math using this information:
|
| /linux/arch/s390/kernel/ |
| H A D | entry.S | 217 # Let the next instruction be NOP to avoid triggering a machine check
|