/external/clearsilver/perl/ |
test.cs | 4 <?cs each:leaf =TopNode.2nd1 ?> 5 <?cs var:leaf ?>
|
/packages/wallpapers/Basic/res/raw/ |
fall.rs | 69 struct Leaves_s *leaf = gLeavesStore; 75 gLeaves[i] = leaf; 77 leaf->x = randf2(-width * 0.5f, width * 0.5f); 78 leaf->y = randf2(-height * 0.5f, height * 0.5f); 79 leaf->scale = randf2(0.4f, 0.5f); 80 leaf->angle = randf2(0.0f, 360.0f); 81 leaf->spin = degf(randf2(-0.02f, 0.02f)) * 0.25f; 82 leaf->u1 = sprite / (float) LEAVES_TEXTURES_COUNT; 83 leaf->u2 = (sprite + 1) / (float) LEAVES_TEXTURES_COUNT; 84 leaf->altitude = -1.0f [all...] |
distort.rs | 70 struct Leaves_s *leaf = Leaves; 78 leaf->x = randf2(-width * 0.5f, width * 0.5f); 79 leaf->y = randf2(-height * 0.5f, height * 0.5f); 80 leaf->scale = randf2(0.4f, 0.5f); 81 leaf->angle = randf2(0.0f, 360.0f); 82 leaf->spin = degf(randf2(-0.02f, 0.02f)) * 0.25f; 83 leaf->u1 = sprite / (float) LEAVES_TEXTURES_COUNT; 84 leaf->u2 = (sprite + 1) / (float) LEAVES_TEXTURES_COUNT; 85 leaf->altitude = -1.0f; 86 leaf->rippled = 1.0f [all...] |
/external/webkit/JavaScriptCore/wtf/ |
TCPageMap.h | 104 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf. 111 // Leaf node 112 struct Leaf { 116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes 147 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local 148 if (leaf == NULL) return false; 149 memset(leaf, 0, sizeof(*leaf)) 259 Leaf* leaf = reinterpret_cast<Leaf*>((*allocator_)(sizeof(Leaf))); local [all...] |
/external/webkit/WebCore/rendering/ |
InlineBox.cpp | 242 InlineBox* leaf = 0; local 243 for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine()) 244 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->firstLeafChild(); 245 if (!leaf && parent()) 246 leaf = parent()->nextLeafChild(); 247 return leaf; 252 InlineBox* leaf = 0; local 253 for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine()) 254 leaf = box->isLeaf() ? box : static_cast<InlineFlowBox*>(box)->lastLeafChild(); 255 if (!leaf && parent() [all...] |
RootInlineBox.cpp | 359 static bool isEditableLeaf(InlineBox* leaf) 361 return leaf && leaf->renderer() && leaf->renderer()->node() && leaf->renderer()->node()->isContentEditable(); 383 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) { 384 if (!leaf->renderer()->isListMarker() && (!onlyEditableLeaves || isEditableLeaf(leaf))) [all...] |
/development/scripts/ |
combine_sdks.sh | 89 # rename the directory to the leaf minus the .zip of OUTPUT 90 LEAF=$(echo "$OUTPUT" | sed -e "s:.*\.zip/::" | sed -e "s:.zip$::") 91 mv * "$LEAF" 93 zip $V -qr "$TMP_ZIP" "$LEAF"
|
/external/quake/quake/src/QW/client/ |
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;
|
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, so it' [all...] |
/external/quake/quake/src/WinQuake/ |
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;
|
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, so it's [all...] |
/external/stlport/test/unit/ |
rope_test.cpp | 109 // so that any string addition is added to a new leaf 115 evilRope += "1234567"; // creates a new leaf 117 // add one more character to the leaf 176 // Now make sure that i is incremented into the next leaf:
|
/packages/apps/Camera/src/com/android/camera/ |
PreferenceGroup.java | 64 // Find a leaf preference with the given key. Currently, the base 65 // type of all "leaf" preference is "ListPreference". If we add some
|
/external/grub/stage2/ |
xfs.h | 147 xfs_uint16_t bb_level; /* 0 is a leaf */ 159 xfs_uint16_t bb_level; /* 0 is a leaf */ 185 xfs_uint16_t bb_level; /* 0 is a leaf */ 223 * Key structure for non-leaf levels of the tree. 240 * single block - data with embedded leaf at the end 241 * multiple data blocks, single leaf+freeindex block 242 * data blocks, node&leaf blocks (btree), freeindex blocks 247 * The leaf and freeindex block formats are in xfs_dir2_leaf.h. 267 * This structure is common to both leaf nodes and non-leaf nodes in the Btree [all...] |
/dalvik/tools/dmtracedump/tests/filters/ |
testWaitingDisjointCrossThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingDisjointCrossThreadSameFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingDisjointSingleThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 3+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingNestedOverlapCrossThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingNestedOverlapCrossThreadSameFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingNestedOverlapSingleThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingPartialOverlapCrossThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 4+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingPartialOverlapCrossThreadSameFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 4+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingPartialOverlapSingleThreadDiffFilterDiffKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 189 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div> 193 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div> 201 <div class="leaf"><span class="leaf"> </span> 2   (…) [all...] |
testWaitingDisjointCrossThreadDiffFilterSameKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 177 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 181 <div class="leaf"><span class="leaf"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div> 185 <div class="leaf"><span class="leaf"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div> 204 <div class="leaf"><span class="leaf"> </span> 8   (…) [all...] |
testWaitingDisjointCrossThreadSameFilterSameKeysExpected | 27 div.leaf { margin-left: 10 } 31 span.leaf { padding-right: 10; } 170 <div class="leaf"><span class="leaf"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div> 174 <div class="leaf"><span class="leaf"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div> 178 <div class="leaf"><span class="leaf"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div> 197 <div class="leaf"><span class="leaf"> </span> 8   (…) [all...] |