| /third_party/node/test/fixtures/snapshot/ |
| H A D | typescript.js | 2779 function assertEachNode(nodes, test, message, stackCrawlMark) { 2781 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode); 4341 // Parse tree nodes 4500 // Top-level nodes 4505 // JSDoc nodes 4548 // Transformation nodes 4922 // Build symbol name using any nodes needed, instead of just components of an entity name 7130 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) { [all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | maple_tree.c | 13 * pivots. In the case of dense nodes, the pivots are implied by the position 23 * The following illustrates the layout of a range64 nodes slots and pivots. 39 * Internal (non-leaf) nodes contain pointers to other nodes. 40 * Leaf nodes contain entries. 71 * * MA_STATE_PREALLOC - Preallocated nodes, WARN_ON allocation 145 struct ma_topiary *free; /* nodes to be freed */ 163 static inline int mt_alloc_bulk(gfp_t gfp, size_t size, void **nodes) in mt_alloc_bulk() argument 165 return kmem_cache_alloc_bulk(maple_node_cache, gfp, size, nodes); in mt_alloc_bulk() 168 static inline void mt_free_bulk(size_t size, void __rcu **nodes) in mt_free_bulk() argument [all...] |
| /device/soc/rockchip/common/sdk_linux/kernel/sched/ |
| H A D | fair.c | 1355 * between these nodes are slowed down, to allow things to settle down. 1364 /* Handle placement on systems where not all nodes are directly connected. */ 1371 * All nodes are directly connected, and the same distance in score_nearby_nodes() 1380 * which should be ok given the number of nodes rarely exceeds 8. in score_nearby_nodes() 1387 * The furthest away nodes in the system are not interesting in score_nearby_nodes() 1396 * of nodes, and move tasks towards the group with the most in score_nearby_nodes() 1397 * memory accesses. When comparing two nodes at distance in score_nearby_nodes() 1398 * "hoplimit", only nodes closer by than "hoplimit" are part in score_nearby_nodes() 1399 * of each group. Skip other nodes. in score_nearby_nodes() 1405 /* Add up the faults from nearby nodes in score_nearby_nodes() 2360 nodemask_t nodes; preferred_group_nid() local [all...] |
| /kernel/linux/linux-5.10/kernel/sched/ |
| H A D | fair.c | 1336 * between these nodes are slowed down, to allow things to settle down. 1345 /* Handle placement on systems where not all nodes are directly connected. */ 1353 * All nodes are directly connected, and the same distance in score_nearby_nodes() 1361 * which should be ok given the number of nodes rarely exceeds 8. in score_nearby_nodes() 1368 * The furthest away nodes in the system are not interesting in score_nearby_nodes() 1376 * of nodes, and move tasks towards the group with the most in score_nearby_nodes() 1377 * memory accesses. When comparing two nodes at distance in score_nearby_nodes() 1378 * "hoplimit", only nodes closer by than "hoplimit" are part in score_nearby_nodes() 1379 * of each group. Skip other nodes. in score_nearby_nodes() 1385 /* Add up the faults from nearby nodes in score_nearby_nodes() 2311 nodemask_t nodes; preferred_group_nid() local [all...] |
| /kernel/linux/linux-6.6/kernel/sched/ |
| H A D | fair.c | 1674 * between these nodes are slowed down, to allow things to settle down. 1683 /* Handle placement on systems where not all nodes are directly connected. */ 1691 * All nodes are directly connected, and the same distance in score_nearby_nodes() 1701 * which should be ok given the number of nodes rarely exceeds 8. in score_nearby_nodes() 1708 * The furthest away nodes in the system are not interesting in score_nearby_nodes() 1716 * of nodes, and move tasks towards the group with the most in score_nearby_nodes() 1717 * memory accesses. When comparing two nodes at distance in score_nearby_nodes() 1718 * "hoplimit", only nodes closer by than "hoplimit" are part in score_nearby_nodes() 1719 * of each group. Skip other nodes. in score_nearby_nodes() 1724 /* Add up the faults from nearby nodes in score_nearby_nodes() 2794 nodemask_t nodes; preferred_group_nid() local [all...] |
| /third_party/mesa3d/src/amd/vulkan/ |
| H A D | radv_device.c | 670 const char *path = drm_device->nodes[DRM_NODE_RENDER]; in radv_physical_device_try_create() 743 master_fd = open(drm_device->nodes[DRM_NODE_PRIMARY], O_RDWR | O_CLOEXEC); in radv_physical_device_try_create() 867 stat(drm_device->nodes[DRM_NODE_PRIMARY], &primary_stat) != 0) { in radv_physical_device_try_create() 870 drm_device->nodes[DRM_NODE_PRIMARY]); in radv_physical_device_try_create() 876 stat(drm_device->nodes[DRM_NODE_RENDER], &render_stat) != 0) { in radv_physical_device_try_create() 879 drm_device->nodes[DRM_NODE_RENDER]); in radv_physical_device_try_create() 1197 fprintf(stderr, "radv: info: Found %d drm nodes.\n", max_devices); in radv_enumerate_physical_devices() 5729 * the root ids of instances. The hardware also needs bvh nodes to in radv_get_buffer_memory_requirements()
|
| /kernel/linux/linux-5.10/fs/jffs2/ |
| H A D | scan.c | 266 pr_notice("Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); in jffs2_scan_medium() 933 /* We can't summarise nodes we don't grok */ in jffs2_scan_eraseblock() 984 ic->nodes = (void *)ic; in jffs2_scan_make_ino_cache()
|
| H A D | wbuf.c | 156 /* It has to have had some nodes or we couldn't be here */ in jffs2_block_refile() 272 /* Recover from failure to write wbuf. Recover the nodes up to the 318 /* All nodes were obsolete. Nothing to recover. */ in jffs2_wbuf_recover() 319 jffs2_dbg(1, "No non-obsolete nodes to be recovered. Just filing block bad\n"); in jffs2_wbuf_recover() 332 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover() 375 /* It wasn't. Go on and try to recover nodes complete in the wbuf */ in jffs2_wbuf_recover() 377 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover() 489 struct jffs2_raw_node_ref **p = &ic->nodes; in jffs2_wbuf_recover()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | lprops.c | 1113 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb() 1160 * nodes from an uncompleted commit due to an in scan_check_cb()
|
| H A D | ubifs.h | 96 * There is no notion of truncation key because truncation nodes do not exist 98 * keys for truncation nodes because the code becomes simpler. So we define 147 /* Maximum number of data nodes to bulk-read */ 237 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes. 293 * @list: list of scanned nodes 314 * @nodes_cnt: number of nodes scanned 315 * @nodes: list of struct ubifs_scan_node 322 struct list_head nodes; member 453 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash) 606 * @nbranch: branches to child nodes [all...] |
| /kernel/linux/linux-6.6/drivers/memory/tegra/ |
| H A D | tegra20-emc.c | 960 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended() 969 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
|
| H A D | tegra124-emc.c | 1295 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended() 1304 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
|
| /kernel/linux/linux-6.6/fs/jffs2/ |
| H A D | scan.c | 266 pr_notice("Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); in jffs2_scan_medium() 933 /* We can't summarise nodes we don't grok */ in jffs2_scan_eraseblock() 984 ic->nodes = (void *)ic; in jffs2_scan_make_ino_cache()
|
| H A D | wbuf.c | 156 /* It has to have had some nodes or we couldn't be here */ in jffs2_block_refile() 272 /* Recover from failure to write wbuf. Recover the nodes up to the 318 /* All nodes were obsolete. Nothing to recover. */ in jffs2_wbuf_recover() 319 jffs2_dbg(1, "No non-obsolete nodes to be recovered. Just filing block bad\n"); in jffs2_wbuf_recover() 332 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover() 375 /* It wasn't. Go on and try to recover nodes complete in the wbuf */ in jffs2_wbuf_recover() 377 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover() 489 struct jffs2_raw_node_ref **p = &ic->nodes; in jffs2_wbuf_recover()
|
| /kernel/linux/linux-6.6/fs/ntfs3/ |
| H A D | ntfs_fs.h | 410 struct indx_node *nodes[20]; member
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | lprops.c | 1113 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb() 1160 * nodes from an uncompleted commit due to an in scan_check_cb()
|
| H A D | ubifs.h | 98 * There is no notion of truncation key because truncation nodes do not exist 100 * keys for truncation nodes because the code becomes simpler. So we define 149 /* Maximum number of data nodes to bulk-read */ 246 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes. 302 * @list: list of scanned nodes 323 * @nodes_cnt: number of nodes scanned 324 * @nodes: list of struct ubifs_scan_node 331 struct list_head nodes; member 462 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash) 615 * @nbranch: branches to child nodes [all...] |
| /third_party/jinja2/ |
| H A D | filters.py | 32 from .nodes import EvalContext
|
| /third_party/mesa3d/src/broadcom/compiler/ |
| H A D | v3d_compiler.h | 817 struct v3d_ra_node_info nodes;
|
| /third_party/mesa3d/src/intel/common/tests/ |
| H A D | mi_builder_test.cpp | 181 fd = open(devices[i]->nodes[DRM_NODE_RENDER], O_RDWR | O_CLOEXEC); in SetUp()
|
| /third_party/skia/third_party/externals/tint/tools/src/cmd/get-test-plan/ |
| H A D | main.go | 117 in addition to nodes containing a nowrap or an algorithm tag eg. <tr algorithm=...>`)
|
| /third_party/typescript/lib/ |
| H A D | typingsInstaller.js | 2634 function assertEachNode(nodes, test, message, stackCrawlMark) { 2636 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode); 4311 // Parse tree nodes 4475 // Top-level nodes 4480 // JSDoc nodes 4524 // Transformation nodes 4920 // Build symbol name using any nodes needed, instead of just components of an entity name 7257 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) { [all...] |
| H A D | tsc.js | 2227 function assertEachNode(nodes, test, message, stackCrawlMark) { 2229 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode); 4640 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) { 12053 function createDiagnosticForNodeArray(sourceFile, nodes, message, arg0, arg1, arg2, arg3) { 12054 var start = ts.skipTrivia(sourceFile.text, nodes.pos); 12055 return createFileDiagnostic(sourceFile, start, nodes.end - start, message, arg0, arg1, arg2, arg3); [all...] |
| /kernel/linux/linux-6.6/fs/f2fs/ |
| H A D | segment.c | 448 unsigned int nodes = get_pages(sbi, F2FS_DIRTY_NODES); in excess_dirty_threshold() local 456 nodes >= threshold || meta >= threshold || in excess_dirty_threshold() 459 return dents + qdata + nodes + meta + imeta > global_threshold; in excess_dirty_threshold()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | disk-io.c | 2126 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in load_global_roots_objectid() 2136 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_global_roots_objectid() 4358 * and then a transaction commit runs the same delayed nodes in close_ctree() 4359 * before any delayed worker has done something with the nodes. in close_ctree() 4983 l = path->nodes[0]; in btrfs_init_root_free_objectid()
|