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

  /xsrc/external/mit/brotli/dist/c/enc/
static_dict.c 119 size_t cut = l - len; local
120 size_t transform_id = (cut << 2) +
121 (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
hash.h 155 size_t cut = len - matchlen; local
156 size_t transform_id = (cut << 2) +
157 (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir_graph.cpp 41 reinterpret_cast<Node *>(it->get())->cut();
143 // Cut a node from the graph, deleting all attached edges.
144 void Graph::Node::cut() function in class:nv50_ir::Graph::Node
nv50_ir_emit_gv100.cpp 1115 const int cut = insn->op == OP_RESTART || insn->subOp; local
1122 emitField(78, 2, (cut << 1) | emit);
nv50_ir_emit_gm107.cpp 3135 const int cut = insn->op == OP_RESTART || insn->subOp; local
3156 emitField(0x27, 2, (cut << 1) | emit);
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
nv50_ir_graph.cpp 41 reinterpret_cast<Node *>(it->get())->cut();
143 // Cut a node from the graph, deleting all attached edges.
144 void Graph::Node::cut() function in class:nv50_ir::Graph::Node
nv50_ir_emit_gm107.cpp 3070 const int cut = insn->op == OP_RESTART || insn->subOp; local
3091 emitField(0x27, 2, (cut << 1) | emit);
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/
sb_ir.cpp 114 node *l = source_container->cut(b, e);
125 node* container_node::cut(iterator b, iterator e) { function in class:r600_sb::container_node
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/
sb_ir.cpp 114 node *l = source_container->cut(b, e);
125 node* container_node::cut(iterator b, iterator e) { function in class:r600_sb::container_node

Completed in 17 milliseconds