/openbmc/linux/Documentation/scheduler/ |
H A D | sched-debug.rst | 20 ------------------------------------------------------------------- 26 end of the address space is reached the scanner restarts from the beginning. 33 the higher the "scan size", the higher the scan rate. 35 Higher scan rates incur higher system overhead as page faults must be 36 trapped and potentially data must be migrated. However, the higher the scan
|
/openbmc/linux/fs/erofs/ |
H A D | Kconfig | 1 # SPDX-License-Identifier: GPL-2.0-only 9 EROFS (Enhanced Read-Only File System) is a lightweight read-only 11 xattrs/data, chunk-based deduplication, multiple devices, etc.) for 12 scenarios which need high-performance read-only solutions, e.g. 13 smartphones with Android OS, LiveCDs and high-density hosts with 16 It also provides fixed-sized output compression support in order to 17 improve storage density as well as keep relatively higher compression 18 ratios and implements in-place decompression to reuse the file page 20 quite useful to ensure guaranteed end-to-end runtime decompression 83 Enable fixed-sized output compression for EROFS. [all …]
|
/openbmc/linux/arch/arc/kernel/ |
H A D | entry-arcv2.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */ 3 * ARCv2 ISA based core Low Level Intr/Traps/Exceptions(non-TLB) Handling 56 # End of fixed IRQs 58 .rept NR_CPU_IRQS - 8 81 # Note this disable is only for consistent book-keeping as further interrupts 84 # unless this one returns (or higher prio becomes pending in 2-prio scheme) 89 ; so a higher prio interrupt taken here won't clobber prev prio icause 96 END(handle_interrupt) 104 END(EV_SWI) 110 END(EV_DivZero) [all …]
|
/openbmc/linux/arch/arm64/kernel/ |
H A D | perf_callchain.c | 1 // SPDX-License-Identifier: GPL-2.0-only 47 * (towards higher addresses). in user_backtrace() 57 * The registers we're interested in are at the end of the variable 58 * length saved register structure. The fp points at the end of this 60 * (struct compat_frame_tail *)(xxx->fp)-1 92 * (towards higher addresses). in compat_user_backtrace() 98 return (struct compat_frame_tail __user *)compat_ptr(buftail.fp) - 1; in compat_user_backtrace() 110 perf_callchain_store(entry, regs->pc); in perf_callchain_user() 116 tail = (struct frame_tail __user *)regs->regs[29]; in perf_callchain_user() 118 while (entry->nr < entry->max_stack && in perf_callchain_user() [all …]
|
/openbmc/docs/designs/mctp/ |
H A D | mctp.md | 8 BMC. This is primarily IPMI-based, but also includes a few hardware-specific 9 side-channels, like hiomap. On OpenPOWER hardware at least, we've definitely 27 attempted, but not in a cross-implementation manner so far. This does not 40  44 I2C, PCI, Serial or custom hardware channel, without the higher layers of that 45 stack needing to be aware of the hardware implementation. These higher levels 48 that communicates over MCTP - for example, the host device, the BMC, or any 49 other system peripheral - static or hot-pluggable. 54 For example, the PLDM design at [pldm-stack.md]. 58 the higher-level data transferred between MCTP endpoints, which packets are [all …]
|
/openbmc/linux/Documentation/trace/ |
H A D | osnoise-tracer.rst | 5 In the context of high-performance computing (HPC), the Operating System 9 system. Moreover, hardware-related jobs can also cause noise, for example, 21 NMI or in the hardware itself. At the end of the period, hwlatd enables 32 source of interferences, increasing a per-cpu interference counter. The 38 hardware-related noise. In this way, osnoise can account for any 39 source of interference. At the end of the period, the osnoise tracer 44 ----- 59 # _-----=> irqs-off 60 # / _----=> need-resched 61 # | / _---=> hardirq/softirq [all …]
|
/openbmc/linux/Documentation/process/ |
H A D | 8.Conclusion.rst | 9 top-level :ref:`process/howto.rst <process_howto>`; also read 10 :ref:`process/submitting-patches.rst <submittingpatches>`. Many internal 33 Rubini, and Greg Kroah-Hartman). Online at 49 https://www.kernel.org/pub/software/scm/git/docs/user-manual.html 55 Congratulations to anybody who has made it through this long-winded 59 In the end, it's the participation that matters. Any open source software 69 kernel. Getting code into the mainline is the key to higher code quality, 70 lower maintenance and distribution costs, a higher level of influence over
|
/openbmc/linux/tools/perf/pmu-events/arch/x86/graniterapids/ |
H A D | pipeline.json | 48 "BriefDescription": "Number of instructions retired. Fixed Counter - architectural event", 51 …"PublicDescription": "Counts the number of X86 instructions retired - an Architectural PerfMon eve… 56 "BriefDescription": "Number of instructions retired. General Counter - architectural event", 60 …"PublicDescription": "Counts the number of X86 instructions retired - an Architectural PerfMon eve… 72 …the Topdown Slots event that were not consumed by the back-end pipeline due to lack of back-end re… 75 …-end pipeline due to lack of back-end resources, as a result of memory subsystem delays, execution… 80 …"BriefDescription": "TMA slots available for an unhalted logical processor. Fixed counter - archit… 82 …-width of the narrowest pipeline as employed by the Top-down Microarchitecture Analysis method (TM… 87 …n": "TMA slots available for an unhalted logical processor. General counter - architectural event", 90 …-width of the narrowest pipeline as employed by the Top-down Microarchitecture Analysis method. Th… [all …]
|
/openbmc/linux/include/linux/ |
H A D | dim.h | 1 /* SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB */ 24 ((ref) && (((100UL * abs((val) - (ref))) / (ref)) > 10)) 28 * Take wrap-around and variable size into consideration. 30 #define BIT_GAP(bits, end, start) ((((end) - (start)) + BIT_ULL(bits)) \ argument 31 & (BIT_ULL(bits) - 1)) 34 * struct dim_cq_moder - Structure for CQ moderation values. 50 * struct dim_sample - Structure for DIM sample data. 68 * struct dim_stats - Structure for DIM stats. 86 * struct dim - Main structure for dynamic interrupt moderation (DIM). 98 * @steps_right: Number of steps taken towards higher moderation [all …]
|
/openbmc/linux/tools/testing/selftests/drivers/net/mlxsw/ |
H A D | fib_offload.sh | 2 # SPDX-License-Identifier: GPL-2.0 65 num=$(ip -6 route show match ${pfx} | grep "offload" | wc -l) 67 if [ $num -eq $expected_num ]; then 79 ip -6 route add 2001:db8:3::/64 dev $spine_p1 metric 100 83 # Append an identical prefix route with an higher metric and check that 85 ip -6 route append 2001:db8:3::/64 dev $spine_p1 metric 200 93 ip -6 route append 2001:db8:3::/64 dev $spine_p1 metric 10 103 ip -6 route flush 2001:db8:3::/64 dev $spine_p1 104 ip -6 route add 2001:db8:3::/64 dev $spine_p2 109 ip -6 route flush 2001:db8:3::/64 [all …]
|
/openbmc/u-boot/board/nokia/rx51/ |
H A D | lowlevel_init.S | 1 /* SPDX-License-Identifier: GPL-2.0+ */ 3 * (C) Copyright 2011-2012 12 startaddr: /* address of u-boot after copying */ 21 kernoffs: /* offset of kernel image in loaded u-boot */ 33 * Copy u-boot to address CONFIG_SYS_TEXT_BASE 34 * Return to copied u-boot address 45 adr r0, relocaddr /* r0 - address of section relocaddr */ 46 ldr r1, relocaddr /* r1 - address of relocaddr after relocation */ 49 /* r4 - calculated offset */ 53 /* r0 - start of kernel before */ [all …]
|
/openbmc/linux/arch/arm/kernel/ |
H A D | perf_callchain.c | 1 // SPDX-License-Identifier: GPL-2.0 16 * The registers we're interested in are at the end of the variable 17 * length saved register structure. The fp points at the end of this 19 * (struct frame_tail *)(xxx->fp)-1 54 * (towards higher addresses). in user_backtrace() 59 return buftail.fp - 1; in user_backtrace() 67 perf_callchain_store(entry, regs->ARM_pc); in perf_callchain_user() 69 if (!current->mm) in perf_callchain_user() 72 tail = (struct frame_tail __user *)regs->ARM_fp - 1; in perf_callchain_user() 74 while ((entry->nr < entry->max_stack) && in perf_callchain_user()
|
/openbmc/u-boot/common/init/ |
H A D | board_init.c | 1 // SPDX-License-Identifier: GPL-2.0+ 3 * Code shared between SPL and U-Boot proper 35 * - GD is aligned down on a 16-byte boundary 37 * - the early malloc arena is not aligned, therefore it follows the stack 40 * - GD is allocated last, so that the return value of this functions is 49 top -= CONFIG_VAL(SYS_MALLOC_F_LEN); in board_init_f_alloc_reserve() 52 top = rounddown(top-sizeof(struct global_data), 16); in board_init_f_alloc_reserve() 64 * to base+size-1 (where 'size' is the value returned by the allocation 80 * - through gd_ptr if before the call to arch_setup_gd(); 82 * - through gd once arch_setup_gd() has been called. [all …]
|
/openbmc/linux/arch/powerpc/platforms/powermac/ |
H A D | pci.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 5 * Copyright (C) 2003-2005 Benjamin Herrenschmuidt (benh@kernel.crashing.org) 21 #include <asm/pci-bridge.h> 25 #include <asm/ppc-pci.h> 37 /* XXX Could be per-controller, but I don't think we risk anything by 60 static int __init fixup_one_level_bus_range(struct device_node *node, int higher) in fixup_one_level_bus_range() argument 62 for (; node; node = node->sibling) { in fixup_one_level_bus_range() 67 /* For PCI<->PCI bridges or CardBus bridges, we go down */ in fixup_one_level_bus_range() 68 class_code = of_get_property(node, "class-code", NULL); in fixup_one_level_bus_range() 72 bus_range = of_get_property(node, "bus-range", &len); in fixup_one_level_bus_range() [all …]
|
/openbmc/linux/Documentation/mm/ |
H A D | zsmalloc.rst | 7 never attempts higher order page allocation which is very likely to 9 (0-order) pages, it would suffer from very high fragmentation -- 13 To overcome these issues, zsmalloc allocates a bunch of 0-order pages 15 pages act as a single higher-order page i.e. an object can span 0-order 21 worst case, page is incompressible and is thus stored "as-is" i.e. in 29 issues on 32-bit systems where the VA region for kernel space mappings 85 the number of 0-order pages to make a zspage 99 Each zspage can contain up to ZSMALLOC_CHAIN_SIZE physical (0-order) pages. 116 Size classes #95-99 are merged with size class #100. This means that when we 117 need to store an object of size, say, 1568 bytes, we end up using size class [all …]
|
/openbmc/linux/Documentation/arch/arm64/ |
H A D | memory.rst | 12 with the 4KB page configuration, allowing 39-bit (512GB) or 48-bit 14 64KB pages, only 2 levels of translation tables, allowing 42-bit (4TB) 24 mappings while the user pgd contains only user (non-global) mappings. 29 AArch64 Linux memory layout with 4KB pages + 4 levels (48-bit):: 31 Start End Size Use 32 ----------------------------------------------------------------------- 46 AArch64 Linux memory layout with 64KB pages + 3 levels (52-bit with HW support):: 48 Start End Size Use 49 ----------------------------------------------------------------------- 65 +--------+--------+--------+--------+--------+--------+--------+--------+ [all …]
|
/openbmc/linux/drivers/staging/greybus/ |
H A D | gb-camera.h | 1 /* SPDX-License-Identifier: GPL-2.0 */ 10 #include <linux/v4l2-mediabus.h> 18 * struct gb_camera_stream - Represents greybus camera stream. 26 * that all data between the Frame Start and Frame End packet for 40 * struct gb_camera_csi_params - CSI configuration parameters 50 * struct gb_camera_ops - Greybus camera operations, used by the Greybus camera 72 * returns its CSI-2 bus parameters in the 'csi_params' 76 * and higher than the IDs of all the previously submitted requests. 86 * frames. All queued capture requests with IDs higher than the returned 101 * struct gb_camera_module - Represents greybus camera module. [all …]
|
/openbmc/linux/arch/mips/kernel/ |
H A D | genex.S | 6 * Copyright (C) 1994 - 2000, 2001, 2003 Ralf Baechle 43 END(except_vec3_generic) 75 * load / store will be re-executed. 79 li k1, -4 # Is this ... 103 END(except_vec3_r4000) 127 /* end of rollback region (the region size must be power of two) */ 132 END(__r4k_wait) 201 daddiu k1, %higher(irq_stack) 211 PTR_LI t1, ~(_THREAD_SIZE-1) 231 END(handle_int) [all …]
|
/openbmc/phosphor-led-manager/test/ |
H A D | utest.cpp | 1 #include "led-test-map.hpp" 47 std::set_difference(ledsAssert.begin(), ledsAssert.end(), in TEST_F() 48 refAssert.begin(), refAssert.end(), in TEST_F() 79 std::set_difference(ledsAssert.begin(), ledsAssert.end(), in TEST_F() 80 refAssert.begin(), refAssert.end(), in TEST_F() 111 std::set_difference(ledsAssert.begin(), ledsAssert.end(), in TEST_F() 112 refAssert.begin(), refAssert.end(), in TEST_F() 161 std::set_difference(ledsAssert.begin(), ledsAssert.end(), in TEST_F() 162 refAssert.begin(), refAssert.end(), in TEST_F() 197 std::set_difference(ledsAssert.begin(), ledsAssert.end(), in TEST_F() [all …]
|
/openbmc/linux/drivers/crypto/ |
H A D | omap-aes.h | 1 /* SPDX-License-Identifier: GPL-2.0-only */ 17 #define _calc_walked(inout) (dd->inout##_walk.offset - dd->inout##_sg->offset) 20 * OMAP TRM gives bitfields as start:end, where start is the higher bit 23 #define FLD_MASK(start, end) (((1 << ((start) - (end) + 1)) - 1) << (end)) argument 24 #define FLD_VAL(val, start, end) (((val) << (end)) & FLD_MASK(start, end)) argument 26 #define AES_REG_KEY(dd, x) ((dd)->pdata->key_ofs - \ 28 #define AES_REG_IV(dd, x) ((dd)->pdata->iv_ofs + ((x) * 0x04)) 30 #define AES_REG_CTRL(dd) ((dd)->pdata->ctrl_ofs) 50 #define AES_REG_DATA_N(dd, x) ((dd)->pdata->data_ofs + ((x) * 0x04)) 53 #define AES_REG_REV(dd) ((dd)->pdata->rev_ofs) [all …]
|
/openbmc/linux/Documentation/tools/rtla/ |
H A D | rtla-hwnoise.rst | 1 .. SPDX-License-Identifier: GPL-2.0 4 rtla-hwnoise 6 ------------------------------------------ 7 Detect and quantify hardware-related noise 8 ------------------------------------------ 22 of threads as a consequence, only non-maskable interrupts and hardware-related 38 In the example below, the **rtla hwnoise** tool is set to run on CPUs *1-7* 39 on a system with 8 cores/16 threads with hyper-threading enabled. 41 The tool is set to detect any noise higher than *one microsecond*, 43 end of the session:: [all …]
|
/openbmc/linux/Documentation/block/ |
H A D | bfq-iosched.rst | 5 BFQ is a proportional-share I/O scheduler, with some extra 6 low-latency capabilities. In addition to cgroups support (blkio or io 9 - BFQ guarantees a high system and application responsiveness, and a 10 low latency for time-sensitive applications, such as audio or video 12 - BFQ distributes bandwidth, and not just time, among processes or 19 goal, for a given device, is to achieve the maximum-possible 20 throughput at all times, then do switch off all low-latency heuristics 25 As every I/O scheduler, BFQ adds some overhead to per-I/O-request 27 single-lock-protected, per-request processing time of BFQ---i.e., the 29 completion hooks---is, e.g., 1.9 us on an Intel Core i7-2760QM@2.40GHz [all …]
|
/openbmc/phosphor-ipmi-flash/bmc/ |
H A D | buildjson.hpp | 29 "/usr/share/phosphor-ipmi-flash", 30 "/run/phosphor-ipmi-flash", 54 std::move(tmp.begin(), tmp.end(), std::back_inserter(ret)); in buildHandlerConfigsFromDefaultPaths() 62 * @param[in] directory - the directory to search (recursively). 88 std::move(configs.begin(), configs.end(), in buildHandlerConfigs() 106 * should be handled at a higher layer. 108 * @param[in] data - json data from a json file.
|
/openbmc/linux/Documentation/admin-guide/mm/damon/ |
H A D | lru_sort.rst | 1 .. SPDX-License-Identifier: GPL-2.0 4 DAMON-based LRU-lists Sorting 7 DAMON-based LRU-lists Sorting (DAMON_LRU_SORT) is a static kernel module that 9 (de)prioritization of pages on their LRU-lists for making LRU-lists a more 12 Where Proactive LRU-lists Sorting is Required? 15 As page-granularity access checking overhead could be significant on huge 23 Because DAMON can identify access patterns of best-effort accuracy while 24 inducing only user-specified range of overhead, proactively running 32 rates that higher than a user-specified threshold) and cold pages (pages of 34 user-specified threshold) using DAMON, and prioritizes hot pages while [all …]
|
/openbmc/linux/arch/mips/cavium-octeon/executive/ |
H A D | cvmx-pko.c | 7 * Copyright (c) 2003-2008 Cavium Networks 14 * AS-IS and WITHOUT ANY WARRANTY; without even the implied warranty 21 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 26 ***********************license end**************************************/ 34 #include <asm/octeon/cvmx-config.h> 35 #include <asm/octeon/cvmx-pko.h> 36 #include <asm/octeon/cvmx-helper.h> 64 return -1; in __cvmx_pko_int() 85 config.s.tail = (queue == (num_queues - 1)); in __cvmx_pko_iport_config() 95 (CVMX_FPA_OUTPUT_BUFFER_POOL_SIZE - in __cvmx_pko_iport_config() [all …]
|