HomeSort by: relevance | last modified time | path
    Searched defs:search (Results 1 - 19 of 19) sorted by relevancy

  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/
swr_draw.cpp 124 auto search = velems->map.find(key); local
125 if (search != velems->map.end()) {
126 velems->fsFunc = search->second;
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/
swr_draw.cpp 159 auto search = velems->map.find(key); local
160 if (search != velems->map.end()) {
161 velems->fsFunc = search->second;
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_search.h 51 * For a search expression:
59 * as the search value.
74 * This is only allowed in search expressions and indicates that the
81 * This is only allowed in search expressions and indicates that the
93 * This is only allowed in search expressions, and allows additional
95 * variables to require, for example, power-of-two in order for the search
137 /* When set on a search expression, the expression will only match an SSA
147 * search structures are constructed and is a unique (to this structure)
178 const nir_search_expression *search; member in struct:transform
205 const nir_search_expression *search,
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir_graph.cpp 210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence) function in class:nv50_ir::DFSIterator
227 search(ei.getNode(), preorder, sequence);
269 search(graph->getRoot(), graph->nextSequence());
284 void search(Graph::Node *node, const int sequence) function in class:nv50_ir::CFGIterator
nv50_ir_ssa.cpp 293 void search(BasicBlock *);
440 search(BasicBlock::get(func->domTree->getRoot()));
452 void RenamePass::search(BasicBlock *bb) function in class:nv50_ir::RenamePass
526 search(BasicBlock::get(ei.getNode()));
  /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/llvm/
invocation.cpp 188 const std::string search = "-cl-std=CL"; local
191 auto pos = opt.find(search);
193 std::stringstream ver_str(opt.substr(pos + search.size()));
296 // Add libclc generic search path
304 // Add opencl-c generic search path
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir_graph.cpp 210 search(graph->getRoot(), preorder, seq);
220 void search(Graph::Node *node, const bool preorder, const int sequence) function in class:nv50_ir::DFSIterator
227 search(ei.getNode(), preorder, sequence);
269 search(graph->getRoot(), graph->nextSequence());
284 void search(Graph::Node *node, const int sequence) function in class:nv50_ir::CFGIterator
nv50_ir_ssa.cpp 293 void search(BasicBlock *);
440 search(BasicBlock::get(func->domTree->getRoot()));
452 void RenamePass::search(BasicBlock *bb) function in class:nv50_ir::RenamePass
526 search(BasicBlock::get(ei.getNode()));
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/clover/llvm/
invocation.cpp 166 const std::string search = "-cl-std=CL"; local
169 auto pos = opt.find(search);
171 const auto ver = opt.substr(pos + search.size());
244 // Add libclc generic search path
  /xsrc/external/mit/MesaLib.old/src/intel/
brw_nir_trig_workarounds.c 12 const nir_search_expression *search; member in struct:transform
189 nir_replace_instr(build, alu, xform->search, xform->replace)) {
199 nir_replace_instr(build, alu, xform->search, xform->replace)) {
  /xsrc/external/mit/xedit/dist/lisp/modules/
indent.lsp 797 ;; Search rule-pattern in match-pattern
800 (defun indent-search-rule (rule-pattern match-pattern
855 ;; reset search
902 ;; reset search
934 (and (setq offset (search rule-pattern match-pattern :test #'eq))
941 (compile 'indent-search-rule)
1031 ;; Flag for regex search
1232 ;; Search table in the stack
1296 (indent-search-rule rule ind-change)
  /xsrc/external/mit/libXaw/dist/src/
TextPop.c 31 * FileInsert, Search, and Replace.
144 "<Btn1Down>:" "select-start() SetField(Search)\n"
150 "s<Key>Return:" "SetField(Search)\n"
153 "<Key>Tab:" "SetField(Search)\n"
416 * the search dialog box uses
424 * will search for a string in the main Text Widget.
427 * If the search was successful and the argument popdown is passed to
429 * search widget
442 if (DoSearch(tw->text.search) && popdown)
443 PopdownSearch(w, (XtPointer)tw->text.search, NULL)
480 struct SearchAndReplace *search = (struct SearchAndReplace *)closure; local
651 struct SearchAndReplace *search = ((TextWidget)tw)->text.search; local
1183 struct SearchAndReplace *search; local
    [all...]
  /xsrc/external/mit/libXaw/dist/include/X11/Xaw/
TextP.h 153 * Search & Replace data structure
159 Widget label1; /* The label widgets for the search window. */
161 Widget left_toggle; /* The left search toggle radioGroup. */
162 Widget right_toggle; /* The right search toggle radioGroup. */
165 Widget search_text; /* The Search text field. */
218 struct SearchAndReplace *search; /* Search and replace structure */ member in struct:_TextPart
  /xsrc/external/mit/xedit/dist/
ispell.c 1503 XawTextBlock check, search, replace; local
1512 search.ptr = text;
1513 search.format = XawFmt8Bit;
1514 search.firstPos = 0;
1515 search.length = ispell.right - pos;
1524 if (strcmp(search.ptr, replace.ptr) != 0 &&
1525 XawTextReplace(ispell.ascii, pos, pos + search.length,
1527 ispell.right += replace.length - search.length;
1536 ispell.undo_head->undo_str = XtNewString(search.ptr);
1541 while ((pos = XawTextSourceSearch(ispell.source, pos, XawsdRight, &search))
    [all...]
  /xsrc/external/mit/xterm/dist/
graphics.c 916 const AllocatedColorRegister *search; local
918 for (search = allocated_colors[rr][gg][bb]; search; search = search->next) {
919 if (search->r == reg->r &&
920 search->g == reg->g &&
921 search->b == reg->b) {
922 return search->pix;
button.c 4008 char *search; local
4009 if ((search = make_indexed_text(screen,
4013 int len = (int) strlen(search);
4026 search + offset,
4051 TRACE(("search::%s\n", search));
4059 visibleChars((Char *) (search + indexed[best_col]),
4063 free(search);
  /xsrc/external/mit/MesaLib/dist/src/imgui/
imstb_truetype.h 1288 // @OPTIMIZE: binary search
1481 } else if (format == 4) { // standard mapping for windows fonts: binary search collection of ranges
1487 // do a binary search of the segments
1489 stbtt_uint32 search = endCount; local
1496 if (unicode_codepoint >= ttUSHORT(data + search + rangeShift*2))
1497 search += rangeShift*2;
1500 search -= 2;
1504 end = ttUSHORT(data + search + searchRange*2);
1506 search += searchRange*2;
1509 search += 2
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/imgui/
imstb_truetype.h 1288 // @OPTIMIZE: binary search
1481 } else if (format == 4) { // standard mapping for windows fonts: binary search collection of ranges
1487 // do a binary search of the segments
1489 stbtt_uint32 search = endCount; local
1496 if (unicode_codepoint >= ttUSHORT(data + search + rangeShift*2))
1497 search += rangeShift*2;
1500 search -= 2;
1504 end = ttUSHORT(data + search + searchRange*2);
1506 search += searchRange*2;
1509 search += 2
    [all...]
  /xsrc/external/mit/MesaLib.old/src/compiler/nir/
nir_opt_algebraic.c 11 const nir_search_expression *search; member in struct:transform
162589 const nir_search_expression *search; member in struct:transform
164188 const nir_search_expression *search; member in struct:transform
    [all...]

Completed in 50 milliseconds