Home
last modified time | relevance | path

Searched full:assume (Results 1 – 25 of 1951) sorted by relevance

12345678910>>...79

/linux/Documentation/devicetree/bindings/regulator/
H A Dti,tps62360.yaml38 is missing, then assume that there is no GPIO for
45 is missing, then assume that there is no GPIO for
60 is missing, then assume the state as low.
66 is missing, then assume the state as low.
/linux/arch/m68k/ifpsp060/
H A Dos.S152 clr.l %d1 | assume success
187 clr.l %d1 | assume success
223 clr.l %d1 | assume success
245 clr.l %d1 | assume success
267 clr.l %d1 | assume success
291 clr.l %d1 | assume success
306 | below assume that the SFC/DFC have been set previously.
/linux/net/802/
H A Dfddi.c100 * to start of packet data. Assume 802.2 SNAP frames for now. in fddi_type_trans()
133 /* Assume 802.2 SNAP frames, for now */ in fddi_type_trans()
149 dev->hard_header_len = FDDI_K_SNAP_HLEN+3; /* Assume 802.2 SNAP hdr len + 3 pad bytes */ in fddi_setup()
150 dev->mtu = FDDI_K_SNAP_DLEN; /* Assume max payload of 802.2 SNAP frame */ in fddi_setup()
/linux/arch/x86/kernel/
H A Debda.c21 * value and assume that everything above that value (up to 1MB) is
62 * area is absent. We'll just have to assume that the in reserve_bios_regions()
78 * If bios_start is less than 128K, assume it is bogus in reserve_bios_regions()
/linux/include/rdma/
H A Diw_cm.h112 * The client can assume that no events will be delivered for the CM ID after
141 * client can assume that no events will be delivered to the specified IW CM
154 * The client can assume that no events will be delivered to the specified IW
170 * client can assume that no events will be delivered to the specified IW CM
/linux/Documentation/admin-guide/device-mapper/
H A Dzero.rst21 desired size of the sparse device. For this example, we'll assume a 10TB
29 space available to the sparse device. For this example, we'll assume /dev/sdb1
/linux/Documentation/ABI/testing/
H A Dsysfs-firmware-gsmi42 "factory defaults". Callers should assume that
57 Callers should assume that a reboot is needed
/linux/drivers/gpu/drm/amd/display/dc/dml2/
H A Ddml_display_rq_dlg_calc.h
/linux/tools/perf/Documentation/
H A Dperf-dlfilter.txt67 Do not assume the 'sample' argument is valid (dereferenceable)
70 Do not assume data referenced by pointers in struct perf_dlfilter_sample
185 Do not assume pointers obtained via perf_dlfilter_fns are valid (dereferenceable)
218 Do not assume data referenced by pointers in struct perf_dlfilter_al
/linux/drivers/gpio/
H A Dgpiolib-legacy.c62 /* Compatibility: assume unavailable "valid" GPIOs will appear later */ in gpio_request_one()
/linux/tools/power/cpupower/utils/idle_monitor/
H A Dmperf_monitor.c289 * If the MSR read failed, assume a Xen system that did in init_maxfreq_mode()
290 * not explicitly provide access to it and assume TSC works in init_maxfreq_mode()
293 dprint("TSC read 0x%x failed - assume TSC working\n", in init_maxfreq_mode()
302 * On Intel we assume mperf (in C0) is ticking at same in init_maxfreq_mode()
/linux/Documentation/crypto/
H A Ddescore-readme.rst218 1) i assume everything is byte addressable, although i don't actually
220 i assume word pointers can be freely cast to and from char pointers.
225 i assume sizeof(word) == 4 EVERYWHERE.
280 i assume that the use of a constant is more expensive than using a register:
295 i assume that indexing is cheaper or equivalent to auto increment/decrement,
299 i assume that addresses can be cheaply formed from two registers,
/linux/drivers/crypto/inside-secure/
H A Dsafexcel_ring.c239 rdesc->descriptor_overflow = 1; /* assume error */ in safexcel_add_rdesc()
240 rdesc->buffer_overflow = 1; /* assume error */ in safexcel_add_rdesc()
250 /* Assume errors - HW will clear if not the case */ in safexcel_add_rdesc()
/linux/arch/powerpc/platforms/44x/
H A Dppc476.c163 /* Assume spin table. We could test for the enable-method in in smp_ppc47x_kick_cpu()
176 /* Assume it's mapped as part of the linear mapping. This is a bit in smp_ppc47x_kick_cpu()
179 * XXX: Is there any reason to assume differently? in smp_ppc47x_kick_cpu()
H A Diss4xx.c94 /* Assume spin table. We could test for the enable-method in in smp_iss4xx_kick_cpu()
105 /* Assume it's mapped as part of the linear mapping. This is a bit in smp_iss4xx_kick_cpu()
/linux/fs/nilfs2/
H A Dbmap.h257 /* Assume that bmap semaphore is locked. */
263 /* Assume that bmap semaphore is locked. */
269 /* Assume that bmap semaphore is locked. */
/linux/drivers/net/wireless/ath/
H A Dhw.c52 * BSSID-01 and BSSID-02. Lets assume BSSID-01 will not use the MAC address.
83 * or our MAC address (we assume the hardware uses the MAC address).
95 * So with IFRAME-01 we *assume* the hardware will do:
/linux/Documentation/devicetree/bindings/net/
H A Dhisilicon-hns-nic.txt27 LAN Switch while the CPU side assume itself have one single NIC connect to
54 ports connected to a LAN Switch while the CPU side assume itself have one
/linux/Documentation/driver-api/driver-model/
H A Ddesign-patterns.rst16 While the kernel contains a few device drivers that assume that they will
17 only be probed() once on a certain system (singletons), it is custom to assume
/linux/arch/mips/include/asm/sibyte/
H A Dsb1250_ldt.h143 * assume you've read the command and status register
172 * constants assume you've read the register as a 32-bit
190 * assume you've read the command and status register together
266 * assume you've read the command and status register together
/linux/lib/
H A Ddecompress_unxz.c37 * Normally there is exactly one Block, but let's assume that there are
42 * assumptions, it is safe to assume that the total header overhead is
50 * a maximum of 6 bytes, but to get round 2^n numbers, let's assume that
53 * quite a bit smaller though; to be safe, let's assume that an average
/linux/tools/lib/subcmd/
H A Drun-command.c222 * integer, assume each 3 bits needs a character byte and plus a possible sign
244 /* Open failed assume finish_command was called. */ in check_if_command_finished()
259 /* Read failed assume finish_command was called. */ in check_if_command_finished()
/linux/Documentation/filesystems/
H A Didmappings.rst51 sensibly translate between different idmappings. For example, assume we've been
107 Assume we are given ``k21000`` in the lower idmapset of the first idmapping. We
114 Now assume we are given the id ``u1100`` in the upper idmapset of the second
234 Let's assume the filesystem was mounted with an idmapping of
245 assume the caller has the somewhat unconventional idmapping
345 called. We will also assume that the directory we're creating filesystem
352 the caller but can differ. We will just assume they are always identical to not
578 idmapping. Let's assume they change ownership so it is compatible with the
738 Assume a file owned by ``u1000`` is read from disk. The filesystem maps this id
972 Let's assume they want all files on disk to belong to ``u1000``. When the user
/linux/include/linux/
H A Dcompiler-gcc.h19 * gcc optimizers assume this is the case. In particular they
20 * assume such arithmetic does not wrap.
/linux/arch/riscv/
H A DKconfig974 bool "Assume the system supports slow unaligned memory accesses"
977 Assume that the system supports slow unaligned memory accesses. The
982 bool "Assume the system supports fast unaligned memory accesses"
987 Assume that the system supports fast unaligned memory accesses. When
1016 bool "Assume the system supports slow vector unaligned memory accesses"
1019 Assume that the system supports slow vector unaligned memory accesses. The
1024 bool "Assume the system supports fast vector unaligned memory accesses"
1027 Assume that the system supports fast vector unaligned memory accesses. When

12345678910>>...79