Node筛选算法： 有两个主要的方法，一个是 ~~~ feasibleNodes, err := g.findNodesThatPassFilters(ctx, fwk, state, pod, filteredNodesStatuses) feasibleNodes, err = g.findNodesThatPassExtenders(pod, feasibleNodes, filteredNodesStatuses) ~~~ ~~~ returns the number of feasible nodes that once found, the scheduler stops // its search for more feasible nodes. numNodesToFind := g.numFeasibleNodesToFind(int32(len(allNodes))) 可行的节点数量一旦找到，就停止寻找。 ~~~ ~~~ // Create feasible list with enough space to avoid growing it // and allow assigning. feasibleNodes := make([]*v1.Node, numNodesToFind) 创建足够的list。 ~~~