1bf215546Sopenharmony_ci/*
2bf215546Sopenharmony_ci * Copyright © 2015 Connor Abbott
3bf215546Sopenharmony_ci *
4bf215546Sopenharmony_ci * Permission is hereby granted, free of charge, to any person obtaining a
5bf215546Sopenharmony_ci * copy of this software and associated documentation files (the "Software"),
6bf215546Sopenharmony_ci * to deal in the Software without restriction, including without limitation
7bf215546Sopenharmony_ci * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8bf215546Sopenharmony_ci * and/or sell copies of the Software, and to permit persons to whom the
9bf215546Sopenharmony_ci * Software is furnished to do so, subject to the following conditions:
10bf215546Sopenharmony_ci *
11bf215546Sopenharmony_ci * The above copyright notice and this permission notice (including the next
12bf215546Sopenharmony_ci * paragraph) shall be included in all copies or substantial portions of the
13bf215546Sopenharmony_ci * Software.
14bf215546Sopenharmony_ci *
15bf215546Sopenharmony_ci * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16bf215546Sopenharmony_ci * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17bf215546Sopenharmony_ci * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
18bf215546Sopenharmony_ci * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19bf215546Sopenharmony_ci * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20bf215546Sopenharmony_ci * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21bf215546Sopenharmony_ci * IN THE SOFTWARE.
22bf215546Sopenharmony_ci */
23bf215546Sopenharmony_ci
24bf215546Sopenharmony_ci#include "brw_fs.h"
25bf215546Sopenharmony_ci#include "brw_cfg.h"
26bf215546Sopenharmony_ci#include "brw_fs_builder.h"
27bf215546Sopenharmony_ci
28bf215546Sopenharmony_ciusing namespace brw;
29bf215546Sopenharmony_ci
30bf215546Sopenharmony_cibool
31bf215546Sopenharmony_cifs_visitor::lower_pack()
32bf215546Sopenharmony_ci{
33bf215546Sopenharmony_ci   bool progress = false;
34bf215546Sopenharmony_ci
35bf215546Sopenharmony_ci   foreach_block_and_inst_safe(block, fs_inst, inst, cfg) {
36bf215546Sopenharmony_ci      if (inst->opcode != FS_OPCODE_PACK)
37bf215546Sopenharmony_ci         continue;
38bf215546Sopenharmony_ci
39bf215546Sopenharmony_ci      assert(inst->dst.file == VGRF);
40bf215546Sopenharmony_ci      assert(inst->saturate == false);
41bf215546Sopenharmony_ci      fs_reg dst = inst->dst;
42bf215546Sopenharmony_ci
43bf215546Sopenharmony_ci      const fs_builder ibld(this, block, inst);
44bf215546Sopenharmony_ci      for (unsigned i = 0; i < inst->sources; i++)
45bf215546Sopenharmony_ci         ibld.MOV(subscript(dst, inst->src[i].type, i), inst->src[i]);
46bf215546Sopenharmony_ci
47bf215546Sopenharmony_ci      inst->remove(block);
48bf215546Sopenharmony_ci      progress = true;
49bf215546Sopenharmony_ci   }
50bf215546Sopenharmony_ci
51bf215546Sopenharmony_ci   if (progress)
52bf215546Sopenharmony_ci      invalidate_analysis(DEPENDENCY_INSTRUCTIONS);
53bf215546Sopenharmony_ci
54bf215546Sopenharmony_ci   return progress;
55bf215546Sopenharmony_ci}
56