Home
last modified time | relevance | path

Searched refs:first_id (Results 1 – 12 of 12) sorted by relevance

/external/autotest/frontend/migrations/
D037_db_constraints.py8 def delete_duplicates(manager, table, first_id, second_id): argument
12 (first_id, second_id, table, first_id, second_id))
16 (table, first_id, second_id),
/external/deqp-deps/SPIRV-Tools/test/val/
Dval_limits_test.cpp687 int first_id = 13; in GenerateSpirvProgramWithCfgNestingDepth() local
691 int largest_index = first_id + 2*num_if_conditions - 2; in GenerateSpirvProgramWithCfgNestingDepth()
692 for (int i = first_id; i <= largest_index; i = i + 2) { in GenerateSpirvProgramWithCfgNestingDepth()
/external/swiftshader/third_party/SPIRV-Tools/test/val/
Dval_limits_test.cpp687 int first_id = 13; in GenerateSpirvProgramWithCfgNestingDepth() local
691 int largest_index = first_id + 2*num_if_conditions - 2; in GenerateSpirvProgramWithCfgNestingDepth()
692 for (int i = first_id; i <= largest_index; i = i + 2) { in GenerateSpirvProgramWithCfgNestingDepth()
/external/angle/third_party/spirv-tools/src/test/val/
Dval_limits_test.cpp687 int first_id = 13; in GenerateSpirvProgramWithCfgNestingDepth() local
691 int largest_index = first_id + 2*num_if_conditions - 2; in GenerateSpirvProgramWithCfgNestingDepth()
692 for (int i = first_id; i <= largest_index; i = i + 2) { in GenerateSpirvProgramWithCfgNestingDepth()
/external/angle/third_party/spirv-tools/src/source/opt/
Dinstrument_pass.cpp337 const uint32_t first_id = (*first_blk)->id(); in UpdateSucceedingPhis() local
341 [&first_id, &last_id, this](const uint32_t succ) { in UpdateSucceedingPhis()
343 sbp->ForEachPhiInst([&first_id, &last_id, this](Instruction* phi) { in UpdateSucceedingPhis()
345 phi->ForEachInId([&first_id, &last_id, &changed](uint32_t* id) { in UpdateSucceedingPhis()
346 if (*id == first_id) { in UpdateSucceedingPhis()
/external/deqp-deps/SPIRV-Tools/source/opt/
Dinstrument_pass.cpp337 const uint32_t first_id = (*first_blk)->id(); in UpdateSucceedingPhis() local
341 [&first_id, &last_id, this](const uint32_t succ) { in UpdateSucceedingPhis()
343 sbp->ForEachPhiInst([&first_id, &last_id, this](Instruction* phi) { in UpdateSucceedingPhis()
345 phi->ForEachInId([&first_id, &last_id, &changed](uint32_t* id) { in UpdateSucceedingPhis()
346 if (*id == first_id) { in UpdateSucceedingPhis()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dinstrument_pass.cpp337 const uint32_t first_id = (*first_blk)->id(); in UpdateSucceedingPhis() local
341 [&first_id, &last_id, this](const uint32_t succ) { in UpdateSucceedingPhis()
343 sbp->ForEachPhiInst([&first_id, &last_id, this](Instruction* phi) { in UpdateSucceedingPhis()
345 phi->ForEachInId([&first_id, &last_id, &changed](uint32_t* id) { in UpdateSucceedingPhis()
346 if (*id == first_id) { in UpdateSucceedingPhis()
/external/mesa3d/src/loader/
Dloader_dri3_helper.c2006 int first_id; in dri3_free_buffers() local
2012 first_id = LOADER_DRI3_BACK_ID(0); in dri3_free_buffers()
2017 first_id = LOADER_DRI3_FRONT_ID; in dri3_free_buffers()
2022 for (buf_id = first_id; buf_id < first_id + n_id; buf_id++) { in dri3_free_buffers()
/external/angle/third_party/spirv-tools/src/test/fuzz/
Ddata_synonym_transformation_test.cpp30 protobufs::Fact MakeSynonymFact(uint32_t first_id, in MakeSynonymFact() argument
36 MakeDataDescriptor(first_id, std::move(first_indices)); in MakeSynonymFact()
/external/deqp-deps/SPIRV-Tools/test/fuzz/
Ddata_synonym_transformation_test.cpp30 protobufs::Fact MakeSynonymFact(uint32_t first_id, in MakeSynonymFact() argument
36 MakeDataDescriptor(first_id, std::move(first_indices)); in MakeSynonymFact()
/external/swiftshader/third_party/SPIRV-Tools/test/fuzz/
Ddata_synonym_transformation_test.cpp30 protobufs::Fact MakeSynonymFact(uint32_t first_id, in MakeSynonymFact() argument
36 MakeDataDescriptor(first_id, std::move(first_indices)); in MakeSynonymFact()
/external/angle/src/compiler/translator/
Dgen_builtin_symbols.py1446 first_id = id_counter
1470 template_args = {'first_id': first_id, 'last_id': id_counter - 1, 'group_name': group_name}