| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | zoned.c | 313 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in calculate_emulated_zone_size()
324 leaf = path->nodes[0]; in calculate_emulated_zone_size()
1265 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]); in calculate_alloc_pointer()
|
| H A D | free-space-cache.c | 104 leaf = path->nodes[0]; in __lookup_free_space_inode()
182 leaf = path->nodes[0]; in __create_free_space_inode()
211 leaf = path->nodes[0]; in __create_free_space_inode()
768 leaf = path->nodes[0]; in __load_free_space_cache()
1166 leaf = path->nodes[0]; in update_cache_item()
2804 * Since the allocation info of tree-log nodes are not recorded in btrfs_remove_free_space()
2811 * Advance the pointer not to overwrite the tree-log nodes. in btrfs_remove_free_space()
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | scheduler.cc | 54 // Reserve 10% more space for nodes if node splitting is enabled to try to in ComputeSchedule()
90 // Nothing to do for control nodes that have been already fixed in in InitializePlacement()
110 // Control nodes that were not control-reachable from end may float. in InitializePlacement()
126 // We only update control nodes from {kUnknown} to {kFixed}. Ideally, we in UpdatePlacement()
152 // Control nodes force coupled uses to be placed. in UpdatePlacement()
187 // Tracking use counts for fixed nodes is useless. in IncrementUnscheduledUseCount()
190 // Use count for coupled nodes is summed up on their control. in IncrementUnscheduledUseCount()
206 // Tracking use counts for fixed nodes is useless. in DecrementUnscheduledUseCount()
209 // Use count for coupled nodes is summed up on their control. in DecrementUnscheduledUseCount()
252 // basic blocks for control nodes
[all...] |
| /third_party/mesa3d/src/virtio/vulkan/ |
| H A D | vn_renderer_virtgpu.c | 1596 name = dev->nodes[i]; in virtgpu_open_device()
1605 const char *primary_path = dev->nodes[DRM_NODE_PRIMARY]; in virtgpu_open_device()
1606 const char *node_path = dev->nodes[DRM_NODE_RENDER]; in virtgpu_open_device()
|
| /third_party/selinux/libsepol/cil/src/ |
| H A D | cil_copy_ast.c | 2029 if (orig->flavor == CIL_BLOCK && DATUM(data)->nodes->head != NULL) { in __cil_copy_node_helper()
2036 cil_list_append(DATUM(new->data)->nodes, CIL_NODE, new); in __cil_copy_node_helper()
2039 if (DATUM(data)->nodes->head && FLAVOR(data) != orig->flavor) { in __cil_copy_node_helper()
|
| /kernel/linux/linux-5.10/sound/pci/hda/ |
| H A D | patch_hdmi.c | 1983 int i, nodes; in hdmi_parse_codec() local
1986 nodes = snd_hda_get_sub_nodes(codec, codec->core.afg, &start_nid); in hdmi_parse_codec()
1987 if (!start_nid || nodes < 0) { in hdmi_parse_codec()
1988 codec_warn(codec, "HDMI: failed to get afg sub nodes\n"); in hdmi_parse_codec()
2001 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
2014 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | free-space-cache.c | 73 leaf = path->nodes[0]; in __lookup_free_space_inode()
155 leaf = path->nodes[0]; in __create_free_space_inode()
184 leaf = path->nodes[0]; in __create_free_space_inode()
701 leaf = path->nodes[0]; in __load_free_space_cache()
1040 leaf = path->nodes[0]; in update_cache_item()
|
| /kernel/linux/linux-6.6/sound/pci/hda/ |
| H A D | patch_hdmi.c | 2009 int i, nodes; in hdmi_parse_codec() local
2012 nodes = snd_hda_get_sub_nodes(codec, codec->core.afg, &start_nid); in hdmi_parse_codec()
2013 if (!start_nid || nodes < 0) { in hdmi_parse_codec()
2014 codec_warn(codec, "HDMI: failed to get afg sub nodes\n"); in hdmi_parse_codec()
2030 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
2043 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
|
| /base/msdp/device_status/services/interaction/drag/include/ |
| H A D | drag_drawing.h | 216 std::vector<std::shared_ptr<Rosen::RSCanvasNode>> nodes; member
|
| /device/soc/rockchip/common/kernel/drivers/net/wireless/rockchip_wlan/rkwifi/bcmdhd_wifi6/ |
| H A D | dhd_wlfc.h | 533 /** table for individual nodes */
534 wlfc_mac_descriptor_t nodes[WLFC_MAC_DESC_TABLE_SIZE]; member
|
| /foundation/arkui/ace_engine/frameworks/core/components_ng/manager/drag_drop/ |
| H A D | drag_drop_manager.h | 240 void NotifyDragRegisterFrameNode(std::unordered_map<int32_t, WeakPtr<FrameNode>> nodes, DragEventType dragEventType,
|
| /kernel/linux/linux-5.10/drivers/acpi/acpica/ |
| H A D | aclocal.h | 1211 u32 nodes; member
|
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| H A D | bcache.h | 63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes ar
476 size_t nodes; global() member
[all...] |
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | log.c | 349 * reference nodes for all journal heads which will define new journal after
350 * the commit has been finished. The commit start and reference nodes are
637 * needed for commit. This function rewrites the reference nodes in the log
638 * omitting duplicates, and failed CS nodes, and leaving no gaps.
663 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
|
| /kernel/linux/linux-6.6/drivers/memory/tegra/ |
| H A D | tegra20.c | 400 list_for_each_entry(node, &mc->provider.nodes, node_list) { in tegra20_mc_of_icc_xlate_extended()
|
| /kernel/linux/linux-6.6/drivers/acpi/acpica/ |
| H A D | aclocal.h | 1228 u32 nodes; member
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | log.c | 349 * reference nodes for all journal heads which will define new journal after
350 * the commit has been finished. The commit start and reference nodes are
637 * needed for commit. This function rewrites the reference nodes in the log
638 * omitting duplicates, and failed CS nodes, and leaving no gaps.
663 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
|
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| H A D | bcache.h | 63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes ar
482 size_t nodes; global() member
[all...] |
| /test/xts/hats/ai/nnrt/hdi/v1_0/nnrtFunctionTest/src/ |
| H A D | hdi_model_prepare_test.cpp | 245 * @tc.name : 编译模型，model中nodes为空
257 // set nodes to empty in HWTEST_F()
258 iModel->nodes = {}; in HWTEST_F()
260 // prepare model with empty nodes in HWTEST_F()
|
| /third_party/curl/lib/ |
| H A D | asyn-ares.c | 749 res->temp_ai = ares2addr(result->nodes); in addrinfo_cb()
|
| /third_party/node/deps/v8/third_party/jinja2/ |
| H A D | runtime.py | 23 from .nodes import EvalContext
|
| H A D | nodes.py | 2 """AST nodes generated by the parser for the compiler. Also provides
4 to normalize nodes.
45 """A metaclass for nodes that handles the field and attribute
95 """Baseclass for all Jinja nodes. There are a number of nodes available
100 - :class:`Helper`: helper nodes
103 All nodes have fields and attributes. Fields may be other nodes, lists,
108 all nodes automatically.
117 raise TypeError("abstract nodes ar
[all...] |
| /third_party/node/tools/inspector_protocol/jinja2/ |
| H A D | nodes.py | 3 jinja2.nodes
6 This module implements additional nodes derived from the ast base node.
10 python and jinja nodes.
60 """A metaclass for nodes that handles the field and attribute
108 """Baseclass for all Jinja2 nodes. There are a number of nodes available
113 - :class:`Helper`: helper nodes
116 All nodes have fields and attributes. Fields may be other nodes, lists,
121 all nodes automaticall
[all...] |
| H A D | runtime.py | 16 from jinja2.nodes import EvalContext, _context_function_types
|
| /third_party/skia/third_party/externals/jinja2/ |
| H A D | nodes.py | 2 """AST nodes generated by the parser for the compiler. Also provides
4 to normalize nodes.
45 """A metaclass for nodes that handles the field and attribute
95 """Baseclass for all Jinja nodes. There are a number of nodes available
100 - :class:`Helper`: helper nodes
103 All nodes have fields and attributes. Fields may be other nodes, lists,
108 all nodes automatically.
117 raise TypeError("abstract nodes ar
[all...] |