| /external/libopus/src/ |
| mlp_train.c | 46 MLPTrain * mlp_init(int *topo, int nbLayers, float *inputs, float *outputs, int nbSamples)
52 net->topo = malloc(nbLayers*sizeof(net->topo[0]));
54 net->topo[i] = topo[i];
55 inDim = topo[0];
56 outDim = topo[nbLayers-1];
62 net->weights[i] = malloc((topo[i]+1)*topo[i+1]*sizeof(net->weights[0][0]));
63 net->best_weights[i] = malloc((topo[i]+1)*topo[i+1]*sizeof(net->weights[0][0]))
116 int *topo; local
211 int *topo = arg->net->topo; local
236 int *topo; local
464 int topo[3] = {nbInputs, nbHidden, nbOutputs}; local
[all...] |
| mlp.c | 104 for (j=0;j<m->topo[1];j++)
108 for (k=0;k<m->topo[0];k++)
112 for (j=0;j<m->topo[2];j++)
116 for (k=0;k<m->topo[1];k++)
128 for (j=0;j<m->topo[1];j++)
132 for (k=0;k<m->topo[0];k++)
136 for (j=0;j<m->topo[2];j++)
140 for (k=0;k<m->topo[1];k++)
|
| mlp.h | 35 const int *topo; member in struct:__anon25624
|
| mlp_train.h | 79 int *topo; member in struct:__anon25625
|
| mlp_data.c | 106 static const int topo[3] = {25, 16, 2}; variable
110 topo,
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
117 static pANTLR3_UINT32 sortToArray (pANTLR3_TOPO topo);
118 static void sortVector (pANTLR3_TOPO topo, pANTLR3_VECTOR v);
119 static void freeTopo (pANTLR3_TOPO topo);
2286 pANTLR3_TOPO topo = (pANTLR3_TOPO)ANTLR3_MALLOC(sizeof(ANTLR3_TOPO)); local
[all...] |
| /external/mesa3d/src/gallium/drivers/swr/rasterizer/core/ |
| pa.h | 113 bool in_isStreaming, PRIMITIVE_TOPOLOGY topo = TOP_UNKNOWN);
366 uint32_t in_numAttribs, PRIMITIVE_TOPOLOGY topo, bool in_processCutVerts)
371 binTopology = topo;
387 vertsPerPrim = NumVertsPerPrim(topo, gsEnabled);
389 switch (topo)
499 // finish off tri strip w/ adj before restarting topo
[all...] |
| /external/libvpx/ |
| update_libvpx.sh | 87 --topo-order \
95 --topo-order \
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 35 /** Test topo sort in GraphNode. */
|
| /external/mesa3d/src/intel/vulkan/ |
| genX_gpu_memcpy.c | 216 anv_batch_emit(&cmd_buffer->batch, GENX(3DSTATE_VF_TOPOLOGY), topo) {
217 topo.PrimitiveTopologyType = _3DPRIM_POINTLIST;
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
489 * make a long term copy of this array if you do not want to keep the topo
492 pANTLR3_UINT32 (*sortToArray) (struct ANTLR3_TOPO_struct * topo);
498 void (*sortVector) (struct ANTLR3_TOPO_struct * topo, pANTLR3_VECTOR v);
503 void (*free) (struct ANTLR3_TOPO_struct * topo);
|
| /external/tensorflow/tensorflow/contrib/gdr/ |
| README.md | 54 2. There is a GDR capable GPU, i.e. of Fermi, Kepler or later architecture with [corresponding driver](http://docs.nvidia.com/cuda/gpudirect-rdma/index.html) installed. The PCI-e topology could be confirmed by `nvidia-smi topo -m`. For example, in the following topology, `GPU2` and `GPU3` are adjacent to `mlx4_0`, and tensors on these devices could benefit from GDR in current implementation.
57 $ nvidia-smi topo -m
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| topological_sort_test.cc | 119 // Run topo sort again to verify that it is idenpotent.
|
| /external/trappy/trappy/stats/ |
| Aggregator.py | 162 topo["level_1"] = [[1, 2], [3, 4]]
|
| /device/linaro/bootloader/edk2/BaseTools/Source/Python/Workspace/ |
| WorkspaceCommon.py | 219 # The DAG Topo sort produces the destructor order, so the list of constructors must generated in the reverse order
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| PostRASchedulerList.cpp | 121 /// Topo - A topological ordering for SUnits.
122 ScheduleDAGTopologicalSort Topo;
188 : ScheduleDAGInstrs(MF, MLI, MDT), Topo(SUnits), AA(AA),
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 232 /// Topo - A topological ordering for SUnits which permits fast IsReachable
234 ScheduleDAGTopologicalSort Topo;
258 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU),
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
| MachineScheduler.h | 255 /// Topo - A topological ordering for SUnits which permits fast IsReachable
257 ScheduleDAGTopologicalSort Topo;
282 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
| MachineScheduler.h | 255 /// Topo - A topological ordering for SUnits which permits fast IsReachable
257 ScheduleDAGTopologicalSort Topo;
282 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
| MachineScheduler.h | 266 /// Topo - A topological ordering for SUnits which permits fast IsReachable
268 ScheduleDAGTopologicalSort Topo;
293 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/ |
| MachineScheduler.h | 266 /// Topo - A topological ordering for SUnits which permits fast IsReachable
268 ScheduleDAGTopologicalSort Topo;
293 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/ |
| MachineScheduler.h | 266 /// Topo - A topological ordering for SUnits which permits fast IsReachable
268 ScheduleDAGTopologicalSort Topo;
293 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/ |
| MachineScheduler.h | 266 /// Topo - A topological ordering for SUnits which permits fast IsReachable
268 ScheduleDAGTopologicalSort Topo;
293 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 250 /// Topo - A topological ordering for SUnits which permits fast IsReachable
252 ScheduleDAGTopologicalSort Topo;
277 LIS(C->LIS), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU) {}
[all...] |
