Home
last modified time | relevance | path

Searched full:node (Results 1 – 25 of 6581) sorted by relevance

12345678910>>...264

/OK3568_Linux_fs/yocto/poky/bitbake/lib/
H A Dcodegen.py58 def to_source(node, indent_with=' ' * 4, add_line_information=False): argument
59 """This function can convert a node tree back into python sourcecode.
77 generator.visit(node)
102 def newline(self, node=None, extra=0): argument
104 if node is not None and self.add_line_information:
105 self.write('# line: %s' % node.lineno)
115 def body_or_else(self, node): argument
116 self.body(node.body)
117 if node.orelse:
120 self.body(node.orelse)
[all …]
/OK3568_Linux_fs/kernel/arch/mips/include/asm/netlogic/xlp-hal/
H A Diomap.h50 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8) argument
53 #define XLP_HDR_OFFSET(node, bus, dev, fn) \ argument
54 XLP_IO_PCI_OFFSET(bus, XLP_IO_DEV(node, dev), fn)
56 #define XLP_IO_BRIDGE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 0) argument
58 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1) argument
59 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 2) argument
60 #define XLP_IO_CIC2_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 3) argument
61 #define XLP_IO_PIC_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 4) argument
63 #define XLP_IO_PCIE_OFFSET(node, i) XLP_HDR_OFFSET(node, 0, 1, i) argument
64 #define XLP_IO_PCIE0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 1, 0) argument
[all …]
/OK3568_Linux_fs/kernel/fs/hfs/
H A Dbnode.c9 * Handle basic btree node operations
18 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
26 off += node->page_offset; in hfs_bnode_read()
31 if (pagenum >= node->tree->pages_per_bnode) in hfs_bnode_read()
33 page = node->page[pagenum]; in hfs_bnode_read()
45 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
49 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
53 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
57 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
61 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
[all …]
H A Dbrec.c18 /* Get the length and offset of the given record in the given node */
19 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) in hfs_brec_lenoff() argument
24 dataoff = node->tree->node_size - (rec + 2) * 2; in hfs_brec_lenoff()
25 hfs_bnode_read(node, retval, dataoff, 4); in hfs_brec_lenoff()
31 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) in hfs_brec_keylen() argument
35 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) in hfs_brec_keylen()
38 if ((node->type == HFS_NODE_INDEX) && in hfs_brec_keylen()
39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { in hfs_brec_keylen()
40 if (node->tree->attributes & HFS_TREE_BIGKEYS) in hfs_brec_keylen()
41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
[all …]
/OK3568_Linux_fs/kernel/scripts/dtc/
H A Dchecks.c29 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
62 struct node *node, in check_msg() argument
76 else if (node && node->srcpos) in check_msg()
77 pos = node->srcpos; in check_msg()
92 if (node) { in check_msg()
94 xasprintf_append(&str, "%s:%s: ", node->fullpath, prop->name); in check_msg()
96 xasprintf_append(&str, "%s: ", node->fullpath); in check_msg()
106 pos = node->srcpos; in check_msg()
119 #define FAIL(c, dti, node, ...) \ argument
123 check_msg((c), dti, node, NULL, __VA_ARGS__); \
[all …]
H A Dlivetree.c88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = name; in name_node()
125 return node; in name_node()
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
[all …]
/OK3568_Linux_fs/u-boot/scripts/dtc/
H A Dlivetree.c100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
[all …]
H A Dchecks.c43 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
99 static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) in check_nodes_props() argument
101 struct node *child; in check_nodes_props()
103 TRACE(c, "%s", node->fullpath); in check_nodes_props()
105 c->fn(c, dti, node); in check_nodes_props()
107 for_each_child(node, child) in check_nodes_props()
113 struct node *dt = dti->dt; in run_check()
157 struct node *node) in check_always_fail() argument
164 struct node *node) in check_is_string() argument
169 prop = get_property(node, propname); in check_is_string()
[all …]
/OK3568_Linux_fs/u-boot/drivers/core/
H A Dofnode.c19 int ofnode_read_u32(ofnode node, const char *propname, u32 *outp) in ofnode_read_u32() argument
21 assert(ofnode_valid(node)); in ofnode_read_u32()
24 if (ofnode_is_np(node)) { in ofnode_read_u32()
25 return of_read_u32(ofnode_to_np(node), propname, outp); in ofnode_read_u32()
30 cell = fdt_getprop(gd->fdt_blob, ofnode_to_offset(node), in ofnode_read_u32()
43 int ofnode_read_u32_default(ofnode node, const char *propname, u32 def) in ofnode_read_u32_default() argument
45 assert(ofnode_valid(node)); in ofnode_read_u32_default()
46 ofnode_read_u32(node, propname, &def); in ofnode_read_u32_default()
51 int ofnode_read_s32_default(ofnode node, const char *propname, s32 def) in ofnode_read_s32_default() argument
53 assert(ofnode_valid(node)); in ofnode_read_s32_default()
[all …]
/OK3568_Linux_fs/kernel/scripts/gdb/linux/
H A Drbtree.py15 node = root.address.cast(rb_root_type.get_type().pointer())
19 node = root['rb_node']
20 if node == 0:
23 while node['rb_left']:
24 node = node['rb_left']
26 return node
31 node = root.address.cast(rb_root_type.get_type().pointer())
35 node = root['rb_node']
36 if node == 0:
39 while node['rb_right']:
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dtree.h132 /* Nonzero if NODE represents an exceptional code. */
134 #define EXCEPTIONAL_CLASS_P(NODE)\ argument
135 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
137 /* Nonzero if NODE represents a constant. */
139 #define CONSTANT_CLASS_P(NODE)\ argument
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
142 /* Nonzero if NODE represents a constant, or is a location wrapper
143 around such a node. */
145 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\ argument
146 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dtree.h132 /* Nonzero if NODE represents an exceptional code. */
134 #define EXCEPTIONAL_CLASS_P(NODE)\ argument
135 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_exceptional)
137 /* Nonzero if NODE represents a constant. */
139 #define CONSTANT_CLASS_P(NODE)\ argument
140 (TREE_CODE_CLASS (TREE_CODE (NODE)) == tcc_constant)
142 /* Nonzero if NODE represents a constant, or is a location wrapper
143 around such a node. */
145 #define CONSTANT_CLASS_OR_WRAPPER_P(NODE)\ argument
146 (CONSTANT_CLASS_P (tree_strip_any_location_wrapper (NODE)))
[all …]
/OK3568_Linux_fs/kernel/fs/hfsplus/
H A Dbnode.c9 * Handle basic btree node operations
21 /* Copy a specified range of bytes from the raw data of a node */
22 void hfs_bnode_read(struct hfs_bnode *node, void *buf, int off, int len) in hfs_bnode_read() argument
27 off += node->page_offset; in hfs_bnode_read()
28 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bnode_read()
43 u16 hfs_bnode_read_u16(struct hfs_bnode *node, int off) in hfs_bnode_read_u16() argument
47 hfs_bnode_read(node, &data, off, 2); in hfs_bnode_read_u16()
51 u8 hfs_bnode_read_u8(struct hfs_bnode *node, int off) in hfs_bnode_read_u8() argument
55 hfs_bnode_read(node, &data, off, 1); in hfs_bnode_read_u8()
59 void hfs_bnode_read_key(struct hfs_bnode *node, void *key, int off) in hfs_bnode_read_key() argument
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Dbootconfig.h39 /* XBC tree node */
56 /* Node tree access raw APIs */
58 int __init xbc_node_index(struct xbc_node *node);
59 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node);
60 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node);
61 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node);
62 const char * __init xbc_node_get_data(struct xbc_node *node);
65 * xbc_node_is_value() - Test the node is a value node
66 * @node: An XBC node.
68 * Test the @node is a value node and return true if a value node, false if not.
[all …]
/OK3568_Linux_fs/kernel/lib/
H A Dbootconfig.c21 * xbc_parse() parses the text to build a simple tree. Each tree node is
22 * simply a key word or a value. A key node may have a next key node or/and
23 * a child node (both key and value). A value node may have a next value
24 * node (for array).
46 * xbc_root_node() - Get the root node of extended boot config
48 * Return the address of root node of extended boot config. If the
60 * xbc_node_index() - Get the index of XBC node
61 * @node: A target node of getting index.
63 * Return the index number of @node in XBC node list.
65 int __init xbc_node_index(struct xbc_node *node) in xbc_node_index() argument
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/share/info/
H A Dlibc.info2125 Node: Top79807
2126 Node: Introduction143783
2127 Node: Getting Started145132
2128 Node: Standards and Portability146613
2129 Node: ISO C148068
2130 Node: POSIX149620
2131 Node: POSIX Safety Concepts151721
2132 Node: Unsafe Features157502
2133 Node: Conditionally Safe Features162163
2134 Node: Other Safety Remarks173677
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/share/info/
H A Dlibc.info2125 Node: Top79807
2126 Node: Introduction143783
2127 Node: Getting Started145132
2128 Node: Standards and Portability146613
2129 Node: ISO C148068
2130 Node: POSIX149620
2131 Node: POSIX Safety Concepts151721
2132 Node: Unsafe Features157502
2133 Node: Conditionally Safe Features162163
2134 Node: Other Safety Remarks173677
[all …]
/OK3568_Linux_fs/u-boot/include/dm/
H A Dofnode.h21 * ofnode - reference to a device tree node
35 * There is no ambiguity as to whether ofnode holds an offset or a node
36 * pointer: when the live tree is active it holds a node pointer, otherwise it
38 * the same value could point to a valid device node or a valid offset. We
47 * @np: Pointer to device node, used for live tree
49 * is not a really a pointer to a node: it is an offset value. See above.
57 ofnode node; member
63 * ofprop - reference to a property of a device tree node
65 * This struct hold the reference on one property of one node,
74 * @node: Pointer to device node
[all …]
/OK3568_Linux_fs/kernel/kernel/gcov/
H A Dfs.c33 * @list: list head for child node list
36 * @parent: parent node
141 * Return a profiling data set associated with the given node. This is
145 static struct gcov_info *get_node_info(struct gcov_node *node) in get_node_info() argument
147 if (node->num_loaded > 0) in get_node_info()
148 return node->loaded_info[0]; in get_node_info()
150 return node->unloaded_info; in get_node_info()
155 * all profiling data associated with the given node.
157 static struct gcov_info *get_accumulated_info(struct gcov_node *node) in get_accumulated_info() argument
162 if (node->unloaded_info) in get_accumulated_info()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/cp/
H A Dcp-tree.h43 /* A tree node, together with a location, so that we can track locations
46 The location is redundant for node kinds that have locations,
47 but not all node kinds do (e.g. constants, and references to
365 /* A node which matches any template argument. */
371 /* Node to indicate default access. This must be distinct from the
556 The BV_DELTA of each node gives the amount by which to adjust the
562 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
588 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \ argument
589 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
591 #define TYPE_FUNCTION_OR_TEMPLATE_DECL_CHECK(NODE) \ argument
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/cp/
H A Dcp-tree.h43 /* A tree node, together with a location, so that we can track locations
46 The location is redundant for node kinds that have locations,
47 but not all node kinds do (e.g. constants, and references to
365 /* A node which matches any template argument. */
371 /* Node to indicate default access. This must be distinct from the
556 The BV_DELTA of each node gives the amount by which to adjust the
562 The BV_VCALL_INDEX of each node, if non-NULL, gives the vtable
588 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \ argument
589 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
591 #define TYPE_FUNCTION_OR_TEMPLATE_DECL_CHECK(NODE) \ argument
[all …]
/OK3568_Linux_fs/yocto/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js9 var $, Node, Tree, methods;
13 Node = (function() { class
14 function Node(row, tree, settings) { class in anonymousFunction75f42a160100.Node
38 Node.prototype.addChild = function(child) { class
42 Node.prototype.ancestors = function() {
43 var ancestors, node;
44 node = this;
46 while (node = node.parentNode()) {
47 ancestors.push(node);
52 Node.prototype.collapse = function() {
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireguard/
H A Dallowedips.c23 static void copy_and_assign_cidr(struct allowedips_node *node, const u8 *src, in copy_and_assign_cidr() argument
26 node->cidr = cidr; in copy_and_assign_cidr()
27 node->bit_at_a = cidr / 8U; in copy_and_assign_cidr()
29 node->bit_at_a ^= (bits / 8U - 1U) % 8U; in copy_and_assign_cidr()
31 node->bit_at_b = 7U - (cidr % 8U); in copy_and_assign_cidr()
32 node->bitlen = bits; in copy_and_assign_cidr()
33 memcpy(node->bits, src, bits / 8U); in copy_and_assign_cidr()
36 static inline u8 choose(struct allowedips_node *node, const u8 *key) in choose() argument
38 return (key[node->bit_at_a] >> node->bit_at_b) & 1; in choose()
58 struct allowedips_node *node, *stack[MAX_ALLOWEDIPS_BITS] = { in root_free_rcu() local
[all …]
/OK3568_Linux_fs/kernel/arch/ia64/mm/
H A Ddiscontig.c33 * Track per-node information needed to setup the boot memory allocator, the
34 * per-node areas, and the real VM.
50 * To prevent cache aliasing effects, align per-node structures so that they
51 * start at addresses that are strided by node number.
54 #define NODEDATA_ALIGN(addr, node) \ argument
56 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1)))
59 * build_node_maps - callback to setup mem_data structs for each node
62 * @node: node where this range resides
65 * treat as a virtually contiguous block (i.e. each node). Each such block
71 int node) in build_node_maps() argument
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep.cpp55 Node* node = &PointEvent(tcx, point); in SweepPoints() local
57 EdgeEvent(tcx, point.edge_list[i], node); in SweepPoints()
75 Node& Sweep::PointEvent(SweepContext& tcx, Point& point) in PointEvent()
77 Node& node = tcx.LocateNode(point); in PointEvent() local
78 Node& new_node = NewFrontTriangle(tcx, point, node); in PointEvent()
81 // x value than node due to how we fetch nodes from the front in PointEvent()
82 if (point.x <= node.point->x + EPSILON) { in PointEvent()
83 Fill(tcx, node); in PointEvent()
92 void Sweep::EdgeEvent(SweepContext& tcx, Edge* edge, Node* node) in EdgeEvent() argument
97 if (IsEdgeSideOfTriangle(*node->triangle, *edge->p, *edge->q)) { in EdgeEvent()
[all …]

12345678910>>...264