Searched refs:furthest (Results 1 – 8 of 8) sorted by relevance
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| D | brw_wm_pass2.c | 197 GLuint furthest = 0; in search_contiguous_regs() local
203 for (i = 1; i < c->grf_limit && furthest < BRW_WM_MAX_INSN; i++) { in search_contiguous_regs()
211 if (group_nextuse > furthest) { in search_contiguous_regs()
212 furthest = group_nextuse; in search_contiguous_regs()
217 assert(furthest != thisinsn); in search_contiguous_regs()
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| D | brw_wm_pass2.c | 197 GLuint furthest = 0; in search_contiguous_regs() local
203 for (i = 1; i < c->grf_limit && furthest < BRW_WM_MAX_INSN; i++) { in search_contiguous_regs()
211 if (group_nextuse > furthest) { in search_contiguous_regs()
212 furthest = group_nextuse; in search_contiguous_regs()
217 assert(furthest != thisinsn); in search_contiguous_regs()
|
| /external/icu/icu4c/source/i18n/ |
| D | choicfmt.cpp | 509 int32_t furthest = start; in parseArgument() local
520 if (newIndex > furthest) { in parseArgument()
521 furthest = newIndex; in parseArgument()
523 if (furthest == source.length()) { in parseArgument()
530 if (furthest == start) { in parseArgument()
533 pos.setIndex(furthest); in parseArgument()
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| D | choicfmt.cpp | 509 int32_t furthest = start; in parseArgument() local
520 if (newIndex > furthest) { in parseArgument()
521 furthest = newIndex; in parseArgument()
523 if (furthest == source.length()) { in parseArgument()
530 if (furthest == start) { in parseArgument()
533 pos.setIndex(furthest); in parseArgument()
|
| /external/valgrind/main/VEX/priv/ |
| D | host_generic_reg_alloc2.c | 187 Int furthest = -1; in findMostDistantlyMentionedVReg() local
198 if (m > furthest) { in findMostDistantlyMentionedVReg()
199 furthest = m; in findMostDistantlyMentionedVReg()
|
| /external/owasp/sanitizer/lib/htmlparser-1.3/doc/ |
| D | tree-construction.txt | 949 2. Let the furthest block be the topmost node in the stack of
953 3. If there is no furthest block, then the UA must skip the
961 5. If the furthest block has a parent node, then remove the
962 furthest block from its parent node.
966 7. Let node and last node be the furthest block. Follow these
975 4. Otherwise, if last node is the furthest block, then move
994 10. Take all of the child nodes of the furthest block and append
996 11. Append that clone to the furthest block.
1003 immediately below the position of the furthest block in that
|
| /external/chromium_org/third_party/iaccessible2/ |
| D | ia2_api_all.idl | 120 closest edge, the furthest edge, or midway between those two edges. In cases
131 closest edge, the furthest edge, or midway between those two edges. In cases
142 closest edge, the furthest edge, or midway between those two edges. In cases
153 closest edge, the furthest edge, or midway between those two edges. In cases
164 closest edge, the furthest edge, or midway between those two edges. In cases
175 closest edge, the furthest edge, or midway between those two edges. In cases
184 substring may be scrolled to to closest edge, the furthest edge, or midway
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| D | fts1porter.test | 8734 furthest furthest
|