Searched refs:nodes (Results 1 - 21 of 21) sorted by last modified time

/haiku/src/add-ons/kernel/file_systems/userlandfs/server/fuse/
H A DFUSEVolume.cpp831 // fsync all nodes that have been marked dirty. To keep things simple, we
837 // iterate through all nodes
1097 // #pragma mark - nodes
2828 FUSEVolume::_PutNodes(FUSENode* const* nodes, int32 count) argument
2831 _PutNode(nodes[i]);
2907 If the method fails, none of the nodes is locked.
2943 // Fail, if we couldn't lock all nodes up to the root.
2964 /*! Unlocks all nodes from \a node up to (and including) \a stopNode (if
3015 // * Sibling nodes have to be locked in ascending node ID order.
3018 // * We find the closest common ancestor of the two given nodes (migh
[all...]
H A DFUSEVolume.h57 // nodes
164 void _PutNodes(FUSENode* const* nodes, int32 count);
/haiku/src/apps/haikudepot/process/
H A DProcessCoordinator.h98 void AddNode(AbstractProcessNode* nodes);
/haiku/src/kits/media/
H A DMediaRoster.cpp1030 // find the output and input nodes
2187 // with created, but unconnected nodes.
2581 // RegisterNode() must be called for nodes instantiated from add-ons,
2590 // creator The creator team is -1 if nodes are created locally. If
2624 "more nodes for addon-id %" B_PRId32 ", flavor-id %" B_PRId32 "\n",
2794 // creator team is allowed to also release global nodes
3135 dormant_node_info nodes[30]; local
3142 // Get all dormant nodes using GetDormantNodes
3143 if (GetDormantNodes(nodes, &count, NULL, NULL, NULL, requireNodeKinds | B_FILE_INTERFACE, 0) == B_OK) {
3146 if (InstantiateDormantNode(nodes[
[all...]
/haiku/src/add-ons/kernel/file_systems/websearchfs/
H A Dwebsearchfs.h94 struct fs_node *nodes; member in struct:fs_nspace
H A Dwebsearchfs.c152 ns->nodes = NULL;
171 ns->nodes = root; // sll_insert
197 for (node = ns->nodes; node; node = ns->nodes) {
198 ns->nodes = node->nlnext; /* better cache that before we free node */
246 TRACE("SLL_REMOVE(ns->nodes %p, nlnext, %p)\n", ns->nodes, node);
248 err = SLL_REMOVE(ns->nodes, nlnext, node);
250 TRACE("SLL_REMOVE(ns->queries %p, qnext, %p)\n", ns->nodes, node);
274 n = (fs_node *)SLL_FIND(ns->nodes, nlnex
[all...]
/haiku/src/servers/app/drawing/
H A DDrawingEngine.cpp478 // for C will point to the nodes of A and B as its "successors". Therefor,
566 BStackOrHeapArray<node, 64> nodes(count);
568 nodes[i].init(region->RectAt(i), count);
569 if (nodes[i].pointers == NULL)
608 nodes[i].push(&nodes[k]);
609 nodes[k].in_degree++;
611 nodes[k].push(&nodes[i]);
612 nodes[
[all...]
/haiku/src/preferences/media/
H A DMediaViews.h78 void AddInputNodes(NodeList& nodes);
79 void AddOutputNodes(NodeList& nodes);
99 void _PopulateMenu(BMenu* menu, NodeList& nodes,
H A DMediaViews.cpp167 SettingsView::_PopulateMenu(BMenu* menu, NodeList& nodes, argument
170 for (int32 i = 0; i < nodes.CountItems(); i++) {
171 dormant_node_info* info = nodes.ItemAt(i);
/haiku/src/add-ons/kernel/bus_managers/firewire/
H A Dfirewire.cpp1457 device_printf(fc->bdev, "%d nodes, maxhop <= %d %s irm(%d) %s\n",
1500 "iterate and invalidate all nodes\n",
1781 char nodes[63]; local
1793 /* We don't probe myself and linkdown nodes */
1815 nodes[todo++] = node;
1822 dfwdev.dst = nodes[i];
1825 nodes[todo2++] = nodes[i];
/haiku/src/apps/debuganalyzer/gui/
H A DAbstractWaitObjectsPage.h285 NodeContainerNode(BObjectList<Node>& nodes) argument
289 fChildren.AddList(&nodes);
356 // create nodes for the wait object groups
367 // If we shall group the nodes by name, we create grouping nodes.
374 // sort the nodes by name
/haiku/src/servers/media/
H A Dmedia_server.cpp367 LiveNodeList nodes; local
369 status_t status = gNodeManager->GetLiveNodes(nodes,
375 reply.count = nodes.size();
386 area = create_area("get live nodes", (void**)&infos,
395 infos[index] = nodes[index];
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregcomp.c311 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
313 int node = init_state->nodes.elems[node_cnt];
314 re_token_type_t type = dfa->nodes[node].type;
318 re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
327 *p++ = dfa->nodes[node].opr.c;
329 && dfa->nodes[node].type == CHARACTER
330 && dfa->nodes[node].mb_partial)
331 *p++ = dfa->nodes[node].opr.c;
347 bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
356 re_charset_t *cset = dfa->nodes[nod
[all...]
H A Dregex_internal.c26 const re_node_set *nodes,
29 const re_node_set *nodes,
1395 /* Add the token TOKEN to dfa->nodes, and return the index of the token.
1414 new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc);
1417 dfa->nodes = new_nodes;
1431 dfa->nodes[dfa->nodes_len] = token;
1432 dfa->nodes[dfa->nodes_len].constraint = 0;
1434 dfa->nodes[dfa->nodes_len].accept_mb =
1445 calc_state_hash (const re_node_set *nodes, unsigned int context)
1447 unsigned int hash = nodes
1442 calc_state_hash(const re_node_set *nodes, unsigned int context) argument
1462 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument
1506 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument
1596 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument
1646 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument
[all...]
H A Dregex_internal.h450 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
497 re_node_set nodes; member in struct:re_dfastate_t
617 re_token_t *nodes; member in struct:re_dfa_t
H A Dregexec.c149 const re_node_set *nodes)
159 static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
668 if (dfa->init_state->nodes.nelem == 0
669 && dfa->init_state_word->nodes.nelem == 0
670 && (dfa->init_state_nl->nodes.nelem == 0
1106 err = check_subexp_matching_top (mctx, &cur_state->nodes, 0);
1112 err = transit_state_bkref (mctx, &cur_state->nodes);
1210 re_token_type_t type = dfa->nodes[node].type;
1211 unsigned int constraint = dfa->nodes[node].constraint;
1236 for (i = 0; i < state->nodes
2559 transit_state_bkref(re_match_context_t *mctx, const re_node_set *nodes) argument
2756 const re_node_set *nodes; local
2851 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, int subexp_idx, int type) argument
[all...]
/haiku/src/tests/servers/app/newClipping/
H A DMyView.cpp208 node nodes[count]; local
210 nodes[i].init(region->RectAt(i), count);
248 nodes[i].push(&nodes[k]);
249 nodes[k].in_degree++;
251 nodes[k].push(&nodes[i]);
252 nodes[i].in_degree++;
256 // put all nodes onto a stack that have an "indegree" count of zero
259 if (nodes[
[all...]
/haiku/src/tests/servers/app/newerClipping/drawing/
H A DDrawingEngine.cpp220 node nodes[count]; local
222 nodes[i].init(region->RectAt(i), count);
260 nodes[i].push(&nodes[k]);
261 nodes[k].in_degree++;
263 nodes[k].push(&nodes[i]);
264 nodes[i].in_degree++;
268 // put all nodes onto a stack that have an "indegree" count of zero
271 if (nodes[
[all...]
/haiku/src/add-ons/kernel/network/stack/
H A Dradix.c239 * This routine initializes the relevant fields of the nodes, so that
240 * the leaf is the left child of the parent node, and both nodes have
247 rn_newpair(void *v, int b, struct radix_node nodes[2]) argument
249 register struct radix_node *tt = nodes, *t = tt + 1;
273 struct radix_node nodes[2])
314 t = rn_newpair(v_arg, b, nodes);
710 * nodes and possibly save time in calculating indices.
1047 Allocate and initialize an empty tree. This has 3 nodes, which are
272 rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument
H A Dradix.h103 struct radix_node_head *head, struct radix_node nodes[]);
106 struct radix_node_head *head, struct radix_node nodes[]);
/haiku/src/apps/cortex/RouteApp/
H A DNodeExportContext.h34 // Extends ExportContext to include a set of nodes
37 // info needed for the listed nodes.
67 // set of nodes to export; if one or more nodes are
71 media_node_set nodes; member in class:NodeExportContext

Completed in 260 milliseconds