HomeSort by relevance Sort by last modified time
    Searched full:tnode (Results 1 - 9 of 9) sorted by null

  /external/llvm/include/llvm/ADT/
Trie.h 207 Node* tNode = NULL;
210 while (tNode == NULL) {
231 tNode = addNode(data, s1.substr(r));
232 nNode->addEdge(tNode);
235 tNode = addNode(data, s1);
236 cNode->addEdge(tNode);
246 Node* tNode = NULL;
249 while (tNode == NULL) {
256 tNode = nNode;
274 return tNode->data()
    [all...]
  /external/srec/srec/clib/
srec_arb.c 69 tree_node* tnode = allotree->pdata[cphon].model_nodes; local
70 while (tnode->node.quest_index >= 0)
72 ans = question_check(&allotree->questions[tnode->node.quest_index],
74 tnode = (ans == ANSWER_FAIL ? (tree_node*)tnode->node.fail : (tree_node*)tnode->node.pass);
76 return tnode->term.pelid;
180 tree_node* tnode = (tree_node*) * buffer; local
181 pfread(&(tnode->node.quest_index), sizeof(asr_int16_t), 1, fp);
182 pfread(&(tnode->term.pelid), sizeof(asr_int16_t), 1, fp)
    [all...]
  /external/llvm/include/llvm/Support/
GraphWriter.h 166 O << "\tNode" << static_cast<const void*>(Node) << " [shape=record,";
251 O << "\tNode" << ID << "[ ";
277 O << "\tNode" << SrcNodeID;
  /external/yaffs2/yaffs2/
yaffs_guts.c 589 * in the tnode.
593 * adds them to the tnode free list.
610 /* Calculate the tnode size in bytes for variable width tnode support.
679 /* GetTnode gets us a clean tnode. Tries to make allocate more if we run out */
696 (TSTR("yaffs: Tnode list bug 1" TENDSTR)));
716 /* FreeTnode frees up a tnode and puts it back on the free list */
724 (TSTR("yaffs: Tnode list bug 2" TENDSTR)));
819 /* ------------------- End of individual tnode manipulation -----------------*/
822 * The look up tree is represented by the top tnode and the number of topLeve
    [all...]
Kconfig 103 Setting this to 'y' will force tnode width to 16 bits and make
yaffs_guts.h 341 /*--------------------------- Tnode -------------------------- */
  /external/bluetooth/glib/gobject/
gtype.c 889 TypeNode *tnode; local
907 tnode = lookup_type_node_I (NODE_PARENT_TYPE (iface));
908 if (NODE_PARENT_TYPE (tnode) && !type_lookup_iface_entry_L (node, tnode))
914 NODE_NAME (tnode));
930 tnode = find_conforming_child_type_L (node, iface); /* tnode is_a node */
931 if (tnode)
936 NODE_NAME (tnode));
942 tnode = lookup_type_node_I (prerequisites[i])
    [all...]
  /external/icu4c/common/
rbbitblb.cpp 421 RBBINode *tNode = (RBBINode *)leafNodes.elementAt(endNodeIx);
427 if (tNode->fFollowPos->contains(endMarkerNodes.elementAt(i))) {
428 endNode = tNode;
    [all...]
  /external/bison/src/
vcg.c 466 fputs ("\tnode: {\n", fout);

Completed in 588 milliseconds