Home
last modified time | relevance | path

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

12345678910>>...174

/freebsd/contrib/llvm-project/llvm/include/llvm/Demangle/
H A DItaniumNodes.def9 // Define the demangler's node names
11 #ifndef NODE
12 #error Define NODE to handle nodes
15 NODE(NodeArrayNode)
16 NODE(DotSuffix)
17 NODE(VendorExtQualType)
18 NODE(QualType)
19 NODE(ConversionOperatorType)
20 NODE(PostfixQualifiedType)
21 NODE(ElaboratedTypeSpefTyp
[all...]
/freebsd/contrib/one-true-awk/
H A Dproto.h27 extern int constnode(Node *);
28 extern char *strnode(Node *);
29 extern Node *notnull(Node *);
41 extern void penter(Node *);
42 extern void freetr(Node *);
46 extern void cfoll(fa *, Node *);
47 extern int first(Node *);
48 extern void follow(Node *);
54 extern Node *reparse(const char *);
55 extern Node *regexp(void);
[all …]
H A Dparse.c32 Node *nodealloc(size_t n) in nodealloc()
34 Node *x; in nodealloc()
36 x = (Node *) malloc(sizeof(*x) + (n-1) * sizeof(x)); in nodealloc()
44 Node *exptostat(Node *a) in exptostat()
50 Node *node1(int a, Node *b) in node1()
52 Node *x; in node1()
60 Node *node2(int a, Node *b, Node *c) in node2()
62 Node *x; in node2()
71 Node *node3(int a, Node *b, Node *c, Node *d) in node3()
73 Node *x; in node3()
[all …]
/freebsd/sys/dev/ocs_fc/
H A Docs_node.c34 * OCS driver remote node handler. This file contains code that is shared
39 * @defgroup node_common Node common support
40 * @defgroup node_alloc Node allocation
53 io->node->display_name, SCSI_IOFMT_ARGS(io), ##__VA_ARGS__)
55 void ocs_mgmt_node_list(ocs_textbuf_t *textbuf, void *node);
56 void ocs_mgmt_node_get_all(ocs_textbuf_t *textbuf, void *node);
57 int ocs_mgmt_node_get(ocs_textbuf_t *textbuf, char *parent, char *name, void *node);
58 int ocs_mgmt_node_set(char *parent, char *name, char *value, void *node);
60 void *arg_out, uint32_t arg_out_length, void *node);
71 * @brief Device node state machine wait for all ELS's to
[all …]
H A Docs_device.c38 @defgroup device_sm Node State Machine: Remote Device States
68 ocs_node_t *node = io->node; in ocs_d_send_prli_rsp() local
71 if (ocs->fc_type != node->fc_type) { in ocs_d_send_prli_rsp()
72 node_printf(node, "PRLI rejected by target-server, fc-type not supported\n"); in ocs_d_send_prli_rsp()
75 node->shutdown_reason = OCS_NODE_SHUTDOWN_DEFAULT; in ocs_d_send_prli_rsp()
76 ocs_node_transition(node, __ocs_d_initiate_shutdown, NULL); in ocs_d_send_prli_rsp()
80 if (node->sport->enable_tgt && (ocs_scsi_validate_initiator(node) == 0)) { in ocs_d_send_prli_rsp()
81 node_printf(node, "PRLI rejected by target-server\n"); in ocs_d_send_prli_rsp()
84 node->shutdown_reason = OCS_NODE_SHUTDOWN_DEFAULT; in ocs_d_send_prli_rsp()
85 ocs_node_transition(node, __ocs_d_initiate_shutdown, NULL); in ocs_d_send_prli_rsp()
[all …]
H A Docs_fabric.c35 * This file implements remote node state machines for:
43 @defgroup fabric_sm Node State Machine: Fabric States
44 @defgroup ns_sm Node State Machine: Name/Directory Services States
45 @defgroup p2p_sm Node State Machine: Point-to-Point Node States
53 static void ocs_fabric_initiate_shutdown(ocs_node_t *node);
57 static int32_t ocs_process_gidpt_payload(ocs_node_t *node, fcct_gidpt_acc_t *gidpt, uint32_t gidpt_…
58 static void ocs_process_rscn(ocs_node_t *node, ocs_node_cb_t *cbdata);
64 * @brief Fabric node state machine: Initial state.
69 * @param ctx Remote node sm context.
84 ocs_log_debug(node->ocs, ">>> reenter !!\n"); in __ocs_fabric_init()
[all …]
H A Docs_node.h34 * OCS linux driver remote node callback declarations
42 if (OCS_LOG_ENABLE_SM_TRACE(node->ocs)) \
43 ocs_log_info(node->ocs, "[%s] %-20s\n", node->display_name, ocs_sm_event_name(evt)); \
46 #define node_printf(node, fmt, ...) ocs_log_debug(node->ocs, "[%s] " fmt, node->display_name, ##__V… argument
49 ocs_node_t *node = NULL; \
51 node = ctx->app; \
52 ocs_assert(node, NULL); \
53 ocs = node->ocs; \
56 ocs_strncpy(node->current_state_name, __func__, sizeof(node->current_state_name)); \
58 ocs_strncpy(node->prev_state_name, node->current_state_name, sizeof(node->prev_state_name)); \
[all …]
/freebsd/contrib/ofed/libibverbs/
H A Dmemory.c177 static struct ibv_mem_node *__mm_prev(struct ibv_mem_node *node) in __mm_prev() argument
179 if (node->left) { in __mm_prev()
180 node = node->left; in __mm_prev()
181 while (node->right) in __mm_prev()
182 node = node->right; in __mm_prev()
184 while (node->parent && node == node->parent->left) in __mm_prev()
185 node = node->parent; in __mm_prev()
187 node = node->parent; in __mm_prev()
190 return node; in __mm_prev()
193 static struct ibv_mem_node *__mm_next(struct ibv_mem_node *node) in __mm_next() argument
[all …]
/freebsd/contrib/kyua/utils/config/
H A Dnodes_test.cpp45 /// Typed leaf node that specializes the validate() method.
61 /// Set node that specializes the validate() method.
85 config::bool_node node; in ATF_TEST_CASE_BODY() local
86 node.set(true); in ATF_TEST_CASE_BODY()
87 config::detail::base_node* raw_copy = node.deep_copy(); in ATF_TEST_CASE_BODY()
91 ATF_REQUIRE(node.value()); in ATF_TEST_CASE_BODY()
100 config::bool_node node; in ATF_TEST_CASE_BODY() local
101 ATF_REQUIRE(!node.is_set()); in ATF_TEST_CASE_BODY()
102 node.set(false); in ATF_TEST_CASE_BODY()
103 ATF_REQUIRE( node.is_set()); in ATF_TEST_CASE_BODY()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td96 // DAG node.
340 // Selection DAG Node definitions.
354 def node;
871 // Selection DAG Node Transformation Functions.
894 /// can match something on the DAG, from a single node to multiple nested other
1078 def not : PatFrag<(ops node:$in), (xor node:$in, -1)>;
1079 def vnot : PatFrag<(ops node:$in), (xor node:$in, immAllOnesV)>;
1080 def ineg : PatFrag<(ops node:$in), (sub 0, node:$in)>;
1082 def zanyext : PatFrags<(ops node:$op),
1083 [(zext node:$op),
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DStmtPrinter.cpp153 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt() argument
157 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr() argument
161 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node);
165 void Visit##CLASS(CLASS *Node);
177 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt() argument
178 assert(Node && "Compound statement cannot be null"); in PrintRawCompoundStmt()
180 PrintFPPragmas(Node); in PrintRawCompoundStmt()
181 for (auto *I : Node->body()) in PrintRawCompoundStmt()
256 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt() argument
260 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt() argument
[all …]
/freebsd/contrib/ldns/
H A Dradix.c54 static int ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte);
55 static int ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need);
67 static ldns_radix_node_t* ldns_radix_next_in_subtree(ldns_radix_node_t* node);
68 static ldns_radix_node_t* ldns_radix_prev_from_index(ldns_radix_node_t* node,
71 ldns_radix_node_t* node);
72 static ldns_radix_node_t* ldns_radix_last_in_subtree(ldns_radix_node_t* node);
73 static void ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node);
74 static void ldns_radix_cleanup_onechild(ldns_radix_node_t* node);
75 static void ldns_radix_cleanup_leaf(ldns_radix_node_t* node);
76 static void ldns_radix_node_free(ldns_radix_node_t* node, void* arg);
[all …]
H A Drbtree.c49 /** Node colour black */
51 /** Node colour red */
54 /** the NULL node, global alloc */
65 static void ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
67 static void ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
68 /** Fixup node colours when insert happened */
69 static void ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node);
70 /** Fixup node colours when delete happened */
112 * Rotates the node to the left.
116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) in ldns_rbtree_rotate_left() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZOperators.td242 // Node definitions
475 def z_loadbswap16 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
478 def z_loadbswap32 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
481 def z_loadbswap64 : PatFrag<(ops node:$addr), (z_loadbswap node:$addr), [{
485 def z_storebswap16 : PatFrag<(ops node:$src, node:$addr),
486 (z_storebswap node:$src, node:$addr), [{
489 def z_storebswap32 : PatFrag<(ops node:$src, node:$addr),
490 (z_storebswap node:$src, node:$addr), [{
493 def z_storebswap64 : PatFrag<(ops node:$src, node:$addr),
494 (z_storebswap node:$src, node:$addr), [{
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86InstrFragmentsSIMD.td28 def load_mmx : PatFrag<(ops node:$ptr), (x86mmx (load node:$ptr))>;
141 def X86any_vfpext : PatFrags<(ops node:$src),
142 [(X86strict_vfpext node:$src),
143 (X86vfpext node:$src)]>;
156 def X86any_vfpround : PatFrags<(ops node:$src),
157 [(X86strict_vfpround node:$src),
158 (X86vfpround node:$src)]>;
201 def X86any_cmpp : PatFrags<(ops node:$src1, node:$src2, node:$src3),
202 [(X86strict_cmpp node:$src1, node:$src2, node:$src3),
203 (X86cmpp node:$src1, node:$src2, node:$src3)]>;
[all …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DPostfixExpression.h29 class Node {
41 Node(Kind kind) : m_kind(kind) {} in Node() function
50 /// A node representing a binary expression.
51 class BinaryOpNode : public Node {
59 BinaryOpNode(OpType op_type, Node &left, Node &right) in BinaryOpNode()
60 : Node(BinaryOp), m_op_type(op_type), m_left(&left), m_right(&right) {} in BinaryOpNode()
64 const Node *Left() const { return m_left; } in Left()
65 Node *&Left() { return m_left; } in Left()
67 const Node *Right() const { return m_right; } in Right()
68 Node *&Right() { return m_right; } in Right()
[all …]
/freebsd/sys/contrib/edk2/Include/Library/
H A DDevicePathLib.h26 @retval FALSE The length of any node node in the DevicePath is less
30 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
41 Returns the Type field of a device path node.
43 Returns the Type field of the device path node specified by Node.
45 If Node is NULL, then ASSERT().
47 @param Node A pointer to a device path node data structure.
49 @return The Type field of the device path node specified by Node.
55 IN CONST VOID *Node
59 Returns the SubType field of a device path node.
61 Returns the SubType field of the device path node specified by Node.
[all …]
/freebsd/sys/kern/
H A Dsubr_pctrie.c88 * Map index to an array position for the children of node,
91 pctrie_slot(struct pctrie_node *node, uint64_t index) in pctrie_slot() argument
93 return ((index >> node->pn_clev) & (PCTRIE_COUNT - 1)); in pctrie_slot()
97 * Returns true if index does not belong to the specified node. Otherwise,
101 pctrie_keybarr(struct pctrie_node *node, uint64_t index, int *slot) in pctrie_keybarr() argument
103 index = (index - node->pn_owner) >> node->pn_clev; in pctrie_keybarr()
111 * Check radix node.
114 pctrie_node_put(struct pctrie_node *node) in pctrie_node_put() argument
119 KASSERT(powerof2(node->pn_popmap), in pctrie_node_put()
120 ("pctrie_node_put: node %p has too many children %04x", node, in pctrie_node_put()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUInstrInfo.td9 // This file contains DAG node definitions for the AMDGPU target.
112 // This argument to this node is a dword address.
392 // Intrinsic/Custom node compatibility PatFrags
395 def AMDGPUrcp : PatFrags<(ops node:$src), [(int_amdgcn_rcp node:$src),
396 (AMDGPUrcp_impl node:$src)]>;
397 def AMDGPUrcp_legacy : PatFrags<(ops node:$src), [(int_amdgcn_rcp_legacy node:$src),
398 (AMDGPUrcp_legacy_impl node:$src)]>;
400 def AMDGPUrsq : PatFrags<(ops node:$src), [(int_amdgcn_rsq node:$src),
401 (AMDGPUrsq_impl node:$src)]>;
403 def AMDGPUrsq_clamp : PatFrags<(ops node:$src), [(int_amdgcn_rsq_clamp node:$src),
[all …]
/freebsd/lib/libefivar/
H A Duefi-dputil.c51 nodes. The device path is terminated by an end node that is length
71 // Template for an end-of-device path node.
87 specified by DevicePath including the end of device path node.
134 @retval FALSE The length of any node in the DevicePath is less
138 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
159 // Validate the input size big enough to touch the first node. in IsDevicePathValid()
177 // Validate next node before touch it. in IsDevicePathValid()
192 // Only return TRUE when the End Device Path node is valid. in IsDevicePathValid()
198 Returns the Type field of a device path node.
200 Returns the Type field of the device path node specified by Node.
[all …]
/freebsd/sys/arm64/acpica/
H A Dacpi_iort.c52 * a range of device IDs [base..end] from the current node to another
53 * node. The corresponding device IDs on destination node starts at
66 * The ITS group node does not have any outgoing mappings. It has a
86 * IORT node. Each node has some device specific data depending on the
87 * type of the node. The node can also have a set of mappings, OR in
94 u_int node_offset; /* offset in IORT - node ID */
97 u_int revision; /* node revision */
99 struct iort_map_entry *mappings; /* node mappings */
117 iort_entry_get_id_mapping_index(struct iort_node *node) in iort_entry_get_id_mapping_index() argument
120 switch(node->type) { in iort_entry_get_id_mapping_index()
[all …]
/freebsd/sys/contrib/openzfs/module/avl/
H A Davl.c38 * any given node, the left and right subtrees are allowed to differ in height
66 * - The left/right children pointers of a node are in an array.
76 * int left_heavy; // -1 when left subtree is taller at some node,
91 * pointer) is set to indicate if that the new node has a value greater
116 * Walk from one node to the previous valued node (ie. an infix walk
117 * towards the left). At any given node we do one of 2 things:
126 * otherwise next node
132 avl_node_t *node = AVL_DATA2NODE(oldnode, off); in avl_walk() local
140 if (node == NULL) in avl_walk()
144 * Visit the previous valued node. There are two possibilities: in avl_walk()
[all …]
/freebsd/sys/netpfil/ipfilter/netinet/
H A Dipf_rb.h38 rotate_left(struct _n##_rb_head *head, _t *node) \
42 parent = node->_f.parent; \
43 tmp1 = node->_f.right; \
45 node->_f.right = tmp2; \
47 tmp2->_f.parent = node; \
50 else if (parent->_f.right == node) \
54 tmp1->_f.left = node; \
56 node->_f.parent = tmp1; \
60 rotate_right(struct _n##_rb_head *head, _t *node) \
64 parent = node->_f.parent; \
[all …]
/freebsd/contrib/unbound/util/
H A Drbtree.c47 /** Node colour black */
49 /** Node colour red */
52 /** the NULL node, global alloc */
62 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
64 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
65 /** Fixup node colours when insert happened */
66 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
67 /** Fixup node colours when delete happened */
104 * Rotates the node to the left.
108 rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node) in rbtree_rotate_left() argument
[all …]
/freebsd/sys/arm64/arm64/
H A Dcmn600.c218 NAME_OF(INVALID, "<invalid node>"); in cmn600_node_type_str()
233 return "<unknown node>"; in cmn600_node_type_str()
266 cmn600_dump_node(struct cmn600_node *node, int lvl) in cmn600_dump_node() argument
272 cmn600_node_type_str(node->nd_type), node->nd_x, node->nd_y, in cmn600_dump_node()
273 node->nd_port, node->nd_sub, node->nd_id, node->nd_offset, in cmn600_dump_node()
274 node->nd_logical_id); in cmn600_dump_node()
275 if (node->nd_child_count > 0) in cmn600_dump_node()
276 printf(", Children: %d", node->nd_child_count); in cmn600_dump_node()
278 if (node->nd_type == NODE_TYPE_XP) in cmn600_dump_node()
280 cmn600_xpport_dev_type_str(node->nd_read4(node, in cmn600_dump_node()
[all …]

12345678910>>...174