Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 395) sorted by relevance

12345678910>>...16

/openbsd-src/gnu/llvm/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_ilist_test.cpp59 Node nodes[3]; in TEST() local
61 list.PushBack(&nodes[1]); in TEST()
62 list.PushBack(&nodes[0]); in TEST()
63 list.PushFront(&nodes[2]); in TEST()
66 EXPECT_EQ(list.Back(), &nodes[0]); in TEST()
67 EXPECT_EQ(list.Front(), &nodes[2]); in TEST()
69 EXPECT_EQ(list.Next(&nodes[0]), nullptr); in TEST()
70 EXPECT_EQ(list.Prev(&nodes[0]), &nodes[1]); in TEST()
72 EXPECT_EQ(list.Next(&nodes[1]), &nodes[0]); in TEST()
73 EXPECT_EQ(list.Prev(&nodes[1]), &nodes[2]); in TEST()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DSpillPlacement.cpp152 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
157 if (nodes[L.second].Value == -1) in update()
159 else if (nodes[L.second].Value == 1) in update()
182 const Node nodes[]) const { in getDissentingNeighbors()
187 if (Value != nodes[n].Value) in getDissentingNeighbors()
198 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
199 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
217 delete[] nodes; in releaseMemory()
218 nodes = nullptr; in releaseMemory()
228 nodes[n].clear(Threshold); in activate()
[all …]
/openbsd-src/gnu/gcc/gcc/
H A Dddg.c269 if (df_find_use (df, g->nodes[i].insn, rd->reg)) in add_deps_for_def()
302 if (df_find_def (df, g->nodes[i].insn, use->reg)) in add_deps_for_use()
392 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps()
417 ddg_node_ptr j_node = &g->nodes[j]; in build_intra_loop_deps()
472 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); in create_ddg()
489 g->closing_branch = &g->nodes[i]; in create_ddg()
498 g->nodes[i].cuid = i; in create_ddg()
499 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
500 sbitmap_zero (g->nodes[i].successors); in create_ddg()
501 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
[all …]
H A Dmodulo-sched.c367 node_sched_params[i].asap = g->nodes[i].aux.count; in set_node_sched_params()
368 g->nodes[i].aux.info = &node_sched_params[i]; in set_node_sched_params()
409 ddg_node_ptr u = &g->nodes[i]; in calculate_maxii()
442 ddg_node_ptr u = &g->nodes[i]; in generate_reg_moves()
517 rep->insn = g->nodes[i_use].insn; in generate_reg_moves()
529 replace_rtx (g->nodes[i_use].insn, old_reg, new_reg); in generate_reg_moves()
551 ddg_node_ptr u = &ps->g->nodes[i]; in undo_generate_reg_moves()
600 ddg_node_ptr u = &g->nodes[i]; in normalize_sched_times()
655 if (last == ps->g->nodes[i].insn in undo_permute_partial_schedule()
656 || last == ps->g->nodes[i].first_note) in undo_permute_partial_schedule()
[all …]
H A Dcgraphunit.c1353 struct cgraph_order_sort *nodes; in cgraph_output_in_order() local
1361 nodes = (struct cgraph_order_sort *) alloca (size); in cgraph_output_in_order()
1362 memset (nodes, 0, size); in cgraph_output_in_order()
1371 gcc_assert (nodes[i].kind == ORDER_UNDEFINED); in cgraph_output_in_order()
1372 nodes[i].kind = ORDER_FUNCTION; in cgraph_output_in_order()
1373 nodes[i].u.f = pf; in cgraph_output_in_order()
1380 gcc_assert (nodes[i].kind == ORDER_UNDEFINED); in cgraph_output_in_order()
1381 nodes[i].kind = ORDER_VAR; in cgraph_output_in_order()
1382 nodes[i].u.v = pv; in cgraph_output_in_order()
1388 gcc_assert (nodes[i].kind == ORDER_UNDEFINED); in cgraph_output_in_order()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/
H A DDSAextract.py37 <output_file> [list of nodes to extract]')
100 nodes = arrowexp.split(buffer) variable
101 nodes[0] = string.strip(nodes[0])
102 nodes[1] = string.strip(nodes[1])
103 if nodes[0][:13] in node_set and \
104 nodes[1][:13] in node_set:
/openbsd-src/lib/libcrypto/x509/
H A Dx509_policy.c49 * (4) anyPolicy nodes are not tracked explicitly.
65 * for all nodes which are a parent of this node. In this case, no entry
118 * An X509_POLICY_LEVEL is the collection of nodes at the same depth in the
124 * nodes is the list of nodes at this depth, except for the anyPolicy
127 STACK_OF(X509_POLICY_NODE) *nodes;
165 sk_X509_POLICY_NODE_delete_if(STACK_OF(X509_POLICY_NODE) *nodes, in DECLARE_STACK_OF()
168 _STACK *sk = (_STACK *)nodes; in DECLARE_STACK_OF()
173 for (i = 0; i < sk_X509_POLICY_NODE_num(nodes); i++) { in DECLARE_STACK_OF()
174 node = sk_X509_POLICY_NODE_value(nodes, in DECLARE_STACK_OF()
304 x509_policy_level_add_nodes(X509_POLICY_LEVEL * level,STACK_OF (X509_POLICY_NODE)* nodes) x509_policy_level_add_nodes() argument
[all...]
/openbsd-src/gnu/llvm/llvm/docs/DependenceGraphs/
H A Dindex.rst25 It is also possible to combine some atomic nodes that have a simple
26 def-use dependency between them into larger nodes that contain multiple-
29 As described in [1]_ the DDG uses graph abstraction to group nodes
31 into special nodes called pi-blocks. pi-blocks represent cycles of data
33 connected component of the graph is a maximal subgraph of all the nodes
55 all the nodes participating in the cycle, as shown below:
114 …- DDG nodes and edges are completely disjoint from PDG nodes and edges allowing them to change eas…
119 …- There are some similarities between DDG nodes and edges compared to PDG nodes and edges, but the…
132 …nodes in the paper represent three main program components, namely *assignment statements*, *for l…
133 …2. The paper describes five types of dependency edges between nodes namely *loop dependency*, *flo…
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DMetadata.def27 // Handler for leaf nodes in the class hierarchy.
32 // Handler for non-leaf nodes in the class hierarchy.
37 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
50 // Handler for leaf nodes under MDNode.
55 // Handler for leaf nodes under MDNode.
60 // Handler for non-leaf nodes under MDNode.
65 // Handler for specialized leaf nodes under MDNode.
70 // Handler for specialized non-leaf nodes under MDNode.
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stackdepotbase.h51 nodes.MemoryUsage() + Node::allocated(), in GetStats()
60 nodes.TestOnlyUnmap(); in TestOnlyUnmap()
73 TwoLevelMap<Node, kNodesSize1, kNodesSize2> nodes; variable
83 const Node &node = nodes[s]; in find()
142 Node &new_node = nodes[s]; in Put()
156 if (!nodes.contains(id)) in Get()
158 const Node &node = nodes[id]; in Get()
184 const Node &node = nodes[s]; in PrintAll()
/openbsd-src/usr.bin/mandoc/
H A Dtag.c40 struct roff_node **nodes; member
74 free(entry->nodes); in tag_free()
183 entry->nodes = NULL; in tag_put()
204 nold = entry->nodes[--entry->nnodes]; in tag_put()
219 entry->nodes = mandoc_reallocarray(entry->nodes, in tag_put()
220 entry->maxnodes, sizeof(*entry->nodes)); in tag_put()
222 entry->nodes[entry->nnodes++] = n; in tag_put()
/openbsd-src/regress/sys/sys/tree/rb/
H A Drbt-test.c134 struct node *tmp, *ins, *nodes; in main() local
140 nodes = calloc((ITER + 5), sizeof(struct node)); in main()
198 mix_operations(perm, ITER, nodes, ITER, ITER, 0, 0); in main()
268 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
302 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
345 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
392 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
432 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
471 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
535 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in main()
[all …]
H A Drb-test.c135 struct node *tmp, *ins, *nodes; in RB_PROTOTYPE() local
141 nodes = calloc((ITER + 5), sizeof(struct node)); in RB_PROTOTYPE()
199 mix_operations(perm, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
269 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
303 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
346 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
393 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
433 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
472 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
536 mix_operations(nums, ITER, nodes, ITER, ITER, 0, 0); in RB_PROTOTYPE()
[all …]
/openbsd-src/sys/dev/pci/drm/amd/amdgpu/
H A Dta_xgmi_if.h98 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
103 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
108 struct ta_xgmi_peer_link_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
113 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
/openbsd-src/gnu/usr.bin/texinfo/util/
H A Dinstall-info.c976 parse_dir_file (struct line_data *lines, int nlines, struct node **nodes, in parse_dir_file() argument
983 *nodes = 0; in parse_dir_file()
1004 (*nodes)->name = copy_string (line + j, end - j); in parse_dir_file()
1014 next->next = *nodes; in parse_dir_file()
1022 if (*nodes != 0) in parse_dir_file()
1023 (*nodes)->end_line = i; in parse_dir_file()
1026 if (*nodes != 0 && (*nodes)->last_section != 0) in parse_dir_file()
1027 (*nodes)->last_section->end_line = i; in parse_dir_file()
1029 *nodes = next; in parse_dir_file()
1037 if (*nodes != 0 && !strncmp ("* Menu:", lines[i].start, 7)) in parse_dir_file()
[all …]
/openbsd-src/gnu/llvm/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py367 self.nodes = collections.defaultdict(ExplodedNode)
391 self.nodes[pred].successors.append(succ)
392 self.nodes[succ].predecessors.append(pred)
398 if len(self.nodes) == 0:
420 self.nodes[node_id].construct(node_id, json_node)
868 prev_s = self._graph.nodes[node.predecessors[0]].state
930 for node in sorted(graph.nodes):
932 visitor.visit_node(graph.nodes[node])
933 for succ in sorted(graph.nodes[node].successors):
935 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dssa.c191 PARAMS ((rtx reg, rtx *nodes, int *n_nodes));
195 PARAMS ((int t, sbitmap visited, sbitmap *pred, rtx *nodes));
197 PARAMS ((int t, sbitmap visited, sbitmap *pred, sbitmap *succ, rtx *nodes));
1249 ephi_add_node (reg, nodes, n_nodes) in ephi_add_node() argument
1250 rtx reg, *nodes; in ephi_add_node()
1255 if (REGNO (reg) == REGNO (nodes[i]))
1258 nodes[i = (*n_nodes)++] = reg;
1292 ephi_backward (t, visited, pred, nodes) in ephi_backward() argument
1295 rtx *nodes;
1305 ephi_backward (p, visited, pred, nodes);
[all …]
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/clang/include/clang/AST/
H A DBUILD.gn29 args = [ "-gen-clang-stmt-nodes" ]
34 args = [ "-gen-clang-decl-nodes" ]
39 args = [ "-gen-clang-type-nodes" ]
64 args = [ "-gen-clang-comment-nodes" ]
/openbsd-src/sys/tmpfs/
H A Dtmpfs_vfsops.c126 uint64_t nodes; in tmpfs_mount() local
149 nodes = 3 + (memlimit / 1024); in tmpfs_mount()
151 nodes = args->ta_nodes_max; in tmpfs_mount()
153 nodes = MIN(nodes, INT_MAX); in tmpfs_mount()
154 KASSERT(nodes >= 3); in tmpfs_mount()
159 tmp->tm_nodes_max = (ino_t)nodes; in tmpfs_mount()
/openbsd-src/gnu/llvm/llvm/docs/
H A DAddingConstrainedIntrinsics.rst35 DAG nodes::
54 The function SelectionDAGBuilder::visitConstrainedFPIntrinsic builds DAG nodes
65 Most of the STRICT nodes get legalized the same as their matching non-STRICT
73 Be careful of the chain since STRICT nodes use it but their counterparts
79 careful updating this function since some nodes have the same return type
86 registered in TargetLoweringBase::initActions(). By default all strict nodes are
/openbsd-src/gnu/llvm/clang/include/clang/AST/
H A DCMakeLists.txt21 clang_tablegen(StmtNodes.inc -gen-clang-stmt-nodes
25 clang_tablegen(DeclNodes.inc -gen-clang-decl-nodes
29 clang_tablegen(TypeNodes.inc -gen-clang-type-nodes
49 clang_tablegen(CommentNodes.inc -gen-clang-comment-nodes
/openbsd-src/regress/lib/libssl/interop/
H A DMakefile.inc48 -nodes -newkey rsa -keyout ${@:R}.key -x509 -out $@
53 -nodes -newkey rsa -keyout ${@:R}.key -x509 -out $@
58 -nodes -newkey rsa -keyout ${@:R}.key -out $@
79 -nodes -key ${@:R}.key -out $@
/openbsd-src/gnu/llvm/clang/docs/
H A DRAVFrontendAction.rst9 a RecursiveASTVisitor to find CXXRecordDecl AST nodes with a specified
49 // will visit all nodes in the AST.
64 VisitNodeType(NodeType \*) for most AST nodes; the exception are TypeLoc
65 nodes, which are passed by-value. We only need to implement the methods
77 // For debugging, dumping the AST nodes will show which nodes are already
104 identifier information, are not stored in the AST nodes themselves, but
120 do more interesting things with AST nodes, like looking up their source
/openbsd-src/gnu/gcc/gcc/doc/
H A Dc-tree.texi80 @code{tree}. These nodes, while all of the C type @code{tree}, are of
155 as tree nodes of types not mentioned here, or macros documented to
240 tree nodes. A @code{TREE_LIST} is a singly linked list containing two
252 integer (not a tree) giving the number of nodes in the vector. The
253 nodes themselves are accessed using the @code{TREE_VEC_ELT} macro, which
309 All types have corresponding tree nodes. However, you should not assume
311 are often several nodes each of which correspond to the same type.
539 except that all @code{FIELD_DECL} nodes in @code{TYPE_FIELD} start at
676 @code{TREE_LIST} nodes may also appear. In this case, the
686 @code{PARM_DECL} nodes will appear here.
[all …]
/openbsd-src/regress/lib/libssl/certs/
H A Dmake-certs.sh108 openssl req -new -days 3650 -nodes ${key_args} -sha256 -x509 \
119 openssl req -new -days 3650 -nodes ${key_args} -sha256 \
133 openssl req -new -days 3650 -nodes ${key_args} -sha256 \
147 openssl req -new -days 3650 -nodes ${key_args} -sha256 \
162 openssl req -new -days 3650 -nodes ${key_args} -sha256 \

12345678910>>...16