Searched refs:boxes (Results 1 - 11 of 11) sorted by relevance

/external/webkit/Source/WebCore/rendering/svg/
H A DSVGTextChunk.h52 Vector<SVGInlineTextBox*>& boxes() { return m_boxes; } function in class:WebCore::SVGTextChunk
53 const Vector<SVGInlineTextBox*>& boxes() const { return m_boxes; } function in class:WebCore::SVGTextChunk
H A DSVGTextChunkBuilder.cpp146 Vector<SVGInlineTextBox*>& boxes = chunk.boxes(); local
148 boxes.append(lineLayoutBoxes[i]);
160 const Vector<SVGInlineTextBox*>& boxes = chunk.boxes(); local
161 unsigned boxCount = boxes.size();
165 // Calculate absolute length of whole text chunk (starting from text box 'start', spanning 'length' text boxes).
176 Vector<SVGTextFragment>& fragments = boxes[boxPosition]->textFragments();
188 SVGInlineTextBox* textBox = boxes[boxPosition];
215 Vector<SVGTextFragment>& fragments = boxes[boxPositio
[all...]
H A DSVGTextLayoutEngine.cpp265 static inline void dumpTextBoxes(Vector<SVGInlineTextBox*>& boxes) argument
267 unsigned boxCount = boxes.size();
268 fprintf(stderr, "Dumping all text fragments in text sub tree, %i boxes\n", boxCount);
271 SVGInlineTextBox* textBox = boxes.at(boxPosition);
290 void SVGTextLayoutEngine::finalizeTransformMatrices(Vector<SVGInlineTextBox*>& boxes) argument
292 unsigned boxCount = boxes.size();
298 SVGInlineTextBox* textBox = boxes.at(boxPosition);
311 boxes.clear();
317 // Chunk layouting is only performed for line layout boxes, not for path layout, where it has already been done.
/external/qemu/android/skin/
H A Dregion.c1240 _expectCompare( Region* r, const SkinBox* boxes, int count ) argument
1255 skin_box_to_rect( (SkinBox*)boxes, &rect2 );
1275 boxes->x1, boxes->y1, boxes->x2, boxes->y2 );
1279 if (b.x1 != boxes->x1 || b.x2 != boxes->x2||
1280 b.y1 != boxes->y1 || b.y2 != boxes
1348 expectComplexRegion( Region* r, const SkinBox* boxes, int count ) argument
1364 expectIntersect( Region* r1, Region* r2, const SkinBox* boxes, int count ) argument
1376 expectUnion( Region* r1, Region* r2, const SkinBox* boxes, int count ) argument
1389 expectSubstract( Region* r1, Region* r2, const SkinBox* boxes, int count ) argument
[all...]
/external/llvm/bindings/ocaml/executionengine/
H A Dllvm_executionengine.mli25 (** [of_float fpty n] boxes the float [n] in a float-valued generic value
30 (** [of_pointer v] boxes the pointer value [v] in a generic value. See the
34 (** [of_int32 n w] boxes the int32 [i] in a generic value with the bitwidth
38 (** [of_int n w] boxes the int [i] in a generic value with the bitwidth
42 (** [of_natint n w] boxes the native int [i] in a generic value with the
47 (** [of_int64 n w] boxes the int64 [i] in a generic value with the bitwidth
/external/webkit/Source/WebCore/inspector/front-end/
H A DMetricsSidebarPane.js155 var boxes = ["content", "padding", "border", "margin", "position"]; variable
158 for (var i = 0; i < boxes.length; ++i) {
159 var name = boxes[i];
/external/ipsec-tools/src/racoon/missing/crypto/rijndael/
H A Drijndael-alg-fst.c29 #include <crypto/rijndael/boxes-fst.dat>
/external/bison/doc/
H A Drefcard.tex12 % boxes, but they are not serious. Just uncomment \finalout.
/external/grub/docs/
H A Dtexinfo.tex195 % that mark overfull boxes (in case you have decided
1692 % Set up the default fonts, so we can use them for creating boxes.
3817 % followed by the two boxes we just split, in box0 and box2.
4889 \emergencystretch = 0pt % don't try to avoid overfull boxes
/external/dropbear/libtomcrypt/
H A Dcrypt.tex659 to not pre-compute the Twofish \textit{$g(X)$} function as a set of four $8 \times 32$ s-boxes. This means that a scheduled
661 defined will force the Twofish code to use pre-computed tables for the two s-boxes $q_0, q_1$ as well as the multiplication
663 speed increase is useful when \textit{TWOFISH\_SMALL} is defined since the s-boxes and MDS multiply form the heart of the
5292 requires only 200 bytes of memory. This is achieved by not pre-computing the substitution boxes. Having this
/external/e2fsprogs/lib/et/
H A Dtexinfo.tex2026 %% that mark overfull boxes (in case you have decided

Completed in 327 milliseconds