tools/objtool/check.c

   1 // SPDX-License-Identifier: GPL-2.0-or-later
   2 /*
   3  * Copyright (C) 2015-2017 Josh Poimboeuf <jpoimboe@redhat.com>
   4  */
   5
   6 #include <string.h>
   7 #include <stdlib.h>
   8
   9 #include "builtin.h"
  10 #include "check.h"
  11 #include "elf.h"
  12 #include "special.h"
  13 #include "arch.h"
  14 #include "warn.h"
  15
  16 #include <linux/hashtable.h>
  17 #include <linux/kernel.h>
  18
  19 #define FAKE_JUMP_OFFSET -1
  20
  21 #define C_JUMP_TABLE_SECTION ".rodata..c_jump_table"
  22
  23 struct alternative {
  24         struct list_head list;
  25         struct instruction *insn;
  26         bool skip_orig;
  27 };
  28
  29 const char *objname;
  30 struct cfi_state initial_func_cfi;
  31
  32 struct instruction *find_insn(struct objtool_file *file,
  33                               struct section *sec, unsigned long offset)
  34 {
  35         struct instruction *insn;
  36
  37         hash_for_each_possible(file->insn_hash, insn, hash, offset)
  38                 if (insn->sec == sec && insn->offset == offset)
  39                         return insn;
  40
  41         return NULL;
  42 }
  43
  44 static struct instruction *next_insn_same_sec(struct objtool_file *file,
  45                                               struct instruction *insn)
  46 {
  47         struct instruction *next = list_next_entry(insn, list);
  48
  49         if (!next || &next->list == &file->insn_list || next->sec != insn->sec)
  50                 return NULL;
  51
  52         return next;
  53 }
  54
  55 static struct instruction *next_insn_same_func(struct objtool_file *file,
  56                                                struct instruction *insn)
  57 {
  58         struct instruction *next = list_next_entry(insn, list);
  59         struct symbol *func = insn->func;
  60
  61         if (!func)
  62                 return NULL;
  63
  64         if (&next->list != &file->insn_list && next->func == func)
  65                 return next;
  66
  67         /* Check if we're already in the subfunction: */
  68         if (func == func->cfunc)
  69                 return NULL;
  70
  71         /* Move to the subfunction: */
  72         return find_insn(file, func->cfunc->sec, func->cfunc->offset);
  73 }
  74
  75 #define func_for_each_insn_all(file, func, insn)                        \
  76         for (insn = find_insn(file, func->sec, func->offset);           \
  77              insn;                                                      \
  78              insn = next_insn_same_func(file, insn))
  79
  80 #define func_for_each_insn(file, func, insn)                            \
  81         for (insn = find_insn(file, func->sec, func->offset);           \
  82              insn && &insn->list != &file->insn_list &&                 \
  83                 insn->sec == func->sec &&                               \
  84                 insn->offset < func->offset + func->len;                \
  85              insn = list_next_entry(insn, list))
  86
  87 #define func_for_each_insn_continue_reverse(file, func, insn)           \
  88         for (insn = list_prev_entry(insn, list);                        \
  89              &insn->list != &file->insn_list &&                         \
  90                 insn->sec == func->sec && insn->offset >= func->offset; \
  91              insn = list_prev_entry(insn, list))
  92
  93 #define sec_for_each_insn_from(file, insn)                              \
  94         for (; insn; insn = next_insn_same_sec(file, insn))
  95
  96 #define sec_for_each_insn_continue(file, insn)                          \
  97         for (insn = next_insn_same_sec(file, insn); insn;               \
  98              insn = next_insn_same_sec(file, insn))
  99
 100 static bool is_sibling_call(struct instruction *insn)
 101 {
 102         /* An indirect jump is either a sibling call or a jump to a table. */
 103         if (insn->type == INSN_JUMP_DYNAMIC)
 104                 return list_empty(&insn->alts);
 105
 106         if (insn->type != INSN_JUMP_CONDITIONAL &&
 107             insn->type != INSN_JUMP_UNCONDITIONAL)
 108                 return false;
 109
 110         /* add_jump_destinations() sets insn->call_dest for sibling calls. */
 111         return !!insn->call_dest;
 112 }
 113
 114 /*
 115  * This checks to see if the given function is a "noreturn" function.
 116  *
 117  * For global functions which are outside the scope of this object file, we
 118  * have to keep a manual list of them.
 119  *
 120  * For local functions, we have to detect them manually by simply looking for
 121  * the lack of a return instruction.
 122  */
 123 static bool __dead_end_function(struct objtool_file *file, struct symbol *func,
 124                                 int recursion)
 125 {
 126         int i;
 127         struct instruction *insn;
 128         bool empty = true;
 129
 130         /*
 131          * Unfortunately these have to be hard coded because the noreturn
 132          * attribute isn't provided in ELF data.
 133          */
 134         static const char * const global_noreturns[] = {
 135                 "__stack_chk_fail",
 136                 "panic",
 137                 "do_exit",
 138                 "do_task_dead",
 139                 "__module_put_and_exit",
 140                 "complete_and_exit",
 141                 "kvm_spurious_fault",
 142                 "__reiserfs_panic",
 143                 "lbug_with_loc",
 144                 "fortify_panic",
 145                 "usercopy_abort",
 146                 "machine_real_restart",
 147                 "rewind_stack_do_exit",
 148         };
 149
 150         if (!func)
 151                 return false;
 152
 153         if (func->bind == STB_WEAK)
 154                 return false;
 155
 156         if (func->bind == STB_GLOBAL)
 157                 for (i = 0; i < ARRAY_SIZE(global_noreturns); i++)
 158                         if (!strcmp(func->name, global_noreturns[i]))
 159                                 return true;
 160
 161         if (!func->len)
 162                 return false;
 163
 164         insn = find_insn(file, func->sec, func->offset);
 165         if (!insn->func)
 166                 return false;
 167
 168         func_for_each_insn_all(file, func, insn) {
 169                 empty = false;
 170
 171                 if (insn->type == INSN_RETURN)
 172                         return false;
 173         }
 174
 175         if (empty)
 176                 return false;
 177
 178         /*
 179          * A function can have a sibling call instead of a return.  In that
 180          * case, the function's dead-end status depends on whether the target
 181          * of the sibling call returns.
 182          */
 183         func_for_each_insn_all(file, func, insn) {
 184                 if (is_sibling_call(insn)) {
 185                         struct instruction *dest = insn->jump_dest;
 186
 187                         if (!dest)
 188                                 /* sibling call to another file */
 189                                 return false;
 190
 191                         /* local sibling call */
 192                         if (recursion == 5) {
 193                                 /*
 194                                  * Infinite recursion: two functions have
 195                                  * sibling calls to each other.  This is a very
 196                                  * rare case.  It means they aren't dead ends.
 197                                  */
 198                                 return false;
 199                         }
 200
 201                         return __dead_end_function(file, dest->func, recursion+1);
 202                 }
 203         }
 204
 205         return true;
 206 }
 207
 208 static bool dead_end_function(struct objtool_file *file, struct symbol *func)
 209 {
 210         return __dead_end_function(file, func, 0);
 211 }
 212
 213 static void clear_insn_state(struct insn_state *state)
 214 {
 215         int i;
 216
 217         memset(state, 0, sizeof(*state));
 218         state->cfa.base = CFI_UNDEFINED;
 219         for (i = 0; i < CFI_NUM_REGS; i++) {
 220                 state->regs[i].base = CFI_UNDEFINED;
 221                 state->vals[i].base = CFI_UNDEFINED;
 222         }
 223         state->drap_reg = CFI_UNDEFINED;
 224         state->drap_offset = -1;
 225 }
 226
 227 /*
 228  * Call the arch-specific instruction decoder for all the instructions and add
 229  * them to the global instruction list.
 230  */
 231 static int decode_instructions(struct objtool_file *file)
 232 {
 233         struct section *sec;
 234         struct symbol *func;
 235         unsigned long offset;
 236         struct instruction *insn;
 237         int ret;
 238
 239         for_each_sec(file, sec) {
 240
 241                 if (!(sec->sh.sh_flags & SHF_EXECINSTR))
 242                         continue;
 243
 244                 if (strcmp(sec->name, ".altinstr_replacement") &&
 245                     strcmp(sec->name, ".altinstr_aux") &&
 246                     strncmp(sec->name, ".discard.", 9))
 247                         sec->text = true;
 248
 249                 for (offset = 0; offset < sec->len; offset += insn->len) {
 250                         insn = malloc(sizeof(*insn));
 251                         if (!insn) {
 252                                 WARN("malloc failed");
 253                                 return -1;
 254                         }
 255                         memset(insn, 0, sizeof(*insn));
 256                         INIT_LIST_HEAD(&insn->alts);
 257                         clear_insn_state(&insn->state);
 258
 259                         insn->sec = sec;
 260                         insn->offset = offset;
 261
 262                         ret = arch_decode_instruction(file->elf, sec, offset,
 263                                                       sec->len - offset,
 264                                                       &insn->len, &insn->type,
 265                                                       &insn->immediate,
 266                                                       &insn->stack_op);
 267                         if (ret)
 268                                 goto err;
 269
 270                         if (!insn->type || insn->type > INSN_LAST) {
 271                                 WARN_FUNC("invalid instruction type %d",
 272                                           insn->sec, insn->offset, insn->type);
 273                                 ret = -1;
 274                                 goto err;
 275                         }
 276
 277                         hash_add(file->insn_hash, &insn->hash, insn->offset);
 278                         list_add_tail(&insn->list, &file->insn_list);
 279                 }
 280
 281                 list_for_each_entry(func, &sec->symbol_list, list) {
 282                         if (func->type != STT_FUNC || func->alias != func)
 283                                 continue;
 284
 285                         if (!find_insn(file, sec, func->offset)) {
 286                                 WARN("%s(): can't find starting instruction",
 287                                      func->name);
 288                                 return -1;
 289                         }
 290
 291                         func_for_each_insn(file, func, insn)
 292                                 insn->func = func;
 293                 }
 294         }
 295
 296         return 0;
 297
 298 err:
 299         free(insn);
 300         return ret;
 301 }
 302
 303 /*
 304  * Mark "ud2" instructions and manually annotated dead ends.
 305  */
 306 static int add_dead_ends(struct objtool_file *file)
 307 {
 308         struct section *sec;
 309         struct rela *rela;
 310         struct instruction *insn;
 311         bool found;
 312
 313         /*
 314          * By default, "ud2" is a dead end unless otherwise annotated, because
 315          * GCC 7 inserts it for certain divide-by-zero cases.
 316          */
 317         for_each_insn(file, insn)
 318                 if (insn->type == INSN_BUG)
 319                         insn->dead_end = true;
 320
 321         /*
 322          * Check for manually annotated dead ends.
 323          */
 324         sec = find_section_by_name(file->elf, ".rela.discard.unreachable");
 325         if (!sec)
 326                 goto reachable;
 327
 328         list_for_each_entry(rela, &sec->rela_list, list) {
 329                 if (rela->sym->type != STT_SECTION) {
 330                         WARN("unexpected relocation symbol type in %s", sec->name);
 331                         return -1;
 332                 }
 333                 insn = find_insn(file, rela->sym->sec, rela->addend);
 334                 if (insn)
 335                         insn = list_prev_entry(insn, list);
 336                 else if (rela->addend == rela->sym->sec->len) {
 337                         found = false;
 338                         list_for_each_entry_reverse(insn, &file->insn_list, list) {
 339                                 if (insn->sec == rela->sym->sec) {
 340                                         found = true;
 341                                         break;
 342                                 }
 343                         }
 344
 345                         if (!found) {
 346                                 WARN("can't find unreachable insn at %s+0x%x",
 347                                      rela->sym->sec->name, rela->addend);
 348                                 return -1;
 349                         }
 350                 } else {
 351                         WARN("can't find unreachable insn at %s+0x%x",
 352                              rela->sym->sec->name, rela->addend);
 353                         return -1;
 354                 }
 355
 356                 insn->dead_end = true;
 357         }
 358
 359 reachable:
 360         /*
 361          * These manually annotated reachable checks are needed for GCC 4.4,
 362          * where the Linux unreachable() macro isn't supported.  In that case
 363          * GCC doesn't know the "ud2" is fatal, so it generates code as if it's
 364          * not a dead end.
 365          */
 366         sec = find_section_by_name(file->elf, ".rela.discard.reachable");
 367         if (!sec)
 368                 return 0;
 369
 370         list_for_each_entry(rela, &sec->rela_list, list) {
 371                 if (rela->sym->type != STT_SECTION) {
 372                         WARN("unexpected relocation symbol type in %s", sec->name);
 373                         return -1;
 374                 }
 375                 insn = find_insn(file, rela->sym->sec, rela->addend);
 376                 if (insn)
 377                         insn = list_prev_entry(insn, list);
 378                 else if (rela->addend == rela->sym->sec->len) {
 379                         found = false;
 380                         list_for_each_entry_reverse(insn, &file->insn_list, list) {
 381                                 if (insn->sec == rela->sym->sec) {
 382                                         found = true;
 383                                         break;
 384                                 }
 385                         }
 386
 387                         if (!found) {
 388                                 WARN("can't find reachable insn at %s+0x%x",
 389                                      rela->sym->sec->name, rela->addend);
 390                                 return -1;
 391                         }
 392                 } else {
 393                         WARN("can't find reachable insn at %s+0x%x",
 394                              rela->sym->sec->name, rela->addend);
 395                         return -1;
 396                 }
 397
 398                 insn->dead_end = false;
 399         }
 400
 401         return 0;
 402 }
 403
 404 /*
 405  * Warnings shouldn't be reported for ignored functions.
 406  */
 407 static void add_ignores(struct objtool_file *file)
 408 {
 409         struct instruction *insn;
 410         struct section *sec;
 411         struct symbol *func;
 412         struct rela *rela;
 413
 414         sec = find_section_by_name(file->elf, ".rela.discard.func_stack_frame_non_standard");
 415         if (!sec)
 416                 return;
 417
 418         list_for_each_entry(rela, &sec->rela_list, list) {
 419                 switch (rela->sym->type) {
 420                 case STT_FUNC:
 421                         func = rela->sym;
 422                         break;
 423
 424                 case STT_SECTION:
 425                         func = find_symbol_by_offset(rela->sym->sec, rela->addend);
 426                         if (!func || func->type != STT_FUNC)
 427                                 continue;
 428                         break;
 429
 430                 default:
 431                         WARN("unexpected relocation symbol type in %s: %d", sec->name, rela->sym->type);
 432                         continue;
 433                 }
 434
 435                 func_for_each_insn_all(file, func, insn)
 436                         insn->ignore = true;
 437         }
 438 }
 439
 440 /*
 441  * This is a whitelist of functions that is allowed to be called with AC set.
 442  * The list is meant to be minimal and only contains compiler instrumentation
 443  * ABI and a few functions used to implement *_{to,from}_user() functions.
 444  *
 445  * These functions must not directly change AC, but may PUSHF/POPF.
 446  */
 447 static const char *uaccess_safe_builtin[] = {
 448         /* KASAN */
 449         "kasan_report",
 450         "check_memory_region",
 451         /* KASAN out-of-line */
 452         "__asan_loadN_noabort",
 453         "__asan_load1_noabort",
 454         "__asan_load2_noabort",
 455         "__asan_load4_noabort",
 456         "__asan_load8_noabort",
 457         "__asan_load16_noabort",
 458         "__asan_storeN_noabort",
 459         "__asan_store1_noabort",
 460         "__asan_store2_noabort",
 461         "__asan_store4_noabort",
 462         "__asan_store8_noabort",
 463         "__asan_store16_noabort",
 464         /* KASAN in-line */
 465         "__asan_report_load_n_noabort",
 466         "__asan_report_load1_noabort",
 467         "__asan_report_load2_noabort",
 468         "__asan_report_load4_noabort",
 469         "__asan_report_load8_noabort",
 470         "__asan_report_load16_noabort",
 471         "__asan_report_store_n_noabort",
 472         "__asan_report_store1_noabort",
 473         "__asan_report_store2_noabort",
 474         "__asan_report_store4_noabort",
 475         "__asan_report_store8_noabort",
 476         "__asan_report_store16_noabort",
 477         /* KCOV */
 478         "write_comp_data",
 479         "__sanitizer_cov_trace_pc",
 480         "__sanitizer_cov_trace_const_cmp1",
 481         "__sanitizer_cov_trace_const_cmp2",
 482         "__sanitizer_cov_trace_const_cmp4",
 483         "__sanitizer_cov_trace_const_cmp8",
 484         "__sanitizer_cov_trace_cmp1",
 485         "__sanitizer_cov_trace_cmp2",
 486         "__sanitizer_cov_trace_cmp4",
 487         "__sanitizer_cov_trace_cmp8",
 488         /* UBSAN */
 489         "ubsan_type_mismatch_common",
 490         "__ubsan_handle_type_mismatch",
 491         "__ubsan_handle_type_mismatch_v1",
 492         /* misc */
 493         "csum_partial_copy_generic",
 494         "__memcpy_mcsafe",
 495         "mcsafe_handle_tail",
 496         "ftrace_likely_update", /* CONFIG_TRACE_BRANCH_PROFILING */
 497         NULL
 498 };
 499
 500 static void add_uaccess_safe(struct objtool_file *file)
 501 {
 502         struct symbol *func;
 503         const char **name;
 504
 505         if (!uaccess)
 506                 return;
 507
 508         for (name = uaccess_safe_builtin; *name; name++) {
 509                 func = find_symbol_by_name(file->elf, *name);
 510                 if (!func)
 511                         continue;
 512
 513                 func->uaccess_safe = true;
 514         }
 515 }
 516
 517 /*
 518  * FIXME: For now, just ignore any alternatives which add retpolines.  This is
 519  * a temporary hack, as it doesn't allow ORC to unwind from inside a retpoline.
 520  * But it at least allows objtool to understand the control flow *around* the
 521  * retpoline.
 522  */
 523 static int add_ignore_alternatives(struct objtool_file *file)
 524 {
 525         struct section *sec;
 526         struct rela *rela;
 527         struct instruction *insn;
 528
 529         sec = find_section_by_name(file->elf, ".rela.discard.ignore_alts");
 530         if (!sec)
 531                 return 0;
 532
 533         list_for_each_entry(rela, &sec->rela_list, list) {
 534                 if (rela->sym->type != STT_SECTION) {
 535                         WARN("unexpected relocation symbol type in %s", sec->name);
 536                         return -1;
 537                 }
 538
 539                 insn = find_insn(file, rela->sym->sec, rela->addend);
 540                 if (!insn) {
 541                         WARN("bad .discard.ignore_alts entry");
 542                         return -1;
 543                 }
 544
 545                 insn->ignore_alts = true;
 546         }
 547
 548         return 0;
 549 }
 550
 551 /*
 552  * Find the destination instructions for all jumps.
 553  */
 554 static int add_jump_destinations(struct objtool_file *file)
 555 {
 556         struct instruction *insn;
 557         struct rela *rela;
 558         struct section *dest_sec;
 559         unsigned long dest_off;
 560
 561         for_each_insn(file, insn) {
 562                 if (insn->type != INSN_JUMP_CONDITIONAL &&
 563                     insn->type != INSN_JUMP_UNCONDITIONAL)
 564                         continue;
 565
 566                 if (insn->ignore || insn->offset == FAKE_JUMP_OFFSET)
 567                         continue;
 568
 569                 rela = find_rela_by_dest_range(insn->sec, insn->offset,
 570                                                insn->len);
 571                 if (!rela) {
 572                         dest_sec = insn->sec;
 573                         dest_off = insn->offset + insn->len + insn->immediate;
 574                 } else if (rela->sym->type == STT_SECTION) {
 575                         dest_sec = rela->sym->sec;
 576                         dest_off = rela->addend + 4;
 577                 } else if (rela->sym->sec->idx) {
 578                         dest_sec = rela->sym->sec;
 579                         dest_off = rela->sym->sym.st_value + rela->addend + 4;
 580                 } else if (strstr(rela->sym->name, "_indirect_thunk_")) {
 581                         /*
 582                          * Retpoline jumps are really dynamic jumps in
 583                          * disguise, so convert them accordingly.
 584                          */
 585                         insn->type = INSN_JUMP_DYNAMIC;
 586                         insn->retpoline_safe = true;
 587                         continue;
 588                 } else {
 589                         /* external sibling call */
 590                         insn->call_dest = rela->sym;
 591                         continue;
 592                 }
 593
 594                 insn->jump_dest = find_insn(file, dest_sec, dest_off);
 595                 if (!insn->jump_dest) {
 596
 597                         /*
 598                          * This is a special case where an alt instruction
 599                          * jumps past the end of the section.  These are
 600                          * handled later in handle_group_alt().
 601                          */
 602                         if (!strcmp(insn->sec->name, ".altinstr_replacement"))
 603                                 continue;
 604
 605                         WARN_FUNC("can't find jump dest instruction at %s+0x%lx",
 606                                   insn->sec, insn->offset, dest_sec->name,
 607                                   dest_off);
 608                         return -1;
 609                 }
 610
 611                 /*
 612                  * Cross-function jump.
 613                  */
 614                 if (insn->func && insn->jump_dest->func &&
 615                     insn->func != insn->jump_dest->func) {
 616
 617                         /*
 618                          * For GCC 8+, create parent/child links for any cold
 619                          * subfunctions.  This is _mostly_ redundant with a
 620                          * similar initialization in read_symbols().
 621                          *
 622                          * If a function has aliases, we want the *first* such
 623                          * function in the symbol table to be the subfunction's
 624                          * parent.  In that case we overwrite the
 625                          * initialization done in read_symbols().
 626                          *
 627                          * However this code can't completely replace the
 628                          * read_symbols() code because this doesn't detect the
 629                          * case where the parent function's only reference to a
 630                          * subfunction is through a jump table.
 631                          */
 632                         if (!strstr(insn->func->name, ".cold.") &&
 633                             strstr(insn->jump_dest->func->name, ".cold.")) {
 634                                 insn->func->cfunc = insn->jump_dest->func;
 635                                 insn->jump_dest->func->pfunc = insn->func;
 636
 637                         } else if (insn->jump_dest->func->pfunc != insn->func->pfunc &&
 638                                    insn->jump_dest->offset == insn->jump_dest->func->offset) {
 639
 640                                 /* internal sibling call */
 641                                 insn->call_dest = insn->jump_dest->func;
 642                         }
 643                 }
 644         }
 645
 646         return 0;
 647 }
 648
 649 /*
 650  * Find the destination instructions for all calls.
 651  */
 652 static int add_call_destinations(struct objtool_file *file)
 653 {
 654         struct instruction *insn;
 655         unsigned long dest_off;
 656         struct rela *rela;
 657
 658         for_each_insn(file, insn) {
 659                 if (insn->type != INSN_CALL)
 660                         continue;
 661
 662                 rela = find_rela_by_dest_range(insn->sec, insn->offset,
 663                                                insn->len);
 664                 if (!rela) {
 665                         dest_off = insn->offset + insn->len + insn->immediate;
 666                         insn->call_dest = find_symbol_by_offset(insn->sec,
 667                                                                 dest_off);
 668
 669                         if (!insn->call_dest && !insn->ignore) {
 670                                 WARN_FUNC("unsupported intra-function call",
 671                                           insn->sec, insn->offset);
 672                                 if (retpoline)
 673                                         WARN("If this is a retpoline, please patch it in with alternatives and annotate it with ANNOTATE_NOSPEC_ALTERNATIVE.");
 674                                 return -1;
 675                         }
 676
 677                 } else if (rela->sym->type == STT_SECTION) {
 678                         insn->call_dest = find_symbol_by_offset(rela->sym->sec,
 679                                                                 rela->addend+4);
 680                         if (!insn->call_dest ||
 681                             insn->call_dest->type != STT_FUNC) {
 682                                 WARN_FUNC("can't find call dest symbol at %s+0x%x",
 683                                           insn->sec, insn->offset,
 684                                           rela->sym->sec->name,
 685                                           rela->addend + 4);
 686                                 return -1;
 687                         }
 688                 } else
 689                         insn->call_dest = rela->sym;
 690         }
 691
 692         return 0;
 693 }
 694
 695 /*
 696  * The .alternatives section requires some extra special care, over and above
 697  * what other special sections require:
 698  *
 699  * 1. Because alternatives are patched in-place, we need to insert a fake jump
 700  *    instruction at the end so that validate_branch() skips all the original
 701  *    replaced instructions when validating the new instruction path.
 702  *
 703  * 2. An added wrinkle is that the new instruction length might be zero.  In
 704  *    that case the old instructions are replaced with noops.  We simulate that
 705  *    by creating a fake jump as the only new instruction.
 706  *
 707  * 3. In some cases, the alternative section includes an instruction which
 708  *    conditionally jumps to the _end_ of the entry.  We have to modify these
 709  *    jumps' destinations to point back to .text rather than the end of the
 710  *    entry in .altinstr_replacement.
 711  */
 712 static int handle_group_alt(struct objtool_file *file,
 713                             struct special_alt *special_alt,
 714                             struct instruction *orig_insn,
 715                             struct instruction **new_insn)
 716 {
 717         struct instruction *last_orig_insn, *last_new_insn, *insn, *fake_jump = NULL;
 718         unsigned long dest_off;
 719
 720         last_orig_insn = NULL;
 721         insn = orig_insn;
 722         sec_for_each_insn_from(file, insn) {
 723                 if (insn->offset >= special_alt->orig_off + special_alt->orig_len)
 724                         break;
 725
 726                 insn->alt_group = true;
 727                 last_orig_insn = insn;
 728         }
 729
 730         if (next_insn_same_sec(file, last_orig_insn)) {
 731                 fake_jump = malloc(sizeof(*fake_jump));
 732                 if (!fake_jump) {
 733                         WARN("malloc failed");
 734                         return -1;
 735                 }
 736                 memset(fake_jump, 0, sizeof(*fake_jump));
 737                 INIT_LIST_HEAD(&fake_jump->alts);
 738                 clear_insn_state(&fake_jump->state);
 739
 740                 fake_jump->sec = special_alt->new_sec;
 741                 fake_jump->offset = FAKE_JUMP_OFFSET;
 742                 fake_jump->type = INSN_JUMP_UNCONDITIONAL;
 743                 fake_jump->jump_dest = list_next_entry(last_orig_insn, list);
 744                 fake_jump->func = orig_insn->func;
 745         }
 746
 747         if (!special_alt->new_len) {
 748                 if (!fake_jump) {
 749                         WARN("%s: empty alternative at end of section",
 750                              special_alt->orig_sec->name);
 751                         return -1;
 752                 }
 753
 754                 *new_insn = fake_jump;
 755                 return 0;
 756         }
 757
 758         last_new_insn = NULL;
 759         insn = *new_insn;
 760         sec_for_each_insn_from(file, insn) {
 761                 if (insn->offset >= special_alt->new_off + special_alt->new_len)
 762                         break;
 763
 764                 last_new_insn = insn;
 765
 766                 insn->ignore = orig_insn->ignore_alts;
 767                 insn->func = orig_insn->func;
 768
 769                 if (insn->type != INSN_JUMP_CONDITIONAL &&
 770                     insn->type != INSN_JUMP_UNCONDITIONAL)
 771                         continue;
 772
 773                 if (!insn->immediate)
 774                         continue;
 775
 776                 dest_off = insn->offset + insn->len + insn->immediate;
 777                 if (dest_off == special_alt->new_off + special_alt->new_len) {
 778                         if (!fake_jump) {
 779                                 WARN("%s: alternative jump to end of section",
 780                                      special_alt->orig_sec->name);
 781                                 return -1;
 782                         }
 783                         insn->jump_dest = fake_jump;
 784                 }
 785
 786                 if (!insn->jump_dest) {
 787                         WARN_FUNC("can't find alternative jump destination",
 788                                   insn->sec, insn->offset);
 789                         return -1;
 790                 }
 791         }
 792
 793         if (!last_new_insn) {
 794                 WARN_FUNC("can't find last new alternative instruction",
 795                           special_alt->new_sec, special_alt->new_off);
 796                 return -1;
 797         }
 798
 799         if (fake_jump)
 800                 list_add(&fake_jump->list, &last_new_insn->list);
 801
 802         return 0;
 803 }
 804
 805 /*
 806  * A jump table entry can either convert a nop to a jump or a jump to a nop.
 807  * If the original instruction is a jump, make the alt entry an effective nop
 808  * by just skipping the original instruction.
 809  */
 810 static int handle_jump_alt(struct objtool_file *file,
 811                            struct special_alt *special_alt,
 812                            struct instruction *orig_insn,
 813                            struct instruction **new_insn)
 814 {
 815         if (orig_insn->type == INSN_NOP)
 816                 return 0;
 817
 818         if (orig_insn->type != INSN_JUMP_UNCONDITIONAL) {
 819                 WARN_FUNC("unsupported instruction at jump label",
 820                           orig_insn->sec, orig_insn->offset);
 821                 return -1;
 822         }
 823
 824         *new_insn = list_next_entry(orig_insn, list);
 825         return 0;
 826 }
 827
 828 /*
 829  * Read all the special sections which have alternate instructions which can be
 830  * patched in or redirected to at runtime.  Each instruction having alternate
 831  * instruction(s) has them added to its insn->alts list, which will be
 832  * traversed in validate_branch().
 833  */
 834 static int add_special_section_alts(struct objtool_file *file)
 835 {
 836         struct list_head special_alts;
 837         struct instruction *orig_insn, *new_insn;
 838         struct special_alt *special_alt, *tmp;
 839         struct alternative *alt;
 840         int ret;
 841
 842         ret = special_get_alts(file->elf, &special_alts);
 843         if (ret)
 844                 return ret;
 845
 846         list_for_each_entry_safe(special_alt, tmp, &special_alts, list) {
 847
 848                 orig_insn = find_insn(file, special_alt->orig_sec,
 849                                       special_alt->orig_off);
 850                 if (!orig_insn) {
 851                         WARN_FUNC("special: can't find orig instruction",
 852                                   special_alt->orig_sec, special_alt->orig_off);
 853                         ret = -1;
 854                         goto out;
 855                 }
 856
 857                 new_insn = NULL;
 858                 if (!special_alt->group || special_alt->new_len) {
 859                         new_insn = find_insn(file, special_alt->new_sec,
 860                                              special_alt->new_off);
 861                         if (!new_insn) {
 862                                 WARN_FUNC("special: can't find new instruction",
 863                                           special_alt->new_sec,
 864                                           special_alt->new_off);
 865                                 ret = -1;
 866                                 goto out;
 867                         }
 868                 }
 869
 870                 if (special_alt->group) {
 871                         ret = handle_group_alt(file, special_alt, orig_insn,
 872                                                &new_insn);
 873                         if (ret)
 874                                 goto out;
 875                 } else if (special_alt->jump_or_nop) {
 876                         ret = handle_jump_alt(file, special_alt, orig_insn,
 877                                               &new_insn);
 878                         if (ret)
 879                                 goto out;
 880                 }
 881
 882                 alt = malloc(sizeof(*alt));
 883                 if (!alt) {
 884                         WARN("malloc failed");
 885                         ret = -1;
 886                         goto out;
 887                 }
 888
 889                 alt->insn = new_insn;
 890                 alt->skip_orig = special_alt->skip_orig;
 891                 orig_insn->ignore_alts |= special_alt->skip_alt;
 892                 list_add_tail(&alt->list, &orig_insn->alts);
 893
 894                 list_del(&special_alt->list);
 895                 free(special_alt);
 896         }
 897
 898 out:
 899         return ret;
 900 }
 901
 902 static int add_jump_table(struct objtool_file *file, struct instruction *insn,
 903                             struct rela *table)
 904 {
 905         struct rela *rela = table;
 906         struct instruction *dest_insn;
 907         struct alternative *alt;
 908         struct symbol *pfunc = insn->func->pfunc;
 909         unsigned int prev_offset = 0;
 910
 911         /*
 912          * Each @rela is a switch table relocation which points to the target
 913          * instruction.
 914          */
 915         list_for_each_entry_from(rela, &table->sec->rela_list, list) {
 916
 917                 /* Check for the end of the table: */
 918                 if (rela != table && rela->jump_table_start)
 919                         break;
 920
 921                 /* Make sure the table entries are consecutive: */
 922                 if (prev_offset && rela->offset != prev_offset + 8)
 923                         break;
 924
 925                 /* Detect function pointers from contiguous objects: */
 926                 if (rela->sym->sec == pfunc->sec &&
 927                     rela->addend == pfunc->offset)
 928                         break;
 929
 930                 dest_insn = find_insn(file, rela->sym->sec, rela->addend);
 931                 if (!dest_insn)
 932                         break;
 933
 934                 /* Make sure the destination is in the same function: */
 935                 if (dest_insn->func->pfunc != pfunc)
 936                         break;
 937
 938                 alt = malloc(sizeof(*alt));
 939                 if (!alt) {
 940                         WARN("malloc failed");
 941                         return -1;
 942                 }
 943
 944                 alt->insn = dest_insn;
 945                 list_add_tail(&alt->list, &insn->alts);
 946                 prev_offset = rela->offset;
 947         }
 948
 949         if (!prev_offset) {
 950                 WARN_FUNC("can't find switch jump table",
 951                           insn->sec, insn->offset);
 952                 return -1;
 953         }
 954
 955         return 0;
 956 }
 957
 958 /*
 959  * find_jump_table() - Given a dynamic jump, find the switch jump table in
 960  * .rodata associated with it.
 961  *
 962  * There are 3 basic patterns:
 963  *
 964  * 1. jmpq *[rodata addr](,%reg,8)
 965  *
 966  *    This is the most common case by far.  It jumps to an address in a simple
 967  *    jump table which is stored in .rodata.
 968  *
 969  * 2. jmpq *[rodata addr](%rip)
 970  *
 971  *    This is caused by a rare GCC quirk, currently only seen in three driver
 972  *    functions in the kernel, only with certain obscure non-distro configs.
 973  *
 974  *    As part of an optimization, GCC makes a copy of an existing switch jump
 975  *    table, modifies it, and then hard-codes the jump (albeit with an indirect
 976  *    jump) to use a single entry in the table.  The rest of the jump table and
 977  *    some of its jump targets remain as dead code.
 978  *
 979  *    In such a case we can just crudely ignore all unreachable instruction
 980  *    warnings for the entire object file.  Ideally we would just ignore them
 981  *    for the function, but that would require redesigning the code quite a
 982  *    bit.  And honestly that's just not worth doing: unreachable instruction
 983  *    warnings are of questionable value anyway, and this is such a rare issue.
 984  *
 985  * 3. mov [rodata addr],%reg1
 986  *    ... some instructions ...
 987  *    jmpq *(%reg1,%reg2,8)
 988  *
 989  *    This is a fairly uncommon pattern which is new for GCC 6.  As of this
 990  *    writing, there are 11 occurrences of it in the allmodconfig kernel.
 991  *
 992  *    As of GCC 7 there are quite a few more of these and the 'in between' code
 993  *    is significant. Esp. with KASAN enabled some of the code between the mov
 994  *    and jmpq uses .rodata itself, which can confuse things.
 995  *
 996  *    TODO: Once we have DWARF CFI and smarter instruction decoding logic,
 997  *    ensure the same register is used in the mov and jump instructions.
 998  *
 999  *    NOTE: RETPOLINE made it harder still to decode dynamic jumps.
1000  */
1001 static struct rela *find_jump_table(struct objtool_file *file,
1002                                       struct symbol *func,
1003                                       struct instruction *insn)
1004 {
1005         struct rela *text_rela, *table_rela;
1006         struct instruction *orig_insn = insn;
1007         struct section *table_sec;
1008         unsigned long table_offset;
1009
1010         /*
1011          * Backward search using the @first_jump_src links, these help avoid
1012          * much of the 'in between' code. Which avoids us getting confused by
1013          * it.
1014          */
1015         for (;
1016              &insn->list != &file->insn_list &&
1017              insn->sec == func->sec &&
1018              insn->offset >= func->offset;
1019
1020              insn = insn->first_jump_src ?: list_prev_entry(insn, list)) {
1021
1022                 if (insn != orig_insn && insn->type == INSN_JUMP_DYNAMIC)
1023                         break;
1024
1025                 /* allow small jumps within the range */
1026                 if (insn->type == INSN_JUMP_UNCONDITIONAL &&
1027                     insn->jump_dest &&
1028                     (insn->jump_dest->offset <= insn->offset ||
1029                      insn->jump_dest->offset > orig_insn->offset))
1030                     break;
1031
1032                 /* look for a relocation which references .rodata */
1033                 text_rela = find_rela_by_dest_range(insn->sec, insn->offset,
1034                                                     insn->len);
1035                 if (!text_rela || text_rela->sym->type != STT_SECTION ||
1036                     !text_rela->sym->sec->rodata)
1037                         continue;
1038
1039                 table_offset = text_rela->addend;
1040                 table_sec = text_rela->sym->sec;
1041
1042                 if (text_rela->type == R_X86_64_PC32)
1043                         table_offset += 4;
1044
1045                 /*
1046                  * Make sure the .rodata address isn't associated with a
1047                  * symbol.  GCC jump tables are anonymous data.
1048                  *
1049                  * Also support C jump tables which are in the same format as
1050                  * switch jump tables.  For objtool to recognize them, they
1051                  * need to be placed in the C_JUMP_TABLE_SECTION section.  They
1052                  * have symbols associated with them.
1053                  */
1054                 if (find_symbol_containing(table_sec, table_offset) &&
1055                     strcmp(table_sec->name, C_JUMP_TABLE_SECTION))
1056                         continue;
1057
1058                 /* Each table entry has a rela associated with it. */
1059                 table_rela = find_rela_by_dest(table_sec, table_offset);
1060                 if (!table_rela)
1061                         continue;
1062
1063                 /*
1064                  * Use of RIP-relative switch jumps is quite rare, and
1065                  * indicates a rare GCC quirk/bug which can leave dead code
1066                  * behind.
1067                  */
1068                 if (text_rela->type == R_X86_64_PC32)
1069                         file->ignore_unreachables = true;
1070
1071                 return table_rela;
1072         }
1073
1074         return NULL;
1075 }
1076
1077 /*
1078  * First pass: Mark the head of each jump table so that in the next pass,
1079  * we know when a given jump table ends and the next one starts.
1080  */
1081 static void mark_func_jump_tables(struct objtool_file *file,
1082                                     struct symbol *func)
1083 {
1084         struct instruction *insn, *last = NULL;
1085         struct rela *rela;
1086
1087         func_for_each_insn_all(file, func, insn) {
1088                 if (!last)
1089                         last = insn;
1090
1091                 /*
1092                  * Store back-pointers for unconditional forward jumps such
1093                  * that find_jump_table() can back-track using those and
1094                  * avoid some potentially confusing code.
1095                  */
1096                 if (insn->type == INSN_JUMP_UNCONDITIONAL && insn->jump_dest &&
1097                     insn->offset > last->offset &&
1098                     insn->jump_dest->offset > insn->offset &&
1099                     !insn->jump_dest->first_jump_src) {
1100
1101                         insn->jump_dest->first_jump_src = insn;
1102                         last = insn->jump_dest;
1103                 }
1104
1105                 if (insn->type != INSN_JUMP_DYNAMIC)
1106                         continue;
1107
1108                 rela = find_jump_table(file, func, insn);
1109                 if (rela) {
1110                         rela->jump_table_start = true;
1111                         insn->jump_table = rela;
1112                 }
1113         }
1114 }
1115
1116 static int add_func_jump_tables(struct objtool_file *file,
1117                                   struct symbol *func)
1118 {
1119         struct instruction *insn;
1120         int ret;
1121
1122         func_for_each_insn_all(file, func, insn) {
1123                 if (!insn->jump_table)
1124                         continue;
1125
1126                 ret = add_jump_table(file, insn, insn->jump_table);
1127                 if (ret)
1128                         return ret;
1129         }
1130
1131         return 0;
1132 }
1133
1134 /*
1135  * For some switch statements, gcc generates a jump table in the .rodata
1136  * section which contains a list of addresses within the function to jump to.
1137  * This finds these jump tables and adds them to the insn->alts lists.
1138  */
1139 static int add_jump_table_alts(struct objtool_file *file)
1140 {
1141         struct section *sec;
1142         struct symbol *func;
1143         int ret;
1144
1145         if (!file->rodata)
1146                 return 0;
1147
1148         for_each_sec(file, sec) {
1149                 list_for_each_entry(func, &sec->symbol_list, list) {
1150                         if (func->type != STT_FUNC)
1151                                 continue;
1152
1153                         mark_func_jump_tables(file, func);
1154                         ret = add_func_jump_tables(file, func);
1155                         if (ret)
1156                                 return ret;
1157                 }
1158         }
1159
1160         return 0;
1161 }
1162
1163 static int read_unwind_hints(struct objtool_file *file)
1164 {
1165         struct section *sec, *relasec;
1166         struct rela *rela;
1167         struct unwind_hint *hint;
1168         struct instruction *insn;
1169         struct cfi_reg *cfa;
1170         int i;
1171
1172         sec = find_section_by_name(file->elf, ".discard.unwind_hints");
1173         if (!sec)
1174                 return 0;
1175
1176         relasec = sec->rela;
1177         if (!relasec) {
1178                 WARN("missing .rela.discard.unwind_hints section");
1179                 return -1;
1180         }
1181
1182         if (sec->len % sizeof(struct unwind_hint)) {
1183                 WARN("struct unwind_hint size mismatch");
1184                 return -1;
1185         }
1186
1187         file->hints = true;
1188
1189         for (i = 0; i < sec->len / sizeof(struct unwind_hint); i++) {
1190                 hint = (struct unwind_hint *)sec->data->d_buf + i;
1191
1192                 rela = find_rela_by_dest(sec, i * sizeof(*hint));
1193                 if (!rela) {
1194                         WARN("can't find rela for unwind_hints[%d]", i);
1195                         return -1;
1196                 }
1197
1198                 insn = find_insn(file, rela->sym->sec, rela->addend);
1199                 if (!insn) {
1200                         WARN("can't find insn for unwind_hints[%d]", i);
1201                         return -1;
1202                 }
1203
1204                 cfa = &insn->state.cfa;
1205
1206                 if (hint->type == UNWIND_HINT_TYPE_SAVE) {
1207                         insn->save = true;
1208                         continue;
1209
1210                 } else if (hint->type == UNWIND_HINT_TYPE_RESTORE) {
1211                         insn->restore = true;
1212                         insn->hint = true;
1213                         continue;
1214                 }
1215
1216                 insn->hint = true;
1217
1218                 switch (hint->sp_reg) {
1219                 case ORC_REG_UNDEFINED:
1220                         cfa->base = CFI_UNDEFINED;
1221                         break;
1222                 case ORC_REG_SP:
1223                         cfa->base = CFI_SP;
1224                         break;
1225                 case ORC_REG_BP:
1226                         cfa->base = CFI_BP;
1227                         break;
1228                 case ORC_REG_SP_INDIRECT:
1229                         cfa->base = CFI_SP_INDIRECT;
1230                         break;
1231                 case ORC_REG_R10:
1232                         cfa->base = CFI_R10;
1233                         break;
1234                 case ORC_REG_R13:
1235                         cfa->base = CFI_R13;
1236                         break;
1237                 case ORC_REG_DI:
1238                         cfa->base = CFI_DI;
1239                         break;
1240                 case ORC_REG_DX:
1241                         cfa->base = CFI_DX;
1242                         break;
1243                 default:
1244                         WARN_FUNC("unsupported unwind_hint sp base reg %d",
1245                                   insn->sec, insn->offset, hint->sp_reg);
1246                         return -1;
1247                 }
1248
1249                 cfa->offset = hint->sp_offset;
1250                 insn->state.type = hint->type;
1251                 insn->state.end = hint->end;
1252         }
1253
1254         return 0;
1255 }
1256
1257 static int read_retpoline_hints(struct objtool_file *file)
1258 {
1259         struct section *sec;
1260         struct instruction *insn;
1261         struct rela *rela;
1262
1263         sec = find_section_by_name(file->elf, ".rela.discard.retpoline_safe");
1264         if (!sec)
1265                 return 0;
1266
1267         list_for_each_entry(rela, &sec->rela_list, list) {
1268                 if (rela->sym->type != STT_SECTION) {
1269                         WARN("unexpected relocation symbol type in %s", sec->name);
1270                         return -1;
1271                 }
1272
1273                 insn = find_insn(file, rela->sym->sec, rela->addend);
1274                 if (!insn) {
1275                         WARN("bad .discard.retpoline_safe entry");
1276                         return -1;
1277                 }
1278
1279                 if (insn->type != INSN_JUMP_DYNAMIC &&
1280                     insn->type != INSN_CALL_DYNAMIC) {
1281                         WARN_FUNC("retpoline_safe hint not an indirect jump/call",
1282                                   insn->sec, insn->offset);
1283                         return -1;
1284                 }
1285
1286                 insn->retpoline_safe = true;
1287         }
1288
1289         return 0;
1290 }
1291
1292 static void mark_rodata(struct objtool_file *file)
1293 {
1294         struct section *sec;
1295         bool found = false;
1296
1297         /*
1298          * Search for the following rodata sections, each of which can
1299          * potentially contain jump tables:
1300          *
1301          * - .rodata: can contain GCC switch tables
1302          * - .rodata.<func>: same, if -fdata-sections is being used
1303          * - .rodata..c_jump_table: contains C annotated jump tables
1304          *
1305          * .rodata.str1.* sections are ignored; they don't contain jump tables.
1306          */
1307         for_each_sec(file, sec) {
1308                 if ((!strncmp(sec->name, ".rodata", 7) && !strstr(sec->name, ".str1.")) ||
1309                     !strcmp(sec->name, C_JUMP_TABLE_SECTION)) {
1310                         sec->rodata = true;
1311                         found = true;
1312                 }
1313         }
1314
1315         file->rodata = found;
1316 }
1317
1318 static int decode_sections(struct objtool_file *file)
1319 {
1320         int ret;
1321
1322         mark_rodata(file);
1323
1324         ret = decode_instructions(file);
1325         if (ret)
1326                 return ret;
1327
1328         ret = add_dead_ends(file);
1329         if (ret)
1330                 return ret;
1331
1332         add_ignores(file);
1333         add_uaccess_safe(file);
1334
1335         ret = add_ignore_alternatives(file);
1336         if (ret)
1337                 return ret;
1338
1339         ret = add_jump_destinations(file);
1340         if (ret)
1341                 return ret;
1342
1343         ret = add_special_section_alts(file);
1344         if (ret)
1345                 return ret;
1346
1347         ret = add_call_destinations(file);
1348         if (ret)
1349                 return ret;
1350
1351         ret = add_jump_table_alts(file);
1352         if (ret)
1353                 return ret;
1354
1355         ret = read_unwind_hints(file);
1356         if (ret)
1357                 return ret;
1358
1359         ret = read_retpoline_hints(file);
1360         if (ret)
1361                 return ret;
1362
1363         return 0;
1364 }
1365
1366 static bool is_fentry_call(struct instruction *insn)
1367 {
1368         if (insn->type == INSN_CALL &&
1369             insn->call_dest->type == STT_NOTYPE &&
1370             !strcmp(insn->call_dest->name, "__fentry__"))
1371                 return true;
1372
1373         return false;
1374 }
1375
1376 static bool has_modified_stack_frame(struct insn_state *state)
1377 {
1378         int i;
1379
1380         if (state->cfa.base != initial_func_cfi.cfa.base ||
1381             state->cfa.offset != initial_func_cfi.cfa.offset ||
1382             state->stack_size != initial_func_cfi.cfa.offset ||
1383             state->drap)
1384                 return true;
1385
1386         for (i = 0; i < CFI_NUM_REGS; i++)
1387                 if (state->regs[i].base != initial_func_cfi.regs[i].base ||
1388                     state->regs[i].offset != initial_func_cfi.regs[i].offset)
1389                         return true;
1390
1391         return false;
1392 }
1393
1394 static bool has_valid_stack_frame(struct insn_state *state)
1395 {
1396         if (state->cfa.base == CFI_BP && state->regs[CFI_BP].base == CFI_CFA &&
1397             state->regs[CFI_BP].offset == -16)
1398                 return true;
1399
1400         if (state->drap && state->regs[CFI_BP].base == CFI_BP)
1401                 return true;
1402
1403         return false;
1404 }
1405
1406 static int update_insn_state_regs(struct instruction *insn, struct insn_state *state)
1407 {
1408         struct cfi_reg *cfa = &state->cfa;
1409         struct stack_op *op = &insn->stack_op;
1410
1411         if (cfa->base != CFI_SP)
1412                 return 0;
1413
1414         /* push */
1415         if (op->dest.type == OP_DEST_PUSH || op->dest.type == OP_DEST_PUSHF)
1416                 cfa->offset += 8;
1417
1418         /* pop */
1419         if (op->src.type == OP_SRC_POP || op->src.type == OP_SRC_POPF)
1420                 cfa->offset -= 8;
1421
1422         /* add immediate to sp */
1423         if (op->dest.type == OP_DEST_REG && op->src.type == OP_SRC_ADD &&
1424             op->dest.reg == CFI_SP && op->src.reg == CFI_SP)
1425                 cfa->offset -= op->src.offset;
1426
1427         return 0;
1428 }
1429
1430 static void save_reg(struct insn_state *state, unsigned char reg, int base,
1431                      int offset)
1432 {
1433         if (arch_callee_saved_reg(reg) &&
1434             state->regs[reg].base == CFI_UNDEFINED) {
1435                 state->regs[reg].base = base;
1436                 state->regs[reg].offset = offset;
1437         }
1438 }
1439
1440 static void restore_reg(struct insn_state *state, unsigned char reg)
1441 {
1442         state->regs[reg].base = CFI_UNDEFINED;
1443         state->regs[reg].offset = 0;
1444 }
1445
1446 /*
1447  * A note about DRAP stack alignment:
1448  *
1449  * GCC has the concept of a DRAP register, which is used to help keep track of
1450  * the stack pointer when aligning the stack.  r10 or r13 is used as the DRAP
1451  * register.  The typical DRAP pattern is:
1452  *
1453  *   4c 8d 54 24 08             lea    0x8(%rsp),%r10
1454  *   48 83 e4 c0                and    $0xffffffffffffffc0,%rsp
1455  *   41 ff 72 f8                pushq  -0x8(%r10)
1456  *   55                         push   %rbp
1457  *   48 89 e5                   mov    %rsp,%rbp
1458  *                              (more pushes)
1459  *   41 52                      push   %r10
1460  *                              ...
1461  *   41 5a                      pop    %r10
1462  *                              (more pops)
1463  *   5d                         pop    %rbp
1464  *   49 8d 62 f8                lea    -0x8(%r10),%rsp
1465  *   c3                         retq
1466  *
1467  * There are some variations in the epilogues, like:
1468  *
1469  *   5b                         pop    %rbx
1470  *   41 5a                      pop    %r10
1471  *   41 5c                      pop    %r12
1472  *   41 5d                      pop    %r13
1473  *   41 5e                      pop    %r14
1474  *   c9                         leaveq
1475  *   49 8d 62 f8                lea    -0x8(%r10),%rsp
1476  *   c3                         retq
1477  *
1478  * and:
1479  *
1480  *   4c 8b 55 e8                mov    -0x18(%rbp),%r10
1481  *   48 8b 5d e0                mov    -0x20(%rbp),%rbx
1482  *   4c 8b 65 f0                mov    -0x10(%rbp),%r12
1483  *   4c 8b 6d f8                mov    -0x8(%rbp),%r13
1484  *   c9                         leaveq
1485  *   49 8d 62 f8                lea    -0x8(%r10),%rsp
1486  *   c3                         retq
1487  *
1488  * Sometimes r13 is used as the DRAP register, in which case it's saved and
1489  * restored beforehand:
1490  *
1491  *   41 55                      push   %r13
1492  *   4c 8d 6c 24 10             lea    0x10(%rsp),%r13
1493  *   48 83 e4 f0                and    $0xfffffffffffffff0,%rsp
1494  *                              ...
1495  *   49 8d 65 f0                lea    -0x10(%r13),%rsp
1496  *   41 5d                      pop    %r13
1497  *   c3                         retq
1498  */
1499 static int update_insn_state(struct instruction *insn, struct insn_state *state)
1500 {
1501         struct stack_op *op = &insn->stack_op;
1502         struct cfi_reg *cfa = &state->cfa;
1503         struct cfi_reg *regs = state->regs;
1504
1505         /* stack operations don't make sense with an undefined CFA */
1506         if (cfa->base == CFI_UNDEFINED) {
1507                 if (insn->func) {
1508                         WARN_FUNC("undefined stack state", insn->sec, insn->offset);
1509                         return -1;
1510                 }
1511                 return 0;
1512         }
1513
1514         if (state->type == ORC_TYPE_REGS || state->type == ORC_TYPE_REGS_IRET)
1515                 return update_insn_state_regs(insn, state);
1516
1517         switch (op->dest.type) {
1518
1519         case OP_DEST_REG:
1520                 switch (op->src.type) {
1521
1522                 case OP_SRC_REG:
1523                         if (op->src.reg == CFI_SP && op->dest.reg == CFI_BP &&
1524                             cfa->base == CFI_SP &&
1525                             regs[CFI_BP].base == CFI_CFA &&
1526                             regs[CFI_BP].offset == -cfa->offset) {
1527
1528                                 /* mov %rsp, %rbp */
1529                                 cfa->base = op->dest.reg;
1530                                 state->bp_scratch = false;
1531                         }
1532
1533                         else if (op->src.reg == CFI_SP &&
1534                                  op->dest.reg == CFI_BP && state->drap) {
1535
1536                                 /* drap: mov %rsp, %rbp */
1537                                 regs[CFI_BP].base = CFI_BP;
1538                                 regs[CFI_BP].offset = -state->stack_size;
1539                                 state->bp_scratch = false;
1540                         }
1541
1542                         else if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1543
1544                                 /*
1545                                  * mov %rsp, %reg
1546                                  *
1547                                  * This is needed for the rare case where GCC
1548                                  * does:
1549                                  *
1550                                  *   mov    %rsp, %rax
1551                                  *   ...
1552                                  *   mov    %rax, %rsp
1553                                  */
1554                                 state->vals[op->dest.reg].base = CFI_CFA;
1555                                 state->vals[op->dest.reg].offset = -state->stack_size;
1556                         }
1557
1558                         else if (op->src.reg == CFI_BP && op->dest.reg == CFI_SP &&
1559                                  cfa->base == CFI_BP) {
1560
1561                                 /*
1562                                  * mov %rbp, %rsp
1563                                  *
1564                                  * Restore the original stack pointer (Clang).
1565                                  */
1566                                 state->stack_size = -state->regs[CFI_BP].offset;
1567                         }
1568
1569                         else if (op->dest.reg == cfa->base) {
1570
1571                                 /* mov %reg, %rsp */
1572                                 if (cfa->base == CFI_SP &&
1573                                     state->vals[op->src.reg].base == CFI_CFA) {
1574
1575                                         /*
1576                                          * This is needed for the rare case
1577                                          * where GCC does something dumb like:
1578                                          *
1579                                          *   lea    0x8(%rsp), %rcx
1580                                          *   ...
1581                                          *   mov    %rcx, %rsp
1582                                          */
1583                                         cfa->offset = -state->vals[op->src.reg].offset;
1584                                         state->stack_size = cfa->offset;
1585
1586                                 } else {
1587                                         cfa->base = CFI_UNDEFINED;
1588                                         cfa->offset = 0;
1589                                 }
1590                         }
1591
1592                         break;
1593
1594                 case OP_SRC_ADD:
1595                         if (op->dest.reg == CFI_SP && op->src.reg == CFI_SP) {
1596
1597                                 /* add imm, %rsp */
1598                                 state->stack_size -= op->src.offset;
1599                                 if (cfa->base == CFI_SP)
1600                                         cfa->offset -= op->src.offset;
1601                                 break;
1602                         }
1603
1604                         if (op->dest.reg == CFI_SP && op->src.reg == CFI_BP) {
1605
1606                                 /* lea disp(%rbp), %rsp */
1607                                 state->stack_size = -(op->src.offset + regs[CFI_BP].offset);
1608                                 break;
1609                         }
1610
1611                         if (op->src.reg == CFI_SP && cfa->base == CFI_SP) {
1612
1613                                 /* drap: lea disp(%rsp), %drap */
1614                                 state->drap_reg = op->dest.reg;
1615
1616                                 /*
1617                                  * lea disp(%rsp), %reg
1618                                  *
1619                                  * This is needed for the rare case where GCC
1620                                  * does something dumb like:
1621                                  *
1622                                  *   lea    0x8(%rsp), %rcx
1623                                  *   ...
1624                                  *   mov    %rcx, %rsp
1625                                  */
1626                                 state->vals[op->dest.reg].base = CFI_CFA;
1627                                 state->vals[op->dest.reg].offset = \
1628                                         -state->stack_size + op->src.offset;
1629
1630                                 break;
1631                         }
1632
1633                         if (state->drap && op->dest.reg == CFI_SP &&
1634                             op->src.reg == state->drap_reg) {
1635
1636                                  /* drap: lea disp(%drap), %rsp */
1637                                 cfa->base = CFI_SP;
1638                                 cfa->offset = state->stack_size = -op->src.offset;
1639                                 state->drap_reg = CFI_UNDEFINED;
1640                                 state->drap = false;
1641                                 break;
1642                         }
1643
1644                         if (op->dest.reg == state->cfa.base) {
1645                                 WARN_FUNC("unsupported stack register modification",
1646                                           insn->sec, insn->offset);
1647                                 return -1;
1648                         }
1649
1650                         break;
1651
1652                 case OP_SRC_AND:
1653                         if (op->dest.reg != CFI_SP ||
1654                             (state->drap_reg != CFI_UNDEFINED && cfa->base != CFI_SP) ||
1655                             (state->drap_reg == CFI_UNDEFINED && cfa->base != CFI_BP)) {
1656                                 WARN_FUNC("unsupported stack pointer realignment",
1657                                           insn->sec, insn->offset);
1658                                 return -1;
1659                         }
1660
1661                         if (state->drap_reg != CFI_UNDEFINED) {
1662                                 /* drap: and imm, %rsp */
1663                                 cfa->base = state->drap_reg;
1664                                 cfa->offset = state->stack_size = 0;
1665                                 state->drap = true;
1666                         }
1667
1668                         /*
1669                          * Older versions of GCC (4.8ish) realign the stack
1670                          * without DRAP, with a frame pointer.
1671                          */
1672
1673                         break;
1674
1675                 case OP_SRC_POP:
1676                 case OP_SRC_POPF:
1677                         if (!state->drap && op->dest.type == OP_DEST_REG &&
1678                             op->dest.reg == cfa->base) {
1679
1680                                 /* pop %rbp */
1681                                 cfa->base = CFI_SP;
1682                         }
1683
1684                         if (state->drap && cfa->base == CFI_BP_INDIRECT &&
1685                             op->dest.type == OP_DEST_REG &&
1686                             op->dest.reg == state->drap_reg &&
1687                             state->drap_offset == -state->stack_size) {
1688
1689                                 /* drap: pop %drap */
1690                                 cfa->base = state->drap_reg;
1691                                 cfa->offset = 0;
1692                                 state->drap_offset = -1;
1693
1694                         } else if (regs[op->dest.reg].offset == -state->stack_size) {
1695
1696                                 /* pop %reg */
1697                                 restore_reg(state, op->dest.reg);
1698                         }
1699
1700                         state->stack_size -= 8;
1701                         if (cfa->base == CFI_SP)
1702                                 cfa->offset -= 8;
1703
1704                         break;
1705
1706                 case OP_SRC_REG_INDIRECT:
1707                         if (state->drap && op->src.reg == CFI_BP &&
1708                             op->src.offset == state->drap_offset) {
1709
1710                                 /* drap: mov disp(%rbp), %drap */
1711                                 cfa->base = state->drap_reg;
1712                                 cfa->offset = 0;
1713                                 state->drap_offset = -1;
1714                         }
1715
1716                         if (state->drap && op->src.reg == CFI_BP &&
1717                             op->src.offset == regs[op->dest.reg].offset) {
1718
1719                                 /* drap: mov disp(%rbp), %reg */
1720                                 restore_reg(state, op->dest.reg);
1721
1722                         } else if (op->src.reg == cfa->base &&
1723                             op->src.offset == regs[op->dest.reg].offset + cfa->offset) {
1724
1725                                 /* mov disp(%rbp), %reg */
1726                                 /* mov disp(%rsp), %reg */
1727                                 restore_reg(state, op->dest.reg);
1728                         }
1729
1730                         break;
1731
1732                 default:
1733                         WARN_FUNC("unknown stack-related instruction",
1734                                   insn->sec, insn->offset);
1735                         return -1;
1736                 }
1737
1738                 break;
1739
1740         case OP_DEST_PUSH:
1741         case OP_DEST_PUSHF:
1742                 state->stack_size += 8;
1743                 if (cfa->base == CFI_SP)
1744                         cfa->offset += 8;
1745
1746                 if (op->src.type != OP_SRC_REG)
1747                         break;
1748
1749                 if (state->drap) {
1750                         if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1751
1752                                 /* drap: push %drap */
1753                                 cfa->base = CFI_BP_INDIRECT;
1754                                 cfa->offset = -state->stack_size;
1755
1756                                 /* save drap so we know when to restore it */
1757                                 state->drap_offset = -state->stack_size;
1758
1759                         } else if (op->src.reg == CFI_BP && cfa->base == state->drap_reg) {
1760
1761                                 /* drap: push %rbp */
1762                                 state->stack_size = 0;
1763
1764                         } else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1765
1766                                 /* drap: push %reg */
1767                                 save_reg(state, op->src.reg, CFI_BP, -state->stack_size);
1768                         }
1769
1770                 } else {
1771
1772                         /* push %reg */
1773                         save_reg(state, op->src.reg, CFI_CFA, -state->stack_size);
1774                 }
1775
1776                 /* detect when asm code uses rbp as a scratch register */
1777                 if (!no_fp && insn->func && op->src.reg == CFI_BP &&
1778                     cfa->base != CFI_BP)
1779                         state->bp_scratch = true;
1780                 break;
1781
1782         case OP_DEST_REG_INDIRECT:
1783
1784                 if (state->drap) {
1785                         if (op->src.reg == cfa->base && op->src.reg == state->drap_reg) {
1786
1787                                 /* drap: mov %drap, disp(%rbp) */
1788                                 cfa->base = CFI_BP_INDIRECT;
1789                                 cfa->offset = op->dest.offset;
1790
1791                                 /* save drap offset so we know when to restore it */
1792                                 state->drap_offset = op->dest.offset;
1793                         }
1794
1795                         else if (regs[op->src.reg].base == CFI_UNDEFINED) {
1796
1797                                 /* drap: mov reg, disp(%rbp) */
1798                                 save_reg(state, op->src.reg, CFI_BP, op->dest.offset);
1799                         }
1800
1801                 } else if (op->dest.reg == cfa->base) {
1802
1803                         /* mov reg, disp(%rbp) */
1804                         /* mov reg, disp(%rsp) */
1805                         save_reg(state, op->src.reg, CFI_CFA,
1806                                  op->dest.offset - state->cfa.offset);
1807                 }
1808
1809                 break;
1810
1811         case OP_DEST_LEAVE:
1812                 if ((!state->drap && cfa->base != CFI_BP) ||
1813                     (state->drap && cfa->base != state->drap_reg)) {
1814                         WARN_FUNC("leave instruction with modified stack frame",
1815                                   insn->sec, insn->offset);
1816                         return -1;
1817                 }
1818
1819                 /* leave (mov %rbp, %rsp; pop %rbp) */
1820
1821                 state->stack_size = -state->regs[CFI_BP].offset - 8;
1822                 restore_reg(state, CFI_BP);
1823
1824                 if (!state->drap) {
1825                         cfa->base = CFI_SP;
1826                         cfa->offset -= 8;
1827                 }
1828
1829                 break;
1830
1831         case OP_DEST_MEM:
1832                 if (op->src.type != OP_SRC_POP && op->src.type != OP_SRC_POPF) {
1833                         WARN_FUNC("unknown stack-related memory operation",
1834                                   insn->sec, insn->offset);
1835                         return -1;
1836                 }
1837
1838                 /* pop mem */
1839                 state->stack_size -= 8;
1840                 if (cfa->base == CFI_SP)
1841                         cfa->offset -= 8;
1842
1843                 break;
1844
1845         default:
1846                 WARN_FUNC("unknown stack-related instruction",
1847                           insn->sec, insn->offset);
1848                 return -1;
1849         }
1850
1851         return 0;
1852 }
1853
1854 static bool insn_state_match(struct instruction *insn, struct insn_state *state)
1855 {
1856         struct insn_state *state1 = &insn->state, *state2 = state;
1857         int i;
1858
1859         if (memcmp(&state1->cfa, &state2->cfa, sizeof(state1->cfa))) {
1860                 WARN_FUNC("stack state mismatch: cfa1=%d%+d cfa2=%d%+d",
1861                           insn->sec, insn->offset,
1862                           state1->cfa.base, state1->cfa.offset,
1863                           state2->cfa.base, state2->cfa.offset);
1864
1865         } else if (memcmp(&state1->regs, &state2->regs, sizeof(state1->regs))) {
1866                 for (i = 0; i < CFI_NUM_REGS; i++) {
1867                         if (!memcmp(&state1->regs[i], &state2->regs[i],
1868                                     sizeof(struct cfi_reg)))
1869                                 continue;
1870
1871                         WARN_FUNC("stack state mismatch: reg1[%d]=%d%+d reg2[%d]=%d%+d",
1872                                   insn->sec, insn->offset,
1873                                   i, state1->regs[i].base, state1->regs[i].offset,
1874                                   i, state2->regs[i].base, state2->regs[i].offset);
1875                         break;
1876                 }
1877
1878         } else if (state1->type != state2->type) {
1879                 WARN_FUNC("stack state mismatch: type1=%d type2=%d",
1880                           insn->sec, insn->offset, state1->type, state2->type);
1881
1882         } else if (state1->drap != state2->drap ||
1883                  (state1->drap && state1->drap_reg != state2->drap_reg) ||
1884                  (state1->drap && state1->drap_offset != state2->drap_offset)) {
1885                 WARN_FUNC("stack state mismatch: drap1=%d(%d,%d) drap2=%d(%d,%d)",
1886                           insn->sec, insn->offset,
1887                           state1->drap, state1->drap_reg, state1->drap_offset,
1888                           state2->drap, state2->drap_reg, state2->drap_offset);
1889
1890         } else
1891                 return true;
1892
1893         return false;
1894 }
1895
1896 static inline bool func_uaccess_safe(struct symbol *func)
1897 {
1898         if (func)
1899                 return func->uaccess_safe;
1900
1901         return false;
1902 }
1903
1904 static inline const char *call_dest_name(struct instruction *insn)
1905 {
1906         if (insn->call_dest)
1907                 return insn->call_dest->name;
1908
1909         return "{dynamic}";
1910 }
1911
1912 static int validate_call(struct instruction *insn, struct insn_state *state)
1913 {
1914         if (state->uaccess && !func_uaccess_safe(insn->call_dest)) {
1915                 WARN_FUNC("call to %s() with UACCESS enabled",
1916                                 insn->sec, insn->offset, call_dest_name(insn));
1917                 return 1;
1918         }
1919
1920         if (state->df) {
1921                 WARN_FUNC("call to %s() with DF set",
1922                                 insn->sec, insn->offset, call_dest_name(insn));
1923                 return 1;
1924         }
1925
1926         return 0;
1927 }
1928
1929 static int validate_sibling_call(struct instruction *insn, struct insn_state *state)
1930 {
1931         if (has_modified_stack_frame(state)) {
1932                 WARN_FUNC("sibling call from callable instruction with modified stack frame",
1933                                 insn->sec, insn->offset);
1934                 return 1;
1935         }
1936
1937         return validate_call(insn, state);
1938 }
1939
1940 /*
1941  * Follow the branch starting at the given instruction, and recursively follow
1942  * any other branches (jumps).  Meanwhile, track the frame pointer state at
1943  * each instruction and validate all the rules described in
1944  * tools/objtool/Documentation/stack-validation.txt.
1945  */
1946 static int validate_branch(struct objtool_file *file, struct symbol *func,
1947                            struct instruction *first, struct insn_state state)
1948 {
1949         struct alternative *alt;
1950         struct instruction *insn, *next_insn;
1951         struct section *sec;
1952         int ret;
1953
1954         insn = first;
1955         sec = insn->sec;
1956
1957         if (insn->alt_group && list_empty(&insn->alts)) {
1958                 WARN_FUNC("don't know how to handle branch to middle of alternative instruction group",
1959                           sec, insn->offset);
1960                 return 1;
1961         }
1962
1963         while (1) {
1964                 next_insn = next_insn_same_sec(file, insn);
1965
1966                 if (file->c_file && func && insn->func && func != insn->func->pfunc) {
1967                         WARN("%s() falls through to next function %s()",
1968                              func->name, insn->func->name);
1969                         return 1;
1970                 }
1971
1972                 if (func && insn->ignore) {
1973                         WARN_FUNC("BUG: why am I validating an ignored function?",
1974                                   sec, insn->offset);
1975                         return 1;
1976                 }
1977
1978                 if (insn->visited) {
1979                         if (!insn->hint && !insn_state_match(insn, &state))
1980                                 return 1;
1981
1982                         /* If we were here with AC=0, but now have AC=1, go again */
1983                         if (insn->state.uaccess || !state.uaccess)
1984                                 return 0;
1985                 }
1986
1987                 if (insn->hint) {
1988                         if (insn->restore) {
1989                                 struct instruction *save_insn, *i;
1990
1991                                 i = insn;
1992                                 save_insn = NULL;
1993                                 func_for_each_insn_continue_reverse(file, func, i) {
1994                                         if (i->save) {
1995                                                 save_insn = i;
1996                                                 break;
1997                                         }
1998                                 }
1999
2000                                 if (!save_insn) {
2001                                         WARN_FUNC("no corresponding CFI save for CFI restore",
2002                                                   sec, insn->offset);
2003                                         return 1;
2004                                 }
2005
2006                                 if (!save_insn->visited) {
2007                                         /*
2008                                          * Oops, no state to copy yet.
2009                                          * Hopefully we can reach this
2010                                          * instruction from another branch
2011                                          * after the save insn has been
2012                                          * visited.
2013                                          */
2014                                         if (insn == first)
2015                                                 return 0;
2016
2017                                         WARN_FUNC("objtool isn't smart enough to handle this CFI save/restore combo",
2018                                                   sec, insn->offset);
2019                                         return 1;
2020                                 }
2021
2022                                 insn->state = save_insn->state;
2023                         }
2024
2025                         state = insn->state;
2026
2027                 } else
2028                         insn->state = state;
2029
2030                 insn->visited = true;
2031
2032                 if (!insn->ignore_alts) {
2033                         bool skip_orig = false;
2034
2035                         list_for_each_entry(alt, &insn->alts, list) {
2036                                 if (alt->skip_orig)
2037                                         skip_orig = true;
2038
2039                                 ret = validate_branch(file, func, alt->insn, state);
2040                                 if (ret) {
2041                                         if (backtrace)
2042                                                 BT_FUNC("(alt)", insn);
2043                                         return ret;
2044                                 }
2045                         }
2046
2047                         if (skip_orig)
2048                                 return 0;
2049                 }
2050
2051                 switch (insn->type) {
2052
2053                 case INSN_RETURN:
2054                         if (state.uaccess && !func_uaccess_safe(func)) {
2055                                 WARN_FUNC("return with UACCESS enabled", sec, insn->offset);
2056                                 return 1;
2057                         }
2058
2059                         if (!state.uaccess && func_uaccess_safe(func)) {
2060                                 WARN_FUNC("return with UACCESS disabled from a UACCESS-safe function", sec, insn->offset);
2061                                 return 1;
2062                         }
2063
2064                         if (state.df) {
2065                                 WARN_FUNC("return with DF set", sec, insn->offset);
2066                                 return 1;
2067                         }
2068
2069                         if (func && has_modified_stack_frame(&state)) {
2070                                 WARN_FUNC("return with modified stack frame",
2071                                           sec, insn->offset);
2072                                 return 1;
2073                         }
2074
2075                         if (state.bp_scratch) {
2076                                 WARN("%s uses BP as a scratch register",
2077                                      func->name);
2078                                 return 1;
2079                         }
2080
2081                         return 0;
2082
2083                 case INSN_CALL:
2084                 case INSN_CALL_DYNAMIC:
2085                         ret = validate_call(insn, &state);
2086                         if (ret)
2087                                 return ret;
2088
2089                         if (!no_fp && func && !is_fentry_call(insn) &&
2090                             !has_valid_stack_frame(&state)) {
2091                                 WARN_FUNC("call without frame pointer save/setup",
2092                                           sec, insn->offset);
2093                                 return 1;
2094                         }
2095
2096                         if (dead_end_function(file, insn->call_dest))
2097                                 return 0;
2098
2099                         break;
2100
2101                 case INSN_JUMP_CONDITIONAL:
2102                 case INSN_JUMP_UNCONDITIONAL:
2103                         if (func && is_sibling_call(insn)) {
2104                                 ret = validate_sibling_call(insn, &state);
2105                                 if (ret)
2106                                         return ret;
2107
2108                         } else if (insn->jump_dest) {
2109                                 ret = validate_branch(file, func,
2110                                                       insn->jump_dest, state);
2111                                 if (ret) {
2112                                         if (backtrace)
2113                                                 BT_FUNC("(branch)", insn);
2114                                         return ret;
2115                                 }
2116                         }
2117
2118                         if (insn->type == INSN_JUMP_UNCONDITIONAL)
2119                                 return 0;
2120
2121                         break;
2122
2123                 case INSN_JUMP_DYNAMIC:
2124                         if (func && is_sibling_call(insn)) {
2125                                 ret = validate_sibling_call(insn, &state);
2126                                 if (ret)
2127                                         return ret;
2128                         }
2129
2130                         return 0;
2131
2132                 case INSN_CONTEXT_SWITCH:
2133                         if (func && (!next_insn || !next_insn->hint)) {
2134                                 WARN_FUNC("unsupported instruction in callable function",
2135                                           sec, insn->offset);
2136                                 return 1;
2137                         }
2138                         return 0;
2139
2140                 case INSN_STACK:
2141                         if (update_insn_state(insn, &state))
2142                                 return 1;
2143
2144                         if (insn->stack_op.dest.type == OP_DEST_PUSHF) {
2145                                 if (!state.uaccess_stack) {
2146                                         state.uaccess_stack = 1;
2147                                 } else if (state.uaccess_stack >> 31) {
2148                                         WARN_FUNC("PUSHF stack exhausted", sec, insn->offset);
2149                                         return 1;
2150                                 }
2151                                 state.uaccess_stack <<= 1;
2152                                 state.uaccess_stack  |= state.uaccess;
2153                         }
2154
2155                         if (insn->stack_op.src.type == OP_SRC_POPF) {
2156                                 if (state.uaccess_stack) {
2157                                         state.uaccess = state.uaccess_stack & 1;
2158                                         state.uaccess_stack >>= 1;
2159                                         if (state.uaccess_stack == 1)
2160                                                 state.uaccess_stack = 0;
2161                                 }
2162                         }
2163
2164                         break;
2165
2166                 case INSN_STAC:
2167                         if (state.uaccess) {
2168                                 WARN_FUNC("recursive UACCESS enable", sec, insn->offset);
2169                                 return 1;
2170                         }
2171
2172                         state.uaccess = true;
2173                         break;
2174
2175                 case INSN_CLAC:
2176                         if (!state.uaccess && func) {
2177                                 WARN_FUNC("redundant UACCESS disable", sec, insn->offset);
2178                                 return 1;
2179                         }
2180
2181                         if (func_uaccess_safe(func) && !state.uaccess_stack) {
2182                                 WARN_FUNC("UACCESS-safe disables UACCESS", sec, insn->offset);
2183                                 return 1;
2184                         }
2185
2186                         state.uaccess = false;
2187                         break;
2188
2189                 case INSN_STD:
2190                         if (state.df)
2191                                 WARN_FUNC("recursive STD", sec, insn->offset);
2192
2193                         state.df = true;
2194                         break;
2195
2196                 case INSN_CLD:
2197                         if (!state.df && func)
2198                                 WARN_FUNC("redundant CLD", sec, insn->offset);
2199
2200                         state.df = false;
2201                         break;
2202
2203                 default:
2204                         break;
2205                 }
2206
2207                 if (insn->dead_end)
2208                         return 0;
2209
2210                 if (!next_insn) {
2211                         if (state.cfa.base == CFI_UNDEFINED)
2212                                 return 0;
2213                         WARN("%s: unexpected end of section", sec->name);
2214                         return 1;
2215                 }
2216
2217                 insn = next_insn;
2218         }
2219
2220         return 0;
2221 }
2222
2223 static int validate_unwind_hints(struct objtool_file *file)
2224 {
2225         struct instruction *insn;
2226         int ret, warnings = 0;
2227         struct insn_state state;
2228
2229         if (!file->hints)
2230                 return 0;
2231
2232         clear_insn_state(&state);
2233
2234         for_each_insn(file, insn) {
2235                 if (insn->hint && !insn->visited) {
2236                         ret = validate_branch(file, insn->func, insn, state);
2237                         if (ret && backtrace)
2238                                 BT_FUNC("<=== (hint)", insn);
2239                         warnings += ret;
2240                 }
2241         }
2242
2243         return warnings;
2244 }
2245
2246 static int validate_retpoline(struct objtool_file *file)
2247 {
2248         struct instruction *insn;
2249         int warnings = 0;
2250
2251         for_each_insn(file, insn) {
2252                 if (insn->type != INSN_JUMP_DYNAMIC &&
2253                     insn->type != INSN_CALL_DYNAMIC)
2254                         continue;
2255
2256                 if (insn->retpoline_safe)
2257                         continue;
2258
2259                 /*
2260                  * .init.text code is ran before userspace and thus doesn't
2261                  * strictly need retpolines, except for modules which are
2262                  * loaded late, they very much do need retpoline in their
2263                  * .init.text
2264                  */
2265                 if (!strcmp(insn->sec->name, ".init.text") && !module)
2266                         continue;
2267
2268                 WARN_FUNC("indirect %s found in RETPOLINE build",
2269                           insn->sec, insn->offset,
2270                           insn->type == INSN_JUMP_DYNAMIC ? "jump" : "call");
2271
2272                 warnings++;
2273         }
2274
2275         return warnings;
2276 }
2277
2278 static bool is_kasan_insn(struct instruction *insn)
2279 {
2280         return (insn->type == INSN_CALL &&
2281                 !strcmp(insn->call_dest->name, "__asan_handle_no_return"));
2282 }
2283
2284 static bool is_ubsan_insn(struct instruction *insn)
2285 {
2286         return (insn->type == INSN_CALL &&
2287                 !strcmp(insn->call_dest->name,
2288                         "__ubsan_handle_builtin_unreachable"));
2289 }
2290
2291 static bool ignore_unreachable_insn(struct instruction *insn)
2292 {
2293         int i;
2294
2295         if (insn->ignore || insn->type == INSN_NOP)
2296                 return true;
2297
2298         /*
2299          * Ignore any unused exceptions.  This can happen when a whitelisted
2300          * function has an exception table entry.
2301          *
2302          * Also ignore alternative replacement instructions.  This can happen
2303          * when a whitelisted function uses one of the ALTERNATIVE macros.
2304          */
2305         if (!strcmp(insn->sec->name, ".fixup") ||
2306             !strcmp(insn->sec->name, ".altinstr_replacement") ||
2307             !strcmp(insn->sec->name, ".altinstr_aux"))
2308                 return true;
2309
2310         /*
2311          * Check if this (or a subsequent) instruction is related to
2312          * CONFIG_UBSAN or CONFIG_KASAN.
2313          *
2314          * End the search at 5 instructions to avoid going into the weeds.
2315          */
2316         if (!insn->func)
2317                 return false;
2318         for (i = 0; i < 5; i++) {
2319
2320                 if (is_kasan_insn(insn) || is_ubsan_insn(insn))
2321                         return true;
2322
2323                 if (insn->type == INSN_JUMP_UNCONDITIONAL) {
2324                         if (insn->jump_dest &&
2325                             insn->jump_dest->func == insn->func) {
2326                                 insn = insn->jump_dest;
2327                                 continue;
2328                         }
2329
2330                         break;
2331                 }
2332
2333                 if (insn->offset + insn->len >= insn->func->offset + insn->func->len)
2334                         break;
2335
2336                 insn = list_next_entry(insn, list);
2337         }
2338
2339         return false;
2340 }
2341
2342 static int validate_functions(struct objtool_file *file)
2343 {
2344         struct section *sec;
2345         struct symbol *func;
2346         struct instruction *insn;
2347         struct insn_state state;
2348         int ret, warnings = 0;
2349
2350         clear_insn_state(&state);
2351
2352         state.cfa = initial_func_cfi.cfa;
2353         memcpy(&state.regs, &initial_func_cfi.regs,
2354                CFI_NUM_REGS * sizeof(struct cfi_reg));
2355         state.stack_size = initial_func_cfi.cfa.offset;
2356
2357         for_each_sec(file, sec) {
2358                 list_for_each_entry(func, &sec->symbol_list, list) {
2359                         if (func->type != STT_FUNC)
2360                                 continue;
2361
2362                         if (!func->len) {
2363                                 WARN("%s() is missing an ELF size annotation",
2364                                      func->name);
2365                                 warnings++;
2366                         }
2367
2368                         if (func->pfunc != func || func->alias != func)
2369                                 continue;
2370
2371                         insn = find_insn(file, sec, func->offset);
2372                         if (!insn || insn->ignore || insn->visited)
2373                                 continue;
2374
2375                         state.uaccess = func->uaccess_safe;
2376
2377                         ret = validate_branch(file, func, insn, state);
2378                         if (ret && backtrace)
2379                                 BT_FUNC("<=== (func)", insn);
2380                         warnings += ret;
2381                 }
2382         }
2383
2384         return warnings;
2385 }
2386
2387 static int validate_reachable_instructions(struct objtool_file *file)
2388 {
2389         struct instruction *insn;
2390
2391         if (file->ignore_unreachables)
2392                 return 0;
2393
2394         for_each_insn(file, insn) {
2395                 if (insn->visited || ignore_unreachable_insn(insn))
2396                         continue;
2397
2398                 WARN_FUNC("unreachable instruction", insn->sec, insn->offset);
2399                 return 1;
2400         }
2401
2402         return 0;
2403 }
2404
2405 static void cleanup(struct objtool_file *file)
2406 {
2407         struct instruction *insn, *tmpinsn;
2408         struct alternative *alt, *tmpalt;
2409
2410         list_for_each_entry_safe(insn, tmpinsn, &file->insn_list, list) {
2411                 list_for_each_entry_safe(alt, tmpalt, &insn->alts, list) {
2412                         list_del(&alt->list);
2413                         free(alt);
2414                 }
2415                 list_del(&insn->list);
2416                 hash_del(&insn->hash);
2417                 free(insn);
2418         }
2419         elf_close(file->elf);
2420 }
2421
2422 static struct objtool_file file;
2423
2424 int check(const char *_objname, bool orc)
2425 {
2426         int ret, warnings = 0;
2427
2428         objname = _objname;
2429
2430         file.elf = elf_read(objname, orc ? O_RDWR : O_RDONLY);
2431         if (!file.elf)
2432                 return 1;
2433
2434         INIT_LIST_HEAD(&file.insn_list);
2435         hash_init(file.insn_hash);
2436         file.c_file = find_section_by_name(file.elf, ".comment");
2437         file.ignore_unreachables = no_unreachable;
2438         file.hints = false;
2439
2440         arch_initial_func_cfi_state(&initial_func_cfi);
2441
2442         ret = decode_sections(&file);
2443         if (ret < 0)
2444                 goto out;
2445         warnings += ret;
2446
2447         if (list_empty(&file.insn_list))
2448                 goto out;
2449
2450         if (retpoline) {
2451                 ret = validate_retpoline(&file);
2452                 if (ret < 0)
2453                         return ret;
2454                 warnings += ret;
2455         }
2456
2457         ret = validate_functions(&file);
2458         if (ret < 0)
2459                 goto out;
2460         warnings += ret;
2461
2462         ret = validate_unwind_hints(&file);
2463         if (ret < 0)
2464                 goto out;
2465         warnings += ret;
2466
2467         if (!warnings) {
2468                 ret = validate_reachable_instructions(&file);
2469                 if (ret < 0)
2470                         goto out;
2471                 warnings += ret;
2472         }
2473
2474         if (orc) {
2475                 ret = create_orc(&file);
2476                 if (ret < 0)
2477                         goto out;
2478
2479                 ret = create_orc_sections(&file);
2480                 if (ret < 0)
2481                         goto out;
2482
2483                 ret = elf_write(file.elf);
2484                 if (ret < 0)
2485                         goto out;
2486         }
2487
2488 out:
2489         cleanup(&file);
2490
2491         /* ignore warnings for now until we get all the code cleaned up */
2492         if (ret || warnings)
2493                 return 0;
2494         return 0;
2495 }