Home
last modified time | relevance | path

Searched refs:nodes (Results 451 - 475 of 918) sorted by relevance

1...<<11121314151617181920>>...37

/third_party/PyYAML/lib/yaml/
H A D__init__.py6 from .nodes import *
178 def serialize_all(nodes, stream=None, Dumper=Dumper,
200 for node in nodes:
/third_party/node/tools/gyp/tools/
H A Dpretty_vcproj.py39 """Compare function between 2 xml nodes."""
101 """Returns a list of all the node and sub nodes."""
198 # Insert the nodes in the correct order.
212 nodes = []
217 nodes.append(sub_node)
219 return nodes
241 # Look through all the nodes to find a match.
/foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/
H A Dgltf2_exporter.cpp205 vector<Entity> nodes; member
630 // reduce the numer of nodes until one remains (or there are multiple roots) in FindSkeletonRoot()
632 // select a range of nodes at an equal depth in FindSkeletonRoot()
640 // sort again according to updated depths and nodes in FindSkeletonRoot()
671 // gather all the joint nodes in ExportGltfSkins()
675 if (auto const jointIndex = FindHandleIndex(entities.nodes, jointEntity); in ExportGltfSkins()
696 const Entities& entities, array_view<const unique_ptr<Node>> nodes, const Entity trackEntity, in GetAnimationTarget()
701 if (auto const nodeIndex = FindHandleIndex(entities.nodes, static_cast<Entity>(trackComponent.target)); in GetAnimationTarget()
702 nodeIndex < nodes.size()) { in GetAnimationTarget()
703 target = nodes[nodeInde in GetAnimationTarget()
695 GetAnimationTarget(const INodeSystem& nodeSystem, const INameComponentManager& nameManager, const Entities& entities, array_view<const unique_ptr<Node>> nodes, const Entity trackEntity, const AnimationTrackComponent& trackComponent) GetAnimationTarget() argument
[all...]
/base/security/device_security_level/baselib/utils/include/
H A Dutils_state_machine.h51 void ScheduleMachine(const StateNode *nodes, uint32_t nodeCnt, StateMachine *machine, uint32_t event, const void *para);
/foundation/multimodalinput/input/test/facility/virtual_device/include/
H A Dgeneral_device.h46 void GetInputDeviceNodes(std::map<std::string, std::string> &nodes);
/kernel/linux/linux-5.10/drivers/interconnect/qcom/
H A Dbcm-voter.h20 .nodes = { __VA_ARGS__ }, \
/kernel/linux/linux-5.10/drivers/interconnect/imx/
H A Dimx.h57 struct imx_icc_node_desc *nodes,
/kernel/linux/linux-5.10/drivers/staging/rtl8712/
H A Drtl871x_event.h88 struct event_node nodes[C2HEVENT_SZ]; member
/kernel/linux/linux-5.10/drivers/staging/rtl8723bs/include/
H A Drtw_event.h94 struct event_node nodes[C2HEVENT_SZ]; member
/kernel/linux/linux-6.6/drivers/staging/rtl8712/
H A Drtl871x_event.h88 struct event_node nodes[C2HEVENT_SZ]; member
/third_party/node/deps/cares/src/lib/
H A Dares_freeaddrinfo.c66 ares__freeaddrinfo_nodes(ai->nodes); in ares_freeaddrinfo()
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree.c506 * Splits a node by creating a sibling node and shifting half the nodes
593 s->nodes[1] = left; in btree_split_sibling()
596 s->nodes[1] = right; in btree_split_sibling()
1002 struct cursor_node *n = c->nodes + c->depth - 1; in prefetch_values()
1017 struct cursor_node *n = c->nodes + c->depth - 1; in leaf_node()
1026 struct cursor_node *n = c->nodes + c->depth; in push_node()
1049 unlock_block(c->info, c->nodes[c->depth].b); in pop_node()
1061 n = c->nodes + c->depth - 1; in inc_or_backtrack()
1082 n = c->nodes + c->depth - 1; in find_leaf()
1154 struct cursor_node *n = c->nodes in dm_btree_cursor_get_value()
[all...]
/kernel/linux/linux-6.6/drivers/vfio/
H A Dvfio_main.c1001 struct interval_tree_node *nodes; in vfio_ioctl_device_feature_logging_start() local
1026 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in vfio_ioctl_device_feature_logging_start()
1028 if (!nodes) in vfio_ioctl_device_feature_logging_start()
1048 nodes[i].start = range.iova; in vfio_ioctl_device_feature_logging_start()
1049 nodes[i].last = range.iova + range.length - 1; in vfio_ioctl_device_feature_logging_start()
1050 if (interval_tree_iter_first(&root, nodes[i].start, in vfio_ioctl_device_feature_logging_start()
1051 nodes[i].last)) { in vfio_ioctl_device_feature_logging_start()
1056 interval_tree_insert(nodes + i, &root); in vfio_ioctl_device_feature_logging_start()
1070 kfree(nodes); in vfio_ioctl_device_feature_logging_start()
/kernel/linux/linux-5.10/arch/powerpc/oprofile/cell/
H A Dspu_task_sync.c447 int nodes = 0; in number_of_online_nodes() local
450 if (tmp > nodes) in number_of_online_nodes()
451 nodes++; in number_of_online_nodes()
453 return nodes; in number_of_online_nodes()
/kernel/linux/linux-5.10/drivers/net/wireless/ath/ath9k/
H A Ddynack.c130 list_for_each_entry(an, &da->nodes, list) in ath_dynack_compute_ackto()
329 list_add_tail(&an->list, &da->nodes); in ath_dynack_node_init()
370 list_for_each_entry(an, &da->nodes, list) in ath_dynack_reset()
392 INIT_LIST_HEAD(&da->nodes); in ath_dynack_init()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dxattr.c48 leaf = path->nodes[0]; in btrfs_getxattr()
141 btrfs_assert_tree_locked(path->nodes[0]); in btrfs_setxattr()
169 struct extent_buffer *leaf = path->nodes[0]; in btrfs_setxattr()
310 leaf = path->nodes[0]; in btrfs_listxattr()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dverity.c150 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in drop_verity_items()
258 leaf = path->nodes[0]; in write_key_bytes()
336 leaf = path->nodes[0]; in read_key_bytes()
393 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in read_key_bytes()
H A Dxattr.c52 leaf = path->nodes[0]; in btrfs_getxattr()
145 btrfs_assert_tree_write_locked(path->nodes[0]); in btrfs_setxattr()
173 struct extent_buffer *leaf = path->nodes[0]; in btrfs_setxattr()
310 leaf = path->nodes[0]; in btrfs_listxattr()
/kernel/linux/linux-6.6/drivers/net/wireless/ath/ath9k/
H A Ddynack.c129 list_for_each_entry(an, &da->nodes, list) in ath_dynack_compute_ackto()
332 list_add_tail(&an->list, &da->nodes); in ath_dynack_node_init()
373 list_for_each_entry(an, &da->nodes, list) in ath_dynack_reset()
395 INIT_LIST_HEAD(&da->nodes); in ath_dynack_init()
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dicc-rpm.c295 * qcom_icc_bus_aggregate - calculate bus clock rates by traversing all nodes
307 * Iterate nodes on the provider, aggregate bandwidth requests for in qcom_icc_bus_aggregate()
310 list_for_each_entry(node, &provider->nodes, node_list) { in qcom_icc_bus_aggregate()
423 qnodes = desc->nodes; in qnoc_probe()
456 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), in qnoc_probe()
546 data->nodes[i] = node; in qnoc_probe()
/third_party/node/deps/v8/third_party/jinja2/
H A Didtracking.py10 def find_symbols(nodes, parent_symbols=None):
13 for node in nodes:
230 def inner_visit(nodes):
232 for subnode in nodes:
/third_party/node/tools/gyp/pylib/gyp/
H A Dcommon.py588 def __init__(self, nodes):
589 self.nodes = nodes
592 return "CycleError: cycle involving: " + str(self.nodes)
/third_party/node/tools/inspector_protocol/jinja2/
H A Didtracking.py11 def find_symbols(nodes, parent_symbols=None):
14 for node in nodes:
226 def inner_visit(nodes):
228 for subnode in nodes:
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dcommon.py582 def __init__(self, nodes):
583 self.nodes = nodes
586 return "CycleError: cycle involving: " + str(self.nodes)
/third_party/skia/third_party/externals/jinja2/
H A Didtracking.py10 def find_symbols(nodes, parent_symbols=None):
13 for node in nodes:
230 def inner_visit(nodes):
232 for subnode in nodes:

Completed in 19 milliseconds

1...<<11121314151617181920>>...37