code: func nodesWherePreemptionMightHelp(nodes []*v1.Node, failedPredicatesMap FailedPredicateMap) []*v1.Node {
  	potentialNodes := []*v1.Node{}
  	for _, node := range nodes {
  		failedPredicates, _ := failedPredicatesMap[node.Name]
  		// If we assume that scheduler looks at all nodes and populates the failedPredicateMap
  		// (which is the case today), the !found case should never happen, but we'd prefer
  		// to rely less on such assumptions in the code when checking does not impose
  		// significant overhead.
  		// Also, we currently assume all failures returned by extender as resolvable.
  		if !unresolvablePredicateExists(failedPredicates) {
  			klog.V(3).Infof("Node %v is a potential node for preemption.", node.Name)
  			potentialNodes = append(potentialNodes, node)
  		}
  	}
  	return potentialNodes
  }
docs: // nodesWherePreemptionMightHelp returns a list of nodes with failed predicates
  // that may be satisfied by removing pods from the node.