/external/quake/quake/src/QW/client/ |
H A D | gl_refrag.c | 59 prev = &ef->leaf->efrags; 94 mleaf_t *leaf; local 102 // add an efrag if the node is a leaf 109 leaf = (mleaf_t *)node; 127 // set the leaf links 128 ef->leaf = leaf; 129 ef->leafnext = leaf->efrags; 130 leaf->efrags = ef;
|
H A D | r_efrag.c | 60 prev = &ef->leaf->efrags; 95 mleaf_t *leaf; local 103 // add an efrag if the node is a leaf 110 leaf = (mleaf_t *)node; 128 // set the leaf links 129 ef->leaf = leaf; 130 ef->leafnext = leaf->efrags; 131 leaf->efrags = ef; 174 r_pefragtopnode = node; // we've reached a non-solid leaf, s [all...] |
H A D | render.h | 30 struct mleaf_s *leaf; member in struct:efrag_s 53 // found in an active leaf
|
H A D | model.h | 141 // common with leaf 169 // leaf specific 175 int key; // BSP sequence number for leaf's contents 400 byte *Mod_LeafPVS (mleaf_t *leaf, model_t *model);
|
/external/quake/quake/src/WinQuake/ |
H A D | gl_refrag.cpp | 59 prev = &ef->leaf->efrags; 94 mleaf_t *leaf; local 102 // add an efrag if the node is a leaf 109 leaf = (mleaf_t *)node; 127 // set the leaf links 128 ef->leaf = leaf; 129 ef->leafnext = leaf->efrags; 130 leaf->efrags = ef;
|
H A D | r_efrag.cpp | 60 prev = &ef->leaf->efrags;
95 mleaf_t *leaf;
local 103 // add an efrag if the node is a leaf
110 leaf = (mleaf_t *)node;
128 // set the leaf links
129 ef->leaf = leaf;
130 ef->leafnext = leaf->efrags;
131 leaf->efrags = ef;
174 r_pefragtopnode = node; // we've reached a non-solid leaf, s [all...] |
H A D | render.h | 32 struct mleaf_s *leaf;
member in struct:efrag_s 60 // found in an active leaf
|
H A D | model.h | 130 // common with leaf 158 // leaf specific 164 int key; // BSP sequence number for leaf's contents 380 byte *Mod_LeafPVS (mleaf_t *leaf, model_t *model);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstNodeTest.java | 53 SimpleNode leaf = new SimpleNode('a', null, null); 54 testLacksChild(leaf, LEFT); 55 testLacksChild(leaf, RIGHT); 59 SimpleNode leaf = new SimpleNode('a', null, null); 60 SimpleNode node = new SimpleNode('b', leaf, null); 61 testChildIs(node, LEFT, leaf); 66 SimpleNode leaf = new SimpleNode('c', null, null); 67 SimpleNode node = new SimpleNode('b', null, leaf); 69 testChildIs(node, RIGHT, leaf);
|
/external/webkit/Source/WebCore/rendering/ |
H A D | InlineBox.cpp | 246 InlineBox* leaf = 0; local 247 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine()) 248 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->firstLeafChild(); 249 if (!leaf && parent()) 250 leaf = parent()->nextLeafChild(); 251 return leaf; 256 InlineBox* leaf = 0; local 257 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine()) 258 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->lastLeafChild(); 259 if (!leaf [all...] |
H A D | RootInlineBox.cpp | 456 static bool isEditableLeaf(InlineBox* leaf) argument 458 return leaf && leaf->renderer() && leaf->renderer()->node() && leaf->renderer()->node()->rendererIsEditable(); 480 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) { 481 if (!leaf [all...] |
H A D | InlineFlowBox.cpp | 1242 InlineBox* leaf = 0; local 1243 for (InlineBox* child = firstChild(); child && !leaf; child = child->nextOnLine()) 1244 leaf = child->isLeaf() ? child : static_cast<InlineFlowBox*>(child)->firstLeafChild(); 1245 return leaf; 1250 InlineBox* leaf = 0; local 1251 for (InlineBox* child = lastChild(); child && !leaf; child = child->prevOnLine()) 1252 leaf = child->isLeaf() ? child : static_cast<InlineFlowBox*>(child)->lastLeafChild(); 1253 return leaf; 1382 InlineBox* leaf = firstLeafChild(); local 1389 // First find highest and lowest levels, and initialize leafBoxesInLogicalOrder with the leaf boxe [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | TCPageMap.h | 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 148 if (leaf == NULL) return false; 149 memset(leaf, 0, sizeof(*leaf)); 150 root_[i1] = leaf; 153 // Advance key past whatever is covered by this leaf node 196 // How many bits should we consume at leaf level 257 // Make leaf node if necessary 259 Leaf* leaf local [all...] |
/external/webkit/Source/WebCore/rendering/svg/ |
H A D | SVGRootInlineBox.cpp | 216 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) { 217 if (!leaf->isSVGInlineTextBox()) 219 if (point.y() < leaf->m_y) 221 if (point.y() > leaf->m_y + leaf->virtualLogicalHeight()) 224 closestLeaf = leaf; 225 if (point.x() < leaf [all...] |
/external/chromium/chrome/browser/resources/sync_internals/ |
H A D | sync_node_browser.css | 28 /* TODO(akalin): Find a better icon to use for leaf nodes. */ 29 #sync-node-tree .leaf .tree-label {
|
/external/valgrind/main/gdbserver_tests/ |
H A D | t.c | 97 static void leaf(void) {} function 101 leaf(); // ensures not leaf, as ppc unwind implies VEX iropt precise exns
|
/external/qemu/elff/ |
H A D | dwarf_die.cc | 113 * Lets iterate through child DIEs to find the leaf (last DIE) that contains
117 DIEObject* leaf = child->get_leaf_for_address(address);
local 118 if (leaf != NULL) {
119 return leaf;
123 /* No child DIE contains this address. This DIE is the leaf. */
|
/external/quake/quake/src/QW/server/ |
H A D | sv_send.c | 259 mleaf_t *leaf; local 264 leaf = Mod_PointInLeaf (origin, sv.worldmodel); 265 if (!leaf) 268 leafnum = leaf - sv.worldmodel->leafs; 277 mask = sv.pvs; // leaf 0 is everything; 310 leaf = Mod_PointInLeaf (client->edict->v.origin, sv.worldmodel); 311 if (leaf) 314 leafnum = leaf - sv.worldmodel->leafs - 1;
|
H A D | pr_cmds.c | 568 mleaf_t *leaf; local 606 leaf = Mod_PointInLeaf (org, sv.worldmodel); 607 pvs = Mod_LeafPVS (leaf, sv.worldmodel); 633 mleaf_t *leaf; local 655 leaf = Mod_PointInLeaf (view, sv.worldmodel); 656 l = (leaf - sv.worldmodel->leafs) - 1;
|
/external/grub/netboot/ |
H A D | tulip.c | 841 struct medialeaf *leaf = &mtable->mleaf[i]; 844 leaf->type = 0; 845 leaf->media = p[0] & 0x3f; 846 leaf->leafdata = p; 851 switch(leaf->type = p[1]) { 854 leaf->media = p[2] & 0x0f; 858 leaf->media = 11; 870 leaf->media = p[2] & MEDIA_MASK; 871 switch (leaf->media) { 880 leaf 835 struct medialeaf *leaf = &mtable->mleaf[i]; local [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 169 // Both leaf and branch nodes store vectors of pairs. 412 // Compute the leaf node branching factor that makes a node fit in three 426 // Now that we have the leaf branching factor, compute the actual allocation 435 /// Allocator - The recycling allocator used for both branch and leaf nodes. 458 // A NodeRef doesn't know whether it references a leaf node or a branch node. 670 // When all of the leaf nodes from all the subtrees are concatenated, they must 671 // satisfy the same constraints as a single leaf node. They must be sorted, 766 /// path - The path entries, path[0] is the root node, path.back() is a leaf. 779 template <typename NodeT> NodeT &leaf() const { 959 // 1: Root points to leaf [all...] |
/external/chromium/chrome/browser/sync/ |
H A D | README.js | 31 JsBackend as non-root internal nodes and leaf nodes (although
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
H A D | RunnerController.java | 203 boolean selected, boolean expanded, boolean leaf, int row, 202 getTreeCellRendererComponent(JTree tree, Object value, boolean selected, boolean expanded, boolean leaf, int row, boolean hasFocus) argument
|
/external/chromium/base/ |
H A D | file_path_unittest.cc | 299 FilePath::StringType leaf(cases[i].inputs[1]); 300 FilePath observed_str = root.Append(leaf); 302 "i: " << i << ", root: " << root.value() << ", leaf: " << leaf; 303 FilePath observed_path = root.Append(FilePath(leaf)); 305 "i: " << i << ", root: " << root.value() << ", leaf: " << leaf; 310 std::string ascii = WideToUTF8(leaf); 312 std::string ascii = leaf; 316 "i: " << i << ", root: " << root.value() << ", leaf [all...] |
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/ |
H A D | Octnode.java | 68 boolean leaf = false; field in class:Octnode 115 leaf = true;
|